FoxIntermediateBackend.Mod 532 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. suppressModuleRegistration=FALSE;
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. StrictChecks = FALSE;
  63. BasePointerTypeSize = 5;
  64. BaseArrayTypeSize = BasePointerTypeSize + 3;
  65. LengthOffset = BasePointerTypeSize + 0;
  66. DataOffset = BasePointerTypeSize + 1;
  67. DescriptorOffset = BasePointerTypeSize + 2;
  68. BaseRecordTypeSize = BasePointerTypeSize + 2;
  69. ActionOffset = BasePointerTypeSize + 0;
  70. MonitorOffset = BasePointerTypeSize + 1;
  71. BaseObjectTypeSize = BaseRecordTypeSize;
  72. ActionTypeSize = 3;
  73. MonitorTypeSize = 7;
  74. ProcessorOffset = BaseObjectTypeSize + 1;
  75. StackLimitOffset* = BaseObjectTypeSize + 3;
  76. QuantumOffset = BaseObjectTypeSize + 4;
  77. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  78. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  79. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  80. Size2Flag = 4; (* size = 2 *)
  81. Size3Flag = 5; (* size = 3 *)
  82. Size4Flag = 6; (* size = 4 *)
  83. Size5Flag = 7; (* size = 5 *)
  84. Size6Flag = 8; (* size = 6 *)
  85. Size7Flag = 9; (* size = 7 *)
  86. Size8Flag = 10; (* size = 8 *)
  87. ReflectionSupport = TRUE;
  88. TYPE
  89. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  90. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  91. Operand = RECORD
  92. mode: SHORTINT;
  93. op: IntermediateCode.Operand;
  94. tag: IntermediateCode.Operand;
  95. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  96. dimOffset: LONGINT;
  97. END;
  98. Fixup= POINTER TO RECORD
  99. pc: LONGINT;
  100. nextFixup: Fixup;
  101. END;
  102. WriteBackCall = POINTER TO RECORD
  103. call: SyntaxTree.ProcedureCallDesignator;
  104. next: WriteBackCall;
  105. END;
  106. Label= OBJECT
  107. VAR
  108. fixups: Fixup;
  109. section: IntermediateCode.Section;
  110. pc: LONGINT;
  111. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  112. BEGIN
  113. SELF.section := section; pc := -1;
  114. END InitLabel;
  115. PROCEDURE Resolve(pc: LONGINT);
  116. VAR at: LONGINT;
  117. BEGIN
  118. SELF.pc := pc;
  119. WHILE(fixups # NIL) DO
  120. at := fixups.pc;
  121. section.PatchAddress(at,pc);
  122. fixups := fixups.nextFixup;
  123. END;
  124. END Resolve;
  125. PROCEDURE AddFixup(at: LONGINT);
  126. VAR fixup: Fixup;
  127. BEGIN
  128. ASSERT(pc=-1);
  129. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  130. END AddFixup;
  131. END Label;
  132. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  133. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  134. VAR
  135. backend: IntermediateBackend;
  136. implementationVisitor: ImplementationVisitor;
  137. meta: MetaDataGenerator;
  138. system: Global.System;
  139. currentScope: SyntaxTree.Scope;
  140. module: Sections.Module;
  141. moduleSelf: SyntaxTree.Variable;
  142. dump: BOOLEAN;
  143. forceModuleBody: BOOLEAN;
  144. addressType: IntermediateCode.Type;
  145. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  146. BEGIN
  147. currentScope := NIL; module := NIL; moduleSelf := NIL;
  148. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  149. SELF.dump := dump;
  150. SELF.backend := backend;
  151. SELF.forceModuleBody := forceModuleBody;
  152. addressType := IntermediateCode.GetType(system,system.addressType)
  153. END Init;
  154. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  155. BEGIN
  156. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  157. END Error;
  158. PROCEDURE Type(x: SyntaxTree.Type);
  159. BEGIN
  160. x.Accept(SELF);
  161. END Type;
  162. (** types **)
  163. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  164. BEGIN (* no code emission *) END VisitBasicType;
  165. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  166. BEGIN (* no code emission *) END VisitCharacterType;
  167. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  168. BEGIN (* no code emission *) END VisitIntegerType;
  169. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  170. BEGIN (* no code emission *) END VisitFloatType;
  171. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  172. BEGIN (* no code emission *) END VisitComplexType;
  173. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  174. VAR type: SyntaxTree.Type;
  175. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  176. type := x.resolved;
  177. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  178. meta.CheckTypeDeclaration(type);
  179. END;
  180. END VisitQualifiedType;
  181. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  182. BEGIN (* no code emission *) END VisitStringType;
  183. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  184. BEGIN (* no code emission *)
  185. END VisitArrayRangeType;
  186. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  187. BEGIN (* no code emission *) END VisitArrayType;
  188. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  189. BEGIN
  190. meta.CheckTypeDeclaration(x);
  191. END VisitMathArrayType;
  192. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  193. BEGIN
  194. meta.CheckTypeDeclaration(x);
  195. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  196. END VisitPointerType;
  197. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  198. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  199. BEGIN (* no code emission *)
  200. meta.CheckTypeDeclaration(x);
  201. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  202. IF x.pointerType.typeDeclaration # NIL THEN
  203. td := x.pointerType.typeDeclaration
  204. ELSE
  205. td := x.typeDeclaration
  206. END;
  207. Global.GetSymbolName(td,name);
  208. (* code section for object *)
  209. END;
  210. Scope(x.recordScope);
  211. END VisitRecordType;
  212. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  213. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  214. BEGIN
  215. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  216. WHILE (this # NIL) & (this.identifier# id) DO
  217. this := this.nextModifier;
  218. END;
  219. RETURN this # NIL
  220. END HasFlag;
  221. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  222. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  223. (*
  224. PROCEDURE CreatePorts(type: SyntaxTree.Type; len: LONGINT);
  225. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  226. BEGIN
  227. FOR i := 0 TO len-1 DO
  228. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  229. CreatePorts(baseType, len*len2);
  230. ELSIF IsSemiDynamicArray(type) THEN
  231. port := MIN(LONGINT); (* unknown port address from here on *)
  232. ELSE
  233. IntermediateCode.InitImmediate(op,addressType,adr);
  234. symbol.Emit(Data(-1,op));
  235. INC(port);
  236. END;
  237. END;
  238. END CreatePorts;
  239. *)
  240. BEGIN
  241. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  242. (*
  243. IF (x.cellScope.ownerModule = module.module) THEN
  244. td := x.typeDeclaration;
  245. Global.GetSymbolSegmentedName(td,name);
  246. (* code section for object *)
  247. END;
  248. *)
  249. (* unnecessary to generate space for ports: already represented as hidden variables *)
  250. (*
  251. port := 0;
  252. parameter := x.firstParameter;
  253. WHILE parameter # NIL DO
  254. type := parameter.type.resolved;
  255. Global.GetSymbolSegmentedName(parameter,name);
  256. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection,name,parameter,dump);
  257. IF port >= 0 THEN
  258. (*! could be used for optimization: query value here ???
  259. parameter.SetResolved(SyntaxTree.NewIntegerValue(-1, port));
  260. *)
  261. END;
  262. CreatePorts(type, 1);
  263. IF backend.cellsAreObjects THEN
  264. IF IsStaticArray(parameter.type.resolved) THEN
  265. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  266. END;
  267. END;
  268. parameter := parameter.nextParameter;
  269. END;
  270. *)
  271. capabilities := {};
  272. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  273. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  274. backend.SetCapabilities(capabilities);
  275. Scope(x.cellScope);
  276. END VisitCellType;
  277. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  278. BEGIN (* no code emission *) END VisitProcedureType;
  279. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  280. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  281. END VisitEnumerationType;
  282. (* symbols *)
  283. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  284. BEGIN
  285. Procedure(x);
  286. END VisitProcedure;
  287. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  288. BEGIN
  289. Procedure(x);
  290. END VisitOperator;
  291. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  292. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i: LONGINT;
  293. BEGIN
  294. IF x.externalName # NIL THEN RETURN END;
  295. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  296. (* code section for variable *)
  297. Global.GetSymbolSegmentedName(x,name);
  298. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  299. irv.SetExported(IsExported(x));
  300. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  301. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  302. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  303. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  304. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  305. FOR i := 0 TO DynamicDim(x.type)-1 DO
  306. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  307. END;
  308. ELSE
  309. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))));
  310. IF ~x.fixed THEN
  311. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  312. ELSE
  313. align := x.alignment;
  314. END;
  315. irv.SetPositionOrAlignment(x.fixed, align);
  316. meta.CheckTypeDeclaration(x.type);
  317. END;
  318. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  319. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  320. END;
  321. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  322. END VisitVariable;
  323. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  324. VAR name: Basic.SegmentedName; irv, irl: IntermediateCode.Section; op: Operand; dim: LONGINT;
  325. BEGIN
  326. HALT(100);
  327. (*
  328. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  329. (* code section for variable *)
  330. Global.GetSymbolSegmentedName(x,name);
  331. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  332. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  333. (*
  334. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  335. *)
  336. IF IsSemiDynamicArray(x.type) & ~backend.cellsAreObjects THEN
  337. HALT(100);
  338. irv.Emit(Reserve(x.position, system.addressSize));
  339. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  340. irl := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  341. irl.Emit(Reserve(x.position, DynamicDim(x.type) * system.addressSize));
  342. ELSIF x.defaultValue = NIL THEN
  343. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  344. ELSE
  345. implementationVisitor.inData := TRUE;
  346. implementationVisitor.Evaluate(x.defaultValue, op);
  347. irv.Emit(Data(x.position,op.op));
  348. implementationVisitor.inData := FALSE;
  349. END;
  350. meta.CheckTypeDeclaration(x.type);
  351. *)
  352. END VisitParameter;
  353. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  354. BEGIN
  355. Type(x.declaredType); (* => code in objects *)
  356. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  357. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  358. END;
  359. END VisitTypeDeclaration;
  360. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  361. BEGIN
  362. IF (SyntaxTree.Public * x.access # {}) THEN
  363. implementationVisitor.VisitConstant(x);
  364. END;
  365. END VisitConstant;
  366. PROCEDURE Scope(x: SyntaxTree.Scope);
  367. VAR procedure: SyntaxTree.Procedure;
  368. constant: SyntaxTree.Constant;
  369. variable: SyntaxTree.Variable;
  370. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  371. BEGIN
  372. prevScope := currentScope;
  373. currentScope := x;
  374. (* constants treated in implementation visitor *)
  375. typeDeclaration := x.firstTypeDeclaration;
  376. WHILE typeDeclaration # NIL DO
  377. VisitTypeDeclaration(typeDeclaration);
  378. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  379. END;
  380. variable := x.firstVariable;
  381. WHILE variable # NIL DO
  382. VisitVariable(variable);
  383. variable := variable.nextVariable;
  384. END;
  385. procedure := x.firstProcedure;
  386. WHILE procedure # NIL DO
  387. VisitProcedure(procedure);
  388. procedure := procedure.nextProcedure;
  389. END;
  390. constant := x.firstConstant;
  391. WHILE constant # NIL DO
  392. VisitConstant(constant);
  393. constant := constant.nextConstant;
  394. END;
  395. currentScope := prevScope;
  396. END Scope;
  397. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  398. VAR parameter: SyntaxTree.Parameter;
  399. BEGIN
  400. parameter := first;
  401. WHILE parameter # NIL DO
  402. VisitParameter(parameter);
  403. parameter := parameter.nextParameter;
  404. END;
  405. END Parameters;
  406. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  407. VAR scope: SyntaxTree.ProcedureScope;
  408. prevScope: SyntaxTree.Scope;
  409. inline, finalizer: BOOLEAN;
  410. procedureType: SyntaxTree.ProcedureType;
  411. pc: LONGINT;
  412. stackSize: LONGINT;
  413. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  414. null,size,src,dest,fp,res: IntermediateCode.Operand;
  415. cc: LONGINT;
  416. cellType: SyntaxTree.CellType;
  417. registerNumber: LONGINT;
  418. registerClass: IntermediateCode.RegisterClass;
  419. type: IntermediateCode.Type;
  420. formalParameter: SyntaxTree.Parameter;
  421. recordType: SyntaxTree.RecordType;
  422. isModuleBody: BOOLEAN;
  423. PROCEDURE Signature;
  424. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  425. BEGIN
  426. procedureType := x.type(SyntaxTree.ProcedureType);
  427. returnType := procedureType.returnType;
  428. IF returnType # NIL THEN
  429. meta.CheckTypeDeclaration(returnType)
  430. END;
  431. parameter := procedureType.firstParameter;
  432. WHILE parameter # NIL DO
  433. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  434. parameter := parameter.nextParameter;
  435. END;
  436. END Signature;
  437. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  438. VAR result: BOOLEAN;
  439. BEGIN
  440. result := FALSE;
  441. IF x = SyntaxTree.invalidExpression THEN
  442. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  443. result := TRUE;
  444. value := x.resolved(SyntaxTree.IntegerValue).value;
  445. ELSE
  446. Error(x.position,"expression is not an integer constant");
  447. END;
  448. RETURN result;
  449. END CheckIntegerValue;
  450. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  451. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  452. BEGIN
  453. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  454. WHILE (this # NIL) & (this.identifier # id) DO
  455. this := this.nextModifier;
  456. END;
  457. IF this # NIL THEN
  458. IF this.expression = NIL THEN
  459. Error(this.position,"expected expression value");
  460. ELSIF CheckIntegerValue(this.expression,value) THEN
  461. END;
  462. RETURN TRUE
  463. ELSE RETURN FALSE
  464. END;
  465. END HasValue;
  466. CONST DefaultDataMemorySize=512;
  467. BEGIN
  468. IF x.externalName # NIL THEN RETURN END;
  469. (*
  470. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  471. *)
  472. (* code section for this procedure *)
  473. scope := x.procedureScope;
  474. prevScope := currentScope;
  475. currentScope := scope;
  476. procedureType := x.type(SyntaxTree.ProcedureType);
  477. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  478. implementationVisitor.temporaries.Init;
  479. implementationVisitor.usedRegisters := NIL;
  480. implementationVisitor.registerUsageCount.Init;
  481. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  482. IF (scope.body # NIL) & (x.isInline) THEN
  483. inline := TRUE;
  484. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  485. ir.SetExported(IsExported(x));
  486. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  487. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  488. IF backend.cellsAreObjects THEN
  489. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  490. ir.SetExported(IsExported(x));
  491. ELSE
  492. RETURN; (* cellnet cannot be compiled for final static hardware *)
  493. END;
  494. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  495. inline := FALSE;
  496. AddBodyCallStub(x);
  497. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  498. ir.SetExported(IsExported(x));
  499. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  500. inline := FALSE;
  501. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  502. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  503. AddBodyCallStub(x);
  504. AddStackAllocation(x,stackSize);
  505. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  506. ir.SetExported(IsExported(x));
  507. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  508. inline := FALSE;
  509. Parameters(procedureType.firstParameter);
  510. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  511. ir.SetExported(IsExported(x));
  512. ELSE
  513. inline := FALSE;
  514. IF x.isEntry OR x.isExit THEN
  515. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  516. ir.SetExported(TRUE);
  517. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  518. ELSE
  519. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  520. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  521. END;
  522. END;
  523. cc := procedureType.callingConvention;
  524. IF scope.body # NIL THEN
  525. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  526. registerNumber := 0;
  527. IF ~inline THEN
  528. IF scope.lastVariable = NIL THEN
  529. stackSize := 0
  530. ELSE
  531. stackSize := scope.lastVariable.offsetInBits;
  532. IF stackSize <0 THEN stackSize := -stackSize END;
  533. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  534. END;
  535. (*
  536. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  537. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  538. *)
  539. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  540. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  541. END;
  542. pc := ir.pc-1;
  543. (*
  544. ir.Emit(Nop(position)); (* placeholder for fill *)
  545. *)
  546. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  547. formalParameter := procedureType.lastParameter;
  548. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  549. IF ~PassInRegister(formalParameter) THEN
  550. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  551. ELSE
  552. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  553. type := GetType(system, formalParameter.type);
  554. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  555. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  556. ir.Emit(Mov(-1,dest, src));
  557. implementationVisitor.ReleaseIntermediateOperand(src);
  558. INC(registerNumber);
  559. formalParameter := formalParameter.prevParameter;
  560. END;
  561. END;
  562. END;
  563. ir.EnterValidPAF;
  564. END;
  565. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  566. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  567. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  568. IF scope.lastVariable # NIL THEN
  569. stackSize := scope.lastVariable.offsetInBits;
  570. IF stackSize <0 THEN stackSize := -stackSize END;
  571. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  572. END;
  573. END;
  574. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  575. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  576. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  577. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  578. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  579. ir.EmitAt(pc,Push(size));
  580. implementationVisitor.StaticCallOperand(result,procedure);
  581. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  582. END;
  583. *)
  584. END;
  585. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  586. IF stackSize > 0 THEN
  587. IF (stackSize MOD system.addressSize = 0) THEN
  588. null := IntermediateCode.Immediate(addressType,0);
  589. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  590. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  591. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  592. ELSE
  593. null := IntermediateCode.Immediate(int8,0);
  594. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  595. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  596. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  597. END;
  598. (*! should potentially be called by backend -- enter might initialize
  599. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  600. *)
  601. END;
  602. ir.ExitValidPAF;
  603. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  604. finalizer := FALSE;
  605. IF backend.cooperative & x.isFinalizer THEN
  606. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  607. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  608. GetRecordTypeName(recordType,name);
  609. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  610. END;
  611. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  612. IF backend.cooperative THEN
  613. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  614. IF implementationVisitor.profile & ~isModuleBody THEN
  615. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  616. END;
  617. END;
  618. implementationVisitor.EmitLeave(ir, x.position,cc);
  619. IF finalizer THEN
  620. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  621. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  622. ir.Emit(Br(x.position,dest));
  623. ELSE
  624. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  625. END;
  626. ELSE
  627. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  628. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  629. END;
  630. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  631. IF backend.cooperative THEN
  632. IF HasPointers (scope) THEN
  633. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  634. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  635. ir.Emit(Result(x.position, res));
  636. ir.Emit(Push(x.position, res));
  637. implementationVisitor.ResetVariables(scope);
  638. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  639. ir.Emit(Pop(x.position, res));
  640. ir.Emit(Return(x.position, res));
  641. ELSE
  642. implementationVisitor.ResetVariables(scope);
  643. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  644. END;
  645. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  646. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  647. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  648. ir.Emit(Result(x.position, res));
  649. ir.Emit(Push(x.position, res));
  650. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  651. ir.Emit(Pop(x.position, res));
  652. ir.Emit(Return(x.position, res));
  653. ELSE
  654. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  655. END;
  656. END;
  657. implementationVisitor.EmitLeave(ir,x.position,cc);
  658. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  659. ELSE
  660. ir.Emit(Nop(x.position));
  661. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  662. implementationVisitor.EmitLeave(ir,x.position,cc);
  663. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  664. END;
  665. END;
  666. END
  667. END;
  668. ELSE (* force body for procedures *)
  669. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  670. ir.EnterValidPAF;
  671. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  672. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  673. ir.ExitValidPAF;
  674. implementationVisitor.EmitLeave(ir,x.position,cc);
  675. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  676. END;
  677. Scope(scope);
  678. Signature;
  679. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  680. currentScope := prevScope;
  681. END Procedure;
  682. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  683. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  684. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  685. BEGIN
  686. ASSERT (bodyProcedure # NIL);
  687. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  688. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  689. procedure.SetScope(bodyProcedure.scope);
  690. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  691. procedure.SetAccess(SyntaxTree.Hidden);
  692. Global.GetSymbolSegmentedName (procedure,name);
  693. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  694. ir.SetExported(TRUE);
  695. ir.SetPriority(InitPriority);
  696. Global.GetSymbolSegmentedName (bodyProcedure,name);
  697. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  698. implementationVisitor.currentScope := module.module.moduleScope;
  699. implementationVisitor.section := ir;
  700. implementationVisitor.PushSelfPointer();
  701. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  702. ELSIF backend.preregisterStatic THEN
  703. implementationVisitor.currentScope := module.module.moduleScope;
  704. implementationVisitor.section := ir;
  705. implementationVisitor.PushSelfPointer();
  706. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  707. ELSE
  708. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  709. ir.Emit(Call(bodyProcedure.position,op, 0));
  710. END;
  711. END AddBodyCallStub;
  712. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  713. VAR name: Basic.SegmentedName;
  714. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  715. BEGIN
  716. Global.GetSymbolSegmentedName (symbol,name);
  717. Basic.RemoveSuffix(name);
  718. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  719. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  720. ir.SetExported(TRUE);
  721. ir.SetPriority(FirstPriority);
  722. IntermediateCode.InitImmediate(op,addressType,initStack);
  723. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  724. END AddStackAllocation;
  725. (** entry function to visit a complete module *)
  726. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  727. VAR
  728. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  729. hasDynamicOperatorDeclarations: BOOLEAN;
  730. operator: SyntaxTree.Operator;
  731. import: SyntaxTree.Import;
  732. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  733. BEGIN
  734. type := type.resolved;
  735. IF type IS SyntaxTree.RecordType THEN
  736. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  737. ELSIF (type IS SyntaxTree.ArrayType) THEN
  738. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  739. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  740. END;
  741. ELSIF type IS SyntaxTree.MathArrayType THEN
  742. WITH type: SyntaxTree.MathArrayType DO
  743. IF type.form = SyntaxTree.Open THEN
  744. RETURN TRUE
  745. ELSIF type.form = SyntaxTree.Static THEN
  746. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  747. END;
  748. END;
  749. END;
  750. RETURN FALSE
  751. END TypeNeedsInitialization;
  752. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  753. VAR variable: SyntaxTree.Variable;
  754. BEGIN
  755. variable := scope.firstVariable;
  756. WHILE variable # NIL DO
  757. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  758. IF variable.initializer # NIL THEN RETURN TRUE END;
  759. variable := variable.nextVariable;
  760. END;
  761. RETURN FALSE
  762. END ScopeNeedsInitialization;
  763. BEGIN
  764. ASSERT(x # NIL); ASSERT(module # NIL);
  765. SELF.module := module;
  766. (* add import names to the generated Sections.Module *)
  767. import := x.moduleScope.firstImport;
  768. WHILE import # NIL DO
  769. import.module.GetName(idstr);
  770. module.imports.AddName(idstr);
  771. import := import.nextImport
  772. END;
  773. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  774. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  775. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  776. moduleSelf.SetType(system.anyType);
  777. moduleSelf.SetScope(x.moduleScope);
  778. moduleSelf.SetUntraced(TRUE);
  779. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  780. ir.SetExported(TRUE);
  781. IntermediateCode.InitImmediate(op,addressType,0);
  782. ir.Emit(Data(-1,op));
  783. END;
  784. implementationVisitor.module := module;
  785. implementationVisitor.moduleScope := x.moduleScope;
  786. implementationVisitor.moduleSelf := moduleSelf;
  787. implementationVisitor.canBeLoaded := TRUE;
  788. meta.SetModule(module);
  789. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  790. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  791. END;
  792. IF backend.profile THEN
  793. EnsureBodyProcedure(x.moduleScope);
  794. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  795. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  796. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  797. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  798. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  799. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  800. Global.GetModuleName(module.module,idstr);
  801. implementationVisitor.ProfilerAddModule(idstr);
  802. implementationVisitor.numberProcedures := 0;
  803. END;
  804. implementationVisitor.profile := backend.profile;
  805. (* check if there is at least one dynamic operator locally defined *)
  806. hasDynamicOperatorDeclarations := FALSE;
  807. operator := x.moduleScope.firstOperator;
  808. WHILE operator # NIL DO
  809. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  810. operator := operator.nextOperator
  811. END;
  812. (* add operator initialization code section *)
  813. IF hasDynamicOperatorDeclarations THEN
  814. EnsureBodyProcedure(x.moduleScope);
  815. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  816. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  817. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  818. END;
  819. Scope(x.moduleScope);
  820. IF hasDynamicOperatorDeclarations THEN
  821. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  822. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  823. END;
  824. IF backend.profile THEN
  825. implementationVisitor.ProfilerPatchInit;
  826. END;
  827. END Module;
  828. END DeclarationVisitor;
  829. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  830. RegisterUsageCount*=OBJECT
  831. VAR used: UsedArray; count: LONGINT;
  832. PROCEDURE &Init;
  833. VAR i: LONGINT;
  834. BEGIN
  835. count := 0;
  836. IF used = NIL THEN NEW(used,64); END;
  837. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  838. END Init;
  839. PROCEDURE Grow;
  840. VAR new: UsedArray; size,i: LONGINT;
  841. BEGIN
  842. size := LEN(used)*2;
  843. NEW(new,size);
  844. FOR i := 0 TO LEN(used)-1 DO
  845. new[i].count := used[i].count;
  846. new[i].type := used[i].type;
  847. new[i].map := used[i].map
  848. END;
  849. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  850. used := new
  851. END Grow;
  852. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  853. BEGIN
  854. INC(count);
  855. IF count = LEN(used) THEN Grow END;
  856. used[count].type := type;
  857. used[count].class := class;
  858. used[count].map := count;
  859. RETURN count;
  860. END Next;
  861. PROCEDURE IncUse(register: LONGINT);
  862. BEGIN
  863. INC(used[register].count);
  864. (*
  865. IF (register = 1) & (count > 30) THEN
  866. D.TraceBack;
  867. END;
  868. *)
  869. END IncUse;
  870. PROCEDURE DecUse(register: LONGINT);
  871. BEGIN
  872. DEC(used[register].count);
  873. END DecUse;
  874. PROCEDURE Map(register: LONGINT): LONGINT;
  875. VAR map : LONGINT;
  876. BEGIN
  877. IF register > 0 THEN
  878. map := used[register].map;
  879. WHILE register # map DO register := map; map := used[register].map END;
  880. END;
  881. RETURN register
  882. END Map;
  883. PROCEDURE Use(register: LONGINT): LONGINT;
  884. BEGIN
  885. IF register< LEN(used) THEN
  886. RETURN used[register].count
  887. ELSE
  888. RETURN 0
  889. END
  890. END Use;
  891. END RegisterUsageCount;
  892. RegisterEntry = POINTER TO RECORD
  893. prev,next: RegisterEntry;
  894. register: LONGINT;
  895. registerClass: IntermediateCode.RegisterClass;
  896. type: IntermediateCode.Type;
  897. END;
  898. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  899. Variables = OBJECT (Basic.List)
  900. VAR
  901. inUse: VariableUse;
  902. registerIndex: LONGINT;
  903. PROCEDURE & Init;
  904. VAR i: LONGINT;
  905. BEGIN
  906. InitList(16);
  907. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  908. registerIndex := 1024;
  909. END Init;
  910. PROCEDURE GetUsage(VAR use: VariableUse);
  911. BEGIN
  912. use := inUse;
  913. END GetUsage;
  914. PROCEDURE SetUsage(CONST use: VariableUse);
  915. BEGIN
  916. inUse := use;
  917. END SetUsage;
  918. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  919. VAR any: ANY;
  920. BEGIN
  921. any := Get(i);;
  922. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  923. END GetVariable;
  924. PROCEDURE Occupy(pos: LONGINT);
  925. BEGIN
  926. INCL(inUse[pos DIV 32], pos MOD 32);
  927. END Occupy;
  928. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  929. BEGIN
  930. Occupy(Length());
  931. Add(v);
  932. END AddVariable;
  933. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  934. VAR var : SyntaxTree.Variable;
  935. BEGIN
  936. FOR pos := 0 TO Length()-1 DO
  937. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  938. var := GetVariable(pos);
  939. IF type.SameType(var.type) THEN
  940. Occupy(pos); RETURN var
  941. END;
  942. END;
  943. END;
  944. pos := Length();
  945. RETURN NIL
  946. END GetFreeVariable;
  947. END Variables;
  948. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  949. SymbolMapper = OBJECT
  950. VAR
  951. first: SymbolMap;
  952. PROCEDURE & Init;
  953. BEGIN
  954. first := NIL;
  955. END Init;
  956. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  957. VAR new: SymbolMap;
  958. BEGIN
  959. NEW(new); new.this := this; new.to := to; new.tag := tag;
  960. new.next := first; first := new;
  961. END Add;
  962. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  963. VAR s: SymbolMap;
  964. BEGIN
  965. s := first;
  966. WHILE (s # NIL) & (s.this # this) DO
  967. s := s.next
  968. END;
  969. RETURN s
  970. END Get;
  971. END SymbolMapper;
  972. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  973. VAR
  974. system: Global.System;
  975. section: IntermediateCode.Section;
  976. module: Sections.Module;
  977. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  978. awaitProcCounter, labelId, constId, caseId: LONGINT;
  979. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  980. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  981. checker: SemanticChecker.Checker;
  982. backend: IntermediateBackend;
  983. meta: MetaDataGenerator;
  984. position: LONGINT;
  985. moduleSelf: SyntaxTree.Variable;
  986. (* variables for hand over of variables / temporary state *)
  987. currentScope: SyntaxTree.Scope;
  988. constantDeclaration : SyntaxTree.Symbol;
  989. result: Operand; (* result of the most recent expression / statement *)
  990. destination: IntermediateCode.Operand;
  991. arrayDestinationTag: IntermediateCode.Operand;
  992. arrayDestinationDimension:LONGINT;
  993. currentLoop: Label; (* variable to hand over loop exit jump list *)
  994. conditional: BOOLEAN;
  995. trueLabel, falseLabel, exitLabel: Label;
  996. locked: BOOLEAN;
  997. (*
  998. usedRegisters: Registers;
  999. *)
  1000. registerUsageCount: RegisterUsageCount;
  1001. usedRegisters: RegisterEntry;
  1002. (* useful operands and types *)
  1003. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1004. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1005. commentPrintout: Printout.Printer;
  1006. dump: Streams.Writer;
  1007. tagsAvailable : BOOLEAN;
  1008. supportedInstruction: SupportedInstructionProcedure;
  1009. supportedImmediate: SupportedImmediateProcedure;
  1010. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1011. emitLabels: BOOLEAN;
  1012. runtimeModuleName : SyntaxTree.IdentifierString;
  1013. newObjectFile: BOOLEAN;
  1014. indexCounter: LONGINT;
  1015. profile: BOOLEAN;
  1016. profileId, profileInit: IntermediateCode.Section;
  1017. profileInitPatchPosition: LONGINT;
  1018. numberProcedures: LONGINT;
  1019. procedureResultDesignator : SyntaxTree.Designator;
  1020. operatorInitializationCodeSection: IntermediateCode.Section;
  1021. fingerPrinter: FingerPrinter.FingerPrinter;
  1022. temporaries: Variables;
  1023. canBeLoaded : BOOLEAN;
  1024. currentIsInline: BOOLEAN;
  1025. currentMapper: SymbolMapper;
  1026. currentInlineExit: Label;
  1027. moduleBodySection: IntermediateCode.Section;
  1028. NeedDescriptor : BOOLEAN;
  1029. cooperativeSwitches: BOOLEAN;
  1030. lastSwitchPC: LONGINT;
  1031. isUnchecked: BOOLEAN;
  1032. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1033. newObjectFile: BOOLEAN);
  1034. BEGIN
  1035. SELF.system := system;
  1036. SELF.runtimeModuleName := runtime;
  1037. currentScope := NIL;
  1038. hiddenPointerType := NIL;
  1039. delegatePointerType := NIL;
  1040. awaitProcCounter := 0;
  1041. labelId := 0; constId := 0; labelId := 0;
  1042. SELF.checker := checker;
  1043. SELF.backend := backend;
  1044. position := Diagnostics.Invalid;
  1045. conditional := FALSE;
  1046. locked := FALSE;
  1047. InitOperand(result,ModeUndefined);
  1048. addressType := IntermediateCode.GetType(system,system.addressType);
  1049. setType := IntermediateCode.GetType(system,system.setType);
  1050. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1051. byteType := IntermediateCode.GetType(system, system.byteType);
  1052. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1053. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1054. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1055. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1056. nil := IntermediateCode.Immediate(addressType,0);
  1057. IntermediateCode.InitOperand(destination);
  1058. tagsAvailable := TRUE;
  1059. supportedInstruction := supportedInstructionProcedure;
  1060. supportedImmediate := supportedImmediateProcedure;
  1061. inData := FALSE;
  1062. SELF.emitLabels := emitLabels;
  1063. IntermediateCode.InitOperand(arrayDestinationTag);
  1064. bool := IntermediateCode.GetType(system,system.booleanType);
  1065. IntermediateCode.InitImmediate(false,bool,0);
  1066. IntermediateCode.InitImmediate(true,bool,1);
  1067. SELF.newObjectFile := newObjectFile;
  1068. indexCounter := 0;
  1069. NEW(registerUsageCount);
  1070. usedRegisters := NIL;
  1071. procedureResultDesignator := NIL;
  1072. NEW(fingerPrinter, system);
  1073. NEW(temporaries);
  1074. currentIsInline := FALSE;
  1075. NeedDescriptor := FALSE;
  1076. isUnchecked := backend.noRuntimeChecks;
  1077. END Init;
  1078. TYPE Context = RECORD
  1079. section: IntermediateCode.Section;
  1080. registerUsageCount: RegisterUsageCount;
  1081. usedRegisters: RegisterEntry;
  1082. END;
  1083. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1084. VAR context: Context;
  1085. BEGIN
  1086. context.section := section;
  1087. context.registerUsageCount := registerUsageCount;
  1088. context.usedRegisters := usedRegisters;
  1089. section := new;
  1090. NEW(registerUsageCount);
  1091. usedRegisters := NIL;
  1092. RETURN context;
  1093. END SwitchContext;
  1094. PROCEDURE ReturnToContext(context: Context);
  1095. BEGIN
  1096. section := context.section;
  1097. registerUsageCount := context.registerUsageCount;
  1098. usedRegisters := context.usedRegisters;
  1099. END ReturnToContext;
  1100. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1101. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1102. BEGIN
  1103. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1104. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1105. END;
  1106. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1107. section.SetExported(IsExported(syntaxTreeSymbol));
  1108. RETURN section
  1109. END NewSection;
  1110. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1111. VAR new: LONGINT;
  1112. BEGIN
  1113. new := registerUsageCount.Next(type,class);
  1114. UseRegister(new);
  1115. RETURN new
  1116. END AcquireRegister;
  1117. (** get the name for the code section that represens a certain symbol
  1118. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1119. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1120. VAR
  1121. operatorFingerPrint: SyntaxTree.FingerPrint;
  1122. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1123. BEGIN
  1124. Global.GetSymbolSegmentedName(symbol, name);
  1125. (* if the symbol is an operator, then append the fingerprint to the name *)
  1126. IF symbol IS SyntaxTree.Operator THEN
  1127. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1128. string := "[";
  1129. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1130. Strings.Append(string, operatorFingerPrintString);
  1131. Strings.Append(string, "]");
  1132. Basic.AppendToSegmentedName(name,string);
  1133. END
  1134. END GetCodeSectionNameForSymbol;
  1135. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1136. BEGIN
  1137. IF dump # NIL THEN
  1138. dump.String("enter "); dump.String(s); dump.Ln;
  1139. END;
  1140. END TraceEnter;
  1141. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1142. BEGIN
  1143. IF dump # NIL THEN
  1144. dump.String("exit "); dump.String(s); dump.Ln;
  1145. END;
  1146. END TraceExit;
  1147. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1148. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1149. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1150. VAR i: LONGINT;
  1151. BEGIN
  1152. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1153. IF op.rule # NIL THEN
  1154. FOR i := 0 TO LEN(op.rule)-1 DO
  1155. CheckRegister(op.rule[i])
  1156. END;
  1157. END;
  1158. END CheckRegister;
  1159. BEGIN
  1160. CheckRegister(instruction.op1);
  1161. CheckRegister(instruction.op2);
  1162. CheckRegister(instruction.op3);
  1163. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1164. ELSE section.Emit(instruction);
  1165. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1166. END;
  1167. END Emit;
  1168. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1169. BEGIN
  1170. IF backend.cooperative THEN
  1171. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1172. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1173. ELSE
  1174. Emit(Trap(position,trapNo));
  1175. END;
  1176. END EmitTrap;
  1177. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1178. VAR name: Basic.SegmentedName;
  1179. VAR op1, op2, reg: IntermediateCode.Operand;
  1180. VAR call, nocall: Label;
  1181. VAR parametersSize: LONGINT;
  1182. VAR prevSection: IntermediateCode.Section;
  1183. VAR prevDump: Streams.Writer;
  1184. VAR body: SyntaxTree.Body;
  1185. BEGIN
  1186. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1187. prevSection := SELF.section;
  1188. SELF.section := section;
  1189. prevDump := dump;
  1190. dump := section.comments;
  1191. IF backend.hasLinkRegister THEN
  1192. Emit(Push(-1, lr));
  1193. END;
  1194. Emit(Push(-1,fp));
  1195. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1196. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1197. GetCodeSectionNameForSymbol(procedure, name);
  1198. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1199. ELSE
  1200. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1201. END;
  1202. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1203. Emit(Push(-1,op1));
  1204. Emit(Mov(-1,fp, sp));
  1205. body := procedure.procedureScope.body;
  1206. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1207. NEW(call, section);
  1208. NEW(nocall, section);
  1209. reg := NewRegisterOperand(addressType);
  1210. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1211. Emit(Sub(-1,reg, sp, op1));
  1212. BrltL(call, sp, reg);
  1213. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1214. BrgeL(nocall, sp, op2);
  1215. call.Resolve(section.pc);
  1216. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1217. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1218. Emit(Push(-1, op2));
  1219. Emit(Push(-1, reg));
  1220. ReleaseIntermediateOperand(reg);
  1221. CallThis(position, "Activities","ExpandStack",2);
  1222. Emit(Result(-1, sp));
  1223. nocall.Resolve(section.pc);
  1224. END;
  1225. ELSE
  1226. Emit(Mov(-1, fp, sp));
  1227. END;
  1228. Emit(Enter(-1, callconv, varSize));
  1229. SELF.section := prevSection;
  1230. dump := prevDump;
  1231. END EmitEnter;
  1232. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1233. VAR op1,op2: IntermediateCode.Operand;
  1234. VAR instruction: IntermediateCode.Instruction;
  1235. BEGIN
  1236. IntermediateCode.InitNumber(op1,callconv);
  1237. IntermediateCode.InitNumber(op2,varSize);
  1238. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1239. RETURN instruction
  1240. END Enter;
  1241. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1242. VAR op1: IntermediateCode.Operand;
  1243. VAR instruction: IntermediateCode.Instruction;
  1244. BEGIN
  1245. IntermediateCode.InitNumber(op1,callconv);
  1246. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1247. RETURN instruction
  1248. END Leave;
  1249. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1250. VAR prevSection: IntermediateCode.Section;
  1251. VAR op2: IntermediateCode.Operand;
  1252. BEGIN
  1253. prevSection := SELF.section;
  1254. SELF.section := section;
  1255. Emit(Leave(position, callconv));
  1256. IF backend.cooperative THEN
  1257. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1258. Emit(Add(position, sp, fp, op2));
  1259. ELSE
  1260. Emit(Mov(position, sp, fp));
  1261. END;
  1262. Emit(Pop(position, fp));
  1263. SELF.section := prevSection;
  1264. END EmitLeave;
  1265. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1266. VAR m: SymbolMap;
  1267. BEGIN
  1268. position := x.position;
  1269. IF currentIsInline THEN
  1270. m := currentMapper.Get(x);
  1271. IF m # NIL THEN
  1272. (*
  1273. Printout.Info("mapping from", x);
  1274. Printout.Info("mapping to ", m.to);
  1275. *)
  1276. m.to.Accept(SELF);
  1277. op := result;
  1278. IF m.tag # NIL THEN
  1279. ReleaseIntermediateOperand(result.tag);
  1280. m.tag.Accept(SELF);
  1281. op.tag := result.op;
  1282. ReleaseIntermediateOperand(result.tag);
  1283. END;
  1284. RETURN
  1285. END;
  1286. END;
  1287. x.Accept(SELF);
  1288. op := result;
  1289. END Symbol;
  1290. PROCEDURE Expression(x: SyntaxTree.Expression);
  1291. BEGIN
  1292. position := x.position;
  1293. constantDeclaration := NIL;
  1294. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1295. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1296. END;
  1297. IF x.resolved # NIL THEN
  1298. x.resolved.Accept(SELF)
  1299. ELSE
  1300. x.Accept(SELF)
  1301. END;
  1302. (* check this, was commented out in ActiveCells3 *)
  1303. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1304. Error(x.position, "unsupported modifier");
  1305. END;
  1306. END Expression;
  1307. (*
  1308. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1309. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1310. BEGIN
  1311. temporaries.GetUsage(current);
  1312. FOR i := 0 TO LEN(current)-1 DO
  1313. set := current[i] - previous[i];
  1314. IF set # {} THEN
  1315. FOR j := 0 TO MAX(SET)-1 DO
  1316. IF j IN set THEN
  1317. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1318. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1319. Symbol(variable, op);
  1320. MakeMemory(tmp,op.op,addressType,0);
  1321. ReleaseOperand(op);
  1322. Emit(Mov(position,tmp, nil ) );
  1323. ReleaseIntermediateOperand(tmp);
  1324. END;
  1325. END;
  1326. END;
  1327. END;
  1328. END;
  1329. END ResetUsedTemporaries;
  1330. *)
  1331. PROCEDURE Statement(x: SyntaxTree.Statement);
  1332. VAR use: VariableUse;
  1333. BEGIN
  1334. temporaries.GetUsage(use);
  1335. position := x.position;
  1336. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1337. IF commentPrintout # NIL THEN
  1338. commentPrintout.Statement(x);
  1339. dump.Ln;
  1340. (*dump.Update;*)
  1341. END;
  1342. x.Accept(SELF);
  1343. (*
  1344. CheckRegistersFree();
  1345. *)
  1346. (*ResetUsedTemporaries(use);*)
  1347. temporaries.SetUsage(use);
  1348. END Statement;
  1349. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1350. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1351. *)
  1352. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1353. BEGIN
  1354. IF op.mode = IntermediateCode.ModeMemory THEN
  1355. ReuseCopy(res,op);
  1356. ELSE
  1357. res := op;
  1358. UseIntermediateOperand(res);
  1359. END;
  1360. IntermediateCode.AddOffset(res,offset);
  1361. IntermediateCode.MakeMemory(res,type);
  1362. END MakeMemory;
  1363. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1364. VAR mem: IntermediateCode.Operand;
  1365. BEGIN
  1366. MakeMemory(mem,res,type,offset);
  1367. ReleaseIntermediateOperand(res);
  1368. res := mem;
  1369. END ToMemory;
  1370. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1371. VAR mem: IntermediateCode.Operand;
  1372. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1373. componentType: SyntaxTree.Type;
  1374. BEGIN
  1375. type := type.resolved;
  1376. IF operand.mode = ModeReference THEN
  1377. IF type IS SyntaxTree.RangeType THEN
  1378. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1379. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1380. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1381. ReleaseOperand(operand);
  1382. operand.op := firstOp;
  1383. operand.tag := lastOp;
  1384. operand.extra := stepOp;
  1385. ELSIF type IS SyntaxTree.ComplexType THEN
  1386. componentType := type(SyntaxTree.ComplexType).componentType;
  1387. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1388. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1389. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1390. ReleaseOperand(operand);
  1391. operand.op := firstOp;
  1392. operand.tag := lastOp
  1393. ELSE
  1394. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1395. ReleaseIntermediateOperand(operand.op);
  1396. operand.op := mem;
  1397. END;
  1398. operand.mode := ModeValue;
  1399. END;
  1400. ASSERT(operand.mode = ModeValue);
  1401. END LoadValue;
  1402. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1403. VAR prevConditional: BOOLEAN;
  1404. BEGIN
  1405. prevConditional := conditional;
  1406. conditional := FALSE;
  1407. InitOperand(result, ModeUndefined);
  1408. Expression(x);
  1409. op := result;
  1410. LoadValue(op,x.type.resolved);
  1411. conditional := prevConditional;
  1412. END Evaluate;
  1413. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1414. VAR prevConditional: BOOLEAN;
  1415. BEGIN
  1416. prevConditional := conditional;
  1417. conditional := FALSE;
  1418. InitOperand(result,ModeUndefined);
  1419. Expression(x);
  1420. op := result;
  1421. (*
  1422. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1423. *)
  1424. conditional := prevConditional;
  1425. END Designate;
  1426. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1427. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1428. BEGIN
  1429. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1430. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1431. conditional := TRUE;
  1432. trueLabel := trueL; falseLabel := falseL;
  1433. Expression(x);
  1434. trueL := trueLabel; falseL := falseLabel;
  1435. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1436. END Condition;
  1437. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1438. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1439. BEGIN
  1440. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1441. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1442. RETURN op
  1443. END NewRegisterOperand;
  1444. PROCEDURE UnuseRegister(register: LONGINT);
  1445. BEGIN
  1446. IF (register > 0) THEN
  1447. register := registerUsageCount.Map(register);
  1448. registerUsageCount.DecUse(register);
  1449. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1450. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1451. END;
  1452. IF registerUsageCount.Use(register)=0 THEN
  1453. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1454. Warning(position, "register cannot be removed");
  1455. END;
  1456. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1457. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1458. END;
  1459. ELSIF registerUsageCount.Use(register)<0 THEN
  1460. Warning(position, "register removed too often");
  1461. IF dump # NIL THEN
  1462. dump.String("register removed too often"); dump.Ln; dump.Update;
  1463. END;
  1464. D.TraceBack;
  1465. END;
  1466. END;
  1467. END UnuseRegister;
  1468. PROCEDURE UseRegister(register: LONGINT);
  1469. BEGIN
  1470. IF (register > 0) THEN
  1471. register := registerUsageCount.Map(register);
  1472. registerUsageCount.IncUse(register);
  1473. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1474. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1475. END;
  1476. IF registerUsageCount.Use(register)=1 THEN
  1477. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1478. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1479. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1480. END;
  1481. END;
  1482. END;
  1483. END UseRegister;
  1484. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1485. BEGIN
  1486. UnuseRegister(op.register)
  1487. END ReleaseIntermediateOperand;
  1488. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1489. BEGIN
  1490. UseRegister(op.register)
  1491. END UseIntermediateOperand;
  1492. PROCEDURE ReleaseOperand(CONST op: Operand);
  1493. BEGIN
  1494. UnuseRegister(op.op.register);
  1495. UnuseRegister(op.tag.register);
  1496. UnuseRegister(op.extra.register);
  1497. END ReleaseOperand;
  1498. (* save registers marked in array "markedRegisters" to the stack
  1499. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1500. *)
  1501. PROCEDURE SaveRegisters();
  1502. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1503. BEGIN
  1504. entry := usedRegisters;
  1505. WHILE entry # NIL DO
  1506. type := registerUsageCount.used[entry.register].type;
  1507. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1508. Emit(Push(position,op));
  1509. entry := entry.next;
  1510. END;
  1511. END SaveRegisters;
  1512. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1513. BEGIN
  1514. saved := usedRegisters;
  1515. usedRegisters := NIL;
  1516. END ReleaseUsedRegisters;
  1517. (** remove parameter registers from used queue *)
  1518. PROCEDURE ReleaseParameterRegisters;
  1519. VAR entry,prev,next: RegisterEntry;
  1520. BEGIN
  1521. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1522. WHILE entry # NIL DO
  1523. next := entry.next;
  1524. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1525. registerUsageCount.DecUse(entry.register);
  1526. ASSERT(registerUsageCount.Use(entry.register)=0);
  1527. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1528. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1529. END;
  1530. ELSIF prev = NIL THEN
  1531. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1532. ELSE
  1533. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1534. END;
  1535. entry := next;
  1536. END;
  1537. END ReleaseParameterRegisters;
  1538. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1539. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1540. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1541. BEGIN
  1542. entry := saved;
  1543. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1544. entry := prev;
  1545. WHILE entry # NIL DO
  1546. prev := entry.prev;
  1547. type := entry.type;
  1548. class := entry.registerClass;
  1549. IntermediateCode.InitRegister(op,type,class,entry.register);
  1550. (*
  1551. new := registerUsageCount.Next(type,class);
  1552. registerUsageCount.Remap(entry.register,new);
  1553. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1554. dump.String("remap register "); dump.Int(entry.register,1);
  1555. dump.String("to "); dump.Int(new,1);
  1556. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1557. END;
  1558. entry.register := new;
  1559. *)
  1560. Emit(Pop(position,op));
  1561. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1562. entry := prev;
  1563. END;
  1564. (*
  1565. usedRegisters := saved;
  1566. *)
  1567. END RestoreRegisters;
  1568. PROCEDURE CheckRegistersFree;
  1569. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1570. BEGIN
  1571. IF usedRegisters # NIL THEN
  1572. r := usedRegisters;
  1573. WHILE r # NIL DO
  1574. warning := "register ";
  1575. Strings.AppendInt(warning, r.register);
  1576. Strings.Append(warning, " not released.");
  1577. Warning(position,warning);
  1578. r := r .next;
  1579. END;
  1580. END;
  1581. FOR i := 0 TO registerUsageCount.count-1 DO
  1582. IF registerUsageCount.used[i].count < 0 THEN
  1583. warning := "register ";
  1584. Strings.AppendInt(warning, i);
  1585. Strings.Append(warning, " unused too often.");
  1586. Warning(position,warning);
  1587. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1588. warning := "register ";
  1589. Strings.AppendInt(warning, i);
  1590. Strings.Append(warning, " not unused often enough.");
  1591. Warning(position,warning);
  1592. END;
  1593. END;
  1594. END CheckRegistersFree;
  1595. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1596. Otherwise allocate a new register.
  1597. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1598. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1599. BEGIN
  1600. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1601. UseIntermediateOperand(result);
  1602. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1603. UseIntermediateOperand(result);
  1604. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1605. END;
  1606. END Reuse2;
  1607. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1608. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1609. If not then allocate a new register.
  1610. Does NOT necessarily keep the content of src1 or src2 in result!
  1611. *)
  1612. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1613. BEGIN
  1614. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1615. UseIntermediateOperand(result);
  1616. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1617. UseIntermediateOperand(result);
  1618. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1619. result := alternative; alternative := emptyOperand;
  1620. UseIntermediateOperand(result);
  1621. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1622. END;
  1623. END Reuse2a;
  1624. (* like reuse2 but only one source *)
  1625. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1626. BEGIN
  1627. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1628. UseIntermediateOperand(result);
  1629. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1630. END;
  1631. END Reuse1;
  1632. (* like reuse2a but only one source *)
  1633. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1634. BEGIN
  1635. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1636. UseIntermediateOperand(result);
  1637. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1638. UseIntermediateOperand(result);
  1639. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1640. END;
  1641. END Reuse1a;
  1642. (* like reuse1 but guarantees that content of src1 is in result *)
  1643. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1644. BEGIN
  1645. IF ReusableRegister(src1) THEN
  1646. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1647. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1648. UseIntermediateOperand(result);
  1649. ELSE
  1650. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1651. Emit(Mov(position,result,src1));
  1652. END
  1653. END ReuseCopy;
  1654. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1655. BEGIN
  1656. IF ReusableRegister(src) THEN
  1657. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1658. ELSE
  1659. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1660. Emit(Mov(position,result,src));
  1661. ReleaseIntermediateOperand(src);
  1662. END
  1663. END TransferToRegister;
  1664. (** labels and branches **)
  1665. PROCEDURE NewLabel(): Label;
  1666. VAR label: Label;
  1667. BEGIN
  1668. NEW(label,section); RETURN label;
  1669. END NewLabel;
  1670. PROCEDURE SetLabel(label: Label);
  1671. BEGIN label.Resolve(section.pc);
  1672. END SetLabel;
  1673. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1674. BEGIN
  1675. ASSERT(label # NIL);
  1676. IF label.pc < 0 THEN (* label not yet set *)
  1677. label.AddFixup(section.pc);
  1678. END;
  1679. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1680. END LabelOperand;
  1681. PROCEDURE BrL(label: Label);
  1682. BEGIN
  1683. Emit(Br(position,LabelOperand(label)));
  1684. END BrL;
  1685. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1686. BEGIN
  1687. Emit(Brge(position,LabelOperand(label),left,right));
  1688. END BrgeL;
  1689. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1690. BEGIN
  1691. Emit(Brlt(position,LabelOperand(label),left,right));
  1692. END BrltL;
  1693. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1694. BEGIN
  1695. Emit(Breq(position,LabelOperand(label),left,right));
  1696. END BreqL;
  1697. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1698. BEGIN
  1699. Emit(Brne(position,LabelOperand(label),left,right));
  1700. END BrneL;
  1701. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1702. VAR new: IntermediateCode.Operand;
  1703. BEGIN
  1704. IF Trace THEN TraceEnter("Convert") END;
  1705. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1706. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1707. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1708. & (operand.offset = 0)
  1709. THEN
  1710. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1711. Emit(Conv(position,new,operand));
  1712. ELSE
  1713. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1714. Emit(Conv(position,new,operand));
  1715. ReleaseIntermediateOperand(operand);
  1716. END;
  1717. operand := new;
  1718. ELSIF (operand.mode = IntermediateCode.ModeImmediate) & (operand.symbol.name = "") & (operand.type.sizeInBits <= type.sizeInBits) & (operand.type.form IN IntermediateCode.Integer) & (type.form IN IntermediateCode.Integer) THEN
  1719. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1720. ELSE
  1721. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1722. Emit(Conv(position,new,operand));
  1723. ReleaseIntermediateOperand(operand);
  1724. operand := new;
  1725. END;
  1726. IF Trace THEN TraceExit("Convert") END;
  1727. END Convert;
  1728. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1729. VAR exit: Label;
  1730. BEGIN
  1731. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1732. exit := NewLabel();
  1733. br(exit,left,right);
  1734. EmitTrap(position,trapNo);
  1735. SetLabel(exit);
  1736. END TrapC;
  1737. (** expressions *)
  1738. (** emit necessary runtime check for set elements **)
  1739. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1740. VAR max: IntermediateCode.Operand;
  1741. BEGIN
  1742. IF isUnchecked THEN RETURN END;
  1743. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1744. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1745. TrapC(BrgeL, max, o, SetElementTrap);
  1746. END;
  1747. END CheckSetElement;
  1748. (** the set that a range represents **)
  1749. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1750. VAR
  1751. operand: Operand;
  1752. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1753. BEGIN
  1754. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1755. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1756. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1757. one := IntermediateCode.Immediate(setType, 1);
  1758. Evaluate(x, operand);
  1759. Convert(operand.op, setType);
  1760. Convert(operand.tag, setType);
  1761. CheckSetElement(operand.op);
  1762. CheckSetElement(operand.tag);
  1763. (* create mask for lower bound
  1764. i.e. shift 11111111 to the left by the value of the lower bound
  1765. *)
  1766. Reuse1(temp, operand.op);
  1767. Emit(Shl(position,temp, allBits, operand.op));
  1768. ReleaseIntermediateOperand(operand.op);
  1769. operand.op := temp;
  1770. (* create mask for upper bound
  1771. i.e. shift 11111111 to the right by the difference between the
  1772. upper bound and the maximum number of set elements
  1773. *)
  1774. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1775. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1776. Reuse1(temp, operand.tag);
  1777. ELSE
  1778. Reuse1(temp, operand.tag);
  1779. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1780. Emit(Sub(position,temp, size, operand.tag));
  1781. END;
  1782. Emit(Shr(position,temp, allBits, operand.tag));
  1783. ReleaseIntermediateOperand(operand.tag);
  1784. operand.tag := temp;
  1785. Reuse2(resultingSet, operand.op, operand.tag);
  1786. (* intersect the two masks *)
  1787. Emit(And(position,resultingSet, operand.op, operand.tag));
  1788. ReleaseOperand(operand);
  1789. RETURN resultingSet
  1790. END SetFromRange;
  1791. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1792. VAR
  1793. res, operand: Operand;
  1794. temp, one, noBits, dest: IntermediateCode.Operand;
  1795. expression: SyntaxTree.Expression;
  1796. i: LONGINT;
  1797. BEGIN
  1798. IF Trace THEN TraceEnter("VisitSet") END;
  1799. dest := destination;
  1800. destination := emptyOperand;
  1801. noBits := IntermediateCode.Immediate(setType, 0);
  1802. one := IntermediateCode.Immediate(setType, 1);
  1803. (* start off with the empty set *)
  1804. InitOperand(res, ModeValue);
  1805. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1806. Emit(Mov(position,res.op, noBits));
  1807. FOR i := 0 TO x.elements.Length() - 1 DO
  1808. expression := x.elements.GetExpression(i);
  1809. IF expression IS SyntaxTree.RangeExpression THEN
  1810. (* range of set elements *)
  1811. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1812. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1813. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1814. ReleaseIntermediateOperand(temp)
  1815. ELSE
  1816. (* singelton element *)
  1817. Evaluate(expression, operand);
  1818. Convert(operand.op, setType);
  1819. CheckSetElement(operand.op);
  1820. (* create subset containing single element *)
  1821. Reuse1(temp, operand.op);
  1822. Emit(Shl(position,temp, one, operand.op));
  1823. ReleaseOperand(operand);
  1824. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1825. ReleaseIntermediateOperand(temp);
  1826. END
  1827. END;
  1828. result := res;
  1829. destination := dest;
  1830. IF Trace THEN TraceExit("VisitSet") END;
  1831. END VisitSet;
  1832. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1833. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1834. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1835. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1836. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1837. element: SyntaxTree.IntegerValue;
  1838. BEGIN
  1839. numberElements := x.elements.Length();
  1840. expression := index.parameters.GetExpression(dim);
  1841. element := expression(SyntaxTree.IntegerValue);
  1842. FOR i := 0 TO numberElements-1 DO
  1843. expression := x.elements.GetExpression(i);
  1844. element.SetValue(i);
  1845. IF expression IS SyntaxTree.MathArrayExpression THEN
  1846. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1847. ELSE
  1848. Assign(index,expression);
  1849. END;
  1850. END;
  1851. END RecursiveAssignment;
  1852. BEGIN
  1853. variable := GetTemporaryVariable(x.type, FALSE);
  1854. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1855. designator.SetType(variable.type);
  1856. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1857. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1858. FOR i := 0 TO dim-1 DO
  1859. element := SyntaxTree.NewIntegerValue(x.position,0);
  1860. element.SetType(system.longintType);
  1861. index.parameters.AddExpression(element);
  1862. END;
  1863. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1864. RecursiveAssignment(x,0);
  1865. Expression(designator);
  1866. END VisitMathArrayExpression;
  1867. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1868. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1869. BEGIN
  1870. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1871. dest := destination; destination := emptyOperand;
  1872. IF x.operator = Scanner.Not THEN
  1873. IF conditional THEN
  1874. Condition(x.left,falseLabel,trueLabel)
  1875. ELSE
  1876. Evaluate(x.left,operand);
  1877. InitOperand(result,ModeValue);
  1878. Reuse1a(result.op,operand.op,dest);
  1879. Emit(Xor(position,result.op,operand.op,true));
  1880. ReleaseOperand(operand);
  1881. END;
  1882. ELSIF x.operator = Scanner.Minus THEN
  1883. Evaluate(x.left,operand);
  1884. InitOperand(result,ModeValue);
  1885. Reuse1a(result.op,operand.op,dest);
  1886. type := x.left.type.resolved;
  1887. IF type IS SyntaxTree.SetType THEN
  1888. Emit(Not(position,result.op,operand.op));
  1889. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1890. Reuse1(result.tag,operand.tag);
  1891. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1892. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1893. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  1894. Emit(Neg(position,result.op,operand.op));
  1895. ELSE HALT(200)
  1896. END;
  1897. ReleaseOperand(operand);
  1898. ELSIF x.operator = Scanner.Address THEN
  1899. Designate(x.left,operand);
  1900. operand.mode := ModeValue;
  1901. t0 := x.left.type.resolved;
  1902. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  1903. ReleaseIntermediateOperand(operand.op);
  1904. operand.op := operand.tag;
  1905. IntermediateCode.InitOperand(operand.tag);
  1906. END;
  1907. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  1908. result := operand;
  1909. ELSE HALT(100)
  1910. END;
  1911. destination := dest;
  1912. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  1913. END VisitUnaryExpression;
  1914. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  1915. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  1916. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  1917. BEGIN
  1918. type := type.resolved;
  1919. originalType := type;
  1920. IF type IS SyntaxTree.PointerType THEN
  1921. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  1922. END;
  1923. IF type IS SyntaxTree.ObjectType THEN
  1924. BrL(trueL);
  1925. ELSE
  1926. ASSERT(type IS SyntaxTree.RecordType);
  1927. (*
  1928. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  1929. *)
  1930. ReuseCopy(left,tag);
  1931. right := TypeDescriptorAdr(type);
  1932. IF ~newObjectFile THEN
  1933. IntermediateCode.MakeMemory(right,addressType);
  1934. END;
  1935. IF backend.cooperative THEN
  1936. repeatL := NewLabel();
  1937. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  1938. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  1939. END;
  1940. SetLabel(repeatL);
  1941. BreqL(trueL,left,right);
  1942. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  1943. BrneL(repeatL,left,nil);
  1944. ELSIF meta.simple THEN
  1945. level := type(SyntaxTree.RecordType).Level();
  1946. (* get type desc tag of level relative to base tag *)
  1947. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  1948. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1949. IntermediateCode.MakeMemory(left,addressType);
  1950. BreqL(trueL,left,right);
  1951. ELSE
  1952. level := type(SyntaxTree.RecordType).Level();
  1953. (* get type desc tag of level relative to base tag *)
  1954. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  1955. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1956. IntermediateCode.MakeMemory(left,addressType);
  1957. BreqL(trueL,left,right);
  1958. END;
  1959. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  1960. BrL(falseL);
  1961. END;
  1962. END TypeTest;
  1963. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  1964. BEGIN
  1965. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  1966. IF dump # NIL THEN
  1967. dump.String(s); dump.Ln;
  1968. END;
  1969. END Error;
  1970. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  1971. BEGIN
  1972. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  1973. IF dump # NIL THEN
  1974. dump.String(s); dump.Ln; dump.Update;
  1975. END;
  1976. END Warning;
  1977. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  1978. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  1979. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  1980. operand:Operand;
  1981. BEGIN
  1982. previousSection := section;
  1983. Global.GetModuleName(mod,name);
  1984. Strings.Append(name,".@Trace");
  1985. Basic.ToSegmentedName(name, pooledName);
  1986. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  1987. IF dump # NIL THEN dump := section.comments END;
  1988. IF backend.hasLinkRegister THEN
  1989. Emit(Push(-1, lr));
  1990. END;
  1991. variable := mod.moduleScope.firstVariable;
  1992. WHILE variable # NIL DO
  1993. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  1994. Symbol(variable, operand);
  1995. register := operand.op;
  1996. CallTraceMethod(register, variable.type);
  1997. ReleaseIntermediateOperand(register);
  1998. END;
  1999. variable := variable.nextVariable;
  2000. END;
  2001. IF backend.hasLinkRegister THEN
  2002. Emit(Pop(-1, lr));
  2003. END;
  2004. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2005. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2006. Emit(Br(position,op));
  2007. INC(statCoopTraceModule, section.pc);
  2008. section := previousSection;
  2009. IF dump # NIL THEN dump := section.comments END;
  2010. END CreateTraceModuleMethod;
  2011. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2012. BEGIN
  2013. Emit (Push(position, dst));
  2014. Emit (Push(position, src));
  2015. CallThis(position,"GarbageCollector","Assign", 2);
  2016. END CallAssignPointer;
  2017. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2018. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2019. BEGIN
  2020. IF SemanticChecker.IsPointerType (type) THEN
  2021. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2022. ELSIF type.IsRecordType() THEN
  2023. Emit (Push(position,dst));
  2024. Emit (Push(position,src));
  2025. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2026. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2027. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2028. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2029. ELSIF IsStaticArray(type) THEN
  2030. size := StaticArrayNumElements(type);
  2031. base := StaticArrayBaseType(type);
  2032. IF base.IsRecordType() THEN
  2033. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2034. Emit (Push(position, dst));
  2035. Emit (Push(position, src));
  2036. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2037. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2038. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2039. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2040. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2041. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2042. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2043. Emit (Push(position, dst));
  2044. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2045. Emit (Push(position, src));
  2046. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2047. ELSE
  2048. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2049. Emit (Push(position, dst));
  2050. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2051. Emit (Push(position, src));
  2052. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2053. ASSERT(StaticArrayBaseType(type).IsPointer());
  2054. END;
  2055. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2056. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2057. Emit (Push(position, dst));
  2058. Emit (Push(position, src));
  2059. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2060. ELSE HALT(100); (* missing ? *)
  2061. END;
  2062. END CallAssignMethod;
  2063. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2064. VAR name: Basic.SegmentedName;
  2065. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2066. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2067. context: Context;
  2068. BEGIN
  2069. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2070. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2071. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2072. GetRecordTypeName (recordType,name);
  2073. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2074. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2075. IF dump # NIL THEN dump := section.comments END;
  2076. IF backend.hasLinkRegister THEN
  2077. Emit(Push(-1, lr));
  2078. END;
  2079. variable := recordType.recordScope.firstVariable;
  2080. WHILE variable # NIL DO
  2081. IF variable.NeedsTrace() THEN
  2082. dst := NewRegisterOperand (addressType);
  2083. src := NewRegisterOperand (addressType);
  2084. Emit (Mov(position, dst, parameter1));
  2085. Emit (Mov(position, src, parameter2));
  2086. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2087. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2088. CallAssignMethod(dst, src, variable.type);
  2089. ReleaseIntermediateOperand(src);
  2090. ReleaseIntermediateOperand(dst);
  2091. END;
  2092. variable := variable.nextVariable;
  2093. END;
  2094. recordBase := recordType.GetBaseRecord();
  2095. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2096. IF backend.hasLinkRegister THEN
  2097. Emit(Pop(-1, lr));
  2098. END;
  2099. GetRecordTypeName (recordBase,name);
  2100. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2101. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2102. Emit(Br(position,op));
  2103. ELSE
  2104. Emit(Exit(position,0,0));
  2105. END;
  2106. IF ~recordType.isObject THEN
  2107. GetRecordTypeName (recordType,name);
  2108. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2109. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2110. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2111. NEW(registerUsageCount);
  2112. usedRegisters := NIL;
  2113. dst := NewRegisterOperand (addressType);
  2114. src := NewRegisterOperand (addressType);
  2115. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2116. Emit(Mov(position, dst, parameter1));
  2117. Emit(Mov(position, src, parameter2));
  2118. label := NewLabel();
  2119. SetLabel(label);
  2120. Emit(Push(position, dst));
  2121. Emit(Push(position, src));
  2122. GetRecordTypeName (recordType,name);
  2123. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2124. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2125. Emit(Call(position, op, 0));
  2126. Emit(Pop(position, src));
  2127. Emit(Pop(position, dst));
  2128. Emit(Add(position, dst, dst, ofs));
  2129. Emit(Add(position, src, src, ofs));
  2130. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2131. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2132. Emit(Exit(position,0,0));
  2133. END;
  2134. INC(statCoopAssignProcedure, section.pc);
  2135. ReturnToContext(context);
  2136. IF dump # NIL THEN dump := section.comments END;
  2137. END CreateAssignProcedure;
  2138. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2139. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2140. BEGIN
  2141. IF IsUnsafePointer (type) THEN
  2142. skip := NewLabel();
  2143. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2144. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2145. BreqL (skip, op, nil);
  2146. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2147. SetLabel (skip);
  2148. ELSIF SemanticChecker.IsPointerType (type) THEN
  2149. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2150. CallThis(position,"GarbageCollector","Mark", 1);
  2151. ELSIF type.IsRecordType() THEN
  2152. Emit (Push(position,register));
  2153. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2154. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2155. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2156. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2157. ELSIF IsStaticArray(type) THEN
  2158. size := StaticArrayNumElements(type);
  2159. base := StaticArrayBaseType(type);
  2160. IF base.IsRecordType() THEN
  2161. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2162. Emit (Push(position, register));
  2163. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2164. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2165. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2166. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2167. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2168. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2169. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2170. Emit (Push(position, register));
  2171. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2172. ELSE
  2173. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2174. Emit (Push(position, register));
  2175. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2176. ASSERT(base.IsPointer());
  2177. END;
  2178. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2179. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2180. CallThis(position,"GarbageCollector","Mark", 1);
  2181. ELSE HALT(100); (* missing ? *)
  2182. END;
  2183. END CallTraceMethod;
  2184. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2185. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2186. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2187. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2188. BEGIN
  2189. previousSection := section;
  2190. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2191. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2192. GetRecordTypeName (recordType,name);
  2193. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2194. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2195. IF dump # NIL THEN dump := section.comments END;
  2196. IF backend.hasLinkRegister THEN
  2197. Emit(Push(-1, lr));
  2198. END;
  2199. variable := recordType.recordScope.firstVariable;
  2200. WHILE variable # NIL DO
  2201. IF variable.NeedsTrace() THEN
  2202. register := NewRegisterOperand (addressType);
  2203. Emit (Mov(position,register,parameter1));
  2204. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2205. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2206. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2207. END;
  2208. CallTraceMethod(register, variable.type);
  2209. ReleaseIntermediateOperand(register);
  2210. END;
  2211. variable := variable.nextVariable;
  2212. END;
  2213. recordBase := recordType.GetBaseRecord();
  2214. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2215. recordBase := recordBase.GetBaseRecord();
  2216. END;
  2217. IF recordBase # NIL THEN
  2218. IF backend.hasLinkRegister THEN
  2219. Emit(Pop(-1, lr));
  2220. END;
  2221. GetRecordTypeName (recordBase,name);
  2222. IF HasExplicitTraceMethod (recordBase) THEN
  2223. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2224. ELSE
  2225. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2226. END;
  2227. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2228. Emit(Br(position,op));
  2229. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2230. Emit(Exit(position,0,0));
  2231. ELSE
  2232. IF backend.hasLinkRegister THEN
  2233. Emit(Pop(-1, lr));
  2234. END;
  2235. IF recordType.isObject THEN
  2236. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2237. ELSE
  2238. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2239. END;
  2240. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2241. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2242. Emit(Br(position,op));
  2243. END;
  2244. IF ~recordType.isObject THEN
  2245. GetRecordTypeName (recordType,name);
  2246. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2247. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2248. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2249. NEW(registerUsageCount);
  2250. usedRegisters := NIL;
  2251. IF dump # NIL THEN dump := section.comments END;
  2252. register := NewRegisterOperand (addressType);
  2253. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2254. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2255. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2256. END;
  2257. Emit (Push(position,register));
  2258. GetRecordTypeName (recordType,name);
  2259. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2260. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2261. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2262. ReleaseIntermediateOperand(register);
  2263. Emit(Exit(position,0,0));
  2264. GetRecordTypeName (recordType,name);
  2265. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2266. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2267. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2268. NEW(registerUsageCount);
  2269. usedRegisters := NIL;
  2270. register := NewRegisterOperand (addressType);
  2271. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2272. Emit(Mov(position, register, parameter1));
  2273. label := NewLabel();
  2274. SetLabel(label);
  2275. Emit(Push(position, register));
  2276. GetRecordTypeName (recordType,name);
  2277. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2278. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2279. Emit(Call(position, op, 0));
  2280. Emit(Pop(position, register));
  2281. Emit(Add(position, register, register, ofs));
  2282. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2283. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2284. Emit(Exit(position,0,0));
  2285. END;
  2286. INC(statCoopTraceMethod, section.pc);
  2287. ReturnToContext(context);
  2288. IF dump # NIL THEN dump := section.comments END;
  2289. END CreateTraceMethod;
  2290. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2291. VAR name: Basic.SegmentedName;
  2292. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2293. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2294. context: Context;
  2295. BEGIN
  2296. IF recordType.isObject THEN RETURN END;
  2297. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2298. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2299. GetRecordTypeName (recordType,name);
  2300. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2301. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2302. IF dump # NIL THEN dump := section.comments END;
  2303. IF backend.hasLinkRegister THEN
  2304. Emit(Push(-1, lr));
  2305. END;
  2306. variable := recordType.recordScope.firstVariable;
  2307. WHILE variable # NIL DO
  2308. IF variable.NeedsTrace() THEN
  2309. dst := NewRegisterOperand (addressType);
  2310. Emit (Mov(position, dst, parameter1));
  2311. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2312. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2313. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2314. END;
  2315. CallResetProcedure(dst, nil, variable.type);
  2316. ReleaseIntermediateOperand(dst);
  2317. END;
  2318. variable := variable.nextVariable;
  2319. END;
  2320. recordBase := recordType.GetBaseRecord();
  2321. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2322. IF backend.hasLinkRegister THEN
  2323. Emit(Pop(-1, lr));
  2324. END;
  2325. GetRecordTypeName (recordBase,name);
  2326. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2327. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2328. Emit(Br(position,op));
  2329. ELSE
  2330. Emit(Exit(position,0,0));
  2331. END;
  2332. GetRecordTypeName (recordType,name);
  2333. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2334. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2335. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2336. NEW(registerUsageCount);
  2337. usedRegisters := NIL;
  2338. dst := NewRegisterOperand (addressType);
  2339. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2340. Emit(Mov(position, dst, parameter1));
  2341. label := NewLabel();
  2342. SetLabel(label);
  2343. Emit(Push(position, dst));
  2344. GetRecordTypeName (recordType,name);
  2345. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2346. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2347. Emit(Call(position, op, 0));
  2348. Emit(Pop(position, dst));
  2349. Emit(Add(position, dst, dst, ofs));
  2350. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2351. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2352. Emit(Exit(position,0,0));
  2353. INC(statCoopResetProcedure, section.pc);
  2354. ReturnToContext(context);
  2355. IF dump # NIL THEN dump := section.comments END;
  2356. END CreateResetProcedure;
  2357. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2358. VAR name: Basic.SegmentedName; context: Context;
  2359. BEGIN
  2360. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2361. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2362. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2363. IF dump # NIL THEN dump := section.comments END;
  2364. IF backend.hasLinkRegister THEN
  2365. Emit(Push(-1, lr));
  2366. END;
  2367. Emit(Push(position,fp));
  2368. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2369. ResetVariables(scope);
  2370. Emit(Pop(position,fp));
  2371. Emit(Exit(position,0,0));
  2372. ReturnToContext(context);
  2373. IF dump # NIL THEN dump := section.comments END;
  2374. END CreateResetMethod;
  2375. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2376. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2377. BEGIN
  2378. IF SemanticChecker.IsPointerType (type) THEN
  2379. Emit (Push(position, dest));
  2380. CallThis(position,"GarbageCollector","Reset", 1);
  2381. ELSIF type.IsRecordType() THEN
  2382. Emit (Push(position, dest));
  2383. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2384. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2385. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2386. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2387. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2388. size := GetArrayLength(type, tag);
  2389. base := ArrayBaseType(type);
  2390. IF base.IsRecordType() THEN
  2391. Emit (Push(position, size));
  2392. Emit (Push(position, dest));
  2393. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2394. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2395. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2396. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2397. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2398. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2399. Emit (Push(position, size));
  2400. Emit (Push(position, dest));
  2401. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2402. ELSE
  2403. Emit (Push(position, size));
  2404. Emit (Push(position, dest));
  2405. CallThis(position,"GarbageCollector","ResetArray", 2);
  2406. ASSERT(ArrayBaseType(type).IsPointer());
  2407. END;
  2408. ReleaseIntermediateOperand(size);
  2409. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2410. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2411. Emit (Push(position, dest));
  2412. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2413. ELSE HALT(100); (* missing ? *)
  2414. END;
  2415. END CallResetProcedure;
  2416. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2417. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2418. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2419. VAR operand: Operand;
  2420. BEGIN
  2421. Symbol (symbol, operand);
  2422. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2423. ReleaseOperand(operand);
  2424. END Reset;
  2425. BEGIN
  2426. previousScope := currentScope;
  2427. currentScope := scope;
  2428. pc := section.pc;
  2429. variable := scope.firstVariable;
  2430. WHILE variable # NIL DO
  2431. IF variable.NeedsTrace() THEN
  2432. Reset (variable);
  2433. END;
  2434. variable := variable.nextVariable;
  2435. END;
  2436. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2437. WHILE parameter # NIL DO
  2438. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2439. Reset (parameter);
  2440. END;
  2441. parameter := parameter.nextParameter;
  2442. END;
  2443. INC(statCoopResetVariables, section.pc - pc);
  2444. currentScope := previousScope;
  2445. END ResetVariables;
  2446. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2447. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2448. VAR op: IntermediateCode.Operand; context: Context;
  2449. BEGIN
  2450. previousSection := section;
  2451. GetCodeSectionNameForSymbol(procedure, name);
  2452. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2453. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2454. IF dump # NIL THEN dump := section.comments END;
  2455. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2456. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2457. Emit(Data(position,op));
  2458. Emit(Data(position,nil));
  2459. IF HasPointers (procedure.procedureScope) THEN
  2460. GetCodeSectionNameForSymbol(procedure, name);
  2461. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2462. ELSE
  2463. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2464. END;
  2465. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2466. Emit(Data(position,op));
  2467. ReturnToContext(context);
  2468. IF dump # NIL THEN dump := section.comments END;
  2469. END CreateProcedureDescriptor;
  2470. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2471. VAR import: SyntaxTree.Import;
  2472. s: Basic.MessageString;
  2473. selfName: SyntaxTree.IdentifierString;
  2474. BEGIN
  2475. moduleScope.ownerModule.GetName(selfName);
  2476. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2477. module := moduleScope.ownerModule
  2478. ELSE
  2479. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2480. IF import = NIL THEN
  2481. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2482. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2483. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2484. s := "Module ";
  2485. Strings.Append(s,moduleName);
  2486. Strings.Append(s," cannot be imported.");
  2487. IF force THEN
  2488. Error(position,s);
  2489. ELSIF canBeLoaded THEN
  2490. Strings.Append(s, "=> no dynamic linking.");
  2491. Warning(position, s);
  2492. canBeLoaded := FALSE;
  2493. END;
  2494. RETURN FALSE
  2495. ELSE
  2496. SELF.module.imports.AddName(moduleName)
  2497. END;
  2498. ELSIF import.module = NIL THEN (* already tried *)
  2499. RETURN FALSE
  2500. END;
  2501. module := import.module;
  2502. END;
  2503. RETURN TRUE
  2504. END AddImport;
  2505. (* needed for old binary object file format*)
  2506. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2507. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2508. BEGIN
  2509. IF AddImport(moduleName,module,TRUE) THEN
  2510. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2511. IF procedure = NIL THEN
  2512. s := "Instruction not supported on target, emulation procedure ";
  2513. Strings.Append(s,moduleName);
  2514. Strings.Append(s,".");
  2515. Strings.Append(s,procedureName);
  2516. Strings.Append(s," not present");
  2517. Error(position,s);
  2518. ELSE
  2519. StaticCallOperand(r,procedure);
  2520. ReleaseOperand(r);
  2521. fp := GetFingerprint(procedure);
  2522. END;
  2523. END;
  2524. END EnsureSymbol;
  2525. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2526. VAR exit: Label; trueL,falseL: Label;
  2527. BEGIN
  2528. trueL := NewLabel();
  2529. falseL := NewLabel();
  2530. exit := NewLabel();
  2531. Condition(x,trueL,falseL);
  2532. InitOperand(result,ModeValue);
  2533. SetLabel(trueL);
  2534. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2535. Emit(Mov(position,result.op,true));
  2536. BrL(exit);
  2537. SetLabel(falseL);
  2538. Emit(MovReplace(position,result.op,false));
  2539. SetLabel(exit);
  2540. END ConditionToValue;
  2541. PROCEDURE ValueToCondition(VAR op: Operand);
  2542. BEGIN
  2543. LoadValue(op,system.booleanType);
  2544. BrneL(trueLabel,op.op, false);
  2545. ReleaseOperand(op);
  2546. BrL(falseLabel);
  2547. END ValueToCondition;
  2548. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2549. VAR size: LONGINT;
  2550. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2551. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2552. BEGIN
  2553. ASSERT(type.form = SyntaxTree.Open);
  2554. baseType := type.arrayBase.resolved;
  2555. IF IsOpenArray(baseType) THEN
  2556. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2557. ELSE
  2558. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2559. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2560. END;
  2561. len := tag;
  2562. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2563. IntermediateCode.MakeMemory(len,addressType);
  2564. UseIntermediateOperand(len);
  2565. Reuse2(res,sizeOperand,len);
  2566. Emit(Mul(position,res,sizeOperand,len));
  2567. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2568. RETURN res
  2569. END GetArraySize;
  2570. BEGIN
  2571. type := type.resolved;
  2572. IF IsOpenArray(type) THEN
  2573. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2574. RETURN tag
  2575. ELSE
  2576. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2577. END;
  2578. ELSE
  2579. size := ToMemoryUnits(system,system.SizeOf(type));
  2580. RETURN IntermediateCode.Immediate(addressType,size)
  2581. END;
  2582. END GetDynamicSize;
  2583. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2584. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2585. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2586. BEGIN
  2587. ASSERT(type.form = SyntaxTree.Open);
  2588. baseType := type.arrayBase.resolved;
  2589. IF IsOpenArray(baseType) THEN
  2590. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2591. ELSE
  2592. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2593. END;
  2594. len := tag;
  2595. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2596. IntermediateCode.MakeMemory(len,addressType);
  2597. UseIntermediateOperand(len);
  2598. Reuse2(res,sizeOperand,len);
  2599. Emit(Mul(position,res,sizeOperand,len));
  2600. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2601. RETURN res
  2602. END GetLength;
  2603. BEGIN
  2604. type := type.resolved;
  2605. IF IsOpenArray(type) THEN
  2606. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2607. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2608. ELSE
  2609. RETURN IntermediateCode.Immediate(addressType,1)
  2610. END;
  2611. END GetArrayLength;
  2612. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2613. VAR result: IntermediateCode.Operand;
  2614. BEGIN
  2615. IF backend.cooperative THEN
  2616. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2617. ELSE
  2618. MakeMemory(result, tag, addressType, 0);
  2619. END;
  2620. RETURN result
  2621. END GetSizeFromTag;
  2622. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2623. VAR parameter: SyntaxTree.Parameter;
  2624. BEGIN
  2625. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2626. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2627. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2628. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2629. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2630. END;
  2631. RETURN GetDynamicSize(e.type, tag);
  2632. END GetArrayOfBytesSize;
  2633. (*
  2634. to find imported symbol. not needed ?
  2635. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2636. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2637. BEGIN
  2638. IF AddImport(moduleName,importedModule,FALSE) THEN
  2639. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2640. RETURN symbol
  2641. ELSE
  2642. RETURN NIL
  2643. END
  2644. END SymbolByName;
  2645. *)
  2646. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2647. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2648. BEGIN
  2649. IF AddImport(moduleName,runtimeModule,force) THEN
  2650. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2651. IF procedure = NIL THEN
  2652. s := "Procedure ";
  2653. Strings.Append(s,moduleName);
  2654. Strings.Append(s,".");
  2655. Strings.Append(s,procedureName);
  2656. Strings.Append(s," not present");
  2657. Error(position,s);
  2658. RETURN FALSE
  2659. ELSE
  2660. RETURN TRUE
  2661. END;
  2662. ELSE RETURN FALSE
  2663. END;
  2664. END GetRuntimeProcedure;
  2665. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2666. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2667. s: Basic.MessageString;
  2668. BEGIN
  2669. Basic.InitSegmentedName(name);
  2670. name[0] := Basic.MakeString(moduleName);
  2671. name[1] := Basic.MakeString(typeName);
  2672. name[2] := -1;
  2673. IF AddImport(moduleName,importedModule, FALSE) THEN
  2674. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2675. IF symbol = NIL THEN
  2676. s := "type ";
  2677. Strings.Append(s,moduleName);
  2678. Strings.Append(s,".");
  2679. Strings.Append(s,typeName);
  2680. Strings.Append(s," not present");
  2681. Error(position,s);
  2682. END;
  2683. ELSE symbol := NIL;
  2684. END;
  2685. IF importedModule = moduleScope.ownerModule THEN
  2686. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2687. ELSE
  2688. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2689. END;
  2690. RETURN symbol
  2691. END GetTypeDescriptor;
  2692. (* Call a runtime procedure. If numberParameters >= 0 then the procedure may be called without module import. Otherwise the signature has to be inferred from the import. *)
  2693. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2694. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2695. pooledName: Basic.SegmentedName; size: LONGINT;
  2696. BEGIN
  2697. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2698. StaticCallOperand(result,procedure);
  2699. IF numberParameters < 0 THEN
  2700. size := ProcedureParametersSize(system,procedure);
  2701. ELSE
  2702. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2703. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2704. Error(position,"runtime call parameter count mismatch");
  2705. END;
  2706. END;
  2707. Emit(Call(position, result.op, size));
  2708. ReleaseOperand(result);
  2709. ELSE (* only static linking possible *)
  2710. ASSERT(numberParameters >= 0);
  2711. Basic.InitSegmentedName(pooledName);
  2712. pooledName[0] := Basic.MakeString(moduleName);
  2713. pooledName[1] := Basic.MakeString(procedureName);
  2714. pooledName[2] := -1;
  2715. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2716. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2717. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2718. END;
  2719. END CallThisChecked;
  2720. (* Call a runtime procedure. If numberParameters >= 0 then the procedure may be called without module import. Otherwise the signature has to be inferred from the import. *)
  2721. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2722. BEGIN
  2723. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2724. END CallThis;
  2725. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2726. VAR
  2727. left,right: Operand;
  2728. leftSize, rightSize: IntermediateCode.Operand;
  2729. saved: RegisterEntry;
  2730. reg: IntermediateCode.Operand;
  2731. procedureName: SyntaxTree.IdentifierString;
  2732. BEGIN
  2733. procedureName := "CompareString";
  2734. SaveRegisters();ReleaseUsedRegisters(saved);
  2735. Designate(leftExpression,left);
  2736. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2737. Emit(Push(position,leftSize));
  2738. ReleaseIntermediateOperand(leftSize);
  2739. Emit(Push(position,left.op));
  2740. ReleaseOperand(left);
  2741. Designate(rightExpression,right);
  2742. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2743. Emit(Push(position,rightSize));
  2744. ReleaseIntermediateOperand(rightSize);
  2745. Emit(Push(position,right.op));
  2746. ReleaseOperand(right);
  2747. IF backend.cooperative THEN
  2748. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2749. ELSE
  2750. CallThis(position,runtimeModuleName,procedureName, 4);
  2751. END;
  2752. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2753. Emit(Result(position,reg));
  2754. (*
  2755. AcquireThisRegister(int8,IntermediateCode.Result);
  2756. *)
  2757. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2758. (*
  2759. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2760. *)
  2761. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2762. ReleaseIntermediateOperand(reg);
  2763. BrL(falseLabel);
  2764. END CompareString;
  2765. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2766. VAR
  2767. left,right: Operand;
  2768. leftSize, rightSize: IntermediateCode.Operand;
  2769. saved: RegisterEntry;
  2770. procedureName: SyntaxTree.IdentifierString;
  2771. BEGIN
  2772. procedureName := "CopyString";
  2773. SaveRegisters();ReleaseUsedRegisters(saved);
  2774. Designate(leftExpression,left);
  2775. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2776. Emit(Push(position,leftSize));
  2777. ReleaseIntermediateOperand(leftSize);
  2778. Emit(Push(position,left.op));
  2779. ReleaseOperand(left);
  2780. Designate(rightExpression,right);
  2781. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2782. Emit(Push(position,rightSize));
  2783. ReleaseIntermediateOperand(rightSize);
  2784. Emit(Push(position,right.op));
  2785. ReleaseOperand(right);
  2786. IF backend.cooperative THEN
  2787. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2788. ELSE
  2789. CallThis(position,runtimeModuleName,procedureName,4);
  2790. END;
  2791. RestoreRegisters(saved);
  2792. END CopyString;
  2793. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2794. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2795. leftType,rightType: SyntaxTree.Type;
  2796. leftExpression,rightExpression : SyntaxTree.Expression;
  2797. componentType: IntermediateCode.Type;
  2798. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2799. size: LONGINT;
  2800. BEGIN
  2801. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2802. dest := destination; destination := emptyOperand;
  2803. leftType := x.left.type.resolved;
  2804. rightType := x.right.type.resolved;
  2805. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2806. CASE x.operator OF
  2807. Scanner.Or:
  2808. (* shortcut evaluation of left OR right *)
  2809. IF ~conditional THEN ConditionToValue(x);
  2810. ELSE
  2811. next := NewLabel();
  2812. Condition(x.left,trueLabel,next);
  2813. SetLabel(next);
  2814. Condition(x.right,trueLabel,falseLabel);
  2815. END;
  2816. |Scanner.And:
  2817. (* shortcut evaluation of left & right *)
  2818. IF ~conditional THEN ConditionToValue(x);
  2819. ELSE
  2820. next := NewLabel();
  2821. Condition(x.left,next,falseLabel);
  2822. SetLabel(next);
  2823. Condition(x.right,trueLabel,falseLabel);
  2824. END;
  2825. |Scanner.Is:
  2826. IF ~conditional THEN ConditionToValue(x);
  2827. ELSE
  2828. (* get type desc tag *)
  2829. IF IsPointerToRecord(leftType,recordType) THEN
  2830. Evaluate(x.left,left);
  2831. Dereference(left,recordType,IsUnsafePointer(leftType))
  2832. ELSE
  2833. Designate(x.left,left);
  2834. END;
  2835. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2836. ReleaseOperand(left);
  2837. END;
  2838. |Scanner.Plus:
  2839. Evaluate(x.left,left);
  2840. Evaluate(x.right,right);
  2841. IF leftType IS SyntaxTree.SetType THEN
  2842. InitOperand(result,ModeValue);
  2843. Reuse2a(result.op,left.op,right.op,dest);
  2844. Emit(Or(position,result.op,left.op,right.op));
  2845. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2846. InitOperand(result,ModeValue);
  2847. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2848. Reuse2(result.tag,left.tag,right.tag);
  2849. Emit(Add(position,result.op,left.op,right.op));
  2850. Emit(Add(position,result.tag,left.tag,right.tag))
  2851. ELSE
  2852. InitOperand(result,ModeValue);
  2853. Reuse2a(result.op,left.op,right.op,dest);
  2854. Emit(Add(position,result.op,left.op,right.op));
  2855. END;
  2856. ReleaseOperand(left); ReleaseOperand(right);
  2857. |Scanner.Minus:
  2858. Evaluate(x.left,left);
  2859. Evaluate(x.right,right);
  2860. IF leftType IS SyntaxTree.SetType THEN
  2861. InitOperand(result,ModeValue);
  2862. Reuse1(result.op,right.op);
  2863. Emit(Not(position,result.op,right.op));
  2864. ReleaseOperand(right);
  2865. Emit(And(position,result.op,result.op,left.op));
  2866. ReleaseOperand(left);
  2867. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2868. InitOperand(result,ModeValue);
  2869. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2870. Reuse2(result.tag,left.tag,right.tag);
  2871. Emit(Sub(position,result.op,left.op,right.op));
  2872. Emit(Sub(position,result.tag,left.tag,right.tag));
  2873. ReleaseOperand(left); ReleaseOperand(right)
  2874. ELSE
  2875. InitOperand(result,ModeValue);
  2876. Reuse2a(result.op,left.op,right.op,dest);
  2877. Emit(Sub(position,result.op,left.op,right.op));
  2878. ReleaseOperand(left); ReleaseOperand(right);
  2879. END;
  2880. |Scanner.Times:
  2881. Evaluate(x.left,left);
  2882. Evaluate(x.right,right);
  2883. IF leftType IS SyntaxTree.SetType THEN
  2884. InitOperand(result,ModeValue);
  2885. Reuse2a(result.op,left.op,right.op,dest);
  2886. Emit(And(position,result.op,left.op,right.op));
  2887. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2888. InitOperand(result,ModeValue);
  2889. Reuse1a(result.op,left.op,dest);
  2890. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2891. Emit(Shl(position,result.op,left.op,right.op));
  2892. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2893. InitOperand(result, ModeValue);
  2894. componentType := left.op.type;
  2895. (* TODO: review this *)
  2896. (*
  2897. result.op = left.op * right.op - left.tag * right.tag
  2898. result.tag = left.tag * right.op + left.op * right.tag
  2899. *)
  2900. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2901. Emit(Mul(position,result.op, left.op, right.op));
  2902. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2903. Emit(Mul(position,tempReg, left.tag, right.tag));
  2904. Emit(Sub(position,result.op, result.op, tempReg));
  2905. Reuse2(result.tag, left.tag, right.op);
  2906. Emit(Mul(position,result.tag, left.tag, right.op));
  2907. Emit(Mul(position,tempReg, left.op, right.tag));
  2908. Emit(Add(position,result.tag, result.tag, tempReg));
  2909. ReleaseIntermediateOperand(tempReg)
  2910. ELSE
  2911. InitOperand(result,ModeValue);
  2912. Reuse2a(result.op,left.op,right.op,dest);
  2913. Emit(Mul(position,result.op,left.op,right.op));
  2914. END;
  2915. ReleaseOperand(left); ReleaseOperand(right);
  2916. |Scanner.Div:
  2917. Evaluate(x.left,left);
  2918. Evaluate(x.right,right);
  2919. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2920. InitOperand(result,ModeValue);
  2921. Reuse1a(result.op,left.op,dest);
  2922. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2923. Emit(Shr(position,result.op,left.op,right.op));
  2924. ELSE
  2925. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2926. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2927. IF ~isUnchecked THEN
  2928. exit := NewLabel();
  2929. BrltL(exit,zero,right.op);
  2930. EmitTrap(position,NegativeDivisorTrap);
  2931. SetLabel(exit);
  2932. END;
  2933. END;
  2934. InitOperand(result,ModeValue);
  2935. Reuse2a(result.op,left.op,right.op,dest);
  2936. Emit(Div(position,result.op,left.op,right.op));
  2937. END;
  2938. ReleaseOperand(left); ReleaseOperand(right);
  2939. |Scanner.Mod:
  2940. Evaluate(x.left,left);
  2941. Evaluate(x.right,right);
  2942. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2943. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  2944. InitOperand(result,ModeValue);
  2945. Reuse1a(result.op,left.op,dest);
  2946. Emit(And(position,result.op,left.op,right.op));
  2947. ELSE
  2948. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2949. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2950. IF ~isUnchecked THEN
  2951. exit := NewLabel();
  2952. BrltL(exit,zero,right.op);
  2953. EmitTrap(position,NegativeDivisorTrap);
  2954. SetLabel(exit);
  2955. END;
  2956. END;
  2957. InitOperand(result,ModeValue);
  2958. Reuse2a(result.op,left.op,right.op,dest);
  2959. Emit(Mod(position,result.op,left.op,right.op));
  2960. END;
  2961. ReleaseOperand(left); ReleaseOperand(right);
  2962. |Scanner.Slash:
  2963. Evaluate(x.left,left);
  2964. Evaluate(x.right,right);
  2965. IF leftType IS SyntaxTree.SetType THEN
  2966. InitOperand(result,ModeValue);
  2967. Reuse2a(result.op,left.op,right.op,dest);
  2968. Emit(Xor(position,result.op,left.op,right.op));
  2969. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2970. InitOperand(result,ModeValue);
  2971. componentType := left.op.type;
  2972. (* review this *)
  2973. (*
  2974. divisor = right.op * right.op + right.tag * right.tag
  2975. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2976. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2977. *)
  2978. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2979. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2980. Emit(Mul(position,tempReg, right.op, right.op));
  2981. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2982. Emit(Add(position,tempReg, tempReg, tempReg2));
  2983. result.op := tempReg2;
  2984. Emit(Mul(position,result.op, left.op, right.op));
  2985. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2986. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2987. Emit(Add(position,result.op, result.op, tempReg2));
  2988. Emit(Div(position,result.op, result.op, tempReg));
  2989. Reuse2(result.tag, left.tag, right.op);
  2990. Emit(Mul(position,result.tag, left.tag, right.op));
  2991. Emit(Mul(position,tempReg2, left.op, right.tag));
  2992. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2993. Emit(Div(position,result.tag, result.tag, tempReg));
  2994. ReleaseIntermediateOperand(tempReg);
  2995. ReleaseIntermediateOperand(tempReg2)
  2996. ELSE
  2997. InitOperand(result,ModeValue);
  2998. Reuse2a(result.op,left.op,right.op,dest);
  2999. Emit(Div(position,result.op,left.op,right.op));
  3000. END;
  3001. ReleaseOperand(left); ReleaseOperand(right);
  3002. |Scanner.Equal:
  3003. IF ~conditional THEN ConditionToValue(x);
  3004. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3005. CompareString(BreqL,x.left,x.right);
  3006. ELSE
  3007. Evaluate(x.left,left);
  3008. Evaluate(x.right,right);
  3009. IF leftType IS SyntaxTree.RangeType THEN
  3010. ASSERT(rightType IS SyntaxTree.RangeType);
  3011. BrneL(falseLabel, left.op, right.op); (* first *)
  3012. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3013. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3014. ReleaseOperand(left); ReleaseOperand(right);
  3015. BrL(trueLabel)
  3016. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3017. BrneL(falseLabel, left.op, right.op); (* first *)
  3018. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3019. ReleaseOperand(left); ReleaseOperand(right);
  3020. BrL(trueLabel)
  3021. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3022. (* TODO: review this *)
  3023. BrneL(falseLabel, left.op, right.op); (* real part *)
  3024. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3025. ReleaseOperand(left); ReleaseOperand(right);
  3026. BrL(trueLabel)
  3027. ELSE
  3028. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3029. ReleaseOperand(left); ReleaseOperand(right);
  3030. BrL(trueLabel);
  3031. END;
  3032. END;
  3033. |Scanner.LessEqual:
  3034. IF ~conditional THEN ConditionToValue(x);
  3035. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3036. CompareString(BrgeL,x.right,x.left);
  3037. ELSE
  3038. Evaluate(x.left,left);
  3039. Evaluate(x.right,right);
  3040. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3041. Reuse1(temp.op,right.op);
  3042. Emit(And(position,temp.op,left.op,right.op));
  3043. ReleaseOperand(right);
  3044. BreqL(trueLabel,temp.op,left.op);
  3045. BrL(falseLabel);
  3046. ReleaseOperand(temp);ReleaseOperand(left);
  3047. ELSE
  3048. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3049. ReleaseOperand(left); ReleaseOperand(right);
  3050. BrL(trueLabel);
  3051. END;
  3052. END;
  3053. |Scanner.Less:
  3054. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3055. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3056. leftExpression.SetType(system.booleanType);
  3057. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3058. rightExpression.SetType(system.booleanType);
  3059. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3060. leftExpression.SetType(system.booleanType);
  3061. Expression(leftExpression);
  3062. ELSIF ~conditional THEN ConditionToValue(x);
  3063. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3064. CompareString(BrltL,x.left,x.right);
  3065. ELSE
  3066. Evaluate(x.left,left);
  3067. Evaluate(x.right,right);
  3068. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3069. ReleaseOperand(left); ReleaseOperand(right);
  3070. BrL(trueLabel);
  3071. END;
  3072. |Scanner.Greater:
  3073. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3074. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3075. leftExpression.SetType(system.booleanType);
  3076. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3077. rightExpression.SetType(system.booleanType);
  3078. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3079. leftExpression.SetType(system.booleanType);
  3080. Expression(leftExpression);
  3081. ELSIF ~conditional THEN ConditionToValue(x);
  3082. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3083. CompareString(BrltL,x.right,x.left);
  3084. ELSE
  3085. Evaluate(x.left,left);
  3086. Evaluate(x.right,right);
  3087. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3088. ReleaseOperand(left); ReleaseOperand(right);
  3089. BrL(trueLabel);
  3090. END;
  3091. |Scanner.GreaterEqual:
  3092. IF ~conditional THEN ConditionToValue(x);
  3093. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3094. CompareString(BrgeL,x.left,x.right);
  3095. ELSE
  3096. Evaluate(x.left,left);
  3097. Evaluate(x.right,right);
  3098. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3099. Reuse1(temp.op,left.op);
  3100. Emit(And(position,temp.op,left.op,right.op));
  3101. ReleaseOperand(left);
  3102. BreqL(trueLabel, temp.op,right.op);
  3103. ReleaseOperand(temp); ReleaseOperand(right);
  3104. BrL(falseLabel);
  3105. ELSE
  3106. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3107. ReleaseOperand(left); ReleaseOperand(right);
  3108. BrL(trueLabel);
  3109. END;
  3110. END;
  3111. |Scanner.Unequal:
  3112. IF ~conditional THEN ConditionToValue(x);
  3113. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3114. CompareString(BrneL,x.left,x.right);
  3115. ELSE
  3116. Evaluate(x.left,left);
  3117. Evaluate(x.right,right);
  3118. IF leftType IS SyntaxTree.RangeType THEN
  3119. ASSERT(rightType IS SyntaxTree.RangeType);
  3120. BrneL(trueLabel, left.op, right.op); (* first *)
  3121. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3122. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3123. ReleaseOperand(left); ReleaseOperand(right);
  3124. BrL(falseLabel)
  3125. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3126. BrneL(trueLabel, left.op, right.op); (* first *)
  3127. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3128. ReleaseOperand(left); ReleaseOperand(right);
  3129. BrL(falseLabel)
  3130. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3131. (* TODO: review this *)
  3132. BrneL(trueLabel, left.op, right.op); (* real part *)
  3133. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3134. ReleaseOperand(left); ReleaseOperand(right);
  3135. BrL(falseLabel)
  3136. ELSE
  3137. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3138. ReleaseOperand(left); ReleaseOperand(right);
  3139. BrL(trueLabel);
  3140. END;
  3141. END;
  3142. |Scanner.In:
  3143. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3144. Evaluate(x.left,left);
  3145. Evaluate(x.right,right);
  3146. Convert(left.op,setType);
  3147. ReuseCopy(temp.op,right.op);
  3148. Emit(Shr(position,temp.op,temp.op,left.op));
  3149. ReleaseOperand(right); ReleaseOperand(left);
  3150. IntermediateCode.InitImmediate(one,setType,1);
  3151. Emit(And(position,temp.op,temp.op,one));
  3152. IF conditional THEN
  3153. IntermediateCode.InitImmediate(zero,setType,0);
  3154. BrneL(trueLabel,temp.op,zero);
  3155. ReleaseOperand(temp);
  3156. BrL(falseLabel);
  3157. ELSE
  3158. Convert(temp.op,bool);
  3159. result.mode := ModeValue;
  3160. result.op := temp.op;
  3161. result.tag := nil; (* may be left over from calls to evaluate *)
  3162. END;
  3163. ELSE
  3164. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3165. IF x.operator = Scanner.Questionmarks THEN
  3166. leftExpression := x.left;
  3167. rightExpression := x.right;
  3168. ELSE
  3169. leftExpression := x.right;
  3170. rightExpression := x.left;
  3171. END;
  3172. Evaluate(leftExpression, left);
  3173. Emit(Push(position,left.op));
  3174. ReleaseOperand(left);
  3175. Designate(rightExpression, right);
  3176. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3177. IF ~backend.cellsAreObjects THEN
  3178. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3179. END;
  3180. Emit(Push(position,right.op));
  3181. ReleaseOperand(right);
  3182. IF backend.cellsAreObjects THEN
  3183. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3184. ELSE
  3185. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3186. END;
  3187. InitOperand(result, ModeValue);
  3188. result.op := NewRegisterOperand(bool);
  3189. Emit(Result(position,result.op));
  3190. IF conditional THEN
  3191. IntermediateCode.InitImmediate(zero,setType,0);
  3192. BrneL(trueLabel,result.op,zero);
  3193. ReleaseOperand(result);
  3194. BrL(falseLabel);
  3195. END;
  3196. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3197. leftExpression := x.left;
  3198. rightExpression := x.right;
  3199. Evaluate(leftExpression, left);
  3200. Emit(Push(position,left.op));
  3201. ReleaseOperand(left);
  3202. Evaluate(rightExpression, right);
  3203. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3204. IF ~backend.cellsAreObjects THEN
  3205. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3206. END;
  3207. Emit(Push(position,right.op));
  3208. ReleaseOperand(right);
  3209. IF backend.cellsAreObjects THEN
  3210. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3211. ELSE
  3212. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3213. END;
  3214. InitOperand(result, ModeValue);
  3215. result.op := NewRegisterOperand(bool);
  3216. Emit(Result(position,result.op));
  3217. IF conditional THEN
  3218. IntermediateCode.InitImmediate(zero,setType,0);
  3219. BrneL(trueLabel,result.op,zero);
  3220. ReleaseOperand(result);
  3221. BrL(falseLabel);
  3222. END;
  3223. ELSE
  3224. HALT(100);
  3225. END;
  3226. END;
  3227. destination := dest;
  3228. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3229. END VisitBinaryExpression;
  3230. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3231. VAR localResult, operand: Operand;
  3232. BEGIN
  3233. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3234. InitOperand(localResult, ModeValue);
  3235. ASSERT(x.first # NIL);
  3236. Evaluate(x.first, operand);
  3237. localResult.op := operand.op;
  3238. ReleaseOperand(operand);
  3239. UseIntermediateOperand(localResult.op);
  3240. ASSERT(x.last # NIL);
  3241. Evaluate(x.last, operand);
  3242. localResult.tag := operand.op;
  3243. ReleaseOperand(operand);
  3244. UseIntermediateOperand(localResult.tag);
  3245. IF x.step # NIL THEN
  3246. Evaluate(x.step, operand);
  3247. localResult.extra := operand.op;
  3248. ReleaseOperand(operand);
  3249. UseIntermediateOperand(localResult.extra);
  3250. END;
  3251. result := localResult;
  3252. IF Trace THEN TraceExit("VisitRangeExpression") END
  3253. END VisitRangeExpression;
  3254. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3255. BEGIN
  3256. HALT(100); (* should never be evaluated *)
  3257. END VisitTensorRangeExpression;
  3258. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3259. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3260. BEGIN
  3261. IF Trace THEN TraceEnter("VisitConversion") END;
  3262. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3263. dest := destination; destination := emptyOperand;
  3264. Evaluate(x.expression,old);
  3265. InitOperand(result,ModeValue);
  3266. result.op := old.op;
  3267. ASSERT(result.op.mode # 0);
  3268. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3269. (* convert TO a complex number *)
  3270. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3271. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3272. ASSERT(result.op.mode # 0);
  3273. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3274. (* convert FROM a complex number TO a complex number*)
  3275. result.tag := old.tag;
  3276. ASSERT(result.tag.mode # 0);
  3277. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3278. ASSERT(result.tag.mode # 0)
  3279. ELSE
  3280. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3281. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3282. END
  3283. ELSE
  3284. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3285. ASSERT(result.op.mode # 0);
  3286. result.tag := old.tag; (*! probably never used *)
  3287. END;
  3288. destination := dest;
  3289. IF Trace THEN TraceExit("VisitConversion") END;
  3290. END VisitConversion;
  3291. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3292. BEGIN
  3293. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3294. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3295. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3296. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3297. END VisitTypeDeclaration;
  3298. (** designators (expressions) *)
  3299. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3300. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3301. BEGIN
  3302. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3303. IF x.left # NIL THEN Expression(x.left) END;
  3304. Symbol(x.symbol,result);
  3305. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3306. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3307. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3308. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3309. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3310. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3311. END;
  3312. END;
  3313. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3314. END VisitSymbolDesignator;
  3315. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3316. BEGIN
  3317. IF isUnchecked THEN RETURN END;
  3318. IF tagsAvailable THEN
  3319. TrapC(BrltL,index,length,IndexCheckTrap);
  3320. END;
  3321. END BoundCheck;
  3322. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3323. VAR d: IntermediateCode.Operand;
  3324. BEGIN
  3325. IF isUnchecked THEN RETURN END;
  3326. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3327. TrapC(op,dim,d,ArraySizeTrap);
  3328. ReleaseIntermediateOperand(d);
  3329. END DimensionCheck;
  3330. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3331. VAR
  3332. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3333. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3334. expression: SyntaxTree.Expression;
  3335. resultingType, leftType, baseType: SyntaxTree.Type;
  3336. skipLabel1: Label;
  3337. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3338. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3339. variableOp: Operand;
  3340. variable: SyntaxTree.Variable;
  3341. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3342. VAR expression: SyntaxTree.Expression;
  3343. BEGIN
  3344. (* count the number of indices, ranges and tensorRanges in the index list *)
  3345. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3346. FOR i := 0 TO parameters.Length() - 1 DO
  3347. expression := parameters.GetExpression(i);
  3348. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3349. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3350. ELSE INC(indexCount)
  3351. END
  3352. END;
  3353. END CountIndices;
  3354. BEGIN
  3355. ASSERT(tagsAvailable);
  3356. resultingType := x.type.resolved; (* resulting type *)
  3357. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3358. InitOperand(localResult, ModeReference);
  3359. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3360. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3361. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3362. (* a globally defined array destination tag is available -> use and invalidate it*)
  3363. localResult.tag := arrayDestinationTag;
  3364. IntermediateCode.InitOperand(arrayDestinationTag)
  3365. ELSE
  3366. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3367. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3368. Symbol(variable, variableOp);
  3369. ReuseCopy(localResult.tag, variableOp.op);
  3370. ReleaseOperand(variableOp);
  3371. END
  3372. END;
  3373. indexListSize := x.parameters.Length();
  3374. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3375. ASSERT(tensorRangeCount <= 1);
  3376. (* designate the array to be indexed over, perform tensor range check if known *)
  3377. Designate(x.left, array);
  3378. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3379. Dereference(array, leftType,FALSE);
  3380. IF tensorRangeCount=0 THEN
  3381. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3382. END
  3383. END;
  3384. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3385. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3386. srcDimOffset := -indexListSize;
  3387. destDimOffset := -rangeCount
  3388. ELSE
  3389. srcDimOffset := 0;
  3390. destDimOffset := 0
  3391. END;
  3392. indexDim := 0;
  3393. (* use address of source array as basis *)
  3394. (*
  3395. ReuseCopy(localResult.op, array.op);
  3396. *)
  3397. localResult.op := array.op;
  3398. UseIntermediateOperand(localResult.op);
  3399. (* go through the index list *)
  3400. FOR i := 0 TO indexListSize - 1 DO
  3401. expression := x.parameters.GetExpression(i);
  3402. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3403. (* nothing to do *)
  3404. ELSE
  3405. (* determine which dimension of source array is currently looked at *)
  3406. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3407. (* get the memory operand pointing to array descriptor dimension *)
  3408. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3409. (* make a reusable register from it *)
  3410. ReuseCopy(srcDim, tmp);
  3411. ReleaseIntermediateOperand(tmp);
  3412. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3413. ELSE
  3414. srcDim := IntermediateCode.Immediate(int32, i)
  3415. END;
  3416. (* get length and increment of source array for current dimension *)
  3417. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3418. Convert(sourceLength.op, sizeType);
  3419. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3420. Convert(sourceIncrement.op, sizeType);
  3421. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3422. ReleaseIntermediateOperand(srcDim);
  3423. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3424. (* SINGLE INDEX *)
  3425. Evaluate(expression, index);
  3426. ReleaseIntermediateOperand(index.tag);
  3427. index.tag := emptyOperand;
  3428. Convert(index.op, sizeType);
  3429. (* lower bound check *)
  3430. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3431. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3432. ELSIF isUnchecked THEN (* do nothing *)
  3433. ELSE
  3434. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3435. END;
  3436. (* upper bound check *)
  3437. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3438. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3439. ELSIF isUnchecked THEN (* do nothing *)
  3440. ELSE
  3441. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3442. END;
  3443. ReleaseOperand(sourceLength);
  3444. Convert(index.op, addressType);
  3445. summand := index.op;
  3446. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3447. (* RANGE OF INDICES *)
  3448. Evaluate(expression, range);
  3449. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3450. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3451. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3452. ReleaseOperand(range);
  3453. Convert(firstIndex, sizeType);
  3454. Convert(lastIndex, sizeType);
  3455. Convert(stepSize, sizeType);
  3456. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3457. if it is 'MAX(LONGINT)' *)
  3458. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3459. TransferToRegister(lastIndex, lastIndex);
  3460. skipLabel1 := NewLabel();
  3461. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3462. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3463. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3464. SetLabel(skipLabel1)
  3465. END;
  3466. (* check if step size is valid *)
  3467. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3468. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3469. ELSIF isUnchecked THEN (* do nothing *)
  3470. ELSE
  3471. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3472. END;
  3473. (* check lower bound check *)
  3474. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3475. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3476. ELSIF isUnchecked THEN (* do nothing *)
  3477. ELSE
  3478. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3479. END;
  3480. (* check upper bound check *)
  3481. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3482. (* statically open range: nothing to do *)
  3483. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3484. ASSERT(staticLastIndex < staticSourceLength)
  3485. ELSIF isUnchecked THEN (* do nothing *)
  3486. ELSE
  3487. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3488. END;
  3489. (* determine length of target array for current dimension *)
  3490. (* 1. incorporate last index: *)
  3491. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3492. (* last index is static *)
  3493. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3494. targetLength := sourceLength.op
  3495. ELSE
  3496. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3497. END;
  3498. UseIntermediateOperand(targetLength);
  3499. ELSE
  3500. (* targetLength := lastIndex + 1
  3501. Reuse1(targetLength, lastIndex);
  3502. *)
  3503. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3504. END;
  3505. ReleaseOperand(sourceLength);
  3506. ReleaseIntermediateOperand(lastIndex);
  3507. (* 2. incorporate first index: *)
  3508. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3509. (* first index and current target length are static *)
  3510. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3511. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3512. (* first index = 0: nothing to do *)
  3513. ELSE
  3514. (* targetLength := targetLength - firstIndex *)
  3515. TransferToRegister(targetLength, targetLength);
  3516. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3517. END;
  3518. (* clip negative lengths to 0 *)
  3519. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3520. IF staticTargetLength < 0 THEN
  3521. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3522. END
  3523. ELSE
  3524. skipLabel1 := NewLabel();
  3525. TransferToRegister(targetLength, targetLength);
  3526. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3527. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3528. SetLabel(skipLabel1)
  3529. END;
  3530. (* 3. incorporate index step size: *)
  3531. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3532. (*step size and current target length are static *)
  3533. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3534. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3535. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3536. (* step size = 1: nothing to do *)
  3537. ELSE
  3538. (* emit code for this:
  3539. targetLength := (targetLength-1) DIV stepSize +1;
  3540. *)
  3541. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3542. DivInt(targetLength, targetLength, stepSize);
  3543. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3544. END;
  3545. (* determine increment of target array for current dimension *)
  3546. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3547. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3548. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3549. (* step size = 1 *)
  3550. targetIncrement := sourceIncrement.op;
  3551. UseIntermediateOperand(targetIncrement)
  3552. ELSE
  3553. (* targetIncrement := sourceIncrement * stepSize *)
  3554. Reuse1(targetIncrement, stepSize);
  3555. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3556. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3557. END;
  3558. ReleaseIntermediateOperand(stepSize);
  3559. (* write length and increment of target array to descriptor *)
  3560. IF destDimOffset < 0 THEN
  3561. (* determine which dimension of target array is currently looked at *)
  3562. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3563. TransferToRegister(destDim, tmp);
  3564. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3565. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3566. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3567. ReleaseIntermediateOperand(destDim)
  3568. ELSE
  3569. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3570. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3571. END;
  3572. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3573. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3574. INC(indexDim);
  3575. Convert(firstIndex, addressType);
  3576. TransferToRegister(summand, firstIndex);
  3577. ELSE HALT(100);
  3578. END;
  3579. (*
  3580. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3581. *)
  3582. Convert(sourceIncrement.op, addressType);
  3583. Convert(summand, addressType);
  3584. MulInt(summand, summand, sourceIncrement.op);
  3585. ReleaseIntermediateOperand(sourceIncrement.op);
  3586. AddInt(localResult.op, localResult.op, summand);
  3587. ReleaseIntermediateOperand(summand);
  3588. END
  3589. END;
  3590. result := localResult;
  3591. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3592. ReleaseIntermediateOperand(result.tag);
  3593. result.tag := TypeDescriptorAdr(resultingType);
  3594. IF ~newObjectFile THEN
  3595. IntermediateCode.MakeMemory(result.tag,addressType);
  3596. END;
  3597. ELSIF IsDelegate(resultingType) THEN
  3598. ReleaseIntermediateOperand(result.tag);
  3599. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3600. UseIntermediateOperand(result.tag);
  3601. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3602. ReleaseIntermediateOperand(result.tag);
  3603. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3604. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3605. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3606. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3607. (* finalize target array descriptor *)
  3608. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3609. (* write lengths and increments of target array for remaining dimensions *)
  3610. i := indexListSize;
  3611. WHILE indexDim < targetArrayDimensionality DO
  3612. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3613. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3614. ReleaseOperand(sourceLength);
  3615. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3616. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3617. ReleaseOperand(sourceIncrement);
  3618. INC(i); INC(indexDim);
  3619. END;
  3620. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3621. tmp := nil;
  3622. ELSE
  3623. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3624. END;
  3625. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3626. ReleaseIntermediateOperand(tmp);
  3627. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3628. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3629. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3630. ELSE
  3631. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3632. END;
  3633. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3634. ReleaseIntermediateOperand(tmp);
  3635. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3636. (* write dimensionality *)
  3637. IF targetArrayDimensionality # 0 THEN
  3638. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3639. END;
  3640. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3641. END;
  3642. ReleaseOperand(array);
  3643. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3644. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3645. END;
  3646. END MathIndexDesignator;
  3647. (* TENTATIVE *)
  3648. PROCEDURE DumpOperand(operand: Operand);
  3649. BEGIN
  3650. D.Log.String(" op = ");
  3651. IntermediateCode.DumpOperand(D.Log, operand.op );
  3652. D.Log.Ln;
  3653. D.Log.String(" tag = ");
  3654. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3655. D.Log.Ln;
  3656. D.Log.String(" extra = ");
  3657. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3658. D.Log.Ln;
  3659. D.Log.Update
  3660. END DumpOperand;
  3661. (* get the length of an array , trying to make use of static information *)
  3662. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3663. VAR res: IntermediateCode.Operand; size: LONGINT;
  3664. BEGIN
  3665. type := type.resolved;
  3666. IF type IS SyntaxTree.ArrayType THEN
  3667. WITH type: SyntaxTree.ArrayType DO
  3668. IF type.form = SyntaxTree.Static THEN
  3669. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3670. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3671. Evaluate(type.length, op);
  3672. ReleaseIntermediateOperand(op.tag);
  3673. RETURN op.op;*)
  3674. ELSE
  3675. res := tag;
  3676. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3677. IntermediateCode.MakeMemory(res,addressType);
  3678. UseIntermediateOperand(res);
  3679. RETURN res
  3680. END
  3681. END;
  3682. ELSE
  3683. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3684. RETURN IntermediateCode.Immediate(addressType,size);
  3685. END;
  3686. END ArrayLength;
  3687. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3688. BEGIN
  3689. ReleaseIntermediateOperand(res);
  3690. IF IsImmediate(x) & IsImmediate(y) THEN
  3691. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3692. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3693. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3694. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3695. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3696. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3697. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3698. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3699. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3700. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3701. UseIntermediateOperand(res);
  3702. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3703. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3704. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3705. UseIntermediateOperand(res);
  3706. ELSE
  3707. IF ~ReusableRegister(res) THEN
  3708. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3709. ELSE
  3710. UseIntermediateOperand(res);
  3711. END;
  3712. IF IsImmediate(x) & (x.intValue = 0) THEN
  3713. Emit(Mov(position,res,y))
  3714. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3715. Emit(Mov(position,res,x))
  3716. ELSE
  3717. Emit(Add(position,res, x, y));
  3718. END;
  3719. END;
  3720. END AddInt;
  3721. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3722. BEGIN
  3723. ReleaseIntermediateOperand(res);
  3724. IF IsImmediate(x) & IsImmediate(y) THEN
  3725. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3726. ELSE
  3727. IF ~ReusableRegister(res) THEN
  3728. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3729. ELSE UseIntermediateOperand(res);
  3730. END;
  3731. IF IsImmediate(x) & (x.intValue = 1) THEN
  3732. Emit(Mov(position,res,y))
  3733. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3734. Emit(Mov(position,res,x))
  3735. ELSE
  3736. Emit(Mul(position,res, x, y));
  3737. END;
  3738. END;
  3739. END MulInt;
  3740. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3741. BEGIN
  3742. ReleaseIntermediateOperand(res);
  3743. IF IsImmediate(x) & IsImmediate(y) THEN
  3744. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3745. ELSE
  3746. IF ~ReusableRegister(res) THEN
  3747. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3748. ELSE UseIntermediateOperand(res);
  3749. END;
  3750. IF IsImmediate(x) & (x.intValue = 1) THEN
  3751. Emit(Mov(position,res,y))
  3752. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3753. Emit(Mov(position,res,x))
  3754. ELSE
  3755. Emit(Div(position,res, x, y));
  3756. END;
  3757. END;
  3758. END DivInt;
  3759. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3760. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3761. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3762. BEGIN
  3763. type := x.left.type.resolved;
  3764. IF type IS SyntaxTree.StringType THEN
  3765. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3766. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3767. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3768. type := atype;
  3769. x.left.SetType(type);
  3770. END;
  3771. IntermediateCode.InitImmediate(res,addressType,0);
  3772. maxDim := x.parameters.Length()-1;
  3773. FOR i := 0 TO maxDim DO
  3774. e := x.parameters.GetExpression(i);
  3775. Evaluate(e,index);
  3776. Convert(index.op,addressType);
  3777. AddInt(res, res, index.op);
  3778. IF i = 0 THEN
  3779. (*
  3780. ReuseCopy(res, index.op);
  3781. *)
  3782. Designate(x.left,array);
  3783. type := x.left.type.resolved;
  3784. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3785. Dereference(array, type, FALSE);
  3786. END;
  3787. (*
  3788. ELSE AddInt(res, res, index.op);
  3789. *)
  3790. END;
  3791. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3792. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3793. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3794. BoundCheck(index.op, length);
  3795. END;
  3796. ReleaseIntermediateOperand(length);
  3797. END;
  3798. ReleaseOperand(index);
  3799. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3800. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3801. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3802. MulInt(res,res,length);
  3803. END;
  3804. ReleaseIntermediateOperand(length);
  3805. END;
  3806. IF (type IS SyntaxTree.ArrayType) THEN
  3807. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3808. size := StaticSize(system, type);
  3809. IF size # 1 THEN
  3810. length := IntermediateCode.Immediate(addressType,size);
  3811. MulInt(res,res,length);
  3812. END;
  3813. ELSE
  3814. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3815. IF size # 1 THEN
  3816. length := IntermediateCode.Immediate(addressType,size);
  3817. MulInt(res,res,length);
  3818. END;
  3819. END;
  3820. END;
  3821. AddInt(res,res,array.op);
  3822. InitOperand(result,ModeReference);
  3823. result.op := res;
  3824. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3825. ReleaseIntermediateOperand(result.tag);
  3826. result.tag := TypeDescriptorAdr(type);
  3827. IF ~newObjectFile THEN
  3828. IntermediateCode.MakeMemory(result.tag,addressType);
  3829. END
  3830. ELSIF IsDelegate(type) THEN
  3831. ReleaseIntermediateOperand(result.tag);
  3832. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3833. UseIntermediateOperand(result.tag);
  3834. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3835. ReleaseIntermediateOperand(result.tag);
  3836. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3837. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3838. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3839. END;
  3840. ReleaseOperand(array);
  3841. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3842. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3843. END;
  3844. END IndexDesignator;
  3845. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3846. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3847. BEGIN
  3848. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3849. dest := destination; destination := emptyOperand;
  3850. type := x.left.type.resolved;
  3851. IF type IS SyntaxTree.MathArrayType THEN
  3852. MathIndexDesignator(x);
  3853. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3854. IndexDesignator(x);
  3855. END;
  3856. destination := dest;
  3857. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3858. END VisitIndexDesignator;
  3859. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3860. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3861. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3862. procedure: SyntaxTree.Procedure;
  3863. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3864. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3865. BEGIN
  3866. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3867. parameters := expression.parameters;
  3868. moduleName := "FoxArrayBase";
  3869. procedureName := "CopyDescriptor";
  3870. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3871. SaveRegisters();ReleaseUsedRegisters(saved);
  3872. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3873. IF procedure = NIL THEN
  3874. s := "procedure ";
  3875. Strings.Append(s,moduleName);
  3876. Strings.Append(s,".");
  3877. Strings.Append(s,procedureName);
  3878. Strings.Append(s," not present");
  3879. Error(position,s);
  3880. ELSE
  3881. (* push address of temporary variable *)
  3882. Symbol(variable,destOperand);
  3883. Emit(Push(position,destOperand.op));
  3884. ReleaseOperand(destOperand);
  3885. (* push src *)
  3886. Evaluate(expression.left,srcOperand);
  3887. (*
  3888. Dereference(srcOperand,expression.type.resolved);
  3889. Emit(Push(position,srcOperand.tag));
  3890. *)
  3891. Emit(Push(position,srcOperand.op));
  3892. ReleaseOperand(srcOperand);
  3893. tensorFound := FALSE;
  3894. FOR i := 0 TO parameters.Length()-1 DO
  3895. e := parameters.GetExpression(i);
  3896. IF e IS SyntaxTree.TensorRangeExpression THEN
  3897. tensorFound := TRUE;
  3898. ELSIF e IS SyntaxTree.RangeExpression THEN
  3899. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3900. ELSE
  3901. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3902. END;
  3903. END;
  3904. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  3905. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  3906. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  3907. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  3908. StaticCallOperand(procOp,procedure);
  3909. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  3910. ReleaseOperand(procOp);
  3911. END;
  3912. RestoreRegisters(saved);
  3913. END;
  3914. RETURN variable
  3915. END PrepareTensorDescriptor;
  3916. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  3917. VAR
  3918. type, descriptorType, baseType: SyntaxTree.Type;
  3919. operand, tmpOperand, variableOp, variable2Op: Operand;
  3920. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  3921. variable, variable2: SyntaxTree.Variable;
  3922. dim, i, size: LONGINT;
  3923. (* TODO: needed? *)
  3924. oldArrayDestinationTag: IntermediateCode.Operand;
  3925. oldArrayDestinationDimension: LONGINT;
  3926. position: LONGINT;
  3927. saved: RegisterEntry;
  3928. arrayFlags: SET;
  3929. m, n: LONGINT;
  3930. PROCEDURE Pass(op: IntermediateCode.Operand);
  3931. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  3932. BEGIN
  3933. IF numberRegister >= 0 THEN
  3934. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  3935. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  3936. Emit(Mov(position,parameterRegister, op));
  3937. ELSE
  3938. Emit(Push(position,op))
  3939. END
  3940. END Pass;
  3941. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  3942. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  3943. BEGIN
  3944. formalType := formalType.resolved; actualType := actualType.resolved;
  3945. IF IsOpenArray(formalType)THEN
  3946. IF actualType IS SyntaxTree.StringType THEN
  3947. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  3948. RETURN;
  3949. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  3950. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  3951. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  3952. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  3953. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  3954. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3955. ELSE
  3956. tmp := baseReg;
  3957. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  3958. IntermediateCode.MakeMemory(tmp,addressType);
  3959. Pass((tmp));
  3960. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3961. END;
  3962. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  3963. END;
  3964. END PushArrayLens;
  3965. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  3966. BEGIN
  3967. CASE size OF
  3968. |2: INCL(flags,Size2Flag);
  3969. |3: INCL(flags,Size3Flag);
  3970. |4: INCL(flags,Size4Flag);
  3971. |5: INCL(flags,Size5Flag);
  3972. |6: INCL(flags,Size6Flag);
  3973. |7: INCL(flags,Size7Flag);
  3974. |8: INCL(flags,Size8Flag);
  3975. END;
  3976. END SetSmallArraySizeFlag;
  3977. BEGIN
  3978. IF Trace THEN TraceEnter("PushParameter") END;
  3979. position := expression.position;
  3980. IF expression.resolved # NIL THEN expression := expression.resolved END;
  3981. type := expression.type.resolved;
  3982. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  3983. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  3984. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  3985. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  3986. );
  3987. (* TODO: needed? *)
  3988. oldArrayDestinationTag := arrayDestinationTag;
  3989. oldArrayDestinationDimension := arrayDestinationDimension;
  3990. IF IsArrayOfSystemByte(parameter.type) THEN
  3991. Designate(expression,operand);
  3992. tmp := GetArrayOfBytesSize(expression,operand.tag);
  3993. ReleaseIntermediateOperand(operand.tag);
  3994. operand.tag := tmp;
  3995. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3996. Pass((operand.tag));
  3997. END;
  3998. Pass((operand.op));
  3999. ELSIF IsOpenArray(parameter.type) THEN
  4000. Designate(expression,operand);
  4001. baseReg := operand.tag;
  4002. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4003. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4004. END;
  4005. Pass((operand.op)); (* address of the array *)
  4006. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4007. (* case 1 *)
  4008. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4009. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4010. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4011. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4012. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4013. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4014. arrayDestinationTag := sp;
  4015. (* case 1b *)
  4016. IF expression IS SyntaxTree.IndexDesignator THEN
  4017. (*
  4018. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4019. descriptorType := GetMathArrayDescriptorType(dim);
  4020. variable := GetTemporaryVariable(descriptorType,expression.position);
  4021. Symbol(variable,variableOp);
  4022. arrayDestinationTag := variableOp.op;
  4023. *)
  4024. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4025. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4026. arrayDestinationDimension := dim;
  4027. Designate(expression,operand);
  4028. (* case 1a *)
  4029. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4030. Designate(expression,operand);
  4031. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4032. i := 0;
  4033. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4034. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4035. INC(i);
  4036. END;
  4037. type := expression.type.resolved;
  4038. WHILE (i<dim) DO (* remaining static dimensions *)
  4039. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4040. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4041. ReleaseOperand(tmpOperand);
  4042. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4043. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4044. ReleaseOperand(tmpOperand);
  4045. INC(i);
  4046. END;
  4047. dimOp := IntermediateCode.Immediate(addressType,dim);
  4048. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4049. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4050. (* case 1d *)
  4051. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4052. Designate(expression,operand);
  4053. Dereference(operand,type.resolved,FALSE);
  4054. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4055. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4056. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4057. (* case 1f *)
  4058. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4059. Designate(expression,operand);
  4060. FOR i := 0 TO dim-1 DO
  4061. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4062. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4063. ReleaseOperand(tmpOperand);
  4064. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4065. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4066. ReleaseOperand(tmpOperand);
  4067. END;
  4068. (*******
  4069. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4070. *)
  4071. arrayFlags := {StaticFlag};
  4072. IF dim = 1 THEN
  4073. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4074. ReleaseOperand(tmpOperand);
  4075. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4076. m := LONGINT(tmpOperand.op.intValue);
  4077. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4078. ELSIF dim = 2 THEN
  4079. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4080. ReleaseOperand(tmpOperand);
  4081. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4082. m := LONGINT(tmpOperand.op.intValue);
  4083. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4084. ReleaseOperand(tmpOperand);
  4085. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4086. n := LONGINT(tmpOperand.op.intValue);
  4087. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4088. INCL(arrayFlags,SmallMatrixFlag);
  4089. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4090. END;
  4091. END;
  4092. (*******)
  4093. dimOp := IntermediateCode.Immediate(addressType,dim);
  4094. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4095. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4096. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4097. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4098. baseType := SemanticChecker.ArrayBase(type,dim);
  4099. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4100. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4101. ELSE HALT(100);
  4102. END;
  4103. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4104. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4105. (* case 2b *)
  4106. IF expression IS SyntaxTree.IndexDesignator THEN
  4107. descriptorType := GetMathArrayDescriptorType(dim);
  4108. variable := GetTemporaryVariable(descriptorType, FALSE);
  4109. Symbol(variable,variableOp);
  4110. arrayDestinationTag := variableOp.op;
  4111. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4112. arrayDestinationDimension := dim;
  4113. NeedDescriptor := TRUE;
  4114. Designate(expression,operand);
  4115. Pass((operand.tag));
  4116. NeedDescriptor := FALSE;
  4117. (* case 2a *)
  4118. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4119. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4120. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4121. INC(i);
  4122. END;
  4123. IF i = dim THEN
  4124. Designate(expression,operand);
  4125. Pass((operand.tag));
  4126. ELSE (* open-static *)
  4127. type := expression.type.resolved;
  4128. descriptorType := GetMathArrayDescriptorType(dim);
  4129. variable := GetTemporaryVariable(descriptorType, FALSE);
  4130. Symbol(variable,variableOp);
  4131. arrayDestinationTag := variableOp.op;
  4132. Designate(expression,operand);
  4133. FOR i := 0 TO dim-1 DO
  4134. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4135. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4136. ReleaseOperand(tmpOperand);
  4137. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4138. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4139. ReleaseOperand(tmpOperand);
  4140. END;
  4141. dimOp := IntermediateCode.Immediate(addressType,dim);
  4142. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4143. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4144. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4145. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4146. baseType := SemanticChecker.ArrayBase(type,dim);
  4147. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4148. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4149. Pass((arrayDestinationTag));
  4150. END;
  4151. (* case 2d *)
  4152. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4153. Designate(expression,operand);
  4154. Dereference(operand,type.resolved,FALSE);
  4155. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4156. Pass((operand.tag));
  4157. (* case 2f *)
  4158. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4159. descriptorType := GetMathArrayDescriptorType(dim);
  4160. variable := GetTemporaryVariable(descriptorType, FALSE);
  4161. Symbol(variable,variableOp);
  4162. arrayDestinationTag := variableOp.op;
  4163. Designate(expression,operand);
  4164. FOR i := 0 TO dim-1 DO
  4165. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4166. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4167. ReleaseOperand(tmpOperand);
  4168. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4169. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4170. ReleaseOperand(tmpOperand);
  4171. END;
  4172. (*
  4173. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4174. *)
  4175. arrayFlags := {StaticFlag};
  4176. IF dim = 1 THEN
  4177. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4178. ReleaseOperand(tmpOperand);
  4179. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4180. m := LONGINT(tmpOperand.op.intValue);
  4181. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4182. ELSIF dim = 2 THEN
  4183. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4184. ReleaseOperand(tmpOperand);
  4185. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4186. m := LONGINT(tmpOperand.op.intValue);
  4187. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4188. ReleaseOperand(tmpOperand);
  4189. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4190. n := LONGINT(tmpOperand.op.intValue);
  4191. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4192. INCL(arrayFlags,SmallMatrixFlag);
  4193. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4194. END;
  4195. END;
  4196. (*******)
  4197. dimOp := IntermediateCode.Immediate(addressType,dim);
  4198. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4199. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4200. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4201. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4202. baseType := SemanticChecker.ArrayBase(type,dim);
  4203. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4204. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4205. Pass((arrayDestinationTag));
  4206. ELSE HALT(100);
  4207. END;
  4208. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4209. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4210. (* case 3b *)
  4211. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4212. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4213. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4214. Symbol(variable,variableOp);
  4215. LoadValue(variableOp,system.addressType);
  4216. ELSE
  4217. descriptorType := GetMathArrayDescriptorType(dim);
  4218. variable := GetTemporaryVariable(descriptorType, FALSE);
  4219. Symbol(variable,variableOp);
  4220. END;
  4221. arrayDestinationTag := variableOp.op;
  4222. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4223. arrayDestinationDimension := 0;
  4224. Designate(expression,operand);
  4225. Pass((operand.tag));
  4226. (* case 3a *)
  4227. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4228. i := 0;
  4229. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4230. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4231. INC(i);
  4232. END;
  4233. IF i = dim THEN
  4234. Designate(expression,operand);
  4235. Pass((operand.tag));
  4236. ELSE (* open-static *)
  4237. type := expression.type.resolved;
  4238. descriptorType := GetMathArrayDescriptorType(dim);
  4239. variable := GetTemporaryVariable(descriptorType, FALSE);
  4240. Symbol(variable,variableOp);
  4241. arrayDestinationTag := variableOp.op;
  4242. Designate(expression,operand);
  4243. FOR i := 0 TO dim-1 DO
  4244. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4245. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4246. ReleaseOperand(tmpOperand);
  4247. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4248. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4249. ReleaseOperand(tmpOperand);
  4250. END;
  4251. dimOp := IntermediateCode.Immediate(addressType,dim);
  4252. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4253. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4254. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4255. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4256. baseType := SemanticChecker.ArrayBase(type,dim);
  4257. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4258. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4259. Pass((arrayDestinationTag));
  4260. END;
  4261. (* case 3d *)
  4262. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4263. Designate(expression,operand);
  4264. Dereference(operand,type.resolved,FALSE);
  4265. (*
  4266. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4267. *)
  4268. Pass((operand.tag));
  4269. (* case 3f *)
  4270. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4271. descriptorType := GetMathArrayDescriptorType(dim);
  4272. variable := GetTemporaryVariable(descriptorType, FALSE);
  4273. Symbol(variable,variableOp);
  4274. arrayDestinationTag := variableOp.op;
  4275. Designate(expression,operand);
  4276. IF operand.op.type.length >1 THEN (* vector register *)
  4277. variable2 := GetTemporaryVariable(type, FALSE);
  4278. Symbol(variable2, variable2Op);
  4279. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4280. Emit(Mov(position,tmp, operand.op));
  4281. ReleaseOperand(operand);
  4282. Symbol(variable2, operand);
  4283. END;
  4284. FOR i := 0 TO dim-1 DO
  4285. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4286. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4287. ReleaseOperand(tmpOperand);
  4288. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4289. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4290. ReleaseOperand(tmpOperand);
  4291. END;
  4292. dimOp := IntermediateCode.Immediate(addressType,dim);
  4293. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4294. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4295. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4296. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4297. baseType := SemanticChecker.ArrayBase(type,dim);
  4298. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4299. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4300. Pass((arrayDestinationTag));
  4301. ELSE HALT(100);
  4302. END;
  4303. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4304. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4305. (* case 4b *)
  4306. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4307. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4308. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4309. Symbol(variable,variableOp);
  4310. LoadValue(variableOp,system.addressType);
  4311. ELSE
  4312. descriptorType := GetMathArrayDescriptorType(dim);
  4313. variable := GetTemporaryVariable(descriptorType, FALSE);
  4314. Symbol(variable,variableOp);
  4315. END;
  4316. arrayDestinationTag := variableOp.op;
  4317. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4318. arrayDestinationDimension := 0;
  4319. Designate(expression,operand);
  4320. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4321. Symbol(variable,variableOp);
  4322. ELSE
  4323. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4324. Symbol(variable,variableOp);
  4325. MakeMemory(tmp,variableOp.op,addressType,0);
  4326. Emit(Mov(position,tmp,operand.tag));
  4327. ReleaseIntermediateOperand(tmp);
  4328. END;
  4329. Pass((variableOp.op));
  4330. ReleaseOperand(variableOp);
  4331. (* case 4a *)
  4332. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4333. i := 0;
  4334. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4335. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4336. INC(i);
  4337. END;
  4338. IF i = dim THEN
  4339. Designate(expression,operand);
  4340. arrayDestinationTag := operand.tag;
  4341. ELSE (* open-static *)
  4342. type := expression.type.resolved;
  4343. descriptorType := GetMathArrayDescriptorType(dim);
  4344. variable := GetTemporaryVariable(descriptorType, FALSE);
  4345. Symbol(variable,variableOp);
  4346. arrayDestinationTag := variableOp.op;
  4347. Designate(expression,operand);
  4348. FOR i := 0 TO dim-1 DO
  4349. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4350. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4351. ReleaseOperand(tmpOperand);
  4352. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4353. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4354. ReleaseOperand(tmpOperand);
  4355. END;
  4356. dimOp := IntermediateCode.Immediate(addressType,dim);
  4357. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4358. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4359. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4360. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4361. baseType := SemanticChecker.ArrayBase(type,dim);
  4362. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4363. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4364. END;
  4365. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4366. Symbol(variable,variableOp);
  4367. MakeMemory(tmp,variableOp.op,addressType,0);
  4368. Emit(Mov(position,tmp,arrayDestinationTag));
  4369. ReleaseIntermediateOperand(tmp);
  4370. Pass((variableOp.op));
  4371. ReleaseOperand(variableOp);
  4372. (* case 4d *)
  4373. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4374. Designate(expression,operand);
  4375. (*
  4376. Dereference(operand,type.resolved,FALSE);
  4377. *)
  4378. (*
  4379. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4380. *)
  4381. Pass((operand.op));
  4382. (* case 4f *)
  4383. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4384. descriptorType := GetMathArrayDescriptorType(dim);
  4385. variable := GetTemporaryVariable(descriptorType, FALSE);
  4386. Symbol(variable,variableOp);
  4387. arrayDestinationTag := variableOp.op;
  4388. Designate(expression,operand);
  4389. FOR i := 0 TO dim-1 DO
  4390. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4391. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4392. ReleaseOperand(tmpOperand);
  4393. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4394. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4395. ReleaseOperand(tmpOperand);
  4396. END;
  4397. dimOp := IntermediateCode.Immediate(addressType,dim);
  4398. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4399. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4400. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4401. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4402. baseType := SemanticChecker.ArrayBase(type,dim);
  4403. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4404. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4405. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4406. Symbol(variable,variableOp);
  4407. MakeMemory(tmp,variableOp.op,addressType,0);
  4408. Emit(Mov(position,tmp,arrayDestinationTag));
  4409. ReleaseIntermediateOperand(tmp);
  4410. Pass((variableOp.op));
  4411. ReleaseOperand(variableOp);
  4412. ELSE HALT(100);
  4413. END;
  4414. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4415. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4416. Designate(expression,operand);
  4417. IF operand.op.type.length > 1 THEN
  4418. Emit(Push(position, operand.op));
  4419. ReleaseOperand(operand);
  4420. ELSE
  4421. size := system.SizeOf(type);
  4422. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4423. size := ToMemoryUnits(system,size);
  4424. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4425. arrayDestinationTag := sp;
  4426. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4427. END;
  4428. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4429. Designate(expression,operand);
  4430. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4431. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4432. Symbol(variable,variableOp);
  4433. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4434. Emit(Mov(position,tmp,operand.op));
  4435. Emit(Push(position,variableOp.op));
  4436. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4437. Pass((operand.op));
  4438. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4439. END;
  4440. ELSE HALT(200)
  4441. END;
  4442. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4443. IF parameter.kind = SyntaxTree.VarParameter THEN
  4444. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4445. Designate(expression, operand);
  4446. Pass((operand.op));
  4447. ELSE
  4448. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4449. Evaluate(expression, operand);
  4450. Pass((operand.extra)); (* step *)
  4451. Pass((operand.tag)); (* last *)
  4452. Pass((operand.op)) (* first *)
  4453. END
  4454. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4455. IF parameter.kind = SyntaxTree.VarParameter THEN
  4456. Designate(expression, operand);
  4457. Pass((operand.op));
  4458. ELSE
  4459. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4460. Evaluate(expression, operand);
  4461. Pass((operand.tag)); (* real part *)
  4462. Pass((operand.op)) (* imaginary part *)
  4463. END
  4464. ELSE
  4465. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4466. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4467. Designate(expression,operand);
  4468. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4469. (* stack allocation *)
  4470. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4471. (*! parameter alignment to be discussed ... *)
  4472. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4473. size := type(SyntaxTree.StringType).length;
  4474. END;
  4475. IF backend.cooperative & parameter.NeedsTrace() THEN
  4476. dst := NewRegisterOperand (addressType);
  4477. Emit(Mov(position,dst, sp));
  4478. IntermediateCode.InitImmediate(null, byteType, 0);
  4479. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4480. ReleaseIntermediateOperand(dst);
  4481. SaveRegisters();ReleaseUsedRegisters(saved);
  4482. (* register dst has been freed before SaveRegisters already *)
  4483. CallAssignMethod(dst, operand.op, parameter.type);
  4484. RestoreRegisters(saved);
  4485. END;
  4486. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4487. ELSIF IsOpenArray(parameter.type) THEN
  4488. Designate(expression,operand);
  4489. baseReg := operand.tag;
  4490. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4491. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4492. END;
  4493. Pass((operand.op)); (* address of the array *)
  4494. ELSIF IsDelegate(parameter.type) THEN
  4495. Evaluate(expression,operand);
  4496. IF backend.cooperative & parameter.NeedsTrace() THEN
  4497. Emit(Push(position, nil));
  4498. dst := NewRegisterOperand (addressType);
  4499. Emit(Mov(position,dst, sp));
  4500. ReleaseIntermediateOperand(dst);
  4501. SaveRegisters();ReleaseUsedRegisters(saved);
  4502. Emit(Push(position, dst));
  4503. (* register dst has been freed before SaveRegisters already *)
  4504. Emit(Push(position, operand.tag));
  4505. CallThis(position,"GarbageCollector","Assign",2);
  4506. RestoreRegisters(saved);
  4507. ELSE
  4508. Pass((operand.tag));
  4509. END;
  4510. Pass((operand.op));
  4511. ELSE
  4512. Evaluate(expression,operand);
  4513. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4514. Emit(Push(position, nil));
  4515. dst := NewRegisterOperand (addressType);
  4516. Emit(Mov(position,dst, sp));
  4517. ReleaseIntermediateOperand(dst);
  4518. SaveRegisters();ReleaseUsedRegisters(saved);
  4519. Emit(Push(position, dst));
  4520. (* register dst has been freed before SaveRegisters already *)
  4521. Emit(Push(position, operand.op));
  4522. CallThis(position,"GarbageCollector","Assign",2);
  4523. RestoreRegisters(saved);
  4524. ELSE
  4525. Pass((operand.op));
  4526. END;
  4527. END;
  4528. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4529. Evaluate(expression,operand);
  4530. Pass((operand.op));
  4531. ELSE (* var parameter *)
  4532. Designate(expression,operand);
  4533. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4534. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4535. Pass((operand.tag));
  4536. END;
  4537. END;
  4538. Pass((operand.op));
  4539. END;
  4540. END;
  4541. (* TODO: needed? *)
  4542. arrayDestinationTag := oldArrayDestinationTag;
  4543. arrayDestinationDimension := oldArrayDestinationDimension;
  4544. IF needsParameterBackup THEN
  4545. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4546. ReuseCopy(parameterBackup, operand.op)
  4547. END;
  4548. ReleaseOperand(operand);
  4549. IF Trace THEN TraceExit("PushParameter") END;
  4550. END PushParameter;
  4551. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4552. VAR prevConditional: BOOLEAN;
  4553. BEGIN
  4554. prevConditional := conditional;
  4555. conditional := FALSE;
  4556. IF (x.result # NIL) & ( x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  4557. Expression(x.result); (* use register *)
  4558. END;
  4559. Statement(x.statement);
  4560. conditional := prevConditional;
  4561. IF x.result # NIL THEN Expression(x.result) END;
  4562. IF (x.result # NIL) & (x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  4563. ReleaseIntermediateOperand(result.op);
  4564. END;
  4565. END VisitStatementDesignator;
  4566. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4567. VAR
  4568. procedure: SyntaxTree.Procedure;
  4569. procedureType: SyntaxTree.ProcedureType;
  4570. wasInline: BOOLEAN;
  4571. actualParameters: SyntaxTree.ExpressionList;
  4572. formalParameter: SyntaxTree.Parameter;
  4573. actualParameter: SyntaxTree.Expression;
  4574. i: LONGINT;
  4575. localVariable: SyntaxTree.Variable;
  4576. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4577. src, dest: Operand;
  4578. prevInlineExit : Label;
  4579. prevMapper: SymbolMapper;
  4580. tooComplex: BOOLEAN;
  4581. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4582. BEGIN
  4583. IF e = NIL THEN RETURN TRUE
  4584. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4585. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4586. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4587. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4588. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4589. ELSE RETURN FALSE
  4590. END;
  4591. END SimpleExpression;
  4592. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4593. BEGIN
  4594. RETURN checker.CanPassInRegister(type)
  4595. END FitsInRegister;
  4596. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4597. VAR
  4598. variable: SyntaxTree.Variable;
  4599. variableDesignator: SyntaxTree.Designator;
  4600. BEGIN
  4601. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4602. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4603. variableDesignator.SetType(type);
  4604. RETURN variableDesignator
  4605. END GetTemp;
  4606. BEGIN
  4607. wasInline := currentIsInline;
  4608. prevInlineExit := currentInlineExit;
  4609. prevMapper := currentMapper;
  4610. currentInlineExit := NewLabel();
  4611. tooComplex := FALSE;
  4612. NEW(currentMapper);
  4613. currentIsInline := TRUE;
  4614. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4615. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4616. formalParameter := procedureType.firstParameter;
  4617. actualParameters := x.parameters;
  4618. i := 0;
  4619. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4620. actualParameter := actualParameters.GetExpression(i);
  4621. IF actualParameter.resolved # NIL THEN
  4622. actualParameter := actualParameter.resolved
  4623. END;
  4624. (*
  4625. if expression is simple and can be passed immediately
  4626. or if type fits in register then we can proceed
  4627. otherwise we escape to ordinary procedure call.
  4628. *)
  4629. (* cases where the expression can be mapped identically *)
  4630. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4631. currentMapper.Add(formalParameter, actualParameter, NIL);
  4632. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4633. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4634. (*
  4635. Assign(variableDesignator, actualParameter);
  4636. *)
  4637. Evaluate(actualParameter, src);
  4638. Designate(variableDesignator, dest);
  4639. Emit(Mov(x.position, dest.op, src.op));
  4640. ReleaseOperand(dest);
  4641. ReleaseOperand(src);
  4642. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4643. ELSE tooComplex := TRUE
  4644. END;
  4645. (*
  4646. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4647. currentMapper.Add(formalParameter, actualParameter, NIL);
  4648. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4649. variableDesignator := GetTemp(system.addressType, FALSE);
  4650. Designate(actualParameter, src);
  4651. Designate(variableDesignator, dest);
  4652. IntermediateCode.MakeMemory(dest.op,addressType);
  4653. Emit(Mov(x.position, dest.op, src.op));
  4654. ReleaseOperand(dest);
  4655. IF src.tag.mode # IntermediateCode.Undefined THEN
  4656. tagDesignator := GetTemp(system.addressType, FALSE);
  4657. Designate(tagDesignator, dest);
  4658. IntermediateCode.MakeMemory(dest.op,addressType);
  4659. Emit(Mov(x.position, dest.op, src.op));
  4660. END;
  4661. ReleaseOperand(dest); ReleaseOperand(src);
  4662. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4663. END;
  4664. *)
  4665. formalParameter := formalParameter.nextParameter;
  4666. INC(i);
  4667. END;
  4668. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4669. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4670. currentMapper.Add(NIL, returnDesignator, NIL);
  4671. END;
  4672. localVariable := procedure.procedureScope.firstVariable;
  4673. WHILE ~tooComplex & (localVariable # NIL) DO
  4674. variableDesignator := GetTemp(localVariable.type, FALSE);
  4675. currentMapper.Add(localVariable, variableDesignator, NIL);
  4676. localVariable := localVariable.nextVariable;
  4677. END;
  4678. IF ~tooComplex THEN
  4679. VisitStatementBlock(procedure.procedureScope.body);
  4680. SetLabel(currentInlineExit);
  4681. IF procedureType.returnType # NIL THEN
  4682. Designate(returnDesignator, result);
  4683. IF conditional THEN
  4684. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4685. ValueToCondition(result)
  4686. END;
  4687. END;
  4688. END;
  4689. currentMapper := prevMapper;
  4690. currentInlineExit := prevInlineExit;
  4691. currentIsInline := wasInline;
  4692. RETURN ~tooComplex
  4693. END InlineProcedureCall;
  4694. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4695. VAR
  4696. parameters: SyntaxTree.ExpressionList;
  4697. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4698. designator: SyntaxTree.Designator;
  4699. procedureType: SyntaxTree.ProcedureType;
  4700. formalParameter: SyntaxTree.Parameter;
  4701. operand, returnValue: Operand;
  4702. reg, size, mask, dest: IntermediateCode.Operand;
  4703. saved: RegisterEntry;
  4704. symbol: SyntaxTree.Symbol;
  4705. variable: SyntaxTree.Variable;
  4706. i, parametersSize, returnTypeSize : LONGINT;
  4707. structuredReturnType: BOOLEAN;
  4708. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4709. tempVariableDesignator: SyntaxTree.Designator;
  4710. gap, alignment: LONGINT; (*fld*)
  4711. (* TODO: remove unnecessary backup variables *)
  4712. oldResult: Operand;
  4713. oldCurrentScope: SyntaxTree.Scope;
  4714. oldArrayDestinationTag: IntermediateCode.Operand;
  4715. oldArrayDestinationDimension: LONGINT;
  4716. oldConstantDeclaration: SyntaxTree.Symbol;
  4717. oldDestination: IntermediateCode.Operand;
  4718. oldCurrentLoop: Label;
  4719. oldConditional: BOOLEAN;
  4720. oldTrueLabel, oldFalseLabel: Label;
  4721. oldLocked: BOOLEAN;
  4722. usedRegisters,oldUsedRegisters: RegisterEntry;
  4723. return: IntermediateCode.Operand;
  4724. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4725. arg: IntermediateCode.Operand;
  4726. dummy: IntermediateCode.Operand;
  4727. recordType: SyntaxTree.RecordType;
  4728. operatorSelectionProcedureOperand: Operand;
  4729. operatorSelectionProcedure: SyntaxTree.Procedure;
  4730. fingerPrint: SyntaxTree.FingerPrint;
  4731. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4732. identifierNumber: LONGINT;
  4733. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4734. procedure: SyntaxTree.Procedure;
  4735. PROCEDURE BackupGlobalState;
  4736. BEGIN
  4737. oldResult := result;
  4738. oldCurrentScope := currentScope;
  4739. oldArrayDestinationTag := arrayDestinationTag;
  4740. oldArrayDestinationDimension := arrayDestinationDimension;
  4741. oldConstantDeclaration := constantDeclaration;
  4742. oldDestination := destination;
  4743. oldCurrentLoop := currentLoop;
  4744. oldConditional := conditional;
  4745. oldTrueLabel := trueLabel;
  4746. oldFalseLabel := falseLabel;
  4747. oldLocked := locked;
  4748. oldUsedRegisters := usedRegisters
  4749. END BackupGlobalState;
  4750. PROCEDURE RestoreGlobalState;
  4751. BEGIN
  4752. result := oldResult;
  4753. currentScope := oldCurrentScope;
  4754. arrayDestinationTag := oldArrayDestinationTag;
  4755. arrayDestinationDimension := oldArrayDestinationDimension;
  4756. constantDeclaration := oldConstantDeclaration;
  4757. destination := oldDestination;
  4758. currentLoop := oldCurrentLoop;
  4759. conditional := oldConditional;
  4760. trueLabel := oldTrueLabel;
  4761. falseLabel := oldFalseLabel;
  4762. locked := oldLocked;
  4763. usedRegisters := oldUsedRegisters
  4764. END RestoreGlobalState;
  4765. (** do preparations before parameter push for array-structured object types (ASOTs):
  4766. if ASOT is passed as VAR parameter:
  4767. - allocate temporary variable of math array type
  4768. - copy contents of ASOT to be passed to temporary variable
  4769. - use temporary variable as the actual parameter instead
  4770. - create and store a write-back call in a list (an index operator call that writes the contents of the temp. variable back into the ASOT)
  4771. **)
  4772. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4773. VAR
  4774. expression: SyntaxTree.Expression;
  4775. BEGIN
  4776. IF actualParameter IS SyntaxTree.Designator THEN
  4777. designator := actualParameter(SyntaxTree.Designator);
  4778. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4779. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4780. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4781. ASSERT(checker # NIL);
  4782. checker.SetCurrentScope(currentScope);
  4783. (* allocate temporary variable *)
  4784. ASSERT(actualParameter.type # NIL);
  4785. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4786. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4787. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4788. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4789. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4790. ASSERT(tempVariableDesignator.type # NIL);
  4791. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4792. (* copy math array stored in actual parameter to temporary variable *)
  4793. BackupGlobalState;
  4794. AssignMathArray(tempVariableDesignator, actualParameter);
  4795. RestoreGlobalState;
  4796. (* use temporary variable as actual parameter instead of the original one *)
  4797. actualParameter := tempVariableDesignator;
  4798. (* create write-back call and store it in linked list *)
  4799. (* create new list entry *)
  4800. IF firstWriteBackCall = NIL THEN
  4801. NEW(firstWriteBackCall);
  4802. currentWriteBackCall := firstWriteBackCall
  4803. ELSE
  4804. ASSERT(currentWriteBackCall # NIL);
  4805. NEW(currentWriteBackCall.next);
  4806. currentWriteBackCall := currentWriteBackCall.next
  4807. END;
  4808. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4809. ASSERT(expression.type = NIL);
  4810. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4811. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4812. (* prepare writeback for any other "normal" indexer *)
  4813. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4814. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4815. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4816. Assign(tempVariableDesignator, actualParameter);
  4817. actualParameter := tempVariableDesignator;
  4818. IF firstWriteBackCall = NIL THEN
  4819. NEW(firstWriteBackCall);
  4820. currentWriteBackCall := firstWriteBackCall
  4821. ELSE
  4822. ASSERT(currentWriteBackCall # NIL);
  4823. NEW(currentWriteBackCall.next);
  4824. currentWriteBackCall := currentWriteBackCall.next
  4825. END;
  4826. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4827. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4828. END
  4829. END
  4830. END PrepareParameter;
  4831. BEGIN
  4832. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4833. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4834. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4835. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4836. IF InlineProcedureCall(x) THEN
  4837. RETURN
  4838. ELSE
  4839. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4840. END
  4841. END;
  4842. END;
  4843. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4844. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4845. dest := destination; destination := emptyOperand;
  4846. SaveRegisters();ReleaseUsedRegisters(saved);
  4847. parameters := x.parameters;
  4848. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4849. (* an operator is called *)
  4850. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4851. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4852. (* check if a dynamic operator call should be performed *)
  4853. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4854. ELSE
  4855. isCallOfDynamicOperator := FALSE
  4856. END;
  4857. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4858. Emit(Push(position, ap));
  4859. END;
  4860. alignment := procedureType.stackAlignment;
  4861. IF alignment > 1 THEN
  4862. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4863. Emit(Mov(position,reg, sp));
  4864. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4865. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4866. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4867. Emit(And(position,sp, sp, mask));
  4868. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4869. Emit(Push(position,reg));
  4870. (*
  4871. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4872. Emit(Mov(position,mem,reg));
  4873. *)
  4874. ReleaseIntermediateOperand(reg);
  4875. END;
  4876. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4877. IntermediateCode.InitImmediate(mask,addressType,-16);
  4878. Emit(And(position,sp, sp, mask));
  4879. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4880. IF gap # 0 THEN
  4881. IntermediateCode.InitImmediate(size,addressType,gap);
  4882. Emit(Sub(position,sp,sp,size))
  4883. END;
  4884. END;
  4885. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4886. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4887. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4888. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4889. ELSE
  4890. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4891. END;
  4892. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4893. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  4894. (* push ID *)
  4895. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4896. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  4897. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  4898. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  4899. formalParameter := procedureType.firstParameter;
  4900. FOR i := 0 TO parameters.Length() - 1 DO
  4901. IF formalParameter.access # SyntaxTree.Hidden THEN
  4902. ASSERT(i < 2);
  4903. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  4904. (* push pointer *)
  4905. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4906. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  4907. (* add dereference *)
  4908. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4909. ReleaseIntermediateOperand(parameterBackups[i]);
  4910. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  4911. END;
  4912. Emit(Push(position,parameterBackups[i]));
  4913. ReleaseIntermediateOperand(parameterBackups[i]);
  4914. (* push typetag *)
  4915. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4916. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  4917. arg := TypeDescriptorAdr(recordType);
  4918. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  4919. Emit(Push(position,arg));
  4920. ELSE
  4921. (* push 'NonPointer' *)
  4922. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4923. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4924. (* push fingerprint *)
  4925. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4926. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  4927. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  4928. END
  4929. END;
  4930. formalParameter := formalParameter.nextParameter
  4931. END;
  4932. (* for unary operators: complete the information for the second parameter *)
  4933. IF procedureType.numberParameters < 2 THEN
  4934. (* push 'NonPointer' *)
  4935. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4936. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4937. (* push 'NoType' *)
  4938. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4939. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  4940. END;
  4941. (* call operator selection procedure *)
  4942. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  4943. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  4944. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  4945. ReleaseOperand(operatorSelectionProcedureOperand);
  4946. (* use the address that the operator selection procedure returned as the target address of the call *)
  4947. InitOperand(operand, ModeValue);
  4948. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4949. Emit(Result(position,operand.op))
  4950. END
  4951. ELSE
  4952. Evaluate(x.left, operand)
  4953. END;
  4954. IF symbol IS SyntaxTree.Procedure THEN
  4955. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4956. Emit(Push(position,operand.tag));
  4957. ELSIF (procedureType.isDelegate) THEN
  4958. Emit(Push(position,operand.tag));
  4959. END;
  4960. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4961. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  4962. Emit(Push(position,operand.tag));
  4963. END;
  4964. ELSE HALT(200);
  4965. END;
  4966. ReleaseIntermediateOperand(operand.tag);
  4967. operand.tag := emptyOperand;
  4968. (* determine if a structured return type is needed *)
  4969. structuredReturnType := StructuredReturnType(procedureType);
  4970. IF structuredReturnType THEN
  4971. IF resultDesignator # NIL THEN
  4972. d := resultDesignator;
  4973. ELSE
  4974. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  4975. variable.SetUntraced(procedureType.hasUntracedReturn);
  4976. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  4977. d.SetType(variable.type);
  4978. END;
  4979. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  4980. Designate(d,returnValue);
  4981. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  4982. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  4983. Emit(Push(position,size));
  4984. Emit(Push(position,returnValue.op));
  4985. ReleaseOperand(returnValue);
  4986. ELSE
  4987. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  4988. END;
  4989. END;
  4990. firstWriteBackCall := NIL; (* reset write-back call list *)
  4991. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  4992. passByRegister := system.registerParameters > 0;
  4993. registerNumber := 0;
  4994. formalParameter := procedureType.lastParameter;
  4995. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  4996. actualParameter := parameters.GetExpression(i);
  4997. PrepareParameter(actualParameter, formalParameter);
  4998. IF passByRegister & (i < system.registerParameters) THEN
  4999. IF ~PassInRegister(formalParameter) THEN
  5000. Error(actualParameter.position,"cannot be passed by register")
  5001. ELSE
  5002. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  5003. END;
  5004. INC(registerNumber);
  5005. ELSE
  5006. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5007. END;
  5008. formalParameter := formalParameter.prevParameter;
  5009. END;
  5010. IF passByRegister & (registerNumber > 0) THEN
  5011. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5012. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5013. END;
  5014. ELSE
  5015. hasDynamicOperands := FALSE;
  5016. formalParameter := procedureType.firstParameter;
  5017. FOR i := 0 TO parameters.Length() - 1 DO
  5018. actualParameter := parameters.GetExpression(i);
  5019. IF formalParameter # NIL THEN (* TENTATIVE *)
  5020. PrepareParameter(actualParameter, formalParameter);
  5021. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5022. ASSERT(i < 2);
  5023. hasDynamicOperands := TRUE;
  5024. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5025. ELSE
  5026. IF passByRegister & (registerNumber > 0) THEN
  5027. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5028. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5029. END;
  5030. passByRegister := FALSE;
  5031. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5032. END;
  5033. formalParameter := formalParameter.nextParameter;
  5034. END;
  5035. END;
  5036. END;
  5037. IF symbol IS SyntaxTree.Procedure THEN
  5038. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5039. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5040. Emit(Push(position,reg));
  5041. ReleaseIntermediateOperand(reg);
  5042. END;
  5043. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5044. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5045. parametersSize := ParametersSize(system,procedureType,FALSE);
  5046. END;
  5047. ReleaseParameterRegisters();
  5048. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  5049. Emit(Call(position,operand.op,0));
  5050. ELSE
  5051. Emit(Call(position,operand.op,parametersSize));
  5052. END;
  5053. ReleaseOperand(operand);
  5054. IF procedureType.noReturn THEN
  5055. EmitTrap(position,NoReturnTrap);
  5056. END;
  5057. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5058. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5059. Emit(Result(position,return));
  5060. END;
  5061. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  5062. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  5063. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5064. END;
  5065. size := IntermediateCode.Immediate(addressType,parametersSize);
  5066. Emit(Add(position,sp,sp,size));
  5067. END;
  5068. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5069. IF structuredReturnType THEN
  5070. (* stack pointer rewinding done by callee
  5071. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5072. Emit(Add(position,sp,sp,size));
  5073. *)
  5074. RestoreRegisters(saved);
  5075. InitOperand(result,ModeReference);
  5076. Symbol(variable,result);
  5077. ELSE
  5078. RestoreRegisters(saved);
  5079. InitOperand(result,ModeValue);
  5080. result.op := return;
  5081. END;
  5082. END;
  5083. IF alignment > 1 THEN
  5084. Emit(Pop(position,sp));
  5085. END;
  5086. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5087. Emit(Pop(position, ap));
  5088. END;
  5089. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5090. ValueToCondition(result);
  5091. END;
  5092. destination := dest;
  5093. (* perform all write-back calls in the list *)
  5094. BackupGlobalState;
  5095. currentWriteBackCall := firstWriteBackCall;
  5096. WHILE currentWriteBackCall # NIL DO
  5097. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5098. currentWriteBackCall := currentWriteBackCall.next
  5099. END;
  5100. RestoreGlobalState;
  5101. (* TENATIVE *)
  5102. (*
  5103. IF isOperatorCall THEN
  5104. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5105. END;
  5106. *)
  5107. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5108. END VisitProcedureCallDesignator;
  5109. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5110. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5111. td: SyntaxTree.Symbol;
  5112. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5113. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5114. BEGIN
  5115. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5116. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5117. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5118. variable.SetType(system.anyType);
  5119. scope.AddVariable(variable);
  5120. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5121. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5122. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5123. typeDeclaration.SetScope(module.module.moduleScope);
  5124. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5125. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5126. END;
  5127. RETURN hiddenPointerType;
  5128. END GetHiddenPointerType;
  5129. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5130. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5131. BEGIN
  5132. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5133. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5134. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5135. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5136. scope.AddVariable(variable);
  5137. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5138. variable.SetType(system.anyType);
  5139. scope.AddVariable(variable);
  5140. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5141. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5142. typeDeclaration.SetDeclaredType(delegatePointerType);
  5143. typeDeclaration.SetScope(module.module.moduleScope);
  5144. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5145. delegatePointerType.SetState(SyntaxTree.Resolved);
  5146. END;
  5147. RETURN delegatePointerType
  5148. END GetDelegateType;
  5149. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5150. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5151. such as in VAR a: RECORD ... END;
  5152. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5153. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5154. *)
  5155. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5156. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5157. BEGIN (* no code emission *)
  5158. source := NIL;
  5159. x := x.resolved;
  5160. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5161. x := GetHiddenPointerType();
  5162. ELSIF IsDelegate(x) THEN
  5163. x := GetDelegateType();
  5164. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5165. ELSE HALT(200);
  5166. END;
  5167. td := x.typeDeclaration;
  5168. IF td = NIL THEN
  5169. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5170. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5171. ASSERT(td # NIL);
  5172. END;
  5173. IF newObjectFile THEN
  5174. GetCodeSectionNameForSymbol(td,name);
  5175. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5176. meta.CheckTypeDeclaration(x);
  5177. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5178. ELSE
  5179. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5180. END;
  5181. IF backend.cooperative OR meta.simple THEN
  5182. offset := 0;
  5183. ELSE
  5184. IF x IS SyntaxTree.CellType THEN
  5185. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5186. IF baseRecord = NIL THEN
  5187. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5188. ELSE
  5189. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5190. END;
  5191. ELSE
  5192. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5193. END;
  5194. END;
  5195. ELSE
  5196. offset := 0;
  5197. source := module.allSections.FindBySymbol(td); (*TODO*)
  5198. IF source = NIL THEN
  5199. null := 0;
  5200. GetCodeSectionNameForSymbol(td,name);
  5201. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5202. IntermediateCode.InitImmediate(op,addressType,0);
  5203. source(IntermediateCode.Section).Emit(Data(position,op));
  5204. source.SetReferenced(FALSE)
  5205. ELSE
  5206. name := source.name;
  5207. END;
  5208. END;
  5209. RETURN td
  5210. END GetBackendType;
  5211. BEGIN
  5212. (*td := t.typeDeclaration;*)
  5213. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5214. (*
  5215. IF t IS SyntaxTree.PointerType THEN
  5216. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5217. ELSE
  5218. source := GetBackendType(t);
  5219. END;
  5220. *)
  5221. IF newObjectFile THEN
  5222. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5223. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5224. IntermediateCode.SetOffset(res,offset);
  5225. ELSE
  5226. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5227. END;
  5228. (*
  5229. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5230. make memory should be used when tag is used, not earlier
  5231. *)
  5232. RETURN res
  5233. END TypeDescriptorAdr;
  5234. (*
  5235. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5236. VAR result: IntermediateCode.Operand;
  5237. BEGIN
  5238. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5239. operand.tag := TypeDescriptorAdr(operand.type);
  5240. IntermediateCode.MakeMemory(operand.tag,addressType);
  5241. UseIntermediateOperand(operand.tag);
  5242. END;
  5243. END MakeTypeTag;
  5244. *)
  5245. PROCEDURE ProfilerInit;
  5246. VAR reg: IntermediateCode.Operand;
  5247. BEGIN
  5248. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5249. Emit(Call(position,reg,0));
  5250. END ProfilerInit;
  5251. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5252. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5253. BEGIN
  5254. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5255. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5256. THEN
  5257. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5258. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5259. Emit(Push(position,reg));
  5260. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5261. Emit(Push(position,reg));
  5262. StaticCallOperand(result,procedure);
  5263. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5264. ReleaseOperand(result);
  5265. END;
  5266. END ProfilerEnterExit;
  5267. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5268. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5269. BEGIN
  5270. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5271. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5272. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5273. profileInit.Emit(Push(position,reg));
  5274. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5275. profileInit.Emit(Push(position,reg));
  5276. NEW(string, LEN(name)); COPY(name, string^);
  5277. sv := SyntaxTree.NewStringValue(-1,string);
  5278. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5279. sv.SetType(type);
  5280. Designate(sv,result);
  5281. profileInit.Emit(Push(position,result.tag));
  5282. profileInit.Emit(Push(position,result.op));
  5283. StaticCallOperand(result,procedure);
  5284. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5285. ReleaseOperand(result);
  5286. END;
  5287. END ProfilerAddProcedure;
  5288. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5289. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5290. BEGIN
  5291. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5292. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5293. profileInit.Emit(Push(position,reg));
  5294. profileInitPatchPosition := profileInit.pc;
  5295. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5296. NEW(string, LEN(name)); COPY(name, string^);
  5297. sv := SyntaxTree.NewStringValue(-1,string);
  5298. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5299. sv.SetType(type);
  5300. Designate(sv,result);
  5301. profileInit.Emit(Push(position,result.tag));
  5302. profileInit.Emit(Push(position,result.op));
  5303. StaticCallOperand(result,procedure);
  5304. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5305. ReleaseOperand(result);
  5306. END;
  5307. END ProfilerAddModule;
  5308. PROCEDURE ProfilerPatchInit;
  5309. VAR reg: IntermediateCode.Operand;
  5310. BEGIN
  5311. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5312. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5313. EmitLeave(profileInit,position,0);
  5314. profileInit.Emit(Exit(position,0,0));
  5315. END ProfilerPatchInit;
  5316. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5317. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5318. VAR
  5319. id: LONGINT;
  5320. leftType, rightType: SyntaxTree.Type;
  5321. procedureType: SyntaxTree.ProcedureType;
  5322. runtimeProcedure: SyntaxTree.Procedure;
  5323. runtimeProcedureOperand, operatorOperand: Operand;
  5324. kind: SET;
  5325. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5326. VAR
  5327. arg: IntermediateCode.Operand;
  5328. recordType: SyntaxTree.RecordType;
  5329. fingerPrint: SyntaxTree.FingerPrint;
  5330. BEGIN
  5331. IF type = NIL THEN
  5332. (* no type: push 'NoType' *)
  5333. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5334. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5335. ELSIF IsStrictlyPointerToRecord(type) THEN
  5336. (* pointer to record type: push typetag *)
  5337. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5338. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5339. arg := TypeDescriptorAdr(recordType);
  5340. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5341. ELSE
  5342. (* non-pointer to record type: push fingerprint *)
  5343. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5344. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5345. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5346. END;
  5347. operatorInitializationCodeSection.Emit(Push(position,arg))
  5348. END PushTypeInfo;
  5349. BEGIN
  5350. ASSERT(operatorInitializationCodeSection # NIL);
  5351. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5352. procedureType := operator.type(SyntaxTree.ProcedureType);
  5353. (* determine types *)
  5354. leftType := procedureType.firstParameter.type;
  5355. IF procedureType.numberParameters = 2 THEN
  5356. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5357. rightType := procedureType.firstParameter.nextParameter.type;
  5358. ELSE
  5359. rightType := NIL
  5360. END;
  5361. (* determine operator kind *)
  5362. IF IsStrictlyPointerToRecord(leftType) THEN
  5363. kind := {LhsIsPointer}
  5364. ELSE
  5365. kind := {}
  5366. END;
  5367. IF IsStrictlyPointerToRecord(rightType) THEN
  5368. kind := kind + {RhsIsPointer}
  5369. END;
  5370. IF kind # {} THEN (* TODO: to be removed later on *)
  5371. (* at least one of the types is a pointer to record *)
  5372. (* emit a code that registers this specific operator in the runtime *)
  5373. dump := operatorInitializationCodeSection.comments;
  5374. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5375. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5376. (* push ID *)
  5377. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5378. id := Global.GetSymbol(module.module.case, operator.name);
  5379. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5380. (* push kind *)
  5381. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5382. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5383. (* push type infos *)
  5384. PushTypeInfo(leftType);
  5385. PushTypeInfo(rightType);
  5386. (* push operator address *)
  5387. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5388. StaticCallOperand(operatorOperand, operator);
  5389. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5390. ReleaseOperand(operatorOperand);
  5391. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5392. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5393. ReleaseOperand(runtimeProcedureOperand)
  5394. END
  5395. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5396. END
  5397. END RegisterDynamicOperator;
  5398. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5399. VAR
  5400. traceModule: SyntaxTree.Module;
  5401. procedure: SyntaxTree.Procedure;
  5402. procedureVariable: SyntaxTree.Variable;
  5403. s,msg: Basic.MessageString;
  5404. res: Operand;
  5405. i: LONGINT;
  5406. sv: SyntaxTree.StringValue;
  5407. type: SyntaxTree.Type;
  5408. recordType: SyntaxTree.RecordType;
  5409. printout: Printout.Printer;
  5410. stringWriter: Streams.StringWriter;
  5411. expression: SyntaxTree.Expression;
  5412. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5413. BEGIN
  5414. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5415. IF procedure = NIL THEN
  5416. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5417. END;
  5418. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5419. s := "procedure ";
  5420. Strings.Append(s,backend.traceModuleName);
  5421. Strings.Append(s,".");
  5422. Strings.Append(s,procedureName);
  5423. Strings.Append(s," not present");
  5424. Error(position,s);
  5425. RETURN FALSE
  5426. ELSE
  5427. RETURN TRUE
  5428. END;
  5429. END GetProcedure;
  5430. PROCEDURE CallProcedure;
  5431. VAR size: LONGINT;
  5432. BEGIN
  5433. IF procedure # NIL THEN
  5434. StaticCallOperand(result,procedure);
  5435. size := ProcedureParametersSize(system,procedure);
  5436. ELSE
  5437. Symbol(procedureVariable, result);
  5438. LoadValue(result, procedureVariable.type.resolved);
  5439. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5440. END;
  5441. Emit(Call(position,result.op,size));
  5442. END CallProcedure;
  5443. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5444. VAR res: Operand; string: SyntaxTree.String;
  5445. BEGIN
  5446. IF GetProcedure("String") THEN
  5447. NEW(string, LEN(s)); COPY(s, string^);
  5448. sv := SyntaxTree.NewStringValue(-1,string);
  5449. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5450. sv.SetType(type);
  5451. Designate(sv,res);
  5452. Emit(Push(position,res.tag));
  5453. Emit(Push(position,res.op));
  5454. ReleaseOperand(res);
  5455. CallProcedure;
  5456. END;
  5457. END String;
  5458. PROCEDURE Integer(op: IntermediateCode.Operand);
  5459. BEGIN
  5460. IF GetProcedure("Int") THEN
  5461. Emit(Push(position,op));
  5462. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5463. CallProcedure;
  5464. END;
  5465. END Integer;
  5466. PROCEDURE Float(op: IntermediateCode.Operand);
  5467. BEGIN
  5468. IF GetProcedure("HIntHex") THEN
  5469. Emit(Push(position,op));
  5470. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5471. CallProcedure;
  5472. END;
  5473. END Float;
  5474. PROCEDURE Set(op: IntermediateCode.Operand);
  5475. BEGIN
  5476. IF GetProcedure("Set") THEN
  5477. Emit(Push(position,op));
  5478. (*
  5479. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5480. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5481. *)
  5482. CallProcedure;
  5483. END;
  5484. END Set;
  5485. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5486. BEGIN
  5487. IF GetProcedure("Boolean") THEN
  5488. Emit(Push(position,op));
  5489. CallProcedure;
  5490. END;
  5491. END Boolean;
  5492. PROCEDURE Char(op: IntermediateCode.Operand);
  5493. BEGIN
  5494. IF GetProcedure("Char") THEN
  5495. Emit(Push(position,op));
  5496. CallProcedure;
  5497. END;
  5498. END Char;
  5499. PROCEDURE Address(op: IntermediateCode.Operand);
  5500. BEGIN
  5501. IF GetProcedure("Address") THEN
  5502. Emit(Push(position,op));
  5503. CallProcedure;
  5504. END;
  5505. END Address;
  5506. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5507. BEGIN
  5508. IF GetProcedure("String") THEN
  5509. Emit(Push(position,tag));
  5510. Emit(Push(position,op));
  5511. CallProcedure;
  5512. END;
  5513. END StringOperand;
  5514. PROCEDURE Ln;
  5515. BEGIN
  5516. IF GetProcedure("Ln") THEN
  5517. CallProcedure;
  5518. END;
  5519. END Ln;
  5520. BEGIN
  5521. IF backend.traceModuleName = "" THEN RETURN END;
  5522. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5523. IF GetProcedure("Enter") THEN
  5524. CallProcedure
  5525. END;
  5526. NEW(stringWriter,LEN(s));
  5527. FOR i := 0 TO x.Length()-1 DO
  5528. msg := "";
  5529. expression := x.GetExpression(i);
  5530. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5531. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5532. ELSE
  5533. Global.GetModuleName(module.module, s);
  5534. END;
  5535. IF i = 0 THEN
  5536. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5537. stringWriter.String(":");
  5538. END;
  5539. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5540. IF ~(expression IS SyntaxTree.StringValue) THEN
  5541. printout.Expression(expression);
  5542. stringWriter.Get(s);
  5543. Strings.Append(msg,s);
  5544. Strings.Append(msg,"= ");
  5545. ELSE stringWriter.Get(s); (* remove from string writer *)
  5546. Strings.Append(msg, s);
  5547. END;
  5548. String(msg);
  5549. IF SemanticChecker.IsStringType(expression.type) THEN
  5550. Designate(expression,res);
  5551. StringOperand(res.op,res.tag);
  5552. ELSE
  5553. Evaluate(expression,res);
  5554. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5555. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5556. Convert(res.op,int64);
  5557. END;
  5558. Integer(res.op);
  5559. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5560. Boolean(res.op);
  5561. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5562. Set(res.op);
  5563. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5564. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5565. Convert(res.op,float64);
  5566. END;
  5567. Float(res.op);
  5568. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5569. Char(res.op);
  5570. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5571. Address(res.op);String("H");
  5572. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5573. Address(res.op);String("H");
  5574. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5575. Address(res.op);String("H");
  5576. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5577. Address(res.op);String("H");
  5578. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5579. String("NIL");
  5580. ELSE HALT(200);
  5581. END;
  5582. END;
  5583. ReleaseOperand(res);
  5584. String("; ");
  5585. END;
  5586. IF GetProcedure("Exit") THEN
  5587. CallProcedure
  5588. ELSE
  5589. Ln;
  5590. END;
  5591. END;
  5592. END SystemTrace;
  5593. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5594. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5595. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5596. BEGIN
  5597. type := type.resolved;
  5598. IF type IS SyntaxTree.RecordType THEN
  5599. WITH type: SyntaxTree.RecordType DO
  5600. baseType := type.baseType;
  5601. IF baseType # NIL THEN
  5602. baseType := baseType.resolved;
  5603. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5604. InitFields(baseType,adr,offset);
  5605. END;
  5606. variable := type.recordScope.firstVariable;
  5607. WHILE variable # NIL DO
  5608. IF variable.initializer # NIL THEN
  5609. Evaluate(variable.initializer,initializerOp);
  5610. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5611. Emit(Mov(position,mem,initializerOp.op));
  5612. ReleaseOperand(initializerOp);
  5613. ReleaseIntermediateOperand(mem);
  5614. END;
  5615. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5616. variable := variable.nextVariable
  5617. END;
  5618. END;
  5619. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5620. WITH type: SyntaxTree.ArrayType DO
  5621. IF type.form = SyntaxTree.Static THEN
  5622. baseType := type.arrayBase;
  5623. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5624. FOR i := 0 TO type.staticLength-1 DO
  5625. InitFields(baseType,adr,offset+i*size);
  5626. END;
  5627. END;
  5628. END;
  5629. ELSIF type IS SyntaxTree.MathArrayType THEN
  5630. WITH type: SyntaxTree.MathArrayType DO
  5631. IF type.form = SyntaxTree.Open THEN
  5632. dim := DynamicDim(type);
  5633. imm := IntermediateCode.Immediate(addressType,dim);
  5634. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5635. baseType := SemanticChecker.ArrayBase(type,dim);
  5636. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5637. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5638. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5639. ReleaseIntermediateOperand(imm);
  5640. (* flags remain empty (=0) for open array *)
  5641. ELSIF type.form = SyntaxTree.Static THEN
  5642. baseType := type.arrayBase;
  5643. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5644. ASSERT(type.staticLength < 1024*1024*1024);
  5645. FOR i := 0 TO type.staticLength-1 DO
  5646. InitFields(baseType,adr,offset+i*size);
  5647. END;
  5648. END;
  5649. END;
  5650. END;
  5651. END InitFields;
  5652. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5653. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5654. BEGIN
  5655. type := variable.type.resolved;
  5656. IF (type IS SyntaxTree.MathArrayType) THEN
  5657. WITH type: SyntaxTree.MathArrayType DO
  5658. IF type.form = SyntaxTree.Open THEN
  5659. Symbol(variable,operand);
  5660. InitFields(type, operand.tag,0);
  5661. ELSIF type.form = SyntaxTree.Tensor THEN
  5662. Symbol(variable, operand);
  5663. MakeMemory(tmp,operand.op,addressType,0);
  5664. ReleaseOperand(operand);
  5665. Emit(Mov(position,tmp, nil ) );
  5666. ReleaseIntermediateOperand(tmp);
  5667. END;
  5668. END;
  5669. ELSE
  5670. Symbol(variable,operand);
  5671. IF variable.initializer # NIL THEN
  5672. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5673. reference.SetType(variable.type.resolved);
  5674. reference.SetAssignable(TRUE);
  5675. Assign(reference,variable.initializer);
  5676. END;
  5677. InitFields(type, operand.op,0);
  5678. ReleaseOperand(operand);
  5679. END;
  5680. END InitVariable;
  5681. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5682. VAR end: Label;
  5683. BEGIN
  5684. IF type.form = SyntaxTree.Tensor THEN
  5685. InitOperand(result,ModeValue);
  5686. ReuseCopy(result.op,base);
  5687. end := NewLabel();
  5688. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5689. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5690. SetLabel(end);
  5691. Convert(result.op,int32);
  5692. ELSE
  5693. InitOperand(result,ModeValue);
  5694. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5695. END
  5696. END MathArrayDim;
  5697. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5698. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5699. BEGIN
  5700. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5701. MakeMemory(mem,base,addressType,offset);
  5702. Emit(Mov(position,mem,value));
  5703. ReleaseIntermediateOperand(mem);
  5704. END PutMathArrayField;
  5705. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5706. VAR mem: IntermediateCode.Operand;
  5707. BEGIN
  5708. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5709. MakeMemory(mem,base,addressType,offset);
  5710. Emit(Mov(position,mem,value));
  5711. ReleaseIntermediateOperand(mem);
  5712. END PutMathArrayFieldOffset;
  5713. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5714. BEGIN
  5715. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5716. MakeMemory(value,base,addressType,offset);
  5717. END GetMathArrayField;
  5718. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5719. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5720. BEGIN
  5721. IF incr THEN
  5722. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5723. ELSE
  5724. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5725. END;
  5726. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5727. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5728. ELSE
  5729. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5730. Emit(Mov(position,reg,dim));
  5731. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5732. Emit(Add(position,reg,reg,base));
  5733. MakeMemory(mem, reg, addressType, offset);
  5734. ReleaseIntermediateOperand(reg);
  5735. Emit(Mov(position,mem,value));
  5736. ReleaseIntermediateOperand(mem);
  5737. END;
  5738. END PutMathArrayLenOrIncr;
  5739. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5740. BEGIN
  5741. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5742. END PutMathArrayLength;
  5743. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5744. BEGIN
  5745. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5746. END PutMathArrayIncrement;
  5747. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5748. BEGIN
  5749. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5750. END GetMathArrayIncrement;
  5751. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5752. BEGIN
  5753. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5754. END GetMathArrayLength;
  5755. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5756. VAR dimOp: IntermediateCode.Operand;
  5757. BEGIN
  5758. dimOp := IntermediateCode.Immediate(int32, dim);
  5759. GetMathArrayLength(type, operand, dimOp, check, result);
  5760. END GetMathArrayLengthAt;
  5761. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5762. VAR dimOp: IntermediateCode.Operand;
  5763. BEGIN
  5764. dimOp := IntermediateCode.Immediate(int32, dim);
  5765. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5766. END GetMathArrayIncrementAt;
  5767. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5768. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5769. offset: LONGINT;
  5770. BEGIN
  5771. IF increment THEN
  5772. offset := MathIncrOffset;
  5773. ELSE
  5774. offset := MathLenOffset;
  5775. END;
  5776. INC(offset,operand.dimOffset*2);
  5777. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5778. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5779. END;
  5780. (* static dimension *)
  5781. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5782. IF check & (type.form = SyntaxTree.Tensor) THEN
  5783. DimensionCheck(operand.tag,dim,BrltL);
  5784. END;
  5785. val := SHORT(dim.intValue);
  5786. IF type.form # SyntaxTree.Tensor THEN
  5787. t := SemanticChecker.ArrayBase(type,val);
  5788. type := t.resolved(SyntaxTree.MathArrayType);
  5789. IF type.form = SyntaxTree.Static THEN
  5790. IF increment THEN
  5791. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5792. ELSE
  5793. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5794. END;
  5795. InitOperand(result,ModeValue);
  5796. result.op := res;
  5797. RETURN;
  5798. END;
  5799. END;
  5800. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5801. MakeMemory(res,operand.tag,addressType,offset);
  5802. (*
  5803. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5804. *)
  5805. InitOperand(result,ModeValue);
  5806. result.op := res;
  5807. ELSE
  5808. Convert(dim,addressType);
  5809. IF check THEN
  5810. IF type.form = SyntaxTree.Tensor THEN
  5811. DimensionCheck(operand.tag,dim,BrltL);
  5812. ELSIF isUnchecked THEN (* do nothing *)
  5813. ELSE
  5814. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5815. END;
  5816. END;
  5817. end := NewLabel(); next := NIL;
  5818. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5819. Emit(Mov(position,res,dim));
  5820. Convert(res,int32);
  5821. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5822. WHILE t IS SyntaxTree.MathArrayType DO
  5823. type := t(SyntaxTree.MathArrayType);
  5824. IF type.form = SyntaxTree.Static THEN
  5825. imm := IntermediateCode.Immediate(int32,val);
  5826. next := NewLabel();
  5827. BrneL(next,imm,res);
  5828. IF increment THEN
  5829. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5830. ELSE
  5831. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5832. END;
  5833. Emit(MovReplace(position,res,imm));
  5834. BrL(end);
  5835. ELSE hasDynamicPart := TRUE;
  5836. END;
  5837. t := type.arrayBase.resolved;
  5838. val := val + 1;
  5839. IF next # NIL THEN SetLabel(next) END;
  5840. END;
  5841. IF hasDynamicPart THEN
  5842. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5843. Emit(Mov(position,res2,dim));
  5844. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5845. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5846. Emit(Add(position,res2,res2,imm));
  5847. Emit(Add(position,res2,res2,operand.tag));
  5848. IntermediateCode.MakeMemory(res2,int32);
  5849. Emit(MovReplace(position,res,res2));
  5850. ReleaseIntermediateOperand(res2);
  5851. END;
  5852. SetLabel(end);
  5853. Convert(res,int32);
  5854. InitOperand(result,ModeValue);
  5855. result.op := res;
  5856. END;
  5857. END MathArrayLenOrIncr;
  5858. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5859. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5860. offset: LONGINT;
  5861. BEGIN
  5862. offset := operand.dimOffset+DynamicDim(type)-1;
  5863. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5864. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5865. val := SHORT(dim.intValue);
  5866. t := SemanticChecker.ArrayBase(type,val);
  5867. type := t.resolved(SyntaxTree.ArrayType);
  5868. IF type.form = SyntaxTree.Static THEN
  5869. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5870. ELSE
  5871. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5872. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5873. END;
  5874. UseIntermediateOperand(res);
  5875. InitOperand(result,ModeValue);
  5876. result.op := res;
  5877. ELSE
  5878. Convert(dim,addressType);
  5879. IF ~isUnchecked THEN
  5880. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5881. END;
  5882. end := NewLabel(); next := NIL;
  5883. (* ReuseCopy(dim,res); *)
  5884. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5885. Emit(Mov(position,res,dim));
  5886. Convert(res,int32);
  5887. Convert(res,int32);
  5888. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5889. WHILE t IS SyntaxTree.ArrayType DO
  5890. type := t(SyntaxTree.ArrayType);
  5891. IF type.form = SyntaxTree.Static THEN
  5892. imm := IntermediateCode.Immediate(int32,val);
  5893. next := NewLabel();
  5894. BrneL(next,imm,res);
  5895. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5896. Emit(MovReplace(position,res,imm));
  5897. BrL(end);
  5898. ELSE hasDynamicPart := TRUE;
  5899. END;
  5900. t := type.arrayBase.resolved;
  5901. val := val + 1;
  5902. IF next # NIL THEN SetLabel(next) END;
  5903. END;
  5904. IF hasDynamicPart THEN
  5905. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  5906. Convert(res2,addressType);
  5907. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  5908. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5909. Emit(Sub(position,res2,imm,res2));
  5910. Emit(Add(position,res2,res2,operand.tag));
  5911. IntermediateCode.MakeMemory(res2,int32);
  5912. Emit(MovReplace(position,res,res2));
  5913. ReleaseIntermediateOperand(res2);
  5914. END;
  5915. SetLabel(end);
  5916. Convert(res,int32);
  5917. InitOperand(result,ModeValue);
  5918. result.op := res;
  5919. END;
  5920. END ArrayLen;
  5921. (**
  5922. create a temporary variable in current scope
  5923. **)
  5924. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  5925. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  5926. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  5927. BEGIN
  5928. IF ~register THEN
  5929. variable := temporaries.GetFreeVariable(type, index);
  5930. ELSE
  5931. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  5932. END;
  5933. scope := currentScope;
  5934. IF variable = NIL THEN
  5935. COPY("@hiddenIRVar",string);
  5936. Basic.AppendNumber(string,index);
  5937. name := SyntaxTree.NewIdentifier(string);
  5938. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  5939. variable.SetType(type);
  5940. variable.SetAccess(SyntaxTree.Hidden);
  5941. IF ~register THEN
  5942. temporaries.AddVariable(variable);
  5943. IF scope.lastVariable # NIL THEN
  5944. offset := scope.lastVariable.offsetInBits;
  5945. ELSE
  5946. offset := 0;
  5947. END;
  5948. DEC(offset,system.SizeOf(variable.type));
  5949. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  5950. variable(SyntaxTree.Variable).SetOffset(offset);
  5951. scope.AddVariable(variable(SyntaxTree.Variable));
  5952. scope.EnterSymbol(variable, duplicate);
  5953. ASSERT(~duplicate);
  5954. InitVariable(variable(SyntaxTree.Variable));
  5955. ELSE
  5956. variable.SetUseRegister(TRUE);
  5957. variable(SyntaxTree.Variable).SetOffset(0);
  5958. END;
  5959. ELSE
  5960. InitVariable(variable(SyntaxTree.Variable));
  5961. (*
  5962. ASSERT(variable.type.resolved = type.resolved)
  5963. *)
  5964. END;
  5965. RETURN variable(SyntaxTree.Variable)
  5966. END GetTemporaryVariable;
  5967. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  5968. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  5969. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  5970. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  5971. i: LONGINT; duplicate: BOOLEAN;
  5972. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  5973. VAR variable: SyntaxTree.Variable;
  5974. BEGIN
  5975. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  5976. variable.SetType(type);
  5977. recordScope.AddVariable(variable);
  5978. END AddVariable;
  5979. BEGIN
  5980. name := "@ArrayDescriptor";
  5981. Basic.AppendNumber(name,dimensions);
  5982. identifier := SyntaxTree.NewIdentifier(name);
  5983. parentScope := module.module.moduleScope;
  5984. symbol := parentScope.FindSymbol(identifier);
  5985. IF symbol # NIL THEN
  5986. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  5987. type := typeDeclaration.declaredType;
  5988. ELSE
  5989. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  5990. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  5991. recordScope := SyntaxTree.NewRecordScope(parentScope);
  5992. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  5993. recordType.SetTypeDeclaration(typeDeclaration);
  5994. recordType.SetState(SyntaxTree.Resolved);
  5995. typeDeclaration.SetDeclaredType(recordType);
  5996. AddVariable("@ptr",system.anyType);
  5997. AddVariable("@adr",system.addressType);
  5998. AddVariable("@flags",system.addressType);
  5999. AddVariable("@dim",system.addressType);
  6000. AddVariable("@elementSize",system.addressType);
  6001. FOR i := 0 TO dimensions-1 DO
  6002. name := "@len";
  6003. Basic.AppendNumber(name,i);
  6004. AddVariable(name,system.addressType);
  6005. name := "@incr";
  6006. Basic.AppendNumber(name,i);
  6007. AddVariable(name,system.addressType);
  6008. END;
  6009. parentScope.AddTypeDeclaration(typeDeclaration);
  6010. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6011. ASSERT(~duplicate);
  6012. type := recordType;
  6013. END;
  6014. RETURN type
  6015. END GetMathArrayDescriptorType;
  6016. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6017. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6018. BEGIN
  6019. type := GetMathArrayDescriptorType(dimensions);
  6020. Emit(Push(position,op.op));
  6021. (* push type descriptor *)
  6022. reg := TypeDescriptorAdr(type);
  6023. IF ~newObjectFile THEN
  6024. IntermediateCode.MakeMemory(reg,addressType);
  6025. END;
  6026. Emit(Push(position,reg));
  6027. ReleaseIntermediateOperand(reg);
  6028. (* push realtime flag: false by default *)
  6029. Emit(Push(position,false));
  6030. CallThis(position,"Heaps","NewRec",3);
  6031. END NewMathArrayDescriptor;
  6032. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6033. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6034. BEGIN
  6035. NEW(string, LEN(s)); COPY(s, string^);
  6036. sv := SyntaxTree.NewStringValue(-1,string);
  6037. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6038. sv.SetType(type);
  6039. Designate(sv,res);
  6040. Emit(Push(position,res.tag));
  6041. Emit(Push(position,res.op));
  6042. ReleaseOperand(res);
  6043. END PushConstString;
  6044. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6045. BEGIN
  6046. IF b THEN
  6047. Emit(Push(-1, true));
  6048. ELSE
  6049. Emit(Push(-1, false));
  6050. END;
  6051. END PushConstBoolean;
  6052. PROCEDURE PushConstSet(v: SET);
  6053. VAR value: SyntaxTree.Value; op: Operand;
  6054. BEGIN
  6055. value := SyntaxTree.NewSetValue(-1, v);
  6056. value.SetType(system.setType);
  6057. Evaluate(value, op);
  6058. Emit(Push(-1, op.op));
  6059. ReleaseOperand(op);
  6060. END PushConstSet;
  6061. PROCEDURE PushConstInteger(v: LONGINT);
  6062. VAR value: SyntaxTree.Value; op: Operand;
  6063. BEGIN
  6064. value := SyntaxTree.NewIntegerValue(-1, v);
  6065. value.SetType(system.longintType);
  6066. Evaluate(value, op);
  6067. Emit(Push(-1, op.op));
  6068. ReleaseOperand(op);
  6069. END PushConstInteger;
  6070. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6071. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6072. section: IntermediateCode.Section;
  6073. BEGIN
  6074. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6075. Global.GetSymbolSegmentedName(symbol, name);
  6076. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6077. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6078. procedure.SetScope(moduleScope);
  6079. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6080. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6081. procedure.SetAccess(SyntaxTree.Hidden);
  6082. currentScope := procedureScope;
  6083. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6084. EmitEnter(section, -1,NIL,0,0,0);
  6085. RETURN section;
  6086. END OpenInitializer;
  6087. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6088. BEGIN
  6089. EmitLeave(section, 0, 0 );
  6090. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6091. section := prev;
  6092. END CloseInitializer;
  6093. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6094. VAR name: SyntaxTree.IdentifierString;
  6095. variable: SyntaxTree.Variable;
  6096. type: SyntaxTree.Type;
  6097. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6098. BEGIN
  6099. InitOperand(op,ModeReference);
  6100. op.op := fp;
  6101. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6102. Dereference(op, x, FALSE);
  6103. result := op;
  6104. Symbol(symbol, op);
  6105. END Field;
  6106. PROCEDURE Direction(direction: LONGINT): SET;
  6107. BEGIN
  6108. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6109. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6110. ELSE HALT(100);
  6111. END;
  6112. END Direction;
  6113. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6114. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6115. BEGIN
  6116. Field(port, op);
  6117. ToMemory(op.op,addressType,0);
  6118. Emit(Push(-1, op.op));
  6119. ReleaseOperand(op);
  6120. Basic.GetString(modifier.identifier, name);
  6121. PushConstString(name);
  6122. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6123. ASSERT(SemanticChecker.IsStringType(value.type));
  6124. Designate(value, op);
  6125. Emit(Push(modifier.position, op.tag));
  6126. Emit(Push(modifier.position, op.op));
  6127. ReleaseOperand(op);
  6128. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6129. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6130. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6131. Evaluate(value, op);
  6132. Emit(Push(modifier.position, op.op));
  6133. ReleaseOperand(op);
  6134. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6135. ELSE
  6136. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6137. END;
  6138. END AddPortProperty;
  6139. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6140. VAR modifier: SyntaxTree.Modifier;
  6141. BEGIN
  6142. modifier := variable.modifiers;
  6143. WHILE modifier # NIL DO
  6144. AddPortProperty(variable,modifier, modifier.expression);
  6145. modifier := modifier.nextModifier;
  6146. END;
  6147. END AddPortProperties;
  6148. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6149. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6150. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6151. PROCEDURE PushLens(type: SyntaxTree.Type);
  6152. BEGIN
  6153. IF IsSemiDynamicArray(type) THEN
  6154. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6155. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6156. Emit(Push(-1, op.op));
  6157. ReleaseOperand(op);
  6158. INC(dim);
  6159. ELSIF IsStaticArray(type) THEN
  6160. len := len * type(SyntaxTree.ArrayType).staticLength;
  6161. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6162. INC(dim);
  6163. ELSE
  6164. baseType := type;
  6165. END;
  6166. END PushLens;
  6167. BEGIN
  6168. (* cell *)
  6169. IF variable.type IS SyntaxTree.ArrayType THEN
  6170. type := variable.type;
  6171. dim := 0;
  6172. len := 1;
  6173. PushLens(type);
  6174. portType := baseType.resolved(SyntaxTree.PortType);
  6175. ELSE
  6176. portType := variable.type(SyntaxTree.PortType);
  6177. END;
  6178. PushSelfPointer();
  6179. (* port / array of ports *)
  6180. IF IsStaticArray(type) THEN
  6181. PushConstInteger(len);
  6182. END;
  6183. Field(variable, op);
  6184. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6185. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6186. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6187. Designate(d, op);*)
  6188. Emit(Push(-1, op.op));
  6189. ReleaseOperand(op);
  6190. (* name *)
  6191. PushConstString(name);
  6192. (* inout *)
  6193. PushConstSet(Direction(portType.direction));
  6194. (* width *)
  6195. PushConstInteger(portType.sizeInBits);
  6196. IF variable.type IS SyntaxTree.PortType THEN
  6197. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6198. AddPortProperties(variable);
  6199. ELSIF IsStaticArray(type)THEN
  6200. CallThis(variable.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6201. ELSIF IsSemiDynamicArray(type) THEN
  6202. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6203. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6204. Emit(Add(position,reg, sp, size));
  6205. (* dim *)
  6206. PushConstInteger(dim);
  6207. (* len array *)
  6208. Emit(Push(position, reg));
  6209. ReleaseIntermediateOperand(reg);
  6210. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6211. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6212. Emit(Add(position, sp,sp, size));
  6213. ELSE
  6214. HALT(100);
  6215. END;
  6216. END Variable;
  6217. BEGIN
  6218. IF backend.cellsAreObjects THEN
  6219. variable := x.cellScope.firstVariable;
  6220. WHILE (variable # NIL) DO
  6221. type := variable.type.resolved;
  6222. WHILE (type IS SyntaxTree.ArrayType) DO
  6223. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6224. END;
  6225. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6226. Global.GetSymbolNameInScope(variable,x.cellScope,name);
  6227. Variable(name,variable);
  6228. END;
  6229. variable := variable.nextVariable;
  6230. END;
  6231. ELSE HALT(200)
  6232. END;
  6233. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6234. (*
  6235. x.typeDeclaration.GetName(componentName);
  6236. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6237. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6238. instanceType.SetDataMemorySize(dataMemorySize);
  6239. END;
  6240. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6241. instanceType.SetInstructionMemorySize(codeMemorySize)
  6242. END;
  6243. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6244. instanceType.AddCapability(ActiveCells.VectorCapability)
  6245. END;
  6246. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6247. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6248. END;
  6249. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6250. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6251. END;
  6252. AddDevices(instanceType, x);
  6253. *)
  6254. (*
  6255. IF x.isCellNet THEN
  6256. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6257. END;
  6258. *)
  6259. (*currentActiveCellsScope := instanceType;*)
  6260. (*
  6261. parameter := x.firstParameter;
  6262. portIndex := 0;
  6263. WHILE parameter # NIL DO
  6264. parameter.GetName(parameterName);
  6265. parameterType := parameter.type.resolved;
  6266. Parameter(parameterName, parameterType);
  6267. (*
  6268. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6269. ParameterArray(parameterType);
  6270. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6271. FOR i := 0 TO len-1 DO
  6272. COPY(parameterName,name);
  6273. AppendIndex(name,i);
  6274. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6275. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6276. INC(portIndex);
  6277. END;
  6278. ELSE
  6279. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6280. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6281. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6282. INC(portIndex);
  6283. END;
  6284. *)
  6285. parameter := parameter.nextParameter;
  6286. END;
  6287. *)
  6288. (*
  6289. Scope(x.cellScope);
  6290. currentActiveCellsScope := prevActiveCellsScope;
  6291. AddModules(instanceType,x.cellScope);
  6292. *)
  6293. END AddPorts;
  6294. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6295. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6296. BEGIN
  6297. Symbol(cell,op);
  6298. ToMemory(op.op,addressType,0);
  6299. Emit(Push(position,op.op));
  6300. ReleaseOperand(op);
  6301. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6302. PushConstString(name);
  6303. IF SemanticChecker.IsStringType(property.type) OR (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6304. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6305. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6306. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6307. Designate(d, op);
  6308. IF SemanticChecker.IsStringType(property.type) THEN
  6309. Emit(Push(-1, op.tag))
  6310. END;
  6311. Emit(Push(-1, op.op));
  6312. ReleaseOperand(op);
  6313. END;
  6314. IF SemanticChecker.IsStringType(property.type) THEN
  6315. ASSERT(SemanticChecker.IsStringType(value.type));
  6316. Designate(value, op);
  6317. Emit(Push(property.position, op.tag));
  6318. Emit(Push(property.position, op.op));
  6319. ReleaseOperand(op);
  6320. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6321. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6322. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6323. Evaluate(value, op);
  6324. Emit(Push(property.position, op.op));
  6325. ReleaseOperand(op);
  6326. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6327. ELSE
  6328. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6329. END;
  6330. END AddProperty;
  6331. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6332. VAR symbol: SyntaxTree.Symbol;
  6333. BEGIN
  6334. WHILE modifier # NIL DO
  6335. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6336. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6337. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6338. ELSE
  6339. (*! move this check to checker *)
  6340. Error(modifier.position, "undefined property");
  6341. END;
  6342. modifier := modifier.nextModifier;
  6343. END;
  6344. END AddModifiers;
  6345. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6346. VAR last: SyntaxTree.Modifier;
  6347. BEGIN
  6348. IF to = NIL THEN
  6349. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6350. ELSE
  6351. last := to;
  6352. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6353. last := last.nextModifier;
  6354. END;
  6355. IF last.identifier # this.identifier THEN
  6356. ASSERT(last.nextModifier = NIL);
  6357. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6358. END;
  6359. END;
  6360. END AppendModifier;
  6361. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6362. BEGIN
  6363. WHILE this # NIL DO
  6364. AppendModifier(to, this);
  6365. this := this.nextModifier;
  6366. END;
  6367. END AppendModifiers;
  6368. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6369. VAR op: Operand;
  6370. BEGIN
  6371. Evaluate(p, op);
  6372. Emit(Push(p.position, op.op));
  6373. ReleaseOperand(op);
  6374. (*
  6375. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6376. p := p(SyntaxTree.Designator).left;
  6377. END;
  6378. IF p # NIL THEN
  6379. Evaluate(p, op);
  6380. Emit(Push(p.position, op.op));
  6381. ReleaseOperand(op);
  6382. ELSE
  6383. Emit(Push(-1, nil));
  6384. END;
  6385. *)
  6386. END PushPort;
  6387. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6388. VAR
  6389. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6390. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6391. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6392. tmp:IntermediateCode.Operand;
  6393. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6394. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6395. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6396. dest: IntermediateCode.Operand;
  6397. staticLength: LONGINT; itype: IntermediateCode.Type;
  6398. convert,isTensor: BOOLEAN;
  6399. recordType: SyntaxTree.RecordType;
  6400. baseType: SyntaxTree.Type;
  6401. flags: SET;
  6402. left: SyntaxTree.Expression;
  6403. call: SyntaxTree.Designator;
  6404. procedure: SyntaxTree.Procedure;
  6405. temporaryVariable: SyntaxTree.Variable;
  6406. dummy: IntermediateCode.Operand;
  6407. customBuiltin: SyntaxTree.CustomBuiltin;
  6408. isVarPar: ARRAY 3 OF BOOLEAN;
  6409. callsection: Sections.Section;
  6410. segmentedName: Basic.SegmentedName;
  6411. needsTrace: BOOLEAN;
  6412. n: ARRAY 256 OF CHAR;
  6413. modifier: SyntaxTree.Modifier;
  6414. previous, init: IntermediateCode.Section;
  6415. prevScope: SyntaxTree.Scope;
  6416. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6417. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6418. priority: IntermediateCode.Operand;
  6419. op,callop: Operand;
  6420. BEGIN
  6421. IF type = NIL THEN RETURN END;
  6422. type := type.resolved;
  6423. IF type IS SyntaxTree.PointerType THEN
  6424. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6425. END;
  6426. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6427. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6428. recordScope := type(SyntaxTree.RecordType).recordScope;
  6429. IF recordScope.bodyProcedure # NIL THEN
  6430. procedure := recordScope.bodyProcedure;
  6431. body := procedure.procedureScope.body;
  6432. Emit(Push(position,self));
  6433. IF body.isActive THEN
  6434. StaticCallOperand(callop,procedure);
  6435. Emit(Push(position,callop.op));
  6436. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6437. Convert(priority,sizeType);
  6438. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6439. END;
  6440. Emit(Push(position,priority));
  6441. ReleaseIntermediateOperand(priority);
  6442. IF backend.cooperative THEN
  6443. Emit(Push(position,self));
  6444. CallThis(position,"Activities","Create",3)
  6445. ELSE
  6446. flags := 0;
  6447. IF body.isSafe THEN
  6448. flags := 1;
  6449. END;
  6450. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6451. Emit(Push(position,self));
  6452. CallThis(position,"Objects","CreateProcess",4)
  6453. END;
  6454. ELSE
  6455. Emit(Push(position,self));
  6456. StaticCallOperand(callop,procedure);
  6457. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6458. END;
  6459. Emit(Pop(position,self));
  6460. END;
  6461. END CallBodies;
  6462. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6463. BEGIN
  6464. actualType := actualType.resolved;
  6465. IF actualType IS SyntaxTree.StringType THEN
  6466. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6467. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6468. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6469. ELSE
  6470. tmp := op.tag;
  6471. IntermediateCode.MakeMemory(tmp,addressType);
  6472. Emit(Push(position,tmp));
  6473. END;
  6474. Emit(Push(position,op.op))
  6475. END PushString;
  6476. PROCEDURE PushTD(type: SyntaxTree.Type);
  6477. VAR op: IntermediateCode.Operand;
  6478. BEGIN
  6479. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6480. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6481. ELSE
  6482. IF type.resolved IS SyntaxTree.PointerType THEN
  6483. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6484. END;
  6485. op := TypeDescriptorAdr(type.resolved);
  6486. IF ~newObjectFile THEN
  6487. IntermediateCode.MakeMemory(op,addressType);
  6488. END;
  6489. Emit(Push(position,op));
  6490. END
  6491. END PushTD;
  6492. BEGIN
  6493. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6494. dest := destination; destination := emptyOperand;
  6495. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6496. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6497. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6498. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6499. CASE x.id OF
  6500. (* ---- COPY ----- *)
  6501. |Global.Copy:
  6502. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6503. (* ---- EXCL, INCL----- *)
  6504. |Global.Excl,Global.Incl:
  6505. Evaluate(p0,s0);
  6506. Evaluate(p1,s1);
  6507. Convert(s1.op,setType);
  6508. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6509. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6510. END;
  6511. ReuseCopy(res,s0.op);
  6512. ReleaseOperand(s0);
  6513. Reuse1(tmp,s1.op);
  6514. ReleaseOperand(s1);
  6515. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6516. IF x.id = Global.Excl THEN
  6517. Emit(Not(position,tmp,tmp));
  6518. Emit(And(position,res,res,tmp));
  6519. ELSE
  6520. Emit(Or(position,res,res,tmp));
  6521. END;
  6522. ReleaseIntermediateOperand(tmp);
  6523. Designate(p0,s0);
  6524. ToMemory(s0.op,setType,0);
  6525. Emit(Mov(position,s0.op,res));
  6526. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6527. (* ---- DISPOSE ----- *)
  6528. |Global.Dispose:
  6529. Designate(p0,s0);
  6530. Emit(Push(position,s0.op));
  6531. ReleaseOperand(s0);
  6532. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6533. (* ---- GETPROCEDURE ----- *)
  6534. |Global.GetProcedure:
  6535. Designate(p0,s0);
  6536. PushString(s0,p0.type);
  6537. Designate(p1,s1);
  6538. PushString(s1,p1.type);
  6539. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6540. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6541. ELSE PushTD(procedureType.firstParameter.type)
  6542. END;
  6543. PushTD(procedureType.returnType);
  6544. Designate(p2,s2);
  6545. Emit(Push(position,s2.op));
  6546. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6547. CallThis(position,"Modules","GetProcedure", 7);
  6548. (* ---- ASH, LSH, ROT ----- *)
  6549. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6550. Evaluate(p0,s0);
  6551. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6552. (* make unsigned arguments in order to produced a logical shift *)
  6553. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6554. convert:= TRUE;
  6555. itype := s0.op.type;
  6556. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6557. Convert(s0.op,itype);
  6558. ELSE
  6559. convert := FALSE;
  6560. END;
  6561. END;
  6562. Evaluate(p1,s1);
  6563. IF IsIntegerConstant(p1,hint) THEN
  6564. ReuseCopy(reg,s0.op);
  6565. IF hint > 0 THEN
  6566. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6567. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6568. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6569. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6570. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6571. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6572. END;
  6573. ELSIF hint < 0 THEN
  6574. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6575. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6576. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6577. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6578. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6579. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6580. END;
  6581. END;
  6582. ReleaseOperand(s0); ReleaseOperand(s1);
  6583. ELSE
  6584. exit := NewLabel();
  6585. end := NewLabel();
  6586. ReuseCopy(reg,s0.op);
  6587. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6588. Reuse1(tmp,s1.op);
  6589. Emit(Neg(position,tmp,s1.op));
  6590. Convert(tmp,s1.op.type);
  6591. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6592. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6593. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6594. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6595. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6596. END;
  6597. ReleaseIntermediateOperand(tmp);
  6598. BrL(end);
  6599. SetLabel(exit);
  6600. ReuseCopy(tmp,s1.op);
  6601. Convert(tmp,s1.op.type);
  6602. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6603. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6604. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6605. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6606. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6607. END;
  6608. ReleaseIntermediateOperand(tmp);
  6609. SetLabel(end);
  6610. ReleaseOperand(s0); ReleaseOperand(s1);
  6611. END;
  6612. InitOperand(result,ModeValue);
  6613. IF convert THEN
  6614. itype := reg.type;
  6615. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6616. Convert(reg,itype);
  6617. END;
  6618. result.op := reg;
  6619. (* ---- CAP ----- *)
  6620. |Global.Cap:
  6621. Evaluate(p0,result);
  6622. ReuseCopy(reg,result.op);
  6623. ReleaseIntermediateOperand(result.op);
  6624. ignore := NewLabel();
  6625. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6626. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6627. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6628. SetLabel(ignore);
  6629. result.op := reg;
  6630. (* ---- CHR ----- *)
  6631. |Global.Chr, Global.Chr32:
  6632. Evaluate(p0,result);
  6633. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6634. |Global.Entier, Global.EntierH:
  6635. Evaluate(p0,result);
  6636. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6637. (* ---- MIN and MAX ----- *)
  6638. |Global.Max,Global.Min:
  6639. Evaluate(p0,s0);
  6640. Evaluate(p1,s1);
  6641. Reuse2(res,s0.op,s1.op);
  6642. else := NewLabel();
  6643. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6644. ELSE BrltL(else,s1.op,s0.op) END;
  6645. Emit(Mov(position,res,s0.op));
  6646. ReleaseOperand(s0);
  6647. end := NewLabel();
  6648. BrL(end);
  6649. SetLabel(else);
  6650. Emit(MovReplace(position,res,s1.op));
  6651. SetLabel(end);
  6652. ReleaseOperand(s1);
  6653. InitOperand(result,ModeValue);
  6654. result.op := res;
  6655. (* ---- ODD ----- *)
  6656. |Global.Odd:
  6657. IF ~conditional THEN
  6658. ConditionToValue(x)
  6659. ELSE
  6660. Evaluate(p0,result);
  6661. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6662. Reuse1(res,result.op);
  6663. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6664. ReleaseIntermediateOperand(result.op);
  6665. result.op := res;
  6666. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6667. ReleaseOperand(result);
  6668. BrL(falseLabel);
  6669. END;
  6670. (* ---- ORD ----- *)
  6671. |Global.Ord, Global.Ord32:
  6672. Evaluate(p0,result);
  6673. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6674. (* ---- SHORT, LONG ----- *)
  6675. |Global.Short, Global.Long:
  6676. Evaluate(p0,result);
  6677. IF x.type IS SyntaxTree.ComplexType THEN
  6678. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6679. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6680. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6681. ELSE
  6682. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6683. END
  6684. (* ---- HALT, SYSTEM.HALT----- *)
  6685. |Global.Halt, Global.systemHalt:
  6686. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6687. EmitTrap (position, val);
  6688. (* ---- ASSERT ----- *)
  6689. |Global.Assert:
  6690. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6691. trueL := NewLabel();
  6692. falseL := NewLabel();
  6693. Condition(p0,trueL,falseL);
  6694. IF p1 = NIL THEN val := AssertTrap
  6695. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6696. END;
  6697. SetLabel(falseL);
  6698. EmitTrap(position,val);
  6699. SetLabel(trueL);
  6700. END;
  6701. (*
  6702. Emit(TrapC(result.op,val);
  6703. *)
  6704. (* ---- INC, DEC----- *)
  6705. |Global.Inc,Global.Dec:
  6706. Expression(p0); adr := result.op;
  6707. LoadValue(result,p0.type); l := result;
  6708. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6709. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6710. END;
  6711. IF x.id = Global.Inc THEN
  6712. Emit(Add(position,l.op,l.op,r.op));
  6713. ELSE
  6714. Emit(Sub(position,l.op,l.op,r.op));
  6715. END;
  6716. ReleaseOperand(l); ReleaseOperand(r);
  6717. (* ---- LEN ----- *)
  6718. |Global.Len: (* dynamic length, static length done by checker *)
  6719. Designate(p0,operand);
  6720. IF p1 = NIL THEN
  6721. InitOperand(l,ModeValue);
  6722. l.op := IntermediateCode.Immediate(int32,0);
  6723. ELSE
  6724. Evaluate(p1,l);
  6725. END;
  6726. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6727. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6728. Dereference(operand, p0.type.resolved, FALSE);
  6729. END;
  6730. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6731. ReleaseOperand(operand); ReleaseOperand(l);
  6732. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6733. ASSERT(p1 # NIL);
  6734. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6735. Dereference(operand,p0.type.resolved,FALSE);
  6736. END;
  6737. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6738. ReleaseOperand(operand); ReleaseOperand(l);
  6739. ELSE HALT(100);
  6740. END;
  6741. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6742. (* ---- FIRST ---- *)
  6743. |Global.First:
  6744. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6745. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6746. ELSE
  6747. Designate(p0, result)
  6748. END
  6749. (* ---- LAST ---- *)
  6750. |Global.Last:
  6751. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6752. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6753. ELSE
  6754. Designate(p0, result);
  6755. (* make sure result.op is a register *)
  6756. tmp := result.op;
  6757. ReuseCopy(result.op, result.op);
  6758. ReleaseIntermediateOperand(tmp);
  6759. (* add offset to result.op *)
  6760. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6761. END
  6762. (* ---- STEP ---- *)
  6763. |Global.Step:
  6764. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6765. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6766. ELSE
  6767. Designate(p0, result);
  6768. (* make sure result.op is a register *)
  6769. tmp := result.op;
  6770. ReuseCopy(result.op, result.op);
  6771. ReleaseIntermediateOperand(tmp);
  6772. (* add offset to result.op *)
  6773. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6774. END
  6775. (* ---- RE ---- *)
  6776. |Global.Re:
  6777. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6778. Designate(p0, result)
  6779. ELSE
  6780. Evaluate(p0, result)
  6781. END
  6782. (* ---- IM ---- *)
  6783. |Global.Im:
  6784. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6785. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6786. Designate(p0, result);
  6787. (* make sure result.op is a register *)
  6788. tmp := result.op;
  6789. ReuseCopy(result.op, result.op);
  6790. ReleaseIntermediateOperand(tmp);
  6791. (* add offset to result.op *)
  6792. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6793. (* ---- ABS ----- *)
  6794. |Global.Abs:
  6795. Evaluate(p0,operand);
  6796. type := p0.type.resolved;
  6797. InitOperand(result,ModeValue);
  6798. Reuse1a(result.op,operand.op,dest);
  6799. Emit(Abs(position,result.op,operand.op));
  6800. ReleaseOperand(operand);
  6801. (* ---- WAIT ----- *)
  6802. |Global.Wait:
  6803. Evaluate(p0,operand);
  6804. Emit(Push(position,operand.op));
  6805. ReleaseOperand(operand);
  6806. CallThis(position,"Activities","Wait", 1);
  6807. (* ---- NEW ----- *)
  6808. |Global.New:
  6809. (*! the following code is only correct for "standard" Oberon calling convention *)
  6810. type := p0.type.resolved;
  6811. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6812. THEN
  6813. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6814. IF backend.cooperative THEN
  6815. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6816. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6817. IF recordType.isObject THEN
  6818. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6819. IF recordType.IsActive() THEN
  6820. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6821. END;
  6822. IF recordType.IsProtected() THEN
  6823. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6824. END;
  6825. ELSE
  6826. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6827. END;
  6828. END;
  6829. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6830. CallThis(position,"Runtime","New", 1);
  6831. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6832. Emit(Result(position, pointer));
  6833. exit := NewLabel();
  6834. BreqL(exit,pointer,nil);
  6835. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6836. GetRecordTypeName (recordType,name);
  6837. IF ~recordType.isObject THEN
  6838. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6839. END;
  6840. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6841. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6842. IF recordType.isObject THEN
  6843. IF recordType.IsProtected() THEN
  6844. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6845. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6846. END;
  6847. IF recordType.IsActive() THEN
  6848. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6849. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6850. END;
  6851. END;
  6852. END;
  6853. (* initialize fields *)
  6854. IF type(SyntaxTree.PointerType).isPlain THEN
  6855. size := 0;
  6856. ELSIF recordType.isObject THEN
  6857. size := BaseObjectTypeSize;
  6858. ELSE
  6859. size := BaseRecordTypeSize;
  6860. END;
  6861. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  6862. (* call initializer *)
  6863. constructor := GetConstructor(recordType);
  6864. IF constructor # NIL THEN
  6865. (*! should be unified with ProcedureCallDesignator *)
  6866. Emit(Push(position,pointer));
  6867. ReleaseIntermediateOperand(pointer);
  6868. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6869. FOR i := 1 TO x.parameters.Length()-1 DO
  6870. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6871. formalParameter := formalParameter.nextParameter;
  6872. END;
  6873. (* static call of the constructor *)
  6874. GetCodeSectionNameForSymbol(constructor,name);
  6875. ASSERT(~constructor.isInline);
  6876. IF constructor.scope.ownerModule # module.module THEN
  6877. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6878. ELSE
  6879. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6880. END;
  6881. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  6882. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6883. Emit(Pop(position,pointer));
  6884. END;
  6885. (* call bodies *)
  6886. CallBodies(pointer,p0.type);
  6887. SetLabel(exit);
  6888. needsTrace := p0.NeedsTrace();
  6889. IF needsTrace THEN ModifyAssignments(true) END;
  6890. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  6891. Emit(Push(position, pointer));
  6892. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  6893. Emit(Pop(position, pointer));
  6894. END;
  6895. Designate(p0,l);
  6896. IF needsTrace THEN
  6897. CallAssignPointer(l.op, pointer);
  6898. ELSE
  6899. ToMemory(l.op,addressType,0);
  6900. Emit(Mov(position,l.op,pointer));
  6901. END;
  6902. ReleaseIntermediateOperand(pointer);
  6903. ReleaseOperand(l);
  6904. IF needsTrace THEN ModifyAssignments(false) END;
  6905. ELSE
  6906. temporaryVariable := GetTemporaryVariable(type, FALSE);
  6907. IF temporaryVariable # NIL THEN
  6908. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  6909. ELSE
  6910. Designate(p0,l);
  6911. END;
  6912. (* l.op contains address of pointer to record *)
  6913. Emit(Push(position,l.op)); (* address for use after syscall *)
  6914. Emit(Push(position,l.op));
  6915. ReleaseOperand(l);
  6916. (* push type descriptor *)
  6917. reg := TypeDescriptorAdr(recordType);
  6918. IF ~newObjectFile THEN
  6919. IntermediateCode.MakeMemory(reg,addressType);
  6920. END;
  6921. Emit(Push(position,reg));
  6922. ReleaseIntermediateOperand(reg);
  6923. (* push realtime flag *)
  6924. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6925. ELSE Emit(Push(position,false));
  6926. END;
  6927. CallThis(position,"Heaps","NewRec", 3);
  6928. (* check allocation success, if not successful then do not call initializers and bodies *)
  6929. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6930. Emit(Pop(position,pointer));
  6931. MakeMemory(reg,pointer,addressType,0);
  6932. ReleaseIntermediateOperand(pointer);
  6933. pointer := reg;
  6934. exit := NewLabel();
  6935. BreqL(exit,pointer,nil);
  6936. Emit(Push(position,pointer));
  6937. (* initialize fields *)
  6938. InitFields(recordType, pointer,0);
  6939. (* call initializer *)
  6940. constructor := GetConstructor(recordType);
  6941. IF constructor # NIL THEN
  6942. (*! should be unified with ProcedureCallDesignator *)
  6943. Emit(Push(position,pointer));
  6944. ReleaseIntermediateOperand(pointer);
  6945. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6946. FOR i := 1 TO x.parameters.Length()-1 DO
  6947. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6948. formalParameter := formalParameter.nextParameter;
  6949. END;
  6950. (* static call of the constructor *)
  6951. GetCodeSectionNameForSymbol(constructor,name);
  6952. ASSERT(~constructor.isInline);
  6953. IF constructor.scope.ownerModule # module.module THEN
  6954. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6955. ELSE
  6956. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6957. END;
  6958. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  6959. ELSE
  6960. ReleaseIntermediateOperand(pointer);
  6961. END;
  6962. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6963. Emit(Pop(position,pointer));
  6964. IF temporaryVariable # NIL THEN
  6965. Designate(p0,l);
  6966. ToMemory(l.op,addressType,0);
  6967. Emit(Mov(position,l.op,pointer));
  6968. ReleaseOperand(l);
  6969. result.tag := emptyOperand;
  6970. END;
  6971. (* call bodies *)
  6972. CallBodies(pointer,p0.type);
  6973. ReleaseIntermediateOperand(pointer);
  6974. IF temporaryVariable # NIL THEN
  6975. end := NewLabel();
  6976. BrL(end);
  6977. SetLabel(exit);
  6978. Designate(p0,l);
  6979. ToMemory(l.op,addressType,0);
  6980. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  6981. ReleaseOperand(l);
  6982. SetLabel(end);
  6983. ELSE
  6984. SetLabel(exit);
  6985. END;
  6986. END;
  6987. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  6988. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  6989. dim := 0;
  6990. IF p1 # NIL THEN
  6991. FOR i := 1 TO x.parameters.Length()-1 DO
  6992. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6993. parameter := x.parameters.GetExpression(i);
  6994. Evaluate(parameter,r);
  6995. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6996. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  6997. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  6998. END;
  6999. Emit(Push(position,r.op));
  7000. IF i=1 THEN
  7001. ReuseCopy(reg,r.op);
  7002. ELSE
  7003. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7004. END;
  7005. ReleaseOperand(r);
  7006. INC(dim);
  7007. END;
  7008. Convert(reg,addressType);
  7009. ELSE
  7010. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7011. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7012. END;
  7013. openDim := dim;
  7014. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7015. IF backend.cooperative THEN
  7016. size := ToMemoryUnits(system,system.SizeOf(type));
  7017. WHILE type IS SyntaxTree.ArrayType DO
  7018. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7019. END;
  7020. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7021. IF (size # 1) THEN
  7022. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7023. END;
  7024. Emit(Push(position,reg));
  7025. size := ToMemoryUnits(system,system.SizeOf(type));
  7026. IF (size # 1) THEN
  7027. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7028. END;
  7029. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7030. Emit(Push(position,reg));
  7031. ReleaseIntermediateOperand(reg);
  7032. CallThis(position,"Runtime","New", 1);
  7033. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7034. Emit(Result(position, pointer));
  7035. exit := NewLabel();
  7036. else := NewLabel();
  7037. BreqL(else,pointer,nil);
  7038. IF ~type.hasPointers THEN
  7039. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7040. ELSIF type IS SyntaxTree.RecordType THEN
  7041. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7042. ELSIF type IS SyntaxTree.ProcedureType THEN
  7043. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7044. ELSE
  7045. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7046. END;
  7047. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7048. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7049. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DataOffset * system.addressSize)),IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7050. IF type IS SyntaxTree.RecordType THEN
  7051. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7052. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7053. ELSE
  7054. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7055. END;
  7056. i := openDim;
  7057. WHILE i > 0 DO
  7058. DEC (i);
  7059. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7060. END;
  7061. needsTrace := p0.NeedsTrace();
  7062. IF needsTrace THEN ModifyAssignments(true) END;
  7063. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7064. Emit(Push(position, pointer));
  7065. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7066. Emit(Pop(position, pointer));
  7067. END;
  7068. Designate(p0,l);
  7069. IF needsTrace THEN
  7070. CallAssignPointer(l.op, pointer);
  7071. ModifyAssignments(false);
  7072. ELSE
  7073. ToMemory(l.op,addressType,0);
  7074. Emit(Mov(position,l.op,pointer));
  7075. END;
  7076. ReleaseIntermediateOperand(pointer);
  7077. ReleaseOperand(l);
  7078. BrL(exit);
  7079. SetLabel(else);
  7080. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7081. Designate(p0,l);
  7082. IF needsTrace THEN
  7083. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7084. ELSE
  7085. ToMemory(l.op,addressType,0);
  7086. Emit(Mov(position,l.op,pointer));
  7087. END;
  7088. ReleaseOperand(l);
  7089. SetLabel(exit);
  7090. ELSE
  7091. (*! the following code is only correct for "standard" Oberon calling convention *)
  7092. IF SemanticChecker.ContainsPointer(type) THEN
  7093. IF type IS SyntaxTree.ArrayType THEN
  7094. staticLength := 1;
  7095. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7096. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7097. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7098. END;
  7099. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7100. Emit(Mul(position,reg,reg,tmp));
  7101. END;
  7102. Designate(p0,l);
  7103. IF openDim > 0 THEN
  7104. Emit(Push(position,l.op)); (* address for use after syscall *)
  7105. END;
  7106. Emit(Push(position,l.op)); (* address *)
  7107. ReleaseOperand(l);
  7108. tmp := TypeDescriptorAdr(type);
  7109. IF ~newObjectFile THEN
  7110. IntermediateCode.MakeMemory(tmp,addressType);
  7111. END;
  7112. Emit(Push(position,tmp)); (* type descriptor *)
  7113. ReleaseIntermediateOperand(tmp);
  7114. Emit(Push(position,reg)); (* number Elements *)
  7115. ReleaseIntermediateOperand(reg);
  7116. tmp := IntermediateCode.Immediate(addressType,dim);
  7117. Emit(Push(position,tmp)); (* dimensions *)
  7118. (* push realtime flag *)
  7119. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7120. ELSE Emit(Push(position,false));
  7121. END;
  7122. CallThis(position,"Heaps","NewArr",5)
  7123. ELSE
  7124. size := ToMemoryUnits(system,system.SizeOf(type));
  7125. IF (size # 1) THEN
  7126. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7127. END;
  7128. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7129. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7130. Emit(Add(position,reg,reg,tmp));
  7131. Designate(p0,l);
  7132. IF openDim >0 THEN
  7133. Emit(Push(position,l.op)); (* address for use after syscall *)
  7134. END;
  7135. Emit(Push(position,l.op)); (* address for syscall *)
  7136. ReleaseOperand(l); (* pointer address *)
  7137. Emit(Push(position,reg)); (* size *)
  7138. ReleaseIntermediateOperand(reg);
  7139. (* push realtime flag *)
  7140. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7141. ELSE Emit(Push(position,false));
  7142. END;
  7143. CallThis(position,"Heaps","NewSys", 3)
  7144. END;
  7145. IF openDim > 0 THEN
  7146. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7147. Emit(Pop(position,adr));
  7148. ToMemory(adr,addressType,0);
  7149. ReuseCopy(tmp,adr);
  7150. ReleaseIntermediateOperand(adr);
  7151. adr := tmp;
  7152. else := NewLabel();
  7153. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7154. i := openDim-1;
  7155. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7156. WHILE (i >= 0) DO
  7157. Emit(Pop(position,reg));
  7158. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7159. Emit(Mov(position,res,reg));
  7160. DEC(i);
  7161. END;
  7162. ReleaseIntermediateOperand(adr);
  7163. ReleaseIntermediateOperand(reg);
  7164. exit := NewLabel();
  7165. BrL(exit);
  7166. SetLabel(else);
  7167. (* else part: array could not be allocated *)
  7168. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7169. Emit(Add(position,sp,sp,tmp));
  7170. SetLabel(exit);
  7171. END;
  7172. END;
  7173. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7174. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7175. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7176. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7177. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7178. left.SetType(procedure.type);
  7179. formalParameter := procedureType.firstParameter;
  7180. (* push array to allocate *)
  7181. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7182. formalParameter :=formalParameter.nextParameter;
  7183. (* push length array *)
  7184. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7185. (* push size *)
  7186. type := t0;
  7187. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7188. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7189. END;
  7190. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7191. Emit(Push(position,tmp));
  7192. (* *)
  7193. IF SemanticChecker.ContainsPointer(type) THEN
  7194. tmp := TypeDescriptorAdr(type);
  7195. IF ~newObjectFile THEN
  7196. IntermediateCode.MakeMemory(tmp,addressType);
  7197. END;
  7198. ELSE
  7199. tmp := IntermediateCode.Immediate(addressType, 0);
  7200. END;
  7201. Emit(Push(position,tmp)); (* type descriptor *)
  7202. StaticCallOperand(result,procedure);
  7203. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7204. ReleaseOperand(result);
  7205. END;
  7206. (*
  7207. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7208. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7209. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7210. *)
  7211. ELSE
  7212. dim := 0;
  7213. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7214. (* generate geometry descriptor *)
  7215. Designate(p0,l);
  7216. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7217. ReleaseOperand(l);
  7218. isTensor := TRUE;
  7219. ELSE
  7220. isTensor := FALSE;
  7221. END;
  7222. FOR i := 1 TO x.parameters.Length()-1 DO
  7223. IF ~isTensor THEN
  7224. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7225. END;
  7226. parameter := x.parameters.GetExpression(i);
  7227. Evaluate(parameter,r);
  7228. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7229. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7230. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7231. END;
  7232. Emit(Push(position,r.op));
  7233. IF i=1 THEN
  7234. ReuseCopy(reg,r.op);
  7235. ELSE
  7236. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7237. END;
  7238. ReleaseOperand(r);
  7239. INC(dim);
  7240. END;
  7241. Convert(reg,addressType);
  7242. openDim := dim;
  7243. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7244. (*! the following code is only correct for "standard" Oberon calling convention *)
  7245. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7246. t := type;
  7247. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7248. staticLength := 1;
  7249. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7250. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7251. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7252. END;
  7253. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7254. Emit(Mul(position,reg,reg,tmp));
  7255. END;
  7256. Designate(p0,l);
  7257. IF isTensor THEN
  7258. Dereference(l,type,FALSE);
  7259. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7260. END;
  7261. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7262. Emit(Push(position,l.tag)); (* address *)
  7263. ReleaseOperand(l);
  7264. tmp := TypeDescriptorAdr(t);
  7265. IF ~newObjectFile THEN
  7266. IntermediateCode.MakeMemory(tmp,addressType);
  7267. END;
  7268. Emit(Push(position,tmp)); (* type descriptor *)
  7269. ReleaseIntermediateOperand(tmp);
  7270. Emit(Push(position,reg)); (* number Elements *)
  7271. ReleaseIntermediateOperand(reg);
  7272. tmp := IntermediateCode.Immediate(addressType,0);
  7273. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7274. (* push realtime flag: false by default *)
  7275. Emit(Push(position,false));
  7276. CallThis(position,"Heaps","NewArr",5);
  7277. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7278. Emit(Pop(position,adr));
  7279. GetMathArrayField(tmp,adr,MathPtrOffset);
  7280. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7281. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7282. PutMathArrayField(adr,reg,MathAdrOffset);
  7283. ReleaseIntermediateOperand(tmp);
  7284. ReleaseIntermediateOperand(reg);
  7285. ELSE
  7286. IF isTensor THEN
  7287. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7288. ELSE
  7289. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7290. END;
  7291. IF (size # 1) THEN
  7292. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7293. END;
  7294. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7295. Emit(Add(position,reg,reg,tmp));
  7296. Designate(p0,l);
  7297. IF isTensor THEN
  7298. Dereference(l,type,FALSE);
  7299. END;
  7300. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7301. Emit(Push(position,l.tag)); (* address for syscall *)
  7302. ReleaseOperand(l); (* pointer address *)
  7303. Emit(Push(position,reg)); (* size *)
  7304. ReleaseIntermediateOperand(reg);
  7305. (* push realtime flag: false by default *)
  7306. Emit(Push(position,false));
  7307. CallThis(position,"Heaps","NewSys",3);
  7308. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7309. Emit(Pop(position,adr));
  7310. GetMathArrayField(tmp,adr,MathPtrOffset);
  7311. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7312. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7313. PutMathArrayField(adr,reg,MathAdrOffset);
  7314. ReleaseIntermediateOperand(tmp);
  7315. ReleaseIntermediateOperand(reg);
  7316. END;
  7317. flags := {};
  7318. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7319. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7320. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7321. PutMathArrayField(adr,tmp,MathDimOffset);
  7322. else := NewLabel();
  7323. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7324. i := openDim-1;
  7325. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7326. IF isTensor THEN
  7327. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7328. ELSE
  7329. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7330. END;
  7331. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7332. WHILE (i >= 0) DO
  7333. Emit(Pop(position,reg));
  7334. PutMathArrayLength(adr,reg,i);
  7335. PutMathArrayIncrement(adr,tmp,i);
  7336. IF i > 0 THEN
  7337. IF i=openDim-1 THEN
  7338. ReuseCopy(tmp,tmp);
  7339. END;
  7340. Emit(Mul(position,tmp,tmp,reg));
  7341. END;
  7342. DEC(i);
  7343. END;
  7344. ReleaseIntermediateOperand(adr);
  7345. ReleaseIntermediateOperand(reg);
  7346. ReleaseIntermediateOperand(tmp);
  7347. exit := NewLabel();
  7348. BrL(exit);
  7349. SetLabel(else);
  7350. (* else part: array could not be allocated *)
  7351. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7352. Emit(Add(position,sp,sp,tmp));
  7353. SetLabel(exit);
  7354. END;
  7355. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7356. THEN
  7357. IF ~backend.cellsAreObjects THEN RETURN END;
  7358. IF InCellScope(currentScope) THEN
  7359. PushSelfPointer()
  7360. ELSE
  7361. Emit(Push(position, nil));
  7362. END;
  7363. (* push temp address *)
  7364. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7365. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7366. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7367. (* l.op contains address of pointer to record *)
  7368. Emit(Push(position,l.op)); (* address for use after syscall *)
  7369. ReleaseOperand(l);
  7370. (* push type descriptor *)
  7371. reg := TypeDescriptorAdr(baseType);
  7372. IF ~newObjectFile THEN
  7373. IntermediateCode.MakeMemory(reg,addressType);
  7374. END;
  7375. Emit(Push(position,reg));
  7376. ReleaseIntermediateOperand(reg);
  7377. (* push name *)
  7378. (*Global.GetSymbolName(p0, n);*)
  7379. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7380. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7381. ELSE
  7382. Global.GetModuleName(module.module, n);
  7383. END;
  7384. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7385. (*type.typeDeclaration.GetName(n);*)
  7386. PushConstString(n);
  7387. (* push cellnet boolean *)
  7388. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7389. (* push engine boolean *)
  7390. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7391. (* allocate *)
  7392. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7393. (* add capabilities *)
  7394. modifier := p0(SyntaxTree.Designator).modifiers;
  7395. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7396. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7397. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7398. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7399. END;
  7400. AppendModifiers(modifier, baseType(SyntaxTree.CellType).modifiers);
  7401. (*
  7402. modifier := baseType(SyntaxTree.CellType).modifiers;
  7403. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7404. modifier := p0(SyntaxTree.Designator).modifiers;
  7405. *)
  7406. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7407. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7408. (* l.op contains address of pointer to record *)
  7409. ToMemory(l.op,addressType,0);
  7410. (* l.op contains value of pointer to record *)
  7411. Emit(Push(position,l.op)); (* address for use after syscall *)
  7412. ReleaseOperand(l);
  7413. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7414. prevScope := currentScope;
  7415. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7416. previous := section;
  7417. section := init;
  7418. (* add ports *)
  7419. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7420. CloseInitializer(previous);
  7421. currentScope := prevScope;
  7422. Symbol(temporaryVariable,l);
  7423. ToMemory(l.op,addressType,0);
  7424. Emit(Push(position,l.op));
  7425. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7426. (*
  7427. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7428. IF constructor # NIL THEN
  7429. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7430. FOR i := 1 TO x.parameters.Length()-1 DO
  7431. p := x.parameters.GetExpression(i);
  7432. Global.GetSymbolName(parameter,name);
  7433. Evaluate(p, value);
  7434. ASSERT(value.type # NIL);
  7435. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7436. par := instance.AddParameter(name);
  7437. par.SetInteger(value.integer);
  7438. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7439. par := instance.AddParameter(name);
  7440. par.SetBoolean(value.boolean);
  7441. ELSE Error(x.position,NotYetImplemented)
  7442. END;
  7443. parameter := parameter.nextParameter
  7444. END;
  7445. END;
  7446. *)
  7447. (* call initializer *)
  7448. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7449. IF constructor # NIL THEN
  7450. (*! should be unified with ProcedureCallDesignator *)
  7451. IF backend.cellsAreObjects THEN
  7452. Symbol(temporaryVariable,l);
  7453. ToMemory(l.op,addressType,0);
  7454. Emit(Push(position,l.op));
  7455. ReleaseOperand(l);
  7456. END;
  7457. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7458. FOR i := 1 TO x.parameters.Length()-1 DO
  7459. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7460. formalParameter := formalParameter.nextParameter;
  7461. END;
  7462. (* static call of the constructor *)
  7463. Global.GetSymbolSegmentedName(constructor,name);
  7464. ASSERT(~constructor.isInline);
  7465. IF constructor.scope.ownerModule # module.module THEN
  7466. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7467. ELSE
  7468. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7469. END;
  7470. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7471. (*ELSE
  7472. ReleaseIntermediateOperand(pointer);*)
  7473. END;
  7474. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7475. ToMemory(l.op, addressType, 0);
  7476. Designate(p0,s0);
  7477. ToMemory(s0.op,addressType,0);
  7478. Emit(Mov(position,s0.op,l.op));
  7479. ReleaseOperand(l);
  7480. ReleaseOperand(s0);
  7481. result.tag := emptyOperand;
  7482. (* start *)
  7483. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7484. (* push cell *)
  7485. Symbol(temporaryVariable, l);
  7486. ToMemory(l.op,addressType,0);
  7487. Emit(Push(-1,l.op));
  7488. (* push delegate *)
  7489. Emit(Push(-1,l.op));
  7490. ReleaseOperand(l);
  7491. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7492. Emit(Push(position, s1.op));
  7493. ReleaseOperand(s1);
  7494. CallThis(position,"ActiveCellsRuntime","Start",3);
  7495. END;
  7496. (*IF temporaryVariable # NIL THEN
  7497. end := NewLabel();
  7498. BrL(end);
  7499. SetLabel(exit);
  7500. Designate(p0,l);
  7501. ToMemory(l.op,addressType,0);
  7502. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7503. ReleaseOperand(l);
  7504. SetLabel(end);
  7505. ELSE
  7506. SetLabel(exit);
  7507. END;
  7508. *)
  7509. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7510. ELSE (* no pointer to record, no pointer to array *)
  7511. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7512. (* ignore new statement *)
  7513. Warning(p0.position, "cannot run on final hardware");
  7514. ELSE
  7515. HALT(200);
  7516. END;
  7517. END;
  7518. (* ---- ADDRESSOF----- *)
  7519. |Global.systemAdr:
  7520. Designate(p0,s0);
  7521. s0.mode := ModeValue;
  7522. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7523. ReleaseIntermediateOperand(s0.op);
  7524. s0.op := s0.tag;
  7525. IntermediateCode.InitOperand(s0.tag);
  7526. END;
  7527. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7528. result := s0;
  7529. (* ---- BIT ----- *)
  7530. |Global.systemBit:
  7531. Evaluate(p0,s0);
  7532. ToMemory(s0.op,addressType,0);
  7533. ReuseCopy(res,s0.op);
  7534. ReleaseOperand(s0);
  7535. Evaluate(p1,s1);
  7536. Emit(Ror(position,res,res,s1.op));
  7537. ReleaseOperand(s1);
  7538. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7539. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7540. IF ~conditional THEN
  7541. InitOperand(result,ModeValue); result.op := res;
  7542. ELSE
  7543. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7544. BrL(falseLabel);
  7545. ReleaseIntermediateOperand(res);
  7546. END;
  7547. (* --- MSK ----*)
  7548. |Global.systemMsk:
  7549. Evaluate(p0,s0);
  7550. Evaluate(p1,s1);
  7551. ReuseCopy(res,s0.op);
  7552. ReleaseOperand(s0);
  7553. Emit(And(position,res,res,s1.op));
  7554. ReleaseOperand(s1);
  7555. InitOperand(result,ModeValue);
  7556. result.op := res;
  7557. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7558. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7559. Evaluate(p0,s0);
  7560. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7561. ReleaseOperand(s0);
  7562. InitOperand(result,ModeValue);
  7563. result.op := res;
  7564. (* ---- SYSTEM.GetStackPointer ----- *)
  7565. |Global.systemGetStackPointer:
  7566. InitOperand(result,ModeValue);
  7567. result.op := sp;
  7568. (* ---- SYSTEM.GetFramePointer ----- *)
  7569. |Global.systemGetFramePointer:
  7570. InitOperand(result,ModeValue);
  7571. result.op := fp;
  7572. (* ---- SYSTEM.GetActivity ----- *)
  7573. |Global.systemGetActivity:
  7574. ASSERT(backend.cooperative);
  7575. InitOperand(result,ModeValue);
  7576. result.op := ap;
  7577. (* ---- SYSTEM.SetStackPointer ----- *)
  7578. |Global.systemSetStackPointer:
  7579. Evaluate(p0,s0); (* *)
  7580. Emit(Mov(position,sp,s0.op));
  7581. ReleaseOperand(s0);
  7582. (* ---- SYSTEM.SetFramePointer ----- *)
  7583. |Global.systemSetFramePointer:
  7584. Evaluate(p0,s0); (* *)
  7585. Emit(Mov(position,fp,s0.op));
  7586. ReleaseOperand(s0);
  7587. (* ---- SYSTEM.Activity ----- *)
  7588. |Global.systemSetActivity:
  7589. ASSERT(backend.cooperative);
  7590. Evaluate(p0,s0); (* *)
  7591. Emit(Mov(position,ap,s0.op));
  7592. ReleaseOperand(s0);
  7593. (* ---- SYSTEM.VAL ----- *)
  7594. |Global.systemVal:
  7595. Expression(p1);
  7596. s1 := result;
  7597. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7598. IF s1.mode = ModeReference THEN
  7599. (* nothing to be done if not record type, just take over new type *)
  7600. IF (type IS SyntaxTree.RecordType) THEN
  7601. ReleaseIntermediateOperand(s1.tag);
  7602. s1.tag := TypeDescriptorAdr(type);
  7603. IF ~newObjectFile THEN
  7604. IntermediateCode.MakeMemory(s1.tag,addressType);
  7605. END;
  7606. UseIntermediateOperand(s1.tag);
  7607. END;
  7608. result := s1;
  7609. ELSE (* copy over result to different type, may not use convert *)
  7610. itype := IntermediateCode.GetType(system,type);
  7611. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7612. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7613. Emit(Mov(position,s0.op,s1.op));
  7614. ReleaseOperand(s1);
  7615. InitOperand(result,ModeValue);
  7616. result.op := s0.op;
  7617. ELSE (* different size, must convert *)
  7618. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7619. Convert(s1.op, IntermediateCode.GetType(system,type));
  7620. result := s1;
  7621. END;
  7622. END;
  7623. (* ---- SYSTEM.GET ----- *)
  7624. |Global.systemGet:
  7625. Evaluate(p0,s0); (* adr *)
  7626. Designate(p1,s1); (* variable *)
  7627. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7628. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7629. Emit(Mov(position,s1.op,s0.op));
  7630. ReleaseOperand(s1);
  7631. ReleaseOperand(s0);
  7632. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7633. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7634. Evaluate(p0,s0); (* *)
  7635. Evaluate(p1,s1); (* variable *)
  7636. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7637. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7638. (* real part *)
  7639. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7640. Emit(Mov(position,res, s1.op));
  7641. ReleaseIntermediateOperand(res);
  7642. (* imaginary part *)
  7643. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7644. Emit(Mov(position,res, s1.tag));
  7645. ReleaseIntermediateOperand(res);
  7646. ReleaseOperand(s1);
  7647. ReleaseOperand(s0);
  7648. ELSE
  7649. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7650. ReleaseOperand(s0);
  7651. Emit(Mov(position,res,s1.op));
  7652. ReleaseIntermediateOperand(res);
  7653. ReleaseOperand(s1);
  7654. END;
  7655. (* ---- SYSTEM.MOVE ----- *)
  7656. |Global.systemMove:
  7657. Evaluate(p0,s0);
  7658. Evaluate(p1,s1);
  7659. Evaluate(p2,s2);
  7660. Emit(Copy(position,s1.op,s0.op,s2.op));
  7661. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7662. (* ---- SYSTEM.NEW ----- *)
  7663. |Global.systemNew:
  7664. Designate(p0,s0);
  7665. Emit(Push(position,s0.op));
  7666. ReleaseOperand(s0);
  7667. Evaluate(p1,s1);
  7668. Emit(Push(position,s1.op));
  7669. ReleaseOperand(s1);
  7670. (* push realtime flag: false by default *)
  7671. Emit(Push(position,false));
  7672. CallThis(position,"Heaps","NewSys",3);
  7673. (* ---- SYSTEM.CALL ----- *)
  7674. |Global.systemRef:
  7675. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7676. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7677. s0.mode := ModeValue;
  7678. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7679. result := s0
  7680. (* ---- INCR ----- *)
  7681. |Global.Incr:
  7682. Designate(p0,operand);
  7683. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7684. Dereference(operand,p0.type.resolved,FALSE);
  7685. END;
  7686. ASSERT(p1 # NIL);
  7687. Evaluate(p1,l);
  7688. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7689. ReleaseOperand(operand); ReleaseOperand(l);
  7690. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7691. (* ---- SUM ----- *)
  7692. |Global.Sum: HALT(200);
  7693. (* ---- ALL ----- *)
  7694. |Global.All: HALT(200);
  7695. (* ---- CAS ----- *)
  7696. |Global.Cas:
  7697. needsTrace := p0.NeedsTrace();
  7698. IF needsTrace THEN ModifyAssignments(true) END;
  7699. Designate(p0,s0);
  7700. Evaluate(p1,s1);
  7701. Evaluate(p2,s2);
  7702. IF needsTrace THEN
  7703. Emit(Push(position, s0.op));
  7704. Emit(Push(position, s1.op));
  7705. Emit(Push(position, s2.op));
  7706. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7707. ELSE
  7708. Emit(Cas(position,s0.op,s1.op,s2.op));
  7709. END;
  7710. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7711. IF needsTrace THEN ModifyAssignments(false) END;
  7712. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7713. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7714. IF conditional THEN
  7715. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7716. BrL(falseLabel);
  7717. ReleaseIntermediateOperand(res);
  7718. END;
  7719. (* ---- DIM ----- *)
  7720. |Global.Dim:
  7721. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7722. Designate(p0,s0);
  7723. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7724. Dereference(s0,p0.type.resolved,FALSE);
  7725. END;
  7726. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7727. ReleaseOperand(s0);
  7728. (* ---- RESHAPE ----- *)
  7729. |Global.Reshape:
  7730. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7731. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7732. left.SetType(procedure.type);
  7733. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7734. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7735. END;
  7736. (* ---- SYSTEM.TYPECODE ----- *)
  7737. |Global.systemTypeCode:
  7738. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7739. IF type.resolved IS SyntaxTree.PointerType THEN
  7740. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7741. END;
  7742. result.op := TypeDescriptorAdr(type);
  7743. IF ~newObjectFile THEN
  7744. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7745. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7746. END;
  7747. result.mode := ModeValue;
  7748. (* ---- SYSTEM.TRACE ----- *)
  7749. |Global.systemTrace:
  7750. SystemTrace(x.parameters, x.position);
  7751. (* ----- CONNECT ------*)
  7752. |Global.Connect:
  7753. IF backend.cellsAreObjects THEN
  7754. PushPort(p0);
  7755. PushPort(p1);
  7756. IF p2 # NIL THEN
  7757. Evaluate(p2, s2);
  7758. Emit(Push(p2.position, s2.op));
  7759. ReleaseOperand(s2);
  7760. ELSE
  7761. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7762. END;
  7763. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7764. ELSE
  7765. Warning(x.position, "cannot run on final hardware");
  7766. END;
  7767. (* ----- DELEGATE ------*)
  7768. |Global.Delegate:
  7769. IF backend.cellsAreObjects THEN
  7770. PushPort(p0);
  7771. PushPort(p1);
  7772. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7773. ELSE
  7774. Warning(x.position, "cannot run on final hardware");
  7775. END;
  7776. (* ----- SEND ------*)
  7777. |Global.Send:
  7778. Evaluate(p0,s0);
  7779. Evaluate(p1,s1);
  7780. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7781. Emit(Push(position,s0.op));
  7782. Emit(Push(position,s1.op));
  7783. (*
  7784. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7785. *)
  7786. IF ~backend.cellsAreObjects THEN
  7787. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7788. END;
  7789. ReleaseOperand(s0);
  7790. ReleaseOperand(s1);
  7791. IF backend.cellsAreObjects THEN
  7792. CallThis(position,"ActiveCellsRuntime","Send",2);
  7793. ELSE
  7794. CallThis(position,ChannelModuleName,"Send",2);
  7795. END;
  7796. (* ----- RECEIVE ------*)
  7797. |Global.Receive:
  7798. Evaluate(p0,s0);
  7799. Emit(Push(position,s0.op));
  7800. Designate(p1,s1);
  7801. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7802. Emit(Push(position,s1.op));
  7803. IF p2 # NIL THEN
  7804. Designate(p2,s2);
  7805. Emit(Push(position,s2.op));
  7806. END;
  7807. (*
  7808. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7809. *)
  7810. IF ~backend.cellsAreObjects THEN
  7811. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7812. END;
  7813. ReleaseOperand(s0);
  7814. ReleaseOperand(s1);
  7815. ReleaseOperand(s2);
  7816. IF backend.cellsAreObjects THEN
  7817. IF p2 = NIL THEN
  7818. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7819. ELSE
  7820. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7821. END;
  7822. ELSE
  7823. IF p2 = NIL THEN
  7824. CallThis(position,ChannelModuleName,"Receive",2)
  7825. ELSE
  7826. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7827. END;
  7828. END;
  7829. | Global.systemSpecial:
  7830. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7831. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7832. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7833. (* determine if parameters are of the VAR kind *)
  7834. ASSERT(x.parameters.Length() <= 3);
  7835. formalParameter := procedureType.firstParameter;
  7836. FOR i := 0 TO x.parameters.Length() - 1 DO
  7837. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7838. formalParameter := formalParameter.nextParameter
  7839. END;
  7840. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7841. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7842. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7843. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7844. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7845. IF procedureType.returnType # NIL THEN
  7846. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7847. Emit(Result(position, res));
  7848. (*InitOperand(result,ModeValue);
  7849. result.op := res;
  7850. *)
  7851. IF ~conditional THEN
  7852. InitOperand(result,ModeValue); result.op := res;
  7853. ELSE
  7854. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7855. BrL(falseLabel);
  7856. ReleaseIntermediateOperand(res);
  7857. END;
  7858. END
  7859. ELSE (* function not yet implemented *)
  7860. Error(position,"not yet implemented");
  7861. END;
  7862. destination := dest;
  7863. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  7864. END VisitBuiltinCallDesignator;
  7865. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  7866. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  7867. BEGIN
  7868. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  7869. dest := destination; destination := emptyOperand;
  7870. Expression(x.left);
  7871. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  7872. ELSIF isUnchecked THEN (* no check *)
  7873. ELSE
  7874. trueL := NewLabel();
  7875. falseL := NewLabel();
  7876. IF IsPointerToRecord(x.left.type,recordType) THEN
  7877. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7878. Emit(Mov(position,tag, result.op));
  7879. IF result.mode # ModeValue THEN
  7880. ptr := tag;
  7881. IntermediateCode.MakeMemory(ptr,addressType);
  7882. Emit(Mov(position,tag, ptr));
  7883. END;
  7884. IF ~backend.cooperative THEN
  7885. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7886. END;
  7887. IntermediateCode.MakeMemory(tag,addressType);
  7888. ELSE
  7889. tag := result.tag;
  7890. END;
  7891. TypeTest(tag,x.type,trueL,falseL);
  7892. ReleaseIntermediateOperand(tag);
  7893. SetLabel(falseL);
  7894. EmitTrap(position,TypeCheckTrap);
  7895. SetLabel(trueL);
  7896. END;
  7897. destination := dest;
  7898. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  7899. END VisitTypeGuardDesignator;
  7900. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  7901. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  7902. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  7903. VAR label: Label; pc: LONGINT;
  7904. BEGIN
  7905. IF backend.cooperative & ~isUnchecked THEN
  7906. pc := section.pc;
  7907. label := NewLabel();
  7908. BrneL(label, operand.op, nil);
  7909. EmitTrap(position, NilPointerTrap);
  7910. SetLabel(label);
  7911. INC(statCoopNilCheck, section.pc - pc);
  7912. END;
  7913. END NilCheck;
  7914. BEGIN
  7915. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  7916. ReuseCopy(dereferenced,operand.op);
  7917. ReleaseOperand(operand);
  7918. operand.mode := ModeReference;
  7919. operand.op := dereferenced;
  7920. operand.tag := dereferenced;
  7921. UseIntermediateOperand(operand.tag);
  7922. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  7923. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  7924. ReleaseIntermediateOperand(operand.tag);
  7925. operand.tag := TypeDescriptorAdr(type);
  7926. IF ~newObjectFile THEN
  7927. IntermediateCode.MakeMemory(operand.tag,addressType);
  7928. END;
  7929. ELSE
  7930. IF ~backend.cooperative THEN
  7931. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7932. END;
  7933. IntermediateCode.MakeMemory(operand.tag,addressType);
  7934. END;
  7935. NilCheck(operand.op);
  7936. ELSIF type IS SyntaxTree.ArrayType THEN
  7937. IF isUnsafe THEN
  7938. NilCheck(operand.op);
  7939. ReleaseIntermediateOperand(operand.tag);
  7940. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7941. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  7942. ELSE
  7943. operand.tag := emptyOperand;
  7944. END;
  7945. ELSE
  7946. NilCheck(operand.op);
  7947. IF backend.cooperative THEN
  7948. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  7949. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7950. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  7951. ELSE
  7952. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  7953. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  7954. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7955. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  7956. END;
  7957. END;
  7958. ELSIF type IS SyntaxTree.MathArrayType THEN
  7959. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  7960. IntermediateCode.MakeMemory(operand.op,addressType);
  7961. ELSE HALT(100);
  7962. END;
  7963. END Dereference;
  7964. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  7965. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  7966. BEGIN
  7967. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  7968. dest := destination; destination := emptyOperand;
  7969. Evaluate(x.left,d);
  7970. type := x.type.resolved;
  7971. prevIsUnchecked := isUnchecked;
  7972. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  7973. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  7974. END;
  7975. Dereference(d,type,IsUnsafePointer(x.left.type));
  7976. isUnchecked := prevIsUnchecked;
  7977. result := d;
  7978. IF backend.cooperative & (x.left.type.resolved IS SyntaxTree.PointerType) & ~x.left.type.resolved(SyntaxTree.PointerType).isPlain & ~x.left.type.resolved(SyntaxTree.PointerType).isUnsafe THEN
  7979. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  7980. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7981. END;
  7982. END;
  7983. destination := dest;
  7984. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  7985. END VisitDereferenceDesignator;
  7986. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  7987. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  7988. BEGIN
  7989. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  7990. dest := destination; destination := emptyOperand;
  7991. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  7992. tag := result.op;
  7993. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  7994. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  7995. StaticCallOperand(result,procedure.super);
  7996. ReleaseIntermediateOperand(result.tag);
  7997. UseIntermediateOperand(tag); (* necessary ? *)
  7998. result.tag := tag;
  7999. destination := dest;
  8000. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8001. END VisitSupercallDesignator;
  8002. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8003. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8004. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8005. name: Basic.SegmentedName;
  8006. BEGIN
  8007. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8008. dest := destination; destination := emptyOperand;
  8009. scope := currentScope;
  8010. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8011. scope := scope.outerScope;
  8012. END;
  8013. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8014. IF newObjectFile THEN
  8015. moduleSection := meta.ModuleSection();
  8016. IF backend.cooperative THEN
  8017. moduleOffset := 0;
  8018. ELSE
  8019. moduleOffset := moduleSection.pc;
  8020. END;
  8021. result.mode := ModeValue;
  8022. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8023. ELSE
  8024. Symbol(moduleSelf,result);
  8025. IntermediateCode.MakeMemory(result.op,addressType);
  8026. END
  8027. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8028. result.mode := ModeValue;
  8029. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8030. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8031. ELSE
  8032. GetBaseRegister(basereg,currentScope,scope);
  8033. InitOperand(result,ModeReference);
  8034. result.op := basereg;
  8035. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  8036. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  8037. IF backend.cooperative THEN
  8038. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8039. END;
  8040. (* tag must be loaded when dereferencing SELF pointer *)
  8041. END;
  8042. destination := dest;
  8043. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8044. END VisitSelfDesignator;
  8045. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8046. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8047. BEGIN
  8048. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8049. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8050. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8051. parameter := procedureType.returnParameter;
  8052. VisitParameter(parameter);
  8053. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8054. END VisitResultDesignator;
  8055. (** values *)
  8056. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8057. BEGIN
  8058. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8059. IF conditional THEN
  8060. IF x.value THEN BrL(trueLabel)
  8061. ELSE BrL(falseLabel)
  8062. END;
  8063. ELSE
  8064. InitOperand(result,ModeValue);
  8065. IF x.value THEN result.op := true ELSE result.op := false END;
  8066. END;
  8067. END VisitBooleanValue;
  8068. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8069. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8070. BEGIN
  8071. Global.GetModuleSegmentedName(module.module, name);
  8072. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8073. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8074. RETURN section
  8075. END GetDataSection;
  8076. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8077. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8078. BEGIN
  8079. type := vop.type;
  8080. data := GetDataSection();
  8081. pc := EnterImmediate(data,vop);
  8082. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8083. IntermediateCode.MakeMemory(vop, type);
  8084. END GetImmediateMem;
  8085. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8086. BEGIN
  8087. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8088. InitOperand(result,ModeValue);
  8089. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8090. IF ~supportedImmediate(result.op) &~inData THEN
  8091. GetImmediateMem(result.op)
  8092. END;
  8093. END VisitIntegerValue;
  8094. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8095. BEGIN
  8096. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8097. InitOperand(result,ModeValue);
  8098. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8099. END VisitCharacterValue;
  8100. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8101. BEGIN
  8102. IF Trace THEN TraceEnter("VisitSetValue") END;
  8103. InitOperand(result,ModeValue);
  8104. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8105. END VisitSetValue;
  8106. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8107. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8108. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8109. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8110. BEGIN
  8111. numberElements := x.elements.Length();
  8112. FOR i := 0 TO numberElements-1 DO
  8113. expression := x.elements.GetExpression(i);
  8114. IF expression IS SyntaxTree.MathArrayExpression THEN
  8115. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8116. ELSE
  8117. inData := TRUE;
  8118. Evaluate(expression,op);
  8119. irv.Emit(Data(position,op.op));
  8120. inData := FALSE;
  8121. ReleaseOperand(op);
  8122. END;
  8123. END;
  8124. END RecursiveData;
  8125. BEGIN
  8126. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8127. IF ~TryConstantDeclaration() THEN
  8128. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8129. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8130. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8131. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8132. ELSE
  8133. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8134. END;
  8135. RecursiveData(x.array);
  8136. InitOperand(result,ModeReference);
  8137. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8138. END
  8139. END VisitMathArrayValue;
  8140. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8141. VAR constant: Sections.Section;
  8142. BEGIN
  8143. IF constantDeclaration = NIL THEN
  8144. RETURN FALSE
  8145. ELSE
  8146. (* Is a constant in this module: did we generate it already? *)
  8147. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8148. IF constant # NIL THEN
  8149. InitOperand(result,ModeReference);
  8150. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8151. RETURN TRUE;
  8152. END;
  8153. END;
  8154. RETURN FALSE
  8155. END TryConstantDeclaration;
  8156. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8157. BEGIN
  8158. constantDeclaration := x;
  8159. x.value.resolved.Accept(SELF);
  8160. END VisitConstant;
  8161. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8162. BEGIN
  8163. IF Trace THEN TraceEnter("VisitRealValue") END;
  8164. InitOperand(result,ModeValue);
  8165. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8166. END VisitRealValue;
  8167. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8168. VAR
  8169. componentType: SyntaxTree.Type;
  8170. BEGIN
  8171. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8172. ASSERT(x.type IS SyntaxTree.ComplexType);
  8173. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8174. InitOperand(result,ModeValue);
  8175. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8176. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8177. END VisitComplexValue;
  8178. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8179. VAR i: LONGINT; name: Basic.SegmentedName;
  8180. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8181. BEGIN
  8182. IF Trace THEN TraceEnter("VisitStringValue") END;
  8183. IF ~TryConstantDeclaration() THEN
  8184. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8185. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8186. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8187. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8188. ELSE
  8189. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8190. END;
  8191. FOR i := 0 TO x.length-1 DO
  8192. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8193. irv.Emit(Data(position,op));
  8194. END;
  8195. InitOperand(result,ModeReference);
  8196. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8197. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8198. END
  8199. END VisitStringValue;
  8200. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8201. BEGIN
  8202. IF Trace THEN TraceEnter("VisitNilValue") END;
  8203. InitOperand(result,ModeValue);
  8204. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8205. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8206. END VisitNilValue;
  8207. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8208. BEGIN
  8209. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8210. InitOperand(result,ModeValue);
  8211. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8212. END VisitEnumerationValue;
  8213. (** symbols *)
  8214. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8215. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8216. END VisitImport;
  8217. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8218. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8219. BEGIN
  8220. IF scope # baseScope THEN
  8221. (* left := [fp+8] *)
  8222. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8223. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8224. ReuseCopy(left,right);
  8225. ReleaseIntermediateOperand(right);
  8226. scope := scope.outerScope; DEC(level);
  8227. (* { left := [left+8] } *)
  8228. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8229. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8230. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8231. Emit(Mov(position,left,right));
  8232. scope := scope.outerScope; DEC(level);
  8233. END;
  8234. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8235. result := left;
  8236. ELSE
  8237. result := fp;
  8238. END;
  8239. END GetBaseRegister;
  8240. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8241. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8242. BEGIN
  8243. IF Trace THEN TraceEnter("VisitVariable"); END;
  8244. type := x.type.resolved;
  8245. IF (x.useRegister) THEN
  8246. InitOperand(result, ModeValue);
  8247. IF x.registerNumber < 0 THEN
  8248. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8249. reg := x.registerNumber;
  8250. ELSE
  8251. reg := registerUsageCount.Map(x.registerNumber);
  8252. UseRegister(reg);
  8253. END;
  8254. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8255. ELSIF x.externalName # NIL THEN
  8256. InitOperand(result,ModeReference);
  8257. Basic.ToSegmentedName(x.externalName^, name);
  8258. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8259. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8260. InitOperand(result,ModeReference);
  8261. GetBaseRegister(result.op,currentScope,x.scope);
  8262. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8263. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8264. InitOperand(result,ModeReference);
  8265. GetCodeSectionNameForSymbol(x,name);
  8266. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8267. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8268. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8269. InitOperand(result,ModeReference);
  8270. GetCodeSectionNameForSymbol(x,name);
  8271. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8272. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8273. ELSE (* field, left designator must have been emitted *)
  8274. ASSERT(result.mode = ModeReference);
  8275. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8276. ReuseCopy(temp,result.op);
  8277. ReleaseIntermediateOperand(result.op);
  8278. result.op := temp;
  8279. END;
  8280. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8281. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8282. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8283. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8284. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8285. END;
  8286. END;
  8287. END;
  8288. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8289. ValueToCondition(result);
  8290. ELSIF type IS SyntaxTree.ProcedureType THEN
  8291. ReleaseIntermediateOperand(result.tag);
  8292. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8293. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8294. UseIntermediateOperand(result.tag);
  8295. ELSE
  8296. result.tag := nil; (* nil *)
  8297. END;
  8298. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8299. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8300. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8301. ReleaseIntermediateOperand(result.tag);
  8302. Global.GetSymbolSegmentedName(x,name);
  8303. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8304. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8305. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8306. ELSE
  8307. END;
  8308. ELSE
  8309. ReleaseIntermediateOperand(result.tag);
  8310. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8311. END;
  8312. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8313. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8314. ReleaseIntermediateOperand(result.tag);
  8315. result.tag := result.op;
  8316. UseIntermediateOperand(result.tag);
  8317. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8318. IntermediateCode.MakeMemory(result.op,addressType);
  8319. END;
  8320. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8321. ReleaseIntermediateOperand(result.tag);
  8322. result.tag := TypeDescriptorAdr(type);
  8323. IF ~newObjectFile THEN
  8324. IntermediateCode.MakeMemory(result.tag,addressType);
  8325. END;
  8326. UseIntermediateOperand(result.tag);
  8327. (* tag for pointer type computed not here but during dereferencing *)
  8328. END;
  8329. IF Trace THEN TraceExit("VisitVariable") END;
  8330. END VisitVariable;
  8331. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8332. BEGIN
  8333. VisitVariable(property);
  8334. END VisitProperty;
  8335. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8336. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8337. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8338. BEGIN
  8339. type := x.type.resolved;
  8340. IF Trace THEN TraceEnter("VisitParameter") END;
  8341. IF x.ownerType IS SyntaxTree.CellType THEN
  8342. ptype := x.type.resolved;
  8343. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8344. IF ~(ptype IS SyntaxTree.PortType) THEN
  8345. InitOperand(result,ModeReference);
  8346. GetCodeSectionNameForSymbol(x,name);
  8347. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8348. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8349. RETURN
  8350. ELSE
  8351. InitOperand(result, ModeValue);
  8352. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8353. adr := 0;
  8354. WHILE parameter # x DO
  8355. parameterType := parameter.type;
  8356. inc := 1;
  8357. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8358. INC(adr, inc);
  8359. parameter := parameter.nextParameter
  8360. END;
  8361. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8362. RETURN
  8363. END;
  8364. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8365. InitOperand(result,ModeReference);
  8366. GetCodeSectionNameForSymbol(x,name);
  8367. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8368. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8369. RETURN
  8370. ELSE
  8371. GetBaseRegister(basereg,currentScope,x.scope);
  8372. InitOperand(result,ModeReference);
  8373. result.op := basereg;
  8374. END;
  8375. IF IsOpenArray(type) THEN
  8376. result.tag := basereg;
  8377. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8378. IntermediateCode.MakeMemory(result.op,addressType);
  8379. IF Global.IsOberonProcedure(x.ownerType) THEN
  8380. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8381. UseIntermediateOperand(result.tag);
  8382. ELSE
  8383. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8384. END;
  8385. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8386. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8387. ELSIF IsStaticArray(type) THEN
  8388. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8389. IntermediateCode.MakeMemory(result.op,addressType);
  8390. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8391. ELSIF type IS SyntaxTree.MathArrayType THEN
  8392. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8393. WITH type: SyntaxTree.MathArrayType DO
  8394. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8395. IF type.form = SyntaxTree.Tensor THEN
  8396. ELSIF type.form = SyntaxTree.Open THEN
  8397. result.tag := result.op;
  8398. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8399. IntermediateCode.MakeMemory(result.op,addressType);
  8400. UseIntermediateOperand(result.tag);
  8401. ELSIF type.form = SyntaxTree.Static THEN
  8402. IF x.kind = SyntaxTree.ConstParameter THEN
  8403. IntermediateCode.MakeMemory(result.op,addressType);
  8404. END;
  8405. ELSE HALT(100)
  8406. END;
  8407. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8408. IF type.form = SyntaxTree.Tensor THEN
  8409. ToMemory(result.op,addressType,0);
  8410. ELSIF type.form = SyntaxTree.Open THEN
  8411. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8412. ReuseCopy(result.tag, mem);
  8413. ReleaseIntermediateOperand(mem);
  8414. ReleaseIntermediateOperand(result.op);
  8415. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8416. ELSIF type.form = SyntaxTree.Static THEN
  8417. IntermediateCode.MakeMemory(result.op,addressType);
  8418. ELSE HALT(100)
  8419. END;
  8420. ELSE HALT(100)
  8421. END;
  8422. END;
  8423. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8424. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8425. IntermediateCode.MakeMemory(result.op,addressType);
  8426. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8427. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8428. END;
  8429. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8430. ValueToCondition(result);
  8431. ELSIF type IS SyntaxTree.ProcedureType THEN
  8432. ReleaseIntermediateOperand(result.tag);
  8433. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8434. IF x.kind = SyntaxTree.VarParameter THEN
  8435. ReuseCopy(result.tag,result.op);
  8436. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8437. IntermediateCode.MakeMemory(result.tag,addressType);
  8438. ELSE
  8439. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8440. UseIntermediateOperand(result.tag);
  8441. END;
  8442. ELSE
  8443. result.tag := nil;
  8444. END;
  8445. (* tag for pointer type computed not here but during dereferencing *)
  8446. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8447. ReleaseIntermediateOperand(result.tag);
  8448. result.tag := basereg;
  8449. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8450. IntermediateCode.MakeMemory(result.tag,addressType);
  8451. UseIntermediateOperand(result.tag);
  8452. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8453. ReleaseIntermediateOperand(result.tag);
  8454. result.tag := TypeDescriptorAdr(type);
  8455. IF ~newObjectFile THEN
  8456. IntermediateCode.MakeMemory(result.tag,addressType);
  8457. END;
  8458. UseIntermediateOperand(result.tag);
  8459. END;
  8460. IF Trace THEN TraceExit("VisitParameter") END;
  8461. END VisitParameter;
  8462. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8463. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8464. BEGIN
  8465. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8466. (* left.p: left already emitted *)
  8467. tag := result.op; (* value of pointer to left *)
  8468. (* get type desc *)
  8469. tmp := result.tag;
  8470. IntermediateCode.MakeMemory(tmp,addressType);
  8471. (* get method adr *)
  8472. Reuse1(reg,tmp);
  8473. ReleaseIntermediateOperand(tmp);
  8474. IF backend.cooperative THEN
  8475. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8476. WHILE recordType.baseType # NIL DO
  8477. recordType := recordType.GetBaseRecord ();
  8478. END;
  8479. GetRecordTypeName (recordType,name);
  8480. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8481. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8482. offset := 0;
  8483. ELSE
  8484. offset := 2;
  8485. END;
  8486. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8487. ELSE
  8488. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8489. END;
  8490. InitOperand(operand,ModeReference);
  8491. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8492. operand.op := reg;
  8493. operand.tag := tag;
  8494. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8495. END DynamicCallOperand;
  8496. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8497. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8498. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8499. BEGIN
  8500. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8501. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8502. tag := operand.op;
  8503. ReleaseIntermediateOperand(operand.tag);
  8504. ELSE tag := nil
  8505. END;
  8506. IF x.isInline THEN
  8507. sectionType := Sections.InlineCodeSection;
  8508. ELSE
  8509. sectionType := Sections.CodeSection;
  8510. END;
  8511. IF x.externalName # NIL THEN
  8512. Basic.ToSegmentedName(x.externalName^, name);
  8513. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8514. ELSE
  8515. GetCodeSectionNameForSymbol(x, name);
  8516. IF (x.scope.ownerModule = module.module) THEN
  8517. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8518. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8519. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8520. IF source.pc = 0 THEN (* no code yet *)
  8521. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8522. END;
  8523. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8524. bits := x.procedureScope.body.code.inlineCode;
  8525. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8526. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8527. binary.CopyBits(bits, 0, bits.GetSize());
  8528. source.SetResolved(binary);
  8529. ELSE
  8530. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8531. END;
  8532. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8533. END;
  8534. InitOperand(operand,ModeValue);
  8535. operand.op := reg;
  8536. operand.tag := tag;
  8537. IF Trace THEN TraceExit("StaticCallOperand") END;
  8538. END StaticCallOperand;
  8539. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8540. (* handle expressions of the form designator.procedure or procedure *)
  8541. BEGIN
  8542. IF Trace THEN TraceEnter("VisitProcedure") END;
  8543. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8544. DynamicCallOperand(result,x);
  8545. ELSIF x.isInline THEN
  8546. StaticCallOperand(result,x);
  8547. ELSE
  8548. StaticCallOperand(result,x);
  8549. END;
  8550. IF Trace THEN TraceExit("VisitProcedure") END;
  8551. END VisitProcedure;
  8552. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8553. BEGIN
  8554. VisitProcedure(x);
  8555. END VisitOperator;
  8556. (** statements *)
  8557. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8558. BEGIN
  8559. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8560. Expression(x.call);
  8561. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8562. ReleaseOperand(result)
  8563. END;
  8564. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8565. END VisitProcedureCallStatement;
  8566. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8567. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8568. leftBase, rightBase: SyntaxTree.Type;
  8569. procedureName,s: SyntaxTree.IdentifierString;
  8570. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8571. size: LONGINT; rightKind: LONGINT;
  8572. dummy: IntermediateCode.Operand;
  8573. CONST moduleName = "FoxArrayBase";
  8574. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8575. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8576. BEGIN
  8577. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8578. IF base IS SyntaxTree.MathArrayType THEN
  8579. base := OpenArray(base(SyntaxTree.MathArrayType));
  8580. END;
  8581. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8582. result.SetArrayBase(base);
  8583. RETURN result
  8584. END OpenArray;
  8585. BEGIN
  8586. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8587. SaveRegisters();ReleaseUsedRegisters(saved);
  8588. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8589. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8590. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8591. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8592. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8593. IF leftType.form = SyntaxTree.Tensor THEN
  8594. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8595. ELSIF leftType.form = SyntaxTree.Open THEN
  8596. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8597. ELSIF leftType.form = SyntaxTree.Static THEN
  8598. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8599. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8600. END;
  8601. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8602. IF procedure = NIL THEN
  8603. s := "Instruction not supported on target, emulation procedure ";
  8604. Strings.Append(s,moduleName);
  8605. Strings.Append(s,".");
  8606. Strings.Append(s,procedureName);
  8607. Strings.Append(s," not present");
  8608. Error(position,s);
  8609. ELSE
  8610. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8611. parameter.SetType(leftType);
  8612. parameter.SetAccess(SyntaxTree.Internal);
  8613. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8614. parameter.SetKind(rightKind);
  8615. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8616. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8617. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8618. StaticCallOperand(result,procedure);
  8619. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8620. ReleaseOperand(result);
  8621. END;
  8622. RestoreRegisters(saved);
  8623. END;
  8624. END AssignMathArray;
  8625. VAR modifyAssignmentCounter := 0: LONGINT;
  8626. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8627. VAR processor,mem,dst: IntermediateCode.Operand;
  8628. BEGIN
  8629. IF value.intValue = true.intValue THEN
  8630. INC(modifyAssignmentCounter);
  8631. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8632. modifyAssignmentsPC := section.pc;
  8633. ELSE
  8634. DEC(modifyAssignmentCounter);
  8635. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8636. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8637. END;
  8638. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8639. dst := NewRegisterOperand (addressType);
  8640. Emit(Mov(position,dst, processor));
  8641. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8642. Emit(Mov(position,mem, value));
  8643. ReleaseIntermediateOperand(dst);
  8644. END ModifyAssignments;
  8645. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8646. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8647. BEGIN
  8648. type := left.type.resolved;
  8649. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8650. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8651. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8652. IF procedureType.returnParameter = parameter THEN
  8653. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8654. END;
  8655. END;
  8656. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8657. END CopySize;
  8658. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8659. VAR
  8660. leftO, rightO: Operand;
  8661. mem, sizeOp: IntermediateCode.Operand;
  8662. leftType, rightType, componentType: SyntaxTree.Type;
  8663. size: LONGINT;
  8664. parameters: SyntaxTree.ExpressionList;
  8665. procedure: SyntaxTree.Procedure;
  8666. call: SyntaxTree.ProcedureCallDesignator;
  8667. designator: SyntaxTree.Designator;
  8668. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8669. VAR procedureType: SyntaxTree.ProcedureType;
  8670. BEGIN
  8671. IF ReturnedAsParameter(right.type) THEN
  8672. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8673. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8674. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8675. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8676. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8677. IF right.id = Global.Reshape THEN RETURN TRUE
  8678. END;
  8679. END;
  8680. END;
  8681. END;
  8682. RETURN FALSE
  8683. END CanPassAsResultParameter;
  8684. BEGIN
  8685. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8686. leftType := left.type.resolved; rightType:= right.type.resolved;
  8687. IF backend.cooperative & left.NeedsTrace() THEN
  8688. ModifyAssignments(true);
  8689. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8690. Designate(right, rightO);
  8691. Designate(left, leftO);
  8692. ASSERT(leftO.mode = ModeReference);
  8693. TransferToRegister(leftO.op, leftO.op);
  8694. TransferToRegister(rightO.op, rightO.op);
  8695. Emit(Push(position, leftO.op));
  8696. Emit(Push(position, rightO.op));
  8697. CallAssignMethod(leftO.op, rightO.op, left.type);
  8698. Emit(Pop(position, rightO.op));
  8699. Emit(Pop(position, leftO.op));
  8700. sizeOp := CopySize(left);
  8701. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8702. ReleaseOperand(leftO);
  8703. ReleaseOperand(rightO);
  8704. ELSE
  8705. Evaluate(right,rightO);
  8706. Designate(left,leftO);
  8707. ASSERT(leftO.mode = ModeReference);
  8708. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8709. (* copy procedure address first *)
  8710. MakeMemory(mem,leftO.op,addressType,0);
  8711. Emit(Mov(position,mem,rightO.op));
  8712. ReleaseIntermediateOperand(mem);
  8713. (* copy pointer address *)
  8714. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8715. CallAssignPointer(leftO.tag, rightO.tag);
  8716. ELSE
  8717. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8718. CallAssignPointer(leftO.op, rightO.op);
  8719. END;
  8720. ReleaseOperand(leftO);
  8721. ReleaseOperand(rightO);
  8722. END;
  8723. ModifyAssignments(false);
  8724. RETURN;
  8725. END;
  8726. IF CanPassAsResultParameter(right) THEN
  8727. procedureResultDesignator := left(SyntaxTree.Designator);
  8728. Expression(right);
  8729. procedureResultDesignator := NIL;
  8730. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8731. (* left <-- ALIAS OF right: zerocopy *)
  8732. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8733. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8734. designator.SetType(procedure.type);
  8735. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8736. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8737. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8738. END;
  8739. ELSIF leftType IS SyntaxTree.RangeType THEN
  8740. (* LHS is of array range type *)
  8741. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8742. Evaluate(right, rightO);
  8743. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8744. (* first *)
  8745. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8746. Emit(Mov(position,mem, rightO.op));
  8747. ReleaseIntermediateOperand(mem);
  8748. (* last *)
  8749. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8750. Emit(Mov(position,mem, rightO.tag));
  8751. ReleaseIntermediateOperand(mem);
  8752. (* step *)
  8753. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8754. Emit(Mov(position,mem, rightO.extra));
  8755. ReleaseIntermediateOperand(mem);
  8756. ReleaseOperand(rightO);
  8757. ReleaseOperand(leftO)
  8758. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8759. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8760. Evaluate(right, rightO);
  8761. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8762. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8763. (* real part *)
  8764. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8765. Emit(Mov(position,mem, rightO.op));
  8766. ReleaseIntermediateOperand(mem);
  8767. (* imaginary part *)
  8768. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8769. Emit(Mov(position,mem, rightO.tag));
  8770. ReleaseIntermediateOperand(mem);
  8771. ReleaseOperand(rightO);
  8772. ReleaseOperand(leftO)
  8773. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8774. OR (leftType IS SyntaxTree.PortType) THEN
  8775. (* rightO := leftO;*)
  8776. Evaluate(right,rightO);
  8777. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8778. Designate(left,leftO);
  8779. IF leftO.mode = ModeReference THEN
  8780. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8781. destination := mem;
  8782. ELSE
  8783. destination := leftO.op;
  8784. END;
  8785. ReleaseOperand(leftO);
  8786. IF destination.mode # IntermediateCode.Undefined THEN
  8787. Emit(Mov(position,destination,rightO.op));
  8788. END;
  8789. ReleaseOperand(rightO);
  8790. ReleaseIntermediateOperand(mem);
  8791. IntermediateCode.InitOperand(destination);
  8792. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8793. Evaluate(right,rightO);
  8794. Designate(left,leftO);
  8795. MakeMemory(mem,leftO.op,addressType,0);
  8796. Emit(Mov(position,mem,rightO.op));
  8797. ReleaseIntermediateOperand(mem);
  8798. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8799. (* delegate *)
  8800. (*
  8801. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8802. *)
  8803. Emit(Mov(position,leftO.tag,rightO.tag));
  8804. END;
  8805. ReleaseOperand(leftO);
  8806. ReleaseOperand(rightO);
  8807. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8808. Designate(right,rightO);
  8809. Designate(left,leftO);
  8810. sizeOp := CopySize(left);
  8811. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8812. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8813. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8814. IF (rightType IS SyntaxTree.StringType) THEN
  8815. CopyString(left,right);
  8816. ELSIF ((rightType IS SyntaxTree.ArrayType) & (rightType(SyntaxTree.ArrayType).staticLength # 0) OR (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0)) & (leftType(SyntaxTree.ArrayType).staticLength # 0) THEN
  8817. Designate(right,rightO);
  8818. Designate(left,leftO);
  8819. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8820. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8821. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8822. ELSE
  8823. HALT(201)
  8824. END;
  8825. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8826. AssignMathArray(left,right);
  8827. ELSE
  8828. HALT(200);
  8829. END;
  8830. END Assign;
  8831. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8832. BEGIN
  8833. IF Trace THEN TraceEnter("VisitAssignment") END;
  8834. Assign(x.left,x.right);
  8835. IF Trace THEN TraceExit("VisitAssignment") END;
  8836. END VisitAssignment;
  8837. PROCEDURE EmitCooperativeSwitch;
  8838. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8839. BEGIN
  8840. ASSERT (cooperativeSwitches);
  8841. pc := section.pc;
  8842. IF lastSwitchPC = section.pc THEN RETURN END;
  8843. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8844. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8845. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8846. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  8847. INC(statCoopSwitch, section.pc - pc);
  8848. END EmitCooperativeSwitch;
  8849. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8850. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  8851. BEGIN
  8852. p0 := communication.left; p1 := communication.right;
  8853. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  8854. Evaluate(p0,s0);
  8855. Evaluate(p1,s1);
  8856. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8857. Emit(Push(position,s0.op));
  8858. Emit(Push(position,s1.op));
  8859. (*
  8860. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8861. *)
  8862. IF ~backend.cellsAreObjects THEN
  8863. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  8864. END;
  8865. ReleaseOperand(s0);
  8866. ReleaseOperand(s1);
  8867. IF backend.cellsAreObjects THEN
  8868. CallThis(position,"ActiveCellsRuntime","Send",2);
  8869. ELSE
  8870. CallThis(position,ChannelModuleName,"Send",2);
  8871. END;
  8872. (* ----- RECEIVE ------*)
  8873. ELSE
  8874. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  8875. tmp := p0; p0 := p1; p1 := tmp;
  8876. END;
  8877. Evaluate(p0,s0);
  8878. Emit(Push(position,s0.op));
  8879. Designate(p1,s1);
  8880. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8881. Emit(Push(position,s1.op));
  8882. (*
  8883. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8884. *)
  8885. IF ~backend.cellsAreObjects THEN
  8886. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  8887. END;
  8888. ReleaseOperand(s0);
  8889. ReleaseOperand(s1);
  8890. IF backend.cellsAreObjects THEN
  8891. CallThis(position,"ActiveCellsRuntime","Receive",2);
  8892. ELSE
  8893. CallThis(position,ChannelModuleName,"Receive",2)
  8894. END;
  8895. END;
  8896. END VisitCommunicationStatement;
  8897. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  8898. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  8899. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  8900. VAR true, false: Label; condition, value: BOOLEAN;
  8901. BEGIN
  8902. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  8903. IF condition THEN
  8904. true := NewLabel();
  8905. false := NewLabel();
  8906. Condition(if.condition,true,false);
  8907. SetLabel(true);
  8908. StatementSequence(if.statements);
  8909. BrL(end);
  8910. SetLabel(false);
  8911. ELSE
  8912. IF value THEN (* always true *)
  8913. escape := TRUE;
  8914. StatementSequence(if.statements);
  8915. (* no branch necessary -- rest skipped *)
  8916. END;
  8917. END;
  8918. END IfPart;
  8919. BEGIN
  8920. IF Trace THEN TraceEnter("VisitIfStatement") END;
  8921. end := NewLabel();
  8922. elsifs := x.ElsifParts();
  8923. IfPart(x.ifPart);
  8924. FOR i := 0 TO elsifs-1 DO
  8925. IF ~escape THEN
  8926. elsif := x.GetElsifPart(i);
  8927. IfPart(elsif);
  8928. END;
  8929. END;
  8930. IF (x.elsePart # NIL) & ~escape THEN
  8931. StatementSequence(x.elsePart);
  8932. END;
  8933. SetLabel(end);
  8934. IF Trace THEN TraceExit("VisitIfStatement") END;
  8935. END VisitIfStatement;
  8936. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  8937. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  8938. BEGIN
  8939. (*IF x.variable.type.resolved = x.type.resolved THEN
  8940. (* always true, do nothing *)
  8941. ELSE*)
  8942. Designate(x.variable,res);
  8943. IF IsPointerToRecord(x.variable.type,recordType) THEN
  8944. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  8945. END;
  8946. trueL := NewLabel();
  8947. TypeTest(res.tag,x.type,trueL,falseL);
  8948. ReleaseOperand(res);
  8949. SetLabel(trueL);
  8950. StatementSequence(x.statements);
  8951. BrL(endL);
  8952. END WithPart;
  8953. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  8954. VAR endL,falseL: Label;i: LONGINT;
  8955. BEGIN
  8956. IF Trace THEN TraceEnter("VisitWithStatement") END;
  8957. endL := NewLabel();
  8958. FOR i := 0 TO x.WithParts()-1 DO
  8959. falseL := NewLabel();
  8960. WithPart(x.GetWithPart(i),falseL,endL);
  8961. SetLabel(falseL);
  8962. END;
  8963. IF x.elsePart = NIL THEN
  8964. IF ~isUnchecked THEN
  8965. EmitTrap(position,WithTrap);
  8966. END;
  8967. ELSE
  8968. StatementSequence(x.elsePart)
  8969. END;
  8970. SetLabel(endL);
  8971. IF Trace THEN TraceExit("VisitWithStatement") END;
  8972. END VisitWithStatement;
  8973. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  8974. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  8975. out,else: Label; label: Label;
  8976. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  8977. symbol: SyntaxTree.Symbol;
  8978. BEGIN
  8979. (*! split case statement into if-elsif statements for large case label lists *)
  8980. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  8981. size := x.max-x.min+1;
  8982. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  8983. END;
  8984. Evaluate(x.variable,var);
  8985. ReuseCopy(tmp,var.op);
  8986. ReleaseIntermediateOperand(var.op);
  8987. var.op := tmp;
  8988. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  8989. Convert(var.op,addressType);
  8990. size := x.max-x.min+1;
  8991. else := NewLabel();
  8992. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  8993. (*
  8994. UniqueId(name,module.module,"case",caseId);
  8995. *)
  8996. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  8997. Global.GetModuleSegmentedName(module.module, name);
  8998. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  8999. symbol := SyntaxTree.NewSymbol(name[1]);
  9000. symbol.SetScope(moduleScope);
  9001. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9002. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9003. section.isCaseTable := TRUE;
  9004. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9005. ReuseCopy(res,var.op);
  9006. ReleaseOperand(var);
  9007. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9008. Emit(Add(position,res,res,jmp));
  9009. IntermediateCode.MakeMemory(res,addressType);
  9010. Emit(Br(position,res));
  9011. ReleaseIntermediateOperand(res);
  9012. out := NewLabel();
  9013. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9014. part := x.GetCasePart(i);
  9015. constant := part.firstConstant;
  9016. label := NewLabel();
  9017. SetLabel(label);
  9018. WHILE(constant # NIL) DO (* case labels for this case part *)
  9019. FOR j := constant.min TO constant.max DO
  9020. fixups[j-x.min] := label;
  9021. END;
  9022. constant := constant.next;
  9023. END;
  9024. StatementSequence(part.statements);
  9025. BrL(out);
  9026. END;
  9027. SetLabel(else);
  9028. FOR i := 0 TO size-1 DO
  9029. IF fixups[i] = NIL THEN
  9030. fixups[i] := else;
  9031. END;
  9032. END;
  9033. IF x.elsePart # NIL THEN
  9034. StatementSequence(x.elsePart);
  9035. ELSIF ~isUnchecked THEN
  9036. EmitTrap(position,CaseTrap);
  9037. END;
  9038. SetLabel(out);
  9039. FOR i := 0 TO size-1 DO
  9040. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9041. section.Emit(Data(position,op));
  9042. END;
  9043. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9044. END VisitCaseStatement;
  9045. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9046. VAR start: Label; true,false: Label;
  9047. BEGIN
  9048. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9049. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9050. start := NewLabel();
  9051. true := NewLabel();
  9052. false := NewLabel();
  9053. SetLabel(start);
  9054. Condition(x.condition,true,false);
  9055. SetLabel(true);
  9056. StatementSequence(x.statements);
  9057. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9058. BrL(start);
  9059. SetLabel(false);
  9060. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9061. END VisitWhileStatement;
  9062. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9063. VAR false,true: Label;
  9064. BEGIN
  9065. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9066. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9067. true := NewLabel();
  9068. false := NewLabel();
  9069. SetLabel(false);
  9070. StatementSequence(x.statements);
  9071. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9072. Condition(x.condition,true,false);
  9073. SetLabel(true);
  9074. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9075. END VisitRepeatStatement;
  9076. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9077. VAR
  9078. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9079. temporaryVariable: SyntaxTree.Variable;
  9080. temporaryVariableDesignator : SyntaxTree.Designator;
  9081. BEGIN
  9082. IF Trace THEN TraceEnter("VisitForStatement") END;
  9083. true := NewLabel();
  9084. false := NewLabel();
  9085. start := NewLabel();
  9086. Assign(x.variable,x.from);
  9087. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9088. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9089. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9090. Assign(temporaryVariableDesignator,x.to);
  9091. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9092. IF by > 0 THEN
  9093. cmp := Scanner.LessEqual
  9094. ELSE
  9095. cmp := Scanner.GreaterEqual
  9096. END;
  9097. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9098. binary.SetType(system.booleanType);
  9099. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9100. SetLabel(start);
  9101. Condition(binary,true,false);
  9102. SetLabel(true);
  9103. StatementSequence(x.statements);
  9104. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9105. binary.SetType(x.variable.type);
  9106. Assign(x.variable,binary);
  9107. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9108. BrL(start);
  9109. SetLabel(false);
  9110. IF Trace THEN TraceExit("VisitForStatement") END;
  9111. END VisitForStatement;
  9112. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9113. VAR prevLoop: Label;
  9114. BEGIN
  9115. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9116. prevLoop := currentLoop;
  9117. currentLoop := NewLabel();
  9118. StatementSequence(x.statements);
  9119. SetLabel(currentLoop);
  9120. currentLoop := prevLoop;
  9121. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9122. END VisitExitableBlock;
  9123. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9124. VAR prevLoop,start: Label;
  9125. BEGIN
  9126. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9127. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9128. start := NewLabel();
  9129. prevLoop := currentLoop;
  9130. SetLabel(start);
  9131. currentLoop := NewLabel();
  9132. StatementSequence(x.statements);
  9133. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9134. BrL(start);
  9135. SetLabel(currentLoop);
  9136. currentLoop := prevLoop;
  9137. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9138. END VisitLoopStatement;
  9139. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9140. VAR outer: SyntaxTree.Statement;
  9141. BEGIN
  9142. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9143. IF locked THEN (* r if we jump out of an exclusive block *)
  9144. outer := x.outer;
  9145. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9146. outer := outer.outer;
  9147. END;
  9148. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9149. Lock(FALSE);
  9150. END;
  9151. END;
  9152. BrL(currentLoop);
  9153. IF Trace THEN TraceExit("VisitExitStatement") END;
  9154. END VisitExitStatement;
  9155. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9156. VAR
  9157. expression, parameterDesignator: SyntaxTree.Expression;
  9158. type, componentType: SyntaxTree.Type;
  9159. res, right: Operand;
  9160. left, mem, reg: IntermediateCode.Operand;
  9161. parameter: SyntaxTree.Parameter;
  9162. procedure: SyntaxTree.Procedure;
  9163. procedureType: SyntaxTree.ProcedureType;
  9164. returnTypeOffset: LONGINT;
  9165. delegate: BOOLEAN;
  9166. map: SymbolMap;
  9167. BEGIN
  9168. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9169. expression := x.returnValue;
  9170. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9171. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9172. IF currentIsInline THEN
  9173. IF expression # NIL THEN
  9174. map := currentMapper.Get(NIL);
  9175. IF map # NIL THEN
  9176. Assign(map.to, expression);
  9177. END;
  9178. END;
  9179. BrL(currentInlineExit);
  9180. RETURN;
  9181. END;
  9182. IF expression # NIL THEN
  9183. type := expression.type.resolved;
  9184. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9185. IF locked THEN Lock(FALSE) END;
  9186. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9187. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9188. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9189. (* return without structured return parameter *)
  9190. Evaluate(expression,res);
  9191. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9192. IF locked OR profile THEN
  9193. Emit(Push(position,res.op));
  9194. IF delegate THEN HALT(200) END;
  9195. ReleaseOperand(res);
  9196. IF locked THEN Lock(FALSE) END;
  9197. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9198. reg := NewRegisterOperand(res.op.type);
  9199. Emit(Pop(position,reg));
  9200. Emit(Return(position,reg));
  9201. ReleaseIntermediateOperand(reg);
  9202. ELSE
  9203. Emit(Return(position,res.op));
  9204. ReleaseOperand(res);
  9205. END;
  9206. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9207. THEN
  9208. (* return using structured return parameter *)
  9209. ASSERT((type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static)
  9210. OR SemanticChecker.IsPointerType(type));
  9211. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9212. parameter :=procedureType.returnParameter;
  9213. ASSERT(parameter # NIL);
  9214. returnTypeOffset := parameter.offsetInBits;
  9215. (*
  9216. IF parameter# NIL THEN
  9217. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9218. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9219. ELSE
  9220. returnTypeOffset := system.offsetFirstParameter
  9221. END;
  9222. *)
  9223. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9224. IF type IS SyntaxTree.RangeType THEN
  9225. (* array range type *)
  9226. Evaluate(expression, right);
  9227. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9228. Emit(Mov(position,mem, right.op)); (* first *)
  9229. ReleaseIntermediateOperand(mem);
  9230. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9231. Emit(Mov(position,mem, right.tag)); (* last *)
  9232. ReleaseIntermediateOperand(mem);
  9233. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9234. Emit(Mov(position,mem, right.extra)); (* step *)
  9235. ReleaseIntermediateOperand(mem);
  9236. ReleaseOperand(right);
  9237. ELSIF type IS SyntaxTree.ComplexType THEN
  9238. Evaluate(expression, right);
  9239. componentType := type(SyntaxTree.ComplexType).componentType;
  9240. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9241. Emit(Mov(position,mem, right.op)); (* real part *)
  9242. ReleaseIntermediateOperand(mem);
  9243. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9244. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9245. ReleaseIntermediateOperand(mem);
  9246. ReleaseOperand(right);
  9247. ELSE (* covers cases: pointer / record / array *)
  9248. parameter := procedureType.returnParameter;
  9249. checker.SetCurrentScope(currentScope);
  9250. ASSERT(parameter # NIL);
  9251. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9252. Assign(parameterDesignator,expression);
  9253. END;
  9254. ReleaseIntermediateOperand(left);
  9255. IF locked THEN Lock(FALSE) END;
  9256. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9257. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9258. parameter := procedureType.returnParameter;
  9259. checker.SetCurrentScope(currentScope);
  9260. IF parameter = NIL THEN
  9261. Error(procedure.position, "structured return of parameter of procedure not found");
  9262. ELSE
  9263. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9264. Assign(parameterDesignator,expression);
  9265. END;
  9266. IF locked THEN Lock(FALSE) END;
  9267. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9268. ELSE
  9269. HALT(200);
  9270. END;
  9271. ELSE
  9272. IF locked THEN Lock(FALSE) END;
  9273. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9274. END;
  9275. IF backend.cooperative THEN
  9276. BrL(exitLabel);
  9277. ELSE
  9278. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9279. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9280. END;
  9281. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9282. END VisitReturnStatement;
  9283. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9284. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9285. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9286. statements: SyntaxTree.StatementSequence;
  9287. name, suffix: SyntaxTree.IdentifierString;
  9288. BEGIN
  9289. Strings.IntToStr(awaitProcCounter,suffix);
  9290. Strings.Concat("@AwaitProcedure",suffix,name);
  9291. identifier := SyntaxTree.NewIdentifier(name);
  9292. INC(awaitProcCounter);
  9293. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9294. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9295. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9296. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9297. procedure.SetAccess(SyntaxTree.Hidden);
  9298. procedure.SetScope(currentScope);
  9299. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9300. procedureType.SetReturnType(system.booleanType);
  9301. procedure.SetType(procedureType);
  9302. body := SyntaxTree.NewBody(x.position,procedureScope);
  9303. procedureScope.SetBody(body);
  9304. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9305. returnStatement.SetReturnValue(x.condition);
  9306. statements := SyntaxTree.NewStatementSequence();
  9307. statements.AddStatement(returnStatement);
  9308. body.SetStatementSequence(statements);
  9309. currentScope.AddProcedure(procedure);
  9310. RETURN procedure
  9311. END MakeAwaitProcedure;
  9312. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9313. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9314. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9315. BEGIN
  9316. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9317. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9318. IF backend.cooperative THEN
  9319. start := NewLabel();
  9320. true := NewLabel();
  9321. false := NewLabel();
  9322. SetLabel(start);
  9323. Condition(x.condition,true,false);
  9324. SetLabel(false);
  9325. PushSelfPointer();
  9326. CallThis(position,"ExclusiveBlocks","Await",1);
  9327. BrL(start);
  9328. SetLabel(true);
  9329. PushSelfPointer();
  9330. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9331. ELSE
  9332. proc := MakeAwaitProcedure(x);
  9333. Emit(Push(position,fp));
  9334. GetCodeSectionNameForSymbol(proc,name);
  9335. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9336. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9337. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9338. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9339. Emit(Result(position,res));
  9340. (*
  9341. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9342. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9343. *)
  9344. InitOperand(result,ModeValue);
  9345. result.op := res;
  9346. label := NewLabel();
  9347. BreqL(label, result.op, SELF.true);
  9348. ReleaseOperand(result);
  9349. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9350. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9351. Emit(Push(position,res));
  9352. Emit(Push(position,fp));
  9353. PushSelfPointer();
  9354. Emit(Push(position,nil));
  9355. CallThis(position,"Objects","Await",4);
  9356. SetLabel(label);
  9357. END;
  9358. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9359. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9360. END VisitAwaitStatement;
  9361. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9362. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9363. BEGIN
  9364. FOR i := 0 TO x.Length() - 1 DO
  9365. statement := x.GetStatement( i );
  9366. Statement(statement);
  9367. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9368. END;
  9369. END StatementSequence;
  9370. PROCEDURE PushSelfPointer;
  9371. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9372. BEGIN
  9373. scope := currentScope;
  9374. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9375. scope := scope.outerScope;
  9376. END;
  9377. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9378. IF ~newObjectFile THEN
  9379. Symbol(moduleSelf,op);
  9380. IntermediateCode.MakeMemory(op.op,addressType);
  9381. ELSE
  9382. moduleSection := meta.ModuleSection();
  9383. IF backend.cooperative THEN
  9384. moduleOffset := 0;
  9385. ELSE
  9386. moduleOffset := moduleSection.pc;
  9387. END;
  9388. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9389. END;
  9390. ELSE
  9391. GetBaseRegister(op.op,currentScope,scope);
  9392. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9393. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9394. IF backend.cooperative THEN
  9395. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9396. END;
  9397. IntermediateCode.MakeMemory(op.op,addressType);
  9398. END;
  9399. Emit(Push(position,op.op));
  9400. ReleaseOperand(op);
  9401. END PushSelfPointer;
  9402. PROCEDURE Lock(lock: BOOLEAN);
  9403. BEGIN
  9404. IF Trace THEN TraceEnter("Lock") END;
  9405. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9406. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9407. ASSERT(modifyAssignmentCounter = 0);
  9408. IF dump # NIL THEN
  9409. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9410. dump.Ln;dump.Update;
  9411. END;
  9412. PushSelfPointer;
  9413. IF backend.cooperative THEN
  9414. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9415. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9416. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9417. END;
  9418. ELSE
  9419. Emit(Push(position,true));
  9420. IF lock THEN CallThis(position,"Objects","Lock",2)
  9421. ELSE CallThis(position,"Objects","Unlock",2);
  9422. END;
  9423. END;
  9424. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9425. IF Trace THEN TraceExit("Lock") END;
  9426. END Lock;
  9427. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9428. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9429. BEGIN
  9430. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9431. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9432. previouslyUnchecked := isUnchecked;
  9433. isUnchecked := isUnchecked OR x.isUnchecked;
  9434. previouslyCooperativeSwitches := cooperativeSwitches;
  9435. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9436. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9437. IF x.statements # NIL THEN
  9438. StatementSequence(x.statements);
  9439. END;
  9440. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9441. isUnchecked := previouslyUnchecked;
  9442. cooperativeSwitches := previouslyCooperativeSwitches;
  9443. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9444. END VisitStatementBlock;
  9445. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9446. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9447. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9448. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9449. procedure: SyntaxTree.Procedure;
  9450. map: SymbolMap;
  9451. BEGIN
  9452. scope := currentScope;
  9453. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9454. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9455. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9456. return := emptyOperand;
  9457. IF Trace THEN TraceEnter("VisitCode") END;
  9458. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9459. NEW(in, x.inRules.Length());
  9460. FOR i := 0 TO LEN(in)-1 DO
  9461. statement := x.inRules.GetStatement(i);
  9462. WITH statement: SyntaxTree.Assignment DO
  9463. Evaluate(statement.right, operand);
  9464. result := operand.op;
  9465. NEW(str, 64);
  9466. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9467. in[i] := result; IntermediateCode.SetString(in[i], str);
  9468. ReleaseIntermediateOperand(operand.tag);
  9469. END;
  9470. END;
  9471. ELSE in := NIL
  9472. END;
  9473. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9474. NEW(out, x.outRules.Length());
  9475. FOR i := 0 TO LEN(out)-1 DO
  9476. statement := x.outRules.GetStatement(i);
  9477. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9478. WITH statement: SyntaxTree.Assignment DO
  9479. Evaluate(statement.left, operand); (*?? or designate *)
  9480. result := operand.op;
  9481. NEW(str, 64);
  9482. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9483. out[i] := result; IntermediateCode.SetString(out[i], str);
  9484. ReleaseIntermediateOperand(operand.tag);
  9485. |statement: SyntaxTree.ReturnStatement DO
  9486. NEW(str, 64);
  9487. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9488. IF currentIsInline THEN
  9489. map := currentMapper.Get(NIL);
  9490. Evaluate(map.to, operand);
  9491. out[i] := operand.op;
  9492. ELSE
  9493. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9494. END;
  9495. IntermediateCode.SetString(out[i], str);
  9496. ReleaseIntermediateOperand(operand.tag);
  9497. return := out[i];
  9498. ELSE
  9499. END;
  9500. END;
  9501. ELSE out := NIL
  9502. END;
  9503. Emit(Asm(x.position,x.sourceCode, in, out));
  9504. IF in # NIL THEN
  9505. FOR i := 0 TO LEN(in)-1 DO
  9506. ReleaseIntermediateOperand(in[i]);
  9507. END;
  9508. END;
  9509. IF out # NIL THEN
  9510. FOR i := 0 TO LEN(out)-1 DO
  9511. WITH statement: SyntaxTree.Assignment DO
  9512. ReleaseIntermediateOperand(out[i]);
  9513. ELSE
  9514. IF currentIsInline THEN
  9515. ReleaseIntermediateOperand(out[i]);
  9516. END;
  9517. END;
  9518. statement := x.outRules.GetStatement(i);
  9519. END;
  9520. END;
  9521. IF return.mode # IntermediateCode.Undefined THEN
  9522. IF currentIsInline THEN
  9523. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9524. Symbol(procedureType.returnParameter, par);
  9525. MakeMemory(mem, par.op, return.type, 0);
  9526. ReleaseOperand(par);
  9527. Emit(Mov(position, mem, return));
  9528. ReleaseIntermediateOperand(mem);
  9529. ELSE
  9530. Emit(Return(position,return));
  9531. END;
  9532. IF currentIsInline THEN RETURN END;
  9533. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9534. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9535. ReleaseIntermediateOperand(return);
  9536. END;
  9537. IF Trace THEN TraceExit("VisitCode") END;
  9538. END VisitCode;
  9539. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9540. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9541. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9542. const, call: IntermediateCode.Operand;
  9543. parameterDesignator: SyntaxTree.Expression;
  9544. saved: RegisterEntry;
  9545. name: Basic.SegmentedName;
  9546. BEGIN
  9547. IF Trace THEN TraceEnter("ParameterCopies") END;
  9548. parameter := x.firstParameter;
  9549. WHILE parameter # NIL DO
  9550. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9551. type := parameter.type.resolved;
  9552. IF IsOpenArray(type) THEN
  9553. VisitParameter(parameter);
  9554. op := result;
  9555. IF backend.cooperative & parameter.NeedsTrace() THEN
  9556. length := GetArrayLength(type, op.tag);
  9557. size := NewRegisterOperand(addressType);
  9558. base := ArrayBaseType(type);
  9559. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9560. Emit(Mul(position, size, length, const));
  9561. dst := NewRegisterOperand (addressType);
  9562. Emit(Mov(position, dst, size));
  9563. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9564. Emit(Sub(position,dst,sp,dst));
  9565. Emit(And(position,dst,dst,const));
  9566. Emit(Mov(position,sp,dst));
  9567. par := fp;
  9568. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9569. IntermediateCode.InitImmediate(null, byteType, 0);
  9570. Emit(Fill(position, dst, size, null));
  9571. ReleaseIntermediateOperand(dst);
  9572. ReleaseIntermediateOperand(length);
  9573. SaveRegisters();ReleaseUsedRegisters(saved);
  9574. (* register dst has been freed before SaveRegisters already *)
  9575. base := ArrayBaseType(type);
  9576. (* assign method of open array *)
  9577. IF base.IsRecordType() THEN
  9578. Emit (Push(position, length));
  9579. Emit (Push(position, dst));
  9580. Emit (Push(position, op.op));
  9581. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9582. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9583. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9584. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9585. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9586. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9587. Emit (Push(position,length));
  9588. Emit (Push(position, dst));
  9589. Emit (Push(position, length));
  9590. Emit (Push(position, op.op));
  9591. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9592. ELSE
  9593. Emit (Push(position, length));
  9594. Emit (Push(position, dst));
  9595. Emit (Push(position, length));
  9596. Emit (Push(position, op.op));
  9597. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9598. ASSERT(ArrayBaseType(type).IsPointer());
  9599. END;
  9600. RestoreRegisters(saved);
  9601. ELSE
  9602. temp := GetDynamicSize(type,op.tag);
  9603. ReuseCopy(size,temp);
  9604. ReleaseIntermediateOperand(temp);
  9605. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9606. Emit(Sub(position,size,sp,size));
  9607. Emit(And(position,size,size,const));
  9608. Emit(Mov(position,sp,size));
  9609. par := fp;
  9610. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9611. ReleaseIntermediateOperand(size);
  9612. size := GetDynamicSize(type,op.tag);
  9613. END;
  9614. Emit(Copy(position,sp,op.op,size));
  9615. ReleaseIntermediateOperand(size);
  9616. ReleaseOperand(op);
  9617. IntermediateCode.MakeMemory(par,addressType);
  9618. Emit(Mov(position,par,sp));
  9619. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9620. checker.SetCurrentScope(currentScope);
  9621. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9622. Assign(parameterDesignator,parameterDesignator);
  9623. END;
  9624. END;
  9625. parameter := parameter.nextParameter;
  9626. END;
  9627. IF Trace THEN TraceExit("ParameterCopies") END;
  9628. END ParameterCopies;
  9629. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9630. VAR x: SyntaxTree.Variable;
  9631. BEGIN
  9632. x := scope.firstVariable;
  9633. WHILE x # NIL DO
  9634. InitVariable(x);
  9635. x := x.nextVariable;
  9636. END;
  9637. END InitVariables;
  9638. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9639. BEGIN
  9640. IF (symbol # NIL) THEN
  9641. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9642. ELSE
  9643. RETURN 0
  9644. END;
  9645. END GetFingerprint;
  9646. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9647. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9648. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9649. saved: RegisterEntry;
  9650. BEGIN
  9651. IF Trace THEN TraceEnter("Body") END;
  9652. ReleaseUsedRegisters(saved); (* just in case ... *)
  9653. section := ir;
  9654. exitLabel := NewLabel ();
  9655. IF moduleBody THEN moduleBodySection := section END;
  9656. IF ir.comments # NIL THEN
  9657. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9658. commentPrintout.SingleStatement(TRUE);
  9659. dump := ir.comments;
  9660. ELSE
  9661. commentPrintout := NIL;
  9662. dump := NIL;
  9663. END;
  9664. prevScope := currentScope;
  9665. currentScope := scope;
  9666. lastSwitchPC := 0;
  9667. cooperativeSwitches := backend.cooperative;
  9668. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9669. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9670. IF x # NIL THEN
  9671. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9672. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9673. IF moduleBody THEN
  9674. ProfilerInit();
  9675. ELSE
  9676. Basic.SegmentedNameToString(ir.name, string);
  9677. ProfilerAddProcedure(numberProcedures,string);
  9678. ProfilerEnterExit(numberProcedures,TRUE);
  9679. END;
  9680. END;
  9681. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9682. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9683. END;
  9684. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9685. IF moduleBody THEN
  9686. InitVariables(moduleScope)
  9687. END;
  9688. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9689. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9690. IF procedure = cellScope.bodyProcedure THEN
  9691. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9692. StaticCallOperand(op, cellScope.constructor);
  9693. Emit(Call(position,op.op,0));
  9694. END;
  9695. END;
  9696. END;
  9697. ParameterCopies(procedureType);
  9698. InitVariables(scope);
  9699. IF x.code = NIL THEN
  9700. VisitStatementBlock(x);
  9701. ELSE
  9702. VisitCode(x.code)
  9703. END;
  9704. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9705. ir.SetFinally(ir.pc);
  9706. StatementSequence(x.finally)
  9707. END;
  9708. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9709. IF ~backend.cooperative THEN
  9710. ProfilerEnterExit(numberProcedures,FALSE);
  9711. END;
  9712. INC(numberProcedures);
  9713. END;
  9714. END;
  9715. IF backend.cooperative THEN
  9716. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9717. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9718. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9719. (*! not required any more? check and delete!
  9720. PushSelfPointer();
  9721. CallThis(position,"Modules","SetInitialized",1);
  9722. *)
  9723. (*
  9724. SetLabel(end);
  9725. *)
  9726. END;
  9727. IF x # NIL THEN
  9728. SELF.position := x.position;
  9729. END;
  9730. CheckRegistersFree();
  9731. ASSERT(modifyAssignmentCounter = 0);
  9732. currentScope := prevScope;
  9733. IF Trace THEN TraceExit("Body") END;
  9734. END Body;
  9735. END ImplementationVisitor;
  9736. MetaDataGenerator=OBJECT
  9737. VAR
  9738. implementationVisitor: ImplementationVisitor;
  9739. declarationVisitor: DeclarationVisitor;
  9740. module: Sections.Module;
  9741. moduleName: ARRAY 128 OF CHAR;
  9742. moduleNamePool: Basic.HashTableInt;
  9743. moduleNamePoolSection: IntermediateCode.Section;
  9744. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9745. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9746. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9747. TypeTags: LONGINT; (* type extension level support *)
  9748. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9749. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9750. BEGIN
  9751. IF implementationVisitor.backend.cooperative THEN
  9752. TypeTags := MAX(LONGINT);
  9753. BaseTypesTableOffset := 0;
  9754. MethodTableOffset := 2;
  9755. TypeRecordBaseOffset := 0;
  9756. ELSIF simple THEN
  9757. TypeTags := 3; (* only 3 extensions allowed *)
  9758. BaseTypesTableOffset := 1;
  9759. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9760. TypeRecordBaseOffset := 0;
  9761. ELSE
  9762. TypeTags := 16;
  9763. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9764. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9765. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9766. END;
  9767. SELF.simple := simple;
  9768. SELF.implementationVisitor := implementationVisitor;
  9769. SELF.declarationVisitor := declarationVisitor;
  9770. implementationVisitor.meta := SELF;
  9771. declarationVisitor.meta := SELF;
  9772. END InitMetaDataGenerator;
  9773. PROCEDURE SetModule(module: Sections.Module);
  9774. VAR namePoolOffset: LONGINT;
  9775. BEGIN
  9776. SELF.module := module;
  9777. Global.GetModuleName(module.module,moduleName);
  9778. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9779. NEW(moduleNamePool, 32);
  9780. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9781. END;
  9782. END SetModule;
  9783. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9784. BEGIN
  9785. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9786. END GetTypeRecordBaseOffset;
  9787. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9788. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9789. BEGIN
  9790. INC(dataAdrOffset,6);
  9791. Info(section,"headerAdr");
  9792. Address(section,0);
  9793. Info(section,"typeDesc");
  9794. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9795. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9796. NamedSymbol(section, name, symbol, 0, offset);
  9797. Info(section,"mark: LONGINT;");
  9798. Longint(section,-1);
  9799. Info(section,"dataAdr-: ADDRESS");
  9800. Symbol(section,section, dataAdrOffset,0);
  9801. Info(section,"size-: SIZE");
  9802. Address(section,0);
  9803. Info(section,"nextRealtime: HeapBlock;");
  9804. Address(section,0);
  9805. END HeapBlock;
  9806. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9807. VAR i: LONGINT;
  9808. BEGIN
  9809. INC(dataAdrOffset,14);
  9810. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9811. Info(section,"count*: LONGINT");
  9812. Longint(section,0);
  9813. Info(section,"locked*: BOOLEAN");
  9814. Longint(section,0);
  9815. Info(section,"awaitingLock*: ProcessQueue");
  9816. Address(section,0);
  9817. Address(section,0);
  9818. Info(section,"awaitingCond*: ProcessQueue");
  9819. Address(section,0);
  9820. Address(section,0);
  9821. Info(section,"lockedBy*: ANY");
  9822. Address(section,0);
  9823. Info(section,"lock*: ANY");
  9824. Address(section,0);
  9825. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9826. Longint(section,1);
  9827. FOR i := 2 TO 6 DO
  9828. Longint(section,0);
  9829. END;
  9830. END ProtectedHeapBlock;
  9831. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9832. BEGIN
  9833. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9834. END Info;
  9835. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9836. VAR op: IntermediateCode.Operand;
  9837. BEGIN
  9838. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9839. section.Emit(Data(-11,op));
  9840. END Address;
  9841. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9842. VAR op: IntermediateCode.Operand;
  9843. BEGIN
  9844. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9845. section.Emit(Data(-12,op));
  9846. END Size;
  9847. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9848. VAR op: IntermediateCode.Operand;
  9849. BEGIN
  9850. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9851. section.Emit(Data(-1,op));
  9852. END Set;
  9853. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9854. VAR op: IntermediateCode.Operand;
  9855. BEGIN
  9856. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9857. section.Emit(Data(-1,op));
  9858. END Longint;
  9859. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  9860. VAR op,noOperand: IntermediateCode.Operand;
  9861. BEGIN
  9862. IntermediateCode.InitOperand(noOperand);
  9863. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9864. section.PatchOperands(pc,op,noOperand,noOperand);
  9865. END PatchLongint;
  9866. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9867. VAR op, noOperand: IntermediateCode.Operand;
  9868. BEGIN
  9869. IntermediateCode.InitOperand(noOperand);
  9870. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9871. section.PatchOperands(pc,op,noOperand,noOperand);
  9872. END PatchSymbol;
  9873. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  9874. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  9875. BEGIN
  9876. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  9877. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  9878. section.Emit(Data(-1,op));
  9879. END Boolean;
  9880. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  9881. VAR op: IntermediateCode.Operand;
  9882. BEGIN
  9883. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  9884. section.Emit(Data(-1,op));
  9885. END Char;
  9886. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  9887. VAR i: LONGINT;
  9888. BEGIN
  9889. Info(section,str);
  9890. i := 0;
  9891. WHILE(str[i] # 0X) DO
  9892. Char(section,str[i]);
  9893. INC(i);
  9894. END;
  9895. Char(section,0X);
  9896. END String;
  9897. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9898. VAR op: IntermediateCode.Operand;
  9899. BEGIN
  9900. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9901. IntermediateCode.SetOffset(op,realOffset);
  9902. section.Emit(Data(-1,op));
  9903. END NamedSymbol;
  9904. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  9905. BEGIN
  9906. IF symbol= NIL THEN
  9907. Address( section, realOffset);
  9908. ASSERT(virtualOffset = 0);
  9909. ELSE
  9910. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  9911. END;
  9912. END Symbol;
  9913. (* OutPointers delivers
  9914. {pointerOffset}
  9915. *)
  9916. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  9917. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  9918. BEGIN
  9919. type := type.resolved;
  9920. IF type IS SyntaxTree.AnyType THEN
  9921. Symbol(section, symbol, 0, (offset ));
  9922. INC(numberPointers);
  9923. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9924. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  9925. Symbol(section, symbol, 0, offset); INC(numberPointers);
  9926. ELSIF type IS SyntaxTree.PointerType THEN
  9927. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  9928. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  9929. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  9930. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  9931. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  9932. ELSIF (type IS SyntaxTree.RecordType) THEN
  9933. (* never treat a record like a pointer, even if the pointer field is set! *)
  9934. WITH type: SyntaxTree.RecordType DO
  9935. base := type.GetBaseRecord();
  9936. IF base # NIL THEN
  9937. Pointers(offset,symbol,section, base,numberPointers);
  9938. END;
  9939. variable := type.recordScope.firstVariable;
  9940. WHILE(variable # NIL) DO
  9941. IF ~(variable.untraced) THEN
  9942. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9943. END;
  9944. variable := variable.nextVariable;
  9945. END;
  9946. END;
  9947. ELSIF (type IS SyntaxTree.CellType) THEN
  9948. WITH type: SyntaxTree.CellType DO
  9949. base := type.GetBaseRecord();
  9950. IF base # NIL THEN
  9951. Pointers(offset,symbol,section, base,numberPointers);
  9952. END;
  9953. variable := type.cellScope.firstVariable;
  9954. WHILE(variable # NIL) DO
  9955. IF ~(variable.untraced) THEN
  9956. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9957. END;
  9958. variable := variable.nextVariable;
  9959. END;
  9960. END;
  9961. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9962. WITH type: SyntaxTree.ArrayType DO
  9963. IF type.form= SyntaxTree.Static THEN
  9964. n := type.staticLength;
  9965. base := type.arrayBase.resolved;
  9966. WHILE(base IS SyntaxTree.ArrayType) DO
  9967. type := base(SyntaxTree.ArrayType);
  9968. n := n* type.staticLength;
  9969. base := type.arrayBase.resolved;
  9970. END;
  9971. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9972. IF SemanticChecker.ContainsPointer(base) THEN
  9973. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9974. FOR i := 0 TO n-1 DO
  9975. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9976. END;
  9977. END;
  9978. ELSE
  9979. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  9980. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9981. END;
  9982. END;
  9983. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9984. WITH type: SyntaxTree.MathArrayType DO
  9985. IF type.form = SyntaxTree.Static THEN
  9986. n := type.staticLength;
  9987. base := type.arrayBase.resolved;
  9988. WHILE(base IS SyntaxTree.MathArrayType) DO
  9989. type := base(SyntaxTree.MathArrayType);
  9990. n := n* type.staticLength;
  9991. base := type.arrayBase.resolved;
  9992. END;
  9993. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9994. IF SemanticChecker.ContainsPointer(base) THEN
  9995. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9996. FOR i := 0 TO n-1 DO
  9997. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9998. END;
  9999. END;
  10000. ELSE
  10001. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10002. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10003. END
  10004. END;
  10005. (* ELSE no pointers in type *)
  10006. END;
  10007. END Pointers;
  10008. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10009. VAR position,i: LONGINT; ch: CHAR;
  10010. BEGIN
  10011. IF pool.Has(index) THEN
  10012. RETURN pool.GetInt(index)
  10013. ELSE
  10014. position := source.pc;
  10015. pool.PutInt(index, position);
  10016. Info(source, name);
  10017. i := 0;
  10018. REPEAT
  10019. ch := name[i]; INC(i);
  10020. Char( source, ch);
  10021. UNTIL ch = 0X;
  10022. END;
  10023. RETURN position;
  10024. END EnterDynamicName;
  10025. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10026. VAR name: Basic.SectionName; position: LONGINT;
  10027. BEGIN
  10028. IF pool.Has(index) THEN
  10029. RETURN pool.GetInt(index)
  10030. ELSE
  10031. StringPool.GetString(index, name);
  10032. position := EnterDynamicName(source,name,index, pool);
  10033. END;
  10034. RETURN position;
  10035. END DynamicName;
  10036. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10037. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10038. BEGIN
  10039. COPY(moduleName,name);
  10040. Strings.Append(name,suffix);
  10041. Basic.ToSegmentedName(name, pooledName);
  10042. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10043. IF implementationVisitor.backend.cooperative THEN
  10044. Info(section, "TypeDescriptor");
  10045. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10046. NamedSymbol(section, pooledName,NIL, 0, 0);
  10047. BasePointer(section);
  10048. offset := 0;
  10049. ELSE
  10050. HeapBlock(mName,typeName,section,2);
  10051. Info(section, "HeapBlock");
  10052. (*
  10053. Symbol(section,section,2,0);
  10054. *)
  10055. Address(section,0); (* empty such that GC does not go on traversing *)
  10056. Info(section, "TypeDescriptor");
  10057. Address(section,0);
  10058. offset := section.pc;
  10059. END;
  10060. RETURN section
  10061. END Block;
  10062. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10063. VAR name: Basic.SegmentedName;
  10064. BEGIN
  10065. Info(source,"ArrayHeader");
  10066. IF implementationVisitor.backend.cooperative THEN
  10067. sizePC := source.pc;
  10068. Address(source,0);
  10069. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10070. IF baseType # "" THEN
  10071. Basic.ToSegmentedName(baseType, name);
  10072. NamedSymbol(source, name,NIL, 0, 0);
  10073. ELSE
  10074. Address(source,0);
  10075. END;
  10076. Address(source,0);
  10077. ELSE
  10078. Address(source,0);
  10079. Address(source,0);
  10080. Address(source,0);
  10081. sizePC := source.pc;
  10082. Address(source,0);
  10083. Info(source,"array data");
  10084. END;
  10085. END Array;
  10086. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10087. BEGIN
  10088. IF implementationVisitor.backend.cooperative THEN
  10089. PatchLongint(section, pc, size);
  10090. PatchLongint(section, pc + 3, size);
  10091. ELSE
  10092. PatchLongint(section, pc, size);
  10093. END;
  10094. END PatchArray;
  10095. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10096. VAR
  10097. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10098. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10099. poolMap: Basic.HashTableInt;
  10100. namePool: IntermediateCode.Section;
  10101. namePoolOffset: LONGINT;
  10102. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10103. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10104. BEGIN
  10105. Basic.SegmentedNameToString(s1.name,n1);
  10106. Basic.SegmentedNameToString(s2.name,n2);
  10107. index := 0;
  10108. ch1 := n1[index];
  10109. ch2 := n2[index];
  10110. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10111. INC(index);
  10112. ch1 := n1[index];
  10113. ch2 := n2[index];
  10114. END;
  10115. RETURN ch1 < ch2;
  10116. END Compare;
  10117. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10118. VAR
  10119. i, j: LONGINT;
  10120. x, t: Sections.Section;
  10121. BEGIN
  10122. IF lo < hi THEN
  10123. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10124. WHILE i <= j DO
  10125. WHILE Compare(list[i], x) DO INC(i) END;
  10126. WHILE Compare(x, list[j]) DO DEC(j) END;
  10127. IF i <= j THEN
  10128. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10129. INC(i); DEC(j)
  10130. END
  10131. END;
  10132. IF lo < j THEN QuickSort(list, lo, j) END;
  10133. IF i < hi THEN QuickSort(list, i, hi) END
  10134. END;
  10135. END QuickSort;
  10136. (*
  10137. ExportDesc* = RECORD
  10138. fp*: ADDRESS;
  10139. name* {UNTRACED}: DynamicName;
  10140. adr*: ADDRESS;
  10141. exports*: LONGINT;
  10142. dsc* {UNTRACED}: ExportArray
  10143. END;
  10144. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10145. *)
  10146. PROCEDURE ExportDesc2(
  10147. source: IntermediateCode.Section;
  10148. namePool: IntermediateCode.Section;
  10149. fingerPrinter: FingerPrinter.FingerPrinter;
  10150. symbol: Sections.Section;
  10151. name: StringPool.Index;
  10152. VAR patchAdr: LONGINT
  10153. ): BOOLEAN;
  10154. VAR fingerPrint: SyntaxTree.FingerPrint;
  10155. BEGIN
  10156. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10157. & (symbol.type # Sections.InlineCodeSection)
  10158. THEN
  10159. *)
  10160. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10161. & (symbol.type # Sections.InlineCodeSection))
  10162. THEN
  10163. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10164. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10165. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10166. Longint(source,fingerPrint.shallow);
  10167. ELSE
  10168. Longint(source, 0);
  10169. END;
  10170. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10171. Symbol(source, symbol,0,0);
  10172. patchAdr := source.pc;
  10173. Address(source,0);
  10174. Address(source,0);
  10175. END;
  10176. RETURN TRUE
  10177. ELSE
  10178. RETURN FALSE
  10179. END;
  10180. END ExportDesc2;
  10181. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10182. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10183. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10184. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10185. TYPE
  10186. Scope = RECORD
  10187. elements: LONGINT;
  10188. gelements: LONGINT;
  10189. section: IntermediateCode.Section;
  10190. patchAdr: LONGINT;
  10191. arraySizePC: LONGINT;
  10192. beginPC: LONGINT; (* current scope start pc *)
  10193. END;
  10194. BEGIN
  10195. Basic.InitSegmentedName(prev);
  10196. olevel := -1;
  10197. scopes[0].section := source;
  10198. FOR s := 0 TO LEN(sections)-1 DO
  10199. symbol := sections[s];
  10200. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10201. this := sections[s].name;
  10202. level := 0;
  10203. WHILE (this[level] > 0) DO
  10204. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10205. INC(level);
  10206. END;
  10207. WHILE level < olevel DO
  10208. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10209. IF olevel > 0 THEN
  10210. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10211. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10212. END;
  10213. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10214. DEC(olevel);
  10215. END;
  10216. IF (this[level] > 0) THEN
  10217. IF level > olevel THEN
  10218. (*TRACE("opening",level); *)
  10219. IF scopes[level].section = NIL THEN
  10220. arrayName := ".@ExportArray";
  10221. Strings.AppendInt(arrayName, level);
  10222. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10223. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10224. END;
  10225. scopes[level].beginPC := scopes[level].section.pc;
  10226. olevel := level;
  10227. scopes[olevel].elements := 0;
  10228. END;
  10229. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10230. sym := sections[s];
  10231. ELSE
  10232. sym := NIL;
  10233. END;
  10234. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10235. THEN
  10236. INC(scopes[olevel].elements);
  10237. END;
  10238. (*StringPool.GetString(this[level], name);*)
  10239. (*TRACE(level, name);*)
  10240. (* enter string in scope *)
  10241. INC(level);
  10242. END;
  10243. END;
  10244. Basic.SegmentedNameToString(this, name);
  10245. (*TRACE(level, "enter", name);*)
  10246. prev := this;
  10247. END;
  10248. END;
  10249. WHILE 0 <= olevel DO
  10250. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10251. IF olevel > 0 THEN
  10252. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10253. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10254. END;
  10255. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10256. DEC(olevel);
  10257. END;
  10258. level := 0;
  10259. WHILE (level < LEN(scopes)) DO
  10260. IF scopes[level].section # NIL THEN
  10261. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10262. END;
  10263. INC(level);
  10264. END;
  10265. END Export;
  10266. BEGIN
  10267. NEW(fingerPrinter, module.system);
  10268. NEW(poolMap, 64);
  10269. (* this is the name pool private to the export table -- it is sorted and should not be mixed / used for other names in a module *)
  10270. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10271. NEW(sectionArray, module.allSections.Length());
  10272. FOR i := 0 TO module.allSections.Length() - 1 DO
  10273. section := module.allSections.GetSection(i);
  10274. sectionArray[i] := section;
  10275. END;
  10276. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10277. Export(sectionArray^);
  10278. END ExportDesc;
  10279. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10280. VAR
  10281. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10282. BEGIN
  10283. Info(source, "exception table offsets array descriptor");
  10284. size := 0;
  10285. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10286. Info(source, "exception table content");
  10287. FOR i := 0 TO module.allSections.Length() - 1 DO
  10288. p := module.allSections.GetSection(i);
  10289. IF p.type = Sections.CodeSection THEN
  10290. finallyPC := p(IntermediateCode.Section).finally;
  10291. IF finallyPC>=0 THEN
  10292. Symbol( source, p, 0,0);
  10293. Symbol( source, p, finallyPC, 0);
  10294. Symbol( source, p, finallyPC,0);
  10295. INC(size);
  10296. END;
  10297. END
  10298. END;
  10299. PatchArray(source,sizePC,size);
  10300. END ExceptionArray;
  10301. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10302. VAR i: LONGINT; ch: CHAR;
  10303. BEGIN
  10304. i := 0;
  10305. REPEAT
  10306. ch := name[i]; INC(i);
  10307. Char( section, ch);
  10308. UNTIL ch = 0X;
  10309. WHILE i < 32 DO
  10310. Char( section, 0X); INC(i);
  10311. END;
  10312. END Name;
  10313. PROCEDURE References(section: IntermediateCode.Section);
  10314. CONST
  10315. rfDirect = 1X; rfIndirect = 3X;
  10316. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10317. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10318. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10319. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10320. rfRecordPointer=1DX;
  10321. rfArrayFlag = 80X;
  10322. VAR
  10323. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10324. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10325. VAR char: CHAR;
  10326. BEGIN
  10327. IF type = NIL THEN char := rfLongint
  10328. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10329. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10330. ELSIF type IS SyntaxTree.CharacterType THEN
  10331. IF type.sizeInBits = 8 THEN char := rfChar8
  10332. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10333. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10334. END;
  10335. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10336. IF type.sizeInBits = 8 THEN char := rfShortint
  10337. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10338. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10339. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10340. END;
  10341. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10342. ELSIF type IS SyntaxTree.FloatType THEN
  10343. IF type.sizeInBits = 32 THEN char := rfReal
  10344. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10345. END;
  10346. ELSIF type IS SyntaxTree.ComplexType THEN
  10347. IF type.sizeInBits = 64 THEN char := rfComplex
  10348. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10349. END;
  10350. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10351. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10352. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10353. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10354. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10355. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10356. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10357. END;
  10358. RETURN char
  10359. END BaseType;
  10360. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10361. VAR destination: Sections.Section;
  10362. BEGIN
  10363. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10364. IF type.pointerType # NIL THEN
  10365. Char(section,rfRecordPointer)
  10366. ELSE
  10367. Char(section,rfRecord);
  10368. END;
  10369. IF destination = NIL THEN
  10370. Longint(section,0);
  10371. ELSE
  10372. Longint(section,destination.offset); (* used for ? *)
  10373. END;
  10374. END RecordType;
  10375. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10376. BEGIN
  10377. baseType := type.arrayBase.resolved;
  10378. IF type.form = SyntaxTree.Static THEN
  10379. IF baseType IS SyntaxTree.ArrayType THEN
  10380. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10381. ELSE
  10382. RETURN type.staticLength
  10383. END
  10384. ELSE
  10385. RETURN 0
  10386. END;
  10387. END StaticArrayLength;
  10388. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10389. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10390. BEGIN
  10391. length := StaticArrayLength(type, baseType);
  10392. char := BaseType(baseType);
  10393. IF type.form # SyntaxTree.Open THEN
  10394. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10395. Longint(section, length)
  10396. ELSE
  10397. length :=0;
  10398. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10399. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10400. Longint(section, length)
  10401. END;
  10402. END ArrayType;
  10403. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10404. BEGIN
  10405. baseType := type.arrayBase;
  10406. IF baseType # NIL THEN
  10407. baseType := baseType.resolved;
  10408. END;
  10409. IF type.form = SyntaxTree.Static THEN
  10410. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10411. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10412. ELSE
  10413. RETURN type.staticLength
  10414. END
  10415. ELSE
  10416. RETURN 0
  10417. END;
  10418. END StaticMathArrayLength;
  10419. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10420. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10421. BEGIN
  10422. length := StaticMathArrayLength(type, baseType);
  10423. char := BaseType(baseType);
  10424. IF type.form = SyntaxTree.Open THEN
  10425. char := BaseType(module.system.addressType);
  10426. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10427. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10428. Longint(section, length)
  10429. ELSIF type.form=SyntaxTree.Tensor THEN
  10430. char := BaseType(module.system.addressType);
  10431. Char(section, CHR(ORD(char)));
  10432. ELSE
  10433. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10434. Longint(section, length)
  10435. END;
  10436. END MathArrayType;
  10437. PROCEDURE Type(type: SyntaxTree.Type);
  10438. BEGIN
  10439. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10440. IF type IS SyntaxTree.BasicType THEN
  10441. Char(section, BaseType(type));
  10442. ELSIF type IS SyntaxTree.RecordType THEN
  10443. RecordType(type(SyntaxTree.RecordType));
  10444. ELSIF type IS SyntaxTree.ArrayType THEN
  10445. ArrayType(type(SyntaxTree.ArrayType))
  10446. ELSIF type IS SyntaxTree.EnumerationType THEN
  10447. Char(section, BaseType(module.system.longintType))
  10448. ELSIF type IS SyntaxTree.PointerType THEN
  10449. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10450. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10451. ELSE
  10452. Char(section, BaseType(type))
  10453. END;
  10454. ELSIF type IS SyntaxTree.ProcedureType THEN
  10455. Char(section, BaseType(type));
  10456. ELSIF type IS SyntaxTree.MathArrayType THEN
  10457. MathArrayType(type(SyntaxTree.MathArrayType));
  10458. ELSIF type IS SyntaxTree.CellType THEN
  10459. Char(section, BaseType(module.system.anyType));
  10460. ELSE HALT(200)
  10461. END;
  10462. END Type;
  10463. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10464. VAR name: ARRAY 256 OF CHAR;
  10465. BEGIN
  10466. IF variable.externalName # NIL THEN RETURN END;
  10467. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10468. variable.GetName(name);
  10469. Type(variable.type);
  10470. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10471. String(section,name);
  10472. END WriteVariable;
  10473. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10474. VAR name: ARRAY 256 OF CHAR;
  10475. BEGIN
  10476. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10477. variable.GetName(name);
  10478. Type(variable.type);
  10479. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10480. variable.GetName(name);
  10481. String(section,name);
  10482. END WriteParameter;
  10483. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10484. BEGIN
  10485. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10486. IF type IS SyntaxTree.ArrayType THEN
  10487. WITH type: SyntaxTree.ArrayType DO
  10488. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10489. ELSE Char(section,rfOpenArray)
  10490. END;
  10491. END
  10492. ELSIF type IS SyntaxTree.MathArrayType THEN
  10493. WITH type: SyntaxTree.MathArrayType DO
  10494. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10495. ELSE Char(section,rfOpenArray)
  10496. END;
  10497. END
  10498. ELSIF type IS SyntaxTree.RecordType THEN
  10499. Char(section,rfRecord);
  10500. ELSE
  10501. Char(section, BaseType(type));
  10502. END;
  10503. END ReturnType;
  10504. PROCEDURE Procedure(s: Sections.Section);
  10505. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10506. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10507. name: ARRAY 256 OF CHAR;
  10508. BEGIN
  10509. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10510. (*procedure.name,name);*)
  10511. Global.GetSymbolNameInScope(procedure,module.module.moduleScope,name);
  10512. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10513. Char(section,0F9X);
  10514. Symbol(section,s,0,0);
  10515. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10516. Longint(section,procedureType.numberParameters);
  10517. ReturnType(procedureType.returnType);
  10518. Longint(section,0); (*! level *)
  10519. Longint(section,0);
  10520. (*
  10521. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10522. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10523. recordName := "";
  10524. IF record.pointerType # NIL THEN
  10525. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10526. ELSE
  10527. DeclarationName(record.typeDeclaration,recordName);
  10528. END;
  10529. i := 0;
  10530. Info(section,recordName);
  10531. WHILE recordName[i] # 0X DO
  10532. Char(section,recordName[i]); INC(i);
  10533. INC(size);
  10534. END;
  10535. Char(section,".");
  10536. INC(size);
  10537. END;
  10538. *)
  10539. String(section,name);
  10540. parameter := procedureType.firstParameter;
  10541. WHILE(parameter # NIL) DO
  10542. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10543. parameter := parameter.nextParameter;
  10544. END;
  10545. variable := procedure.procedureScope.firstVariable;
  10546. WHILE(variable # NIL) DO
  10547. WriteVariable(variable,FALSE);
  10548. variable := variable.nextVariable;
  10549. END;
  10550. END Procedure;
  10551. PROCEDURE Scope(s: Sections.Section);
  10552. BEGIN
  10553. Char(section,0F8X);
  10554. Symbol(section,s,0,0); (* start *)
  10555. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10556. String(section,"$$");
  10557. (* removed variables -- wrongly interpreted by Reflection
  10558. variable := module.module.moduleScope.firstVariable;
  10559. WHILE(variable # NIL) DO
  10560. WriteVariable(variable,FALSE);
  10561. variable := variable.nextVariable;
  10562. END;
  10563. *)
  10564. END Scope;
  10565. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10566. VAR result, i: LONGINT;
  10567. BEGIN
  10568. FOR i := startPC TO endPC -1 DO
  10569. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10570. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10571. END;
  10572. RETURN result;
  10573. END ComputeSize;
  10574. BEGIN
  10575. Array(section,sizePC,"");
  10576. startPC := section.pc;
  10577. Char(section,0FFX); (* sign for trap writer *)
  10578. FOR i := 0 TO module.allSections.Length() - 1 DO
  10579. s := module.allSections.GetSection(i);
  10580. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10581. Scope(s) (*! must be first procedure in ref section *)
  10582. END
  10583. END;
  10584. FOR i := 0 TO module.allSections.Length() - 1 DO
  10585. s := module.allSections.GetSection(i);
  10586. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10587. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10588. Procedure(s)
  10589. END
  10590. END;
  10591. endPC := section.pc;
  10592. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10593. END References;
  10594. (*
  10595. Command* = RECORD
  10596. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10597. name*: Name; (* name of the procedure *)
  10598. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10599. entryAdr* : ADDRESS; (* entry address of procedure *)
  10600. END;
  10601. *)
  10602. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10603. VAR
  10604. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10605. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10606. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  10607. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10608. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10609. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10610. BEGIN
  10611. RETURN
  10612. (type = NIL) OR
  10613. (type.resolved IS SyntaxTree.RecordType) OR
  10614. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10615. (type.resolved IS SyntaxTree.AnyType);
  10616. END TypeAllowed;
  10617. BEGIN
  10618. numberParameters := procedureType.numberParameters;
  10619. RETURN
  10620. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10621. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10622. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10623. END GetProcedureAllowed;
  10624. PROCEDURE WriteType(type : SyntaxTree.Type);
  10625. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10626. name: Basic.SegmentedName; offset: LONGINT;
  10627. BEGIN
  10628. IF type = NIL THEN
  10629. Address(source,0);
  10630. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10631. Address(source,1);
  10632. ELSE
  10633. type := type.resolved;
  10634. IF type IS SyntaxTree.PointerType THEN
  10635. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10636. END;
  10637. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10638. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10639. name[0] := typeDeclaration.name; name[1] := -1;
  10640. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10641. ASSERT(section # NIL);
  10642. ELSE
  10643. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10644. (* TODO *)
  10645. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10646. END;
  10647. IF implementationVisitor.backend.cooperative THEN
  10648. offset := 0;
  10649. ELSE
  10650. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10651. END;
  10652. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10653. END;
  10654. END WriteType;
  10655. BEGIN
  10656. Info(source, "command array descriptor");
  10657. Array(source,sizePC,"Modules.Command");
  10658. numberCommands := 0;
  10659. Info(source, "command array content");
  10660. FOR i := 0 TO module.allSections.Length() - 1 DO
  10661. p := module.allSections.GetSection(i);
  10662. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10663. procedure := p.symbol(SyntaxTree.Procedure);
  10664. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10665. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10666. procedure.GetName(name);
  10667. Name(source,name);
  10668. numberParameters := procedureType.numberParameters;
  10669. (* offset of type of first parameter *)
  10670. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10671. ELSE WriteType(procedureType.firstParameter.type)
  10672. END;
  10673. (* offset of type of return parameter *)
  10674. WriteType(procedureType.returnType);
  10675. (* command name *)
  10676. (* command code offset *)
  10677. Symbol(source,p,0,0);
  10678. INC(numberCommands);
  10679. IF Trace THEN
  10680. D.Ln;
  10681. END;
  10682. END;
  10683. END
  10684. END;
  10685. PatchArray(source,sizePC,numberCommands);
  10686. END CommandArray;
  10687. (* to prevent from double import of different module aliases *)
  10688. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10689. VAR i: SyntaxTree.Import;
  10690. BEGIN
  10691. i := module.module.moduleScope.firstImport;
  10692. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10693. i := i.nextImport;
  10694. END;
  10695. RETURN i = import
  10696. END IsFirstDirectOccurence;
  10697. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10698. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10699. BEGIN
  10700. Array(source,pc,"");
  10701. Info(source, "import module array data");
  10702. IF implementationVisitor.backend.cooperative THEN
  10703. offset := 0;
  10704. ELSE
  10705. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10706. END;
  10707. import := module.module.moduleScope.firstImport;
  10708. numberImports := 0;
  10709. WHILE import # NIL DO
  10710. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10711. Global.GetModuleSegmentedName(import.module,name);
  10712. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10713. NamedSymbol(source, name, NIL, 0, offset);
  10714. INC(numberImports);
  10715. END;
  10716. import := import.nextImport
  10717. END;
  10718. PatchArray(source,pc,numberImports);
  10719. END ImportsArray;
  10720. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10721. VAR
  10722. p: Sections.Section; sizePC, size, i: LONGINT;
  10723. BEGIN
  10724. Info(source, "Type info section");
  10725. size := 0;
  10726. Array(source,sizePC,"Modules.TypeDesc");
  10727. FOR i := 0 TO module.allSections.Length() - 1 DO
  10728. p := module.allSections.GetSection(i);
  10729. WITH p: IntermediateCode.Section DO
  10730. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10731. Symbol(source,p,0,0);
  10732. INC(size);
  10733. END;
  10734. END
  10735. END;
  10736. PatchArray(source,sizePC,size);
  10737. END TypeInfoSection;
  10738. (*
  10739. ProcTableEntry* = RECORD
  10740. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10741. noPtr*: LONGINT;
  10742. END;
  10743. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10744. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10745. *)
  10746. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10747. VAR
  10748. destination: Sections.Section;
  10749. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10750. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10751. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10752. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10753. BEGIN
  10754. Info(procArray,"pcFrom");
  10755. Symbol(procArray,destination,0,0);
  10756. Info(procArray,"pcTo");
  10757. Symbol(procArray,destination,destination.pc,0);
  10758. Info(procArray,"pcStatementBegin");
  10759. Symbol(procArray,destination,destination.validPAFEnter,0);
  10760. Info(procArray,"pcStatementEnd");
  10761. Symbol(procArray,destination,destination.validPAFExit,0);
  10762. IF ~implementationVisitor.backend.cooperative THEN
  10763. Basic.SegmentedNameToString(destination.name, string);
  10764. Info(pointerArray,string);
  10765. procedure := destination.symbol(SyntaxTree.Procedure);
  10766. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10767. variable := procedure.procedureScope.firstVariable;
  10768. WHILE(variable # NIL) DO
  10769. IF ~(variable.untraced) THEN
  10770. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10771. END;
  10772. variable := variable.nextVariable
  10773. END;
  10774. parameter := procedureType.firstParameter;
  10775. WHILE(parameter # NIL) DO
  10776. IF ~(parameter.untraced) THEN
  10777. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10778. END;
  10779. parameter := parameter.nextParameter;
  10780. END;
  10781. END;
  10782. Info(procArray,"numberPointers");
  10783. Longint(procArray,numberPointers);
  10784. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10785. INC(pointerArraySize, numberPointers);
  10786. END PointerOffsets;
  10787. BEGIN
  10788. maxPointers := 0;
  10789. Info(procArray, "proc array descriptor");
  10790. Address(procArray,0);
  10791. Address(procArray,0);
  10792. Address(procArray,0);
  10793. procArraySizePC := procArray.pc;
  10794. Address(procArray,0);
  10795. procArraySize := 0;
  10796. IF ~implementationVisitor.backend.cooperative THEN
  10797. Info(pointerArray, "pointer array descriptor");
  10798. Address(pointerArray,0);
  10799. Address(pointerArray,0);
  10800. Address(pointerArray,0);
  10801. pointerArraySizePC := pointerArray.pc;
  10802. Address(pointerArray,0);
  10803. pointerArraySize := 0;
  10804. END;
  10805. procArraySize := 0;
  10806. FOR i := 0 TO module.allSections.Length() - 1 DO
  10807. destination := module.allSections.GetSection(i);
  10808. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10809. PointerOffsets(destination(IntermediateCode.Section));
  10810. INC(procArraySize);
  10811. END
  10812. END;
  10813. PatchLongint(procArray,procArraySizePC,procArraySize);
  10814. IF ~implementationVisitor.backend.cooperative THEN
  10815. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10816. END;
  10817. END PointersInProcTables;
  10818. (*
  10819. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10820. VAR
  10821. next*: Module; (** once a module is published, all fields are read-only *)
  10822. name*: Name;
  10823. init, published: BOOLEAN;
  10824. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10825. sb*: ADDRESS; <- set to beginning of data section by loader
  10826. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10827. command*: POINTER TO ARRAY OF Command;
  10828. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10829. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10830. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10831. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10832. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10833. data*, code*: Bytes;
  10834. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10835. export*: ExportDesc;
  10836. term*: TerminationHandler;
  10837. exTable*: ExceptionTable;
  10838. noProcs*: LONGINT;
  10839. firstProc*: ADDRESS; <- done by loader
  10840. maxPtrs*: LONGINT;
  10841. crc*: LONGINT;
  10842. *)
  10843. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10844. BEGIN
  10845. Info(section, "cycle");
  10846. Size(section,0);
  10847. Info(section, "references");
  10848. Size(section,0);
  10849. Info(section, "nextMarked");
  10850. Address(section,0);
  10851. Info(section, "nextWatched");
  10852. Address(section,0);
  10853. END BasePointer;
  10854. PROCEDURE BaseObject (section: IntermediateCode.Section);
  10855. BEGIN
  10856. BasePointer(section);
  10857. Info(section, "action");
  10858. Address(section,0);
  10859. Info(section, "monitor");
  10860. Address(section,0);
  10861. END BaseObject;
  10862. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  10863. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  10864. pooledName: Basic.SegmentedName;
  10865. symbol: SyntaxTree.Symbol;
  10866. BEGIN
  10867. Global.GetModuleName(module.module,name);
  10868. Strings.Append(name,".@Module.@Descriptor");
  10869. Basic.ToSegmentedName(name, pooledName);
  10870. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10871. Symbol(section,descriptorSection,0,0);
  10872. Info(descriptorSection, "descriptor");
  10873. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10874. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  10875. Address(descriptorSection,0);
  10876. Global.GetModuleName(module.module,name);
  10877. Strings.Append(name,".@Trace");
  10878. Basic.ToSegmentedName(name, pooledName);
  10879. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10880. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  10881. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10882. END ModuleDescriptor;
  10883. PROCEDURE ModuleSection(): IntermediateCode.Section;
  10884. VAR name: ARRAY 128 OF CHAR;
  10885. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  10886. symbol: SyntaxTree.Symbol;
  10887. BEGIN
  10888. Global.GetModuleName(module.module,name);
  10889. Strings.Append(name,".@Module");
  10890. Basic.ToSegmentedName(name, pooledName);
  10891. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10892. moduleSection.SetExported(TRUE);
  10893. IF moduleSection.pc = 0 THEN
  10894. IF implementationVisitor.backend.cooperative THEN
  10895. Info(moduleSection, "descriptor");
  10896. ModuleDescriptor(moduleSection);
  10897. BaseObject(moduleSection);
  10898. implementationVisitor.CreateTraceModuleMethod(module.module);
  10899. ELSE
  10900. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  10901. Info(moduleSection, "HeapBlock");
  10902. Symbol(moduleSection,moduleSection,2,0);
  10903. Info(moduleSection, "TypeDescriptor");
  10904. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10905. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  10906. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  10907. END;
  10908. END;
  10909. RETURN moduleSection;
  10910. END ModuleSection;
  10911. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  10912. VAR
  10913. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  10914. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  10915. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  10916. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  10917. referenceSectionOffset : LONGINT;
  10918. BEGIN
  10919. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  10920. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  10921. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  10922. ImportsArray(importSection);
  10923. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  10924. CommandArray(commandsSection);
  10925. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  10926. ExceptionArray(exceptionSection);
  10927. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  10928. TypeInfoSection(typeInfoSection);
  10929. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  10930. References(referenceSection);
  10931. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  10932. IF ~implementationVisitor.backend.cooperative THEN
  10933. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  10934. ELSE
  10935. ptrTableSection := NIL;
  10936. END;
  10937. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  10938. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  10939. Array(emptyArraySection,temp,"");
  10940. moduleSection := ModuleSection();
  10941. Info(moduleSection, "nextRoot*: RootObject");
  10942. Address(moduleSection,0);
  10943. Info(moduleSection, "next*: Module");
  10944. Address(moduleSection,0);
  10945. Info(moduleSection, "name*: Name");
  10946. Name(moduleSection,moduleName);
  10947. Info(moduleSection, "init, published: BOOLEAN");
  10948. Boolean(moduleSection,FALSE);
  10949. Boolean(moduleSection,FALSE);
  10950. Info(moduleSection,"filler"); (*! introduce alignment! *)
  10951. Boolean(moduleSection,FALSE);
  10952. Boolean(moduleSection,FALSE);
  10953. Info(moduleSection, "refcnt*: LONGINT");
  10954. Longint(moduleSection,0);
  10955. Info(moduleSection, "sb*: ADDRESS");
  10956. Address(moduleSection,0);
  10957. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  10958. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10959. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  10960. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  10961. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  10962. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  10963. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  10964. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  10965. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  10966. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  10967. Info(moduleSection, "procTable*: ProcTable");
  10968. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  10969. Info(moduleSection, "ptrTable*: PtrTable");
  10970. IF ~implementationVisitor.backend.cooperative THEN
  10971. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  10972. ELSE
  10973. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10974. END;
  10975. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  10976. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10977. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10978. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10979. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  10980. Info(moduleSection, "export*: ExportDesc");
  10981. ExportDesc(moduleSection);
  10982. Info(moduleSection, "term*: TerminationHandler");
  10983. Address(moduleSection,0);
  10984. Info(moduleSection, "exTable*: ExceptionTable");
  10985. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  10986. Info(moduleSection, "noProcs*: LONGINT");
  10987. Longint(moduleSection,numberProcs);
  10988. Info(moduleSection, "firstProc*: ADDRESS");
  10989. Address(moduleSection,0);
  10990. Info(moduleSection, "maxPtrs*: LONGINT");
  10991. Longint(moduleSection,maxPointers);
  10992. Info(moduleSection, "crc*: LONGINT");
  10993. Longint(moduleSection, 0); (*! must be implemented *)
  10994. Info(moduleSection, "body*: ADDRESS");
  10995. Symbol(moduleSection, bodyProc, 0,0);
  10996. IF implementationVisitor.backend.cooperative THEN
  10997. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  10998. Info(moduleSection, "monitor.owner");
  10999. Address(moduleSection,0);
  11000. Info(moduleSection, "monitor.nestingLevel");
  11001. Address(moduleSection,0);
  11002. Info(moduleSection, "monitor.blockedQueue");
  11003. Address(moduleSection,0); Address(moduleSection,0);
  11004. Info(moduleSection, "monitor.waitingQueue");
  11005. Address(moduleSection,0); Address(moduleSection,0);
  11006. Info(moduleSection, "monitor.waitingSentinel");
  11007. Address(moduleSection,0);
  11008. END;
  11009. END Module;
  11010. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11011. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  11012. BEGIN
  11013. Array(source,pc,"");
  11014. Info(source, "pointer offsets array data");
  11015. IF scope IS SyntaxTree.RecordScope THEN
  11016. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11017. ELSIF scope IS SyntaxTree.CellScope THEN
  11018. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11019. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11020. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11021. WHILE variable # NIL DO
  11022. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11023. symbol := module.allSections.FindBySymbol(variable);
  11024. ASSERT(symbol # NIL);
  11025. Pointers(0,symbol, source,variable.type,numberPointers);
  11026. END;
  11027. variable := variable.nextVariable;
  11028. END;
  11029. END;
  11030. PatchArray(source,pc,numberPointers);
  11031. END PointerArray;
  11032. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11033. VAR
  11034. name: Basic.SegmentedName;
  11035. section: IntermediateCode.Section;
  11036. BEGIN
  11037. ASSERT(implementationVisitor.newObjectFile);
  11038. Global.GetSymbolSegmentedName(symbol,name);
  11039. Basic.AppendToSegmentedName(name,suffix);
  11040. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11041. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11042. Info(section, "HeapBlock");
  11043. Address(section,0); (* empty such that GC does not go on traversing *)
  11044. Info(section, suffix);
  11045. Address(section,0);
  11046. pc := section.pc;
  11047. RETURN section;
  11048. END SymbolSection;
  11049. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11050. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11051. BEGIN
  11052. ASSERT(implementationVisitor.newObjectFile);
  11053. IF ~ReflectionSupport OR simple THEN variable := NIL
  11054. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11055. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11056. IF type IS SyntaxTree.PointerType THEN
  11057. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11058. END;
  11059. IF type IS SyntaxTree.RecordType THEN
  11060. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11061. ELSIF type IS SyntaxTree.CellType THEN
  11062. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11063. END;
  11064. ELSIF symbol IS SyntaxTree.Procedure THEN
  11065. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11066. END;
  11067. Info(in, "variables");
  11068. IF variable # NIL THEN
  11069. section := SymbolSection(symbol, "@Variables",pc);
  11070. VariableArray(section, variable);
  11071. Symbol(in, section, pc, 0);
  11072. ELSE
  11073. Address(in, 0);
  11074. END;
  11075. END ReflectVariables;
  11076. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11077. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11078. BEGIN
  11079. ASSERT(implementationVisitor.newObjectFile);
  11080. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11081. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11082. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11083. IF type IS SyntaxTree.PointerType THEN
  11084. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11085. END;
  11086. IF type IS SyntaxTree.RecordType THEN
  11087. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11088. ELSIF type IS SyntaxTree.CellType THEN
  11089. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11090. END;
  11091. ELSIF symbol IS SyntaxTree.Procedure THEN
  11092. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11093. END;
  11094. Info(in, "procedures");
  11095. IF procedure # NIL THEN
  11096. section := SymbolSection(symbol, "@Procedures",pc);
  11097. ProcedureArray(section, procedure);
  11098. Symbol(in, section, pc, 0);
  11099. ELSE
  11100. Address(in, 0);
  11101. END;
  11102. END ReflectProcedures;
  11103. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11104. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11105. segmentedName: Basic.SegmentedName;
  11106. td: SyntaxTree.TypeDeclaration;
  11107. type: SyntaxTree.Type;
  11108. BEGIN
  11109. Array(source,pc,"Modules.FieldEntry");
  11110. Info(source, "FieldArray");
  11111. size :=0;
  11112. WHILE variable # NIL DO
  11113. Info(source,"name");
  11114. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11115. type := variable.type.resolved;
  11116. Info(source,"offset");
  11117. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11118. Info(source,"type class");
  11119. IF type IS SyntaxTree.PointerType THEN
  11120. Size(source, 1);
  11121. ELSIF type IS SyntaxTree.RecordType THEN
  11122. Size(source, 2);
  11123. ELSIF type IS SyntaxTree.NumberType THEN
  11124. Size(source, 3);
  11125. ELSE
  11126. Size(source, 0);
  11127. END;
  11128. Info(source, "type desc");
  11129. IF type IS SyntaxTree.RecordType THEN
  11130. td := type(SyntaxTree.RecordType).typeDeclaration;
  11131. Global.GetSymbolSegmentedName(td,segmentedName);
  11132. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11133. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11134. ELSE
  11135. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11136. END;
  11137. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11138. Symbol(source, tir, 0, offset);
  11139. ELSE
  11140. Address(source, 0);
  11141. END;
  11142. Info(source,"flags");
  11143. Set(source, {});
  11144. variable := variable.nextVariable;
  11145. INC(size);
  11146. END;
  11147. PatchArray(source,pc,size);
  11148. END VariableArray;
  11149. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11150. VAR pc: LONGINT; size: LONGINT;
  11151. segmentedName: Basic.SegmentedName;
  11152. BEGIN
  11153. Array(source,pc,"Modules.ProcedureEntry");
  11154. Info(source, "ProcedureArray");
  11155. size :=0;
  11156. WHILE procedure # NIL DO
  11157. Info(source,"name");
  11158. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11159. Global.GetSymbolSegmentedName(procedure, segmentedName);
  11160. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11161. (* size *)
  11162. Size(source, 0);
  11163. (* parameters *)
  11164. Address(source, 0);
  11165. (* variables *)
  11166. ReflectVariables(source, procedure);
  11167. ReflectProcedures(source, procedure);
  11168. (* return type entry *)
  11169. Address(source, 0);
  11170. Address(source, 0);
  11171. procedure := procedure.nextProcedure;
  11172. INC(size);
  11173. END;
  11174. PatchArray(source,pc,size);
  11175. END ProcedureArray;
  11176. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11177. VAR recordType: SyntaxTree.RecordType;
  11178. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11179. section: Sections.Section; cellType: SyntaxTree.CellType;
  11180. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11181. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11182. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11183. sectionName: Basic.SectionName;
  11184. CONST MPO=-40000000H;
  11185. BEGIN
  11186. (*
  11187. TypeDesc* = POINTER TO RECORD
  11188. descSize: LONGINT;
  11189. sentinel: LONGINT; (* = MPO-4 *)
  11190. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11191. flags*: SET;
  11192. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11193. name*: Name;
  11194. END;
  11195. *)
  11196. (* source := module.sections.FindByName(...) *)
  11197. Global.GetSymbolSegmentedName(td,name);
  11198. Basic.AppendToSegmentedName(name,"@Info");
  11199. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11200. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11201. Address(source,MPO-4);
  11202. Info(source, "type tag pointer");
  11203. Symbol( source, tag, offset, 0);
  11204. Info(source, "type flags");
  11205. flags := {};
  11206. IF isProtected THEN INCL(flags,31) END;
  11207. Set( source, flags);
  11208. Info(source, "pointer to module");
  11209. moduleSection := ModuleSection();
  11210. Symbol( source, moduleSection, moduleSection.pc,0);
  11211. Info(source, "type name");
  11212. i := 0;
  11213. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11214. (*
  11215. Global.GetSymbolSegmentedName(td,name);
  11216. Basic.SegmentedNameToString(name, sectionName);
  11217. *)
  11218. Name(source,sectionName);
  11219. source.SetReferenced(FALSE);
  11220. Global.GetSymbolSegmentedName(td,name);
  11221. Basic.AppendToSegmentedName(name,"@Fields");
  11222. ReflectVariables(source, td);
  11223. ReflectProcedures(source, td);
  11224. (*
  11225. fieldSection := VariableArray(
  11226. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11227. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11228. Info(fieldSection, "HeapBlock");
  11229. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11230. Info(fieldSection, "TypeDescriptor");
  11231. Address(fieldSection,0);
  11232. Info(source, "FieldArray ref");
  11233. Symbol(source, fieldSection, fieldSection.pc, 0);
  11234. FieldArray(fieldSection);
  11235. Global.GetSymbolSegmentedName(td,name);
  11236. Basic.AppendToSegmentedName(name,"@Procedures");
  11237. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11238. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11239. Info(fieldSection, "HeapBlock");
  11240. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11241. Info(fieldSection, "TypeDescriptor");
  11242. Address(fieldSection,0);
  11243. Info(source, "Procedure Array ref");
  11244. Symbol(source, fieldSection, fieldSection.pc, 0);
  11245. ProcedureArray(fieldSection);
  11246. *)
  11247. RETURN source;
  11248. END NewTypeDescriptorInfo;
  11249. PROCEDURE NewTypeDescriptor;
  11250. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11251. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11252. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11253. numberPointers: LONGINT; padding, i: LONGINT;
  11254. CONST MPO=-40000000H;
  11255. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11256. VAR i: LONGINT;
  11257. PROCEDURE Td(record: SyntaxTree.RecordType);
  11258. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11259. BEGIN
  11260. IF record # NIL THEN
  11261. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11262. baseTD := record.typeDeclaration;
  11263. Global.GetSymbolSegmentedName(baseTD,name);
  11264. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11265. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11266. ELSE
  11267. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11268. END;
  11269. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11270. Symbol(source, tir, 0, offset);
  11271. IF reverse THEN Td(record.GetBaseRecord()) END;
  11272. END;
  11273. END Td;
  11274. BEGIN
  11275. Info(source, "tag table");
  11276. baseRecord := recordType;
  11277. i := 0;
  11278. WHILE baseRecord # NIL DO
  11279. INC(i);
  11280. baseRecord := baseRecord.GetBaseRecord();
  11281. END;
  11282. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11283. IF ~reverse THEN Td(recordType) END;
  11284. WHILE i < size DO
  11285. Address(source,0);
  11286. INC(i);
  11287. END;
  11288. IF reverse THEN Td(recordType) END;
  11289. END TdTable;
  11290. PROCEDURE MethodTable(reverse: BOOLEAN);
  11291. VAR i,methods: LONGINT;
  11292. BEGIN
  11293. Info(source, "method table");
  11294. IF recordType # NIL THEN
  11295. methods := recordType.recordScope.numberMethods;
  11296. IF reverse THEN
  11297. FOR i := methods-1 TO 0 BY -1 DO
  11298. procedure := recordType.recordScope.FindMethod(i);
  11299. Global.GetSymbolSegmentedName(procedure, name);
  11300. NamedSymbol(source, name,procedure, 0,0);
  11301. END;
  11302. ELSE
  11303. FOR i := 0 TO methods-1 DO
  11304. procedure := recordType.recordScope.FindMethod(i);
  11305. Global.GetSymbolSegmentedName(procedure, name);
  11306. NamedSymbol(source, name,procedure, 0,0);
  11307. END;
  11308. END;
  11309. END;
  11310. END MethodTable;
  11311. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11312. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11313. BEGIN
  11314. Info(source, "method table");
  11315. baseRecord := recordType;
  11316. WHILE baseRecord.baseType # NIL DO
  11317. baseRecord := baseRecord.GetBaseRecord ();
  11318. END;
  11319. GetRecordTypeName (baseRecord, name);
  11320. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11321. IF name = stackFrame THEN
  11322. start := 0;
  11323. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11324. baseRecord := recordType;
  11325. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11326. baseRecord := baseRecord.GetBaseRecord ();
  11327. END;
  11328. IF baseRecord # NIL THEN
  11329. GetRecordTypeName (baseRecord, name);
  11330. IF pointer & ~baseRecord.isObject THEN
  11331. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11332. END;
  11333. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11334. ELSIF recordType.isObject THEN
  11335. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11336. ELSIF pointer THEN
  11337. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11338. ELSE
  11339. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11340. END;
  11341. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11342. Symbol(source, tir, 0, 0);
  11343. start := 0;
  11344. baseRecord := recordType;
  11345. WHILE (baseRecord # NIL) DO
  11346. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11347. baseRecord := baseRecord.GetBaseRecord ();
  11348. END;
  11349. ELSE
  11350. (* explicit trace method: *)
  11351. procedure := recordType.recordScope.FindMethod(0);
  11352. IF ~procedure.isFinalizer THEN
  11353. Global.GetSymbolSegmentedName(procedure, name);
  11354. NamedSymbol(source, name,procedure, 0,0);
  11355. END;
  11356. start := 1;
  11357. END;
  11358. IF (name # stackFrame) & recordType.isObject THEN
  11359. baseRecord := recordType;
  11360. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11361. baseRecord := baseRecord.GetBaseRecord ();
  11362. END;
  11363. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11364. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11365. ELSE
  11366. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11367. END;
  11368. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11369. Symbol(source, tir, 0, 0);
  11370. END;
  11371. methods := recordType.recordScope.numberMethods;
  11372. FOR i := start TO methods-1 DO
  11373. procedure := recordType.recordScope.FindMethod(i);
  11374. IF ~procedure.isFinalizer THEN
  11375. Global.GetSymbolSegmentedName(procedure, name);
  11376. NamedSymbol(source, name,procedure, 0,0);
  11377. END;
  11378. END;
  11379. END CooperativeMethodTable;
  11380. BEGIN
  11381. Global.GetSymbolSegmentedName(td,name);
  11382. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11383. source.SetExported(IsExported(td));
  11384. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11385. IF implementationVisitor.backend.cooperative THEN
  11386. base := NIL;
  11387. baseRecord := recordType.GetBaseRecord();
  11388. IF baseRecord # NIL THEN
  11389. baseTD := baseRecord.typeDeclaration;
  11390. END;
  11391. IF ~recordType.isObject THEN
  11392. Info(source, "parent");
  11393. IF baseRecord # NIL THEN
  11394. Global.GetSymbolSegmentedName(baseTD,name);
  11395. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11396. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11397. ELSE
  11398. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11399. END;
  11400. Symbol(source, tir, 0, 0);
  11401. ELSE
  11402. Address(source,0);
  11403. END;
  11404. Info(source, "record size");
  11405. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11406. source.SetReferenced(FALSE);
  11407. CooperativeMethodTable(FALSE);
  11408. base := source;
  11409. Global.GetSymbolSegmentedName(td,name);
  11410. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11411. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11412. source.SetExported(IsExported(td));
  11413. source.SetReferenced(FALSE);
  11414. END;
  11415. Info(source, "parent");
  11416. IF baseRecord # NIL THEN
  11417. Global.GetSymbolSegmentedName(baseTD,name);
  11418. sym := baseTD;
  11419. IF ~recordType.isObject THEN
  11420. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11421. sym := NIL;
  11422. END;
  11423. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11424. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11425. ELSE
  11426. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11427. END;
  11428. Symbol(source, tir, 0, 0);
  11429. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11430. Address(source,0);
  11431. ELSE
  11432. IF recordType.isObject THEN
  11433. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11434. ELSE
  11435. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11436. END;
  11437. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11438. Symbol(source, tir, 0, 0);
  11439. END;
  11440. Info(source, "base record descriptor");
  11441. Symbol(source, base, 0, 0);
  11442. CooperativeMethodTable(TRUE);
  11443. source.SetReferenced(FALSE);
  11444. IF recordType.hasPointers THEN
  11445. IF ~HasExplicitTraceMethod (recordType) THEN
  11446. implementationVisitor.CreateTraceMethod(recordType);
  11447. END;
  11448. implementationVisitor.CreateResetProcedure(recordType);
  11449. implementationVisitor.CreateAssignProcedure(recordType);
  11450. END;
  11451. ELSIF ~simple THEN
  11452. (*
  11453. MethodEnd = MPO
  11454. ---
  11455. methods (# methods)
  11456. ---
  11457. tags (16)
  11458. ---
  11459. TypeDesc = TypeInfoAdr
  11460. ---
  11461. td adr ---> rec size
  11462. ----
  11463. pointer offsets
  11464. ----
  11465. (padding)
  11466. -----
  11467. empty [2 addresses aligned]
  11468. empty
  11469. empty
  11470. numPtrs
  11471. ---
  11472. pointer offsets
  11473. ---
  11474. *)
  11475. Info(source, "MethodEnd = MPO");
  11476. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11477. source(IntermediateCode.Section).Emit(Data(-1,op));
  11478. MethodTable(TRUE);
  11479. TdTable(TypeTags, TRUE);
  11480. Info(source, "type descriptor info pointer");
  11481. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11482. IF (cellType # NIL) THEN
  11483. IF cellType.sizeInBits < 0 THEN
  11484. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11485. END;
  11486. Info(source, "cell size");
  11487. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11488. ELSE
  11489. Info(source, "record size");
  11490. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11491. END;
  11492. Info(source, "pointer offsets pointer");
  11493. padding := 1- source.pc MOD 2;
  11494. Symbol(source, source, source.pc+1+padding,0);
  11495. IF padding >0 THEN
  11496. Info(source, "padding");
  11497. FOR i := 1 TO padding DO Address(source,0) END;
  11498. END;
  11499. IF cellType # NIL THEN
  11500. PointerArray(source, cellType.cellScope, numberPointers);
  11501. ELSE
  11502. PointerArray(source, recordType.recordScope, numberPointers);
  11503. END;
  11504. ELSE
  11505. (*
  11506. simple:
  11507. td adr --> size
  11508. tag(1)
  11509. tag(2)
  11510. tag(3)
  11511. methods ->
  11512. *)
  11513. Info(source, "record size");
  11514. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11515. TdTable(TypeTags, FALSE);
  11516. MethodTable(FALSE);
  11517. source.SetReferenced(FALSE);
  11518. END;
  11519. END NewTypeDescriptor;
  11520. BEGIN
  11521. x := x.resolved;
  11522. IF (x IS SyntaxTree.PointerType) THEN
  11523. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11524. END;
  11525. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11526. recordType := x(SyntaxTree.RecordType);
  11527. td := x.typeDeclaration;
  11528. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11529. ASSERT(td # NIL);
  11530. section := module.allSections.FindBySymbol(td); (* TODO *)
  11531. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11532. IF implementationVisitor.newObjectFile THEN
  11533. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11534. NewTypeDescriptor
  11535. END;
  11536. ELSE
  11537. (* data section in intermediate code *)
  11538. Global.GetSymbolSegmentedName(td,name);
  11539. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11540. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11541. tir.Emit(Data(-1,op));
  11542. END;
  11543. END;
  11544. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11545. cellType := x(SyntaxTree.CellType);
  11546. td := x.typeDeclaration;
  11547. section := module.allSections.FindBySymbol(td); (* TODO *)
  11548. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11549. IF implementationVisitor.newObjectFile THEN
  11550. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11551. NewTypeDescriptor
  11552. END;
  11553. END;
  11554. END;
  11555. END
  11556. END CheckTypeDeclaration
  11557. END MetaDataGenerator;
  11558. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11559. VAR
  11560. trace-: BOOLEAN;
  11561. traceString-: SyntaxTree.IdentifierString;
  11562. traceModuleName-: SyntaxTree.IdentifierString;
  11563. newObjectFile-: BOOLEAN;
  11564. profile-: BOOLEAN;
  11565. noRuntimeChecks: BOOLEAN;
  11566. simpleMetaData-: BOOLEAN;
  11567. noAsserts: BOOLEAN;
  11568. optimize-: BOOLEAN;
  11569. cooperative-: BOOLEAN;
  11570. preregisterStatic-: BOOLEAN;
  11571. dump-: Basic.Writer;
  11572. cellsAreObjects: BOOLEAN;
  11573. PROCEDURE &InitIntermediateBackend*;
  11574. BEGIN
  11575. simpleMetaData := FALSE;
  11576. newObjectFile := FALSE;
  11577. InitBackend;
  11578. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11579. SetTraceModuleName(DefaultTraceModuleName);
  11580. END InitIntermediateBackend;
  11581. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11582. VAR
  11583. declarationVisitor: DeclarationVisitor;
  11584. implementationVisitor: ImplementationVisitor;
  11585. module: Sections.Module;
  11586. name, platformName: SyntaxTree.IdentifierString;
  11587. meta: MetaDataGenerator;
  11588. BEGIN
  11589. ResetError;
  11590. Global.GetSymbolName(x,name);
  11591. NEW(module,x,system); (* backend structures *)
  11592. Global.GetModuleName(x, name);
  11593. module.SetModuleName(name);
  11594. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11595. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11596. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11597. declarationVisitor.Module(x,module);
  11598. IF newObjectFile & ~meta.simple THEN
  11599. meta.Module(implementationVisitor.moduleBodySection);
  11600. END;
  11601. GetDescription(platformName);
  11602. module.SetPlatformName(platformName);
  11603. RETURN module
  11604. END GenerateIntermediate;
  11605. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11606. BEGIN RETURN TRUE
  11607. END SupportedImmediate;
  11608. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11609. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11610. END ProcessSyntaxTreeModule;
  11611. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11612. VAR
  11613. result: Sections.Module;
  11614. traceName: Basic.MessageString;
  11615. BEGIN
  11616. ASSERT(intermediateCodeModule IS Sections.Module);
  11617. result := intermediateCodeModule(Sections.Module);
  11618. IF trace THEN
  11619. traceName := "intermediate code trace: ";
  11620. Strings.Append(traceName,traceString);
  11621. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11622. IF (traceString="") OR (traceString="*") THEN
  11623. result.Dump(dump);
  11624. dump.Update
  11625. ELSE
  11626. Sections.DumpFiltered(dump, result, traceString);
  11627. END
  11628. END;
  11629. RETURN result
  11630. END ProcessIntermediateCodeModule;
  11631. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11632. BEGIN instructionSet := "Intermediate";
  11633. END GetDescription;
  11634. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11635. BEGIN
  11636. SELF.newObjectFile := newObjectFile;
  11637. SELF.simpleMetaData := simpleMetaData;
  11638. END SetNewObjectFile;
  11639. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11640. BEGIN COPY(name, traceModuleName)
  11641. END SetTraceModuleName;
  11642. PROCEDURE DefineOptions(options: Options.Options);
  11643. BEGIN
  11644. DefineOptions^(options);
  11645. options.Add(0X,"trace",Options.String);
  11646. options.Add(0X,"runtime",Options.String);
  11647. options.Add(0X,"newObjectFile",Options.Flag);
  11648. options.Add(0X,"traceModule",Options.String);
  11649. options.Add(0X,"profile",Options.Flag);
  11650. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11651. options.Add(0X,"noAsserts",Options.Flag);
  11652. options.Add(0X,"metaData",Options.String);
  11653. options.Add('o',"optimize", Options.Flag);
  11654. options.Add(0X,"preregisterStatic", Options.Flag);
  11655. options.Add(0X,"cellsAreObjects", Options.Flag);
  11656. END DefineOptions;
  11657. PROCEDURE GetOptions(options: Options.Options);
  11658. VAR name,string: SyntaxTree.IdentifierString;
  11659. BEGIN
  11660. GetOptions^(options);
  11661. trace := options.GetString("trace",traceString);
  11662. profile := options.GetFlag("profile");
  11663. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11664. noAsserts := options.GetFlag("noAsserts");
  11665. cooperative := options.GetFlag("cooperative");
  11666. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11667. IF cooperative THEN
  11668. SetRuntimeModuleName("CPU") END
  11669. END;
  11670. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11671. simpleMetaData := TRUE
  11672. END;
  11673. IF options.GetString("metaData",string) THEN
  11674. IF string = "simple" THEN simpleMetaData := TRUE
  11675. ELSIF string ="full" THEN simpleMetaData := FALSE
  11676. END;
  11677. END;
  11678. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11679. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11680. optimize := options.GetFlag("optimize");
  11681. preregisterStatic := options.GetFlag("preregisterStatic");
  11682. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11683. END GetOptions;
  11684. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11685. BEGIN RETURN SymbolFileFormat.Get()
  11686. END DefaultSymbolFileFormat;
  11687. END IntermediateBackend;
  11688. (* ----------------------------------- register allocation ------------------------------------- *)
  11689. (* register mapping scheme
  11690. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11691. spill offset
  11692. part(n) --> ticket <--> physical register
  11693. spill offset
  11694. *)
  11695. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11696. emptyOperand: IntermediateCode.Operand;
  11697. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11698. statCoopResetVariables: LONGINT;
  11699. statCoopModifyAssignments: LONGINT;
  11700. modifyAssignmentsPC : LONGINT;
  11701. statCoopNilCheck: LONGINT;
  11702. statCoopSwitch: LONGINT;
  11703. statCoopAssignProcedure: LONGINT;
  11704. statCoopTraceMethod: LONGINT;
  11705. statCoopResetProcedure: LONGINT;
  11706. statCoopTraceModule: LONGINT;
  11707. PROCEDURE ResetStatistics*;
  11708. BEGIN
  11709. statCoopResetVariables := 0;
  11710. statCoopModifyAssignments := 0;
  11711. statCoopNilCheck:= 0;
  11712. statCoopSwitch:= 0;
  11713. statCoopAssignProcedure:= 0;
  11714. statCoopTraceMethod:= 0;
  11715. statCoopResetProcedure:= 0;
  11716. statCoopTraceModule:= 0;
  11717. END ResetStatistics;
  11718. PROCEDURE Statistics*;
  11719. BEGIN
  11720. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11721. TRACE(statCoopNilCheck, statCoopSwitch);
  11722. TRACE(statCoopAssignProcedure,
  11723. statCoopTraceMethod,
  11724. statCoopResetProcedure,
  11725. statCoopTraceModule)
  11726. END Statistics;
  11727. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11728. VAR h: LONGINT;
  11729. BEGIN
  11730. WHILE b # 0 DO
  11731. h := a MOD b;
  11732. a := b;
  11733. b := h;
  11734. END;
  11735. RETURN a
  11736. END GCD;
  11737. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11738. BEGIN
  11739. RETURN a*b DIV GCD(a,b)
  11740. END SCM;
  11741. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11742. BEGIN
  11743. (*TRACE(a,b);*)
  11744. IF a = 0 THEN RETURN b
  11745. ELSIF b = 0 THEN RETURN a
  11746. ELSE RETURN SCM(a,b)
  11747. END;
  11748. END CommonAlignment;
  11749. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11750. BEGIN
  11751. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11752. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11753. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11754. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11755. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11756. END
  11757. END PassBySingleReference;
  11758. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11759. BEGIN
  11760. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11761. END PassInRegister;
  11762. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11763. VAR new: RegisterEntry;
  11764. BEGIN
  11765. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11766. IF queue = NIL THEN
  11767. queue := new
  11768. ELSE
  11769. new.next := queue;
  11770. IF queue#NIL THEN queue.prev := new END;
  11771. queue := new
  11772. END;
  11773. END AddRegisterEntry;
  11774. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11775. VAR this: RegisterEntry;
  11776. BEGIN
  11777. this := queue;
  11778. WHILE (this # NIL) & (this.register # register) DO
  11779. this := this.next;
  11780. END;
  11781. IF this = NIL THEN
  11782. RETURN FALSE
  11783. END;
  11784. ASSERT(this # NIL);
  11785. IF this = queue THEN queue := queue.next END;
  11786. IF this.prev # NIL THEN this.prev.next := this.next END;
  11787. IF this.next # NIL THEN this.next.prev := this.prev END;
  11788. RETURN TRUE
  11789. END RemoveRegisterEntry;
  11790. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11791. BEGIN ASSERT(cond);
  11792. END Assert;
  11793. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11794. BEGIN
  11795. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11796. END ReusableRegister;
  11797. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11798. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11799. BEGIN
  11800. procedure := moduleScope.bodyProcedure;
  11801. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11802. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11803. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11804. procedure.SetScope(moduleScope);
  11805. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11806. procedure.SetAccess(SyntaxTree.Hidden);
  11807. moduleScope.SetBodyProcedure(procedure);
  11808. moduleScope.AddProcedure(procedure);
  11809. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11810. END;
  11811. END EnsureBodyProcedure;
  11812. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11813. VAR import: SyntaxTree.Import;
  11814. selfName: SyntaxTree.IdentifierString;
  11815. module: SyntaxTree.Module;
  11816. BEGIN
  11817. scope.ownerModule.GetName(selfName);
  11818. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11819. module := scope.ownerModule
  11820. ELSE
  11821. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11822. IF import = NIL THEN
  11823. RETURN NIL
  11824. ELSIF import.module = NIL THEN
  11825. RETURN NIL
  11826. ELSE module := import.module
  11827. END;
  11828. END;
  11829. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11830. END GetSymbol;
  11831. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11832. BEGIN
  11833. op.mode := mode;
  11834. IntermediateCode.InitOperand(op.op);
  11835. IntermediateCode.InitOperand(op.tag);
  11836. IntermediateCode.InitOperand(op.extra);
  11837. op.dimOffset := 0;
  11838. END InitOperand;
  11839. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11840. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11841. BEGIN RETURN IntermediateCode.GetType(system, type)
  11842. END GetType;
  11843. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11844. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11845. BEGIN
  11846. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  11847. (*
  11848. UniqueId(name,module,name,adr);
  11849. *)
  11850. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  11851. constant.SetValue(value);
  11852. module.moduleScope.AddConstant(constant);
  11853. constant.SetScope(module.moduleScope);
  11854. RETURN constant
  11855. END BuildConstant;
  11856. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11857. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  11858. BEGIN
  11859. variable := scope.firstVariable;
  11860. WHILE variable # NIL DO
  11861. IF variable.NeedsTrace() THEN
  11862. RETURN TRUE;
  11863. END;
  11864. variable := variable.nextVariable;
  11865. END;
  11866. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11867. WHILE parameter # NIL DO
  11868. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11869. RETURN TRUE;
  11870. END;
  11871. parameter := parameter.nextParameter;
  11872. END;
  11873. RETURN FALSE;
  11874. END HasPointers;
  11875. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  11876. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  11877. END IsVariableParameter;
  11878. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11879. VAR parameter: SyntaxTree.Parameter;
  11880. BEGIN
  11881. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11882. WHILE parameter # NIL DO
  11883. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  11884. IF parameter.movable THEN RETURN TRUE END;
  11885. parameter := parameter.nextParameter;
  11886. END;
  11887. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  11888. END HasVariableParameters;
  11889. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  11890. BEGIN
  11891. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  11892. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  11893. END HasExplicitTraceMethod;
  11894. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  11895. BEGIN
  11896. IF expression.resolved # NIL THEN expression := expression.resolved END;
  11897. IF (expression IS SyntaxTree.IntegerValue) THEN
  11898. val := expression(SyntaxTree.IntegerValue).value;
  11899. RETURN TRUE
  11900. ELSE
  11901. RETURN FALSE
  11902. END;
  11903. END IsIntegerConstant;
  11904. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  11905. BEGIN
  11906. IF val <= 0 THEN RETURN FALSE END;
  11907. exp := 0;
  11908. WHILE ~ODD(val) DO
  11909. val := val DIV 2;
  11910. INC(exp)
  11911. END;
  11912. RETURN val = 1
  11913. END PowerOf2;
  11914. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  11915. VAR procedure: SyntaxTree.Procedure;
  11916. BEGIN
  11917. procedure := record.recordScope.constructor;
  11918. IF procedure = NIL THEN
  11919. record := record.GetBaseRecord();
  11920. IF record # NIL THEN
  11921. procedure := GetConstructor(record)
  11922. END;
  11923. END;
  11924. RETURN procedure;
  11925. END GetConstructor;
  11926. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  11927. BEGIN
  11928. value := SHORT(op.intValue);
  11929. RETURN op.mode = IntermediateCode.ModeImmediate;
  11930. END IsIntegerImmediate;
  11931. (** whether a type strictily is a pointer to record or object type
  11932. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  11933. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  11934. BEGIN
  11935. IF type = NIL THEN
  11936. RETURN FALSE
  11937. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  11938. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  11939. ELSE
  11940. RETURN FALSE
  11941. END
  11942. END IsStrictlyPointerToRecord;
  11943. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  11944. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  11945. END IsUnsafePointer;
  11946. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  11947. BEGIN type := type.resolved;
  11948. IF type IS SyntaxTree.PointerType THEN
  11949. type := type(SyntaxTree.PointerType).pointerBase;
  11950. type := type.resolved;
  11951. IF type IS SyntaxTree.RecordType THEN
  11952. recordType := type(SyntaxTree.RecordType);
  11953. RETURN TRUE
  11954. ELSE
  11955. RETURN FALSE
  11956. END
  11957. ELSIF type IS SyntaxTree.RecordType THEN
  11958. recordType := type(SyntaxTree.RecordType);
  11959. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  11960. ELSIF type IS SyntaxTree.ObjectType THEN
  11961. RETURN TRUE
  11962. ELSIF type IS SyntaxTree.AnyType THEN
  11963. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  11964. ELSE
  11965. RETURN FALSE
  11966. END;
  11967. END IsPointerToRecord;
  11968. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  11969. BEGIN
  11970. type := type.resolved;
  11971. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  11972. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  11973. END IsArrayOfSystemByte;
  11974. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  11975. BEGIN
  11976. IF type = NIL THEN RETURN FALSE END;
  11977. type := type.resolved;
  11978. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  11979. END IsOpenArray;
  11980. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  11981. BEGIN
  11982. IF type = NIL THEN RETURN FALSE END;
  11983. type := type.resolved;
  11984. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  11985. END IsSemiDynamicArray;
  11986. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  11987. BEGIN
  11988. IF type = NIL THEN RETURN FALSE END;
  11989. type := type.resolved;
  11990. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  11991. END IsStaticArray;
  11992. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  11993. VAR size: LONGINT;
  11994. BEGIN
  11995. size := 1;
  11996. WHILE (IsStaticArray(type)) DO
  11997. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  11998. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11999. END;
  12000. RETURN size;
  12001. END StaticArrayNumElements;
  12002. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12003. BEGIN
  12004. WHILE (IsStaticArray(type)) DO
  12005. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12006. END;
  12007. RETURN type;
  12008. END StaticArrayBaseType;
  12009. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12010. BEGIN
  12011. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12012. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12013. END;
  12014. RETURN type;
  12015. END ArrayBaseType;
  12016. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12017. BEGIN
  12018. IF type = NIL THEN RETURN FALSE END;
  12019. type := type.resolved;
  12020. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12021. END IsDelegate;
  12022. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12023. VAR i: LONGINT;
  12024. BEGIN
  12025. i := 0; type := type.resolved;
  12026. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12027. INC(i);
  12028. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12029. END;
  12030. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12031. INC(i);
  12032. type := type(SyntaxTree.MathArrayType).arrayBase;
  12033. IF type # NIL THEN type := type.resolved END;
  12034. END;
  12035. RETURN i
  12036. END DynamicDim;
  12037. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12038. BEGIN
  12039. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12040. type := type(SyntaxTree.ArrayType).arrayBase;
  12041. END;
  12042. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12043. type := type(SyntaxTree.MathArrayType).arrayBase;
  12044. END;
  12045. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12046. END StaticSize;
  12047. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12048. BEGIN
  12049. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12050. END IsImmediate;
  12051. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12052. BEGIN
  12053. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12054. END IsAddress;
  12055. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12056. BEGIN
  12057. RETURN (x.mode = IntermediateCode.ModeRegister);
  12058. END IsRegister;
  12059. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12060. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12061. BEGIN
  12062. typeDeclaration := recordType.typeDeclaration;
  12063. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12064. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12065. END GetRecordTypeName;
  12066. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12067. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12068. BEGIN
  12069. parSize := 0;
  12070. IF StructuredReturnType(procedureType) THEN
  12071. parameter := procedureType.returnParameter;
  12072. INC(parSize,system.SizeOfParameter(parameter));
  12073. parSize := parSize + (-parSize) MOD system.addressSize;
  12074. END;
  12075. parameter :=procedureType.lastParameter;
  12076. WHILE (parameter # NIL) DO
  12077. INC(parSize,system.SizeOfParameter(parameter));
  12078. parSize := parSize + (-parSize) MOD system.addressSize;
  12079. parameter := parameter.prevParameter;
  12080. END;
  12081. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12082. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12083. RETURN ToMemoryUnits(system,parSize)
  12084. END ParametersSize;
  12085. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12086. BEGIN
  12087. IF type = NIL THEN RETURN FALSE
  12088. ELSE
  12089. type := type.resolved;
  12090. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12091. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12092. END
  12093. END ReturnedAsParameter;
  12094. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12095. BEGIN
  12096. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12097. END StructuredReturnType;
  12098. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12099. BEGIN
  12100. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12101. END IsNested;
  12102. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12103. BEGIN
  12104. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12105. scope := scope.outerScope;
  12106. END;
  12107. RETURN scope # NIL;
  12108. END InCellScope;
  12109. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12110. BEGIN
  12111. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12112. RETURN 0
  12113. ELSE
  12114. *)
  12115. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12116. (*END;*)
  12117. END ProcedureParametersSize;
  12118. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12119. VAR dataUnit: LONGINT;
  12120. BEGIN dataUnit := system.dataUnit;
  12121. ASSERT(size MOD system.dataUnit = 0);
  12122. RETURN size DIV system.dataUnit
  12123. END ToMemoryUnits;
  12124. PROCEDURE Get*(): Backend.Backend;
  12125. VAR backend: IntermediateBackend;
  12126. BEGIN NEW(backend); RETURN backend
  12127. END Get;
  12128. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12129. VAR instruction: IntermediateCode.Instruction;
  12130. BEGIN
  12131. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12132. RETURN instruction
  12133. END Nop;
  12134. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12135. VAR instruction: IntermediateCode.Instruction;
  12136. BEGIN
  12137. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12138. RETURN instruction
  12139. END Mov;
  12140. (* like Mov but ensures that no new register will be allocated for dest *)
  12141. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12142. VAR instruction: IntermediateCode.Instruction;
  12143. BEGIN
  12144. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12145. RETURN instruction
  12146. END MovReplace;
  12147. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12148. VAR instruction: IntermediateCode.Instruction;
  12149. BEGIN
  12150. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12151. RETURN instruction
  12152. END Conv;
  12153. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12154. VAR instruction: IntermediateCode.Instruction;
  12155. BEGIN
  12156. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12157. RETURN instruction
  12158. END Call;
  12159. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12160. VAR op1, op2: IntermediateCode.Operand;
  12161. VAR instruction: IntermediateCode.Instruction;
  12162. BEGIN
  12163. IntermediateCode.InitNumber(op1,pcOffset);
  12164. IntermediateCode.InitNumber(op2,callingConvention);
  12165. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12166. RETURN instruction
  12167. END Exit;
  12168. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12169. VAR instruction: IntermediateCode.Instruction;
  12170. BEGIN
  12171. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12172. RETURN instruction
  12173. END Return;
  12174. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12175. VAR instruction: IntermediateCode.Instruction;
  12176. BEGIN
  12177. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12178. RETURN instruction
  12179. END Result;
  12180. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12181. VAR op1: IntermediateCode.Operand;
  12182. VAR instruction: IntermediateCode.Instruction;
  12183. BEGIN
  12184. IntermediateCode.InitNumber(op1,nr);
  12185. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12186. RETURN instruction
  12187. END Trap;
  12188. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12189. VAR instruction: IntermediateCode.Instruction;
  12190. BEGIN
  12191. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12192. RETURN instruction
  12193. END Br;
  12194. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12195. VAR instruction: IntermediateCode.Instruction;
  12196. BEGIN
  12197. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12198. RETURN instruction
  12199. END Breq;
  12200. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12201. VAR instruction: IntermediateCode.Instruction;
  12202. BEGIN
  12203. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12204. RETURN instruction
  12205. END Brne;
  12206. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12207. VAR instruction: IntermediateCode.Instruction;
  12208. BEGIN
  12209. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12210. RETURN instruction
  12211. END Brge;
  12212. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12213. VAR instruction: IntermediateCode.Instruction;
  12214. BEGIN
  12215. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12216. RETURN instruction
  12217. END Brlt;
  12218. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12219. VAR instruction: IntermediateCode.Instruction;
  12220. BEGIN
  12221. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12222. RETURN instruction
  12223. END Pop;
  12224. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12225. VAR instruction: IntermediateCode.Instruction;
  12226. BEGIN
  12227. ASSERT(op.mode # IntermediateCode.Undefined);
  12228. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12229. RETURN instruction
  12230. END Push;
  12231. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12232. VAR instruction: IntermediateCode.Instruction;
  12233. BEGIN
  12234. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12235. RETURN instruction
  12236. END Neg;
  12237. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12238. VAR instruction: IntermediateCode.Instruction;
  12239. BEGIN
  12240. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12241. RETURN instruction
  12242. END Not;
  12243. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12244. VAR instruction: IntermediateCode.Instruction;
  12245. BEGIN
  12246. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12247. RETURN instruction
  12248. END Abs;
  12249. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12250. VAR instruction: IntermediateCode.Instruction;
  12251. BEGIN
  12252. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12253. RETURN instruction
  12254. END Mul;
  12255. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12256. VAR instruction: IntermediateCode.Instruction;
  12257. BEGIN
  12258. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12259. RETURN instruction
  12260. END Div;
  12261. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12262. VAR instruction: IntermediateCode.Instruction;
  12263. BEGIN
  12264. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12265. RETURN instruction
  12266. END Mod;
  12267. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12268. VAR instruction: IntermediateCode.Instruction;
  12269. BEGIN
  12270. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12271. RETURN instruction
  12272. END Sub;
  12273. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12274. VAR instruction: IntermediateCode.Instruction;
  12275. BEGIN
  12276. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12277. RETURN instruction
  12278. END Add;
  12279. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12280. VAR instruction: IntermediateCode.Instruction;
  12281. BEGIN
  12282. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12283. RETURN instruction
  12284. END And;
  12285. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12286. VAR instruction: IntermediateCode.Instruction;
  12287. BEGIN
  12288. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12289. RETURN instruction
  12290. END Or;
  12291. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12292. VAR instruction: IntermediateCode.Instruction;
  12293. BEGIN
  12294. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12295. RETURN instruction
  12296. END Xor;
  12297. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12298. VAR instruction: IntermediateCode.Instruction;
  12299. BEGIN
  12300. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12301. RETURN instruction
  12302. END Shl;
  12303. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12304. VAR instruction: IntermediateCode.Instruction;
  12305. BEGIN
  12306. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12307. RETURN instruction
  12308. END Shr;
  12309. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12310. VAR instruction: IntermediateCode.Instruction;
  12311. BEGIN
  12312. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12313. RETURN instruction
  12314. END Rol;
  12315. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12316. VAR instruction: IntermediateCode.Instruction;
  12317. BEGIN
  12318. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12319. RETURN instruction
  12320. END Ror;
  12321. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12322. VAR instruction: IntermediateCode.Instruction;
  12323. BEGIN
  12324. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12325. RETURN instruction
  12326. END Cas;
  12327. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12328. VAR instruction: IntermediateCode.Instruction;
  12329. BEGIN
  12330. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12331. RETURN instruction
  12332. END Copy;
  12333. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12334. VAR instruction: IntermediateCode.Instruction;
  12335. BEGIN
  12336. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12337. RETURN instruction
  12338. END Fill;
  12339. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12340. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12341. BEGIN
  12342. string := IntermediateCode.String(s);
  12343. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12344. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12345. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12346. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12347. RETURN instruction
  12348. END Asm;
  12349. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12350. VAR instruction: IntermediateCode.Instruction;
  12351. BEGIN
  12352. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12353. RETURN instruction
  12354. END Data;
  12355. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12356. VAR instruction: IntermediateCode.Instruction;
  12357. BEGIN
  12358. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12359. IntermediateCode.SetSubType(instruction, subtype);
  12360. RETURN instruction
  12361. END SpecialInstruction;
  12362. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12363. VAR op1: IntermediateCode.Operand;
  12364. VAR instruction: IntermediateCode.Instruction;
  12365. BEGIN
  12366. (*! generate a warning if size exceeds a certain limit *)
  12367. (*
  12368. ASSERT(bytes < 1000000); (* sanity check *)
  12369. *)
  12370. ASSERT(0 <= units); (* sanity check *)
  12371. IntermediateCode.InitNumber(op1,units);
  12372. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12373. RETURN instruction
  12374. END Reserve;
  12375. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12376. VAR op1: IntermediateCode.Operand;
  12377. VAR instruction: IntermediateCode.Instruction;
  12378. BEGIN
  12379. IntermediateCode.InitNumber(op1,position);
  12380. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12381. RETURN instruction
  12382. END LabelInstruction;
  12383. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12384. VAR pc: LONGINT;
  12385. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12386. BEGIN
  12387. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12388. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12389. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12390. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12391. IF instr.op1.type.form = IntermediateCode.Float THEN
  12392. RETURN instr.op1.floatValue = op.floatValue
  12393. ELSE
  12394. RETURN instr.op1.intValue = op.intValue
  12395. END;
  12396. END ProvidesValue;
  12397. BEGIN
  12398. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12399. pc := 0;
  12400. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12401. INC(pc);
  12402. END;
  12403. IF pc = data.pc THEN
  12404. data.Emit(Data(-1,vop));
  12405. END;
  12406. RETURN pc
  12407. END EnterImmediate;
  12408. PROCEDURE Init;
  12409. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12410. BEGIN
  12411. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12412. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12413. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12414. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12415. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12416. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12417. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12418. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12419. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12420. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12421. IntermediateCode.InitOperand(emptyOperand);
  12422. FOR i := 0 TO NumberSystemCalls-1 DO
  12423. name := "@SystemCall";
  12424. Basic.AppendNumber(name,i);
  12425. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12426. END;
  12427. END Init;
  12428. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12429. BEGIN
  12430. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12431. END IsExported;
  12432. BEGIN
  12433. Init;
  12434. END FoxIntermediateBackend.
  12435. Compiler.Compile FoxIntermediateBackend.Mod ~