FoxIntermediateBackend.Mod 512 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149
  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, ActiveCells := FoxActiveCells;
  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. TYPE
  78. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  79. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  80. Operand = RECORD
  81. mode: SHORTINT;
  82. op: IntermediateCode.Operand;
  83. tag: IntermediateCode.Operand;
  84. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  85. dimOffset: LONGINT;
  86. END;
  87. Fixup= POINTER TO RECORD
  88. pc: LONGINT;
  89. nextFixup: Fixup;
  90. END;
  91. WriteBackCall = POINTER TO RECORD
  92. call: SyntaxTree.ProcedureCallDesignator;
  93. next: WriteBackCall;
  94. END;
  95. Label= OBJECT
  96. VAR
  97. fixups: Fixup;
  98. section: IntermediateCode.Section;
  99. pc: LONGINT;
  100. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  101. BEGIN
  102. SELF.section := section; pc := -1;
  103. END InitLabel;
  104. PROCEDURE Resolve(pc: LONGINT);
  105. VAR at: LONGINT;
  106. BEGIN
  107. SELF.pc := pc;
  108. WHILE(fixups # NIL) DO
  109. at := fixups.pc;
  110. section.PatchAddress(at,pc);
  111. fixups := fixups.nextFixup;
  112. END;
  113. END Resolve;
  114. PROCEDURE AddFixup(at: LONGINT);
  115. VAR fixup: Fixup;
  116. BEGIN
  117. ASSERT(pc=-1);
  118. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  119. END AddFixup;
  120. END Label;
  121. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  122. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  123. VAR
  124. backend: IntermediateBackend;
  125. implementationVisitor: ImplementationVisitor;
  126. meta: MetaDataGenerator;
  127. system: Global.System;
  128. currentScope: SyntaxTree.Scope;
  129. module: Sections.Module;
  130. moduleSelf: SyntaxTree.Variable;
  131. dump: BOOLEAN;
  132. forceModuleBody: BOOLEAN;
  133. addressType: IntermediateCode.Type;
  134. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  135. BEGIN
  136. currentScope := NIL; module := NIL; moduleSelf := NIL;
  137. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  138. SELF.dump := dump;
  139. SELF.backend := backend;
  140. SELF.forceModuleBody := forceModuleBody;
  141. addressType := IntermediateCode.GetType(system,system.addressType)
  142. END Init;
  143. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  144. BEGIN
  145. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  146. END Error;
  147. PROCEDURE Type(x: SyntaxTree.Type);
  148. BEGIN
  149. x.Accept(SELF);
  150. END Type;
  151. (** types **)
  152. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  153. BEGIN (* no code emission *) END VisitBasicType;
  154. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  155. BEGIN (* no code emission *) END VisitCharacterType;
  156. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  157. BEGIN (* no code emission *) END VisitIntegerType;
  158. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  159. BEGIN (* no code emission *) END VisitFloatType;
  160. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  161. BEGIN (* no code emission *) END VisitComplexType;
  162. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  163. VAR type: SyntaxTree.Type;
  164. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  165. type := x.resolved;
  166. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  167. meta.CheckTypeDeclaration(type);
  168. END;
  169. END VisitQualifiedType;
  170. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  171. BEGIN (* no code emission *) END VisitStringType;
  172. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  173. BEGIN (* no code emission *)
  174. END VisitArrayRangeType;
  175. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  176. BEGIN (* no code emission *) END VisitArrayType;
  177. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  178. BEGIN
  179. meta.CheckTypeDeclaration(x);
  180. END VisitMathArrayType;
  181. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  182. BEGIN
  183. meta.CheckTypeDeclaration(x);
  184. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  185. END VisitPointerType;
  186. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  187. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  188. BEGIN (* no code emission *)
  189. meta.CheckTypeDeclaration(x);
  190. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  191. IF x.pointerType.typeDeclaration # NIL THEN
  192. td := x.pointerType.typeDeclaration
  193. ELSE
  194. td := x.typeDeclaration
  195. END;
  196. Global.GetSymbolName(td,name);
  197. (* code section for object *)
  198. END;
  199. Scope(x.recordScope);
  200. END VisitRecordType;
  201. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  202. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  203. BEGIN
  204. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  205. WHILE (this # NIL) & (this.identifier# id) DO
  206. this := this.nextModifier;
  207. END;
  208. RETURN this # NIL
  209. END HasFlag;
  210. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  211. VAR name:Basic.SegmentedName; td: SyntaxTree.TypeDeclaration; type: SyntaxTree.Type; len,port,adr: LONGINT;
  212. parameter: SyntaxTree.Parameter; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  213. PROCEDURE CreatePortArray(type: SyntaxTree.Type; len: LONGINT);
  214. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  215. BEGIN
  216. FOR i := 0 TO len-1 DO
  217. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  218. CreatePortArray(baseType, len2);
  219. ELSE
  220. adr := backend.activeCellsSpecification.GetPortAddress(port);
  221. IntermediateCode.InitImmediate(op,addressType,adr);
  222. symbol.Emit(Data(-1,op));
  223. INC(port);
  224. END;
  225. END;
  226. END CreatePortArray;
  227. BEGIN
  228. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  229. IF (x.cellScope.ownerModule = module.module) THEN
  230. td := x.typeDeclaration;
  231. Global.GetSymbolSegmentedName(td,name);
  232. (* code section for object *)
  233. END;
  234. port := 0;
  235. parameter := x.firstParameter;
  236. WHILE parameter # NIL DO
  237. type := parameter.type.resolved;
  238. IF type IS SyntaxTree.PortType THEN
  239. len := 1;
  240. INC(port);
  241. ELSIF SemanticChecker.IsStaticArray(type,type,len) OR SemanticChecker.IsDynamicArray(type, type) THEN
  242. IF backend.cellsAreObjects THEN
  243. IF IsStaticArray(parameter.type.resolved) THEN
  244. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  245. END;
  246. (* do nothing *)
  247. ELSE
  248. Global.GetSymbolSegmentedName(parameter,name);
  249. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,parameter,dump);
  250. CreatePortArray(type, len);
  251. (*
  252. WHILE len > 0 DO
  253. adr := backend.activeCellsSpecification.GetPortAddress(port);
  254. IntermediateCode.InitImmediate(op,addressType,adr);
  255. symbol.Emit(Data(-1,op));
  256. DEC(len); INC(port);
  257. END;
  258. *)
  259. END;
  260. ELSE
  261. Error(parameter.position,"should never happen, check semantic checker!");
  262. END;
  263. parameter := parameter.nextParameter;
  264. END;
  265. capabilities := {};
  266. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  267. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  268. backend.SetCapabilities(capabilities);
  269. Scope(x.cellScope);
  270. END VisitCellType;
  271. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  272. BEGIN (* no code emission *) END VisitProcedureType;
  273. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  274. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  275. END VisitEnumerationType;
  276. (* symbols *)
  277. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  278. BEGIN
  279. Procedure(x);
  280. END VisitProcedure;
  281. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  282. BEGIN
  283. Procedure(x);
  284. END VisitOperator;
  285. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  286. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section;
  287. BEGIN
  288. IF x.externalName # NIL THEN RETURN END;
  289. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  290. (* code section for variable *)
  291. Global.GetSymbolSegmentedName(x,name);
  292. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  293. irv.SetExported(IsExported(x));
  294. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  295. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  296. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))));
  297. meta.CheckTypeDeclaration(x.type);
  298. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  299. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  300. END;
  301. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  302. END VisitVariable;
  303. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  304. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; op: Operand;
  305. BEGIN
  306. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  307. (* code section for variable *)
  308. Global.GetSymbolSegmentedName(x,name);
  309. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  310. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  311. (*
  312. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  313. *)
  314. IF x.defaultValue = NIL THEN
  315. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  316. ELSE
  317. implementationVisitor.inData := TRUE;
  318. implementationVisitor.Evaluate(x.defaultValue, op);
  319. irv.Emit(Data(x.position,op.op));
  320. implementationVisitor.inData := FALSE;
  321. END;
  322. meta.CheckTypeDeclaration(x.type);
  323. END VisitParameter;
  324. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  325. BEGIN
  326. Type(x.declaredType); (* => code in objects *)
  327. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  328. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  329. END;
  330. END VisitTypeDeclaration;
  331. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  332. BEGIN
  333. IF (SyntaxTree.Public * x.access # {}) THEN
  334. implementationVisitor.VisitConstant(x);
  335. END;
  336. END VisitConstant;
  337. PROCEDURE Scope(x: SyntaxTree.Scope);
  338. VAR procedure: SyntaxTree.Procedure;
  339. constant: SyntaxTree.Constant;
  340. variable: SyntaxTree.Variable;
  341. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  342. BEGIN
  343. prevScope := currentScope;
  344. currentScope := x;
  345. (* constants treated in implementation visitor *)
  346. typeDeclaration := x.firstTypeDeclaration;
  347. WHILE typeDeclaration # NIL DO
  348. VisitTypeDeclaration(typeDeclaration);
  349. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  350. END;
  351. variable := x.firstVariable;
  352. WHILE variable # NIL DO
  353. VisitVariable(variable);
  354. variable := variable.nextVariable;
  355. END;
  356. procedure := x.firstProcedure;
  357. WHILE procedure # NIL DO
  358. VisitProcedure(procedure);
  359. procedure := procedure.nextProcedure;
  360. END;
  361. constant := x.firstConstant;
  362. WHILE constant # NIL DO
  363. VisitConstant(constant);
  364. constant := constant.nextConstant;
  365. END;
  366. currentScope := prevScope;
  367. END Scope;
  368. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  369. VAR parameter: SyntaxTree.Parameter;
  370. BEGIN
  371. parameter := first;
  372. WHILE parameter # NIL DO
  373. VisitParameter(parameter);
  374. parameter := parameter.nextParameter;
  375. END;
  376. END Parameters;
  377. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  378. VAR scope: SyntaxTree.ProcedureScope;
  379. prevScope: SyntaxTree.Scope;
  380. inline, finalizer: BOOLEAN;
  381. procedureType: SyntaxTree.ProcedureType;
  382. pc: LONGINT;
  383. stackSize: LONGINT;
  384. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  385. null,size,src,dest,fp,res: IntermediateCode.Operand;
  386. cc: LONGINT;
  387. actorType: SyntaxTree.CellType;
  388. registerNumber: LONGINT;
  389. registerClass: IntermediateCode.RegisterClass;
  390. type: IntermediateCode.Type;
  391. formalParameter: SyntaxTree.Parameter;
  392. recordType: SyntaxTree.RecordType;
  393. priority: INTEGER;
  394. isModuleBody: BOOLEAN;
  395. PROCEDURE Signature;
  396. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  397. BEGIN
  398. procedureType := x.type(SyntaxTree.ProcedureType);
  399. returnType := procedureType.returnType;
  400. IF returnType # NIL THEN
  401. meta.CheckTypeDeclaration(returnType)
  402. END;
  403. parameter := procedureType.firstParameter;
  404. WHILE parameter # NIL DO
  405. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  406. parameter := parameter.nextParameter;
  407. END;
  408. END Signature;
  409. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  410. VAR result: BOOLEAN;
  411. BEGIN
  412. result := FALSE;
  413. IF x = SyntaxTree.invalidExpression THEN
  414. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  415. result := TRUE;
  416. value := x.resolved(SyntaxTree.IntegerValue).value;
  417. ELSE
  418. Error(x.position,"expression is not an integer constant");
  419. END;
  420. RETURN result;
  421. END CheckIntegerValue;
  422. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  423. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  424. BEGIN
  425. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  426. WHILE (this # NIL) & (this.identifier # id) DO
  427. this := this.nextModifier;
  428. END;
  429. IF this # NIL THEN
  430. IF this.expression = NIL THEN
  431. Error(this.position,"expected expression value");
  432. ELSIF CheckIntegerValue(this.expression,value) THEN
  433. END;
  434. RETURN TRUE
  435. ELSE RETURN FALSE
  436. END;
  437. END HasValue;
  438. BEGIN
  439. IF x.externalName # NIL THEN RETURN END;
  440. (*
  441. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  442. *)
  443. (* code section for this procedure *)
  444. scope := x.procedureScope;
  445. prevScope := currentScope;
  446. currentScope := scope;
  447. procedureType := x.type(SyntaxTree.ProcedureType);
  448. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  449. implementationVisitor.temporaries.Init;
  450. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  451. IF (scope.body # NIL) & (x.isInline) THEN
  452. inline := TRUE;
  453. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  454. ir.SetExported(IsExported(x));
  455. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  456. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  457. IF backend.cellsAreObjects THEN
  458. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  459. ir.SetExported(IsExported(x));
  460. ELSE
  461. RETURN; (* cellnet cannot be compiled for final static hardware *)
  462. END;
  463. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  464. inline := FALSE;
  465. AddBodyCallStub(x);
  466. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  467. ir.SetExported(IsExported(x));
  468. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  469. inline := FALSE;
  470. actorType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  471. IF ~HasValue(actorType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := ActiveCells.defaultDataMemorySize END;
  472. AddBodyCallStub(x);
  473. AddStackAllocation(x,stackSize);
  474. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  475. ir.SetExported(IsExported(x));
  476. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  477. inline := FALSE;
  478. Parameters(procedureType.firstParameter);
  479. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  480. ir.SetExported(IsExported(x));
  481. ELSE
  482. inline := FALSE;
  483. IF x.isEntry OR x.isExit THEN
  484. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  485. ir.SetExported(TRUE);
  486. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  487. ELSE
  488. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  489. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  490. END;
  491. END;
  492. cc := procedureType.callingConvention;
  493. IF scope.body # NIL THEN
  494. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  495. registerNumber := 0;
  496. IF ~inline THEN
  497. pc := ir.pc;
  498. IF scope.lastVariable = NIL THEN
  499. stackSize := 0
  500. ELSE
  501. stackSize := scope.lastVariable.offsetInBits;
  502. IF stackSize <0 THEN stackSize := -stackSize END;
  503. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  504. END;
  505. (*
  506. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  507. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  508. *)
  509. ir.Emit(Nop(-1)); (* placeholder for enter *)
  510. (*
  511. ir.Emit(Nop(position)); (* placeholder for fill *)
  512. *)
  513. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  514. formalParameter := procedureType.lastParameter;
  515. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  516. IF ~PassInRegister(formalParameter) THEN
  517. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  518. ELSE
  519. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  520. type := GetType(system, formalParameter.type);
  521. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  522. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  523. ir.Emit(Mov(-1,dest, src));
  524. implementationVisitor.ReleaseIntermediateOperand(src);
  525. INC(registerNumber);
  526. formalParameter := formalParameter.prevParameter;
  527. END;
  528. END;
  529. END;
  530. ir.EnterValidPAF;
  531. END;
  532. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  533. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  534. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  535. IF scope.lastVariable # NIL THEN
  536. stackSize := scope.lastVariable.offsetInBits;
  537. IF stackSize <0 THEN stackSize := -stackSize END;
  538. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  539. END;
  540. END;
  541. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  542. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  543. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  544. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  545. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  546. ir.EmitAt(pc,Push(size));
  547. implementationVisitor.StaticCallOperand(result,procedure);
  548. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  549. END;
  550. *)
  551. END;
  552. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber)); (*!!*)
  553. IF stackSize > 0 THEN
  554. IF (stackSize MOD system.addressSize = 0) THEN
  555. null := IntermediateCode.Immediate(addressType,0);
  556. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  557. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  558. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  559. ELSE
  560. null := IntermediateCode.Immediate(int8,0);
  561. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  562. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  563. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  564. END;
  565. (*! should potentially be called by backend -- enter might initialize
  566. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  567. *)
  568. END;
  569. ir.ExitValidPAF;
  570. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  571. finalizer := FALSE;
  572. IF backend.cooperative & x.isFinalizer THEN
  573. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  574. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  575. GetRecordTypeName(recordType,name);
  576. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  577. END;
  578. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  579. IF backend.cooperative THEN
  580. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  581. IF implementationVisitor.profile & ~isModuleBody THEN
  582. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  583. END;
  584. END;
  585. ir.Emit(implementationVisitor.Leave(x.position,x,cc));
  586. IF finalizer THEN
  587. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  588. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  589. ir.Emit(Br(x.position,dest));
  590. ELSE
  591. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  592. END;
  593. ELSE
  594. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  595. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  596. END;
  597. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  598. IF backend.cooperative THEN
  599. IF HasPointers (scope) THEN
  600. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  601. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  602. ir.Emit(Result(x.position, res));
  603. ir.Emit(Push(x.position, res));
  604. implementationVisitor.ResetVariables(scope);
  605. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  606. ir.Emit(Pop(x.position, res));
  607. ir.Emit(Return(x.position, res));
  608. ELSE
  609. implementationVisitor.ResetVariables(scope);
  610. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  611. END;
  612. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  613. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  614. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  615. ir.Emit(Result(x.position, res));
  616. ir.Emit(Push(x.position, res));
  617. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  618. ir.Emit(Pop(x.position, res));
  619. ir.Emit(Return(x.position, res));
  620. ELSE
  621. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  622. END;
  623. END;
  624. ir.Emit(implementationVisitor.Leave(x.position,x,cc));
  625. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  626. ELSE
  627. ir.Emit(Nop(x.position));
  628. END;
  629. END
  630. END;
  631. ELSE (* force body for procedures *)
  632. ir.Emit(implementationVisitor.Enter(x.position,x,cc,0,0));
  633. ir.EnterValidPAF;
  634. implementationVisitor.usedRegisters := NIL;
  635. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  636. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  637. ir.ExitValidPAF;
  638. ir.Emit(implementationVisitor.Leave(x.position,x,cc));
  639. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  640. END;
  641. Scope(scope);
  642. Signature;
  643. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  644. currentScope := prevScope;
  645. END Procedure;
  646. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  647. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  648. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  649. BEGIN
  650. ASSERT (bodyProcedure # NIL);
  651. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  652. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  653. procedure.SetScope(bodyProcedure.scope);
  654. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  655. procedure.SetAccess(SyntaxTree.Hidden);
  656. Global.GetSymbolSegmentedName (procedure,name);
  657. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  658. ir.SetExported(TRUE);
  659. ir.SetPriority(InitPriority);
  660. Global.GetSymbolSegmentedName (bodyProcedure,name);
  661. IF backend.newObjectFile OR backend.cooperative THEN
  662. implementationVisitor.currentScope := module.module.moduleScope;
  663. implementationVisitor.section := ir;
  664. implementationVisitor.PushSelfPointer();
  665. implementationVisitor.CallThis("Modules","Register",1);
  666. ELSIF backend.preregisterStatic THEN
  667. implementationVisitor.currentScope := module.module.moduleScope;
  668. implementationVisitor.section := ir;
  669. implementationVisitor.PushSelfPointer();
  670. implementationVisitor.CallThis("Modules","Preregister",1);
  671. ELSE
  672. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  673. ir.Emit(Call(bodyProcedure.position,op, 0));
  674. END;
  675. END AddBodyCallStub;
  676. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  677. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  678. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  679. BEGIN
  680. Global.GetSymbolSegmentedName (symbol,name);
  681. Basic.RemoveSuffix(name);
  682. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  683. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  684. ir.SetExported(TRUE);
  685. ir.SetPriority(FirstPriority);
  686. IntermediateCode.InitImmediate(op,addressType,initStack);
  687. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  688. END AddStackAllocation;
  689. (** entry function to visit a complete module *)
  690. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  691. VAR
  692. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  693. hasDynamicOperatorDeclarations: BOOLEAN;
  694. operator: SyntaxTree.Operator;
  695. import: SyntaxTree.Import;
  696. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  697. BEGIN
  698. type := type.resolved;
  699. IF type IS SyntaxTree.RecordType THEN
  700. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  701. ELSIF (type IS SyntaxTree.ArrayType) THEN
  702. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  703. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  704. END;
  705. ELSIF type IS SyntaxTree.MathArrayType THEN
  706. WITH type: SyntaxTree.MathArrayType DO
  707. IF type.form = SyntaxTree.Open THEN
  708. RETURN TRUE
  709. ELSIF type.form = SyntaxTree.Static THEN
  710. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  711. END;
  712. END;
  713. END;
  714. RETURN FALSE
  715. END TypeNeedsInitialization;
  716. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  717. VAR variable: SyntaxTree.Variable;
  718. BEGIN
  719. variable := scope.firstVariable;
  720. WHILE variable # NIL DO
  721. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  722. IF variable.initializer # NIL THEN RETURN TRUE END;
  723. variable := variable.nextVariable;
  724. END;
  725. RETURN FALSE
  726. END ScopeNeedsInitialization;
  727. BEGIN
  728. ASSERT(x # NIL); ASSERT(module # NIL);
  729. SELF.module := module;
  730. (* add import names to the generated Sections.Module *)
  731. import := x.moduleScope.firstImport;
  732. WHILE import # NIL DO
  733. import.module.GetName(idstr);
  734. module.imports.AddName(idstr);
  735. import := import.nextImport
  736. END;
  737. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  738. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  739. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  740. moduleSelf.SetType(system.anyType);
  741. moduleSelf.SetScope(x.moduleScope);
  742. moduleSelf.SetUntraced(TRUE);
  743. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  744. ir.SetExported(TRUE);
  745. IntermediateCode.InitImmediate(op,addressType,0);
  746. ir.Emit(Data(-1,op));
  747. END;
  748. implementationVisitor.module := module;
  749. implementationVisitor.moduleScope := x.moduleScope;
  750. implementationVisitor.moduleSelf := moduleSelf;
  751. implementationVisitor.canBeLoaded := TRUE;
  752. meta.SetModule(module);
  753. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  754. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  755. END;
  756. IF backend.profile THEN
  757. EnsureBodyProcedure(x.moduleScope);
  758. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  759. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  760. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  761. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  762. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  763. implementationVisitor.profileInit.Emit(implementationVisitor.Enter(-1,NIL,0,0,0));
  764. Global.GetModuleName(module.module,idstr);
  765. implementationVisitor.ProfilerAddModule(idstr);
  766. implementationVisitor.numberProcedures := 0;
  767. END;
  768. implementationVisitor.profile := backend.profile;
  769. (* check if there is at least one dynamic operator locally defined *)
  770. hasDynamicOperatorDeclarations := FALSE;
  771. operator := x.moduleScope.firstOperator;
  772. WHILE operator # NIL DO
  773. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  774. operator := operator.nextOperator
  775. END;
  776. (* add operator initialization code section *)
  777. IF hasDynamicOperatorDeclarations THEN
  778. EnsureBodyProcedure(x.moduleScope);
  779. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  780. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  781. implementationVisitor.operatorInitializationCodeSection.Emit(implementationVisitor.Enter(-1,NIL,0,0,0));
  782. END;
  783. Scope(x.moduleScope);
  784. IF hasDynamicOperatorDeclarations THEN
  785. implementationVisitor.operatorInitializationCodeSection.Emit(implementationVisitor.Leave(-1,NIL,0));
  786. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  787. END;
  788. IF backend.profile THEN
  789. implementationVisitor.ProfilerPatchInit;
  790. END;
  791. END Module;
  792. END DeclarationVisitor;
  793. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  794. RegisterUsageCount*=OBJECT
  795. VAR used: UsedArray; count: LONGINT;
  796. PROCEDURE &Init;
  797. VAR i: LONGINT;
  798. BEGIN
  799. count := 0;
  800. IF used = NIL THEN NEW(used,64); END;
  801. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  802. END Init;
  803. PROCEDURE Grow;
  804. VAR new: UsedArray; size,i: LONGINT;
  805. BEGIN
  806. size := LEN(used)*2;
  807. NEW(new,size);
  808. FOR i := 0 TO LEN(used)-1 DO
  809. new[i].count := used[i].count;
  810. new[i].type := used[i].type;
  811. new[i].map := used[i].map
  812. END;
  813. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  814. used := new
  815. END Grow;
  816. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  817. BEGIN
  818. INC(count);
  819. IF count = LEN(used) THEN Grow END;
  820. used[count].type := type;
  821. used[count].class := class;
  822. used[count].map := count;
  823. RETURN count;
  824. END Next;
  825. PROCEDURE IncUse(register: LONGINT);
  826. BEGIN
  827. INC(used[register].count);
  828. (*
  829. IF (register = 1) & (count > 30) THEN
  830. D.TraceBack;
  831. END;
  832. *)
  833. END IncUse;
  834. PROCEDURE DecUse(register: LONGINT);
  835. BEGIN
  836. DEC(used[register].count);
  837. END DecUse;
  838. PROCEDURE Map(register: LONGINT): LONGINT;
  839. VAR map : LONGINT;
  840. BEGIN
  841. IF register > 0 THEN
  842. map := used[register].map;
  843. WHILE register # map DO register := map; map := used[register].map END;
  844. END;
  845. RETURN register
  846. END Map;
  847. PROCEDURE Remap(register: LONGINT; to: LONGINT);
  848. BEGIN
  849. used[register].map:= to;
  850. used[to].count := used[register].count;
  851. used[register].count := 0;
  852. END Remap;
  853. PROCEDURE Use(register: LONGINT): LONGINT;
  854. BEGIN
  855. IF register< LEN(used) THEN
  856. RETURN used[register].count
  857. ELSE
  858. RETURN 0
  859. END
  860. END Use;
  861. END RegisterUsageCount;
  862. RegisterEntry = POINTER TO RECORD
  863. prev,next: RegisterEntry;
  864. register: LONGINT;
  865. registerClass: IntermediateCode.RegisterClass;
  866. type: IntermediateCode.Type;
  867. END;
  868. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  869. Variables = OBJECT (Basic.List)
  870. VAR
  871. inUse: VariableUse;
  872. registerIndex: LONGINT;
  873. PROCEDURE & Init;
  874. VAR i: LONGINT;
  875. BEGIN
  876. InitList(16);
  877. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  878. registerIndex := 1024;
  879. END Init;
  880. PROCEDURE GetUsage(VAR use: VariableUse);
  881. BEGIN
  882. use := inUse;
  883. END GetUsage;
  884. PROCEDURE SetUsage(CONST use: VariableUse);
  885. BEGIN
  886. inUse := use;
  887. END SetUsage;
  888. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  889. VAR any: ANY;
  890. BEGIN
  891. any := Get(i);;
  892. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  893. END GetVariable;
  894. PROCEDURE Occupy(pos: LONGINT);
  895. BEGIN
  896. INCL(inUse[pos DIV 32], pos MOD 32);
  897. END Occupy;
  898. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  899. BEGIN
  900. Occupy(Length());
  901. Add(v);
  902. END AddVariable;
  903. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  904. VAR var : SyntaxTree.Variable;
  905. BEGIN
  906. FOR pos := 0 TO Length()-1 DO
  907. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  908. var := GetVariable(pos);
  909. IF type.SameType(var.type) THEN
  910. Occupy(pos); RETURN var
  911. END;
  912. END;
  913. END;
  914. pos := Length();
  915. RETURN NIL
  916. END GetFreeVariable;
  917. END Variables;
  918. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  919. SymbolMapper = OBJECT
  920. VAR
  921. first: SymbolMap;
  922. PROCEDURE & Init;
  923. BEGIN
  924. first := NIL;
  925. END Init;
  926. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  927. VAR new: SymbolMap;
  928. BEGIN
  929. NEW(new); new.this := this; new.to := to; new.tag := tag;
  930. new.next := first; first := new;
  931. END Add;
  932. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  933. VAR s: SymbolMap;
  934. BEGIN
  935. s := first;
  936. WHILE (s # NIL) & (s.this # this) DO
  937. s := s.next
  938. END;
  939. RETURN s
  940. END Get;
  941. END SymbolMapper;
  942. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  943. VAR
  944. system: Global.System;
  945. section: IntermediateCode.Section;
  946. module: Sections.Module;
  947. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  948. awaitProcCounter, labelId, constId, caseId: LONGINT;
  949. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  950. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  951. checker: SemanticChecker.Checker;
  952. backend: IntermediateBackend;
  953. meta: MetaDataGenerator;
  954. position: LONGINT;
  955. moduleSelf: SyntaxTree.Variable;
  956. (* variables for hand over of variables / temporary state *)
  957. currentScope: SyntaxTree.Scope;
  958. constantDeclaration : SyntaxTree.Symbol;
  959. result: Operand; (* result of the most recent expression / statement *)
  960. destination: IntermediateCode.Operand;
  961. arrayDestinationTag: IntermediateCode.Operand;
  962. arrayDestinationDimension:LONGINT;
  963. currentLoop: Label; (* variable to hand over loop exit jump list *)
  964. conditional: BOOLEAN;
  965. trueLabel, falseLabel, exitLabel: Label;
  966. locked: BOOLEAN;
  967. (*
  968. usedRegisters: Registers;
  969. *)
  970. registerUsageCount: RegisterUsageCount;
  971. usedRegisters: RegisterEntry;
  972. (* useful operands and types *)
  973. nil,fp,sp,ap,true,false: IntermediateCode.Operand;
  974. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  975. commentPrintout: Printout.Printer;
  976. dump: Streams.Writer;
  977. tagsAvailable : BOOLEAN;
  978. supportedInstruction: SupportedInstructionProcedure;
  979. supportedImmediate: SupportedImmediateProcedure;
  980. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  981. emitLabels: BOOLEAN;
  982. runtimeModuleName : SyntaxTree.IdentifierString;
  983. newObjectFile: BOOLEAN;
  984. indexCounter: LONGINT;
  985. profile: BOOLEAN;
  986. profileId, profileInit: IntermediateCode.Section;
  987. profileInitPatchPosition: LONGINT;
  988. numberProcedures: LONGINT;
  989. procedureResultDesignator : SyntaxTree.Designator;
  990. operatorInitializationCodeSection: IntermediateCode.Section;
  991. fingerPrinter: FingerPrinter.FingerPrinter;
  992. temporaries: Variables;
  993. canBeLoaded : BOOLEAN;
  994. currentIsInline: BOOLEAN;
  995. currentMapper: SymbolMapper;
  996. currentInlineExit: Label;
  997. moduleBodySection: IntermediateCode.Section;
  998. NeedDescriptor : BOOLEAN;
  999. cooperativeSwitches: BOOLEAN;
  1000. lastSwitchPC: LONGINT;
  1001. isUnchecked: BOOLEAN;
  1002. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1003. newObjectFile: BOOLEAN);
  1004. BEGIN
  1005. SELF.system := system;
  1006. SELF.runtimeModuleName := runtime;
  1007. currentScope := NIL;
  1008. hiddenPointerType := NIL;
  1009. delegatePointerType := NIL;
  1010. awaitProcCounter := 0;
  1011. labelId := 0; constId := 0; labelId := 0;
  1012. SELF.checker := checker;
  1013. SELF.backend := backend;
  1014. position := Diagnostics.Invalid;
  1015. conditional := FALSE;
  1016. locked := FALSE;
  1017. InitOperand(result,ModeUndefined);
  1018. addressType := IntermediateCode.GetType(system,system.addressType);
  1019. setType := IntermediateCode.GetType(system,system.setType);
  1020. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1021. byteType := IntermediateCode.GetType(system, system.byteType);
  1022. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1023. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1024. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1025. nil := IntermediateCode.Immediate(addressType,0);
  1026. IntermediateCode.InitOperand(destination);
  1027. tagsAvailable := TRUE;
  1028. supportedInstruction := supportedInstructionProcedure;
  1029. supportedImmediate := supportedImmediateProcedure;
  1030. inData := FALSE;
  1031. SELF.emitLabels := emitLabels;
  1032. IntermediateCode.InitOperand(arrayDestinationTag);
  1033. bool := IntermediateCode.GetType(system,system.booleanType);
  1034. IntermediateCode.InitImmediate(false,bool,0);
  1035. IntermediateCode.InitImmediate(true,bool,1);
  1036. SELF.newObjectFile := newObjectFile;
  1037. indexCounter := 0;
  1038. NEW(registerUsageCount);
  1039. usedRegisters := NIL;
  1040. procedureResultDesignator := NIL;
  1041. NEW(fingerPrinter, system);
  1042. NEW(temporaries);
  1043. currentIsInline := FALSE;
  1044. NeedDescriptor := FALSE;
  1045. isUnchecked := backend.noRuntimeChecks;
  1046. END Init;
  1047. TYPE Context = RECORD
  1048. section: IntermediateCode.Section;
  1049. registerUsageCount: RegisterUsageCount;
  1050. usedRegisters: RegisterEntry;
  1051. END;
  1052. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1053. VAR context: Context;
  1054. BEGIN
  1055. context.section := section;
  1056. context.registerUsageCount := registerUsageCount;
  1057. context.usedRegisters := usedRegisters;
  1058. section := new;
  1059. NEW(registerUsageCount);
  1060. usedRegisters := NIL;
  1061. RETURN context;
  1062. END SwitchContext;
  1063. PROCEDURE ReturnToContext(context: Context);
  1064. BEGIN
  1065. section := context.section;
  1066. registerUsageCount := context.registerUsageCount;
  1067. usedRegisters := context.usedRegisters;
  1068. END ReturnToContext;
  1069. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1070. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1071. BEGIN
  1072. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1073. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1074. END;
  1075. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1076. section.SetExported(IsExported(syntaxTreeSymbol));
  1077. RETURN section
  1078. END NewSection;
  1079. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1080. VAR new: LONGINT;
  1081. BEGIN
  1082. new := registerUsageCount.Next(type,class);
  1083. UseRegister(new);
  1084. RETURN new
  1085. END AcquireRegister;
  1086. PROCEDURE GetIndex(): LONGINT;
  1087. BEGIN
  1088. INC(indexCounter); RETURN indexCounter
  1089. END GetIndex;
  1090. (** get the name for the code section that represens a certain symbol
  1091. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1092. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1093. VAR
  1094. operatorFingerPrint: SyntaxTree.FingerPrint;
  1095. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1096. BEGIN
  1097. Global.GetSymbolSegmentedName(symbol, name);
  1098. (* if the symbol is an operator, then append the fingerprint to the name *)
  1099. IF symbol IS SyntaxTree.Operator THEN
  1100. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1101. string := "[";
  1102. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1103. Strings.Append(string, operatorFingerPrintString);
  1104. Strings.Append(string, "]");
  1105. Basic.AppendToSegmentedName(name,string);
  1106. END
  1107. END GetCodeSectionNameForSymbol;
  1108. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1109. BEGIN
  1110. IF dump # NIL THEN
  1111. dump.String("enter "); dump.String(s); dump.Ln;
  1112. END;
  1113. END TraceEnter;
  1114. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1115. BEGIN
  1116. IF dump # NIL THEN
  1117. dump.String("exit "); dump.String(s); dump.Ln;
  1118. END;
  1119. END TraceExit;
  1120. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1121. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1122. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1123. VAR i: LONGINT;
  1124. BEGIN
  1125. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1126. IF op.rule # NIL THEN
  1127. FOR i := 0 TO LEN(op.rule)-1 DO
  1128. CheckRegister(op.rule[i])
  1129. END;
  1130. END;
  1131. END CheckRegister;
  1132. BEGIN
  1133. CheckRegister(instruction.op1);
  1134. CheckRegister(instruction.op2);
  1135. CheckRegister(instruction.op3);
  1136. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1137. ELSE section.Emit(instruction);
  1138. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1139. END;
  1140. END Emit;
  1141. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1142. BEGIN
  1143. IF backend.cooperative THEN
  1144. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1145. CallThis(DefaultRuntimeModuleName,"Trap",1);
  1146. ELSE
  1147. Emit(Trap(position,trapNo));
  1148. END;
  1149. END EmitTrap;
  1150. PROCEDURE Enter (position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT): IntermediateCode.Instruction;
  1151. VAR name: Basic.SegmentedName;
  1152. VAR op1,op2,op3: IntermediateCode.Operand;
  1153. VAR instruction: IntermediateCode.Instruction;
  1154. BEGIN
  1155. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1156. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1157. GetCodeSectionNameForSymbol(procedure, name);
  1158. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1159. ELSE
  1160. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1161. END;
  1162. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1163. ELSE
  1164. IntermediateCode.InitNumber(op1,callconv);
  1165. END;
  1166. IntermediateCode.InitNumber(op2,varSize);
  1167. IntermediateCode.InitNumber(op3, numRegs);
  1168. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,op3);
  1169. RETURN instruction;
  1170. END Enter;
  1171. PROCEDURE Leave(position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT): IntermediateCode.Instruction;
  1172. VAR op1,op2: IntermediateCode.Operand;
  1173. VAR instruction: IntermediateCode.Instruction;
  1174. BEGIN
  1175. IntermediateCode.InitNumber(op1,callconv);
  1176. IF backend.cooperative THEN
  1177. IntermediateCode.InitNumber(op2,ToMemoryUnits(system, system.addressSize));
  1178. ELSE
  1179. IntermediateCode.InitNumber(op2,0);
  1180. END;
  1181. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,op2,emptyOperand);
  1182. RETURN instruction
  1183. END Leave;
  1184. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1185. VAR m: SymbolMap; e: SyntaxTree.Expression; o, t: IntermediateCode.Operand;
  1186. BEGIN
  1187. position := x.position;
  1188. IF currentIsInline THEN
  1189. m := currentMapper.Get(x);
  1190. IF m # NIL THEN
  1191. (*
  1192. Printout.Info("mapping from", x);
  1193. Printout.Info("mapping to ", m.to);
  1194. *)
  1195. m.to.Accept(SELF);
  1196. op := result;
  1197. IF m.tag # NIL THEN
  1198. ReleaseIntermediateOperand(result.tag);
  1199. m.tag.Accept(SELF);
  1200. op.tag := result.op;
  1201. ReleaseIntermediateOperand(result.tag);
  1202. END;
  1203. RETURN
  1204. END;
  1205. END;
  1206. x.Accept(SELF);
  1207. op := result;
  1208. END Symbol;
  1209. PROCEDURE Expression(x: SyntaxTree.Expression);
  1210. BEGIN
  1211. position := x.position;
  1212. constantDeclaration := NIL;
  1213. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1214. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1215. END;
  1216. IF x.resolved # NIL THEN
  1217. x.resolved.Accept(SELF)
  1218. ELSE
  1219. x.Accept(SELF)
  1220. END;
  1221. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) THEN
  1222. Error(x.position, "unsupported modifier");
  1223. END;
  1224. END Expression;
  1225. (*
  1226. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1227. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1228. BEGIN
  1229. temporaries.GetUsage(current);
  1230. FOR i := 0 TO LEN(current)-1 DO
  1231. set := current[i] - previous[i];
  1232. IF set # {} THEN
  1233. FOR j := 0 TO MAX(SET)-1 DO
  1234. IF j IN set THEN
  1235. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1236. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1237. Symbol(variable, op);
  1238. MakeMemory(tmp,op.op,addressType,0);
  1239. ReleaseOperand(op);
  1240. Emit(Mov(position,tmp, nil ) );
  1241. ReleaseIntermediateOperand(tmp);
  1242. END;
  1243. END;
  1244. END;
  1245. END;
  1246. END;
  1247. END ResetUsedTemporaries;
  1248. *)
  1249. PROCEDURE Statement(x: SyntaxTree.Statement);
  1250. VAR use: VariableUse;
  1251. BEGIN
  1252. temporaries.GetUsage(use);
  1253. position := x.position;
  1254. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1255. IF commentPrintout # NIL THEN
  1256. commentPrintout.Statement(x);
  1257. dump.Ln;
  1258. (*dump.Update;*)
  1259. END;
  1260. x.Accept(SELF);
  1261. (*
  1262. CheckRegistersFree();
  1263. *)
  1264. (*ResetUsedTemporaries(use);*)
  1265. temporaries.SetUsage(use);
  1266. END Statement;
  1267. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1268. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1269. *)
  1270. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1271. BEGIN
  1272. IF op.mode = IntermediateCode.ModeMemory THEN
  1273. ReuseCopy(res,op);
  1274. ELSE
  1275. res := op;
  1276. UseIntermediateOperand(res);
  1277. END;
  1278. IntermediateCode.AddOffset(res,offset);
  1279. IntermediateCode.MakeMemory(res,type);
  1280. END MakeMemory;
  1281. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1282. VAR mem: IntermediateCode.Operand;
  1283. BEGIN
  1284. MakeMemory(mem,res,type,offset);
  1285. ReleaseIntermediateOperand(res);
  1286. res := mem;
  1287. END ToMemory;
  1288. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1289. VAR mem: IntermediateCode.Operand;
  1290. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1291. componentType: SyntaxTree.Type;
  1292. BEGIN
  1293. type := type.resolved;
  1294. IF operand.mode = ModeReference THEN
  1295. IF type IS SyntaxTree.RangeType THEN
  1296. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1297. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1298. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1299. ReleaseOperand(operand);
  1300. operand.op := firstOp;
  1301. operand.tag := lastOp;
  1302. operand.extra := stepOp;
  1303. ELSIF type IS SyntaxTree.ComplexType THEN
  1304. componentType := type(SyntaxTree.ComplexType).componentType;
  1305. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1306. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1307. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1308. ReleaseOperand(operand);
  1309. operand.op := firstOp;
  1310. operand.tag := lastOp
  1311. ELSE
  1312. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1313. ReleaseIntermediateOperand(operand.op);
  1314. operand.op := mem;
  1315. END;
  1316. operand.mode := ModeValue;
  1317. END;
  1318. ASSERT(operand.mode = ModeValue);
  1319. END LoadValue;
  1320. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1321. VAR prevConditional: BOOLEAN;
  1322. BEGIN
  1323. prevConditional := conditional;
  1324. conditional := FALSE;
  1325. InitOperand(result, ModeUndefined);
  1326. Expression(x);
  1327. op := result;
  1328. LoadValue(op,x.type.resolved);
  1329. conditional := prevConditional;
  1330. END Evaluate;
  1331. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1332. VAR prevConditional: BOOLEAN;
  1333. BEGIN
  1334. prevConditional := conditional;
  1335. conditional := FALSE;
  1336. InitOperand(result,ModeUndefined);
  1337. Expression(x);
  1338. op := result;
  1339. (*
  1340. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1341. *)
  1342. conditional := prevConditional;
  1343. END Designate;
  1344. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1345. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1346. BEGIN
  1347. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1348. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1349. conditional := TRUE;
  1350. trueLabel := trueL; falseLabel := falseL;
  1351. Expression(x);
  1352. trueL := trueLabel; falseL := falseLabel;
  1353. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1354. END Condition;
  1355. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1356. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1357. BEGIN
  1358. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1359. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1360. RETURN op
  1361. END NewRegisterOperand;
  1362. PROCEDURE UnuseRegister(register: LONGINT);
  1363. BEGIN
  1364. IF (register > 0) THEN
  1365. register := registerUsageCount.Map(register);
  1366. registerUsageCount.DecUse(register);
  1367. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1368. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1369. END;
  1370. IF registerUsageCount.Use(register)=0 THEN
  1371. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1372. Warning(position, "register cannot be removed");
  1373. END;
  1374. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1375. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1376. END;
  1377. ELSIF registerUsageCount.Use(register)<0 THEN
  1378. Warning(position, "register removed too often");
  1379. D.TraceBack;
  1380. END;
  1381. END;
  1382. END UnuseRegister;
  1383. PROCEDURE UseRegister(register: LONGINT);
  1384. BEGIN
  1385. IF (register > 0) THEN
  1386. register := registerUsageCount.Map(register);
  1387. registerUsageCount.IncUse(register);
  1388. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1389. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1390. END;
  1391. IF registerUsageCount.Use(register)=1 THEN
  1392. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1393. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1394. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1395. END;
  1396. END;
  1397. END;
  1398. END UseRegister;
  1399. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1400. BEGIN
  1401. UnuseRegister(op.register)
  1402. END ReleaseIntermediateOperand;
  1403. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1404. BEGIN
  1405. UseRegister(op.register)
  1406. END UseIntermediateOperand;
  1407. PROCEDURE ReleaseOperand(CONST op: Operand);
  1408. BEGIN
  1409. UnuseRegister(op.op.register);
  1410. UnuseRegister(op.tag.register);
  1411. UnuseRegister(op.extra.register);
  1412. END ReleaseOperand;
  1413. (* save registers marked in array "markedRegisters" to the stack
  1414. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1415. *)
  1416. PROCEDURE SaveRegisters();
  1417. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1418. BEGIN
  1419. entry := usedRegisters;
  1420. WHILE entry # NIL DO
  1421. type := registerUsageCount.used[entry.register].type;
  1422. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1423. Emit(Push(position,op));
  1424. entry := entry.next;
  1425. END;
  1426. END SaveRegisters;
  1427. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1428. BEGIN
  1429. saved := usedRegisters;
  1430. usedRegisters := NIL;
  1431. END ReleaseUsedRegisters;
  1432. (** remove parameter registers from used queue *)
  1433. PROCEDURE ReleaseParameterRegisters;
  1434. VAR op: IntermediateCode.Operand; entry,prev,next: RegisterEntry;
  1435. BEGIN
  1436. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1437. WHILE entry # NIL DO
  1438. next := entry.next;
  1439. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1440. registerUsageCount.DecUse(entry.register);
  1441. ASSERT(registerUsageCount.Use(entry.register)=0);
  1442. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1443. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1444. END;
  1445. ELSIF prev = NIL THEN
  1446. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1447. ELSE
  1448. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1449. END;
  1450. entry := next;
  1451. END;
  1452. END ReleaseParameterRegisters;
  1453. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1454. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1455. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass; new: LONGINT;
  1456. BEGIN
  1457. entry := saved;
  1458. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1459. entry := prev;
  1460. WHILE entry # NIL DO
  1461. prev := entry.prev;
  1462. type := entry.type;
  1463. class := entry.registerClass;
  1464. IntermediateCode.InitRegister(op,type,class,entry.register);
  1465. (*
  1466. new := registerUsageCount.Next(type,class);
  1467. registerUsageCount.Remap(entry.register,new);
  1468. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1469. dump.String("remap register "); dump.Int(entry.register,1);
  1470. dump.String("to "); dump.Int(new,1);
  1471. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1472. END;
  1473. entry.register := new;
  1474. *)
  1475. Emit(Pop(position,op));
  1476. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1477. entry := prev;
  1478. END;
  1479. (*
  1480. usedRegisters := saved;
  1481. *)
  1482. END RestoreRegisters;
  1483. PROCEDURE CheckRegistersFree;
  1484. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1485. BEGIN
  1486. IF usedRegisters # NIL THEN
  1487. r := usedRegisters;
  1488. WHILE r # NIL DO
  1489. warning := "register ";
  1490. Strings.AppendInt(warning, r.register);
  1491. Strings.Append(warning, " not released.");
  1492. Warning(position,warning);
  1493. r := r .next;
  1494. END;
  1495. END;
  1496. FOR i := 0 TO registerUsageCount.count-1 DO
  1497. IF registerUsageCount.used[i].count < 0 THEN
  1498. warning := "register ";
  1499. Strings.AppendInt(warning, i);
  1500. Strings.Append(warning, " unused too often.");
  1501. Warning(position,warning);
  1502. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1503. warning := "register ";
  1504. Strings.AppendInt(warning, i);
  1505. Strings.Append(warning, " not unused often enough.");
  1506. Warning(position,warning);
  1507. END;
  1508. END;
  1509. END CheckRegistersFree;
  1510. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1511. Otherwise allocate a new register.
  1512. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1513. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1514. BEGIN
  1515. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1516. UseIntermediateOperand(result);
  1517. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1518. UseIntermediateOperand(result);
  1519. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1520. END;
  1521. END Reuse2;
  1522. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1523. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1524. If not then allocate a new register.
  1525. Does NOT necessarily keep the content of src1 or src2 in result!
  1526. *)
  1527. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1528. BEGIN
  1529. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1530. UseIntermediateOperand(result);
  1531. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1532. UseIntermediateOperand(result);
  1533. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1534. result := alternative; alternative := emptyOperand;
  1535. UseIntermediateOperand(result);
  1536. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1537. END;
  1538. END Reuse2a;
  1539. (* like reuse2 but only one source *)
  1540. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1541. BEGIN
  1542. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1543. UseIntermediateOperand(result);
  1544. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1545. END;
  1546. END Reuse1;
  1547. (* like reuse2a but only one source *)
  1548. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1549. BEGIN
  1550. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1551. UseIntermediateOperand(result);
  1552. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1553. UseIntermediateOperand(result);
  1554. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1555. END;
  1556. END Reuse1a;
  1557. (* like reuse1 but guarantees that content of src1 is in result *)
  1558. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1559. BEGIN
  1560. IF ReusableRegister(src1) THEN
  1561. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1562. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1563. UseIntermediateOperand(result);
  1564. ELSE
  1565. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1566. Emit(Mov(position,result,src1));
  1567. END
  1568. END ReuseCopy;
  1569. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1570. BEGIN
  1571. IF ReusableRegister(src) THEN
  1572. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1573. ELSE
  1574. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1575. Emit(Mov(position,result,src));
  1576. ReleaseIntermediateOperand(src);
  1577. END
  1578. END TransferToRegister;
  1579. (** labels and branches **)
  1580. PROCEDURE NewLabel(): Label;
  1581. VAR label: Label;
  1582. BEGIN
  1583. NEW(label,section); RETURN label;
  1584. END NewLabel;
  1585. PROCEDURE SetLabel(label: Label);
  1586. BEGIN label.Resolve(section.pc);
  1587. END SetLabel;
  1588. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1589. BEGIN
  1590. ASSERT(label # NIL);
  1591. IF label.pc < 0 THEN (* label not yet set *)
  1592. label.AddFixup(section.pc);
  1593. END;
  1594. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1595. END LabelOperand;
  1596. PROCEDURE BrL(label: Label);
  1597. BEGIN
  1598. Emit(Br(position,LabelOperand(label)));
  1599. END BrL;
  1600. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1601. BEGIN
  1602. Emit(Brge(position,LabelOperand(label),left,right));
  1603. END BrgeL;
  1604. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1605. BEGIN
  1606. Emit(Brlt(position,LabelOperand(label),left,right));
  1607. END BrltL;
  1608. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1609. BEGIN
  1610. Emit(Breq(position,LabelOperand(label),left,right));
  1611. END BreqL;
  1612. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1613. BEGIN
  1614. Emit(Brne(position,LabelOperand(label),left,right));
  1615. END BrneL;
  1616. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1617. VAR new: IntermediateCode.Operand;
  1618. BEGIN
  1619. IF Trace THEN TraceEnter("Convert") END;
  1620. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1621. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1622. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1623. & (operand.offset = 0)
  1624. THEN
  1625. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1626. Emit(Conv(position,new,operand));
  1627. ELSE
  1628. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1629. Emit(Conv(position,new,operand));
  1630. ReleaseIntermediateOperand(operand);
  1631. END;
  1632. operand := new;
  1633. 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
  1634. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1635. ELSE
  1636. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1637. Emit(Conv(position,new,operand));
  1638. ReleaseIntermediateOperand(operand);
  1639. operand := new;
  1640. END;
  1641. IF Trace THEN TraceExit("Convert") END;
  1642. END Convert;
  1643. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1644. VAR exit: Label;
  1645. BEGIN
  1646. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1647. exit := NewLabel();
  1648. br(exit,left,right);
  1649. EmitTrap(position,trapNo);
  1650. SetLabel(exit);
  1651. END TrapC;
  1652. (** expressions *)
  1653. (** emit necessary runtime check for set elements **)
  1654. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1655. VAR max: IntermediateCode.Operand;
  1656. BEGIN
  1657. IF isUnchecked THEN RETURN END;
  1658. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1659. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1660. TrapC(BrgeL, max, o, SetElementTrap);
  1661. END;
  1662. END CheckSetElement;
  1663. (** the set that a range represents **)
  1664. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1665. VAR
  1666. operand: Operand;
  1667. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1668. BEGIN
  1669. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1670. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1671. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1672. one := IntermediateCode.Immediate(setType, 1);
  1673. Evaluate(x, operand);
  1674. Convert(operand.op, setType);
  1675. Convert(operand.tag, setType);
  1676. CheckSetElement(operand.op);
  1677. CheckSetElement(operand.tag);
  1678. (* create mask for lower bound
  1679. i.e. shift 11111111 to the left by the value of the lower bound
  1680. *)
  1681. Reuse1(temp, operand.op);
  1682. Emit(Shl(position,temp, allBits, operand.op));
  1683. ReleaseIntermediateOperand(operand.op);
  1684. operand.op := temp;
  1685. (* create mask for upper bound
  1686. i.e. shift 11111111 to the right by the difference between the
  1687. upper bound and the maximum number of set elements
  1688. *)
  1689. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1690. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1691. Reuse1(temp, operand.tag);
  1692. ELSE
  1693. Reuse1(temp, operand.tag);
  1694. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1695. Emit(Sub(position,temp, size, operand.tag));
  1696. END;
  1697. Emit(Shr(position,temp, allBits, operand.tag));
  1698. ReleaseIntermediateOperand(operand.tag);
  1699. operand.tag := temp;
  1700. Reuse2(resultingSet, operand.op, operand.tag);
  1701. (* intersect the two masks *)
  1702. Emit(And(position,resultingSet, operand.op, operand.tag));
  1703. ReleaseOperand(operand);
  1704. RETURN resultingSet
  1705. END SetFromRange;
  1706. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1707. VAR
  1708. res, operand: Operand;
  1709. temp, one, noBits, dest: IntermediateCode.Operand;
  1710. expression: SyntaxTree.Expression;
  1711. i: LONGINT;
  1712. BEGIN
  1713. IF Trace THEN TraceEnter("VisitSet") END;
  1714. dest := destination;
  1715. destination := emptyOperand;
  1716. noBits := IntermediateCode.Immediate(setType, 0);
  1717. one := IntermediateCode.Immediate(setType, 1);
  1718. (* start off with the empty set *)
  1719. InitOperand(res, ModeValue);
  1720. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1721. Emit(Mov(position,res.op, noBits));
  1722. FOR i := 0 TO x.elements.Length() - 1 DO
  1723. expression := x.elements.GetExpression(i);
  1724. IF expression IS SyntaxTree.RangeExpression THEN
  1725. (* range of set elements *)
  1726. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1727. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1728. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1729. ReleaseIntermediateOperand(temp)
  1730. ELSE
  1731. (* singelton element *)
  1732. Evaluate(expression, operand);
  1733. Convert(operand.op, setType);
  1734. CheckSetElement(operand.op);
  1735. (* create subset containing single element *)
  1736. Reuse1(temp, operand.op);
  1737. Emit(Shl(position,temp, one, operand.op));
  1738. ReleaseOperand(operand);
  1739. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1740. ReleaseIntermediateOperand(temp);
  1741. END
  1742. END;
  1743. result := res;
  1744. destination := dest;
  1745. IF Trace THEN TraceExit("VisitSet") END;
  1746. END VisitSet;
  1747. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1748. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1749. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1750. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1751. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1752. element: SyntaxTree.IntegerValue;
  1753. BEGIN
  1754. numberElements := x.elements.Length();
  1755. expression := index.parameters.GetExpression(dim);
  1756. element := expression(SyntaxTree.IntegerValue);
  1757. FOR i := 0 TO numberElements-1 DO
  1758. expression := x.elements.GetExpression(i);
  1759. element.SetValue(i);
  1760. IF expression IS SyntaxTree.MathArrayExpression THEN
  1761. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1762. ELSE
  1763. Assign(index,expression);
  1764. END;
  1765. END;
  1766. END RecursiveAssignment;
  1767. BEGIN
  1768. variable := GetTemporaryVariable(x.type, FALSE);
  1769. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1770. designator.SetType(variable.type);
  1771. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1772. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1773. FOR i := 0 TO dim-1 DO
  1774. element := SyntaxTree.NewIntegerValue(x.position,0);
  1775. element.SetType(system.longintType);
  1776. index.parameters.AddExpression(element);
  1777. END;
  1778. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1779. RecursiveAssignment(x,0);
  1780. Expression(designator);
  1781. END VisitMathArrayExpression;
  1782. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1783. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1784. BEGIN
  1785. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1786. dest := destination; destination := emptyOperand;
  1787. IF x.operator = Scanner.Not THEN
  1788. IF conditional THEN
  1789. Condition(x.left,falseLabel,trueLabel)
  1790. ELSE
  1791. Evaluate(x.left,operand);
  1792. InitOperand(result,ModeValue);
  1793. Reuse1a(result.op,operand.op,dest);
  1794. Emit(Xor(position,result.op,operand.op,true));
  1795. ReleaseOperand(operand);
  1796. END;
  1797. ELSIF x.operator = Scanner.Minus THEN
  1798. Evaluate(x.left,operand);
  1799. InitOperand(result,ModeValue);
  1800. Reuse1a(result.op,operand.op,dest);
  1801. type := x.left.type.resolved;
  1802. IF type IS SyntaxTree.SetType THEN
  1803. Emit(Not(position,result.op,operand.op));
  1804. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1805. Reuse1(result.tag,operand.tag);
  1806. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1807. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1808. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  1809. Emit(Neg(position,result.op,operand.op));
  1810. ELSE HALT(200)
  1811. END;
  1812. ReleaseOperand(operand);
  1813. ELSIF x.operator = Scanner.Address THEN
  1814. Designate(x.left,operand);
  1815. operand.mode := ModeValue;
  1816. t0 := x.left.type.resolved;
  1817. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  1818. ReleaseIntermediateOperand(operand.op);
  1819. operand.op := operand.tag;
  1820. IntermediateCode.InitOperand(operand.tag);
  1821. END;
  1822. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  1823. result := operand;
  1824. ELSE HALT(100)
  1825. END;
  1826. destination := dest;
  1827. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  1828. END VisitUnaryExpression;
  1829. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  1830. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  1831. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  1832. BEGIN
  1833. type := type.resolved;
  1834. originalType := type;
  1835. IF type IS SyntaxTree.PointerType THEN
  1836. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  1837. END;
  1838. IF type IS SyntaxTree.ObjectType THEN
  1839. BrL(trueL);
  1840. ELSE
  1841. ASSERT(type IS SyntaxTree.RecordType);
  1842. (*
  1843. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  1844. *)
  1845. ReuseCopy(left,tag);
  1846. right := TypeDescriptorAdr(type);
  1847. IF ~newObjectFile THEN
  1848. IntermediateCode.MakeMemory(right,addressType);
  1849. END;
  1850. IF backend.cooperative THEN
  1851. repeatL := NewLabel();
  1852. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  1853. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  1854. END;
  1855. SetLabel(repeatL);
  1856. BreqL(trueL,left,right);
  1857. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  1858. BrneL(repeatL,left,nil);
  1859. ELSE
  1860. level := type(SyntaxTree.RecordType).Level();
  1861. (* get type desc tag of level relative to base tag *)
  1862. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  1863. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1864. IntermediateCode.MakeMemory(left,addressType);
  1865. BreqL(trueL,left,right);
  1866. END;
  1867. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  1868. BrL(falseL);
  1869. END;
  1870. END TypeTest;
  1871. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  1872. BEGIN
  1873. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  1874. IF dump # NIL THEN
  1875. dump.String(s); dump.Ln;
  1876. END;
  1877. END Error;
  1878. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  1879. BEGIN
  1880. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  1881. IF dump # NIL THEN
  1882. dump.String(s); dump.Ln; dump.Update;
  1883. END;
  1884. END Warning;
  1885. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  1886. VAR name: Basic.SectionName; pointer, pooledName: Basic.SegmentedName; previousSection,source: IntermediateCode.Section;
  1887. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  1888. operand:Operand; size: LONGINT; base: SyntaxTree.Type;
  1889. BEGIN
  1890. previousSection := section;
  1891. Global.GetModuleName(mod,name);
  1892. Strings.Append(name,".@Trace");
  1893. Basic.ToSegmentedName(name, pooledName);
  1894. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  1895. IF dump # NIL THEN dump := section.comments END;
  1896. variable := mod.moduleScope.firstVariable;
  1897. WHILE variable # NIL DO
  1898. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  1899. Symbol(variable, operand);
  1900. register := operand.op;
  1901. CallTraceMethod(register, variable.type);
  1902. ReleaseIntermediateOperand(register);
  1903. END;
  1904. variable := variable.nextVariable;
  1905. END;
  1906. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  1907. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  1908. Emit(Br(position,op));
  1909. INC(statCoopTraceModule, section.pc);
  1910. section := previousSection;
  1911. IF dump # NIL THEN dump := section.comments END;
  1912. END CreateTraceModuleMethod;
  1913. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  1914. BEGIN
  1915. Emit (Push(position, dst));
  1916. Emit (Push(position, src));
  1917. CallThis("GarbageCollector","Assign", 2);
  1918. END CallAssignPointer;
  1919. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  1920. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  1921. BEGIN
  1922. IF SemanticChecker.IsPointerType (type) THEN
  1923. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  1924. ELSIF type.IsRecordType() THEN
  1925. Emit (Push(position,dst));
  1926. Emit (Push(position,src));
  1927. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  1928. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  1929. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  1930. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  1931. ELSIF IsStaticArray(type) THEN
  1932. size := StaticArrayNumElements(type);
  1933. base := StaticArrayBaseType(type);
  1934. IF base.IsRecordType() THEN
  1935. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1936. Emit (Push(position, dst));
  1937. Emit (Push(position, src));
  1938. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  1939. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  1940. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  1941. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  1942. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  1943. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  1944. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1945. Emit (Push(position, dst));
  1946. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1947. Emit (Push(position, src));
  1948. CallThis("GarbageCollector","AssignDelegateArray", 4);
  1949. ELSE
  1950. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1951. Emit (Push(position, dst));
  1952. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1953. Emit (Push(position, src));
  1954. CallThis("GarbageCollector","AssignPointerArray", 4);
  1955. ASSERT(StaticArrayBaseType(type).IsPointer());
  1956. END;
  1957. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  1958. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  1959. Emit (Push(position, dst));
  1960. Emit (Push(position, src));
  1961. CallThis("GarbageCollector","AssignDelegate", 2);
  1962. ELSE HALT(100); (* missing ? *)
  1963. END;
  1964. END CallAssignMethod;
  1965. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  1966. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  1967. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType; size: LONGINT;
  1968. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label; previousUsedRegisters: RegisterEntry;
  1969. previousRegisterUsageCount: RegisterUsageCount; context: Context;
  1970. BEGIN
  1971. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  1972. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  1973. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  1974. GetRecordTypeName (recordType,name);
  1975. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  1976. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  1977. IF dump # NIL THEN dump := section.comments END;
  1978. variable := recordType.recordScope.firstVariable;
  1979. WHILE variable # NIL DO
  1980. IF variable.NeedsTrace() THEN
  1981. dst := NewRegisterOperand (addressType);
  1982. src := NewRegisterOperand (addressType);
  1983. Emit (Mov(position, dst, parameter1));
  1984. Emit (Mov(position, src, parameter2));
  1985. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  1986. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  1987. CallAssignMethod(dst, src, variable.type);
  1988. ReleaseIntermediateOperand(src);
  1989. ReleaseIntermediateOperand(dst);
  1990. END;
  1991. variable := variable.nextVariable;
  1992. END;
  1993. recordBase := recordType.GetBaseRecord();
  1994. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  1995. GetRecordTypeName (recordBase,name);
  1996. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  1997. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  1998. Emit(Br(position,op));
  1999. ELSE
  2000. Emit(Exit(position,0,0));
  2001. END;
  2002. IF ~recordType.isObject THEN
  2003. GetRecordTypeName (recordType,name);
  2004. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2005. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2006. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2007. NEW(registerUsageCount);
  2008. usedRegisters := NIL;
  2009. dst := NewRegisterOperand (addressType);
  2010. src := NewRegisterOperand (addressType);
  2011. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2012. Emit(Mov(position, dst, parameter1));
  2013. Emit(Mov(position, src, parameter2));
  2014. label := NewLabel();
  2015. SetLabel(label);
  2016. Emit(Push(position, dst));
  2017. Emit(Push(position, src));
  2018. GetRecordTypeName (recordType,name);
  2019. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2020. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2021. Emit(Call(position, op, 0));
  2022. Emit(Pop(position, src));
  2023. Emit(Pop(position, dst));
  2024. Emit(Add(position, dst, dst, ofs));
  2025. Emit(Add(position, src, src, ofs));
  2026. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2027. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2028. Emit(Exit(position,0,0));
  2029. END;
  2030. INC(statCoopAssignProcedure, section.pc);
  2031. ReturnToContext(context);
  2032. IF dump # NIL THEN dump := section.comments END;
  2033. END CreateAssignProcedure;
  2034. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2035. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2036. BEGIN
  2037. IF IsUnsafePointer (type) THEN
  2038. skip := NewLabel();
  2039. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2040. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2041. BreqL (skip, op, nil);
  2042. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2043. SetLabel (skip);
  2044. ELSIF SemanticChecker.IsPointerType (type) THEN
  2045. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2046. CallThis("GarbageCollector","Mark", 1);
  2047. ELSIF type.IsRecordType() THEN
  2048. Emit (Push(position,register));
  2049. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2050. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2051. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2052. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2053. ELSIF IsStaticArray(type) THEN
  2054. size := StaticArrayNumElements(type);
  2055. base := StaticArrayBaseType(type);
  2056. IF base.IsRecordType() THEN
  2057. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2058. Emit (Push(position, register));
  2059. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2060. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2061. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2062. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2063. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2064. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2065. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2066. Emit (Push(position, register));
  2067. CallThis("GarbageCollector","MarkDelegateArray", 2);
  2068. ELSE
  2069. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2070. Emit (Push(position, register));
  2071. CallThis("GarbageCollector","MarkPointerArray", 2);
  2072. ASSERT(base.IsPointer());
  2073. END;
  2074. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2075. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2076. CallThis("GarbageCollector","Mark", 1);
  2077. ELSE HALT(100); (* missing ? *)
  2078. END;
  2079. END CallTraceMethod;
  2080. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2081. VAR name, pointer: Basic.SegmentedName; previousSection,source: IntermediateCode.Section;
  2082. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType; size: LONGINT; base: SyntaxTree.Type;
  2083. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2084. BEGIN
  2085. previousSection := section;
  2086. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2087. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2088. GetRecordTypeName (recordType,name);
  2089. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2090. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2091. IF dump # NIL THEN dump := section.comments END;
  2092. variable := recordType.recordScope.firstVariable;
  2093. WHILE variable # NIL DO
  2094. IF variable.NeedsTrace() THEN
  2095. register := NewRegisterOperand (addressType);
  2096. Emit (Mov(position,register,parameter1));
  2097. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2098. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2099. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2100. END;
  2101. CallTraceMethod(register, variable.type);
  2102. ReleaseIntermediateOperand(register);
  2103. END;
  2104. variable := variable.nextVariable;
  2105. END;
  2106. recordBase := recordType.GetBaseRecord();
  2107. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2108. recordBase := recordBase.GetBaseRecord();
  2109. END;
  2110. IF recordBase # NIL THEN
  2111. GetRecordTypeName (recordBase,name);
  2112. IF HasExplicitTraceMethod (recordBase) THEN
  2113. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2114. ELSE
  2115. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2116. END;
  2117. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2118. Emit(Br(position,op));
  2119. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2120. Emit(Exit(position,0,0));
  2121. ELSE
  2122. IF recordType.isObject THEN
  2123. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2124. ELSE
  2125. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2126. END;
  2127. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2128. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2129. Emit(Br(position,op));
  2130. END;
  2131. IF ~recordType.isObject THEN
  2132. GetRecordTypeName (recordType,name);
  2133. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2134. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2135. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2136. NEW(registerUsageCount);
  2137. usedRegisters := NIL;
  2138. IF dump # NIL THEN dump := section.comments END;
  2139. register := NewRegisterOperand (addressType);
  2140. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2141. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2142. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2143. END;
  2144. Emit (Push(position,register));
  2145. GetRecordTypeName (recordType,name);
  2146. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2147. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2148. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2149. ReleaseIntermediateOperand(register);
  2150. Emit(Exit(position,0,0));
  2151. GetRecordTypeName (recordType,name);
  2152. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2153. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2154. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2155. NEW(registerUsageCount);
  2156. usedRegisters := NIL;
  2157. register := NewRegisterOperand (addressType);
  2158. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2159. Emit(Mov(position, register, parameter1));
  2160. label := NewLabel();
  2161. SetLabel(label);
  2162. Emit(Push(position, register));
  2163. GetRecordTypeName (recordType,name);
  2164. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2165. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2166. Emit(Call(position, op, 0));
  2167. Emit(Pop(position, register));
  2168. Emit(Add(position, register, register, ofs));
  2169. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2170. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2171. Emit(Exit(position,0,0));
  2172. END;
  2173. INC(statCoopTraceMethod, section.pc);
  2174. ReturnToContext(context);
  2175. IF dump # NIL THEN dump := section.comments END;
  2176. END CreateTraceMethod;
  2177. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2178. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2179. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType; size: LONGINT;
  2180. parameter1, parameter0: IntermediateCode.Operand; label: Label; previousUsedRegisters: RegisterEntry;
  2181. previousRegisterUsageCount: RegisterUsageCount; context: Context;
  2182. BEGIN
  2183. IF recordType.isObject THEN RETURN END;
  2184. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2185. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2186. GetRecordTypeName (recordType,name);
  2187. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2188. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2189. IF dump # NIL THEN dump := section.comments END;
  2190. variable := recordType.recordScope.firstVariable;
  2191. WHILE variable # NIL DO
  2192. IF variable.NeedsTrace() THEN
  2193. dst := NewRegisterOperand (addressType);
  2194. Emit (Mov(position, dst, parameter1));
  2195. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2196. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2197. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2198. END;
  2199. CallResetProcedure(dst, nil, variable.type);
  2200. ReleaseIntermediateOperand(dst);
  2201. END;
  2202. variable := variable.nextVariable;
  2203. END;
  2204. recordBase := recordType.GetBaseRecord();
  2205. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2206. GetRecordTypeName (recordBase,name);
  2207. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2208. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2209. Emit(Br(position,op));
  2210. ELSE
  2211. Emit(Exit(position,0,0));
  2212. END;
  2213. GetRecordTypeName (recordType,name);
  2214. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2215. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2216. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2217. NEW(registerUsageCount);
  2218. usedRegisters := NIL;
  2219. dst := NewRegisterOperand (addressType);
  2220. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2221. Emit(Mov(position, dst, parameter1));
  2222. label := NewLabel();
  2223. SetLabel(label);
  2224. Emit(Push(position, dst));
  2225. GetRecordTypeName (recordType,name);
  2226. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2227. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2228. Emit(Call(position, op, 0));
  2229. Emit(Pop(position, dst));
  2230. Emit(Add(position, dst, dst, ofs));
  2231. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2232. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2233. Emit(Exit(position,0,0));
  2234. INC(statCoopResetProcedure, section.pc);
  2235. ReturnToContext(context);
  2236. IF dump # NIL THEN dump := section.comments END;
  2237. END CreateResetProcedure;
  2238. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2239. VAR name: Basic.SegmentedName; context: Context;
  2240. BEGIN
  2241. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2242. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2243. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2244. IF dump # NIL THEN dump := section.comments END;
  2245. Emit(Push(position,fp));
  2246. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2247. ResetVariables(scope);
  2248. Emit(Pop(position,fp));
  2249. Emit(Exit(position,0,0));
  2250. ReturnToContext(context);
  2251. IF dump # NIL THEN dump := section.comments END;
  2252. END CreateResetMethod;
  2253. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2254. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2255. BEGIN
  2256. IF SemanticChecker.IsPointerType (type) THEN
  2257. Emit (Push(position, dest));
  2258. CallThis("GarbageCollector","Reset", 1);
  2259. ELSIF type.IsRecordType() THEN
  2260. Emit (Push(position, dest));
  2261. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2262. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2263. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2264. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2265. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2266. size := GetArrayLength(type, tag);
  2267. base := ArrayBaseType(type);
  2268. IF base.IsRecordType() THEN
  2269. Emit (Push(position, size));
  2270. Emit (Push(position, dest));
  2271. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2272. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2273. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2274. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2275. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2276. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2277. Emit (Push(position, size));
  2278. Emit (Push(position, dest));
  2279. CallThis("GarbageCollector","ResetDelegateArray", 2);
  2280. ELSE
  2281. Emit (Push(position, size));
  2282. Emit (Push(position, dest));
  2283. CallThis("GarbageCollector","ResetArray", 2);
  2284. ASSERT(ArrayBaseType(type).IsPointer());
  2285. END;
  2286. ReleaseIntermediateOperand(size);
  2287. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2288. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2289. Emit (Push(position, dest));
  2290. CallThis("GarbageCollector","ResetDelegate", 1);
  2291. ELSE HALT(100); (* missing ? *)
  2292. END;
  2293. END CallResetProcedure;
  2294. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2295. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2296. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2297. VAR operand: Operand;
  2298. BEGIN
  2299. Symbol (symbol, operand);
  2300. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2301. ReleaseOperand(operand);
  2302. END Reset;
  2303. BEGIN
  2304. previousScope := currentScope;
  2305. currentScope := scope;
  2306. pc := section.pc;
  2307. variable := scope.firstVariable;
  2308. WHILE variable # NIL DO
  2309. IF variable.NeedsTrace() THEN
  2310. Reset (variable);
  2311. END;
  2312. variable := variable.nextVariable;
  2313. END;
  2314. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2315. WHILE parameter # NIL DO
  2316. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2317. Reset (parameter);
  2318. END;
  2319. parameter := parameter.nextParameter;
  2320. END;
  2321. INC(statCoopResetVariables, section.pc - pc);
  2322. currentScope := previousScope;
  2323. END ResetVariables;
  2324. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2325. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2326. VAR op: IntermediateCode.Operand; context: Context;
  2327. BEGIN
  2328. previousSection := section;
  2329. GetCodeSectionNameForSymbol(procedure, name);
  2330. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2331. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2332. IF dump # NIL THEN dump := section.comments END;
  2333. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2334. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2335. Emit(Data(position,op));
  2336. Emit(Data(position,nil));
  2337. IF HasPointers (procedure.procedureScope) THEN
  2338. GetCodeSectionNameForSymbol(procedure, name);
  2339. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2340. ELSE
  2341. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2342. END;
  2343. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2344. Emit(Data(position,op));
  2345. ReturnToContext(context);
  2346. IF dump # NIL THEN dump := section.comments END;
  2347. END CreateProcedureDescriptor;
  2348. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2349. VAR import: SyntaxTree.Import;
  2350. s: Basic.MessageString;
  2351. selfName: SyntaxTree.IdentifierString;
  2352. BEGIN
  2353. moduleScope.ownerModule.GetName(selfName);
  2354. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2355. module := moduleScope.ownerModule
  2356. ELSE
  2357. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2358. IF import = NIL THEN
  2359. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),TRUE);
  2360. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2361. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2362. s := "Module ";
  2363. Strings.Append(s,moduleName);
  2364. Strings.Append(s," cannot be imported.");
  2365. IF force THEN
  2366. Error(position,s);
  2367. ELSIF canBeLoaded THEN
  2368. Strings.Append(s, "=> no dynamic linking.");
  2369. Warning(position, s);
  2370. canBeLoaded := FALSE;
  2371. END;
  2372. RETURN FALSE
  2373. ELSE
  2374. SELF.module.imports.AddName(moduleName)
  2375. END;
  2376. ELSIF import.module = NIL THEN (* already tried *)
  2377. RETURN FALSE
  2378. END;
  2379. module := import.module;
  2380. END;
  2381. RETURN TRUE
  2382. END AddImport;
  2383. (* needed for old binary object file format*)
  2384. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2385. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2386. BEGIN
  2387. IF AddImport(moduleName,module,TRUE) THEN
  2388. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2389. IF procedure = NIL THEN
  2390. s := "Instruction not supported on target, emulation procedure ";
  2391. Strings.Append(s,moduleName);
  2392. Strings.Append(s,".");
  2393. Strings.Append(s,procedureName);
  2394. Strings.Append(s," not present");
  2395. Error(position,s);
  2396. ELSE
  2397. StaticCallOperand(r,procedure);
  2398. ReleaseOperand(r);
  2399. fp := GetFingerprint(procedure);
  2400. END;
  2401. END;
  2402. END EnsureSymbol;
  2403. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2404. VAR exit: Label; trueL,falseL: Label;
  2405. BEGIN
  2406. trueL := NewLabel();
  2407. falseL := NewLabel();
  2408. exit := NewLabel();
  2409. Condition(x,trueL,falseL);
  2410. InitOperand(result,ModeValue);
  2411. SetLabel(trueL);
  2412. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2413. Emit(Mov(position,result.op,true));
  2414. BrL(exit);
  2415. SetLabel(falseL);
  2416. Emit(MovReplace(position,result.op,false));
  2417. SetLabel(exit);
  2418. END ConditionToValue;
  2419. PROCEDURE ValueToCondition(VAR op: Operand);
  2420. BEGIN
  2421. LoadValue(op,system.booleanType);
  2422. BrneL(trueLabel,op.op, false);
  2423. ReleaseOperand(op);
  2424. BrL(falseLabel);
  2425. END ValueToCondition;
  2426. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2427. VAR size: LONGINT;
  2428. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2429. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2430. BEGIN
  2431. ASSERT(type.form = SyntaxTree.Open);
  2432. baseType := type.arrayBase.resolved;
  2433. IF IsOpenArray(baseType) THEN
  2434. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2435. ELSE
  2436. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2437. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2438. END;
  2439. len := tag;
  2440. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2441. IntermediateCode.MakeMemory(len,addressType);
  2442. UseIntermediateOperand(len);
  2443. Reuse2(res,sizeOperand,len);
  2444. Emit(Mul(position,res,sizeOperand,len));
  2445. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2446. RETURN res
  2447. END GetArraySize;
  2448. BEGIN
  2449. type := type.resolved;
  2450. IF IsOpenArray(type) THEN
  2451. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2452. RETURN tag
  2453. ELSE
  2454. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2455. END;
  2456. ELSE
  2457. size := ToMemoryUnits(system,system.SizeOf(type));
  2458. RETURN IntermediateCode.Immediate(addressType,size)
  2459. END;
  2460. END GetDynamicSize;
  2461. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2462. VAR size: LONGINT;
  2463. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2464. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2465. BEGIN
  2466. ASSERT(type.form = SyntaxTree.Open);
  2467. baseType := type.arrayBase.resolved;
  2468. IF IsOpenArray(baseType) THEN
  2469. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2470. ELSE
  2471. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2472. END;
  2473. len := tag;
  2474. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2475. IntermediateCode.MakeMemory(len,addressType);
  2476. UseIntermediateOperand(len);
  2477. Reuse2(res,sizeOperand,len);
  2478. Emit(Mul(position,res,sizeOperand,len));
  2479. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2480. RETURN res
  2481. END GetLength;
  2482. BEGIN
  2483. type := type.resolved;
  2484. IF IsOpenArray(type) THEN
  2485. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2486. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2487. ELSE
  2488. RETURN IntermediateCode.Immediate(addressType,1)
  2489. END;
  2490. END GetArrayLength;
  2491. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2492. VAR result: IntermediateCode.Operand;
  2493. BEGIN
  2494. IF backend.cooperative THEN
  2495. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2496. ELSE
  2497. MakeMemory(result, tag, addressType, 0);
  2498. END;
  2499. RETURN result
  2500. END GetSizeFromTag;
  2501. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2502. VAR parameter: SyntaxTree.Parameter;
  2503. BEGIN
  2504. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2505. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2506. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2507. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2508. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2509. END;
  2510. RETURN GetDynamicSize(e.type, tag);
  2511. END GetArrayOfBytesSize;
  2512. (*
  2513. to find imported symbol. not needed ?
  2514. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2515. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2516. BEGIN
  2517. IF AddImport(moduleName,importedModule,FALSE) THEN
  2518. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2519. RETURN symbol
  2520. ELSE
  2521. RETURN NIL
  2522. END
  2523. END SymbolByName;
  2524. *)
  2525. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2526. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2527. BEGIN
  2528. IF AddImport(moduleName,runtimeModule,force) THEN
  2529. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2530. IF procedure = NIL THEN
  2531. s := "Procedure ";
  2532. Strings.Append(s,moduleName);
  2533. Strings.Append(s,".");
  2534. Strings.Append(s,procedureName);
  2535. Strings.Append(s," not present");
  2536. Error(position,s);
  2537. RETURN FALSE
  2538. ELSE
  2539. RETURN TRUE
  2540. END;
  2541. ELSE RETURN FALSE
  2542. END;
  2543. END GetRuntimeProcedure;
  2544. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2545. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2546. s: Basic.MessageString;
  2547. BEGIN
  2548. Basic.InitSegmentedName(name);
  2549. name[0] := Basic.MakeString(moduleName);
  2550. name[1] := Basic.MakeString(typeName);
  2551. name[2] := -1;
  2552. IF AddImport(moduleName,importedModule, FALSE) THEN
  2553. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2554. IF symbol = NIL THEN
  2555. s := "type ";
  2556. Strings.Append(s,moduleName);
  2557. Strings.Append(s,".");
  2558. Strings.Append(s,typeName);
  2559. Strings.Append(s," not present");
  2560. Error(position,s);
  2561. END;
  2562. ELSE symbol := NIL;
  2563. END;
  2564. IF importedModule = moduleScope.ownerModule THEN
  2565. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2566. ELSE
  2567. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2568. END;
  2569. RETURN symbol
  2570. END GetTypeDescriptor;
  2571. (* 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. *)
  2572. PROCEDURE CallThis(CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2573. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2574. pooledName: Basic.SegmentedName; size: LONGINT;
  2575. BEGIN
  2576. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2577. StaticCallOperand(result,procedure);
  2578. IF numberParameters < 0 THEN
  2579. size := ProcedureParametersSize(system,procedure);
  2580. ELSE
  2581. size := ToMemoryUnits(system,numberParameters * system.addressSize)
  2582. END;
  2583. Emit(Call(position, result.op, size));
  2584. ReleaseOperand(result);
  2585. ELSE (* only static linking possible *)
  2586. Basic.InitSegmentedName(pooledName);
  2587. pooledName[0] := Basic.MakeString(moduleName);
  2588. pooledName[1] := Basic.MakeString(procedureName);
  2589. pooledName[2] := -1;
  2590. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2591. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2592. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2593. END;
  2594. END CallThis;
  2595. (* call moduleName.procedureName if it can be imported, otherwise use altModuleName.altProcedureName *)
  2596. PROCEDURE CallThis2(CONST moduleName, procedureName,altModuleName, altProcedureName: ARRAY OF CHAR;numberParameters: LONGINT; return: IntermediateCode.Operand);
  2597. VAR procedure: SyntaxTree.Procedure; result: Operand; address: IntermediateCode.Operand; source: IntermediateCode.Section;
  2598. pooledName: Basic.SegmentedName;
  2599. BEGIN
  2600. ASSERT(numberParameters >= 0);
  2601. IF GetRuntimeProcedure(moduleName,procedureName,procedure,FALSE) THEN (* ready for dynamic linking *)
  2602. StaticCallOperand(result,procedure);
  2603. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  2604. Emit(Result(position,return));
  2605. ReleaseOperand(result);
  2606. ELSE (* only static linking possible *)
  2607. Basic.InitSegmentedName(pooledName);
  2608. pooledName[0] := Basic.MakeString(altModuleName);
  2609. pooledName[1] := Basic.MakeString(altProcedureName);
  2610. pooledName[2] := -1;
  2611. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2612. IntermediateCode.InitAddress(address, addressType, pooledName , 0, 0);
  2613. Emit(Call(position,address, ToMemoryUnits(system, numberParameters * system.addressSize)));
  2614. Emit(Result(position,return));
  2615. END;
  2616. END CallThis2;
  2617. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2618. VAR
  2619. left,right: Operand;
  2620. leftSize, rightSize: IntermediateCode.Operand;
  2621. procedure: SyntaxTree.Procedure;
  2622. saved: RegisterEntry;
  2623. reg: IntermediateCode.Operand;
  2624. procedureName: SyntaxTree.IdentifierString;
  2625. BEGIN
  2626. procedureName := "CompareString";
  2627. SaveRegisters();ReleaseUsedRegisters(saved);
  2628. Designate(leftExpression,left);
  2629. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2630. Emit(Push(position,leftSize));
  2631. ReleaseIntermediateOperand(leftSize);
  2632. Emit(Push(position,left.op));
  2633. ReleaseOperand(left);
  2634. Designate(rightExpression,right);
  2635. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2636. Emit(Push(position,rightSize));
  2637. ReleaseIntermediateOperand(rightSize);
  2638. Emit(Push(position,right.op));
  2639. ReleaseOperand(right);
  2640. IF backend.cooperative THEN
  2641. CallThis(DefaultRuntimeModuleName,procedureName, 4);
  2642. ELSE
  2643. CallThis(runtimeModuleName,procedureName, 4);
  2644. END;
  2645. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2646. Emit(Result(position,reg));
  2647. (*
  2648. AcquireThisRegister(int8,IntermediateCode.Result);
  2649. *)
  2650. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2651. (*
  2652. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2653. *)
  2654. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2655. ReleaseIntermediateOperand(reg);
  2656. BrL(falseLabel);
  2657. END CompareString;
  2658. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2659. VAR
  2660. left,right: Operand;
  2661. leftSize, rightSize: IntermediateCode.Operand;
  2662. procedure: SyntaxTree.Procedure;
  2663. saved: RegisterEntry;
  2664. procedureName: SyntaxTree.IdentifierString;
  2665. BEGIN
  2666. procedureName := "CopyString";
  2667. SaveRegisters();ReleaseUsedRegisters(saved);
  2668. Designate(leftExpression,left);
  2669. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2670. Emit(Push(position,leftSize));
  2671. ReleaseIntermediateOperand(leftSize);
  2672. Emit(Push(position,left.op));
  2673. ReleaseOperand(left);
  2674. Designate(rightExpression,right);
  2675. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2676. Emit(Push(position,rightSize));
  2677. ReleaseIntermediateOperand(rightSize);
  2678. Emit(Push(position,right.op));
  2679. ReleaseOperand(right);
  2680. IF backend.cooperative THEN
  2681. CallThis(DefaultRuntimeModuleName,procedureName, 4);
  2682. ELSE
  2683. CallThis(runtimeModuleName,procedureName,4);
  2684. END;
  2685. RestoreRegisters(saved);
  2686. END CopyString;
  2687. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2688. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2689. leftType,rightType: SyntaxTree.Type;
  2690. leftExpression,rightExpression : SyntaxTree.Expression;
  2691. componentType: IntermediateCode.Type;
  2692. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2693. size: LONGINT;
  2694. BEGIN
  2695. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2696. dest := destination; destination := emptyOperand;
  2697. leftType := x.left.type.resolved;
  2698. rightType := x.right.type.resolved;
  2699. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2700. CASE x.operator OF
  2701. Scanner.Or:
  2702. (* shortcut evaluation of left OR right *)
  2703. IF ~conditional THEN ConditionToValue(x);
  2704. ELSE
  2705. next := NewLabel();
  2706. Condition(x.left,trueLabel,next);
  2707. SetLabel(next);
  2708. Condition(x.right,trueLabel,falseLabel);
  2709. END;
  2710. |Scanner.And:
  2711. (* shortcut evaluation of left & right *)
  2712. IF ~conditional THEN ConditionToValue(x);
  2713. ELSE
  2714. next := NewLabel();
  2715. Condition(x.left,next,falseLabel);
  2716. SetLabel(next);
  2717. Condition(x.right,trueLabel,falseLabel);
  2718. END;
  2719. |Scanner.Is:
  2720. IF ~conditional THEN ConditionToValue(x);
  2721. ELSE
  2722. (* get type desc tag *)
  2723. IF IsPointerToRecord(leftType,recordType) THEN
  2724. Evaluate(x.left,left);
  2725. Dereference(left,recordType,IsUnsafePointer(leftType))
  2726. ELSE
  2727. Designate(x.left,left);
  2728. END;
  2729. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2730. ReleaseOperand(left);
  2731. END;
  2732. |Scanner.Plus:
  2733. Evaluate(x.left,left);
  2734. Evaluate(x.right,right);
  2735. IF leftType IS SyntaxTree.SetType THEN
  2736. InitOperand(result,ModeValue);
  2737. Reuse2a(result.op,left.op,right.op,dest);
  2738. Emit(Or(position,result.op,left.op,right.op));
  2739. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2740. InitOperand(result,ModeValue);
  2741. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2742. Reuse2(result.tag,left.tag,right.tag);
  2743. Emit(Add(position,result.op,left.op,right.op));
  2744. Emit(Add(position,result.tag,left.tag,right.tag))
  2745. ELSE
  2746. InitOperand(result,ModeValue);
  2747. Reuse2a(result.op,left.op,right.op,dest);
  2748. Emit(Add(position,result.op,left.op,right.op));
  2749. END;
  2750. ReleaseOperand(left); ReleaseOperand(right);
  2751. |Scanner.Minus:
  2752. Evaluate(x.left,left);
  2753. Evaluate(x.right,right);
  2754. IF leftType IS SyntaxTree.SetType THEN
  2755. InitOperand(result,ModeValue);
  2756. Reuse1(result.op,right.op);
  2757. Emit(Not(position,result.op,right.op));
  2758. ReleaseOperand(right);
  2759. Emit(And(position,result.op,result.op,left.op));
  2760. ReleaseOperand(left);
  2761. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2762. InitOperand(result,ModeValue);
  2763. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2764. Reuse2(result.tag,left.tag,right.tag);
  2765. Emit(Sub(position,result.op,left.op,right.op));
  2766. Emit(Sub(position,result.tag,left.tag,right.tag));
  2767. ReleaseOperand(left); ReleaseOperand(right)
  2768. ELSE
  2769. InitOperand(result,ModeValue);
  2770. Reuse2a(result.op,left.op,right.op,dest);
  2771. Emit(Sub(position,result.op,left.op,right.op));
  2772. ReleaseOperand(left); ReleaseOperand(right);
  2773. END;
  2774. |Scanner.Times:
  2775. Evaluate(x.left,left);
  2776. Evaluate(x.right,right);
  2777. IF leftType IS SyntaxTree.SetType THEN
  2778. InitOperand(result,ModeValue);
  2779. Reuse2a(result.op,left.op,right.op,dest);
  2780. Emit(And(position,result.op,left.op,right.op));
  2781. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2782. InitOperand(result,ModeValue);
  2783. Reuse1a(result.op,left.op,dest);
  2784. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2785. Emit(Shl(position,result.op,left.op,right.op));
  2786. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2787. InitOperand(result, ModeValue);
  2788. componentType := left.op.type;
  2789. (* TODO: review this *)
  2790. (*
  2791. result.op = left.op * right.op - left.tag * right.tag
  2792. result.tag = left.tag * right.op + left.op * right.tag
  2793. *)
  2794. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2795. Emit(Mul(position,result.op, left.op, right.op));
  2796. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2797. Emit(Mul(position,tempReg, left.tag, right.tag));
  2798. Emit(Sub(position,result.op, result.op, tempReg));
  2799. Reuse2(result.tag, left.tag, right.op);
  2800. Emit(Mul(position,result.tag, left.tag, right.op));
  2801. Emit(Mul(position,tempReg, left.op, right.tag));
  2802. Emit(Add(position,result.tag, result.tag, tempReg));
  2803. ReleaseIntermediateOperand(tempReg)
  2804. ELSE
  2805. InitOperand(result,ModeValue);
  2806. Reuse2a(result.op,left.op,right.op,dest);
  2807. Emit(Mul(position,result.op,left.op,right.op));
  2808. END;
  2809. ReleaseOperand(left); ReleaseOperand(right);
  2810. |Scanner.Div:
  2811. Evaluate(x.left,left);
  2812. Evaluate(x.right,right);
  2813. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2814. InitOperand(result,ModeValue);
  2815. Reuse1a(result.op,left.op,dest);
  2816. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2817. Emit(Shr(position,result.op,left.op,right.op));
  2818. ELSE
  2819. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2820. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2821. IF ~isUnchecked THEN
  2822. exit := NewLabel();
  2823. BrltL(exit,zero,right.op);
  2824. EmitTrap(position,NegativeDivisorTrap);
  2825. SetLabel(exit);
  2826. END;
  2827. END;
  2828. InitOperand(result,ModeValue);
  2829. Reuse2a(result.op,left.op,right.op,dest);
  2830. Emit(Div(position,result.op,left.op,right.op));
  2831. END;
  2832. ReleaseOperand(left); ReleaseOperand(right);
  2833. |Scanner.Mod:
  2834. Evaluate(x.left,left);
  2835. Evaluate(x.right,right);
  2836. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2837. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  2838. InitOperand(result,ModeValue);
  2839. Reuse1a(result.op,left.op,dest);
  2840. Emit(And(position,result.op,left.op,right.op));
  2841. ELSE
  2842. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2843. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2844. IF ~isUnchecked THEN
  2845. exit := NewLabel();
  2846. BrltL(exit,zero,right.op);
  2847. EmitTrap(position,NegativeDivisorTrap);
  2848. SetLabel(exit);
  2849. END;
  2850. END;
  2851. InitOperand(result,ModeValue);
  2852. Reuse2a(result.op,left.op,right.op,dest);
  2853. Emit(Mod(position,result.op,left.op,right.op));
  2854. END;
  2855. ReleaseOperand(left); ReleaseOperand(right);
  2856. |Scanner.Slash:
  2857. Evaluate(x.left,left);
  2858. Evaluate(x.right,right);
  2859. IF leftType IS SyntaxTree.SetType THEN
  2860. InitOperand(result,ModeValue);
  2861. Reuse2a(result.op,left.op,right.op,dest);
  2862. Emit(Xor(position,result.op,left.op,right.op));
  2863. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2864. InitOperand(result,ModeValue);
  2865. componentType := left.op.type;
  2866. (* review this *)
  2867. (*
  2868. divisor = right.op * right.op + right.tag * right.tag
  2869. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2870. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2871. *)
  2872. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2873. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2874. Emit(Mul(position,tempReg, right.op, right.op));
  2875. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2876. Emit(Add(position,tempReg, tempReg, tempReg2));
  2877. result.op := tempReg2;
  2878. Emit(Mul(position,result.op, left.op, right.op));
  2879. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2880. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2881. Emit(Add(position,result.op, result.op, tempReg2));
  2882. Emit(Div(position,result.op, result.op, tempReg));
  2883. Reuse2(result.tag, left.tag, right.op);
  2884. Emit(Mul(position,result.tag, left.tag, right.op));
  2885. Emit(Mul(position,tempReg2, left.op, right.tag));
  2886. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2887. Emit(Div(position,result.tag, result.tag, tempReg));
  2888. ReleaseIntermediateOperand(tempReg);
  2889. ReleaseIntermediateOperand(tempReg2)
  2890. ELSE
  2891. InitOperand(result,ModeValue);
  2892. Reuse2a(result.op,left.op,right.op,dest);
  2893. Emit(Div(position,result.op,left.op,right.op));
  2894. END;
  2895. ReleaseOperand(left); ReleaseOperand(right);
  2896. |Scanner.Equal:
  2897. IF ~conditional THEN ConditionToValue(x);
  2898. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2899. CompareString(BreqL,x.left,x.right);
  2900. ELSE
  2901. Evaluate(x.left,left);
  2902. Evaluate(x.right,right);
  2903. IF leftType IS SyntaxTree.RangeType THEN
  2904. ASSERT(rightType IS SyntaxTree.RangeType);
  2905. BrneL(falseLabel, left.op, right.op); (* first *)
  2906. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2907. BrneL(falseLabel, left.extra, right.extra); (* step *)
  2908. ReleaseOperand(left); ReleaseOperand(right);
  2909. BrL(trueLabel)
  2910. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  2911. BrneL(falseLabel, left.op, right.op); (* first *)
  2912. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2913. ReleaseOperand(left); ReleaseOperand(right);
  2914. BrL(trueLabel)
  2915. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2916. (* TODO: review this *)
  2917. BrneL(falseLabel, left.op, right.op); (* real part *)
  2918. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  2919. ReleaseOperand(left); ReleaseOperand(right);
  2920. BrL(trueLabel)
  2921. ELSE
  2922. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  2923. ReleaseOperand(left); ReleaseOperand(right);
  2924. BrL(trueLabel);
  2925. END;
  2926. END;
  2927. |Scanner.LessEqual:
  2928. IF ~conditional THEN ConditionToValue(x);
  2929. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2930. CompareString(BrgeL,x.right,x.left);
  2931. ELSE
  2932. Evaluate(x.left,left);
  2933. Evaluate(x.right,right);
  2934. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  2935. Reuse1(temp.op,right.op);
  2936. Emit(And(position,temp.op,left.op,right.op));
  2937. ReleaseOperand(right);
  2938. BreqL(trueLabel,temp.op,left.op);
  2939. BrL(falseLabel);
  2940. ReleaseOperand(temp);ReleaseOperand(left);
  2941. ELSE
  2942. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  2943. ReleaseOperand(left); ReleaseOperand(right);
  2944. BrL(trueLabel);
  2945. END;
  2946. END;
  2947. |Scanner.Less:
  2948. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  2949. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  2950. leftExpression.SetType(system.booleanType);
  2951. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  2952. rightExpression.SetType(system.booleanType);
  2953. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  2954. leftExpression.SetType(system.booleanType);
  2955. Expression(leftExpression);
  2956. ELSIF ~conditional THEN ConditionToValue(x);
  2957. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2958. CompareString(BrltL,x.left,x.right);
  2959. ELSE
  2960. Evaluate(x.left,left);
  2961. Evaluate(x.right,right);
  2962. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  2963. ReleaseOperand(left); ReleaseOperand(right);
  2964. BrL(trueLabel);
  2965. END;
  2966. |Scanner.Greater:
  2967. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  2968. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  2969. leftExpression.SetType(system.booleanType);
  2970. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  2971. rightExpression.SetType(system.booleanType);
  2972. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  2973. leftExpression.SetType(system.booleanType);
  2974. Expression(leftExpression);
  2975. ELSIF ~conditional THEN ConditionToValue(x);
  2976. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2977. CompareString(BrltL,x.right,x.left);
  2978. ELSE
  2979. Evaluate(x.left,left);
  2980. Evaluate(x.right,right);
  2981. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  2982. ReleaseOperand(left); ReleaseOperand(right);
  2983. BrL(trueLabel);
  2984. END;
  2985. |Scanner.GreaterEqual:
  2986. IF ~conditional THEN ConditionToValue(x);
  2987. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2988. CompareString(BrgeL,x.left,x.right);
  2989. ELSE
  2990. Evaluate(x.left,left);
  2991. Evaluate(x.right,right);
  2992. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  2993. Reuse1(temp.op,left.op);
  2994. Emit(And(position,temp.op,left.op,right.op));
  2995. ReleaseOperand(left);
  2996. BreqL(trueLabel, temp.op,right.op);
  2997. ReleaseOperand(temp); ReleaseOperand(right);
  2998. BrL(falseLabel);
  2999. ELSE
  3000. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3001. ReleaseOperand(left); ReleaseOperand(right);
  3002. BrL(trueLabel);
  3003. END;
  3004. END;
  3005. |Scanner.Unequal:
  3006. IF ~conditional THEN ConditionToValue(x);
  3007. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3008. CompareString(BrneL,x.left,x.right);
  3009. ELSE
  3010. Evaluate(x.left,left);
  3011. Evaluate(x.right,right);
  3012. IF leftType IS SyntaxTree.RangeType THEN
  3013. ASSERT(rightType IS SyntaxTree.RangeType);
  3014. BrneL(trueLabel, left.op, right.op); (* first *)
  3015. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3016. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3017. ReleaseOperand(left); ReleaseOperand(right);
  3018. BrL(falseLabel)
  3019. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3020. BrneL(trueLabel, left.op, right.op); (* first *)
  3021. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3022. ReleaseOperand(left); ReleaseOperand(right);
  3023. BrL(falseLabel)
  3024. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3025. (* TODO: review this *)
  3026. BrneL(trueLabel, left.op, right.op); (* real part *)
  3027. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3028. ReleaseOperand(left); ReleaseOperand(right);
  3029. BrL(falseLabel)
  3030. ELSE
  3031. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3032. ReleaseOperand(left); ReleaseOperand(right);
  3033. BrL(trueLabel);
  3034. END;
  3035. END;
  3036. |Scanner.In:
  3037. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3038. Evaluate(x.left,left);
  3039. Evaluate(x.right,right);
  3040. Convert(left.op,setType);
  3041. ReuseCopy(temp.op,right.op);
  3042. Emit(Shr(position,temp.op,temp.op,left.op));
  3043. ReleaseOperand(right); ReleaseOperand(left);
  3044. IntermediateCode.InitImmediate(one,setType,1);
  3045. Emit(And(position,temp.op,temp.op,one));
  3046. IF conditional THEN
  3047. IntermediateCode.InitImmediate(zero,setType,0);
  3048. BrneL(trueLabel,temp.op,zero);
  3049. ReleaseOperand(temp);
  3050. BrL(falseLabel);
  3051. ELSE
  3052. Convert(temp.op,bool);
  3053. result.mode := ModeValue;
  3054. result.op := temp.op;
  3055. result.tag := nil; (* may be left over from calls to evaluate *)
  3056. END;
  3057. |Scanner.Questionmarks:
  3058. Evaluate(x.left, left);
  3059. Emit(Push(position,left.op));
  3060. ReleaseOperand(left);
  3061. Designate(x.right, right);
  3062. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3063. IF ~backend.cellsAreObjects THEN
  3064. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3065. END;
  3066. Emit(Push(position,right.op));
  3067. ReleaseOperand(right);
  3068. IF backend.cellsAreObjects THEN
  3069. CallThis("ActiveCellsRuntime","ReceiveNonBlocking",-1);
  3070. ELSE
  3071. CallThis(ChannelModuleName,"ReceiveNonBlockingB",-1);
  3072. END;
  3073. InitOperand(result, ModeValue);
  3074. result.op := NewRegisterOperand(bool);
  3075. Emit(Result(position,result.op));
  3076. IF conditional THEN
  3077. IntermediateCode.InitImmediate(zero,setType,0);
  3078. BrneL(trueLabel,result.op,zero);
  3079. ReleaseOperand(result);
  3080. BrL(falseLabel);
  3081. END;
  3082. ELSE
  3083. HALT(100);
  3084. END;
  3085. destination := dest;
  3086. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3087. END VisitBinaryExpression;
  3088. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3089. VAR localResult, operand: Operand;
  3090. BEGIN
  3091. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3092. InitOperand(localResult, ModeValue);
  3093. ASSERT(x.first # NIL);
  3094. Evaluate(x.first, operand);
  3095. localResult.op := operand.op;
  3096. ReleaseOperand(operand);
  3097. UseIntermediateOperand(localResult.op);
  3098. ASSERT(x.last # NIL);
  3099. Evaluate(x.last, operand);
  3100. localResult.tag := operand.op;
  3101. ReleaseOperand(operand);
  3102. UseIntermediateOperand(localResult.tag);
  3103. IF x.step # NIL THEN
  3104. Evaluate(x.step, operand);
  3105. localResult.extra := operand.op;
  3106. ReleaseOperand(operand);
  3107. UseIntermediateOperand(localResult.extra);
  3108. END;
  3109. result := localResult;
  3110. IF Trace THEN TraceExit("VisitRangeExpression") END
  3111. END VisitRangeExpression;
  3112. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3113. BEGIN
  3114. HALT(100); (* should never be evaluated *)
  3115. END VisitTensorRangeExpression;
  3116. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3117. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3118. BEGIN
  3119. IF Trace THEN TraceEnter("VisitConversion") END;
  3120. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3121. dest := destination; destination := emptyOperand;
  3122. Evaluate(x.expression,old);
  3123. InitOperand(result,ModeValue);
  3124. result.op := old.op;
  3125. ASSERT(result.op.mode # 0);
  3126. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3127. (* convert TO a complex number *)
  3128. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3129. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3130. ASSERT(result.op.mode # 0);
  3131. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3132. (* convert FROM a complex number TO a complex number*)
  3133. result.tag := old.tag;
  3134. ASSERT(result.tag.mode # 0);
  3135. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3136. ASSERT(result.tag.mode # 0)
  3137. ELSE
  3138. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3139. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3140. END
  3141. ELSE
  3142. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3143. ASSERT(result.op.mode # 0);
  3144. result.tag := old.tag; (*! probably never used *)
  3145. END;
  3146. destination := dest;
  3147. IF Trace THEN TraceExit("VisitConversion") END;
  3148. END VisitConversion;
  3149. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3150. BEGIN
  3151. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3152. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3153. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3154. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3155. END VisitTypeDeclaration;
  3156. (** designators (expressions) *)
  3157. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3158. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3159. BEGIN
  3160. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3161. IF x.left # NIL THEN Expression(x.left) END;
  3162. Symbol(x.symbol,result);
  3163. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3164. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3165. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3166. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3167. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3168. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3169. END;
  3170. END;
  3171. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3172. END VisitSymbolDesignator;
  3173. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3174. BEGIN
  3175. IF isUnchecked THEN RETURN END;
  3176. IF tagsAvailable THEN
  3177. TrapC(BrltL,index,length,IndexCheckTrap);
  3178. END;
  3179. END BoundCheck;
  3180. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3181. VAR d: IntermediateCode.Operand;
  3182. BEGIN
  3183. IF isUnchecked THEN RETURN END;
  3184. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3185. TrapC(op,dim,d,ArraySizeTrap);
  3186. ReleaseIntermediateOperand(d);
  3187. END DimensionCheck;
  3188. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3189. VAR
  3190. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3191. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3192. expression: SyntaxTree.Expression;
  3193. resultingType, leftType, baseType: SyntaxTree.Type;
  3194. skipLabel1, skipLabel2: Label;
  3195. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3196. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3197. variableOp: Operand;
  3198. variable: SyntaxTree.Variable;
  3199. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3200. VAR index: LONGINT; expression: SyntaxTree.Expression;
  3201. BEGIN
  3202. (* count the number of indices, ranges and tensorRanges in the index list *)
  3203. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3204. FOR i := 0 TO parameters.Length() - 1 DO
  3205. expression := parameters.GetExpression(i);
  3206. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3207. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3208. ELSE INC(indexCount)
  3209. END
  3210. END;
  3211. END CountIndices;
  3212. BEGIN
  3213. ASSERT(tagsAvailable);
  3214. resultingType := x.type.resolved; (* resulting type *)
  3215. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3216. InitOperand(localResult, ModeReference);
  3217. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3218. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3219. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3220. (* a globally defined array destination tag is available -> use and invalidate it*)
  3221. localResult.tag := arrayDestinationTag;
  3222. IntermediateCode.InitOperand(arrayDestinationTag)
  3223. ELSE
  3224. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3225. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3226. Symbol(variable, variableOp);
  3227. ReuseCopy(localResult.tag, variableOp.op);
  3228. ReleaseOperand(variableOp);
  3229. END
  3230. END;
  3231. indexListSize := x.parameters.Length();
  3232. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3233. ASSERT(tensorRangeCount <= 1);
  3234. (* designate the array to be indexed over, perform tensor range check if known *)
  3235. Designate(x.left, array);
  3236. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3237. Dereference(array, leftType,FALSE);
  3238. IF tensorRangeCount=0 THEN
  3239. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3240. END
  3241. END;
  3242. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3243. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3244. srcDimOffset := -indexListSize;
  3245. destDimOffset := -rangeCount
  3246. ELSE
  3247. srcDimOffset := 0;
  3248. destDimOffset := 0
  3249. END;
  3250. indexDim := 0;
  3251. (* use address of source array as basis *)
  3252. (*
  3253. ReuseCopy(localResult.op, array.op);
  3254. *)
  3255. localResult.op := array.op;
  3256. UseIntermediateOperand(localResult.op);
  3257. (* go through the index list *)
  3258. FOR i := 0 TO indexListSize - 1 DO
  3259. expression := x.parameters.GetExpression(i);
  3260. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3261. (* nothing to do *)
  3262. ELSE
  3263. (* determine which dimension of source array is currently looked at *)
  3264. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3265. (* get the memory operand pointing to array descriptor dimension *)
  3266. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3267. (* make a reusable register from it *)
  3268. ReuseCopy(srcDim, tmp);
  3269. ReleaseIntermediateOperand(tmp);
  3270. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3271. ELSE
  3272. srcDim := IntermediateCode.Immediate(int32, i)
  3273. END;
  3274. (* get length and increment of source array for current dimension *)
  3275. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3276. Convert(sourceLength.op, sizeType);
  3277. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3278. Convert(sourceIncrement.op, sizeType);
  3279. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3280. ReleaseIntermediateOperand(srcDim);
  3281. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3282. (* SINGLE INDEX *)
  3283. Evaluate(expression, index);
  3284. ReleaseIntermediateOperand(index.tag);
  3285. index.tag := emptyOperand;
  3286. Convert(index.op, sizeType);
  3287. (* lower bound check *)
  3288. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3289. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3290. ELSIF isUnchecked THEN (* do nothing *)
  3291. ELSE
  3292. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3293. END;
  3294. (* upper bound check *)
  3295. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3296. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3297. ELSIF isUnchecked THEN (* do nothing *)
  3298. ELSE
  3299. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3300. END;
  3301. ReleaseOperand(sourceLength);
  3302. Convert(index.op, addressType);
  3303. summand := index.op;
  3304. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3305. (* RANGE OF INDICES *)
  3306. Evaluate(expression, range);
  3307. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3308. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3309. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3310. ReleaseOperand(range);
  3311. Convert(firstIndex, sizeType);
  3312. Convert(lastIndex, sizeType);
  3313. Convert(stepSize, sizeType);
  3314. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3315. if it is 'MAX(LONGINT)' *)
  3316. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3317. TransferToRegister(lastIndex, lastIndex);
  3318. skipLabel1 := NewLabel();
  3319. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3320. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3321. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3322. SetLabel(skipLabel1)
  3323. END;
  3324. (* check if step size is valid *)
  3325. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3326. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3327. ELSIF isUnchecked THEN (* do nothing *)
  3328. ELSE
  3329. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3330. END;
  3331. (* check lower bound check *)
  3332. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3333. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3334. ELSIF isUnchecked THEN (* do nothing *)
  3335. ELSE
  3336. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3337. END;
  3338. (* check upper bound check *)
  3339. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3340. (* statically open range: nothing to do *)
  3341. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3342. ASSERT(staticLastIndex < staticSourceLength)
  3343. ELSIF isUnchecked THEN (* do nothing *)
  3344. ELSE
  3345. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3346. END;
  3347. (* determine length of target array for current dimension *)
  3348. (* 1. incorporate last index: *)
  3349. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3350. (* last index is static *)
  3351. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3352. targetLength := sourceLength.op
  3353. ELSE
  3354. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3355. END;
  3356. UseIntermediateOperand(targetLength);
  3357. ELSE
  3358. (* targetLength := lastIndex + 1
  3359. Reuse1(targetLength, lastIndex);
  3360. *)
  3361. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3362. END;
  3363. ReleaseOperand(sourceLength);
  3364. ReleaseIntermediateOperand(lastIndex);
  3365. (* 2. incorporate first index: *)
  3366. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3367. (* first index and current target length are static *)
  3368. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3369. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3370. (* first index = 0: nothing to do *)
  3371. ELSE
  3372. (* targetLength := targetLength - firstIndex *)
  3373. TransferToRegister(targetLength, targetLength);
  3374. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3375. END;
  3376. (* clip negative lengths to 0 *)
  3377. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3378. IF staticTargetLength < 0 THEN
  3379. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3380. END
  3381. ELSE
  3382. skipLabel1 := NewLabel();
  3383. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3384. TransferToRegister(targetLength, targetLength);
  3385. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3386. SetLabel(skipLabel1)
  3387. END;
  3388. (* 3. incorporate index step size: *)
  3389. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3390. (*step size and current target length are static *)
  3391. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3392. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3393. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3394. (* step size = 1: nothing to do *)
  3395. ELSE
  3396. (* emit code for this:
  3397. targetLength := (targetLength-1) DIV stepSize +1;
  3398. *)
  3399. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3400. DivInt(targetLength, targetLength, stepSize);
  3401. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3402. END;
  3403. (* determine increment of target array for current dimension *)
  3404. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3405. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3406. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3407. (* step size = 1 *)
  3408. targetIncrement := sourceIncrement.op;
  3409. UseIntermediateOperand(targetIncrement)
  3410. ELSE
  3411. (* targetIncrement := sourceIncrement * stepSize *)
  3412. Reuse1(targetIncrement, stepSize);
  3413. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3414. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3415. END;
  3416. ReleaseIntermediateOperand(stepSize);
  3417. (* write length and increment of target array to descriptor *)
  3418. IF destDimOffset < 0 THEN
  3419. (* determine which dimension of target array is currently looked at *)
  3420. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3421. TransferToRegister(destDim, tmp);
  3422. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3423. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3424. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3425. ReleaseIntermediateOperand(destDim)
  3426. ELSE
  3427. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3428. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3429. END;
  3430. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3431. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3432. INC(indexDim);
  3433. Convert(firstIndex, addressType);
  3434. TransferToRegister(summand, firstIndex);
  3435. ELSE HALT(100);
  3436. END;
  3437. (*
  3438. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3439. *)
  3440. Convert(sourceIncrement.op, addressType);
  3441. Convert(summand, addressType);
  3442. MulInt(summand, summand, sourceIncrement.op);
  3443. ReleaseIntermediateOperand(sourceIncrement.op);
  3444. AddInt(localResult.op, localResult.op, summand);
  3445. ReleaseIntermediateOperand(summand);
  3446. END
  3447. END;
  3448. result := localResult;
  3449. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3450. ReleaseIntermediateOperand(result.tag);
  3451. result.tag := TypeDescriptorAdr(resultingType);
  3452. IF ~newObjectFile THEN
  3453. IntermediateCode.MakeMemory(result.tag,addressType);
  3454. END;
  3455. ELSIF IsDelegate(resultingType) THEN
  3456. ReleaseIntermediateOperand(result.tag);
  3457. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3458. UseIntermediateOperand(result.tag);
  3459. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3460. ReleaseIntermediateOperand(result.tag);
  3461. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3462. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3463. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3464. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3465. (* finalize target array descriptor *)
  3466. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3467. (* write lengths and increments of target array for remaining dimensions *)
  3468. i := indexListSize;
  3469. WHILE indexDim < targetArrayDimensionality DO
  3470. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3471. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3472. ReleaseOperand(sourceLength);
  3473. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3474. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3475. ReleaseOperand(sourceIncrement);
  3476. INC(i); INC(indexDim);
  3477. END;
  3478. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3479. tmp := nil;
  3480. ELSE
  3481. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3482. END;
  3483. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3484. ReleaseIntermediateOperand(tmp);
  3485. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3486. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3487. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3488. ELSE
  3489. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3490. END;
  3491. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3492. ReleaseIntermediateOperand(tmp);
  3493. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3494. (* write dimensionality *)
  3495. IF targetArrayDimensionality # 0 THEN
  3496. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3497. END;
  3498. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3499. END;
  3500. ReleaseOperand(array);
  3501. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3502. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3503. END;
  3504. END MathIndexDesignator;
  3505. (* TENTATIVE *)
  3506. PROCEDURE DumpOperand(operand: Operand);
  3507. BEGIN
  3508. D.Log.String(" op = ");
  3509. IntermediateCode.DumpOperand(D.Log, operand.op );
  3510. D.Log.Ln;
  3511. D.Log.String(" tag = ");
  3512. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3513. D.Log.Ln;
  3514. D.Log.String(" extra = ");
  3515. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3516. D.Log.Ln;
  3517. D.Log.Update
  3518. END DumpOperand;
  3519. (* get the length of an array , trying to make use of static information *)
  3520. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3521. VAR res: IntermediateCode.Operand; size: LONGINT;
  3522. BEGIN
  3523. type := type.resolved;
  3524. IF type IS SyntaxTree.ArrayType THEN
  3525. WITH type: SyntaxTree.ArrayType DO
  3526. IF type.form = SyntaxTree.Static THEN
  3527. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3528. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3529. Evaluate(type.length, op);
  3530. ReleaseIntermediateOperand(op.tag);
  3531. RETURN op.op;*)
  3532. ELSE
  3533. res := tag;
  3534. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3535. IntermediateCode.MakeMemory(res,addressType);
  3536. UseIntermediateOperand(res);
  3537. RETURN res
  3538. END
  3539. END;
  3540. ELSE
  3541. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3542. RETURN IntermediateCode.Immediate(addressType,size);
  3543. END;
  3544. END ArrayLength;
  3545. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3546. VAR oldReg: LONGINT;
  3547. BEGIN
  3548. ReleaseIntermediateOperand(res);
  3549. IF IsImmediate(x) & IsImmediate(y) THEN
  3550. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3551. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3552. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3553. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3554. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3555. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3556. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3557. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3558. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3559. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3560. UseIntermediateOperand(res);
  3561. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3562. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3563. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3564. UseIntermediateOperand(res);
  3565. ELSE
  3566. IF ~ReusableRegister(res) THEN
  3567. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3568. ELSE
  3569. UseIntermediateOperand(res);
  3570. END;
  3571. IF IsImmediate(x) & (x.intValue = 0) THEN
  3572. Emit(Mov(position,res,y))
  3573. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3574. Emit(Mov(position,res,x))
  3575. ELSE
  3576. Emit(Add(position,res, x, y));
  3577. END;
  3578. END;
  3579. END AddInt;
  3580. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3581. BEGIN
  3582. ReleaseIntermediateOperand(res);
  3583. IF IsImmediate(x) & IsImmediate(y) THEN
  3584. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3585. ELSE
  3586. IF ~ReusableRegister(res) THEN
  3587. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3588. ELSE UseIntermediateOperand(res);
  3589. END;
  3590. IF IsImmediate(x) & (x.intValue = 1) THEN
  3591. Emit(Mov(position,res,y))
  3592. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3593. Emit(Mov(position,res,x))
  3594. ELSE
  3595. Emit(Mul(position,res, x, y));
  3596. END;
  3597. END;
  3598. END MulInt;
  3599. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3600. BEGIN
  3601. ReleaseIntermediateOperand(res);
  3602. IF IsImmediate(x) & IsImmediate(y) THEN
  3603. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3604. ELSE
  3605. IF ~ReusableRegister(res) THEN
  3606. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3607. ELSE UseIntermediateOperand(res);
  3608. END;
  3609. IF IsImmediate(x) & (x.intValue = 1) THEN
  3610. Emit(Mov(position,res,y))
  3611. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3612. Emit(Mov(position,res,x))
  3613. ELSE
  3614. Emit(Div(position,res, x, y));
  3615. END;
  3616. END;
  3617. END DivInt;
  3618. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3619. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3620. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3621. BEGIN
  3622. type := x.left.type.resolved;
  3623. IF type IS SyntaxTree.StringType THEN
  3624. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3625. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3626. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3627. type := atype;
  3628. x.left.SetType(type);
  3629. END;
  3630. IntermediateCode.InitImmediate(res,addressType,0);
  3631. maxDim := x.parameters.Length()-1;
  3632. FOR i := 0 TO maxDim DO
  3633. e := x.parameters.GetExpression(i);
  3634. Evaluate(e,index);
  3635. Convert(index.op,addressType);
  3636. AddInt(res, res, index.op);
  3637. IF i = 0 THEN
  3638. (*
  3639. ReuseCopy(res, index.op);
  3640. *)
  3641. Designate(x.left,array);
  3642. type := x.left.type.resolved;
  3643. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3644. Dereference(array, type, FALSE);
  3645. END;
  3646. (*
  3647. ELSE AddInt(res, res, index.op);
  3648. *)
  3649. END;
  3650. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3651. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3652. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3653. BoundCheck(index.op, length);
  3654. END;
  3655. ReleaseIntermediateOperand(length);
  3656. END;
  3657. ReleaseOperand(index);
  3658. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3659. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3660. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3661. MulInt(res,res,length);
  3662. END;
  3663. ReleaseIntermediateOperand(length);
  3664. END;
  3665. IF (type IS SyntaxTree.ArrayType) THEN
  3666. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3667. size := StaticSize(system, type);
  3668. IF size # 1 THEN
  3669. length := IntermediateCode.Immediate(addressType,size);
  3670. MulInt(res,res,length);
  3671. END;
  3672. ELSE
  3673. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3674. IF size # 1 THEN
  3675. length := IntermediateCode.Immediate(addressType,size);
  3676. MulInt(res,res,length);
  3677. END;
  3678. END;
  3679. END;
  3680. AddInt(res,res,array.op);
  3681. InitOperand(result,ModeReference);
  3682. result.op := res;
  3683. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3684. ReleaseIntermediateOperand(result.tag);
  3685. result.tag := TypeDescriptorAdr(type);
  3686. IF ~newObjectFile THEN
  3687. IntermediateCode.MakeMemory(result.tag,addressType);
  3688. END
  3689. ELSIF IsDelegate(type) THEN
  3690. ReleaseIntermediateOperand(result.tag);
  3691. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3692. UseIntermediateOperand(result.tag);
  3693. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3694. ReleaseIntermediateOperand(result.tag);
  3695. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3696. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3697. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3698. END;
  3699. ReleaseOperand(array);
  3700. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3701. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3702. END;
  3703. END IndexDesignator;
  3704. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3705. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3706. BEGIN
  3707. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3708. dest := destination; destination := emptyOperand;
  3709. type := x.left.type.resolved;
  3710. IF type IS SyntaxTree.MathArrayType THEN
  3711. MathIndexDesignator(x);
  3712. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3713. IndexDesignator(x);
  3714. END;
  3715. destination := dest;
  3716. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3717. END VisitIndexDesignator;
  3718. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3719. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3720. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3721. procedure: SyntaxTree.Procedure;
  3722. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3723. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3724. BEGIN
  3725. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3726. parameters := expression.parameters;
  3727. moduleName := "FoxArrayBase";
  3728. procedureName := "CopyDescriptor";
  3729. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3730. SaveRegisters();ReleaseUsedRegisters(saved);
  3731. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3732. IF procedure = NIL THEN
  3733. s := "procedure ";
  3734. Strings.Append(s,moduleName);
  3735. Strings.Append(s,".");
  3736. Strings.Append(s,procedureName);
  3737. Strings.Append(s," not present");
  3738. Error(position,s);
  3739. ELSE
  3740. (* push address of temporary variable *)
  3741. Symbol(variable,destOperand);
  3742. Emit(Push(position,destOperand.op));
  3743. ReleaseOperand(destOperand);
  3744. (* push src *)
  3745. Evaluate(expression.left,srcOperand);
  3746. (*
  3747. Dereference(srcOperand,expression.type.resolved);
  3748. Emit(Push(position,srcOperand.tag));
  3749. *)
  3750. Emit(Push(position,srcOperand.op));
  3751. ReleaseOperand(srcOperand);
  3752. tensorFound := FALSE;
  3753. FOR i := 0 TO parameters.Length()-1 DO
  3754. e := parameters.GetExpression(i);
  3755. IF e IS SyntaxTree.TensorRangeExpression THEN
  3756. tensorFound := TRUE;
  3757. ELSIF e IS SyntaxTree.RangeExpression THEN
  3758. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3759. ELSE
  3760. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3761. END;
  3762. END;
  3763. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  3764. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  3765. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  3766. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  3767. StaticCallOperand(procOp,procedure);
  3768. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  3769. ReleaseOperand(procOp);
  3770. END;
  3771. RestoreRegisters(saved);
  3772. END;
  3773. RETURN variable
  3774. END PrepareTensorDescriptor;
  3775. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  3776. VAR
  3777. type, descriptorType, baseType: SyntaxTree.Type;
  3778. operand, tmpOperand, variableOp, variable2Op: Operand;
  3779. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  3780. variable, variable2: SyntaxTree.Variable;
  3781. dim, i, size: LONGINT;
  3782. (* TODO: needed? *)
  3783. oldArrayDestinationTag: IntermediateCode.Operand;
  3784. oldArrayDestinationDimension: LONGINT;
  3785. position: LONGINT;
  3786. saved: RegisterEntry;
  3787. PROCEDURE Pass(op: IntermediateCode.Operand);
  3788. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  3789. BEGIN
  3790. IF numberRegister >= 0 THEN
  3791. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  3792. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  3793. Emit(Mov(position,parameterRegister, op));
  3794. ELSE
  3795. Emit(Push(position,op))
  3796. END
  3797. END Pass;
  3798. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  3799. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  3800. BEGIN
  3801. formalType := formalType.resolved; actualType := actualType.resolved;
  3802. IF IsOpenArray(formalType)THEN
  3803. IF actualType IS SyntaxTree.StringType THEN
  3804. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  3805. RETURN;
  3806. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  3807. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  3808. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  3809. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  3810. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  3811. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3812. ELSE
  3813. tmp := baseReg;
  3814. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  3815. IntermediateCode.MakeMemory(tmp,addressType);
  3816. Pass((tmp));
  3817. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3818. END;
  3819. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  3820. END;
  3821. END PushArrayLens;
  3822. BEGIN
  3823. IF Trace THEN TraceEnter("PushParameter") END;
  3824. position := expression.position;
  3825. IF expression.resolved # NIL THEN expression := expression.resolved END;
  3826. type := expression.type.resolved;
  3827. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  3828. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  3829. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  3830. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  3831. );
  3832. (* TODO: needed? *)
  3833. oldArrayDestinationTag := arrayDestinationTag;
  3834. oldArrayDestinationDimension := arrayDestinationDimension;
  3835. IF IsArrayOfSystemByte(parameter.type) THEN
  3836. Designate(expression,operand);
  3837. tmp := GetArrayOfBytesSize(expression,operand.tag);
  3838. ReleaseIntermediateOperand(operand.tag);
  3839. operand.tag := tmp;
  3840. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3841. Pass((operand.tag));
  3842. END;
  3843. Pass((operand.op));
  3844. ELSIF IsOpenArray(parameter.type) THEN
  3845. Designate(expression,operand);
  3846. baseReg := operand.tag;
  3847. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3848. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  3849. END;
  3850. Pass((operand.op)); (* address of the array *)
  3851. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  3852. (* case 1 *)
  3853. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  3854. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  3855. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3856. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  3857. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  3858. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3859. arrayDestinationTag := sp;
  3860. (* case 1b *)
  3861. IF expression IS SyntaxTree.IndexDesignator THEN
  3862. (*
  3863. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3864. descriptorType := GetMathArrayDescriptorType(dim);
  3865. variable := GetTemporaryVariable(descriptorType,expression.position);
  3866. Symbol(variable,variableOp);
  3867. arrayDestinationTag := variableOp.op;
  3868. *)
  3869. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  3870. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3871. arrayDestinationDimension := dim;
  3872. Designate(expression,operand);
  3873. (* case 1a *)
  3874. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  3875. Designate(expression,operand);
  3876. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  3877. i := 0;
  3878. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  3879. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  3880. INC(i);
  3881. END;
  3882. type := expression.type.resolved;
  3883. WHILE (i<dim) DO (* remaining static dimensions *)
  3884. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3885. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  3886. ReleaseOperand(tmpOperand);
  3887. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3888. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  3889. ReleaseOperand(tmpOperand);
  3890. INC(i);
  3891. END;
  3892. dimOp := IntermediateCode.Immediate(addressType,dim);
  3893. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  3894. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  3895. (* case 1d *)
  3896. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3897. Designate(expression,operand);
  3898. Dereference(operand,type.resolved,FALSE);
  3899. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  3900. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  3901. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  3902. (* case 1f *)
  3903. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3904. Designate(expression,operand);
  3905. FOR i := 0 TO dim-1 DO
  3906. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3907. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  3908. ReleaseOperand(tmpOperand);
  3909. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3910. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  3911. ReleaseOperand(tmpOperand);
  3912. END;
  3913. dimOp := IntermediateCode.Immediate(addressType,dim);
  3914. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  3915. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  3916. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  3917. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  3918. baseType := SemanticChecker.ArrayBase(type,dim);
  3919. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3920. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  3921. ELSE HALT(100);
  3922. END;
  3923. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  3924. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3925. (* case 2b *)
  3926. IF expression IS SyntaxTree.IndexDesignator THEN
  3927. descriptorType := GetMathArrayDescriptorType(dim);
  3928. variable := GetTemporaryVariable(descriptorType, FALSE);
  3929. Symbol(variable,variableOp);
  3930. arrayDestinationTag := variableOp.op;
  3931. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  3932. arrayDestinationDimension := dim;
  3933. NeedDescriptor := TRUE;
  3934. Designate(expression,operand);
  3935. Pass((operand.tag));
  3936. NeedDescriptor := FALSE;
  3937. (* case 2a *)
  3938. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  3939. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  3940. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  3941. INC(i);
  3942. END;
  3943. IF i = dim THEN
  3944. Designate(expression,operand);
  3945. Pass((operand.tag));
  3946. ELSE (* open-static *)
  3947. type := expression.type.resolved;
  3948. descriptorType := GetMathArrayDescriptorType(dim);
  3949. variable := GetTemporaryVariable(descriptorType, FALSE);
  3950. Symbol(variable,variableOp);
  3951. arrayDestinationTag := variableOp.op;
  3952. Designate(expression,operand);
  3953. FOR i := 0 TO dim-1 DO
  3954. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3955. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  3956. ReleaseOperand(tmpOperand);
  3957. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3958. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  3959. ReleaseOperand(tmpOperand);
  3960. END;
  3961. dimOp := IntermediateCode.Immediate(addressType,dim);
  3962. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  3963. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  3964. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  3965. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  3966. baseType := SemanticChecker.ArrayBase(type,dim);
  3967. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3968. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  3969. Pass((arrayDestinationTag));
  3970. END;
  3971. (* case 2d *)
  3972. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3973. Designate(expression,operand);
  3974. Dereference(operand,type.resolved,FALSE);
  3975. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  3976. Pass((operand.tag));
  3977. (* case 2f *)
  3978. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3979. descriptorType := GetMathArrayDescriptorType(dim);
  3980. variable := GetTemporaryVariable(descriptorType, FALSE);
  3981. Symbol(variable,variableOp);
  3982. arrayDestinationTag := variableOp.op;
  3983. Designate(expression,operand);
  3984. FOR i := 0 TO dim-1 DO
  3985. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3986. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  3987. ReleaseOperand(tmpOperand);
  3988. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3989. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  3990. ReleaseOperand(tmpOperand);
  3991. END;
  3992. dimOp := IntermediateCode.Immediate(addressType,dim);
  3993. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  3994. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  3995. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  3996. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  3997. baseType := SemanticChecker.ArrayBase(type,dim);
  3998. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3999. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4000. Pass((arrayDestinationTag));
  4001. ELSE HALT(100);
  4002. END;
  4003. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4004. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4005. (* case 3b *)
  4006. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4007. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4008. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4009. Symbol(variable,variableOp);
  4010. LoadValue(variableOp,system.addressType);
  4011. ELSE
  4012. descriptorType := GetMathArrayDescriptorType(dim);
  4013. variable := GetTemporaryVariable(descriptorType, FALSE);
  4014. Symbol(variable,variableOp);
  4015. END;
  4016. arrayDestinationTag := variableOp.op;
  4017. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4018. arrayDestinationDimension := 0;
  4019. Designate(expression,operand);
  4020. Pass((operand.tag));
  4021. (* case 3a *)
  4022. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4023. i := 0;
  4024. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4025. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4026. INC(i);
  4027. END;
  4028. IF i = dim THEN
  4029. Designate(expression,operand);
  4030. Pass((operand.tag));
  4031. ELSE (* open-static *)
  4032. type := expression.type.resolved;
  4033. descriptorType := GetMathArrayDescriptorType(dim);
  4034. variable := GetTemporaryVariable(descriptorType, FALSE);
  4035. Symbol(variable,variableOp);
  4036. arrayDestinationTag := variableOp.op;
  4037. Designate(expression,operand);
  4038. FOR i := 0 TO dim-1 DO
  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. END;
  4046. dimOp := IntermediateCode.Immediate(addressType,dim);
  4047. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4048. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4049. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4050. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4051. baseType := SemanticChecker.ArrayBase(type,dim);
  4052. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4053. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4054. Pass((arrayDestinationTag));
  4055. END;
  4056. (* case 3d *)
  4057. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4058. Designate(expression,operand);
  4059. Dereference(operand,type.resolved,FALSE);
  4060. (*
  4061. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4062. *)
  4063. Pass((operand.tag));
  4064. (* case 3f *)
  4065. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4066. descriptorType := GetMathArrayDescriptorType(dim);
  4067. variable := GetTemporaryVariable(descriptorType, FALSE);
  4068. Symbol(variable,variableOp);
  4069. arrayDestinationTag := variableOp.op;
  4070. Designate(expression,operand);
  4071. IF operand.op.type.length >1 THEN (* vector register *)
  4072. variable2 := GetTemporaryVariable(type, FALSE);
  4073. Symbol(variable2, variable2Op);
  4074. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4075. Emit(Mov(position,tmp, operand.op));
  4076. ReleaseOperand(operand);
  4077. Symbol(variable2, operand);
  4078. END;
  4079. FOR i := 0 TO dim-1 DO
  4080. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4081. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4082. ReleaseOperand(tmpOperand);
  4083. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4084. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4085. ReleaseOperand(tmpOperand);
  4086. END;
  4087. dimOp := IntermediateCode.Immediate(addressType,dim);
  4088. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4089. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4090. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4091. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4092. baseType := SemanticChecker.ArrayBase(type,dim);
  4093. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4094. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4095. Pass((arrayDestinationTag));
  4096. ELSE HALT(100);
  4097. END;
  4098. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4099. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4100. (* case 4b *)
  4101. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4102. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4103. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4104. Symbol(variable,variableOp);
  4105. LoadValue(variableOp,system.addressType);
  4106. ELSE
  4107. descriptorType := GetMathArrayDescriptorType(dim);
  4108. variable := GetTemporaryVariable(descriptorType, FALSE);
  4109. Symbol(variable,variableOp);
  4110. END;
  4111. arrayDestinationTag := variableOp.op;
  4112. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4113. arrayDestinationDimension := 0;
  4114. Designate(expression,operand);
  4115. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4116. Symbol(variable,variableOp);
  4117. ELSE
  4118. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4119. Symbol(variable,variableOp);
  4120. MakeMemory(tmp,variableOp.op,addressType,0);
  4121. Emit(Mov(position,tmp,operand.tag));
  4122. ReleaseIntermediateOperand(tmp);
  4123. END;
  4124. Pass((variableOp.op));
  4125. ReleaseOperand(variableOp);
  4126. (* case 4a *)
  4127. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4128. i := 0;
  4129. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4130. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4131. INC(i);
  4132. END;
  4133. IF i = dim THEN
  4134. Designate(expression,operand);
  4135. arrayDestinationTag := operand.tag;
  4136. ELSE (* open-static *)
  4137. type := expression.type.resolved;
  4138. descriptorType := GetMathArrayDescriptorType(dim);
  4139. variable := GetTemporaryVariable(descriptorType, FALSE);
  4140. Symbol(variable,variableOp);
  4141. arrayDestinationTag := variableOp.op;
  4142. Designate(expression,operand);
  4143. FOR i := 0 TO dim-1 DO
  4144. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4145. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4146. ReleaseOperand(tmpOperand);
  4147. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4148. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4149. ReleaseOperand(tmpOperand);
  4150. END;
  4151. dimOp := IntermediateCode.Immediate(addressType,dim);
  4152. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4153. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4154. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4155. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4156. baseType := SemanticChecker.ArrayBase(type,dim);
  4157. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4158. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4159. END;
  4160. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4161. Symbol(variable,variableOp);
  4162. MakeMemory(tmp,variableOp.op,addressType,0);
  4163. Emit(Mov(position,tmp,arrayDestinationTag));
  4164. ReleaseIntermediateOperand(tmp);
  4165. Pass((variableOp.op));
  4166. ReleaseOperand(variableOp);
  4167. (* case 4d *)
  4168. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4169. Designate(expression,operand);
  4170. (*
  4171. Dereference(operand,type.resolved,FALSE);
  4172. *)
  4173. (*
  4174. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4175. *)
  4176. Pass((operand.op));
  4177. (* case 4f *)
  4178. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4179. descriptorType := GetMathArrayDescriptorType(dim);
  4180. variable := GetTemporaryVariable(descriptorType, FALSE);
  4181. Symbol(variable,variableOp);
  4182. arrayDestinationTag := variableOp.op;
  4183. Designate(expression,operand);
  4184. FOR i := 0 TO dim-1 DO
  4185. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4186. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4187. ReleaseOperand(tmpOperand);
  4188. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4189. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4190. ReleaseOperand(tmpOperand);
  4191. END;
  4192. dimOp := IntermediateCode.Immediate(addressType,dim);
  4193. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4194. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4195. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4196. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4197. baseType := SemanticChecker.ArrayBase(type,dim);
  4198. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4199. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4200. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4201. Symbol(variable,variableOp);
  4202. MakeMemory(tmp,variableOp.op,addressType,0);
  4203. Emit(Mov(position,tmp,arrayDestinationTag));
  4204. ReleaseIntermediateOperand(tmp);
  4205. Pass((variableOp.op));
  4206. ReleaseOperand(variableOp);
  4207. ELSE HALT(100);
  4208. END;
  4209. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4210. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4211. Designate(expression,operand);
  4212. IF operand.op.type.length > 1 THEN
  4213. Emit(Push(position, operand.op));
  4214. ReleaseOperand(operand);
  4215. ELSE
  4216. size := system.SizeOf(type);
  4217. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4218. size := ToMemoryUnits(system,size);
  4219. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4220. arrayDestinationTag := sp;
  4221. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4222. END;
  4223. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4224. Designate(expression,operand);
  4225. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4226. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4227. Symbol(variable,variableOp);
  4228. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4229. Emit(Mov(position,tmp,operand.op));
  4230. Emit(Push(position,variableOp.op));
  4231. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4232. Pass((operand.op));
  4233. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4234. END;
  4235. ELSE HALT(200)
  4236. END;
  4237. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4238. IF parameter.kind = SyntaxTree.VarParameter THEN
  4239. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4240. Designate(expression, operand);
  4241. Pass((operand.op));
  4242. ELSE
  4243. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4244. Evaluate(expression, operand);
  4245. Pass((operand.extra)); (* step *)
  4246. Pass((operand.tag)); (* last *)
  4247. Pass((operand.op)) (* first *)
  4248. END
  4249. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4250. IF parameter.kind = SyntaxTree.VarParameter THEN
  4251. Designate(expression, operand);
  4252. Pass((operand.op));
  4253. ELSE
  4254. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4255. Evaluate(expression, operand);
  4256. Pass((operand.tag)); (* real part *)
  4257. Pass((operand.op)) (* imaginary part *)
  4258. END
  4259. ELSE
  4260. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4261. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4262. Designate(expression,operand);
  4263. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4264. (* stack allocation *)
  4265. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4266. (*! parameter alignment to be discussed ... *)
  4267. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4268. size := type(SyntaxTree.StringType).length;
  4269. END;
  4270. IF backend.cooperative & parameter.NeedsTrace() THEN
  4271. dst := NewRegisterOperand (addressType);
  4272. Emit(Mov(position,dst, sp));
  4273. IntermediateCode.InitImmediate(null, byteType, 0);
  4274. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4275. ReleaseIntermediateOperand(dst);
  4276. SaveRegisters();ReleaseUsedRegisters(saved);
  4277. (* register dst has been freed before SaveRegisters already *)
  4278. CallAssignMethod(dst, operand.op, parameter.type);
  4279. RestoreRegisters(saved);
  4280. END;
  4281. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4282. ELSIF IsOpenArray(parameter.type) THEN
  4283. Designate(expression,operand);
  4284. baseReg := operand.tag;
  4285. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4286. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4287. END;
  4288. Pass((operand.op)); (* address of the array *)
  4289. ELSIF IsDelegate(parameter.type) THEN
  4290. Evaluate(expression,operand);
  4291. IF backend.cooperative & parameter.NeedsTrace() THEN
  4292. Emit(Push(position, nil));
  4293. dst := NewRegisterOperand (addressType);
  4294. Emit(Mov(position,dst, sp));
  4295. ReleaseIntermediateOperand(dst);
  4296. SaveRegisters();ReleaseUsedRegisters(saved);
  4297. Emit(Push(position, dst));
  4298. (* register dst has been freed before SaveRegisters already *)
  4299. Emit(Push(position, operand.tag));
  4300. CallThis("GarbageCollector","Assign",2);
  4301. RestoreRegisters(saved);
  4302. ELSE
  4303. Pass((operand.tag));
  4304. END;
  4305. Pass((operand.op));
  4306. ELSE
  4307. Evaluate(expression,operand);
  4308. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4309. Emit(Push(position, nil));
  4310. dst := NewRegisterOperand (addressType);
  4311. Emit(Mov(position,dst, sp));
  4312. ReleaseIntermediateOperand(dst);
  4313. SaveRegisters();ReleaseUsedRegisters(saved);
  4314. Emit(Push(position, dst));
  4315. (* register dst has been freed before SaveRegisters already *)
  4316. Emit(Push(position, operand.op));
  4317. CallThis("GarbageCollector","Assign",2);
  4318. RestoreRegisters(saved);
  4319. ELSE
  4320. Pass((operand.op));
  4321. END;
  4322. END;
  4323. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4324. Evaluate(expression,operand);
  4325. Pass((operand.op));
  4326. ELSE (* var parameter *)
  4327. Designate(expression,operand);
  4328. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4329. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4330. Pass((operand.tag));
  4331. END;
  4332. END;
  4333. Pass((operand.op));
  4334. END;
  4335. END;
  4336. (* TODO: needed? *)
  4337. arrayDestinationTag := oldArrayDestinationTag;
  4338. arrayDestinationDimension := oldArrayDestinationDimension;
  4339. IF needsParameterBackup THEN
  4340. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4341. ReuseCopy(parameterBackup, operand.op)
  4342. END;
  4343. ReleaseOperand(operand);
  4344. IF Trace THEN TraceExit("PushParameter") END;
  4345. END PushParameter;
  4346. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4347. VAR prevConditional: BOOLEAN;
  4348. BEGIN
  4349. prevConditional := conditional;
  4350. conditional := FALSE;
  4351. 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
  4352. Expression(x.result); (* use register *)
  4353. END;
  4354. Statement(x.statement);
  4355. conditional := prevConditional;
  4356. IF x.result # NIL THEN Expression(x.result) END;
  4357. 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
  4358. ReleaseIntermediateOperand(result.op);
  4359. END;
  4360. END VisitStatementDesignator;
  4361. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4362. VAR
  4363. procedure: SyntaxTree.Procedure;
  4364. procedureType: SyntaxTree.ProcedureType;
  4365. wasInline: BOOLEAN;
  4366. actualParameters: SyntaxTree.ExpressionList;
  4367. formalParameter: SyntaxTree.Parameter;
  4368. actualParameter: SyntaxTree.Expression;
  4369. i: LONGINT;
  4370. variable, localVariable: SyntaxTree.Variable;
  4371. variableDesignator, tagDesignator, returnDesignator: SyntaxTree.Expression;
  4372. src, dest: Operand;
  4373. prevInlineExit : Label;
  4374. prevMapper: SymbolMapper;
  4375. tooComplex: BOOLEAN;
  4376. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4377. BEGIN
  4378. IF e = NIL THEN RETURN TRUE
  4379. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4380. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4381. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4382. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4383. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4384. ELSE RETURN FALSE
  4385. END;
  4386. END SimpleExpression;
  4387. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4388. BEGIN
  4389. RETURN checker.CanPassInRegister(type)
  4390. END FitsInRegister;
  4391. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4392. VAR
  4393. variable: SyntaxTree.Variable;
  4394. variableDesignator: SyntaxTree.Designator;
  4395. BEGIN
  4396. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4397. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4398. variableDesignator.SetType(type);
  4399. RETURN variableDesignator
  4400. END GetTemp;
  4401. BEGIN
  4402. wasInline := currentIsInline;
  4403. prevInlineExit := currentInlineExit;
  4404. prevMapper := currentMapper;
  4405. currentInlineExit := NewLabel();
  4406. tooComplex := FALSE;
  4407. NEW(currentMapper);
  4408. currentIsInline := TRUE;
  4409. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4410. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4411. formalParameter := procedureType.firstParameter;
  4412. actualParameters := x.parameters;
  4413. i := 0;
  4414. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4415. actualParameter := actualParameters.GetExpression(i);
  4416. IF actualParameter.resolved # NIL THEN
  4417. actualParameter := actualParameter.resolved
  4418. END;
  4419. (*
  4420. if expression is simple and can be passed immediately
  4421. or if type fits in register then we can proceed
  4422. otherwise we escape to ordinary procedure call.
  4423. *)
  4424. (* cases where the expression can be mapped identically *)
  4425. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4426. currentMapper.Add(formalParameter, actualParameter, NIL);
  4427. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4428. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4429. (*
  4430. Assign(variableDesignator, actualParameter);
  4431. *)
  4432. Evaluate(actualParameter, src);
  4433. Designate(variableDesignator, dest);
  4434. Emit(Mov(x.position, dest.op, src.op));
  4435. ReleaseOperand(dest);
  4436. ReleaseOperand(src);
  4437. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4438. ELSE tooComplex := TRUE
  4439. END;
  4440. (*
  4441. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4442. currentMapper.Add(formalParameter, actualParameter, NIL);
  4443. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4444. variableDesignator := GetTemp(system.addressType, FALSE);
  4445. Designate(actualParameter, src);
  4446. Designate(variableDesignator, dest);
  4447. IntermediateCode.MakeMemory(dest.op,addressType);
  4448. Emit(Mov(x.position, dest.op, src.op));
  4449. ReleaseOperand(dest);
  4450. IF src.tag.mode # IntermediateCode.Undefined THEN
  4451. tagDesignator := GetTemp(system.addressType, FALSE);
  4452. Designate(tagDesignator, dest);
  4453. IntermediateCode.MakeMemory(dest.op,addressType);
  4454. Emit(Mov(x.position, dest.op, src.op));
  4455. END;
  4456. ReleaseOperand(dest); ReleaseOperand(src);
  4457. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4458. END;
  4459. *)
  4460. formalParameter := formalParameter.nextParameter;
  4461. INC(i);
  4462. END;
  4463. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4464. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4465. currentMapper.Add(NIL, returnDesignator, NIL);
  4466. END;
  4467. localVariable := procedure.procedureScope.firstVariable;
  4468. WHILE ~tooComplex & (localVariable # NIL) DO
  4469. variableDesignator := GetTemp(localVariable.type, FALSE);
  4470. currentMapper.Add(localVariable, variableDesignator, NIL);
  4471. localVariable := localVariable.nextVariable;
  4472. END;
  4473. IF ~tooComplex THEN
  4474. VisitStatementBlock(procedure.procedureScope.body);
  4475. SetLabel(currentInlineExit);
  4476. IF procedureType.returnType # NIL THEN
  4477. Designate(returnDesignator, result);
  4478. IF conditional THEN
  4479. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4480. ValueToCondition(result)
  4481. END;
  4482. END;
  4483. END;
  4484. currentMapper := prevMapper;
  4485. currentInlineExit := prevInlineExit;
  4486. currentIsInline := wasInline;
  4487. RETURN ~tooComplex
  4488. END InlineProcedureCall;
  4489. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4490. VAR
  4491. parameters: SyntaxTree.ExpressionList;
  4492. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4493. designator: SyntaxTree.Designator;
  4494. procedureType: SyntaxTree.ProcedureType;
  4495. formalParameter: SyntaxTree.Parameter;
  4496. noPush, end: Label;
  4497. operand, returnValue: Operand;
  4498. reg, size, mem, mask, dest: IntermediateCode.Operand;
  4499. saved: RegisterEntry;
  4500. symbol: SyntaxTree.Symbol;
  4501. variable: SyntaxTree.Variable;
  4502. i, j, parametersSize, returnTypeSize, returnTypeOffset: LONGINT;
  4503. structuredReturnType: BOOLEAN;
  4504. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4505. tempVariableDesignator: SyntaxTree.Designator;
  4506. gap, alignment: LONGINT; (*fld*)
  4507. (* TODO: remove unnecessary backup variables *)
  4508. oldResult: Operand;
  4509. oldCurrentScope: SyntaxTree.Scope;
  4510. oldArrayDestinationTag: IntermediateCode.Operand;
  4511. oldArrayDestinationDimension: LONGINT;
  4512. oldConstantDeclaration: SyntaxTree.Symbol;
  4513. oldDestination: IntermediateCode.Operand;
  4514. oldCurrentLoop: Label;
  4515. oldConditional: BOOLEAN;
  4516. oldTrueLabel, oldFalseLabel: Label;
  4517. oldLocked: BOOLEAN;
  4518. usedRegisters,oldUsedRegisters: RegisterEntry;
  4519. return: IntermediateCode.Operand;
  4520. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4521. arg: IntermediateCode.Operand;
  4522. dummy: IntermediateCode.Operand;
  4523. recordType: SyntaxTree.RecordType;
  4524. operatorSelectionProcedureOperand: Operand;
  4525. operatorSelectionProcedure: SyntaxTree.Procedure;
  4526. fingerPrint: SyntaxTree.FingerPrint;
  4527. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4528. identifierNumber: LONGINT;
  4529. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4530. procedure: SyntaxTree.Procedure;
  4531. PROCEDURE BackupGlobalState;
  4532. BEGIN
  4533. oldResult := result;
  4534. oldCurrentScope := currentScope;
  4535. oldArrayDestinationTag := arrayDestinationTag;
  4536. oldArrayDestinationDimension := arrayDestinationDimension;
  4537. oldConstantDeclaration := constantDeclaration;
  4538. oldDestination := destination;
  4539. oldCurrentLoop := currentLoop;
  4540. oldConditional := conditional;
  4541. oldTrueLabel := trueLabel;
  4542. oldFalseLabel := falseLabel;
  4543. oldLocked := locked;
  4544. oldUsedRegisters := usedRegisters
  4545. END BackupGlobalState;
  4546. PROCEDURE RestoreGlobalState;
  4547. BEGIN
  4548. result := oldResult;
  4549. currentScope := oldCurrentScope;
  4550. arrayDestinationTag := oldArrayDestinationTag;
  4551. arrayDestinationDimension := oldArrayDestinationDimension;
  4552. constantDeclaration := oldConstantDeclaration;
  4553. destination := oldDestination;
  4554. currentLoop := oldCurrentLoop;
  4555. conditional := oldConditional;
  4556. trueLabel := oldTrueLabel;
  4557. falseLabel := oldFalseLabel;
  4558. locked := oldLocked;
  4559. usedRegisters := oldUsedRegisters
  4560. END RestoreGlobalState;
  4561. (** do preparations before parameter push for array-structured object types (ASOTs):
  4562. if ASOT is passed as VAR parameter:
  4563. - allocate temporary variable of math array type
  4564. - copy contents of ASOT to be passed to temporary variable
  4565. - use temporary variable as the actual parameter instead
  4566. - 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)
  4567. **)
  4568. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4569. VAR
  4570. expression: SyntaxTree.Expression;
  4571. BEGIN
  4572. IF actualParameter IS SyntaxTree.Designator THEN
  4573. designator := actualParameter(SyntaxTree.Designator);
  4574. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4575. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4576. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4577. ASSERT(checker # NIL);
  4578. checker.SetCurrentScope(currentScope);
  4579. (* allocate temporary variable *)
  4580. ASSERT(actualParameter.type # NIL);
  4581. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4582. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4583. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4584. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4585. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4586. ASSERT(tempVariableDesignator.type # NIL);
  4587. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4588. (* copy math array stored in actual parameter to temporary variable *)
  4589. BackupGlobalState;
  4590. AssignMathArray(tempVariableDesignator, actualParameter);
  4591. RestoreGlobalState;
  4592. (* use temporary variable as actual parameter instead of the original one *)
  4593. actualParameter := tempVariableDesignator;
  4594. (* create write-back call and store it in linked list *)
  4595. (* create new list entry *)
  4596. IF firstWriteBackCall = NIL THEN
  4597. NEW(firstWriteBackCall);
  4598. currentWriteBackCall := firstWriteBackCall
  4599. ELSE
  4600. ASSERT(currentWriteBackCall # NIL);
  4601. NEW(currentWriteBackCall.next);
  4602. currentWriteBackCall := currentWriteBackCall.next
  4603. END;
  4604. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4605. ASSERT(expression.type = NIL);
  4606. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4607. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4608. (* prepare writeback for any other "normal" indexer *)
  4609. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4610. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4611. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4612. Assign(tempVariableDesignator, actualParameter);
  4613. actualParameter := tempVariableDesignator;
  4614. IF firstWriteBackCall = NIL THEN
  4615. NEW(firstWriteBackCall);
  4616. currentWriteBackCall := firstWriteBackCall
  4617. ELSE
  4618. ASSERT(currentWriteBackCall # NIL);
  4619. NEW(currentWriteBackCall.next);
  4620. currentWriteBackCall := currentWriteBackCall.next
  4621. END;
  4622. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4623. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4624. END
  4625. END
  4626. END PrepareParameter;
  4627. BEGIN
  4628. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4629. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4630. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4631. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4632. IF InlineProcedureCall(x) THEN
  4633. RETURN
  4634. ELSE
  4635. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4636. END
  4637. END;
  4638. END;
  4639. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4640. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4641. dest := destination; destination := emptyOperand;
  4642. SaveRegisters();ReleaseUsedRegisters(saved);
  4643. parameters := x.parameters;
  4644. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4645. (* an operator is called *)
  4646. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4647. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4648. (* check if a dynamic operator call should be performed *)
  4649. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4650. ELSE
  4651. isCallOfDynamicOperator := FALSE
  4652. END;
  4653. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4654. Emit(Push(position, ap));
  4655. END;
  4656. alignment := procedureType.stackAlignment;
  4657. IF alignment > 1 THEN
  4658. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4659. Emit(Mov(position,reg, sp));
  4660. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4661. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4662. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4663. Emit(And(position,sp, sp, mask));
  4664. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4665. Emit(Push(position,reg));
  4666. (*
  4667. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4668. Emit(Mov(position,mem,reg));
  4669. *)
  4670. ReleaseIntermediateOperand(reg);
  4671. END;
  4672. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4673. IntermediateCode.InitImmediate(mask,addressType,-16);
  4674. Emit(And(position,sp, sp, mask));
  4675. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4676. IF gap # 0 THEN
  4677. IntermediateCode.InitImmediate(size,addressType,gap);
  4678. Emit(Sub(position,sp,sp,size))
  4679. END;
  4680. END;
  4681. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4682. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4683. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4684. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4685. ELSE
  4686. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4687. END;
  4688. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4689. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  4690. (* push ID *)
  4691. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4692. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  4693. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  4694. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  4695. formalParameter := procedureType.firstParameter;
  4696. FOR i := 0 TO parameters.Length() - 1 DO
  4697. IF formalParameter.access # SyntaxTree.Hidden THEN
  4698. ASSERT(i < 2);
  4699. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  4700. (* push pointer *)
  4701. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4702. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  4703. (* add dereference *)
  4704. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4705. ReleaseIntermediateOperand(parameterBackups[i]);
  4706. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  4707. END;
  4708. Emit(Push(position,parameterBackups[i]));
  4709. ReleaseIntermediateOperand(parameterBackups[i]);
  4710. (* push typetag *)
  4711. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4712. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  4713. arg := TypeDescriptorAdr(recordType);
  4714. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  4715. Emit(Push(position,arg));
  4716. ELSE
  4717. (* push 'NonPointer' *)
  4718. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4719. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4720. (* push fingerprint *)
  4721. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4722. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  4723. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  4724. END
  4725. END;
  4726. formalParameter := formalParameter.nextParameter
  4727. END;
  4728. (* for unary operators: complete the information for the second parameter *)
  4729. IF procedureType.numberParameters < 2 THEN
  4730. (* push 'NonPointer' *)
  4731. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4732. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4733. (* push 'NoType' *)
  4734. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4735. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  4736. END;
  4737. (* call operator selection procedure *)
  4738. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  4739. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  4740. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  4741. ReleaseOperand(operatorSelectionProcedureOperand);
  4742. (* use the address that the operator selection procedure returned as the target address of the call *)
  4743. InitOperand(operand, ModeValue);
  4744. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4745. Emit(Result(position,operand.op))
  4746. END
  4747. ELSE
  4748. Evaluate(x.left, operand)
  4749. END;
  4750. IF symbol IS SyntaxTree.Procedure THEN
  4751. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4752. Emit(Push(position,operand.tag));
  4753. ELSIF (procedureType.isDelegate) THEN
  4754. Emit(Push(position,operand.tag));
  4755. END;
  4756. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4757. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  4758. Emit(Push(position,operand.tag));
  4759. END;
  4760. ELSE HALT(200);
  4761. END;
  4762. ReleaseIntermediateOperand(operand.tag);
  4763. operand.tag := emptyOperand;
  4764. (* determine if a structured return type is needed *)
  4765. structuredReturnType := StructuredReturnType(procedureType);
  4766. IF structuredReturnType THEN
  4767. IF resultDesignator # NIL THEN
  4768. d := resultDesignator;
  4769. ELSE
  4770. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  4771. variable.SetUntraced(procedureType.hasUntracedReturn);
  4772. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  4773. d.SetType(variable.type);
  4774. END;
  4775. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  4776. Designate(d,returnValue);
  4777. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  4778. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  4779. Emit(Push(position,size));
  4780. Emit(Push(position,returnValue.op));
  4781. ReleaseOperand(returnValue);
  4782. ELSE
  4783. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  4784. END;
  4785. END;
  4786. firstWriteBackCall := NIL; (* reset write-back call list *)
  4787. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  4788. passByRegister := system.registerParameters > 0;
  4789. registerNumber := 0;
  4790. formalParameter := procedureType.lastParameter;
  4791. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  4792. actualParameter := parameters.GetExpression(i);
  4793. PrepareParameter(actualParameter, formalParameter);
  4794. IF passByRegister & (i < system.registerParameters) THEN
  4795. IF ~PassInRegister(formalParameter) THEN
  4796. Error(actualParameter.position,"cannot be passed by register")
  4797. ELSE
  4798. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  4799. END;
  4800. INC(registerNumber);
  4801. ELSE
  4802. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4803. END;
  4804. formalParameter := formalParameter.prevParameter;
  4805. END;
  4806. IF passByRegister & (registerNumber > 0) THEN
  4807. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  4808. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4809. END;
  4810. ELSE
  4811. hasDynamicOperands := FALSE;
  4812. formalParameter := procedureType.firstParameter;
  4813. FOR i := 0 TO parameters.Length() - 1 DO
  4814. actualParameter := parameters.GetExpression(i);
  4815. IF formalParameter # NIL THEN (* TENTATIVE *)
  4816. PrepareParameter(actualParameter, formalParameter);
  4817. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  4818. ASSERT(i < 2);
  4819. hasDynamicOperands := TRUE;
  4820. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  4821. ELSE
  4822. IF passByRegister & (registerNumber > 0) THEN
  4823. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  4824. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4825. END;
  4826. passByRegister := FALSE;
  4827. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4828. END;
  4829. formalParameter := formalParameter.nextParameter;
  4830. END;
  4831. END;
  4832. END;
  4833. IF symbol IS SyntaxTree.Procedure THEN
  4834. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  4835. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  4836. Emit(Push(position,reg));
  4837. ReleaseIntermediateOperand(reg);
  4838. END;
  4839. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  4840. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4841. parametersSize := ParametersSize(system,procedureType,FALSE);
  4842. END;
  4843. ReleaseParameterRegisters();
  4844. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  4845. Emit(Call(position,operand.op,0));
  4846. ELSE
  4847. Emit(Call(position,operand.op,parametersSize));
  4848. END;
  4849. ReleaseOperand(operand);
  4850. IF procedureType.noReturn THEN
  4851. EmitTrap(position,NoReturnTrap);
  4852. END;
  4853. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  4854. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  4855. Emit(Result(position,return));
  4856. END;
  4857. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  4858. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  4859. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  4860. END;
  4861. size := IntermediateCode.Immediate(addressType,parametersSize);
  4862. Emit(Add(position,sp,sp,size));
  4863. END;
  4864. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  4865. IF structuredReturnType THEN
  4866. (* stack pointer rewinding done by callee
  4867. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  4868. Emit(Add(position,sp,sp,size));
  4869. *)
  4870. RestoreRegisters(saved);
  4871. InitOperand(result,ModeReference);
  4872. Symbol(variable,result);
  4873. ELSE
  4874. RestoreRegisters(saved);
  4875. InitOperand(result,ModeValue);
  4876. result.op := return;
  4877. END;
  4878. END;
  4879. IF alignment > 1 THEN
  4880. Emit(Pop(position,sp));
  4881. END;
  4882. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4883. Emit(Pop(position, ap));
  4884. END;
  4885. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  4886. ValueToCondition(result);
  4887. END;
  4888. destination := dest;
  4889. (* perform all write-back calls in the list *)
  4890. BackupGlobalState;
  4891. currentWriteBackCall := firstWriteBackCall;
  4892. WHILE currentWriteBackCall # NIL DO
  4893. VisitProcedureCallDesignator(currentWriteBackCall.call);
  4894. currentWriteBackCall := currentWriteBackCall.next
  4895. END;
  4896. RestoreGlobalState;
  4897. (* TENATIVE *)
  4898. (*
  4899. IF isOperatorCall THEN
  4900. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  4901. END;
  4902. *)
  4903. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  4904. END VisitProcedureCallDesignator;
  4905. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  4906. VAR res: IntermediateCode.Operand; source: Sections.Section; offset: LONGINT; name: Basic.SegmentedName;
  4907. td: SyntaxTree.Symbol;
  4908. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  4909. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  4910. BEGIN
  4911. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  4912. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  4913. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  4914. variable.SetType(system.anyType);
  4915. scope.AddVariable(variable);
  4916. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  4917. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  4918. typeDeclaration.SetDeclaredType(hiddenPointerType);
  4919. typeDeclaration.SetScope(module.module.moduleScope);
  4920. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  4921. hiddenPointerType.SetState(SyntaxTree.Resolved);
  4922. END;
  4923. RETURN hiddenPointerType;
  4924. END GetHiddenPointerType;
  4925. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  4926. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  4927. BEGIN
  4928. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  4929. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  4930. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  4931. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  4932. scope.AddVariable(variable);
  4933. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  4934. variable.SetType(system.anyType);
  4935. scope.AddVariable(variable);
  4936. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  4937. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  4938. typeDeclaration.SetDeclaredType(delegatePointerType);
  4939. typeDeclaration.SetScope(module.module.moduleScope);
  4940. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  4941. delegatePointerType.SetState(SyntaxTree.Resolved);
  4942. END;
  4943. RETURN delegatePointerType
  4944. END GetDelegateType;
  4945. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  4946. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  4947. such as in VAR a: RECORD ... END;
  4948. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  4949. and variables, constants and procedures the same mechanism can be used for fixups etc.
  4950. *)
  4951. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  4952. op: IntermediateCode.Operand;
  4953. BEGIN (* no code emission *)
  4954. source := NIL;
  4955. x := x.resolved;
  4956. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  4957. x := GetHiddenPointerType();
  4958. ELSIF IsDelegate(x) THEN
  4959. x := GetDelegateType();
  4960. ELSIF (x IS SyntaxTree.RecordType) (* OR (x IS SyntaxTree.PointerType) *) THEN
  4961. ELSE HALT(200);
  4962. END;
  4963. td := x.typeDeclaration;
  4964. IF td = NIL THEN
  4965. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  4966. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  4967. ASSERT(td # NIL);
  4968. END;
  4969. IF newObjectFile THEN
  4970. GetCodeSectionNameForSymbol(td,name);
  4971. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  4972. meta.CheckTypeDeclaration(x);
  4973. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  4974. ELSE
  4975. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  4976. END;
  4977. IF backend.cooperative THEN
  4978. offset := 0;
  4979. ELSE
  4980. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  4981. END;
  4982. ELSE
  4983. offset := 0;
  4984. source := module.allSections.FindBySymbol(td); (*TODO*)
  4985. IF source = NIL THEN
  4986. null := 0;
  4987. GetCodeSectionNameForSymbol(td,name);
  4988. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  4989. IntermediateCode.InitImmediate(op,addressType,0);
  4990. source(IntermediateCode.Section).Emit(Data(position,op));
  4991. source.SetReferenced(FALSE)
  4992. ELSE
  4993. name := source.name;
  4994. END;
  4995. END;
  4996. RETURN td
  4997. END GetBackendType;
  4998. BEGIN
  4999. (*td := t.typeDeclaration;*)
  5000. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5001. (*
  5002. IF t IS SyntaxTree.PointerType THEN
  5003. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5004. ELSE
  5005. source := GetBackendType(t);
  5006. END;
  5007. *)
  5008. IF newObjectFile THEN
  5009. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5010. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5011. IntermediateCode.SetOffset(res,offset);
  5012. ELSE
  5013. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5014. END;
  5015. (*
  5016. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5017. make memory should be used when tag is used, not earlier
  5018. *)
  5019. RETURN res
  5020. END TypeDescriptorAdr;
  5021. (*
  5022. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5023. VAR result: IntermediateCode.Operand;
  5024. BEGIN
  5025. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5026. operand.tag := TypeDescriptorAdr(operand.type);
  5027. IntermediateCode.MakeMemory(operand.tag,addressType);
  5028. UseIntermediateOperand(operand.tag);
  5029. END;
  5030. END MakeTypeTag;
  5031. *)
  5032. PROCEDURE ProfilerInit;
  5033. VAR reg: IntermediateCode.Operand;
  5034. BEGIN
  5035. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5036. Emit(Call(position,reg,0));
  5037. END ProfilerInit;
  5038. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5039. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5040. BEGIN
  5041. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5042. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5043. THEN
  5044. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5045. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5046. Emit(Push(position,reg));
  5047. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5048. Emit(Push(position,reg));
  5049. StaticCallOperand(result,procedure);
  5050. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5051. ReleaseOperand(result);
  5052. END;
  5053. END ProfilerEnterExit;
  5054. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5055. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5056. BEGIN
  5057. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5058. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5059. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5060. profileInit.Emit(Push(position,reg));
  5061. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5062. profileInit.Emit(Push(position,reg));
  5063. NEW(string, LEN(name)); COPY(name, string^);
  5064. sv := SyntaxTree.NewStringValue(-1,string);
  5065. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5066. sv.SetType(type);
  5067. Designate(sv,result);
  5068. profileInit.Emit(Push(position,result.tag));
  5069. profileInit.Emit(Push(position,result.op));
  5070. StaticCallOperand(result,procedure);
  5071. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5072. ReleaseOperand(result);
  5073. END;
  5074. END ProfilerAddProcedure;
  5075. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5076. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5077. BEGIN
  5078. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5079. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5080. profileInit.Emit(Push(position,reg));
  5081. profileInitPatchPosition := profileInit.pc;
  5082. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5083. NEW(string, LEN(name)); COPY(name, string^);
  5084. sv := SyntaxTree.NewStringValue(-1,string);
  5085. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5086. sv.SetType(type);
  5087. Designate(sv,result);
  5088. profileInit.Emit(Push(position,result.tag));
  5089. profileInit.Emit(Push(position,result.op));
  5090. StaticCallOperand(result,procedure);
  5091. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5092. ReleaseOperand(result);
  5093. END;
  5094. END ProfilerAddModule;
  5095. PROCEDURE ProfilerPatchInit;
  5096. VAR reg: IntermediateCode.Operand;
  5097. BEGIN
  5098. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5099. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5100. profileInit.Emit(Leave(position,NIL,0));
  5101. profileInit.Emit(Exit(position,0,0));
  5102. END ProfilerPatchInit;
  5103. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5104. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5105. VAR
  5106. id: LONGINT;
  5107. leftType, rightType: SyntaxTree.Type;
  5108. procedureType: SyntaxTree.ProcedureType;
  5109. runtimeProcedure: SyntaxTree.Procedure;
  5110. runtimeProcedureOperand, operatorOperand: Operand;
  5111. kind: SET;
  5112. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5113. VAR
  5114. arg: IntermediateCode.Operand;
  5115. recordType: SyntaxTree.RecordType;
  5116. fingerPrint: SyntaxTree.FingerPrint;
  5117. BEGIN
  5118. IF type = NIL THEN
  5119. (* no type: push 'NoType' *)
  5120. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5121. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5122. ELSIF IsStrictlyPointerToRecord(type) THEN
  5123. (* pointer to record type: push typetag *)
  5124. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5125. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5126. arg := TypeDescriptorAdr(recordType);
  5127. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5128. ELSE
  5129. (* non-pointer to record type: push fingerprint *)
  5130. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5131. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5132. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5133. END;
  5134. operatorInitializationCodeSection.Emit(Push(position,arg))
  5135. END PushTypeInfo;
  5136. BEGIN
  5137. ASSERT(operatorInitializationCodeSection # NIL);
  5138. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5139. procedureType := operator.type(SyntaxTree.ProcedureType);
  5140. (* determine types *)
  5141. leftType := procedureType.firstParameter.type;
  5142. IF procedureType.numberParameters = 2 THEN
  5143. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5144. rightType := procedureType.firstParameter.nextParameter.type;
  5145. ELSE
  5146. rightType := NIL
  5147. END;
  5148. (* determine operator kind *)
  5149. IF IsStrictlyPointerToRecord(leftType) THEN
  5150. kind := {LhsIsPointer}
  5151. ELSE
  5152. kind := {}
  5153. END;
  5154. IF IsStrictlyPointerToRecord(rightType) THEN
  5155. kind := kind + {RhsIsPointer}
  5156. END;
  5157. IF kind # {} THEN (* TODO: to be removed later on *)
  5158. (* at least one of the types is a pointer to record *)
  5159. (* emit a code that registers this specific operator in the runtime *)
  5160. dump := operatorInitializationCodeSection.comments;
  5161. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5162. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5163. (* push ID *)
  5164. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5165. id := Global.GetSymbol(module.module.case, operator.name);
  5166. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5167. (* push kind *)
  5168. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5169. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5170. (* push type infos *)
  5171. PushTypeInfo(leftType);
  5172. PushTypeInfo(rightType);
  5173. (* push operator address *)
  5174. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5175. StaticCallOperand(operatorOperand, operator);
  5176. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5177. ReleaseOperand(operatorOperand);
  5178. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5179. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5180. ReleaseOperand(runtimeProcedureOperand)
  5181. END
  5182. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5183. END
  5184. END RegisterDynamicOperator;
  5185. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5186. VAR
  5187. traceModule: SyntaxTree.Module;
  5188. procedure: SyntaxTree.Procedure;
  5189. s,msg: Basic.MessageString;
  5190. res: Operand;
  5191. i: LONGINT;
  5192. sv: SyntaxTree.StringValue;
  5193. type: SyntaxTree.Type;
  5194. recordType: SyntaxTree.RecordType;
  5195. printout: Printout.Printer;
  5196. stringWriter: Streams.StringWriter;
  5197. expression: SyntaxTree.Expression;
  5198. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5199. BEGIN
  5200. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5201. IF procedure = NIL THEN
  5202. s := "procedure ";
  5203. Strings.Append(s,backend.traceModuleName);
  5204. Strings.Append(s,".");
  5205. Strings.Append(s,procedureName);
  5206. Strings.Append(s," not present");
  5207. Error(position,s);
  5208. RETURN FALSE
  5209. ELSE
  5210. RETURN TRUE
  5211. END;
  5212. END GetProcedure;
  5213. PROCEDURE CallProcedure;
  5214. BEGIN
  5215. StaticCallOperand(result,procedure);
  5216. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5217. END CallProcedure;
  5218. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5219. VAR res: Operand; string: SyntaxTree.String;
  5220. BEGIN
  5221. IF GetProcedure("String") THEN
  5222. NEW(string, LEN(s)); COPY(s, string^);
  5223. sv := SyntaxTree.NewStringValue(-1,string);
  5224. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5225. sv.SetType(type);
  5226. Designate(sv,res);
  5227. Emit(Push(position,res.tag));
  5228. Emit(Push(position,res.op));
  5229. ReleaseOperand(res);
  5230. CallProcedure;
  5231. END;
  5232. END String;
  5233. PROCEDURE Integer(op: IntermediateCode.Operand);
  5234. BEGIN
  5235. IF GetProcedure("Int") THEN
  5236. Emit(Push(position,op));
  5237. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5238. CallProcedure;
  5239. END;
  5240. END Integer;
  5241. PROCEDURE Float(op: IntermediateCode.Operand);
  5242. BEGIN
  5243. IF GetProcedure("HIntHex") THEN
  5244. Emit(Push(position,op));
  5245. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5246. CallProcedure;
  5247. END;
  5248. END Float;
  5249. PROCEDURE Set(op: IntermediateCode.Operand);
  5250. BEGIN
  5251. IF GetProcedure("Set") THEN
  5252. Emit(Push(position,op));
  5253. (*
  5254. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5255. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5256. *)
  5257. CallProcedure;
  5258. END;
  5259. END Set;
  5260. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5261. BEGIN
  5262. IF GetProcedure("Boolean") THEN
  5263. Emit(Push(position,op));
  5264. CallProcedure;
  5265. END;
  5266. END Boolean;
  5267. PROCEDURE Char(op: IntermediateCode.Operand);
  5268. BEGIN
  5269. IF GetProcedure("Char") THEN
  5270. Emit(Push(position,op));
  5271. CallProcedure;
  5272. END;
  5273. END Char;
  5274. PROCEDURE Address(op: IntermediateCode.Operand);
  5275. BEGIN
  5276. IF GetProcedure("Address") THEN
  5277. Emit(Push(position,op));
  5278. CallProcedure;
  5279. END;
  5280. END Address;
  5281. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5282. BEGIN
  5283. IF GetProcedure("String") THEN
  5284. Emit(Push(position,tag));
  5285. Emit(Push(position,op));
  5286. CallProcedure;
  5287. END;
  5288. END StringOperand;
  5289. PROCEDURE Ln;
  5290. BEGIN
  5291. IF GetProcedure("Ln") THEN
  5292. CallProcedure;
  5293. END;
  5294. END Ln;
  5295. BEGIN
  5296. IF backend.traceModuleName = "" THEN RETURN END;
  5297. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5298. IF GetProcedure("Enter") THEN
  5299. CallProcedure
  5300. END;
  5301. NEW(stringWriter,LEN(s));
  5302. FOR i := 0 TO x.Length()-1 DO
  5303. msg := "";
  5304. expression := x.GetExpression(i);
  5305. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5306. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5307. ELSE
  5308. Global.GetModuleName(module.module, s);
  5309. END;
  5310. IF i = 0 THEN
  5311. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5312. stringWriter.String(":");
  5313. END;
  5314. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5315. IF ~(expression IS SyntaxTree.StringValue) THEN
  5316. printout.Expression(expression);
  5317. stringWriter.Get(s);
  5318. Strings.Append(msg,s);
  5319. Strings.Append(msg,"= ");
  5320. ELSE stringWriter.Get(s); (* remove from string writer *)
  5321. Strings.Append(msg, s);
  5322. END;
  5323. String(msg);
  5324. IF SemanticChecker.IsStringType(expression.type) THEN
  5325. Designate(expression,res);
  5326. StringOperand(res.op,res.tag);
  5327. ELSE
  5328. Evaluate(expression,res);
  5329. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5330. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5331. Convert(res.op,int64);
  5332. END;
  5333. Integer(res.op);
  5334. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5335. Boolean(res.op);
  5336. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5337. Set(res.op);
  5338. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5339. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5340. Convert(res.op,float64);
  5341. END;
  5342. Float(res.op);
  5343. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5344. Char(res.op);
  5345. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5346. Address(res.op);String("H");
  5347. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5348. Address(res.op);String("H");
  5349. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5350. Address(res.op);String("H");
  5351. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5352. Address(res.op);String("H");
  5353. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5354. String("NIL");
  5355. ELSE HALT(200);
  5356. END;
  5357. END;
  5358. ReleaseOperand(res);
  5359. String("; ");
  5360. END;
  5361. IF GetProcedure("Exit") THEN
  5362. CallProcedure
  5363. ELSE
  5364. Ln;
  5365. END;
  5366. END;
  5367. END SystemTrace;
  5368. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5369. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5370. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5371. BEGIN
  5372. type := type.resolved;
  5373. IF type IS SyntaxTree.RecordType THEN
  5374. WITH type: SyntaxTree.RecordType DO
  5375. baseType := type.baseType;
  5376. IF baseType # NIL THEN
  5377. baseType := baseType.resolved;
  5378. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5379. InitFields(baseType,adr,offset);
  5380. END;
  5381. variable := type.recordScope.firstVariable;
  5382. WHILE variable # NIL DO
  5383. IF variable.initializer # NIL THEN
  5384. Evaluate(variable.initializer,initializerOp);
  5385. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5386. Emit(Mov(position,mem,initializerOp.op));
  5387. ReleaseOperand(initializerOp);
  5388. ReleaseIntermediateOperand(mem);
  5389. END;
  5390. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5391. variable := variable.nextVariable
  5392. END;
  5393. END;
  5394. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5395. WITH type: SyntaxTree.ArrayType DO
  5396. IF type.form = SyntaxTree.Static THEN
  5397. baseType := type.arrayBase;
  5398. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5399. FOR i := 0 TO type.staticLength-1 DO
  5400. InitFields(baseType,adr,offset+i*size);
  5401. END;
  5402. END;
  5403. END;
  5404. ELSIF type IS SyntaxTree.MathArrayType THEN
  5405. WITH type: SyntaxTree.MathArrayType DO
  5406. IF type.form = SyntaxTree.Open THEN
  5407. dim := DynamicDim(type);
  5408. imm := IntermediateCode.Immediate(addressType,dim);
  5409. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5410. baseType := SemanticChecker.ArrayBase(type,dim);
  5411. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5412. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5413. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5414. ReleaseIntermediateOperand(imm);
  5415. (* flags remain empty (=0) for open array *)
  5416. ELSIF type.form = SyntaxTree.Static THEN
  5417. baseType := type.arrayBase;
  5418. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5419. FOR i := 0 TO type.staticLength-1 DO
  5420. InitFields(baseType,adr,offset+i*size);
  5421. END;
  5422. END;
  5423. END;
  5424. END;
  5425. END InitFields;
  5426. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5427. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5428. BEGIN
  5429. type := variable.type.resolved;
  5430. IF (type IS SyntaxTree.MathArrayType) THEN
  5431. WITH type: SyntaxTree.MathArrayType DO
  5432. IF type.form = SyntaxTree.Open THEN
  5433. Symbol(variable,operand);
  5434. InitFields(type, operand.tag,0);
  5435. ELSIF type.form = SyntaxTree.Tensor THEN
  5436. Symbol(variable, operand);
  5437. MakeMemory(tmp,operand.op,addressType,0);
  5438. ReleaseOperand(operand);
  5439. Emit(Mov(position,tmp, nil ) );
  5440. ReleaseIntermediateOperand(tmp);
  5441. END;
  5442. END;
  5443. ELSE
  5444. Symbol(variable,operand);
  5445. IF variable.initializer # NIL THEN
  5446. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5447. reference.SetType(variable.type.resolved);
  5448. reference.SetAssignable(TRUE);
  5449. Assign(reference,variable.initializer);
  5450. END;
  5451. InitFields(type, operand.op,0);
  5452. ReleaseOperand(operand);
  5453. END;
  5454. END InitVariable;
  5455. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5456. VAR end: Label;
  5457. BEGIN
  5458. IF type.form = SyntaxTree.Tensor THEN
  5459. InitOperand(result,ModeValue);
  5460. ReuseCopy(result.op,base);
  5461. end := NewLabel();
  5462. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5463. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5464. SetLabel(end);
  5465. Convert(result.op,int32);
  5466. ELSE
  5467. InitOperand(result,ModeValue);
  5468. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5469. END
  5470. END MathArrayDim;
  5471. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5472. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5473. BEGIN
  5474. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5475. MakeMemory(mem,base,addressType,offset);
  5476. Emit(Mov(position,mem,value));
  5477. ReleaseIntermediateOperand(mem);
  5478. END PutMathArrayField;
  5479. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5480. VAR mem: IntermediateCode.Operand;
  5481. BEGIN
  5482. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5483. MakeMemory(mem,base,addressType,offset);
  5484. Emit(Mov(position,mem,value));
  5485. ReleaseIntermediateOperand(mem);
  5486. END PutMathArrayFieldOffset;
  5487. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5488. BEGIN
  5489. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5490. MakeMemory(value,base,addressType,offset);
  5491. END GetMathArrayField;
  5492. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5493. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5494. BEGIN
  5495. IF incr THEN
  5496. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5497. ELSE
  5498. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5499. END;
  5500. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5501. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5502. ELSE
  5503. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5504. Emit(Mov(position,reg,dim));
  5505. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5506. Emit(Add(position,reg,reg,base));
  5507. MakeMemory(mem, reg, addressType, offset);
  5508. ReleaseIntermediateOperand(reg);
  5509. Emit(Mov(position,mem,value));
  5510. ReleaseIntermediateOperand(mem);
  5511. END;
  5512. END PutMathArrayLenOrIncr;
  5513. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5514. BEGIN
  5515. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5516. END PutMathArrayLength;
  5517. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5518. BEGIN
  5519. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5520. END PutMathArrayIncrement;
  5521. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5522. BEGIN
  5523. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5524. END GetMathArrayIncrement;
  5525. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5526. BEGIN
  5527. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5528. END GetMathArrayLength;
  5529. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5530. VAR dimOp: IntermediateCode.Operand;
  5531. BEGIN
  5532. dimOp := IntermediateCode.Immediate(int32, dim);
  5533. GetMathArrayLength(type, operand, dimOp, check, result);
  5534. END GetMathArrayLengthAt;
  5535. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5536. VAR dimOp: IntermediateCode.Operand;
  5537. BEGIN
  5538. dimOp := IntermediateCode.Immediate(int32, dim);
  5539. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5540. END GetMathArrayIncrementAt;
  5541. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5542. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5543. offset: LONGINT;
  5544. BEGIN
  5545. IF increment THEN
  5546. offset := MathIncrOffset;
  5547. ELSE
  5548. offset := MathLenOffset;
  5549. END;
  5550. INC(offset,operand.dimOffset*2);
  5551. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5552. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5553. END;
  5554. (* static dimension *)
  5555. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5556. IF check & (type.form = SyntaxTree.Tensor) THEN
  5557. DimensionCheck(operand.tag,dim,BrltL);
  5558. END;
  5559. val := SHORT(dim.intValue);
  5560. IF type.form # SyntaxTree.Tensor THEN
  5561. t := SemanticChecker.ArrayBase(type,val);
  5562. type := t.resolved(SyntaxTree.MathArrayType);
  5563. IF type.form = SyntaxTree.Static THEN
  5564. IF increment THEN
  5565. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5566. ELSE
  5567. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5568. END;
  5569. InitOperand(result,ModeValue);
  5570. result.op := res;
  5571. RETURN;
  5572. END;
  5573. END;
  5574. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5575. MakeMemory(res,operand.tag,addressType,offset);
  5576. (*
  5577. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5578. *)
  5579. InitOperand(result,ModeValue);
  5580. result.op := res;
  5581. ELSE
  5582. Convert(dim,addressType);
  5583. IF check THEN
  5584. IF type.form = SyntaxTree.Tensor THEN
  5585. DimensionCheck(operand.tag,dim,BrltL);
  5586. ELSIF isUnchecked THEN (* do nothing *)
  5587. ELSE
  5588. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5589. END;
  5590. END;
  5591. end := NewLabel(); next := NIL;
  5592. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5593. Emit(Mov(position,res,dim));
  5594. Convert(res,int32);
  5595. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5596. WHILE t IS SyntaxTree.MathArrayType DO
  5597. type := t(SyntaxTree.MathArrayType);
  5598. IF type.form = SyntaxTree.Static THEN
  5599. imm := IntermediateCode.Immediate(int32,val);
  5600. next := NewLabel();
  5601. BrneL(next,imm,res);
  5602. IF increment THEN
  5603. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5604. ELSE
  5605. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5606. END;
  5607. Emit(MovReplace(position,res,imm));
  5608. BrL(end);
  5609. ELSE hasDynamicPart := TRUE;
  5610. END;
  5611. t := type.arrayBase.resolved;
  5612. val := val + 1;
  5613. IF next # NIL THEN SetLabel(next) END;
  5614. END;
  5615. IF hasDynamicPart THEN
  5616. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5617. Emit(Mov(position,res2,dim));
  5618. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5619. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5620. Emit(Add(position,res2,res2,imm));
  5621. Emit(Add(position,res2,res2,operand.tag));
  5622. IntermediateCode.MakeMemory(res2,int32);
  5623. Emit(MovReplace(position,res,res2));
  5624. ReleaseIntermediateOperand(res2);
  5625. END;
  5626. SetLabel(end);
  5627. Convert(res,int32);
  5628. InitOperand(result,ModeValue);
  5629. result.op := res;
  5630. END;
  5631. END MathArrayLenOrIncr;
  5632. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5633. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5634. offset: LONGINT;
  5635. BEGIN
  5636. offset := operand.dimOffset+DynamicDim(type)-1;
  5637. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5638. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5639. val := SHORT(dim.intValue);
  5640. t := SemanticChecker.ArrayBase(type,val);
  5641. type := t.resolved(SyntaxTree.ArrayType);
  5642. IF type.form = SyntaxTree.Static THEN
  5643. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5644. ELSE
  5645. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5646. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5647. END;
  5648. UseIntermediateOperand(res);
  5649. InitOperand(result,ModeValue);
  5650. result.op := res;
  5651. ELSE
  5652. Convert(dim,addressType);
  5653. IF ~isUnchecked THEN
  5654. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5655. END;
  5656. end := NewLabel(); next := NIL;
  5657. (* ReuseCopy(dim,res); *)
  5658. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5659. Emit(Mov(position,res,dim));
  5660. Convert(res,int32);
  5661. Convert(res,int32);
  5662. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5663. WHILE t IS SyntaxTree.ArrayType DO
  5664. type := t(SyntaxTree.ArrayType);
  5665. IF type.form = SyntaxTree.Static THEN
  5666. imm := IntermediateCode.Immediate(int32,val);
  5667. next := NewLabel();
  5668. BrneL(next,imm,res);
  5669. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5670. Emit(MovReplace(position,res,imm));
  5671. BrL(end);
  5672. ELSE hasDynamicPart := TRUE;
  5673. END;
  5674. t := type.arrayBase.resolved;
  5675. val := val + 1;
  5676. IF next # NIL THEN SetLabel(next) END;
  5677. END;
  5678. IF hasDynamicPart THEN
  5679. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  5680. Convert(res2,addressType);
  5681. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  5682. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5683. Emit(Sub(position,res2,imm,res2));
  5684. Emit(Add(position,res2,res2,operand.tag));
  5685. IntermediateCode.MakeMemory(res2,int32);
  5686. Emit(MovReplace(position,res,res2));
  5687. ReleaseIntermediateOperand(res2);
  5688. END;
  5689. SetLabel(end);
  5690. Convert(res,int32);
  5691. InitOperand(result,ModeValue);
  5692. result.op := res;
  5693. END;
  5694. END ArrayLen;
  5695. (**
  5696. create a temporary variable in current scope
  5697. **)
  5698. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  5699. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  5700. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  5701. BEGIN
  5702. IF ~register THEN
  5703. variable := temporaries.GetFreeVariable(type, index);
  5704. ELSE
  5705. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  5706. END;
  5707. scope := currentScope;
  5708. IF variable = NIL THEN
  5709. COPY("@hiddenIRVar",string);
  5710. Basic.AppendNumber(string,index);
  5711. name := SyntaxTree.NewIdentifier(string);
  5712. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  5713. variable.SetType(type);
  5714. variable.SetAccess(SyntaxTree.Hidden);
  5715. IF ~register THEN
  5716. temporaries.AddVariable(variable);
  5717. IF scope.lastVariable # NIL THEN
  5718. offset := scope.lastVariable.offsetInBits;
  5719. ELSE
  5720. offset := 0;
  5721. END;
  5722. DEC(offset,system.SizeOf(variable.type));
  5723. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  5724. variable(SyntaxTree.Variable).SetOffset(offset);
  5725. scope.AddVariable(variable(SyntaxTree.Variable));
  5726. scope.EnterSymbol(variable, duplicate);
  5727. ASSERT(~duplicate);
  5728. InitVariable(variable(SyntaxTree.Variable));
  5729. ELSE
  5730. variable.SetUseRegister(TRUE);
  5731. variable(SyntaxTree.Variable).SetOffset(0);
  5732. END;
  5733. ELSE
  5734. InitVariable(variable(SyntaxTree.Variable));
  5735. (*
  5736. ASSERT(variable.type.resolved = type.resolved)
  5737. *)
  5738. END;
  5739. RETURN variable(SyntaxTree.Variable)
  5740. END GetTemporaryVariable;
  5741. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  5742. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  5743. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  5744. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  5745. i: LONGINT; duplicate: BOOLEAN;
  5746. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  5747. VAR variable: SyntaxTree.Variable;
  5748. BEGIN
  5749. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  5750. variable.SetType(type);
  5751. recordScope.AddVariable(variable);
  5752. END AddVariable;
  5753. BEGIN
  5754. name := "@ArrayDescriptor";
  5755. Basic.AppendNumber(name,dimensions);
  5756. identifier := SyntaxTree.NewIdentifier(name);
  5757. parentScope := module.module.moduleScope;
  5758. symbol := parentScope.FindSymbol(identifier);
  5759. IF symbol # NIL THEN
  5760. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  5761. type := typeDeclaration.declaredType;
  5762. ELSE
  5763. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  5764. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  5765. recordScope := SyntaxTree.NewRecordScope(parentScope);
  5766. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  5767. recordType.SetTypeDeclaration(typeDeclaration);
  5768. recordType.SetState(SyntaxTree.Resolved);
  5769. typeDeclaration.SetDeclaredType(recordType);
  5770. AddVariable("@ptr",system.anyType);
  5771. AddVariable("@adr",system.addressType);
  5772. AddVariable("@flags",system.addressType);
  5773. AddVariable("@dim",system.addressType);
  5774. AddVariable("@elementSize",system.addressType);
  5775. FOR i := 0 TO dimensions-1 DO
  5776. name := "@len";
  5777. Basic.AppendNumber(name,i);
  5778. AddVariable(name,system.addressType);
  5779. name := "@incr";
  5780. Basic.AppendNumber(name,i);
  5781. AddVariable(name,system.addressType);
  5782. END;
  5783. parentScope.AddTypeDeclaration(typeDeclaration);
  5784. parentScope.EnterSymbol(typeDeclaration,duplicate);
  5785. ASSERT(~duplicate);
  5786. type := recordType;
  5787. END;
  5788. RETURN type
  5789. END GetMathArrayDescriptorType;
  5790. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  5791. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  5792. BEGIN
  5793. type := GetMathArrayDescriptorType(dimensions);
  5794. Emit(Push(position,op.op));
  5795. (* push type descriptor *)
  5796. reg := TypeDescriptorAdr(type);
  5797. IF ~newObjectFile THEN
  5798. IntermediateCode.MakeMemory(reg,addressType);
  5799. END;
  5800. Emit(Push(position,reg));
  5801. ReleaseIntermediateOperand(reg);
  5802. (* push realtime flag: false by default *)
  5803. Emit(Push(position,false));
  5804. CallThis("Heaps","NewRec",3);
  5805. END NewMathArrayDescriptor;
  5806. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  5807. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  5808. BEGIN
  5809. NEW(string, LEN(s)); COPY(s, string^);
  5810. sv := SyntaxTree.NewStringValue(-1,string);
  5811. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5812. sv.SetType(type);
  5813. Designate(sv,res);
  5814. Emit(Push(position,res.tag));
  5815. Emit(Push(position,res.op));
  5816. ReleaseOperand(res);
  5817. END PushConstString;
  5818. PROCEDURE PushConstBoolean(b: BOOLEAN);
  5819. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  5820. BEGIN
  5821. IF b THEN
  5822. Emit(Push(-1, true));
  5823. ELSE
  5824. Emit(Push(-1, false));
  5825. END;
  5826. END PushConstBoolean;
  5827. PROCEDURE PushConstSet(v: SET);
  5828. VAR value: SyntaxTree.Value; op: Operand;
  5829. BEGIN
  5830. value := SyntaxTree.NewSetValue(-1, v);
  5831. value.SetType(system.setType);
  5832. Evaluate(value, op);
  5833. Emit(Push(-1, op.op));
  5834. ReleaseOperand(op);
  5835. END PushConstSet;
  5836. PROCEDURE PushConstInteger(v: LONGINT);
  5837. VAR value: SyntaxTree.Value; op: Operand;
  5838. BEGIN
  5839. value := SyntaxTree.NewIntegerValue(-1, v);
  5840. value.SetType(system.longintType);
  5841. Evaluate(value, op);
  5842. Emit(Push(-1, op.op));
  5843. ReleaseOperand(op);
  5844. END PushConstInteger;
  5845. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  5846. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  5847. section: IntermediateCode.Section;
  5848. BEGIN
  5849. procedureScope := SyntaxTree.NewProcedureScope(scope);
  5850. Global.GetSymbolSegmentedName(symbol, name);
  5851. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  5852. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  5853. procedure.SetScope(moduleScope);
  5854. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  5855. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  5856. procedure.SetAccess(SyntaxTree.Hidden);
  5857. currentScope := procedureScope;
  5858. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  5859. section.Emit(Enter(-1,NIL,0,0,0));
  5860. RETURN section;
  5861. END OpenInitializer;
  5862. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  5863. BEGIN
  5864. Emit(Leave(0,NIL,0));
  5865. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  5866. section := prev;
  5867. END CloseInitializer;
  5868. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  5869. VAR componentName, parameterName, name: SyntaxTree.IdentifierString; instanceType: ActiveCells.Type;
  5870. parameter: SyntaxTree.Parameter; parameterType: SyntaxTree.Type; portIndex,i,direction,len,value: LONGINT;
  5871. port: ActiveCells.Port;
  5872. prevActiveCellsScope : ActiveCells.Scope;
  5873. dataMemorySize, codeMemorySize: LONGINT;
  5874. variable: SyntaxTree.Variable;
  5875. designator: SyntaxTree.Designator;
  5876. type: SyntaxTree.Type;
  5877. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  5878. VAR left, d: SyntaxTree.Designator; basereg: IntermediateCode.Operand;
  5879. BEGIN
  5880. InitOperand(op,ModeReference);
  5881. op.op := fp;
  5882. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  5883. Dereference(op, x, FALSE);
  5884. result := op;
  5885. Symbol(symbol, op);
  5886. END Field;
  5887. PROCEDURE PushSelf;
  5888. VAR op: IntermediateCode.Operand;
  5889. BEGIN
  5890. IntermediateCode.InitMemory(op, addressType, fp, ToMemoryUnits(system, 2*addressType.sizeInBits));
  5891. Emit(Push(-1, op));
  5892. END PushSelf;
  5893. PROCEDURE Direction(direction: LONGINT): SET;
  5894. BEGIN
  5895. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  5896. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  5897. ELSE HALT(100);
  5898. END;
  5899. END Direction;
  5900. PROCEDURE Parameter(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  5901. VAR sname: SyntaxTree.IdentifierString; i: LONGINT; op: Operand;
  5902. BEGIN
  5903. IF SemanticChecker.IsStaticArray(type, type, len) THEN
  5904. FOR i := 0 TO len-1 DO
  5905. COPY(name, sname);
  5906. AppendIndex(sname, i);
  5907. Parameter(sname, type);
  5908. END;
  5909. ELSE
  5910. (*
  5911. direction := Direction(type(SyntaxTree.PortType).direction);
  5912. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  5913. port.SetWidth(type(SyntaxTree.PortType).sizeInBits);
  5914. *)
  5915. Symbol(cell, op);
  5916. ToMemory(op.op,addressType,0);
  5917. Emit(Push(-1, op.op));
  5918. ReleaseOperand(op);
  5919. PushConstString(name);
  5920. PushConstInteger(portIndex);
  5921. PushConstSet(Direction(type(SyntaxTree.PortType).direction));
  5922. PushConstInteger(type(SyntaxTree.PortType).sizeInBits);
  5923. CallThis("ActiveCellsRuntime","AddPort",5);
  5924. INC(portIndex);
  5925. END;
  5926. END Parameter;
  5927. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  5928. VAR op : Operand; portType: SyntaxTree.PortType; d, left: SyntaxTree.Designator; baseType: SyntaxTree.Type; prevScope: SyntaxTree.Scope;
  5929. size, reg: IntermediateCode.Operand; dim: LONGINT;
  5930. PROCEDURE PushLens(type: SyntaxTree.Type);
  5931. BEGIN
  5932. IF type IS SyntaxTree.ArrayType THEN
  5933. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  5934. Evaluate(type(SyntaxTree.ArrayType).length, op);
  5935. Emit(Push(-1, op.op));
  5936. ReleaseOperand(op);
  5937. INC(dim);
  5938. ELSE
  5939. baseType := type;
  5940. END;
  5941. END PushLens;
  5942. BEGIN
  5943. (* cell *)
  5944. (*prevScope := currentScope;
  5945. currentScope := x.cellScope;
  5946. PushSelf();
  5947. *)
  5948. IF variable.type IS SyntaxTree.ArrayType THEN
  5949. type := variable.type;
  5950. dim := 0;
  5951. PushLens(type);
  5952. portType := baseType.resolved(SyntaxTree.PortType);
  5953. ELSE
  5954. portType := variable.type(SyntaxTree.PortType);
  5955. END;
  5956. PushSelfPointer();
  5957. (*Symbol(cell, op);
  5958. ToMemory(op.op,addressType,0);
  5959. Emit(Push(-1, op.op));
  5960. ReleaseOperand(op);
  5961. *)
  5962. (* port *)
  5963. Field(variable, op);
  5964. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  5965. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  5966. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  5967. Designate(d, op);*)
  5968. Emit(Push(-1, op.op));
  5969. ReleaseOperand(op);
  5970. (* name *)
  5971. PushConstString(name);
  5972. (* inout *)
  5973. PushConstSet(Direction(portType.direction));
  5974. (* width *)
  5975. PushConstInteger(portType.sizeInBits);
  5976. IF variable.type IS SyntaxTree.PortType THEN
  5977. CallThis("ActiveCellsRuntime","AddPort",6);
  5978. ELSIF variable.type IS SyntaxTree.ArrayType THEN
  5979. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5980. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  5981. Emit(Add(position,reg, sp, size));
  5982. (* dim *)
  5983. PushConstInteger(dim);
  5984. (* len array *)
  5985. Emit(Push(position, reg));
  5986. ReleaseIntermediateOperand(reg);
  5987. CallThis("ActiveCellsRuntime","AddPortArray",8);
  5988. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  5989. Emit(Add(position, sp,sp, size));
  5990. END;
  5991. (*currentScope := prevScope;*)
  5992. (*
  5993. PushConstString(name);
  5994. PushConstInteger(portIndex);
  5995. PushConstSet(Direction(type(SyntaxTree.PortType).direction));
  5996. PushConstInteger(type(SyntaxTree.PortType).sizeInBits);
  5997. CallThis("ActiveCellsRuntime","AddPort",5);
  5998. INC(portIndex);
  5999. *)
  6000. END Variable;
  6001. BEGIN
  6002. IF backend.cellsAreObjects THEN
  6003. variable := x.cellScope.firstVariable;
  6004. WHILE (variable # NIL) DO
  6005. type := variable.type.resolved;
  6006. WHILE (type IS SyntaxTree.ArrayType) DO
  6007. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6008. END;
  6009. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6010. (*!!! check port arrays !! *)
  6011. Global.GetSymbolName(variable,name);
  6012. Variable(name,variable);
  6013. END;
  6014. variable := variable.nextVariable;
  6015. END;
  6016. ELSE HALT(200)
  6017. END;
  6018. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6019. (*
  6020. x.typeDeclaration.GetName(componentName);
  6021. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6022. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6023. instanceType.SetDataMemorySize(dataMemorySize);
  6024. END;
  6025. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6026. instanceType.SetInstructionMemorySize(codeMemorySize)
  6027. END;
  6028. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6029. instanceType.AddCapability(ActiveCells.VectorCapability)
  6030. END;
  6031. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6032. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6033. END;
  6034. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6035. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6036. END;
  6037. AddDevices(instanceType, x);
  6038. *)
  6039. (*
  6040. IF x.isCellNet THEN
  6041. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6042. END;
  6043. *)
  6044. (*currentActiveCellsScope := instanceType;*)
  6045. (*
  6046. parameter := x.firstParameter;
  6047. portIndex := 0;
  6048. WHILE parameter # NIL DO
  6049. parameter.GetName(parameterName);
  6050. parameterType := parameter.type.resolved;
  6051. Parameter(parameterName, parameterType);
  6052. (*
  6053. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6054. ParameterArray(parameterType);
  6055. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6056. FOR i := 0 TO len-1 DO
  6057. COPY(parameterName,name);
  6058. AppendIndex(name,i);
  6059. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6060. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6061. INC(portIndex);
  6062. END;
  6063. ELSE
  6064. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6065. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6066. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6067. INC(portIndex);
  6068. END;
  6069. *)
  6070. parameter := parameter.nextParameter;
  6071. END;
  6072. *)
  6073. (*
  6074. Scope(x.cellScope);
  6075. currentActiveCellsScope := prevActiveCellsScope;
  6076. AddModules(instanceType,x.cellScope);
  6077. *)
  6078. END AddPorts;
  6079. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6080. VAR par: ActiveCells.Parameter; name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6081. BEGIN
  6082. Symbol(cell,op);
  6083. ToMemory(op.op,addressType,0);
  6084. Emit(Push(position,op.op));
  6085. ReleaseOperand(op);
  6086. Basic.GetString(property.name, name);
  6087. PushConstString(name);
  6088. IF SemanticChecker.IsStringType(property.type) OR (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6089. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6090. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6091. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6092. Designate(d, op);
  6093. IF SemanticChecker.IsStringType(property.type) THEN
  6094. Emit(Push(-1, op.tag))
  6095. END;
  6096. Emit(Push(-1, op.op));
  6097. ReleaseOperand(op);
  6098. END;
  6099. IF SemanticChecker.IsStringType(property.type) THEN
  6100. ASSERT(SemanticChecker.IsStringType(value.type));
  6101. Designate(value, op);
  6102. Emit(Push(property.position, op.tag));
  6103. Emit(Push(property.position, op.op));
  6104. ReleaseOperand(op);
  6105. CallThis("ActiveCellsRuntime","AddStringProperty",7);
  6106. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6107. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6108. Evaluate(value, op);
  6109. Emit(Push(property.position, op.op));
  6110. ReleaseOperand(op);
  6111. CallThis("ActiveCellsRuntime","AddIntegerProperty",5);
  6112. ELSE
  6113. CallThis("ActiveCellsRuntime","AddFlagProperty",3);
  6114. END;
  6115. END AddProperty;
  6116. PROCEDURE AddProperties(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property);
  6117. BEGIN
  6118. WHILE property # NIL DO
  6119. AddProperty(cellType, cell, property, property.value);
  6120. property := property.nextProperty;
  6121. END;
  6122. END AddProperties;
  6123. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6124. VAR symbol: SyntaxTree.Symbol;
  6125. BEGIN
  6126. WHILE modifier # NIL DO
  6127. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6128. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6129. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6130. ELSE
  6131. (*! move this check to checker *)
  6132. Error(modifier.position, "undefined property");
  6133. END;
  6134. modifier := modifier.nextModifier;
  6135. END;
  6136. END AddModifiers;
  6137. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6138. VAR last: SyntaxTree.Modifier;
  6139. BEGIN
  6140. IF to = NIL THEN
  6141. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6142. ELSE
  6143. last := to;
  6144. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6145. last := last.nextModifier;
  6146. END;
  6147. IF last.identifier # this.identifier THEN
  6148. ASSERT(last.nextModifier = NIL);
  6149. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6150. END;
  6151. END;
  6152. END AppendModifier;
  6153. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6154. BEGIN
  6155. WHILE this # NIL DO
  6156. AppendModifier(to, this);
  6157. this := this.nextModifier;
  6158. END;
  6159. END AppendModifiers;
  6160. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6161. VAR op: Operand;
  6162. BEGIN
  6163. Evaluate(p, op);
  6164. Emit(Push(p.position, op.op));
  6165. ReleaseOperand(op);
  6166. (*
  6167. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6168. p := p(SyntaxTree.Designator).left;
  6169. END;
  6170. IF p # NIL THEN
  6171. Evaluate(p, op);
  6172. Emit(Push(p.position, op.op));
  6173. ReleaseOperand(op);
  6174. ELSE
  6175. Emit(Push(-1, nil));
  6176. END;
  6177. *)
  6178. END PushPort;
  6179. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6180. VAR
  6181. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6182. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6183. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6184. tmp:IntermediateCode.Operand;
  6185. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6186. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6187. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6188. dest: IntermediateCode.Operand;
  6189. staticLength: LONGINT; itype: IntermediateCode.Type;
  6190. convert,isTensor: BOOLEAN;
  6191. recordType: SyntaxTree.RecordType;
  6192. flags: SET;
  6193. left: SyntaxTree.Expression;
  6194. call: SyntaxTree.Designator;
  6195. procedure: SyntaxTree.Procedure;
  6196. temporaryVariable: SyntaxTree.Variable;
  6197. dummy: IntermediateCode.Operand;
  6198. customBuiltin: SyntaxTree.CustomBuiltin;
  6199. isVarPar: ARRAY 3 OF BOOLEAN;
  6200. callsection: Sections.Section;
  6201. segmentedName: Basic.SegmentedName;
  6202. needsTrace: BOOLEAN;
  6203. modifier: SyntaxTree.Modifier;
  6204. previous, init: IntermediateCode.Section;
  6205. prevScope: SyntaxTree.Scope;
  6206. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6207. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6208. priority: IntermediateCode.Operand;
  6209. op,callop: Operand;
  6210. BEGIN
  6211. IF type = NIL THEN RETURN END;
  6212. type := type.resolved;
  6213. IF type IS SyntaxTree.PointerType THEN
  6214. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6215. END;
  6216. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6217. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6218. recordScope := type(SyntaxTree.RecordType).recordScope;
  6219. IF recordScope.bodyProcedure # NIL THEN
  6220. procedure := recordScope.bodyProcedure;
  6221. body := procedure.procedureScope.body;
  6222. Emit(Push(position,self));
  6223. IF body.isActive THEN
  6224. StaticCallOperand(callop,procedure);
  6225. Emit(Push(position,callop.op));
  6226. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6227. Convert(priority,sizeType);
  6228. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6229. END;
  6230. Emit(Push(position,priority));
  6231. ReleaseIntermediateOperand(priority);
  6232. IF backend.cooperative THEN
  6233. Emit(Push(position,self));
  6234. CallThis("Activities","Create",3)
  6235. ELSE
  6236. flags := 0;
  6237. IF body.isSafe THEN
  6238. flags := 1;
  6239. END;
  6240. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6241. Emit(Push(position,self));
  6242. CallThis("Objects","CreateProcess",4)
  6243. END;
  6244. ELSE
  6245. Emit(Push(position,self));
  6246. StaticCallOperand(callop,procedure);
  6247. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6248. END;
  6249. Emit(Pop(position,self));
  6250. END;
  6251. END CallBodies;
  6252. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6253. BEGIN
  6254. actualType := actualType.resolved;
  6255. IF actualType IS SyntaxTree.StringType THEN
  6256. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6257. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6258. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6259. ELSE
  6260. tmp := op.tag;
  6261. IntermediateCode.MakeMemory(tmp,addressType);
  6262. Emit(Push(position,tmp));
  6263. END;
  6264. Emit(Push(position,op.op))
  6265. END PushString;
  6266. PROCEDURE PushTD(type: SyntaxTree.Type);
  6267. VAR op: IntermediateCode.Operand;
  6268. BEGIN
  6269. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6270. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6271. ELSE
  6272. IF type.resolved IS SyntaxTree.PointerType THEN
  6273. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6274. END;
  6275. op := TypeDescriptorAdr(type.resolved);
  6276. IF ~newObjectFile THEN
  6277. IntermediateCode.MakeMemory(op,addressType);
  6278. END;
  6279. Emit(Push(position,op));
  6280. END
  6281. END PushTD;
  6282. BEGIN
  6283. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6284. dest := destination; destination := emptyOperand;
  6285. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6286. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6287. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6288. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6289. CASE x.id OF
  6290. (* ---- COPY ----- *)
  6291. |Global.Copy:
  6292. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6293. (* ---- EXCL, INCL----- *)
  6294. |Global.Excl,Global.Incl:
  6295. Evaluate(p0,s0);
  6296. Evaluate(p1,s1);
  6297. Convert(s1.op,setType);
  6298. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6299. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6300. END;
  6301. ReuseCopy(res,s0.op);
  6302. ReleaseOperand(s0);
  6303. Reuse1(tmp,s1.op);
  6304. ReleaseOperand(s1);
  6305. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6306. IF x.id = Global.Excl THEN
  6307. Emit(Not(position,tmp,tmp));
  6308. Emit(And(position,res,res,tmp));
  6309. ELSE
  6310. Emit(Or(position,res,res,tmp));
  6311. END;
  6312. ReleaseIntermediateOperand(tmp);
  6313. Designate(p0,s0);
  6314. ToMemory(s0.op,setType,0);
  6315. Emit(Mov(position,s0.op,res));
  6316. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6317. (* ---- DISPOSE ----- *)
  6318. |Global.Dispose:
  6319. Designate(p0,s0);
  6320. Emit(Push(position,s0.op));
  6321. ReleaseOperand(s0);
  6322. CallThis(DefaultRuntimeModuleName,"Dispose", 1);
  6323. (* ---- GETPROCEDURE ----- *)
  6324. |Global.GetProcedure:
  6325. Designate(p0,s0);
  6326. PushString(s0,p0.type);
  6327. Designate(p1,s1);
  6328. PushString(s1,p1.type);
  6329. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6330. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6331. ELSE PushTD(procedureType.firstParameter.type)
  6332. END;
  6333. PushTD(procedureType.returnType);
  6334. Designate(p2,s2);
  6335. Emit(Push(position,s2.op));
  6336. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6337. CallThis("Modules","GetProcedure", 7);
  6338. (* ---- ASH, LSH, ROT ----- *)
  6339. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6340. Evaluate(p0,s0);
  6341. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6342. (* make unsigned arguments in order to produced a logical shift *)
  6343. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6344. convert:= TRUE;
  6345. itype := s0.op.type;
  6346. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6347. Convert(s0.op,itype);
  6348. ELSE
  6349. convert := FALSE;
  6350. END;
  6351. END;
  6352. Evaluate(p1,s1);
  6353. IF IsIntegerConstant(p1,hint) THEN
  6354. ReuseCopy(reg,s0.op);
  6355. IF hint > 0 THEN
  6356. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6357. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6358. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6359. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6360. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6361. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6362. END;
  6363. ELSIF hint < 0 THEN
  6364. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6365. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6366. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6367. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6368. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6369. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6370. END;
  6371. END;
  6372. ReleaseOperand(s0); ReleaseOperand(s1);
  6373. ELSE
  6374. exit := NewLabel();
  6375. end := NewLabel();
  6376. ReuseCopy(reg,s0.op);
  6377. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6378. Reuse1(tmp,s1.op);
  6379. Emit(Neg(position,tmp,s1.op));
  6380. Convert(tmp,s1.op.type);
  6381. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6382. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6383. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6384. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6385. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6386. END;
  6387. ReleaseIntermediateOperand(tmp);
  6388. BrL(end);
  6389. SetLabel(exit);
  6390. ReuseCopy(tmp,s1.op);
  6391. Convert(tmp,s1.op.type);
  6392. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6393. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6394. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6395. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6396. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6397. END;
  6398. ReleaseIntermediateOperand(tmp);
  6399. SetLabel(end);
  6400. ReleaseOperand(s0); ReleaseOperand(s1);
  6401. END;
  6402. InitOperand(result,ModeValue);
  6403. IF convert THEN
  6404. itype := reg.type;
  6405. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6406. Convert(reg,itype);
  6407. END;
  6408. result.op := reg;
  6409. (* ---- CAP ----- *)
  6410. |Global.Cap:
  6411. Evaluate(p0,result);
  6412. ReuseCopy(reg,result.op);
  6413. ReleaseIntermediateOperand(result.op);
  6414. ignore := NewLabel();
  6415. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6416. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6417. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6418. SetLabel(ignore);
  6419. result.op := reg;
  6420. (* ---- CHR ----- *)
  6421. |Global.Chr, Global.Chr32:
  6422. Evaluate(p0,result);
  6423. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6424. |Global.Entier, Global.EntierH:
  6425. Evaluate(p0,result);
  6426. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6427. (* ---- MIN and MAX ----- *)
  6428. |Global.Max,Global.Min:
  6429. Evaluate(p0,s0);
  6430. Evaluate(p1,s1);
  6431. Reuse2(res,s0.op,s1.op);
  6432. else := NewLabel();
  6433. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6434. ELSE BrltL(else,s1.op,s0.op) END;
  6435. Emit(Mov(position,res,s0.op));
  6436. ReleaseOperand(s0);
  6437. end := NewLabel();
  6438. BrL(end);
  6439. SetLabel(else);
  6440. Emit(MovReplace(position,res,s1.op));
  6441. SetLabel(end);
  6442. ReleaseOperand(s1);
  6443. InitOperand(result,ModeValue);
  6444. result.op := res;
  6445. (* ---- ODD ----- *)
  6446. |Global.Odd:
  6447. IF ~conditional THEN
  6448. ConditionToValue(x)
  6449. ELSE
  6450. Evaluate(p0,result);
  6451. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6452. Reuse1(res,result.op);
  6453. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6454. ReleaseIntermediateOperand(result.op);
  6455. result.op := res;
  6456. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6457. ReleaseOperand(result);
  6458. BrL(falseLabel);
  6459. END;
  6460. (* ---- ORD ----- *)
  6461. |Global.Ord, Global.Ord32:
  6462. Evaluate(p0,result);
  6463. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6464. (* ---- SHORT, LONG ----- *)
  6465. |Global.Short, Global.Long:
  6466. Evaluate(p0,result);
  6467. IF x.type IS SyntaxTree.ComplexType THEN
  6468. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6469. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6470. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6471. ELSE
  6472. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6473. END
  6474. (* ---- HALT, SYSTEM.HALT----- *)
  6475. |Global.Halt, Global.systemHalt:
  6476. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6477. EmitTrap (position, val);
  6478. (* ---- ASSERT ----- *)
  6479. |Global.Assert:
  6480. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6481. trueL := NewLabel();
  6482. falseL := NewLabel();
  6483. Condition(p0,trueL,falseL);
  6484. IF p1 = NIL THEN val := AssertTrap
  6485. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6486. END;
  6487. SetLabel(falseL);
  6488. EmitTrap(position,val);
  6489. SetLabel(trueL);
  6490. END;
  6491. (*
  6492. Emit(TrapC(result.op,val);
  6493. *)
  6494. (* ---- INC, DEC----- *)
  6495. |Global.Inc,Global.Dec:
  6496. Expression(p0); adr := result.op;
  6497. LoadValue(result,p0.type); l := result;
  6498. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6499. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6500. END;
  6501. IF x.id = Global.Inc THEN
  6502. Emit(Add(position,l.op,l.op,r.op));
  6503. ELSE
  6504. Emit(Sub(position,l.op,l.op,r.op));
  6505. END;
  6506. ReleaseOperand(l); ReleaseOperand(r);
  6507. (* ---- LEN ----- *)
  6508. |Global.Len: (* dynamic length, static length done by checker *)
  6509. Designate(p0,operand);
  6510. IF p1 = NIL THEN
  6511. InitOperand(l,ModeValue);
  6512. l.op := IntermediateCode.Immediate(int32,0);
  6513. ELSE
  6514. Evaluate(p1,l);
  6515. END;
  6516. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6517. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6518. Dereference(operand, p0.type.resolved, FALSE);
  6519. END;
  6520. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6521. ReleaseOperand(operand); ReleaseOperand(l);
  6522. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6523. ASSERT(p1 # NIL);
  6524. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6525. Dereference(operand,p0.type.resolved,FALSE);
  6526. END;
  6527. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6528. ReleaseOperand(operand); ReleaseOperand(l);
  6529. ELSE HALT(100);
  6530. END;
  6531. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6532. (* ---- FIRST ---- *)
  6533. |Global.First:
  6534. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6535. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6536. ELSE
  6537. Designate(p0, result)
  6538. END
  6539. (* ---- LAST ---- *)
  6540. |Global.Last:
  6541. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6542. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6543. ELSE
  6544. Designate(p0, result);
  6545. (* make sure result.op is a register *)
  6546. tmp := result.op;
  6547. ReuseCopy(result.op, result.op);
  6548. ReleaseIntermediateOperand(tmp);
  6549. (* add offset to result.op *)
  6550. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6551. END
  6552. (* ---- STEP ---- *)
  6553. |Global.Step:
  6554. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6555. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6556. ELSE
  6557. Designate(p0, result);
  6558. (* make sure result.op is a register *)
  6559. tmp := result.op;
  6560. ReuseCopy(result.op, result.op);
  6561. ReleaseIntermediateOperand(tmp);
  6562. (* add offset to result.op *)
  6563. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6564. END
  6565. (* ---- RE ---- *)
  6566. |Global.Re:
  6567. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6568. Designate(p0, result)
  6569. ELSE
  6570. Evaluate(p0, result)
  6571. END
  6572. (* ---- IM ---- *)
  6573. |Global.Im:
  6574. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6575. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6576. Designate(p0, result);
  6577. (* make sure result.op is a register *)
  6578. tmp := result.op;
  6579. ReuseCopy(result.op, result.op);
  6580. ReleaseIntermediateOperand(tmp);
  6581. (* add offset to result.op *)
  6582. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6583. (* ---- ABS ----- *)
  6584. |Global.Abs:
  6585. Evaluate(p0,operand);
  6586. type := p0.type.resolved;
  6587. InitOperand(result,ModeValue);
  6588. Reuse1a(result.op,operand.op,dest);
  6589. Emit(Abs(position,result.op,operand.op));
  6590. ReleaseOperand(operand);
  6591. (* ---- WAIT ----- *)
  6592. |Global.Wait:
  6593. Evaluate(p0,operand);
  6594. Emit(Push(position,operand.op));
  6595. ReleaseOperand(operand);
  6596. CallThis("Activities","Wait", 1);
  6597. (* ---- NEW ----- *)
  6598. |Global.New:
  6599. (*! the following code is only correct for "standard" Oberon calling convention *)
  6600. type := p0.type.resolved;
  6601. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6602. THEN
  6603. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6604. IF backend.cooperative THEN
  6605. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6606. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6607. IF recordType.isObject THEN
  6608. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6609. IF recordType.IsActive() THEN
  6610. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6611. END;
  6612. IF recordType.IsProtected() THEN
  6613. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6614. END;
  6615. ELSE
  6616. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6617. END;
  6618. END;
  6619. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6620. CallThis("Runtime","New", 1);
  6621. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6622. Emit(Result(position, pointer));
  6623. exit := NewLabel();
  6624. BreqL(exit,pointer,nil);
  6625. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6626. GetRecordTypeName (recordType,name);
  6627. IF ~recordType.isObject THEN
  6628. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6629. END;
  6630. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6631. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6632. IF recordType.isObject THEN
  6633. IF recordType.IsProtected() THEN
  6634. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6635. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6636. END;
  6637. IF recordType.IsActive() THEN
  6638. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6639. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6640. END;
  6641. END;
  6642. END;
  6643. (* initialize fields *)
  6644. IF type(SyntaxTree.PointerType).isPlain THEN
  6645. size := 0;
  6646. ELSIF recordType.isObject THEN
  6647. size := BaseObjectTypeSize;
  6648. ELSE
  6649. size := BaseRecordTypeSize;
  6650. END;
  6651. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  6652. (* call initializer *)
  6653. constructor := GetConstructor(recordType);
  6654. IF constructor # NIL THEN
  6655. (*! should be unified with ProcedureCallDesignator *)
  6656. Emit(Push(position,pointer));
  6657. ReleaseIntermediateOperand(pointer);
  6658. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6659. FOR i := 1 TO x.parameters.Length()-1 DO
  6660. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6661. formalParameter := formalParameter.nextParameter;
  6662. END;
  6663. (* static call of the constructor *)
  6664. GetCodeSectionNameForSymbol(constructor,name);
  6665. ASSERT(~constructor.isInline);
  6666. IF constructor.scope.ownerModule # module.module THEN
  6667. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6668. ELSE
  6669. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6670. END;
  6671. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  6672. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6673. Emit(Pop(position,pointer));
  6674. END;
  6675. (* call bodies *)
  6676. CallBodies(pointer,p0.type);
  6677. SetLabel(exit);
  6678. needsTrace := p0.NeedsTrace();
  6679. IF needsTrace THEN ModifyAssignments(true) END;
  6680. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  6681. Emit(Push(position, pointer));
  6682. CallThis("GarbageCollector","Watch",0);
  6683. Emit(Pop(position, pointer));
  6684. END;
  6685. Designate(p0,l);
  6686. IF needsTrace THEN
  6687. CallAssignPointer(l.op, pointer);
  6688. ELSE
  6689. ToMemory(l.op,addressType,0);
  6690. Emit(Mov(position,l.op,pointer));
  6691. END;
  6692. ReleaseIntermediateOperand(pointer);
  6693. ReleaseOperand(l);
  6694. IF needsTrace THEN ModifyAssignments(false) END;
  6695. ELSE
  6696. temporaryVariable := GetTemporaryVariable(type, FALSE);
  6697. IF temporaryVariable # NIL THEN
  6698. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  6699. ELSE
  6700. Designate(p0,l);
  6701. END;
  6702. (* l.op contains address of pointer to record *)
  6703. Emit(Push(position,l.op)); (* address for use after syscall *)
  6704. Emit(Push(position,l.op));
  6705. ReleaseOperand(l);
  6706. (* push type descriptor *)
  6707. reg := TypeDescriptorAdr(recordType);
  6708. IF ~newObjectFile THEN
  6709. IntermediateCode.MakeMemory(reg,addressType);
  6710. END;
  6711. Emit(Push(position,reg));
  6712. ReleaseIntermediateOperand(reg);
  6713. (* push realtime flag *)
  6714. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6715. ELSE Emit(Push(position,false));
  6716. END;
  6717. CallThis("Heaps","NewRec", 3);
  6718. (* check allocation success, if not successful then do not call initializers and bodies *)
  6719. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6720. Emit(Pop(position,pointer));
  6721. MakeMemory(reg,pointer,addressType,0);
  6722. ReleaseIntermediateOperand(pointer);
  6723. pointer := reg;
  6724. exit := NewLabel();
  6725. BreqL(exit,pointer,nil);
  6726. Emit(Push(position,pointer));
  6727. (* initialize fields *)
  6728. InitFields(recordType, pointer,0);
  6729. (* call initializer *)
  6730. constructor := GetConstructor(recordType);
  6731. IF constructor # NIL THEN
  6732. (*! should be unified with ProcedureCallDesignator *)
  6733. Emit(Push(position,pointer));
  6734. ReleaseIntermediateOperand(pointer);
  6735. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6736. FOR i := 1 TO x.parameters.Length()-1 DO
  6737. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6738. formalParameter := formalParameter.nextParameter;
  6739. END;
  6740. (* static call of the constructor *)
  6741. GetCodeSectionNameForSymbol(constructor,name);
  6742. ASSERT(~constructor.isInline);
  6743. IF constructor.scope.ownerModule # module.module THEN
  6744. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6745. ELSE
  6746. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6747. END;
  6748. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  6749. ELSE
  6750. ReleaseIntermediateOperand(pointer);
  6751. END;
  6752. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6753. Emit(Pop(position,pointer));
  6754. IF temporaryVariable # NIL THEN
  6755. Designate(p0,l);
  6756. ToMemory(l.op,addressType,0);
  6757. Emit(Mov(position,l.op,pointer));
  6758. ReleaseOperand(l);
  6759. result.tag := emptyOperand;
  6760. END;
  6761. (* call bodies *)
  6762. CallBodies(pointer,p0.type);
  6763. ReleaseIntermediateOperand(pointer);
  6764. IF temporaryVariable # NIL THEN
  6765. end := NewLabel();
  6766. BrL(end);
  6767. SetLabel(exit);
  6768. Designate(p0,l);
  6769. ToMemory(l.op,addressType,0);
  6770. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  6771. ReleaseOperand(l);
  6772. SetLabel(end);
  6773. ELSE
  6774. SetLabel(exit);
  6775. END;
  6776. END;
  6777. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  6778. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  6779. dim := 0;
  6780. IF p1 # NIL THEN
  6781. FOR i := 1 TO x.parameters.Length()-1 DO
  6782. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6783. parameter := x.parameters.GetExpression(i);
  6784. Evaluate(parameter,r);
  6785. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6786. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  6787. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  6788. END;
  6789. Emit(Push(position,r.op));
  6790. IF i=1 THEN
  6791. ReuseCopy(reg,r.op);
  6792. ELSE
  6793. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  6794. END;
  6795. ReleaseOperand(r);
  6796. INC(dim);
  6797. END;
  6798. Convert(reg,addressType);
  6799. ELSE
  6800. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6801. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  6802. END;
  6803. openDim := dim;
  6804. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  6805. IF backend.cooperative THEN
  6806. size := ToMemoryUnits(system,system.SizeOf(type));
  6807. WHILE type IS SyntaxTree.ArrayType DO
  6808. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6809. END;
  6810. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  6811. IF (size # 1) THEN
  6812. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6813. END;
  6814. Emit(Push(position,reg));
  6815. size := ToMemoryUnits(system,system.SizeOf(type));
  6816. IF (size # 1) THEN
  6817. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6818. END;
  6819. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  6820. Emit(Push(position,reg));
  6821. ReleaseIntermediateOperand(reg);
  6822. CallThis("Runtime","New", 1);
  6823. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6824. Emit(Result(position, pointer));
  6825. exit := NewLabel();
  6826. else := NewLabel();
  6827. BreqL(else,pointer,nil);
  6828. IF ~type.hasPointers THEN
  6829. Basic.ToSegmentedName ("BaseTypes.Array",name);
  6830. ELSIF type IS SyntaxTree.RecordType THEN
  6831. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  6832. ELSIF type IS SyntaxTree.ProcedureType THEN
  6833. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  6834. ELSE
  6835. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  6836. END;
  6837. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  6838. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  6839. 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))));
  6840. IF type IS SyntaxTree.RecordType THEN
  6841. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  6842. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  6843. ELSE
  6844. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  6845. END;
  6846. i := openDim;
  6847. WHILE i > 0 DO
  6848. DEC (i);
  6849. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  6850. END;
  6851. needsTrace := p0.NeedsTrace();
  6852. IF needsTrace THEN ModifyAssignments(true) END;
  6853. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  6854. Emit(Push(position, pointer));
  6855. CallThis("GarbageCollector","Watch",0);
  6856. Emit(Pop(position, pointer));
  6857. END;
  6858. Designate(p0,l);
  6859. IF needsTrace THEN
  6860. CallAssignPointer(l.op, pointer);
  6861. ModifyAssignments(false);
  6862. ELSE
  6863. ToMemory(l.op,addressType,0);
  6864. Emit(Mov(position,l.op,pointer));
  6865. END;
  6866. ReleaseIntermediateOperand(pointer);
  6867. ReleaseOperand(l);
  6868. BrL(exit);
  6869. SetLabel(else);
  6870. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  6871. Designate(p0,l);
  6872. IF needsTrace THEN
  6873. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  6874. ELSE
  6875. ToMemory(l.op,addressType,0);
  6876. Emit(Mov(position,l.op,pointer));
  6877. END;
  6878. ReleaseOperand(l);
  6879. SetLabel(exit);
  6880. ELSE
  6881. (*! the following code is only correct for "standard" Oberon calling convention *)
  6882. IF SemanticChecker.ContainsPointer(type) THEN
  6883. IF type IS SyntaxTree.ArrayType THEN
  6884. staticLength := 1;
  6885. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  6886. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  6887. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6888. END;
  6889. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  6890. Emit(Mul(position,reg,reg,tmp));
  6891. END;
  6892. Designate(p0,l);
  6893. IF openDim > 0 THEN
  6894. Emit(Push(position,l.op)); (* address for use after syscall *)
  6895. END;
  6896. Emit(Push(position,l.op)); (* address *)
  6897. ReleaseOperand(l);
  6898. tmp := TypeDescriptorAdr(type);
  6899. IF ~newObjectFile THEN
  6900. IntermediateCode.MakeMemory(tmp,addressType);
  6901. END;
  6902. Emit(Push(position,tmp)); (* type descriptor *)
  6903. ReleaseIntermediateOperand(tmp);
  6904. Emit(Push(position,reg)); (* number Elements *)
  6905. ReleaseIntermediateOperand(reg);
  6906. tmp := IntermediateCode.Immediate(addressType,dim);
  6907. Emit(Push(position,tmp)); (* dimensions *)
  6908. (* push realtime flag *)
  6909. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6910. ELSE Emit(Push(position,false));
  6911. END;
  6912. CallThis("Heaps","NewArr",5)
  6913. ELSE
  6914. size := ToMemoryUnits(system,system.SizeOf(type));
  6915. IF (size # 1) THEN
  6916. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6917. END;
  6918. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  6919. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  6920. Emit(Add(position,reg,reg,tmp));
  6921. Designate(p0,l);
  6922. IF openDim >0 THEN
  6923. Emit(Push(position,l.op)); (* address for use after syscall *)
  6924. END;
  6925. Emit(Push(position,l.op)); (* address for syscall *)
  6926. ReleaseOperand(l); (* pointer address *)
  6927. Emit(Push(position,reg)); (* size *)
  6928. ReleaseIntermediateOperand(reg);
  6929. (* push realtime flag *)
  6930. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6931. ELSE Emit(Push(position,false));
  6932. END;
  6933. CallThis("Heaps","NewSys", 3)
  6934. END;
  6935. IF openDim > 0 THEN
  6936. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6937. Emit(Pop(position,adr));
  6938. ToMemory(adr,addressType,0);
  6939. ReuseCopy(tmp,adr);
  6940. ReleaseIntermediateOperand(adr);
  6941. adr := tmp;
  6942. else := NewLabel();
  6943. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  6944. i := openDim-1;
  6945. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6946. WHILE (i >= 0) DO
  6947. Emit(Pop(position,reg));
  6948. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  6949. Emit(Mov(position,res,reg));
  6950. DEC(i);
  6951. END;
  6952. ReleaseIntermediateOperand(adr);
  6953. ReleaseIntermediateOperand(reg);
  6954. exit := NewLabel();
  6955. BrL(exit);
  6956. SetLabel(else);
  6957. (* else part: array could not be allocated *)
  6958. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  6959. Emit(Add(position,sp,sp,tmp));
  6960. SetLabel(exit);
  6961. END;
  6962. END;
  6963. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  6964. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  6965. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  6966. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  6967. procedureType := procedure.type(SyntaxTree.ProcedureType);
  6968. left.SetType(procedure.type);
  6969. formalParameter := procedureType.firstParameter;
  6970. (* push array to allocate *)
  6971. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  6972. formalParameter :=formalParameter.nextParameter;
  6973. (* push length array *)
  6974. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  6975. (* push size *)
  6976. type := t0;
  6977. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  6978. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  6979. END;
  6980. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  6981. Emit(Push(position,tmp));
  6982. (* *)
  6983. IF SemanticChecker.ContainsPointer(type) THEN
  6984. tmp := TypeDescriptorAdr(type);
  6985. IF ~newObjectFile THEN
  6986. IntermediateCode.MakeMemory(tmp,addressType);
  6987. END;
  6988. ELSE
  6989. tmp := IntermediateCode.Immediate(addressType, 0);
  6990. END;
  6991. Emit(Push(position,tmp)); (* type descriptor *)
  6992. StaticCallOperand(result,procedure);
  6993. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  6994. ReleaseOperand(result);
  6995. END;
  6996. (*
  6997. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  6998. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  6999. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7000. *)
  7001. ELSE
  7002. dim := 0;
  7003. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7004. (* generate geometry descriptor *)
  7005. Designate(p0,l);
  7006. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7007. ReleaseOperand(l);
  7008. isTensor := TRUE;
  7009. ELSE
  7010. isTensor := FALSE;
  7011. END;
  7012. FOR i := 1 TO x.parameters.Length()-1 DO
  7013. IF ~isTensor THEN
  7014. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7015. END;
  7016. parameter := x.parameters.GetExpression(i);
  7017. Evaluate(parameter,r);
  7018. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7019. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7020. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7021. END;
  7022. Emit(Push(position,r.op));
  7023. IF i=1 THEN
  7024. ReuseCopy(reg,r.op);
  7025. ELSE
  7026. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7027. END;
  7028. ReleaseOperand(r);
  7029. INC(dim);
  7030. END;
  7031. Convert(reg,addressType);
  7032. openDim := dim;
  7033. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7034. (*! the following code is only correct for "standard" Oberon calling convention *)
  7035. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7036. t := type;
  7037. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7038. staticLength := 1;
  7039. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7040. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7041. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7042. END;
  7043. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7044. Emit(Mul(position,reg,reg,tmp));
  7045. END;
  7046. Designate(p0,l);
  7047. IF isTensor THEN
  7048. Dereference(l,type,FALSE);
  7049. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7050. END;
  7051. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7052. Emit(Push(position,l.tag)); (* address *)
  7053. ReleaseOperand(l);
  7054. tmp := TypeDescriptorAdr(t);
  7055. IF ~newObjectFile THEN
  7056. IntermediateCode.MakeMemory(tmp,addressType);
  7057. END;
  7058. Emit(Push(position,tmp)); (* type descriptor *)
  7059. ReleaseIntermediateOperand(tmp);
  7060. Emit(Push(position,reg)); (* number Elements *)
  7061. ReleaseIntermediateOperand(reg);
  7062. tmp := IntermediateCode.Immediate(addressType,0);
  7063. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7064. (* push realtime flag: false by default *)
  7065. Emit(Push(position,false));
  7066. CallThis("Heaps","NewArr",5);
  7067. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7068. Emit(Pop(position,adr));
  7069. GetMathArrayField(tmp,adr,MathPtrOffset);
  7070. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7071. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7072. PutMathArrayField(adr,reg,MathAdrOffset);
  7073. ReleaseIntermediateOperand(tmp);
  7074. ReleaseIntermediateOperand(reg);
  7075. ELSE
  7076. IF isTensor THEN
  7077. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7078. ELSE
  7079. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7080. END;
  7081. IF (size # 1) THEN
  7082. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7083. END;
  7084. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7085. Emit(Add(position,reg,reg,tmp));
  7086. Designate(p0,l);
  7087. IF isTensor THEN
  7088. Dereference(l,type,FALSE);
  7089. END;
  7090. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7091. Emit(Push(position,l.tag)); (* address for syscall *)
  7092. ReleaseOperand(l); (* pointer address *)
  7093. Emit(Push(position,reg)); (* size *)
  7094. ReleaseIntermediateOperand(reg);
  7095. (* push realtime flag: false by default *)
  7096. Emit(Push(position,false));
  7097. CallThis("Heaps","NewSys",3);
  7098. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7099. Emit(Pop(position,adr));
  7100. GetMathArrayField(tmp,adr,MathPtrOffset);
  7101. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7102. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7103. PutMathArrayField(adr,reg,MathAdrOffset);
  7104. ReleaseIntermediateOperand(tmp);
  7105. ReleaseIntermediateOperand(reg);
  7106. END;
  7107. flags := {};
  7108. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7109. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7110. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7111. PutMathArrayField(adr,tmp,MathDimOffset);
  7112. else := NewLabel();
  7113. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7114. i := openDim-1;
  7115. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7116. IF isTensor THEN
  7117. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7118. ELSE
  7119. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7120. END;
  7121. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7122. WHILE (i >= 0) DO
  7123. Emit(Pop(position,reg));
  7124. PutMathArrayLength(adr,reg,i);
  7125. PutMathArrayIncrement(adr,tmp,i);
  7126. IF i > 0 THEN
  7127. IF i=openDim-1 THEN
  7128. ReuseCopy(tmp,tmp);
  7129. END;
  7130. Emit(Mul(position,tmp,tmp,reg));
  7131. END;
  7132. DEC(i);
  7133. END;
  7134. ReleaseIntermediateOperand(adr);
  7135. ReleaseIntermediateOperand(reg);
  7136. ReleaseIntermediateOperand(tmp);
  7137. exit := NewLabel();
  7138. BrL(exit);
  7139. SetLabel(else);
  7140. (* else part: array could not be allocated *)
  7141. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7142. Emit(Add(position,sp,sp,tmp));
  7143. SetLabel(exit);
  7144. END;
  7145. ELSIF type IS SyntaxTree.CellType THEN
  7146. Error(p0.position,"cannot be allocated in runtime yet");
  7147. ELSE (* no pointer to record, no pointer to array *)
  7148. HALT(200);
  7149. END;
  7150. (* ---- ADDRESSOF----- *)
  7151. |Global.systemAdr:
  7152. Designate(p0,s0);
  7153. s0.mode := ModeValue;
  7154. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7155. ReleaseIntermediateOperand(s0.op);
  7156. s0.op := s0.tag;
  7157. IntermediateCode.InitOperand(s0.tag);
  7158. END;
  7159. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7160. result := s0;
  7161. (* ---- BIT ----- *)
  7162. |Global.systemBit:
  7163. Evaluate(p0,s0);
  7164. ToMemory(s0.op,addressType,0);
  7165. ReuseCopy(res,s0.op);
  7166. ReleaseOperand(s0);
  7167. Evaluate(p1,s1);
  7168. Emit(Ror(position,res,res,s1.op));
  7169. ReleaseOperand(s1);
  7170. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7171. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7172. IF ~conditional THEN
  7173. InitOperand(result,ModeValue); result.op := res;
  7174. ELSE
  7175. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7176. BrL(falseLabel);
  7177. ReleaseIntermediateOperand(res);
  7178. END;
  7179. (* --- MSK ----*)
  7180. |Global.systemMsk:
  7181. Evaluate(p0,s0);
  7182. Evaluate(p1,s1);
  7183. ReuseCopy(res,s0.op);
  7184. ReleaseOperand(s0);
  7185. Emit(And(position,res,res,s1.op));
  7186. ReleaseOperand(s1);
  7187. InitOperand(result,ModeValue);
  7188. result.op := res;
  7189. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7190. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7191. Evaluate(p0,s0);
  7192. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7193. ReleaseOperand(s0);
  7194. InitOperand(result,ModeValue);
  7195. result.op := res;
  7196. (* ---- SYSTEM.GetStackPointer ----- *)
  7197. |Global.systemGetStackPointer:
  7198. InitOperand(result,ModeValue);
  7199. result.op := sp;
  7200. (* ---- SYSTEM.GetFramePointer ----- *)
  7201. |Global.systemGetFramePointer:
  7202. InitOperand(result,ModeValue);
  7203. result.op := fp;
  7204. (* ---- SYSTEM.GetActivity ----- *)
  7205. |Global.systemGetActivity:
  7206. ASSERT(backend.cooperative);
  7207. InitOperand(result,ModeValue);
  7208. result.op := ap;
  7209. (* ---- SYSTEM.SetStackPointer ----- *)
  7210. |Global.systemSetStackPointer:
  7211. Evaluate(p0,s0); (* *)
  7212. Emit(Mov(position,sp,s0.op));
  7213. ReleaseOperand(s0);
  7214. (* ---- SYSTEM.SetFramePointer ----- *)
  7215. |Global.systemSetFramePointer:
  7216. Evaluate(p0,s0); (* *)
  7217. Emit(Mov(position,fp,s0.op));
  7218. ReleaseOperand(s0);
  7219. (* ---- SYSTEM.Activity ----- *)
  7220. |Global.systemSetActivity:
  7221. ASSERT(backend.cooperative);
  7222. Evaluate(p0,s0); (* *)
  7223. Emit(Mov(position,ap,s0.op));
  7224. ReleaseOperand(s0);
  7225. (* ---- SYSTEM.VAL ----- *)
  7226. |Global.systemVal:
  7227. Expression(p1);
  7228. s1 := result;
  7229. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7230. IF s1.mode = ModeReference THEN
  7231. (* nothing to be done if not record type, just take over new type *)
  7232. IF (type IS SyntaxTree.RecordType) THEN
  7233. ReleaseIntermediateOperand(s1.tag);
  7234. s1.tag := TypeDescriptorAdr(type);
  7235. IF ~newObjectFile THEN
  7236. IntermediateCode.MakeMemory(s1.tag,addressType);
  7237. END;
  7238. UseIntermediateOperand(s1.tag);
  7239. END;
  7240. result := s1;
  7241. ELSE (* copy over result to different type, may not use convert *)
  7242. itype := IntermediateCode.GetType(system,type);
  7243. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7244. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7245. Emit(Mov(position,s0.op,s1.op));
  7246. ReleaseOperand(s1);
  7247. InitOperand(result,ModeValue);
  7248. result.op := s0.op;
  7249. ELSE (* different size, must convert *)
  7250. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7251. Convert(s1.op, IntermediateCode.GetType(system,type));
  7252. result := s1;
  7253. END;
  7254. END;
  7255. (* ---- SYSTEM.GET ----- *)
  7256. |Global.systemGet:
  7257. Evaluate(p0,s0); (* adr *)
  7258. Designate(p1,s1); (* variable *)
  7259. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7260. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7261. Emit(Mov(position,s1.op,s0.op));
  7262. ReleaseOperand(s1);
  7263. ReleaseOperand(s0);
  7264. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7265. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7266. Evaluate(p0,s0); (* *)
  7267. Evaluate(p1,s1); (* variable *)
  7268. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7269. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7270. (* real part *)
  7271. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7272. Emit(Mov(position,res, s1.op));
  7273. ReleaseIntermediateOperand(res);
  7274. (* imaginary part *)
  7275. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7276. Emit(Mov(position,res, s1.tag));
  7277. ReleaseIntermediateOperand(res);
  7278. ReleaseOperand(s1);
  7279. ReleaseOperand(s0);
  7280. ELSE
  7281. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7282. ReleaseOperand(s0);
  7283. Emit(Mov(position,res,s1.op));
  7284. ReleaseIntermediateOperand(res);
  7285. ReleaseOperand(s1);
  7286. END;
  7287. (* ---- SYSTEM.MOVE ----- *)
  7288. |Global.systemMove:
  7289. Evaluate(p0,s0);
  7290. Evaluate(p1,s1);
  7291. Evaluate(p2,s2);
  7292. Emit(Copy(position,s1.op,s0.op,s2.op));
  7293. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7294. (* ---- SYSTEM.NEW ----- *)
  7295. |Global.systemNew:
  7296. Designate(p0,s0);
  7297. Emit(Push(position,s0.op));
  7298. ReleaseOperand(s0);
  7299. Evaluate(p1,s1);
  7300. Emit(Push(position,s1.op));
  7301. ReleaseOperand(s1);
  7302. (* push realtime flag: false by default *)
  7303. Emit(Push(position,false));
  7304. CallThis("Heaps","NewSys",3);
  7305. (* ---- SYSTEM.CALL ----- *)
  7306. |Global.systemRef:
  7307. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7308. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7309. s0.mode := ModeValue;
  7310. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7311. result := s0
  7312. (* ---- INCR ----- *)
  7313. |Global.Incr:
  7314. Designate(p0,operand);
  7315. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7316. Dereference(operand,p0.type.resolved,FALSE);
  7317. END;
  7318. ASSERT(p1 # NIL);
  7319. Evaluate(p1,l);
  7320. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7321. ReleaseOperand(operand); ReleaseOperand(l);
  7322. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7323. (* ---- SUM ----- *)
  7324. |Global.Sum: HALT(200);
  7325. (* ---- CAS ----- *)
  7326. |Global.Cas:
  7327. needsTrace := p0.NeedsTrace();
  7328. IF needsTrace THEN ModifyAssignments(true) END;
  7329. Designate(p0,s0);
  7330. Evaluate(p1,s1);
  7331. Evaluate(p2,s2);
  7332. IF needsTrace THEN
  7333. Emit(Push(position, s0.op));
  7334. Emit(Push(position, s1.op));
  7335. Emit(Push(position, s2.op));
  7336. CallThis("GarbageCollector","CompareAndSwap",3);
  7337. ELSE
  7338. Emit(Cas(position,s0.op,s1.op,s2.op));
  7339. END;
  7340. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7341. IF needsTrace THEN ModifyAssignments(false) END;
  7342. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7343. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7344. IF conditional THEN
  7345. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7346. BrL(falseLabel);
  7347. ReleaseIntermediateOperand(res);
  7348. END;
  7349. (* ---- DIM ----- *)
  7350. |Global.Dim:
  7351. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7352. Designate(p0,s0);
  7353. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7354. Dereference(s0,p0.type.resolved,FALSE);
  7355. END;
  7356. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7357. ReleaseOperand(s0);
  7358. (* ---- RESHAPE ----- *)
  7359. |Global.Reshape:
  7360. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7361. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7362. left.SetType(procedure.type);
  7363. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7364. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7365. END;
  7366. (* ---- SYSTEM.TYPECODE ----- *)
  7367. |Global.systemTypeCode:
  7368. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7369. IF type.resolved IS SyntaxTree.PointerType THEN
  7370. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7371. END;
  7372. result.op := TypeDescriptorAdr(type);
  7373. IF ~newObjectFile THEN
  7374. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7375. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7376. END;
  7377. result.mode := ModeValue;
  7378. (* ---- SYSTEM.TRACE ----- *)
  7379. |Global.systemTrace:
  7380. SystemTrace(x.parameters, x.position);
  7381. (* ----- CONNECT ------*)
  7382. |Global.Connect:
  7383. IF backend.cellsAreObjects THEN
  7384. PushPort(p0);
  7385. PushPort(p1);
  7386. IF p2 # NIL THEN
  7387. Evaluate(p2, s2);
  7388. Emit(Push(p2.position, s2.op));
  7389. ReleaseOperand(s2);
  7390. ELSE
  7391. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7392. END;
  7393. CallThis("ActiveCellsRuntime","Connect",3);
  7394. ELSE
  7395. Warning(x.position, "cannot run on final hardware");
  7396. END;
  7397. (* ----- DELEGATE ------*)
  7398. |Global.Delegate:
  7399. IF backend.cellsAreObjects THEN
  7400. PushPort(p0);
  7401. PushPort(p1);
  7402. CallThis("ActiveCellsRuntime","Delegate",4);
  7403. ELSE
  7404. Warning(x.position, "cannot run on final hardware");
  7405. END;
  7406. (* ----- SEND ------*)
  7407. |Global.Send:
  7408. Evaluate(p0,s0);
  7409. Evaluate(p1,s1);
  7410. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7411. Emit(Push(position,s0.op));
  7412. Emit(Push(position,s1.op));
  7413. (*
  7414. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7415. *)
  7416. IF ~backend.cellsAreObjects THEN
  7417. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7418. END;
  7419. ReleaseOperand(s0);
  7420. ReleaseOperand(s1);
  7421. IF backend.cellsAreObjects THEN
  7422. CallThis("ActiveCellsRuntime","Send",-1);
  7423. ELSE
  7424. CallThis(ChannelModuleName,"Send",-1);
  7425. END;
  7426. (* ----- RECEIVE ------*)
  7427. |Global.Receive:
  7428. Evaluate(p0,s0);
  7429. Emit(Push(position,s0.op));
  7430. Designate(p1,s1);
  7431. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7432. Emit(Push(position,s1.op));
  7433. IF p2 # NIL THEN
  7434. Designate(p2,s2);
  7435. Emit(Push(position,s2.op));
  7436. END;
  7437. (*
  7438. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7439. *)
  7440. IF ~backend.cellsAreObjects THEN
  7441. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7442. END;
  7443. ReleaseOperand(s0);
  7444. ReleaseOperand(s1);
  7445. ReleaseOperand(s2);
  7446. IF backend.cellsAreObjects THEN
  7447. IF p2 = NIL THEN
  7448. CallThis("ActiveCellsRuntime","Receive",-1)
  7449. ELSE
  7450. CallThis("ActiveCellsRuntime","ReceiveNonBlocking",-1)
  7451. END;
  7452. ELSE
  7453. IF p2 = NIL THEN
  7454. CallThis(ChannelModuleName,"Receive",-1)
  7455. ELSE
  7456. CallThis(ChannelModuleName,"ReceiveNonBlocking",-1)
  7457. END;
  7458. END;
  7459. | Global.systemSpecial:
  7460. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7461. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7462. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7463. (* determine if parameters are of the VAR kind *)
  7464. ASSERT(x.parameters.Length() <= 3);
  7465. formalParameter := procedureType.firstParameter;
  7466. FOR i := 0 TO x.parameters.Length() - 1 DO
  7467. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7468. formalParameter := formalParameter.nextParameter
  7469. END;
  7470. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7471. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7472. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7473. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7474. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7475. IF procedureType.returnType # NIL THEN
  7476. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7477. Emit(Result(position, res));
  7478. (*InitOperand(result,ModeValue);
  7479. result.op := res;
  7480. *)
  7481. IF ~conditional THEN
  7482. InitOperand(result,ModeValue); result.op := res;
  7483. ELSE
  7484. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7485. BrL(falseLabel);
  7486. ReleaseIntermediateOperand(res);
  7487. END;
  7488. END
  7489. ELSE (* function not yet implemented *)
  7490. Error(position,"not yet implemented");
  7491. END;
  7492. destination := dest;
  7493. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  7494. END VisitBuiltinCallDesignator;
  7495. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  7496. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  7497. BEGIN
  7498. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  7499. dest := destination; destination := emptyOperand;
  7500. Expression(x.left);
  7501. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  7502. ELSIF isUnchecked THEN (* no check *)
  7503. ELSE
  7504. trueL := NewLabel();
  7505. falseL := NewLabel();
  7506. IF IsPointerToRecord(x.left.type,recordType) THEN
  7507. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7508. Emit(Mov(position,tag, result.op));
  7509. IF result.mode # ModeValue THEN
  7510. ptr := tag;
  7511. IntermediateCode.MakeMemory(ptr,addressType);
  7512. Emit(Mov(position,tag, ptr));
  7513. END;
  7514. IF ~backend.cooperative THEN
  7515. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7516. END;
  7517. IntermediateCode.MakeMemory(tag,addressType);
  7518. ELSE
  7519. tag := result.tag;
  7520. END;
  7521. TypeTest(tag,x.type,trueL,falseL);
  7522. ReleaseIntermediateOperand(tag);
  7523. SetLabel(falseL);
  7524. EmitTrap(position,TypeCheckTrap);
  7525. SetLabel(trueL);
  7526. END;
  7527. destination := dest;
  7528. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  7529. END VisitTypeGuardDesignator;
  7530. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  7531. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  7532. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  7533. VAR label: Label; pc: LONGINT;
  7534. BEGIN
  7535. IF backend.cooperative & ~isUnchecked THEN
  7536. pc := section.pc;
  7537. label := NewLabel();
  7538. BrneL(label, operand.op, nil);
  7539. EmitTrap(position, NilPointerTrap);
  7540. SetLabel(label);
  7541. INC(statCoopNilCheck, section.pc - pc);
  7542. END;
  7543. END NilCheck;
  7544. BEGIN
  7545. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  7546. ReuseCopy(dereferenced,operand.op);
  7547. ReleaseOperand(operand);
  7548. operand.mode := ModeReference;
  7549. operand.op := dereferenced;
  7550. operand.tag := dereferenced;
  7551. UseIntermediateOperand(operand.tag);
  7552. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  7553. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  7554. ReleaseIntermediateOperand(operand.tag);
  7555. operand.tag := TypeDescriptorAdr(type);
  7556. IF ~newObjectFile THEN
  7557. IntermediateCode.MakeMemory(operand.tag,addressType);
  7558. END;
  7559. ELSE
  7560. IF ~backend.cooperative THEN
  7561. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7562. END;
  7563. IntermediateCode.MakeMemory(operand.tag,addressType);
  7564. END;
  7565. NilCheck(operand.op);
  7566. ELSIF type IS SyntaxTree.ArrayType THEN
  7567. IF isUnsafe THEN
  7568. NilCheck(operand.op);
  7569. ReleaseIntermediateOperand(operand.tag);
  7570. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7571. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  7572. ELSE
  7573. operand.tag := emptyOperand;
  7574. END;
  7575. ELSE
  7576. NilCheck(operand.op);
  7577. IF backend.cooperative THEN
  7578. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  7579. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7580. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  7581. ELSE
  7582. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  7583. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  7584. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7585. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  7586. END;
  7587. END;
  7588. ELSIF type IS SyntaxTree.MathArrayType THEN
  7589. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  7590. IntermediateCode.MakeMemory(operand.op,addressType);
  7591. ELSE HALT(100);
  7592. END;
  7593. END Dereference;
  7594. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  7595. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  7596. BEGIN
  7597. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  7598. dest := destination; destination := emptyOperand;
  7599. Evaluate(x.left,d);
  7600. type := x.type.resolved;
  7601. prevIsUnchecked := isUnchecked;
  7602. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  7603. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  7604. END;
  7605. Dereference(d,type,IsUnsafePointer(x.left.type));
  7606. isUnchecked := prevIsUnchecked;
  7607. result := d;
  7608. 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
  7609. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  7610. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7611. END;
  7612. END;
  7613. destination := dest;
  7614. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  7615. END VisitDereferenceDesignator;
  7616. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  7617. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  7618. BEGIN
  7619. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  7620. dest := destination; destination := emptyOperand;
  7621. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  7622. tag := result.op;
  7623. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  7624. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  7625. StaticCallOperand(result,procedure.super);
  7626. ReleaseIntermediateOperand(result.tag);
  7627. UseIntermediateOperand(tag); (* necessary ? *)
  7628. result.tag := tag;
  7629. destination := dest;
  7630. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  7631. END VisitSupercallDesignator;
  7632. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  7633. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  7634. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  7635. name: Basic.SegmentedName;
  7636. BEGIN
  7637. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  7638. dest := destination; destination := emptyOperand;
  7639. scope := currentScope;
  7640. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  7641. scope := scope.outerScope;
  7642. END;
  7643. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  7644. IF newObjectFile THEN
  7645. moduleSection := meta.ModuleSection();
  7646. IF backend.cooperative THEN
  7647. moduleOffset := 0;
  7648. ELSE
  7649. moduleOffset := moduleSection.pc;
  7650. END;
  7651. result.mode := ModeValue;
  7652. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  7653. ELSE
  7654. Symbol(moduleSelf,result);
  7655. IntermediateCode.MakeMemory(result.op,addressType);
  7656. END
  7657. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  7658. result.mode := ModeValue;
  7659. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  7660. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  7661. ELSE
  7662. GetBaseRegister(basereg,currentScope,scope);
  7663. InitOperand(result,ModeReference);
  7664. result.op := basereg;
  7665. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  7666. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  7667. IF backend.cooperative THEN
  7668. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  7669. END;
  7670. (* tag must be loaded when dereferencing SELF pointer *)
  7671. END;
  7672. destination := dest;
  7673. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  7674. END VisitSelfDesignator;
  7675. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  7676. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  7677. BEGIN
  7678. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  7679. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  7680. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7681. parameter := procedureType.returnParameter;
  7682. VisitParameter(parameter);
  7683. IF Trace THEN TraceExit("VisitResultDesignator") END;
  7684. END VisitResultDesignator;
  7685. (** values *)
  7686. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  7687. BEGIN
  7688. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  7689. IF conditional THEN
  7690. IF x.value THEN BrL(trueLabel)
  7691. ELSE BrL(falseLabel)
  7692. END;
  7693. ELSE
  7694. InitOperand(result,ModeValue);
  7695. IF x.value THEN result.op := true ELSE result.op := false END;
  7696. END;
  7697. END VisitBooleanValue;
  7698. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  7699. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  7700. BEGIN
  7701. Global.GetModuleSegmentedName(module.module, name);
  7702. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  7703. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  7704. RETURN section
  7705. END GetDataSection;
  7706. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  7707. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  7708. BEGIN
  7709. type := vop.type;
  7710. data := GetDataSection();
  7711. pc := EnterImmediate(data,vop);
  7712. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  7713. IntermediateCode.MakeMemory(vop, type);
  7714. END GetImmediateMem;
  7715. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  7716. BEGIN
  7717. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  7718. InitOperand(result,ModeValue);
  7719. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  7720. IF ~supportedImmediate(result.op) &~inData THEN
  7721. GetImmediateMem(result.op)
  7722. END;
  7723. END VisitIntegerValue;
  7724. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  7725. BEGIN
  7726. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  7727. InitOperand(result,ModeValue);
  7728. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  7729. END VisitCharacterValue;
  7730. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  7731. BEGIN
  7732. IF Trace THEN TraceEnter("VisitSetValue") END;
  7733. InitOperand(result,ModeValue);
  7734. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  7735. END VisitSetValue;
  7736. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  7737. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  7738. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  7739. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  7740. BEGIN
  7741. numberElements := x.elements.Length();
  7742. FOR i := 0 TO numberElements-1 DO
  7743. expression := x.elements.GetExpression(i);
  7744. IF expression IS SyntaxTree.MathArrayExpression THEN
  7745. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  7746. ELSE
  7747. inData := TRUE;
  7748. Evaluate(expression,op);
  7749. irv.Emit(Data(position,op.op));
  7750. inData := FALSE;
  7751. ReleaseOperand(op);
  7752. END;
  7753. END;
  7754. END RecursiveData;
  7755. BEGIN
  7756. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  7757. IF ~TryConstantDeclaration() THEN
  7758. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  7759. GetCodeSectionNameForSymbol(constantDeclaration,name);
  7760. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  7761. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  7762. ELSE
  7763. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  7764. END;
  7765. RecursiveData(x.array);
  7766. InitOperand(result,ModeReference);
  7767. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  7768. END
  7769. END VisitMathArrayValue;
  7770. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  7771. VAR constant: Sections.Section;
  7772. BEGIN
  7773. IF constantDeclaration = NIL THEN
  7774. RETURN FALSE
  7775. ELSE
  7776. (* Is a constant in this module: did we generate it already? *)
  7777. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  7778. IF constant # NIL THEN
  7779. InitOperand(result,ModeReference);
  7780. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  7781. RETURN TRUE;
  7782. END;
  7783. END;
  7784. RETURN FALSE
  7785. END TryConstantDeclaration;
  7786. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  7787. BEGIN
  7788. constantDeclaration := x;
  7789. x.value.resolved.Accept(SELF);
  7790. END VisitConstant;
  7791. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  7792. BEGIN
  7793. IF Trace THEN TraceEnter("VisitRealValue") END;
  7794. InitOperand(result,ModeValue);
  7795. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  7796. END VisitRealValue;
  7797. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  7798. VAR
  7799. componentType: SyntaxTree.Type;
  7800. BEGIN
  7801. IF Trace THEN TraceEnter("VisitComplexValue") END;
  7802. ASSERT(x.type IS SyntaxTree.ComplexType);
  7803. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7804. InitOperand(result,ModeValue);
  7805. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  7806. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  7807. END VisitComplexValue;
  7808. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  7809. VAR i: LONGINT; name: Basic.SegmentedName;
  7810. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  7811. BEGIN
  7812. IF Trace THEN TraceEnter("VisitStringValue") END;
  7813. IF ~TryConstantDeclaration() THEN
  7814. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  7815. GetCodeSectionNameForSymbol(constantDeclaration,name);
  7816. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  7817. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  7818. ELSE
  7819. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  7820. END;
  7821. FOR i := 0 TO x.length-1 DO
  7822. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  7823. irv.Emit(Data(position,op));
  7824. END;
  7825. InitOperand(result,ModeReference);
  7826. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  7827. result.tag := IntermediateCode.Immediate(addressType,x.length);
  7828. END
  7829. END VisitStringValue;
  7830. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  7831. BEGIN
  7832. IF Trace THEN TraceEnter("VisitNilValue") END;
  7833. InitOperand(result,ModeValue);
  7834. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  7835. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  7836. END VisitNilValue;
  7837. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  7838. BEGIN
  7839. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  7840. InitOperand(result,ModeValue);
  7841. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  7842. END VisitEnumerationValue;
  7843. (** symbols *)
  7844. PROCEDURE VisitImport(x: SyntaxTree.Import);
  7845. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  7846. END VisitImport;
  7847. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  7848. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  7849. BEGIN
  7850. IF scope # baseScope THEN
  7851. (* left := [fp+8] *)
  7852. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  7853. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  7854. ReuseCopy(left,right);
  7855. ReleaseIntermediateOperand(right);
  7856. scope := scope.outerScope; DEC(level);
  7857. (* { left := [left+8] } *)
  7858. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  7859. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  7860. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  7861. Emit(Mov(position,left,right));
  7862. scope := scope.outerScope; DEC(level);
  7863. END;
  7864. ASSERT((scope = baseScope) OR (baseScope = NIL));
  7865. result := left;
  7866. ELSE
  7867. result := fp;
  7868. END;
  7869. END GetBaseRegister;
  7870. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  7871. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  7872. BEGIN
  7873. IF Trace THEN TraceEnter("VisitVariable"); END;
  7874. type := x.type.resolved;
  7875. IF (x.useRegister) THEN
  7876. InitOperand(result, ModeValue);
  7877. IF x.registerNumber < 0 THEN
  7878. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  7879. reg := x.registerNumber;
  7880. ELSE
  7881. reg := registerUsageCount.Map(x.registerNumber);
  7882. UseRegister(reg);
  7883. END;
  7884. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  7885. ELSIF x.externalName # NIL THEN
  7886. InitOperand(result,ModeReference);
  7887. Basic.ToSegmentedName(x.externalName^, name);
  7888. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  7889. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  7890. InitOperand(result,ModeReference);
  7891. GetBaseRegister(result.op,currentScope,x.scope);
  7892. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  7893. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) THEN (* global variable *)
  7894. InitOperand(result,ModeReference);
  7895. GetCodeSectionNameForSymbol(x,name);
  7896. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  7897. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  7898. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  7899. InitOperand(result,ModeReference);
  7900. GetCodeSectionNameForSymbol(x,name);
  7901. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  7902. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  7903. ELSE (* field, left designator must have been emitted *)
  7904. ASSERT(result.mode = ModeReference);
  7905. IF result.op.mode = IntermediateCode.ModeMemory THEN
  7906. ReuseCopy(temp,result.op);
  7907. ReleaseIntermediateOperand(result.op);
  7908. result.op := temp;
  7909. END;
  7910. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  7911. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  7912. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  7913. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  7914. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7915. END;
  7916. END;
  7917. END;
  7918. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  7919. ValueToCondition(result);
  7920. ELSIF type IS SyntaxTree.ProcedureType THEN
  7921. ReleaseIntermediateOperand(result.tag);
  7922. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  7923. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  7924. UseIntermediateOperand(result.tag);
  7925. ELSE
  7926. result.tag := nil; (* nil *)
  7927. END;
  7928. ELSIF (type IS SyntaxTree.ArrayType) THEN
  7929. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  7930. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  7931. ReleaseIntermediateOperand(result.tag);
  7932. Global.GetSymbolSegmentedName(x,name);
  7933. Basic.AppendToSegmentedName(name,"@len");
  7934. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  7935. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  7936. ELSE
  7937. END;
  7938. ELSE
  7939. ReleaseIntermediateOperand(result.tag);
  7940. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  7941. END;
  7942. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7943. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  7944. ReleaseIntermediateOperand(result.tag);
  7945. result.tag := result.op;
  7946. UseIntermediateOperand(result.tag);
  7947. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  7948. IntermediateCode.MakeMemory(result.op,addressType);
  7949. END;
  7950. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  7951. ReleaseIntermediateOperand(result.tag);
  7952. result.tag := TypeDescriptorAdr(type);
  7953. IF ~newObjectFile THEN
  7954. IntermediateCode.MakeMemory(result.tag,addressType);
  7955. END;
  7956. UseIntermediateOperand(result.tag);
  7957. (* tag for pointer type computed not here but during dereferencing *)
  7958. END;
  7959. IF Trace THEN TraceExit("VisitVariable") END;
  7960. END VisitVariable;
  7961. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  7962. VAR name: ARRAY 256 OF CHAR; res: IntermediateCode.Operand; saved: RegisterEntry;
  7963. BEGIN
  7964. VisitVariable(property);
  7965. (*
  7966. SaveRegisters();ReleaseUsedRegisters(saved);
  7967. PushSelfPointer();
  7968. property.GetName(name);
  7969. PushConstString(name);
  7970. CallThis("ActiveCellsRuntime","GetIntegerProperty",4);
  7971. res := NewRegisterOperand(IntermediateCode.GetType(system,system.longintType));
  7972. Emit(Result(position,res));
  7973. InitOperand(result, ModeValue);
  7974. result.op := res;
  7975. RestoreRegisters(saved);
  7976. (*! emit read property via runtime module *)
  7977. *)
  7978. END VisitProperty;
  7979. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  7980. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  7981. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  7982. BEGIN
  7983. type := x.type.resolved;
  7984. IF Trace THEN TraceEnter("VisitParameter") END;
  7985. IF x.ownerType IS SyntaxTree.CellType THEN
  7986. ptype := x.type.resolved;
  7987. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  7988. IF ~(ptype IS SyntaxTree.PortType) THEN
  7989. InitOperand(result,ModeReference);
  7990. GetCodeSectionNameForSymbol(x,name);
  7991. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  7992. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  7993. RETURN
  7994. ELSE
  7995. InitOperand(result, ModeValue);
  7996. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  7997. adr := 0;
  7998. WHILE parameter # x DO
  7999. parameterType := parameter.type;
  8000. inc := 1;
  8001. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8002. INC(adr, inc);
  8003. parameter := parameter.nextParameter
  8004. END;
  8005. adr := backend.activeCellsSpecification.GetPortAddress(adr);
  8006. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8007. RETURN
  8008. END;
  8009. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8010. InitOperand(result,ModeReference);
  8011. GetCodeSectionNameForSymbol(x,name);
  8012. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8013. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8014. RETURN
  8015. ELSE
  8016. GetBaseRegister(basereg,currentScope,x.scope);
  8017. InitOperand(result,ModeReference);
  8018. result.op := basereg;
  8019. END;
  8020. IF IsOpenArray(type) THEN
  8021. result.tag := basereg;
  8022. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8023. IntermediateCode.MakeMemory(result.op,addressType);
  8024. IF Global.IsOberonProcedure(x.ownerType) THEN
  8025. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8026. UseIntermediateOperand(result.tag);
  8027. ELSE
  8028. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8029. END;
  8030. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8031. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8032. ELSIF IsStaticArray(type) THEN
  8033. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8034. IntermediateCode.MakeMemory(result.op,addressType);
  8035. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8036. ELSIF type IS SyntaxTree.MathArrayType THEN
  8037. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8038. WITH type: SyntaxTree.MathArrayType DO
  8039. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8040. IF type.form = SyntaxTree.Tensor THEN
  8041. ELSIF type.form = SyntaxTree.Open THEN
  8042. result.tag := result.op;
  8043. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8044. IntermediateCode.MakeMemory(result.op,addressType);
  8045. UseIntermediateOperand(result.tag);
  8046. ELSIF type.form = SyntaxTree.Static THEN
  8047. IF x.kind = SyntaxTree.ConstParameter THEN
  8048. IntermediateCode.MakeMemory(result.op,addressType);
  8049. END;
  8050. ELSE HALT(100)
  8051. END;
  8052. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8053. IF type.form = SyntaxTree.Tensor THEN
  8054. ToMemory(result.op,addressType,0);
  8055. ELSIF type.form = SyntaxTree.Open THEN
  8056. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8057. ReuseCopy(result.tag, mem);
  8058. ReleaseIntermediateOperand(mem);
  8059. ReleaseIntermediateOperand(result.op);
  8060. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8061. ELSIF type.form = SyntaxTree.Static THEN
  8062. IntermediateCode.MakeMemory(result.op,addressType);
  8063. ELSE HALT(100)
  8064. END;
  8065. ELSE HALT(100)
  8066. END;
  8067. END;
  8068. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8069. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8070. IntermediateCode.MakeMemory(result.op,addressType);
  8071. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8072. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8073. END;
  8074. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8075. ValueToCondition(result);
  8076. ELSIF type IS SyntaxTree.ProcedureType THEN
  8077. ReleaseIntermediateOperand(result.tag);
  8078. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8079. IF x.kind = SyntaxTree.VarParameter THEN
  8080. ReuseCopy(result.tag,result.op);
  8081. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8082. IntermediateCode.MakeMemory(result.tag,addressType);
  8083. ELSE
  8084. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8085. UseIntermediateOperand(result.tag);
  8086. END;
  8087. ELSE
  8088. result.tag := nil;
  8089. END;
  8090. (* tag for pointer type computed not here but during dereferencing *)
  8091. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8092. ReleaseIntermediateOperand(result.tag);
  8093. result.tag := basereg;
  8094. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8095. IntermediateCode.MakeMemory(result.tag,addressType);
  8096. UseIntermediateOperand(result.tag);
  8097. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8098. ReleaseIntermediateOperand(result.tag);
  8099. result.tag := TypeDescriptorAdr(type);
  8100. IF ~newObjectFile THEN
  8101. IntermediateCode.MakeMemory(result.tag,addressType);
  8102. END;
  8103. UseIntermediateOperand(result.tag);
  8104. END;
  8105. IF Trace THEN TraceExit("VisitParameter") END;
  8106. END VisitParameter;
  8107. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8108. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8109. BEGIN
  8110. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8111. (* left.p: left already emitted *)
  8112. tag := result.op; (* value of pointer to left *)
  8113. (* get type desc *)
  8114. tmp := result.tag;
  8115. IntermediateCode.MakeMemory(tmp,addressType);
  8116. (* get method adr *)
  8117. Reuse1(reg,tmp);
  8118. ReleaseIntermediateOperand(tmp);
  8119. IF backend.cooperative THEN
  8120. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8121. WHILE recordType.baseType # NIL DO
  8122. recordType := recordType.GetBaseRecord ();
  8123. END;
  8124. GetRecordTypeName (recordType,name);
  8125. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8126. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8127. offset := 0;
  8128. ELSE
  8129. offset := 2;
  8130. END;
  8131. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8132. ELSE
  8133. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8134. END;
  8135. InitOperand(operand,ModeReference);
  8136. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8137. operand.op := reg;
  8138. operand.tag := tag;
  8139. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8140. END DynamicCallOperand;
  8141. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8142. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8143. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8144. BEGIN
  8145. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8146. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8147. tag := operand.op;
  8148. ReleaseIntermediateOperand(operand.tag);
  8149. ELSE tag := nil
  8150. END;
  8151. IF x.isInline THEN
  8152. sectionType := Sections.InlineCodeSection;
  8153. ELSE
  8154. sectionType := Sections.CodeSection;
  8155. END;
  8156. IF x.externalName # NIL THEN
  8157. Basic.ToSegmentedName(x.externalName^, name);
  8158. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8159. ELSE
  8160. GetCodeSectionNameForSymbol(x, name);
  8161. IF (x.scope.ownerModule = module.module) THEN
  8162. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8163. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8164. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8165. IF source.pc = 0 THEN (* no code yet *)
  8166. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8167. END;
  8168. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8169. bits := x.procedureScope.body.code.inlineCode;
  8170. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8171. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8172. binary.CopyBits(bits, 0, bits.GetSize());
  8173. source.SetResolved(binary);
  8174. ELSE
  8175. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8176. END;
  8177. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8178. END;
  8179. InitOperand(operand,ModeValue);
  8180. operand.op := reg;
  8181. operand.tag := tag;
  8182. IF Trace THEN TraceExit("StaticCallOperand") END;
  8183. END StaticCallOperand;
  8184. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8185. (* handle expressions of the form designator.procedure or procedure *)
  8186. BEGIN
  8187. IF Trace THEN TraceEnter("VisitProcedure") END;
  8188. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8189. DynamicCallOperand(result,x);
  8190. ELSIF x.isInline THEN
  8191. StaticCallOperand(result,x);
  8192. ELSE
  8193. StaticCallOperand(result,x);
  8194. END;
  8195. IF Trace THEN TraceExit("VisitProcedure") END;
  8196. END VisitProcedure;
  8197. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8198. BEGIN
  8199. VisitProcedure(x);
  8200. END VisitOperator;
  8201. (** statements *)
  8202. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8203. BEGIN
  8204. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8205. Expression(x.call);
  8206. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8207. ReleaseOperand(result)
  8208. END;
  8209. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8210. END VisitProcedureCallStatement;
  8211. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8212. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8213. leftBase, rightBase: SyntaxTree.Type;
  8214. procedureName,s: SyntaxTree.IdentifierString;
  8215. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8216. size: LONGINT; rightKind: LONGINT;
  8217. dummy: IntermediateCode.Operand;
  8218. CONST moduleName = "FoxArrayBase";
  8219. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8220. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8221. BEGIN
  8222. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8223. IF base IS SyntaxTree.MathArrayType THEN
  8224. base := OpenArray(base(SyntaxTree.MathArrayType));
  8225. END;
  8226. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8227. result.SetArrayBase(base);
  8228. RETURN result
  8229. END OpenArray;
  8230. BEGIN
  8231. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8232. SaveRegisters();ReleaseUsedRegisters(saved);
  8233. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8234. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8235. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8236. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8237. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8238. IF leftType.form = SyntaxTree.Tensor THEN
  8239. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8240. ELSIF leftType.form = SyntaxTree.Open THEN
  8241. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8242. ELSIF leftType.form = SyntaxTree.Static THEN
  8243. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8244. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8245. END;
  8246. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8247. IF procedure = NIL THEN
  8248. s := "Instruction not supported on target, emulation procedure ";
  8249. Strings.Append(s,moduleName);
  8250. Strings.Append(s,".");
  8251. Strings.Append(s,procedureName);
  8252. Strings.Append(s," not present");
  8253. Error(position,s);
  8254. ELSE
  8255. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8256. parameter.SetType(leftType);
  8257. parameter.SetAccess(SyntaxTree.Internal);
  8258. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8259. parameter.SetKind(rightKind);
  8260. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8261. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8262. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8263. StaticCallOperand(result,procedure);
  8264. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8265. ReleaseOperand(result);
  8266. END;
  8267. RestoreRegisters(saved);
  8268. END;
  8269. END AssignMathArray;
  8270. VAR modifyAssignmentCounter := 0: LONGINT;
  8271. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8272. VAR processor,mem,dst,val: IntermediateCode.Operand;
  8273. BEGIN
  8274. IF value.intValue = true.intValue THEN
  8275. INC(modifyAssignmentCounter);
  8276. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8277. modifyAssignmentsPC := section.pc;
  8278. ELSE
  8279. DEC(modifyAssignmentCounter);
  8280. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8281. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8282. END;
  8283. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8284. dst := NewRegisterOperand (addressType);
  8285. Emit(Mov(position,dst, processor));
  8286. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8287. Emit(Mov(position,mem, value));
  8288. ReleaseIntermediateOperand(dst);
  8289. END ModifyAssignments;
  8290. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8291. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8292. BEGIN
  8293. type := left.type.resolved;
  8294. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8295. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8296. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8297. IF procedureType.returnParameter = parameter THEN
  8298. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8299. END;
  8300. END;
  8301. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8302. END CopySize;
  8303. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8304. VAR
  8305. leftO, rightO: Operand;
  8306. mem, sizeOp: IntermediateCode.Operand;
  8307. leftType, rightType, componentType: SyntaxTree.Type;
  8308. size: LONGINT;
  8309. parameters: SyntaxTree.ExpressionList;
  8310. procedure: SyntaxTree.Procedure;
  8311. call: SyntaxTree.ProcedureCallDesignator;
  8312. designator: SyntaxTree.Designator;
  8313. isComposite: BOOLEAN;
  8314. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8315. VAR procedureType: SyntaxTree.ProcedureType;
  8316. BEGIN
  8317. IF ReturnedAsParameter(right.type) THEN
  8318. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8319. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8320. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8321. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8322. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8323. IF right.id = Global.Reshape THEN RETURN TRUE
  8324. END;
  8325. END;
  8326. END;
  8327. END;
  8328. RETURN FALSE
  8329. END CanPassAsResultParameter;
  8330. BEGIN
  8331. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8332. leftType := left.type.resolved; rightType:= right.type.resolved;
  8333. IF backend.cooperative & left.NeedsTrace() THEN
  8334. ModifyAssignments(true);
  8335. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8336. Designate(right, rightO);
  8337. Designate(left, leftO);
  8338. ASSERT(leftO.mode = ModeReference);
  8339. TransferToRegister(leftO.op, leftO.op);
  8340. TransferToRegister(rightO.op, rightO.op);
  8341. Emit(Push(position, leftO.op));
  8342. Emit(Push(position, rightO.op));
  8343. CallAssignMethod(leftO.op, rightO.op, left.type);
  8344. Emit(Pop(position, rightO.op));
  8345. Emit(Pop(position, leftO.op));
  8346. sizeOp := CopySize(left);
  8347. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8348. ReleaseOperand(leftO);
  8349. ReleaseOperand(rightO);
  8350. ELSE
  8351. Evaluate(right,rightO);
  8352. Designate(left,leftO);
  8353. ASSERT(leftO.mode = ModeReference);
  8354. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8355. (* copy procedure address first *)
  8356. MakeMemory(mem,leftO.op,addressType,0);
  8357. Emit(Mov(position,mem,rightO.op));
  8358. ReleaseIntermediateOperand(mem);
  8359. (* copy pointer address *)
  8360. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8361. CallAssignPointer(leftO.tag, rightO.tag);
  8362. ELSE
  8363. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8364. CallAssignPointer(leftO.op, rightO.op);
  8365. END;
  8366. ReleaseOperand(leftO);
  8367. ReleaseOperand(rightO);
  8368. END;
  8369. ModifyAssignments(false);
  8370. RETURN;
  8371. END;
  8372. IF CanPassAsResultParameter(right) THEN
  8373. procedureResultDesignator := left(SyntaxTree.Designator);
  8374. Expression(right);
  8375. procedureResultDesignator := NIL;
  8376. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8377. (* left <-- ALIAS OF right: zerocopy *)
  8378. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8379. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8380. designator.SetType(procedure.type);
  8381. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8382. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8383. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8384. END;
  8385. ELSIF leftType IS SyntaxTree.RangeType THEN
  8386. (* LHS is of array range type *)
  8387. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8388. Evaluate(right, rightO);
  8389. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8390. (* first *)
  8391. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8392. Emit(Mov(position,mem, rightO.op));
  8393. ReleaseIntermediateOperand(mem);
  8394. (* last *)
  8395. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8396. Emit(Mov(position,mem, rightO.tag));
  8397. ReleaseIntermediateOperand(mem);
  8398. (* step *)
  8399. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8400. Emit(Mov(position,mem, rightO.extra));
  8401. ReleaseIntermediateOperand(mem);
  8402. ReleaseOperand(rightO);
  8403. ReleaseOperand(leftO)
  8404. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8405. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8406. Evaluate(right, rightO);
  8407. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8408. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8409. (* real part *)
  8410. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8411. Emit(Mov(position,mem, rightO.op));
  8412. ReleaseIntermediateOperand(mem);
  8413. (* imaginary part *)
  8414. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8415. Emit(Mov(position,mem, rightO.tag));
  8416. ReleaseIntermediateOperand(mem);
  8417. ReleaseOperand(rightO);
  8418. ReleaseOperand(leftO)
  8419. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8420. OR (leftType IS SyntaxTree.PortType) THEN
  8421. (* rightO := leftO;*)
  8422. Evaluate(right,rightO);
  8423. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8424. Designate(left,leftO);
  8425. IF leftO.mode = ModeReference THEN
  8426. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8427. destination := mem;
  8428. ELSE
  8429. destination := leftO.op;
  8430. END;
  8431. ReleaseOperand(leftO);
  8432. IF destination.mode # IntermediateCode.Undefined THEN
  8433. Emit(Mov(position,destination,rightO.op));
  8434. END;
  8435. ReleaseOperand(rightO);
  8436. ReleaseIntermediateOperand(mem);
  8437. IntermediateCode.InitOperand(destination);
  8438. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8439. Evaluate(right,rightO);
  8440. Designate(left,leftO);
  8441. MakeMemory(mem,leftO.op,addressType,0);
  8442. Emit(Mov(position,mem,rightO.op));
  8443. ReleaseIntermediateOperand(mem);
  8444. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8445. (* delegate *)
  8446. (*
  8447. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8448. *)
  8449. Emit(Mov(position,leftO.tag,rightO.tag));
  8450. END;
  8451. ReleaseOperand(leftO);
  8452. ReleaseOperand(rightO);
  8453. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8454. Designate(right,rightO);
  8455. Designate(left,leftO);
  8456. sizeOp := CopySize(left);
  8457. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8458. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8459. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8460. IF (rightType IS SyntaxTree.StringType) THEN
  8461. CopyString(left,right);
  8462. 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
  8463. Designate(right,rightO);
  8464. Designate(left,leftO);
  8465. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8466. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8467. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8468. ELSE
  8469. HALT(201)
  8470. END;
  8471. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8472. AssignMathArray(left,right);
  8473. ELSE
  8474. HALT(200);
  8475. END;
  8476. END Assign;
  8477. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8478. BEGIN
  8479. IF Trace THEN TraceEnter("VisitAssignment") END;
  8480. Assign(x.left,x.right);
  8481. IF Trace THEN TraceExit("VisitAssignment") END;
  8482. END VisitAssignment;
  8483. PROCEDURE EmitCooperativeSwitch;
  8484. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8485. BEGIN
  8486. ASSERT (cooperativeSwitches);
  8487. pc := section.pc;
  8488. IF lastSwitchPC = section.pc THEN RETURN END;
  8489. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8490. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8491. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8492. lastSwitchPC := section.pc; CallThis("Activities","Switch",0); SetLabel(skip);
  8493. INC(statCoopSwitch, section.pc - pc);
  8494. END EmitCooperativeSwitch;
  8495. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8496. VAR p0,p1: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  8497. constructor: SyntaxTree.Procedure; s0,s1: Operand; hint: HUGEINT; size: LONGINT;
  8498. BEGIN
  8499. p0 := communication.left; p1 := communication.right;
  8500. IF communication.send THEN
  8501. Evaluate(p0,s0);
  8502. Evaluate(p1,s1);
  8503. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8504. Emit(Push(position,s0.op));
  8505. Emit(Push(position,s1.op));
  8506. (*
  8507. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8508. *)
  8509. IF ~backend.cellsAreObjects THEN
  8510. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  8511. END;
  8512. ReleaseOperand(s0);
  8513. ReleaseOperand(s1);
  8514. IF backend.cellsAreObjects THEN
  8515. CallThis("ActiveCellsRuntime","Send",-1);
  8516. ELSE
  8517. CallThis(ChannelModuleName,"Send",-1);
  8518. END;
  8519. (* ----- RECEIVE ------*)
  8520. ELSE
  8521. Evaluate(p0,s0);
  8522. Emit(Push(position,s0.op));
  8523. Designate(p1,s1);
  8524. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8525. Emit(Push(position,s1.op));
  8526. (*
  8527. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8528. *)
  8529. IF ~backend.cellsAreObjects THEN
  8530. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  8531. END;
  8532. ReleaseOperand(s0);
  8533. ReleaseOperand(s1);
  8534. IF backend.cellsAreObjects THEN
  8535. CallThis("ActiveCellsRuntime","Receive",-1);
  8536. ELSE
  8537. CallThis(ChannelModuleName,"Receive",-1)
  8538. END;
  8539. END;
  8540. END VisitCommunicationStatement;
  8541. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  8542. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  8543. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  8544. VAR true, false: Label; condition, value: BOOLEAN;
  8545. BEGIN
  8546. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  8547. IF condition THEN
  8548. true := NewLabel();
  8549. false := NewLabel();
  8550. Condition(if.condition,true,false);
  8551. SetLabel(true);
  8552. StatementSequence(if.statements);
  8553. BrL(end);
  8554. SetLabel(false);
  8555. ELSE
  8556. IF value THEN (* always true *)
  8557. escape := TRUE;
  8558. StatementSequence(if.statements);
  8559. (* no branch necessary -- rest skipped *)
  8560. END;
  8561. END;
  8562. END IfPart;
  8563. BEGIN
  8564. IF Trace THEN TraceEnter("VisitIfStatement") END;
  8565. end := NewLabel();
  8566. elsifs := x.ElsifParts();
  8567. IfPart(x.ifPart);
  8568. FOR i := 0 TO elsifs-1 DO
  8569. IF ~escape THEN
  8570. elsif := x.GetElsifPart(i);
  8571. IfPart(elsif);
  8572. END;
  8573. END;
  8574. IF (x.elsePart # NIL) & ~escape THEN
  8575. StatementSequence(x.elsePart);
  8576. END;
  8577. SetLabel(end);
  8578. IF Trace THEN TraceExit("VisitIfStatement") END;
  8579. END VisitIfStatement;
  8580. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  8581. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  8582. BEGIN
  8583. (*IF x.variable.type.resolved = x.type.resolved THEN
  8584. (* always true, do nothing *)
  8585. ELSE*)
  8586. Designate(x.variable,res);
  8587. IF IsPointerToRecord(x.variable.type,recordType) THEN
  8588. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  8589. END;
  8590. trueL := NewLabel();
  8591. TypeTest(res.tag,x.type,trueL,falseL);
  8592. ReleaseOperand(res);
  8593. SetLabel(trueL);
  8594. StatementSequence(x.statements);
  8595. BrL(endL);
  8596. END WithPart;
  8597. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  8598. VAR endL,falseL: Label;i: LONGINT;
  8599. BEGIN
  8600. IF Trace THEN TraceEnter("VisitWithStatement") END;
  8601. endL := NewLabel();
  8602. FOR i := 0 TO x.WithParts()-1 DO
  8603. falseL := NewLabel();
  8604. WithPart(x.GetWithPart(i),falseL,endL);
  8605. SetLabel(falseL);
  8606. END;
  8607. IF x.elsePart = NIL THEN
  8608. IF ~isUnchecked THEN
  8609. EmitTrap(position,WithTrap);
  8610. END;
  8611. ELSE
  8612. StatementSequence(x.elsePart)
  8613. END;
  8614. SetLabel(endL);
  8615. IF Trace THEN TraceExit("VisitWithStatement") END;
  8616. END VisitWithStatement;
  8617. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  8618. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  8619. out,else: Label; label: Label;
  8620. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  8621. symbol: SyntaxTree.Symbol;
  8622. BEGIN
  8623. (*! split case statement into if-elsif statements for large case label lists *)
  8624. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  8625. size := x.max-x.min+1;
  8626. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  8627. END;
  8628. Evaluate(x.variable,var);
  8629. ReuseCopy(tmp,var.op);
  8630. ReleaseIntermediateOperand(var.op);
  8631. var.op := tmp;
  8632. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  8633. Convert(var.op,addressType);
  8634. size := x.max-x.min+1;
  8635. else := NewLabel();
  8636. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  8637. (*
  8638. UniqueId(name,module.module,"case",caseId);
  8639. *)
  8640. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  8641. Global.GetModuleSegmentedName(module.module, name);
  8642. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  8643. symbol := SyntaxTree.NewSymbol(name[1]);
  8644. symbol.SetScope(moduleScope);
  8645. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  8646. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  8647. section.isCaseTable := TRUE;
  8648. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  8649. ReuseCopy(res,var.op);
  8650. ReleaseOperand(var);
  8651. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  8652. Emit(Add(position,res,res,jmp));
  8653. IntermediateCode.MakeMemory(res,addressType);
  8654. Emit(Br(position,res));
  8655. ReleaseIntermediateOperand(res);
  8656. out := NewLabel();
  8657. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  8658. part := x.GetCasePart(i);
  8659. constant := part.firstConstant;
  8660. label := NewLabel();
  8661. SetLabel(label);
  8662. WHILE(constant # NIL) DO (* case labels for this case part *)
  8663. FOR j := constant.min TO constant.max DO
  8664. fixups[j-x.min] := label;
  8665. END;
  8666. constant := constant.next;
  8667. END;
  8668. StatementSequence(part.statements);
  8669. BrL(out);
  8670. END;
  8671. SetLabel(else);
  8672. FOR i := 0 TO size-1 DO
  8673. IF fixups[i] = NIL THEN
  8674. fixups[i] := else;
  8675. END;
  8676. END;
  8677. IF x.elsePart # NIL THEN
  8678. StatementSequence(x.elsePart);
  8679. ELSIF ~isUnchecked THEN
  8680. EmitTrap(position,CaseTrap);
  8681. END;
  8682. SetLabel(out);
  8683. FOR i := 0 TO size-1 DO
  8684. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  8685. section.Emit(Data(position,op));
  8686. END;
  8687. IF Trace THEN TraceExit("VisitCaseStatement") END;
  8688. END VisitCaseStatement;
  8689. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  8690. VAR start: Label; true,false: Label;
  8691. BEGIN
  8692. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  8693. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8694. start := NewLabel();
  8695. true := NewLabel();
  8696. false := NewLabel();
  8697. SetLabel(start);
  8698. Condition(x.condition,true,false);
  8699. SetLabel(true);
  8700. StatementSequence(x.statements);
  8701. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8702. BrL(start);
  8703. SetLabel(false);
  8704. IF Trace THEN TraceExit("VisitWhileStatement") END;
  8705. END VisitWhileStatement;
  8706. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  8707. VAR false,true: Label;
  8708. BEGIN
  8709. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  8710. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8711. true := NewLabel();
  8712. false := NewLabel();
  8713. SetLabel(false);
  8714. StatementSequence(x.statements);
  8715. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8716. Condition(x.condition,true,false);
  8717. SetLabel(true);
  8718. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  8719. END VisitRepeatStatement;
  8720. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  8721. VAR
  8722. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  8723. temporaryVariable: SyntaxTree.Variable;
  8724. temporaryVariableDesignator : SyntaxTree.Designator;
  8725. BEGIN
  8726. IF Trace THEN TraceEnter("VisitForStatement") END;
  8727. true := NewLabel();
  8728. false := NewLabel();
  8729. start := NewLabel();
  8730. Assign(x.variable,x.from);
  8731. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  8732. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  8733. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  8734. Assign(temporaryVariableDesignator,x.to);
  8735. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  8736. IF by > 0 THEN
  8737. cmp := Scanner.LessEqual
  8738. ELSE
  8739. cmp := Scanner.GreaterEqual
  8740. END;
  8741. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  8742. binary.SetType(system.booleanType);
  8743. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8744. SetLabel(start);
  8745. Condition(binary,true,false);
  8746. SetLabel(true);
  8747. StatementSequence(x.statements);
  8748. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  8749. binary.SetType(x.variable.type);
  8750. Assign(x.variable,binary);
  8751. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8752. BrL(start);
  8753. SetLabel(false);
  8754. IF Trace THEN TraceExit("VisitForStatement") END;
  8755. END VisitForStatement;
  8756. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  8757. VAR prevLoop: Label;
  8758. BEGIN
  8759. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  8760. prevLoop := currentLoop;
  8761. currentLoop := NewLabel();
  8762. StatementSequence(x.statements);
  8763. SetLabel(currentLoop);
  8764. currentLoop := prevLoop;
  8765. IF Trace THEN TraceExit("VisitExitableBlock") END;
  8766. END VisitExitableBlock;
  8767. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  8768. VAR prevLoop,start: Label;
  8769. BEGIN
  8770. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  8771. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8772. start := NewLabel();
  8773. prevLoop := currentLoop;
  8774. SetLabel(start);
  8775. currentLoop := NewLabel();
  8776. StatementSequence(x.statements);
  8777. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8778. BrL(start);
  8779. SetLabel(currentLoop);
  8780. currentLoop := prevLoop;
  8781. IF Trace THEN TraceExit("VisitLoopStatement") END;
  8782. END VisitLoopStatement;
  8783. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  8784. VAR outer: SyntaxTree.Statement;
  8785. BEGIN
  8786. IF Trace THEN TraceEnter("VisitExitStatement") END;
  8787. IF locked THEN (* r if we jump out of an exclusive block *)
  8788. outer := x.outer;
  8789. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  8790. outer := outer.outer;
  8791. END;
  8792. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  8793. Lock(FALSE);
  8794. END;
  8795. END;
  8796. BrL(currentLoop);
  8797. IF Trace THEN TraceExit("VisitExitStatement") END;
  8798. END VisitExitStatement;
  8799. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  8800. VAR
  8801. expression, parameterDesignator: SyntaxTree.Expression;
  8802. type, componentType: SyntaxTree.Type;
  8803. res, right: Operand;
  8804. left, size, mem, reg: IntermediateCode.Operand;
  8805. parameter: SyntaxTree.Parameter;
  8806. procedure: SyntaxTree.Procedure;
  8807. procedureType: SyntaxTree.ProcedureType;
  8808. returnTypeOffset: LONGINT;
  8809. delegate: BOOLEAN;
  8810. map: SymbolMap;
  8811. BEGIN
  8812. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  8813. expression := x.returnValue;
  8814. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8815. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8816. IF currentIsInline THEN
  8817. IF expression # NIL THEN
  8818. map := currentMapper.Get(NIL);
  8819. IF map # NIL THEN
  8820. Assign(map.to, expression);
  8821. END;
  8822. END;
  8823. BrL(currentInlineExit);
  8824. RETURN;
  8825. END;
  8826. IF expression # NIL THEN
  8827. type := expression.type.resolved;
  8828. IF (expression IS SyntaxTree.ResultDesignator) THEN
  8829. IF locked THEN Lock(FALSE) END;
  8830. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  8831. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  8832. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  8833. (* return without structured return parameter *)
  8834. Evaluate(expression,res);
  8835. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  8836. IF locked OR profile THEN
  8837. Emit(Push(position,res.op));
  8838. IF delegate THEN HALT(200) END;
  8839. ReleaseOperand(res);
  8840. IF locked THEN Lock(FALSE) END;
  8841. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  8842. reg := NewRegisterOperand(res.op.type);
  8843. Emit(Pop(position,reg));
  8844. Emit(Return(position,reg));
  8845. ReleaseIntermediateOperand(reg);
  8846. ELSE
  8847. Emit(Return(position,res.op));
  8848. ReleaseOperand(res);
  8849. END;
  8850. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  8851. THEN
  8852. (* return using structured return parameter *)
  8853. 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)
  8854. OR SemanticChecker.IsPointerType(type));
  8855. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  8856. parameter :=procedureType.returnParameter;
  8857. ASSERT(parameter # NIL);
  8858. returnTypeOffset := parameter.offsetInBits;
  8859. (*
  8860. IF parameter# NIL THEN
  8861. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  8862. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  8863. ELSE
  8864. returnTypeOffset := system.offsetFirstParameter
  8865. END;
  8866. *)
  8867. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  8868. IF type IS SyntaxTree.RangeType THEN
  8869. (* array range type *)
  8870. Evaluate(expression, right);
  8871. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  8872. Emit(Mov(position,mem, right.op)); (* first *)
  8873. ReleaseIntermediateOperand(mem);
  8874. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8875. Emit(Mov(position,mem, right.tag)); (* last *)
  8876. ReleaseIntermediateOperand(mem);
  8877. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8878. Emit(Mov(position,mem, right.extra)); (* step *)
  8879. ReleaseIntermediateOperand(mem);
  8880. ReleaseOperand(right);
  8881. ELSIF type IS SyntaxTree.ComplexType THEN
  8882. Evaluate(expression, right);
  8883. componentType := type(SyntaxTree.ComplexType).componentType;
  8884. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  8885. Emit(Mov(position,mem, right.op)); (* real part *)
  8886. ReleaseIntermediateOperand(mem);
  8887. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8888. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  8889. ReleaseIntermediateOperand(mem);
  8890. ReleaseOperand(right);
  8891. ELSE (* covers cases: pointer / record / array *)
  8892. parameter := procedureType.returnParameter;
  8893. checker.SetCurrentScope(currentScope);
  8894. ASSERT(parameter # NIL);
  8895. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  8896. Assign(parameterDesignator,expression);
  8897. END;
  8898. ReleaseIntermediateOperand(left);
  8899. IF locked THEN Lock(FALSE) END;
  8900. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  8901. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  8902. parameter := procedureType.returnParameter;
  8903. checker.SetCurrentScope(currentScope);
  8904. IF parameter = NIL THEN
  8905. Error(procedure.position, "structured return of parameter of procedure not found");
  8906. ELSE
  8907. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  8908. Assign(parameterDesignator,expression);
  8909. END;
  8910. IF locked THEN Lock(FALSE) END;
  8911. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  8912. ELSE
  8913. HALT(200);
  8914. END;
  8915. ELSE
  8916. IF locked THEN Lock(FALSE) END;
  8917. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  8918. END;
  8919. IF backend.cooperative THEN
  8920. BrL(exitLabel);
  8921. ELSE
  8922. Emit(Leave(position,procedure,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  8923. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  8924. END;
  8925. IF Trace THEN TraceExit("VisitReturnStatement") END;
  8926. END VisitReturnStatement;
  8927. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  8928. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  8929. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  8930. statements: SyntaxTree.StatementSequence;
  8931. name, suffix: SyntaxTree.IdentifierString;
  8932. BEGIN
  8933. Strings.IntToStr(awaitProcCounter,suffix);
  8934. Strings.Concat("@AwaitProcedure",suffix,name);
  8935. identifier := SyntaxTree.NewIdentifier(name);
  8936. INC(awaitProcCounter);
  8937. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  8938. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  8939. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  8940. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  8941. procedure.SetAccess(SyntaxTree.Hidden);
  8942. procedure.SetScope(currentScope);
  8943. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  8944. procedureType.SetReturnType(system.booleanType);
  8945. procedure.SetType(procedureType);
  8946. body := SyntaxTree.NewBody(x.position,procedureScope);
  8947. procedureScope.SetBody(body);
  8948. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  8949. returnStatement.SetReturnValue(x.condition);
  8950. statements := SyntaxTree.NewStatementSequence();
  8951. statements.AddStatement(returnStatement);
  8952. body.SetStatementSequence(statements);
  8953. currentScope.AddProcedure(procedure);
  8954. RETURN procedure
  8955. END MakeAwaitProcedure;
  8956. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  8957. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  8958. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  8959. BEGIN
  8960. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  8961. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  8962. IF backend.cooperative THEN
  8963. start := NewLabel();
  8964. true := NewLabel();
  8965. false := NewLabel();
  8966. SetLabel(start);
  8967. Condition(x.condition,true,false);
  8968. SetLabel(false);
  8969. PushSelfPointer();
  8970. CallThis("ExclusiveBlocks","Await",1);
  8971. BrL(start);
  8972. SetLabel(true);
  8973. PushSelfPointer();
  8974. CallThis("ExclusiveBlocks","FinalizeAwait",1);
  8975. ELSE
  8976. proc := MakeAwaitProcedure(x);
  8977. Emit(Push(position,fp));
  8978. GetCodeSectionNameForSymbol(proc,name);
  8979. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  8980. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  8981. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  8982. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  8983. Emit(Result(position,res));
  8984. (*
  8985. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  8986. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  8987. *)
  8988. InitOperand(result,ModeValue);
  8989. result.op := res;
  8990. label := NewLabel();
  8991. BreqL(label, result.op, SELF.true);
  8992. ReleaseOperand(result);
  8993. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  8994. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  8995. Emit(Push(position,res));
  8996. Emit(Push(position,fp));
  8997. PushSelfPointer();
  8998. Emit(Push(position,nil));
  8999. CallThis("Objects","Await",4);
  9000. SetLabel(label);
  9001. END;
  9002. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9003. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9004. END VisitAwaitStatement;
  9005. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9006. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9007. BEGIN
  9008. FOR i := 0 TO x.Length() - 1 DO
  9009. statement := x.GetStatement( i );
  9010. Statement(statement);
  9011. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9012. END;
  9013. END StatementSequence;
  9014. PROCEDURE PushSelfPointer;
  9015. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9016. BEGIN
  9017. scope := currentScope;
  9018. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9019. scope := scope.outerScope;
  9020. END;
  9021. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9022. IF ~newObjectFile THEN
  9023. Symbol(moduleSelf,op);
  9024. IntermediateCode.MakeMemory(op.op,addressType);
  9025. ELSE
  9026. moduleSection := meta.ModuleSection();
  9027. IF backend.cooperative THEN
  9028. moduleOffset := 0;
  9029. ELSE
  9030. moduleOffset := moduleSection.pc;
  9031. END;
  9032. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9033. END;
  9034. ELSE
  9035. GetBaseRegister(op.op,currentScope,scope);
  9036. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9037. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9038. IF backend.cooperative THEN
  9039. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9040. END;
  9041. IntermediateCode.MakeMemory(op.op,addressType);
  9042. END;
  9043. Emit(Push(position,op.op));
  9044. ReleaseOperand(op);
  9045. END PushSelfPointer;
  9046. PROCEDURE Lock(lock: BOOLEAN);
  9047. BEGIN
  9048. IF Trace THEN TraceEnter("Lock") END;
  9049. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9050. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9051. ASSERT(modifyAssignmentCounter = 0);
  9052. IF dump # NIL THEN
  9053. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9054. dump.Ln;dump.Update;
  9055. END;
  9056. PushSelfPointer;
  9057. IF backend.cooperative THEN
  9058. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9059. IF lock THEN CallThis("ExclusiveBlocks","Enter",2)
  9060. ELSE CallThis("ExclusiveBlocks","Exit",2);
  9061. END;
  9062. ELSE
  9063. Emit(Push(position,true));
  9064. IF lock THEN CallThis("Objects","Lock",2)
  9065. ELSE CallThis("Objects","Unlock",2);
  9066. END;
  9067. END;
  9068. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9069. IF Trace THEN TraceExit("Lock") END;
  9070. END Lock;
  9071. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9072. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9073. BEGIN
  9074. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9075. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9076. previouslyUnchecked := isUnchecked;
  9077. isUnchecked := isUnchecked OR x.isUnchecked;
  9078. previouslyCooperativeSwitches := cooperativeSwitches;
  9079. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9080. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9081. IF x.statements # NIL THEN
  9082. StatementSequence(x.statements);
  9083. END;
  9084. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9085. isUnchecked := previouslyUnchecked;
  9086. cooperativeSwitches := previouslyCooperativeSwitches;
  9087. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9088. END VisitStatementBlock;
  9089. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9090. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9091. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9092. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9093. procedure: SyntaxTree.Procedure;
  9094. map: SymbolMap;
  9095. BEGIN
  9096. scope := currentScope;
  9097. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9098. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9099. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9100. return := emptyOperand;
  9101. IF Trace THEN TraceEnter("VisitCode") END;
  9102. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9103. NEW(in, x.inRules.Length());
  9104. FOR i := 0 TO LEN(in)-1 DO
  9105. statement := x.inRules.GetStatement(i);
  9106. WITH statement: SyntaxTree.Assignment DO
  9107. Evaluate(statement.right, operand);
  9108. result := operand.op;
  9109. NEW(str, 64);
  9110. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9111. in[i] := result; IntermediateCode.SetString(in[i], str);
  9112. ReleaseIntermediateOperand(operand.tag);
  9113. END;
  9114. END;
  9115. ELSE in := NIL
  9116. END;
  9117. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9118. NEW(out, x.outRules.Length());
  9119. FOR i := 0 TO LEN(out)-1 DO
  9120. statement := x.outRules.GetStatement(i);
  9121. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9122. WITH statement: SyntaxTree.Assignment DO
  9123. Evaluate(statement.left, operand); (*?? or designate *)
  9124. result := operand.op;
  9125. NEW(str, 64);
  9126. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9127. out[i] := result; IntermediateCode.SetString(out[i], str);
  9128. ReleaseIntermediateOperand(operand.tag);
  9129. |statement: SyntaxTree.ReturnStatement DO
  9130. NEW(str, 64);
  9131. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9132. IF currentIsInline THEN
  9133. map := currentMapper.Get(NIL);
  9134. Evaluate(map.to, operand);
  9135. out[i] := operand.op;
  9136. ELSE
  9137. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9138. END;
  9139. IntermediateCode.SetString(out[i], str);
  9140. ReleaseIntermediateOperand(operand.tag);
  9141. return := out[i];
  9142. ELSE
  9143. END;
  9144. END;
  9145. ELSE out := NIL
  9146. END;
  9147. Emit(Asm(x.position,x.sourceCode, in, out));
  9148. IF in # NIL THEN
  9149. FOR i := 0 TO LEN(in)-1 DO
  9150. ReleaseIntermediateOperand(in[i]);
  9151. END;
  9152. END;
  9153. IF out # NIL THEN
  9154. FOR i := 0 TO LEN(out)-1 DO
  9155. WITH statement: SyntaxTree.Assignment DO
  9156. ReleaseIntermediateOperand(out[i]);
  9157. ELSE
  9158. IF currentIsInline THEN
  9159. ReleaseIntermediateOperand(out[i]);
  9160. END;
  9161. END;
  9162. statement := x.outRules.GetStatement(i);
  9163. END;
  9164. END;
  9165. IF return.mode # IntermediateCode.Undefined THEN
  9166. IF currentIsInline THEN
  9167. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9168. Symbol(procedureType.returnParameter, par);
  9169. MakeMemory(mem, par.op, return.type, 0);
  9170. ReleaseOperand(par);
  9171. Emit(Mov(position, mem, return));
  9172. ReleaseIntermediateOperand(mem);
  9173. ELSE
  9174. Emit(Return(position,return));
  9175. END;
  9176. IF currentIsInline THEN RETURN END;
  9177. Emit(Leave(position,procedure,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9178. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9179. ReleaseIntermediateOperand(return);
  9180. END;
  9181. IF Trace THEN TraceExit("VisitCode") END;
  9182. END VisitCode;
  9183. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9184. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9185. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9186. const, call: IntermediateCode.Operand;
  9187. parameterDesignator: SyntaxTree.Expression;
  9188. saved: RegisterEntry;
  9189. name: Basic.SegmentedName;
  9190. BEGIN
  9191. IF Trace THEN TraceEnter("ParameterCopies") END;
  9192. parameter := x.firstParameter;
  9193. WHILE parameter # NIL DO
  9194. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9195. type := parameter.type.resolved;
  9196. IF IsOpenArray(type) THEN
  9197. VisitParameter(parameter);
  9198. op := result;
  9199. IF backend.cooperative & parameter.NeedsTrace() THEN
  9200. length := GetArrayLength(type, op.tag);
  9201. size := NewRegisterOperand(addressType);
  9202. base := ArrayBaseType(type);
  9203. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9204. Emit(Mul(position, size, length, const));
  9205. dst := NewRegisterOperand (addressType);
  9206. Emit(Mov(position, dst, size));
  9207. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9208. Emit(Sub(position,dst,sp,dst));
  9209. Emit(And(position,dst,dst,const));
  9210. Emit(Mov(position,sp,dst));
  9211. par := fp;
  9212. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9213. IntermediateCode.InitImmediate(null, byteType, 0);
  9214. Emit(Fill(position, dst, size, null));
  9215. ReleaseIntermediateOperand(dst);
  9216. ReleaseIntermediateOperand(length);
  9217. SaveRegisters();ReleaseUsedRegisters(saved);
  9218. (* register dst has been freed before SaveRegisters already *)
  9219. base := ArrayBaseType(type);
  9220. (* assign method of open array *)
  9221. IF base.IsRecordType() THEN
  9222. Emit (Push(position, length));
  9223. Emit (Push(position, dst));
  9224. Emit (Push(position, op.op));
  9225. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9226. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9227. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9228. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9229. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9230. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9231. Emit (Push(position,length));
  9232. Emit (Push(position, dst));
  9233. Emit (Push(position, length));
  9234. Emit (Push(position, op.op));
  9235. CallThis("GarbageCollector","AssignDelegateArray", 4);
  9236. ELSE
  9237. Emit (Push(position, length));
  9238. Emit (Push(position, dst));
  9239. Emit (Push(position, length));
  9240. Emit (Push(position, op.op));
  9241. CallThis("GarbageCollector","AssignPointerArray", 4);
  9242. ASSERT(ArrayBaseType(type).IsPointer());
  9243. END;
  9244. RestoreRegisters(saved);
  9245. ELSE
  9246. temp := GetDynamicSize(type,op.tag);
  9247. ReuseCopy(size,temp);
  9248. ReleaseIntermediateOperand(temp);
  9249. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9250. Emit(Sub(position,size,sp,size));
  9251. Emit(And(position,size,size,const));
  9252. Emit(Mov(position,sp,size));
  9253. par := fp;
  9254. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9255. ReleaseIntermediateOperand(size);
  9256. size := GetDynamicSize(type,op.tag);
  9257. END;
  9258. Emit(Copy(position,sp,op.op,size));
  9259. ReleaseIntermediateOperand(size);
  9260. ReleaseOperand(op);
  9261. IntermediateCode.MakeMemory(par,addressType);
  9262. Emit(Mov(position,par,sp));
  9263. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9264. checker.SetCurrentScope(currentScope);
  9265. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9266. Assign(parameterDesignator,parameterDesignator);
  9267. END;
  9268. END;
  9269. parameter := parameter.nextParameter;
  9270. END;
  9271. IF Trace THEN TraceExit("ParameterCopies") END;
  9272. END ParameterCopies;
  9273. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9274. VAR x: SyntaxTree.Variable;
  9275. BEGIN
  9276. x := scope.firstVariable;
  9277. WHILE x # NIL DO
  9278. InitVariable(x);
  9279. x := x.nextVariable;
  9280. END;
  9281. END InitVariables;
  9282. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9283. BEGIN
  9284. IF (symbol # NIL) THEN
  9285. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9286. ELSE
  9287. RETURN 0
  9288. END;
  9289. END GetFingerprint;
  9290. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9291. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9292. end: Label;res: IntermediateCode.Operand; cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9293. saved: RegisterEntry;
  9294. BEGIN
  9295. IF Trace THEN TraceEnter("Body") END;
  9296. ReleaseUsedRegisters(saved); (* just in case ... *)
  9297. section := ir;
  9298. exitLabel := NewLabel ();
  9299. IF moduleBody THEN moduleBodySection := section END;
  9300. IF ir.comments # NIL THEN
  9301. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9302. commentPrintout.SingleStatement(TRUE);
  9303. dump := ir.comments;
  9304. ELSE
  9305. commentPrintout := NIL;
  9306. dump := NIL;
  9307. END;
  9308. registerUsageCount.Init;
  9309. prevScope := currentScope;
  9310. currentScope := scope;
  9311. lastSwitchPC := 0;
  9312. cooperativeSwitches := backend.cooperative;
  9313. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9314. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9315. IF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple & ~backend.cooperative THEN
  9316. (*
  9317. PushSelfPointer();
  9318. (*
  9319. moduleSection := ModuleSection(module);
  9320. moduleOffset := moduleSection.pc;
  9321. op := IntermediateCode.Address(addressType, moduleSection, moduleOffset);
  9322. Emit(Push(position,op));
  9323. *)
  9324. res := NewRegisterOperand(bool);
  9325. CallThis2("Modules","PublishThis","Runtime","InsertModule",1,res);
  9326. end := NewLabel();
  9327. (*AcquireThisRegister(bool, IntermediateCode.Result);*)
  9328. BrneL(end, res,true);
  9329. ReleaseIntermediateOperand(res);
  9330. *)
  9331. END;
  9332. IF x # NIL THEN
  9333. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9334. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9335. IF moduleBody THEN
  9336. ProfilerInit();
  9337. ELSE
  9338. Basic.SegmentedNameToString(ir.name, string);
  9339. ProfilerAddProcedure(numberProcedures,string);
  9340. ProfilerEnterExit(numberProcedures,TRUE);
  9341. END;
  9342. END;
  9343. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9344. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9345. END;
  9346. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9347. IF moduleBody THEN
  9348. InitVariables(moduleScope)
  9349. END;
  9350. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9351. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9352. IF procedure = cellScope.bodyProcedure THEN
  9353. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9354. StaticCallOperand(op, cellScope.constructor);
  9355. Emit(Call(position,op.op,0));
  9356. END;
  9357. END;
  9358. END;
  9359. ParameterCopies(procedureType);
  9360. InitVariables(scope);
  9361. IF x.code = NIL THEN
  9362. VisitStatementBlock(x);
  9363. ELSE
  9364. VisitCode(x.code)
  9365. END;
  9366. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9367. ir.SetFinally(ir.pc);
  9368. StatementSequence(x.finally)
  9369. END;
  9370. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9371. IF ~backend.cooperative THEN
  9372. ProfilerEnterExit(numberProcedures,FALSE);
  9373. END;
  9374. INC(numberProcedures);
  9375. END;
  9376. END;
  9377. IF backend.cooperative THEN
  9378. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9379. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9380. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9381. (*! not required any more? check and delete!
  9382. PushSelfPointer();
  9383. CallThis("Modules","SetInitialized",1);
  9384. *)
  9385. (*
  9386. SetLabel(end);
  9387. *)
  9388. END;
  9389. IF x # NIL THEN
  9390. SELF.position := x.position;
  9391. END;
  9392. CheckRegistersFree();
  9393. ASSERT(modifyAssignmentCounter = 0);
  9394. currentScope := prevScope;
  9395. IF Trace THEN TraceExit("Body") END;
  9396. END Body;
  9397. END ImplementationVisitor;
  9398. MetaDataGenerator=OBJECT
  9399. VAR
  9400. implementationVisitor: ImplementationVisitor;
  9401. module: Sections.Module;
  9402. moduleName: ARRAY 128 OF CHAR;
  9403. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9404. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9405. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9406. TypeTags: LONGINT; (* type extension level support *)
  9407. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9408. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9409. BEGIN
  9410. IF implementationVisitor.backend.cooperative THEN
  9411. TypeTags := MAX(LONGINT); (* only 3 extensions allowed *)
  9412. BaseTypesTableOffset := 0;
  9413. MethodTableOffset := 2;
  9414. TypeRecordBaseOffset := 0;
  9415. ELSIF simple THEN
  9416. TypeTags := 3; (* only 3 extensions allowed *)
  9417. BaseTypesTableOffset := -1;
  9418. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9419. TypeRecordBaseOffset := TypeTags;
  9420. ELSE
  9421. TypeTags := 16;
  9422. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9423. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9424. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9425. END;
  9426. SELF.simple := simple;
  9427. SELF.implementationVisitor := implementationVisitor;
  9428. implementationVisitor.meta := SELF;
  9429. declarationVisitor.meta := SELF;
  9430. END InitMetaDataGenerator;
  9431. PROCEDURE SetModule(module: Sections.Module);
  9432. BEGIN
  9433. SELF.module := module
  9434. END SetModule;
  9435. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9436. BEGIN
  9437. IF implementationVisitor.backend.cooperative THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9438. END GetTypeRecordBaseOffset;
  9439. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9440. VAR moduleTD: IntermediateCode.Section; offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9441. BEGIN
  9442. INC(dataAdrOffset,6);
  9443. Info(section,"headerAdr");
  9444. Address(section,0);
  9445. Info(section,"typeDesc");
  9446. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9447. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9448. NamedSymbol(section, name, symbol, 0, offset);
  9449. Info(section,"mark: LONGINT;");
  9450. Longint(section,-1);
  9451. Info(section,"dataAdr-: ADDRESS");
  9452. Symbol(section,section, dataAdrOffset,0);
  9453. Info(section,"size-: SIZE");
  9454. Address(section,0);
  9455. Info(section,"nextRealtime: HeapBlock;");
  9456. Address(section,0);
  9457. END HeapBlock;
  9458. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9459. VAR i: LONGINT;
  9460. BEGIN
  9461. INC(dataAdrOffset,14);
  9462. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9463. Info(section,"count*: LONGINT");
  9464. Longint(section,0);
  9465. Info(section,"locked*: BOOLEAN");
  9466. Longint(section,0);
  9467. Info(section,"awaitingLock*: ProcessQueue");
  9468. Address(section,0);
  9469. Address(section,0);
  9470. Info(section,"awaitingCond*: ProcessQueue");
  9471. Address(section,0);
  9472. Address(section,0);
  9473. Info(section,"lockedBy*: ANY");
  9474. Address(section,0);
  9475. Info(section,"lock*: ANY");
  9476. Address(section,0);
  9477. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9478. Longint(section,1);
  9479. FOR i := 2 TO 6 DO
  9480. Longint(section,0);
  9481. END;
  9482. END ProtectedHeapBlock;
  9483. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9484. BEGIN
  9485. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9486. END Info;
  9487. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9488. VAR op: IntermediateCode.Operand;
  9489. BEGIN
  9490. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9491. section.Emit(Data(-11,op));
  9492. END Address;
  9493. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9494. VAR op: IntermediateCode.Operand;
  9495. BEGIN
  9496. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9497. section.Emit(Data(-12,op));
  9498. END Size;
  9499. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9500. VAR op: IntermediateCode.Operand;
  9501. BEGIN
  9502. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9503. section.Emit(Data(-1,op));
  9504. END Set;
  9505. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9506. VAR op: IntermediateCode.Operand;
  9507. BEGIN
  9508. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9509. section.Emit(Data(-1,op));
  9510. END Longint;
  9511. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  9512. VAR op,noOperand: IntermediateCode.Operand;
  9513. BEGIN
  9514. IntermediateCode.InitOperand(noOperand);
  9515. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9516. section.PatchOperands(pc,op,noOperand,noOperand);
  9517. END PatchLongint;
  9518. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9519. VAR op, noOperand: IntermediateCode.Operand;
  9520. BEGIN
  9521. IntermediateCode.InitOperand(noOperand);
  9522. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9523. section.PatchOperands(pc,op,noOperand,noOperand);
  9524. END PatchSymbol;
  9525. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  9526. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  9527. BEGIN
  9528. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  9529. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  9530. section.Emit(Data(-1,op));
  9531. END Boolean;
  9532. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  9533. VAR op: IntermediateCode.Operand;
  9534. BEGIN
  9535. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  9536. section.Emit(Data(-1,op));
  9537. END Char;
  9538. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  9539. VAR i: LONGINT;
  9540. BEGIN
  9541. Info(section,str);
  9542. i := 0;
  9543. WHILE(str[i] # 0X) DO
  9544. Char(section,str[i]);
  9545. INC(i);
  9546. END;
  9547. Char(section,0X);
  9548. END String;
  9549. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9550. VAR op: IntermediateCode.Operand;
  9551. BEGIN
  9552. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9553. IntermediateCode.SetOffset(op,realOffset);
  9554. section.Emit(Data(-1,op));
  9555. END NamedSymbol;
  9556. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  9557. BEGIN
  9558. IF symbol= NIL THEN
  9559. Address( section, realOffset);
  9560. ASSERT(virtualOffset = 0);
  9561. ELSE
  9562. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  9563. END;
  9564. END Symbol;
  9565. (* OutPointers delivers
  9566. {pointerOffset}
  9567. *)
  9568. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  9569. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  9570. BEGIN
  9571. type := type.resolved;
  9572. IF type IS SyntaxTree.AnyType THEN
  9573. Symbol(section, symbol, 0, (offset ));
  9574. INC(numberPointers);
  9575. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9576. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  9577. Symbol(section, symbol, 0, offset); INC(numberPointers);
  9578. ELSIF type IS SyntaxTree.PointerType THEN
  9579. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  9580. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  9581. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  9582. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  9583. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  9584. ELSIF (type IS SyntaxTree.RecordType) THEN
  9585. (* never treat a record like a pointer, even if the pointer field is set! *)
  9586. WITH type: SyntaxTree.RecordType DO
  9587. base := type.GetBaseRecord();
  9588. IF base # NIL THEN
  9589. Pointers(offset,symbol,section, base,numberPointers);
  9590. END;
  9591. variable := type.recordScope.firstVariable;
  9592. WHILE(variable # NIL) DO
  9593. IF ~(variable.untraced) THEN
  9594. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9595. END;
  9596. variable := variable.nextVariable;
  9597. END;
  9598. END;
  9599. ELSIF (type IS SyntaxTree.CellType) THEN
  9600. WITH type: SyntaxTree.CellType DO
  9601. base := type.GetBaseRecord();
  9602. IF base # NIL THEN
  9603. Pointers(offset,symbol,section, base,numberPointers);
  9604. END;
  9605. variable := type.cellScope.firstVariable;
  9606. WHILE(variable # NIL) DO
  9607. IF ~(variable.untraced) THEN
  9608. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9609. END;
  9610. variable := variable.nextVariable;
  9611. END;
  9612. END;
  9613. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9614. WITH type: SyntaxTree.ArrayType DO
  9615. IF type.form= SyntaxTree.Static THEN
  9616. n := type.staticLength;
  9617. base := type.arrayBase.resolved;
  9618. WHILE(base IS SyntaxTree.ArrayType) DO
  9619. type := base(SyntaxTree.ArrayType);
  9620. n := n* type.staticLength;
  9621. base := type.arrayBase.resolved;
  9622. END;
  9623. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9624. IF SemanticChecker.ContainsPointer(base) THEN
  9625. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9626. FOR i := 0 TO n-1 DO
  9627. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9628. END;
  9629. END;
  9630. ELSE
  9631. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  9632. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9633. END;
  9634. END;
  9635. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9636. WITH type: SyntaxTree.MathArrayType DO
  9637. IF type.form = SyntaxTree.Static THEN
  9638. n := type.staticLength;
  9639. base := type.arrayBase.resolved;
  9640. WHILE(base IS SyntaxTree.MathArrayType) DO
  9641. type := base(SyntaxTree.MathArrayType);
  9642. n := n* type.staticLength;
  9643. base := type.arrayBase.resolved;
  9644. END;
  9645. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9646. IF SemanticChecker.ContainsPointer(base) THEN
  9647. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9648. FOR i := 0 TO n-1 DO
  9649. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9650. END;
  9651. END;
  9652. ELSE
  9653. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  9654. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9655. END
  9656. END;
  9657. (* ELSE no pointers in type *)
  9658. END;
  9659. END Pointers;
  9660. PROCEDURE DynamicName(source: IntermediateCode.Section; name: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  9661. VAR s: Basic.SectionName; i: LONGINT; ch: CHAR; position: LONGINT;
  9662. BEGIN
  9663. IF pool.Has(name) THEN
  9664. RETURN pool.GetInt(name)
  9665. ELSE
  9666. position := source.pc;
  9667. pool.PutInt(name, position);
  9668. StringPool.GetString(name, s);
  9669. Info(source, s);
  9670. i := 0;
  9671. REPEAT
  9672. ch := s[i]; INC(i);
  9673. Char( source, ch);
  9674. UNTIL ch = 0X;
  9675. END;
  9676. RETURN position;
  9677. END DynamicName;
  9678. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  9679. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  9680. BEGIN
  9681. COPY(moduleName,name);
  9682. Strings.Append(name,suffix);
  9683. Basic.ToSegmentedName(name, pooledName);
  9684. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  9685. IF implementationVisitor.backend.cooperative THEN
  9686. Info(section, "TypeDescriptor");
  9687. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  9688. NamedSymbol(section, pooledName,NIL, 0, 0);
  9689. BasePointer(section);
  9690. offset := 0;
  9691. ELSE
  9692. HeapBlock(mName,typeName,section,2);
  9693. Info(section, "HeapBlock");
  9694. (*
  9695. Symbol(section,section,2,0);
  9696. *)
  9697. Address(section,0); (* empty such that GC does not go on traversing *)
  9698. Info(section, "TypeDescriptor");
  9699. Address(section,0);
  9700. offset := section.pc;
  9701. END;
  9702. RETURN section
  9703. END Block;
  9704. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  9705. VAR name: Basic.SegmentedName;
  9706. BEGIN
  9707. Info(source,"ArrayHeader");
  9708. IF implementationVisitor.backend.cooperative THEN
  9709. sizePC := source.pc;
  9710. Address(source,0);
  9711. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  9712. IF baseType # "" THEN
  9713. Basic.ToSegmentedName(baseType, name);
  9714. NamedSymbol(source, name,NIL, 0, 0);
  9715. ELSE
  9716. Address(source,0);
  9717. END;
  9718. Address(source,0);
  9719. ELSE
  9720. Address(source,0);
  9721. Address(source,0);
  9722. Address(source,0);
  9723. sizePC := source.pc;
  9724. Address(source,0);
  9725. Info(source,"array data");
  9726. END;
  9727. END Array;
  9728. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  9729. BEGIN
  9730. IF implementationVisitor.backend.cooperative THEN
  9731. PatchLongint(section, pc, size);
  9732. PatchLongint(section, pc + 3, size);
  9733. ELSE
  9734. PatchLongint(section, pc, size);
  9735. END;
  9736. END PatchArray;
  9737. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  9738. VAR
  9739. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  9740. sectionArray: POINTER TO ARRAY OF Sections.Section;
  9741. poolMap: Basic.HashTableInt;
  9742. namePool: IntermediateCode.Section;
  9743. namePoolOffset: LONGINT;
  9744. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  9745. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  9746. BEGIN
  9747. Basic.SegmentedNameToString(s1.name,n1);
  9748. Basic.SegmentedNameToString(s2.name,n2);
  9749. index := 0;
  9750. ch1 := n1[index];
  9751. ch2 := n2[index];
  9752. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  9753. INC(index);
  9754. ch1 := n1[index];
  9755. ch2 := n2[index];
  9756. END;
  9757. RETURN ch1 < ch2;
  9758. END Compare;
  9759. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  9760. VAR
  9761. i, j: LONGINT;
  9762. x, t: Sections.Section;
  9763. BEGIN
  9764. IF lo < hi THEN
  9765. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  9766. WHILE i <= j DO
  9767. WHILE Compare(list[i], x) DO INC(i) END;
  9768. WHILE Compare(x, list[j]) DO DEC(j) END;
  9769. IF i <= j THEN
  9770. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  9771. INC(i); DEC(j)
  9772. END
  9773. END;
  9774. IF lo < j THEN QuickSort(list, lo, j) END;
  9775. IF i < hi THEN QuickSort(list, i, hi) END
  9776. END;
  9777. END QuickSort;
  9778. (*
  9779. ExportDesc* = RECORD
  9780. fp*: ADDRESS;
  9781. name* {UNTRACED}: DynamicName;
  9782. adr*: ADDRESS;
  9783. exports*: LONGINT;
  9784. dsc* {UNTRACED}: ExportArray
  9785. END;
  9786. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  9787. *)
  9788. PROCEDURE ExportDesc2(
  9789. source: IntermediateCode.Section;
  9790. namePool: IntermediateCode.Section;
  9791. fingerPrinter: FingerPrinter.FingerPrinter;
  9792. symbol: Sections.Section;
  9793. name: StringPool.Index;
  9794. VAR patchAdr: LONGINT
  9795. ): BOOLEAN;
  9796. VAR fingerPrint: SyntaxTree.FingerPrint;
  9797. BEGIN
  9798. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  9799. & (symbol.type # Sections.InlineCodeSection)
  9800. THEN
  9801. *)
  9802. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  9803. & (symbol.type # Sections.InlineCodeSection))
  9804. THEN
  9805. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  9806. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  9807. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  9808. Longint(source,fingerPrint.shallow);
  9809. ELSE
  9810. Longint(source, 0);
  9811. END;
  9812. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  9813. Symbol(source, symbol,0,0);
  9814. patchAdr := source.pc;
  9815. Address(source,0);
  9816. Address(source,0);
  9817. END;
  9818. RETURN TRUE
  9819. ELSE
  9820. RETURN FALSE
  9821. END;
  9822. END ExportDesc2;
  9823. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  9824. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  9825. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  9826. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  9827. TYPE
  9828. Scope = RECORD
  9829. elements: LONGINT;
  9830. gelements: LONGINT;
  9831. section: IntermediateCode.Section;
  9832. patchAdr: LONGINT;
  9833. arraySizePC: LONGINT;
  9834. beginPC: LONGINT; (* current scope start pc *)
  9835. END;
  9836. BEGIN
  9837. Basic.InitSegmentedName(prev);
  9838. olevel := -1;
  9839. scopes[0].section := source;
  9840. FOR s := 0 TO LEN(sections)-1 DO
  9841. symbol := sections[s];
  9842. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  9843. this := sections[s].name;
  9844. level := 0;
  9845. WHILE (this[level] > 0) DO
  9846. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  9847. INC(level);
  9848. END;
  9849. WHILE level < olevel DO
  9850. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  9851. IF olevel > 0 THEN
  9852. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  9853. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  9854. END;
  9855. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  9856. DEC(olevel);
  9857. END;
  9858. IF (this[level] > 0) THEN
  9859. IF level > olevel THEN
  9860. (*TRACE("opening",level); *)
  9861. IF scopes[level].section = NIL THEN
  9862. arrayName := ".@ExportArray";
  9863. Strings.AppendInt(arrayName, level);
  9864. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  9865. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  9866. END;
  9867. scopes[level].beginPC := scopes[level].section.pc;
  9868. olevel := level;
  9869. scopes[olevel].elements := 0;
  9870. END;
  9871. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  9872. sym := sections[s];
  9873. ELSE
  9874. sym := NIL;
  9875. END;
  9876. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  9877. THEN
  9878. INC(scopes[olevel].elements);
  9879. END;
  9880. (*StringPool.GetString(this[level], name);*)
  9881. (*TRACE(level, name);*)
  9882. (* enter string in scope *)
  9883. INC(level);
  9884. END;
  9885. END;
  9886. Basic.SegmentedNameToString(this, name);
  9887. (*TRACE(level, "enter", name);*)
  9888. prev := this;
  9889. END;
  9890. END;
  9891. WHILE 0 <= olevel DO
  9892. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  9893. IF olevel > 0 THEN
  9894. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  9895. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  9896. END;
  9897. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  9898. DEC(olevel);
  9899. END;
  9900. level := 0;
  9901. WHILE (level < LEN(scopes)) DO
  9902. IF scopes[level].section # NIL THEN
  9903. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  9904. END;
  9905. INC(level);
  9906. END;
  9907. END Export;
  9908. BEGIN
  9909. NEW(fingerPrinter, module.system);
  9910. NEW(poolMap, 64);
  9911. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  9912. NEW(sectionArray, module.allSections.Length());
  9913. FOR i := 0 TO module.allSections.Length() - 1 DO
  9914. section := module.allSections.GetSection(i);
  9915. sectionArray[i] := section;
  9916. END;
  9917. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  9918. Export(sectionArray^);
  9919. END ExportDesc;
  9920. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  9921. VAR
  9922. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  9923. BEGIN
  9924. Info(source, "exception table offsets array descriptor");
  9925. size := 0;
  9926. Array(source,sizePC,"Modules.ExceptionTableEntry");
  9927. Info(source, "exception table content");
  9928. FOR i := 0 TO module.allSections.Length() - 1 DO
  9929. p := module.allSections.GetSection(i);
  9930. IF p.type = Sections.CodeSection THEN
  9931. finallyPC := p(IntermediateCode.Section).finally;
  9932. IF finallyPC>=0 THEN
  9933. Symbol( source, p, 0,0);
  9934. Symbol( source, p, finallyPC, 0);
  9935. Symbol( source, p, finallyPC,0);
  9936. INC(size);
  9937. END;
  9938. END
  9939. END;
  9940. PatchArray(source,sizePC,size);
  9941. END ExceptionArray;
  9942. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  9943. VAR i: LONGINT; ch: CHAR;
  9944. BEGIN
  9945. i := 0;
  9946. REPEAT
  9947. ch := name[i]; INC(i);
  9948. Char( section, ch);
  9949. UNTIL ch = 0X;
  9950. WHILE i < 32 DO
  9951. Char( section, 0X); INC(i);
  9952. END;
  9953. END Name;
  9954. PROCEDURE LongName(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  9955. VAR i: LONGINT; ch: CHAR;
  9956. BEGIN
  9957. i := 0;
  9958. REPEAT
  9959. ch := name[i]; INC(i);
  9960. Char( section, ch);
  9961. UNTIL ch = 0X;
  9962. WHILE i < 128 DO
  9963. Char( section, 0X); INC(i);
  9964. END;
  9965. END LongName;
  9966. PROCEDURE References(section: IntermediateCode.Section);
  9967. CONST
  9968. rfDirect = 1X; rfIndirect = 3X;
  9969. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  9970. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  9971. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  9972. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfRecordPointer=1DX;
  9973. rfArrayFlag = 80X;
  9974. VAR
  9975. size: LONGINT; s: Sections.Section; sizePC, i: LONGINT;
  9976. PROCEDURE BaseType(arrayOf: BOOLEAN; type: SyntaxTree.Type);
  9977. VAR char: CHAR;
  9978. BEGIN
  9979. IF type = NIL THEN char := rfLongint
  9980. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  9981. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  9982. ELSIF type IS SyntaxTree.CharacterType THEN
  9983. IF type.sizeInBits = 8 THEN char := rfChar8
  9984. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  9985. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  9986. END;
  9987. ELSIF type IS SyntaxTree.IntegerType THEN
  9988. IF type.sizeInBits = 8 THEN char := rfShortint
  9989. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  9990. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  9991. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  9992. END;
  9993. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  9994. ELSIF type IS SyntaxTree.AddressType THEN char := rfLongint
  9995. ELSIF type IS SyntaxTree.FloatType THEN
  9996. IF type.sizeInBits = 32 THEN char := rfReal
  9997. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  9998. END;
  9999. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10000. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10001. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10002. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10003. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10004. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10005. END;
  10006. IF arrayOf THEN
  10007. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10008. ELSE
  10009. Char(section,char)
  10010. END;
  10011. INC(size);
  10012. END BaseType;
  10013. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10014. VAR destination: Sections.Section; name: SyntaxTree.IdentifierString;
  10015. BEGIN
  10016. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10017. IF destination = NIL THEN
  10018. (* imported unused record type *)
  10019. Char(section,0X); (* nil type *)
  10020. INC(size);
  10021. type.typeDeclaration.GetName(name);
  10022. (*
  10023. this happens when a symbol from a different module is used but the type desciptor is not necessary to be present in the current module
  10024. D.Str("Warning: Unreferenced record type encountered: "); D.String(name); D.String(" unused? "); D.Ln;
  10025. *)
  10026. ELSE
  10027. IF type.pointerType # NIL THEN
  10028. Char(section,rfRecordPointer)
  10029. ELSE
  10030. Char(section,rfRecord);
  10031. END;
  10032. INC(size);
  10033. Longint(section,(destination.offset ));
  10034. INC(size,4);
  10035. END;
  10036. END RecordType;
  10037. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10038. BEGIN
  10039. IF type.arrayBase.resolved IS SyntaxTree.ArrayType THEN
  10040. Char(section,CHR(ORD(rfPointer)+ORD(rfArrayFlag)));
  10041. INC(size);
  10042. ELSE BaseType(TRUE,type.arrayBase.resolved)
  10043. END;
  10044. IF type.form = SyntaxTree.Static THEN
  10045. Longint(section,type.staticLength)
  10046. ELSE
  10047. Longint(section,0)
  10048. END;
  10049. INC(size,4);
  10050. END ArrayType;
  10051. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10052. BEGIN
  10053. IF type.arrayBase = NIL THEN BaseType(TRUE,NIL)
  10054. ELSIF type.arrayBase.resolved IS SyntaxTree.MathArrayType THEN
  10055. Char(section,CHR(ORD(rfPointer)+ORD(rfArrayFlag)));
  10056. INC(size);
  10057. ELSE BaseType(TRUE,type.arrayBase.resolved)
  10058. END;
  10059. IF type.form = SyntaxTree.Static THEN
  10060. Longint(section,type.staticLength)
  10061. ELSE
  10062. Longint(section,0)
  10063. END;
  10064. INC(size,4);
  10065. END MathArrayType;
  10066. PROCEDURE Type(type: SyntaxTree.Type);
  10067. BEGIN
  10068. IF type = NIL THEN Char(section,0X); INC(size); RETURN ELSE type := type.resolved END;
  10069. IF type IS SyntaxTree.BasicType THEN
  10070. BaseType(FALSE,type)
  10071. ELSIF type IS SyntaxTree.RecordType THEN
  10072. RecordType(type(SyntaxTree.RecordType));
  10073. ELSIF type IS SyntaxTree.ArrayType THEN
  10074. ArrayType(type(SyntaxTree.ArrayType))
  10075. ELSIF type IS SyntaxTree.EnumerationType THEN
  10076. BaseType(FALSE,module.system.longintType)
  10077. ELSIF type IS SyntaxTree.PointerType THEN
  10078. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10079. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10080. ELSE
  10081. BaseType(FALSE,type)
  10082. END;
  10083. ELSIF type IS SyntaxTree.ProcedureType THEN
  10084. BaseType(FALSE,type);
  10085. ELSIF type IS SyntaxTree.MathArrayType THEN
  10086. MathArrayType(type(SyntaxTree.MathArrayType));
  10087. ELSE HALT(200)
  10088. END;
  10089. END Type;
  10090. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10091. VAR name: ARRAY 256 OF CHAR;
  10092. BEGIN
  10093. IF variable.externalName # NIL THEN RETURN END;
  10094. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10095. INC(size);
  10096. variable.GetName(name);
  10097. Type(variable.type);
  10098. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10099. INC(size,4);
  10100. String(section,name);
  10101. INC(size,Strings.Length(name)+1);
  10102. END WriteVariable;
  10103. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10104. VAR name: ARRAY 256 OF CHAR;
  10105. BEGIN
  10106. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10107. INC(size);
  10108. variable.GetName(name);
  10109. Type(variable.type);
  10110. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10111. INC(size,4);
  10112. variable.GetName(name);
  10113. String(section,name);
  10114. INC(size,Strings.Length(name)+1);
  10115. END WriteParameter;
  10116. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10117. BEGIN
  10118. IF type = NIL THEN Char(section,0X); INC(size); RETURN ELSE type := type.resolved END;
  10119. IF type IS SyntaxTree.ArrayType THEN
  10120. WITH type: SyntaxTree.ArrayType DO
  10121. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10122. ELSE Char(section,rfOpenArray)
  10123. END;
  10124. INC(size);
  10125. END
  10126. ELSIF type IS SyntaxTree.MathArrayType THEN
  10127. WITH type: SyntaxTree.MathArrayType DO
  10128. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10129. ELSE Char(section,rfOpenArray)
  10130. END;
  10131. INC(size);
  10132. END
  10133. ELSIF type IS SyntaxTree.RecordType THEN
  10134. Char(section,rfRecord);
  10135. INC(size);
  10136. ELSE
  10137. BaseType(FALSE,type);
  10138. END;
  10139. END ReturnType;
  10140. PROCEDURE DeclarationName(typeDeclaration: SyntaxTree.TypeDeclaration; VAR name: ARRAY OF CHAR);
  10141. BEGIN
  10142. IF typeDeclaration = NIL THEN COPY("@ANONYMOUS",name)
  10143. ELSE typeDeclaration.GetName(name)
  10144. END;
  10145. END DeclarationName;
  10146. PROCEDURE Procedure(s: Sections.Section);
  10147. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10148. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10149. name,recordName: ARRAY 256 OF CHAR;
  10150. record: SyntaxTree.RecordType; i: LONGINT;
  10151. BEGIN
  10152. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10153. procedure.GetName(name);
  10154. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10155. Char(section,0F9X);
  10156. INC(size);
  10157. Symbol(section,s,0,0);
  10158. INC(size,4);
  10159. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10160. INC(size,4);
  10161. Longint(section,procedureType.numberParameters);
  10162. INC(size,4);
  10163. ReturnType(procedureType.returnType);
  10164. Longint(section,0); (*! level *)
  10165. INC(size,4);
  10166. Longint(section,0);
  10167. INC(size,4);
  10168. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10169. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10170. recordName := "";
  10171. IF record.pointerType # NIL THEN
  10172. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10173. ELSE
  10174. DeclarationName(record.typeDeclaration,recordName);
  10175. END;
  10176. i := 0;
  10177. Info(section,recordName);
  10178. WHILE recordName[i] # 0X DO
  10179. Char(section,recordName[i]); INC(i);
  10180. INC(size);
  10181. END;
  10182. Char(section,".");
  10183. INC(size);
  10184. END;
  10185. String(section,name);
  10186. INC(size,Strings.Length(name)+1);
  10187. parameter := procedureType.firstParameter;
  10188. WHILE(parameter # NIL) DO
  10189. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10190. parameter := parameter.nextParameter;
  10191. END;
  10192. variable := procedure.procedureScope.firstVariable;
  10193. WHILE(variable # NIL) DO
  10194. WriteVariable(variable,FALSE);
  10195. variable := variable.nextVariable;
  10196. END;
  10197. END Procedure;
  10198. PROCEDURE Scope(s: Sections.Section);
  10199. VAR variable: SyntaxTree.Variable;
  10200. BEGIN
  10201. Char(section,0F8X);
  10202. INC(size);
  10203. Symbol(section,s,0,0); (* start *)
  10204. INC(size,4);
  10205. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10206. INC(size,4);
  10207. String(section,"$$");
  10208. INC(size,3);
  10209. (* removed variables -- wrongly interpreted by Reflection
  10210. variable := module.module.moduleScope.firstVariable;
  10211. WHILE(variable # NIL) DO
  10212. WriteVariable(variable,FALSE);
  10213. variable := variable.nextVariable;
  10214. END;
  10215. *)
  10216. END Scope;
  10217. BEGIN
  10218. Array(section,sizePC,"");
  10219. size := 0;
  10220. Char(section,0FFX); (* sign for trap writer *)
  10221. INC(size);
  10222. FOR i := 0 TO module.allSections.Length() - 1 DO
  10223. s := module.allSections.GetSection(i);
  10224. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10225. Scope(s) (*! must be first procedure in ref section *)
  10226. END
  10227. END;
  10228. FOR i := 0 TO module.allSections.Length() - 1 DO
  10229. s := module.allSections.GetSection(i);
  10230. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10231. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10232. Procedure(s)
  10233. END
  10234. END;
  10235. PatchArray(section,sizePC,size);
  10236. END References;
  10237. (*
  10238. Command* = RECORD
  10239. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10240. name*: Name; (* name of the procedure *)
  10241. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10242. entryAdr* : ADDRESS; (* entry address of procedure *)
  10243. END;
  10244. *)
  10245. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10246. VAR
  10247. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10248. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10249. name: ARRAY 32 OF CHAR; numberParameters, i: LONGINT;
  10250. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10251. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10252. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10253. BEGIN
  10254. RETURN
  10255. (type = NIL) OR
  10256. (type.resolved IS SyntaxTree.RecordType) OR
  10257. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType);
  10258. END TypeAllowed;
  10259. BEGIN
  10260. numberParameters := procedureType.numberParameters;
  10261. RETURN
  10262. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10263. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10264. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10265. END GetProcedureAllowed;
  10266. PROCEDURE WriteType(type : SyntaxTree.Type);
  10267. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10268. name: Basic.SegmentedName; offset: LONGINT;
  10269. BEGIN
  10270. IF type = NIL THEN
  10271. Address(source,0);
  10272. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10273. Address(source,1);
  10274. ELSE
  10275. type := type.resolved;
  10276. IF type IS SyntaxTree.PointerType THEN
  10277. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10278. END;
  10279. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10280. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10281. name[0] := typeDeclaration.name; name[1] := -1;
  10282. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10283. ASSERT(section # NIL);
  10284. ELSE
  10285. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10286. (* TODO *)
  10287. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10288. END;
  10289. IF implementationVisitor.backend.cooperative THEN
  10290. offset := 0;
  10291. ELSE
  10292. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10293. END;
  10294. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10295. END;
  10296. END WriteType;
  10297. BEGIN
  10298. Info(source, "command array descriptor");
  10299. Array(source,sizePC,"Modules.Command");
  10300. numberCommands := 0;
  10301. Info(source, "command array content");
  10302. FOR i := 0 TO module.allSections.Length() - 1 DO
  10303. p := module.allSections.GetSection(i);
  10304. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10305. procedure := p.symbol(SyntaxTree.Procedure);
  10306. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10307. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10308. procedure.GetName(name);
  10309. Name(source,name);
  10310. numberParameters := procedureType.numberParameters;
  10311. (* offset of type of first parameter *)
  10312. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10313. ELSE WriteType(procedureType.firstParameter.type)
  10314. END;
  10315. (* offset of type of return parameter *)
  10316. WriteType(procedureType.returnType);
  10317. (* command name *)
  10318. (* command code offset *)
  10319. Symbol(source,p,0,0);
  10320. INC(numberCommands);
  10321. IF Trace THEN
  10322. D.Ln;
  10323. END;
  10324. END;
  10325. END
  10326. END;
  10327. PatchArray(source,sizePC,numberCommands);
  10328. END CommandArray;
  10329. (* to prevent from double import of different module aliases *)
  10330. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10331. VAR i: SyntaxTree.Import;
  10332. BEGIN
  10333. i := module.module.moduleScope.firstImport;
  10334. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10335. i := i.nextImport;
  10336. END;
  10337. RETURN i = import
  10338. END IsFirstDirectOccurence;
  10339. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10340. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10341. BEGIN
  10342. Array(source,pc,"");
  10343. Info(source, "import module array data");
  10344. IF implementationVisitor.backend.cooperative THEN
  10345. offset := 0;
  10346. ELSE
  10347. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10348. END;
  10349. import := module.module.moduleScope.firstImport;
  10350. numberImports := 0;
  10351. WHILE import # NIL DO
  10352. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10353. Global.GetModuleSegmentedName(import.module,name);
  10354. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10355. NamedSymbol(source, name, NIL, 0, offset);
  10356. INC(numberImports);
  10357. END;
  10358. import := import.nextImport
  10359. END;
  10360. PatchArray(source,pc,numberImports);
  10361. END ImportsArray;
  10362. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10363. VAR
  10364. p: Sections.Section; sizePC, size, i: LONGINT;
  10365. BEGIN
  10366. Info(source, "Type info section");
  10367. size := 0;
  10368. Array(source,sizePC,"Modules.TypeDesc");
  10369. FOR i := 0 TO module.allSections.Length() - 1 DO
  10370. p := module.allSections.GetSection(i);
  10371. WITH p: IntermediateCode.Section DO
  10372. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10373. Symbol(source,p,0,0);
  10374. INC(size);
  10375. END;
  10376. END
  10377. END;
  10378. PatchArray(source,sizePC,size);
  10379. END TypeInfoSection;
  10380. (*
  10381. ProcTableEntry* = RECORD
  10382. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10383. noPtr*: LONGINT;
  10384. END;
  10385. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10386. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10387. *)
  10388. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10389. VAR
  10390. destination: Sections.Section;
  10391. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10392. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10393. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10394. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10395. BEGIN
  10396. Info(procArray,"pcFrom");
  10397. Symbol(procArray,destination,0,0);
  10398. Info(procArray,"pcTo");
  10399. Symbol(procArray,destination,destination.pc,0);
  10400. Info(procArray,"pcStatementBegin");
  10401. Symbol(procArray,destination,destination.validPAFEnter,0);
  10402. Info(procArray,"pcStatementEnd");
  10403. Symbol(procArray,destination,destination.validPAFExit,0);
  10404. IF ~implementationVisitor.backend.cooperative THEN
  10405. Basic.SegmentedNameToString(destination.name, string);
  10406. Info(pointerArray,string);
  10407. procedure := destination.symbol(SyntaxTree.Procedure);
  10408. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10409. variable := procedure.procedureScope.firstVariable;
  10410. WHILE(variable # NIL) DO
  10411. IF ~(variable.untraced) THEN
  10412. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10413. END;
  10414. variable := variable.nextVariable
  10415. END;
  10416. parameter := procedureType.firstParameter;
  10417. WHILE(parameter # NIL) DO
  10418. IF ~(parameter.untraced) THEN
  10419. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10420. END;
  10421. parameter := parameter.nextParameter;
  10422. END;
  10423. END;
  10424. Info(procArray,"numberPointers");
  10425. Longint(procArray,numberPointers);
  10426. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10427. INC(pointerArraySize, numberPointers);
  10428. END PointerOffsets;
  10429. BEGIN
  10430. maxPointers := 0;
  10431. Info(procArray, "proc array descriptor");
  10432. Address(procArray,0);
  10433. Address(procArray,0);
  10434. Address(procArray,0);
  10435. procArraySizePC := procArray.pc;
  10436. Address(procArray,0);
  10437. procArraySize := 0;
  10438. IF ~implementationVisitor.backend.cooperative THEN
  10439. Info(pointerArray, "pointer array descriptor");
  10440. Address(pointerArray,0);
  10441. Address(pointerArray,0);
  10442. Address(pointerArray,0);
  10443. pointerArraySizePC := pointerArray.pc;
  10444. Address(pointerArray,0);
  10445. pointerArraySize := 0;
  10446. END;
  10447. procArraySize := 0;
  10448. FOR i := 0 TO module.allSections.Length() - 1 DO
  10449. destination := module.allSections.GetSection(i);
  10450. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10451. PointerOffsets(destination(IntermediateCode.Section));
  10452. INC(procArraySize);
  10453. END
  10454. END;
  10455. PatchLongint(procArray,procArraySizePC,procArraySize);
  10456. IF ~implementationVisitor.backend.cooperative THEN
  10457. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10458. END;
  10459. END PointersInProcTables;
  10460. (*
  10461. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10462. VAR
  10463. next*: Module; (** once a module is published, all fields are read-only *)
  10464. name*: Name;
  10465. init, published: BOOLEAN;
  10466. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10467. sb*: ADDRESS; <- set to beginning of data section by loader
  10468. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10469. command*: POINTER TO ARRAY OF Command;
  10470. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10471. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10472. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10473. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10474. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10475. data*, code*: Bytes;
  10476. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10477. export*: ExportDesc;
  10478. term*: TerminationHandler;
  10479. exTable*: ExceptionTable;
  10480. noProcs*: LONGINT;
  10481. firstProc*: ADDRESS; <- done by loader
  10482. maxPtrs*: LONGINT;
  10483. crc*: LONGINT;
  10484. *)
  10485. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10486. BEGIN
  10487. Info(section, "cycle");
  10488. Size(section,0);
  10489. Info(section, "references");
  10490. Size(section,0);
  10491. Info(section, "nextMarked");
  10492. Address(section,0);
  10493. Info(section, "nextWatched");
  10494. Address(section,0);
  10495. END BasePointer;
  10496. PROCEDURE BaseObject (section: IntermediateCode.Section);
  10497. BEGIN
  10498. BasePointer(section);
  10499. Info(section, "action");
  10500. Address(section,0);
  10501. Info(section, "monitor");
  10502. Address(section,0);
  10503. END BaseObject;
  10504. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  10505. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  10506. pooledName: Basic.SegmentedName;
  10507. symbol: SyntaxTree.Symbol;
  10508. BEGIN
  10509. Global.GetModuleName(module.module,name);
  10510. Strings.Append(name,".@Module.@Descriptor");
  10511. Basic.ToSegmentedName(name, pooledName);
  10512. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10513. Symbol(section,descriptorSection,0,0);
  10514. Info(descriptorSection, "descriptor");
  10515. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10516. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  10517. Address(descriptorSection,0);
  10518. Global.GetModuleName(module.module,name);
  10519. Strings.Append(name,".@Trace");
  10520. Basic.ToSegmentedName(name, pooledName);
  10521. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10522. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  10523. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10524. END ModuleDescriptor;
  10525. PROCEDURE ModuleSection(): IntermediateCode.Section;
  10526. VAR name: ARRAY 128 OF CHAR;
  10527. moduleSection,moduleTD: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  10528. symbol: SyntaxTree.Symbol;
  10529. BEGIN
  10530. Global.GetModuleName(module.module,name);
  10531. Strings.Append(name,".@Module");
  10532. Basic.ToSegmentedName(name, pooledName);
  10533. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10534. moduleSection.SetExported(TRUE);
  10535. IF moduleSection.pc = 0 THEN
  10536. IF implementationVisitor.backend.cooperative THEN
  10537. Info(moduleSection, "descriptor");
  10538. ModuleDescriptor(moduleSection);
  10539. BaseObject(moduleSection);
  10540. implementationVisitor.CreateTraceModuleMethod(module.module);
  10541. ELSE
  10542. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  10543. Info(moduleSection, "HeapBlock");
  10544. Symbol(moduleSection,moduleSection,2,0);
  10545. Info(moduleSection, "TypeDescriptor");
  10546. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10547. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  10548. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  10549. END;
  10550. END;
  10551. RETURN moduleSection;
  10552. END ModuleSection;
  10553. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  10554. VAR
  10555. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  10556. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  10557. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  10558. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  10559. referenceSectionOffset : LONGINT;
  10560. BEGIN
  10561. Global.GetModuleName(module.module,moduleName);
  10562. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  10563. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  10564. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  10565. ImportsArray(importSection);
  10566. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  10567. CommandArray(commandsSection);
  10568. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  10569. ExceptionArray(exceptionSection);
  10570. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  10571. TypeInfoSection(typeInfoSection);
  10572. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  10573. References(referenceSection);
  10574. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  10575. IF ~implementationVisitor.backend.cooperative THEN
  10576. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  10577. ELSE
  10578. ptrTableSection := NIL;
  10579. END;
  10580. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  10581. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  10582. Array(emptyArraySection,temp,"");
  10583. moduleSection := ModuleSection();
  10584. Info(moduleSection, "nextRoot*: RootObject");
  10585. Address(moduleSection,0);
  10586. Info(moduleSection, "next*: Module");
  10587. Address(moduleSection,0);
  10588. Info(moduleSection, "name*: Name");
  10589. Name(moduleSection,moduleName);
  10590. Info(moduleSection, "init, published: BOOLEAN");
  10591. Boolean(moduleSection,FALSE);
  10592. Boolean(moduleSection,FALSE);
  10593. Info(moduleSection,"filler"); (*! introduce alignment! *)
  10594. Boolean(moduleSection,FALSE);
  10595. Boolean(moduleSection,FALSE);
  10596. Info(moduleSection, "refcnt*: LONGINT");
  10597. Longint(moduleSection,0);
  10598. Info(moduleSection, "sb*: ADDRESS");
  10599. Address(moduleSection,0);
  10600. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  10601. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10602. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  10603. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  10604. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  10605. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  10606. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  10607. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  10608. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  10609. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  10610. Info(moduleSection, "procTable*: ProcTable");
  10611. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  10612. Info(moduleSection, "ptrTable*: PtrTable");
  10613. IF ~implementationVisitor.backend.cooperative THEN
  10614. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  10615. ELSE
  10616. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10617. END;
  10618. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  10619. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10620. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10621. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10622. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  10623. Info(moduleSection, "export*: ExportDesc");
  10624. ExportDesc(moduleSection);
  10625. Info(moduleSection, "term*: TerminationHandler");
  10626. Address(moduleSection,0);
  10627. Info(moduleSection, "exTable*: ExceptionTable");
  10628. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  10629. Info(moduleSection, "noProcs*: LONGINT");
  10630. Longint(moduleSection,numberProcs);
  10631. Info(moduleSection, "firstProc*: ADDRESS");
  10632. Address(moduleSection,0);
  10633. Info(moduleSection, "maxPtrs*: LONGINT");
  10634. Longint(moduleSection,maxPointers);
  10635. Info(moduleSection, "crc*: LONGINT");
  10636. Longint(moduleSection, 0); (*! must be implemented *)
  10637. Info(moduleSection, "body*: ADDRESS");
  10638. Symbol(moduleSection, bodyProc, 0,0);
  10639. IF implementationVisitor.backend.cooperative THEN
  10640. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  10641. Info(moduleSection, "monitor.owner");
  10642. Address(moduleSection,0);
  10643. Info(moduleSection, "monitor.nestingLevel");
  10644. Address(moduleSection,0);
  10645. Info(moduleSection, "monitor.blockedQueue");
  10646. Address(moduleSection,0); Address(moduleSection,0);
  10647. Info(moduleSection, "monitor.waitingQueue");
  10648. Address(moduleSection,0); Address(moduleSection,0);
  10649. Info(moduleSection, "monitor.waitingSentinel");
  10650. Address(moduleSection,0);
  10651. END;
  10652. END Module;
  10653. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  10654. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  10655. BEGIN
  10656. Array(source,pc,"");
  10657. Info(source, "pointer offsets array data");
  10658. IF scope IS SyntaxTree.RecordScope THEN
  10659. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  10660. ELSIF scope IS SyntaxTree.ModuleScope THEN
  10661. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  10662. WHILE variable # NIL DO
  10663. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  10664. symbol := module.allSections.FindBySymbol(variable);
  10665. ASSERT(symbol # NIL);
  10666. Pointers(0,symbol, source,variable.type,numberPointers);
  10667. END;
  10668. variable := variable.nextVariable;
  10669. END;
  10670. END;
  10671. PatchArray(source,pc,numberPointers);
  10672. END PointerArray;
  10673. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  10674. VAR recordType: SyntaxTree.RecordType;
  10675. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  10676. section: Sections.Section; string: SyntaxTree.String; type: SyntaxTree.Type; cellType: SyntaxTree.CellType;
  10677. PROCEDURE FieldArray(source: IntermediateCode.Section);
  10678. VAR variable: SyntaxTree.Variable; pc, offset: LONGINT; symbol, tir: Sections.Section; size: LONGINT; name: ARRAY 128 OF CHAR;
  10679. segmentedName: Basic.SegmentedName;
  10680. td: SyntaxTree.TypeDeclaration;
  10681. BEGIN
  10682. Array(source,pc,"Modules.FieldEntry");
  10683. Info(source, "FieldArray");
  10684. IF x IS SyntaxTree.RecordType THEN
  10685. variable := x(SyntaxTree.RecordType).recordScope.firstVariable
  10686. ELSE
  10687. variable := NIL;
  10688. END;
  10689. size :=0;
  10690. WHILE variable # NIL DO
  10691. type := variable.type.resolved;
  10692. Info(source,"offset");
  10693. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  10694. Info(source,"type class");
  10695. IF type IS SyntaxTree.PointerType THEN
  10696. Size(source, 1);
  10697. ELSIF type IS SyntaxTree.RecordType THEN
  10698. Size(source, 2);
  10699. ELSIF type IS SyntaxTree.NumberType THEN
  10700. Size(source, 3);
  10701. ELSE
  10702. Size(source, 0);
  10703. END;
  10704. Info(source, "type desc");
  10705. IF type IS SyntaxTree.RecordType THEN
  10706. td := type(SyntaxTree.RecordType).typeDeclaration;
  10707. Global.GetSymbolSegmentedName(td,segmentedName);
  10708. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  10709. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,implementationVisitor.dump # NIL);
  10710. ELSE
  10711. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,implementationVisitor.dump # NIL);
  10712. END;
  10713. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  10714. Symbol(source, tir, 0, offset);
  10715. ELSE
  10716. Address(source, 0);
  10717. END;
  10718. Info(source,"flags");
  10719. Set(source, {});
  10720. Info(source,"name");
  10721. variable.GetName(name);
  10722. LongName(source, name);
  10723. variable := variable.nextVariable;
  10724. INC(size);
  10725. END;
  10726. PatchArray(source,pc,size);
  10727. END FieldArray;
  10728. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  10729. VAR name: Basic.SegmentedName;source, fieldSection: IntermediateCode.Section;
  10730. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  10731. sectionName: Basic.SectionName;
  10732. CONST MPO=-40000000H;
  10733. BEGIN
  10734. (*
  10735. TypeDesc* = POINTER TO RECORD
  10736. descSize: LONGINT;
  10737. sentinel: LONGINT; (* = MPO-4 *)
  10738. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  10739. flags*: SET;
  10740. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  10741. name*: Name;
  10742. END;
  10743. *)
  10744. (* source := module.sections.FindByName(...) *)
  10745. Global.GetSymbolSegmentedName(td,name);
  10746. Basic.AppendToSegmentedName(name,"@Info");
  10747. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,implementationVisitor.dump # NIL);
  10748. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  10749. Address(source,MPO-4);
  10750. Info(source, "type tag pointer");
  10751. Symbol( source, tag, offset, 0);
  10752. Info(source, "type flags");
  10753. flags := {};
  10754. IF isProtected THEN INCL(flags,31) END;
  10755. Set( source, flags);
  10756. Info(source, "pointer to module");
  10757. moduleSection := ModuleSection();
  10758. Symbol( source, moduleSection, moduleSection.pc,0);
  10759. Info(source, "type name");
  10760. i := 0;
  10761. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  10762. (*
  10763. Global.GetSymbolSegmentedName(td,name);
  10764. Basic.SegmentedNameToString(name, sectionName);
  10765. *)
  10766. Name(source,sectionName);
  10767. source.SetReferenced(FALSE);
  10768. Global.GetSymbolSegmentedName(td,name);
  10769. Basic.AppendToSegmentedName(name,"@Fields");
  10770. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  10771. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  10772. Info(fieldSection, "HeapBlock");
  10773. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  10774. Info(fieldSection, "TypeDescriptor");
  10775. Address(fieldSection,0);
  10776. Info(source, "FieldArray ref");
  10777. Symbol(source, fieldSection, fieldSection.pc, 0);
  10778. FieldArray(fieldSection);
  10779. RETURN source;
  10780. END NewTypeDescriptorInfo;
  10781. PROCEDURE GetSection(x: SyntaxTree.Procedure): Sections.Section;
  10782. VAR source: IntermediateCode.Section; sectionType: SHORTINT; name: Basic.SegmentedName;
  10783. BEGIN
  10784. Global.GetSymbolSegmentedName(x,name);
  10785. IF x.isInline THEN
  10786. sectionType := Sections.InlineCodeSection;
  10787. ELSE
  10788. sectionType := Sections.CodeSection;
  10789. END;
  10790. IF (x.scope.ownerModule = module.module) THEN
  10791. source := IntermediateCode.NewSection(module.allSections, sectionType, name,x,implementationVisitor.dump # NIL);
  10792. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  10793. HALT(200);
  10794. ELSE
  10795. source := IntermediateCode.NewSection(module.importedSections, sectionType, name,x,implementationVisitor.dump # NIL);
  10796. END;
  10797. RETURN source
  10798. END GetSection;
  10799. PROCEDURE NewTypeDescriptor;
  10800. VAR name, stackFrame: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  10801. procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable;
  10802. baseRecord: SyntaxTree.RecordType; baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  10803. numberPointers: LONGINT; padding,offset, i: LONGINT;
  10804. CONST MPO=-40000000H;
  10805. PROCEDURE TdTable(size: LONGINT);
  10806. VAR i: LONGINT;
  10807. BEGIN
  10808. Info(source, "tag table");
  10809. baseRecord := recordType;
  10810. i := 0;
  10811. WHILE baseRecord # NIL DO
  10812. INC(i);
  10813. baseRecord := baseRecord.GetBaseRecord();
  10814. END;
  10815. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  10816. WHILE i < size DO
  10817. Address(source,0);
  10818. INC(i);
  10819. END;
  10820. baseRecord := recordType;
  10821. WHILE baseRecord # NIL DO
  10822. baseTD := baseRecord.typeDeclaration;
  10823. Global.GetSymbolSegmentedName(baseTD,name);
  10824. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  10825. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,implementationVisitor.dump # NIL);
  10826. ELSE
  10827. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,implementationVisitor.dump # NIL);
  10828. END;
  10829. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*module.system.addressSize);
  10830. Symbol(source, tir, 0, offset);
  10831. baseRecord := baseRecord.GetBaseRecord();
  10832. END;
  10833. END TdTable;
  10834. PROCEDURE MethodTable;
  10835. VAR i,methods: LONGINT;
  10836. BEGIN
  10837. Info(source, "method table");
  10838. methods := recordType.recordScope.numberMethods;
  10839. FOR i := methods-1 TO 0 BY -1 DO
  10840. procedure := recordType.recordScope.FindMethod(i);
  10841. Global.GetSymbolSegmentedName(procedure, name);
  10842. NamedSymbol(source, name,procedure, 0,0);
  10843. END;
  10844. END MethodTable;
  10845. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  10846. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  10847. BEGIN
  10848. Info(source, "method table");
  10849. baseRecord := recordType;
  10850. WHILE baseRecord.baseType # NIL DO
  10851. baseRecord := baseRecord.GetBaseRecord ();
  10852. END;
  10853. GetRecordTypeName (baseRecord, name);
  10854. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  10855. IF name = stackFrame THEN
  10856. start := 0;
  10857. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  10858. baseRecord := recordType;
  10859. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  10860. baseRecord := baseRecord.GetBaseRecord ();
  10861. END;
  10862. IF baseRecord # NIL THEN
  10863. GetRecordTypeName (baseRecord, name);
  10864. IF pointer & ~baseRecord.isObject THEN
  10865. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  10866. END;
  10867. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  10868. ELSIF recordType.isObject THEN
  10869. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  10870. ELSIF pointer THEN
  10871. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  10872. ELSE
  10873. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  10874. END;
  10875. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,implementationVisitor.dump # NIL);
  10876. Symbol(source, tir, 0, 0);
  10877. start := 0;
  10878. baseRecord := recordType;
  10879. WHILE (baseRecord # NIL) DO
  10880. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  10881. baseRecord := baseRecord.GetBaseRecord ();
  10882. END;
  10883. ELSE
  10884. (* explicit trace method: *)
  10885. procedure := recordType.recordScope.FindMethod(0);
  10886. IF ~procedure.isFinalizer THEN
  10887. Global.GetSymbolSegmentedName(procedure, name);
  10888. NamedSymbol(source, name,procedure, 0,0);
  10889. END;
  10890. start := 1;
  10891. END;
  10892. IF (name # stackFrame) & recordType.isObject THEN
  10893. baseRecord := recordType;
  10894. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  10895. baseRecord := baseRecord.GetBaseRecord ();
  10896. END;
  10897. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  10898. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  10899. ELSE
  10900. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  10901. END;
  10902. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,implementationVisitor.dump # NIL);
  10903. Symbol(source, tir, 0, 0);
  10904. END;
  10905. methods := recordType.recordScope.numberMethods;
  10906. FOR i := start TO methods-1 DO
  10907. procedure := recordType.recordScope.FindMethod(i);
  10908. IF ~procedure.isFinalizer THEN
  10909. Global.GetSymbolSegmentedName(procedure, name);
  10910. NamedSymbol(source, name,procedure, 0,0);
  10911. END;
  10912. END;
  10913. END CooperativeMethodTable;
  10914. BEGIN
  10915. Global.GetSymbolSegmentedName(td,name);
  10916. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  10917. source.SetExported(IsExported(td));
  10918. IF implementationVisitor.backend.cooperative THEN
  10919. base := NIL;
  10920. baseRecord := recordType.GetBaseRecord();
  10921. IF baseRecord # NIL THEN
  10922. baseTD := baseRecord.typeDeclaration;
  10923. END;
  10924. IF ~recordType.isObject THEN
  10925. Info(source, "parent");
  10926. IF baseRecord # NIL THEN
  10927. Global.GetSymbolSegmentedName(baseTD,name);
  10928. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  10929. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,implementationVisitor.dump # NIL);
  10930. ELSE
  10931. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,implementationVisitor.dump # NIL);
  10932. END;
  10933. Symbol(source, tir, 0, 0);
  10934. ELSE
  10935. Address(source,0);
  10936. END;
  10937. Info(source, "record size");
  10938. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  10939. source.SetReferenced(FALSE);
  10940. CooperativeMethodTable(FALSE);
  10941. base := source;
  10942. Global.GetSymbolSegmentedName(td,name);
  10943. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  10944. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,implementationVisitor.dump # NIL);
  10945. source.SetExported(IsExported(td));
  10946. source.SetReferenced(FALSE);
  10947. END;
  10948. Info(source, "parent");
  10949. IF baseRecord # NIL THEN
  10950. Global.GetSymbolSegmentedName(baseTD,name);
  10951. sym := baseTD;
  10952. IF ~recordType.isObject THEN
  10953. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  10954. sym := NIL;
  10955. END;
  10956. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  10957. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,implementationVisitor.dump # NIL);
  10958. ELSE
  10959. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,implementationVisitor.dump # NIL);
  10960. END;
  10961. Symbol(source, tir, 0, 0);
  10962. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  10963. Address(source,0);
  10964. ELSE
  10965. IF recordType.isObject THEN
  10966. Basic.ToSegmentedName ("BaseTypes.Object",name);
  10967. ELSE
  10968. Basic.ToSegmentedName ("BaseTypes.Record",name);
  10969. END;
  10970. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,implementationVisitor.dump # NIL);
  10971. Symbol(source, tir, 0, 0);
  10972. END;
  10973. Info(source, "base record descriptor");
  10974. Symbol(source, base, 0, 0);
  10975. CooperativeMethodTable(TRUE);
  10976. source.SetReferenced(FALSE);
  10977. IF recordType.hasPointers THEN
  10978. IF ~HasExplicitTraceMethod (recordType) THEN
  10979. implementationVisitor.CreateTraceMethod(recordType);
  10980. END;
  10981. implementationVisitor.CreateResetProcedure(recordType);
  10982. implementationVisitor.CreateAssignProcedure(recordType);
  10983. END;
  10984. (*! patch this !!!
  10985. ELSIF cellType # NIL THEN
  10986. recordType := cellType.GetBaseRecord();
  10987. Info(source, "MethodEnd = MPO");
  10988. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  10989. source(IntermediateCode.Section).Emit(Data(-1,op));
  10990. Info(source, "method table");
  10991. IF recordType # NIL THEN
  10992. methods := recordType.recordScope.numberMethods;
  10993. ELSE
  10994. methods := 0
  10995. END;
  10996. FOR i := methods-1 TO 0 BY -1 DO
  10997. procedure := recordType.recordScope.FindMethod(i);
  10998. Global.GetSymbolSegmentedName(procedure,name);
  10999. NamedSymbol(source, name,procedure,0,0);
  11000. END;
  11001. TdTable(TypeTags);
  11002. Info(source, "type descriptor info pointer");
  11003. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11004. Info(source, "record size");
  11005. IF cellType.sizeInBits < 0 THEN
  11006. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11007. END;
  11008. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11009. Info(source, "pointer offsets pointer");
  11010. padding := 1- source.pc MOD 2;
  11011. Symbol(source, source, source.pc+1+padding,0);
  11012. IF padding >0 THEN
  11013. Info(source, "padding");
  11014. FOR i := 1 TO padding DO Address(source,0) END;
  11015. END;
  11016. PointerArray(source, cellType.cellScope, numberPointers);
  11017. *)
  11018. ELSIF ~simple THEN
  11019. (*
  11020. MethodEnd = MPO
  11021. ---
  11022. methods (# methods)
  11023. ---
  11024. tags (16)
  11025. ---
  11026. TypeDesc = TypeInfoAdr
  11027. ---
  11028. td adr ---> rec size
  11029. ----
  11030. pointer offsets
  11031. ----
  11032. (padding)
  11033. -----
  11034. empty [2 addresses aligned]
  11035. empty
  11036. empty
  11037. numPtrs
  11038. ---
  11039. pointer offsets
  11040. ---
  11041. *)
  11042. Info(source, "MethodEnd = MPO");
  11043. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11044. source(IntermediateCode.Section).Emit(Data(-1,op));
  11045. MethodTable;
  11046. TdTable(TypeTags);
  11047. Info(source, "type descriptor info pointer");
  11048. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11049. Info(source, "record size");
  11050. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11051. Info(source, "pointer offsets pointer");
  11052. padding := 1- source.pc MOD 2;
  11053. Symbol(source, source, source.pc+1+padding,0);
  11054. IF padding >0 THEN
  11055. Info(source, "padding");
  11056. FOR i := 1 TO padding DO Address(source,0) END;
  11057. END;
  11058. PointerArray(source, recordType.recordScope, numberPointers);
  11059. ELSE
  11060. (*
  11061. simple:
  11062. methods
  11063. tag(2)
  11064. tag(1)
  11065. td adr ---> tag(0)
  11066. td adr ---> size
  11067. *)
  11068. MethodTable;
  11069. TdTable(TypeTags);
  11070. Info(source, "record size");
  11071. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11072. source.SetReferenced(FALSE);
  11073. END;
  11074. END NewTypeDescriptor;
  11075. BEGIN
  11076. x := x.resolved;
  11077. IF (x IS SyntaxTree.PointerType) THEN
  11078. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11079. END;
  11080. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11081. recordType := x(SyntaxTree.RecordType);
  11082. td := x.typeDeclaration;
  11083. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11084. ASSERT(td # NIL);
  11085. section := module.allSections.FindBySymbol(td); (* TODO *)
  11086. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11087. IF implementationVisitor.newObjectFile THEN
  11088. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11089. NewTypeDescriptor
  11090. END;
  11091. ELSE
  11092. (* data section in intermediate code *)
  11093. Global.GetSymbolSegmentedName(td,name);
  11094. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11095. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11096. tir.Emit(Data(-1,op));
  11097. END;
  11098. END;
  11099. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11100. cellType := x(SyntaxTree.CellType);
  11101. td := x.typeDeclaration;
  11102. section := module.allSections.FindBySymbol(td); (* TODO *)
  11103. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11104. IF implementationVisitor.newObjectFile THEN
  11105. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11106. NewTypeDescriptor
  11107. END;
  11108. END;
  11109. END;
  11110. END
  11111. END CheckTypeDeclaration
  11112. END MetaDataGenerator;
  11113. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11114. VAR
  11115. trace-: BOOLEAN;
  11116. traceString-: SyntaxTree.IdentifierString;
  11117. traceModuleName-: SyntaxTree.IdentifierString;
  11118. newObjectFile-: BOOLEAN;
  11119. profile-: BOOLEAN;
  11120. noRuntimeChecks: BOOLEAN;
  11121. simpleMetaData-: BOOLEAN;
  11122. noAsserts: BOOLEAN;
  11123. optimize-: BOOLEAN;
  11124. cooperative-: BOOLEAN;
  11125. preregisterStatic-: BOOLEAN;
  11126. dump-: Basic.Writer;
  11127. cellsAreObjects: BOOLEAN;
  11128. PROCEDURE &InitIntermediateBackend*;
  11129. BEGIN
  11130. simpleMetaData := FALSE;
  11131. newObjectFile := FALSE;
  11132. InitBackend;
  11133. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11134. SetTraceModuleName(DefaultTraceModuleName);
  11135. END InitIntermediateBackend;
  11136. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11137. VAR
  11138. declarationVisitor: DeclarationVisitor;
  11139. implementationVisitor: ImplementationVisitor;
  11140. module: Sections.Module;
  11141. name, instructionSet, platformName: SyntaxTree.IdentifierString;
  11142. meta: MetaDataGenerator; support: SET;
  11143. BEGIN
  11144. ResetError;
  11145. Global.GetSymbolName(x,name);
  11146. IF activeCellsSpecification # NIL THEN
  11147. GetDescription(instructionSet);
  11148. activeCellsSpecification.SetInstructionSet(instructionSet)
  11149. END;
  11150. NEW(module,x,system); (* backend structures *)
  11151. Global.GetModuleName(x, name);
  11152. module.SetModuleName(name);
  11153. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11154. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11155. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11156. declarationVisitor.Module(x,module);
  11157. IF newObjectFile & ~meta.simple THEN
  11158. meta.Module(implementationVisitor.moduleBodySection);
  11159. END;
  11160. GetDescription(platformName);
  11161. module.SetPlatformName(platformName);
  11162. RETURN module
  11163. END GenerateIntermediate;
  11164. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11165. BEGIN RETURN TRUE
  11166. END SupportedImmediate;
  11167. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11168. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11169. END ProcessSyntaxTreeModule;
  11170. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11171. VAR
  11172. result: Sections.Module;
  11173. traceName: Basic.MessageString;
  11174. BEGIN
  11175. ASSERT(intermediateCodeModule IS Sections.Module);
  11176. result := intermediateCodeModule(Sections.Module);
  11177. IF trace THEN
  11178. traceName := "intermediate code trace: ";
  11179. Strings.Append(traceName,traceString);
  11180. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11181. IF (traceString="") OR (traceString="*") THEN
  11182. result.Dump(dump);
  11183. dump.Update
  11184. ELSE
  11185. Sections.DumpFiltered(dump, result, traceString);
  11186. END
  11187. END;
  11188. RETURN result
  11189. END ProcessIntermediateCodeModule;
  11190. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11191. BEGIN instructionSet := "Intermediate";
  11192. END GetDescription;
  11193. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11194. BEGIN
  11195. SELF.newObjectFile := newObjectFile;
  11196. SELF.simpleMetaData := simpleMetaData;
  11197. END SetNewObjectFile;
  11198. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11199. BEGIN COPY(name, traceModuleName)
  11200. END SetTraceModuleName;
  11201. PROCEDURE DefineOptions(options: Options.Options);
  11202. BEGIN
  11203. DefineOptions^(options);
  11204. options.Add(0X,"trace",Options.String);
  11205. options.Add(0X,"runtime",Options.String);
  11206. options.Add(0X,"newObjectFile",Options.Flag);
  11207. options.Add(0X,"traceModule",Options.String);
  11208. options.Add(0X,"profile",Options.Flag);
  11209. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11210. options.Add(0X,"noAsserts",Options.Flag);
  11211. options.Add(0X,"metaData",Options.String);
  11212. options.Add('o',"optimize", Options.Flag);
  11213. options.Add(0X,"preregisterStatic", Options.Flag);
  11214. options.Add(0X,"cellsAreObjects", Options.Flag);
  11215. END DefineOptions;
  11216. PROCEDURE GetOptions(options: Options.Options);
  11217. VAR name,string: SyntaxTree.IdentifierString;
  11218. BEGIN
  11219. GetOptions^(options);
  11220. trace := options.GetString("trace",traceString);
  11221. profile := options.GetFlag("profile");
  11222. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11223. noAsserts := options.GetFlag("noAsserts");
  11224. cooperative := options.GetFlag("cooperative");
  11225. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11226. IF cooperative THEN
  11227. SetRuntimeModuleName("CPU") END
  11228. END;
  11229. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11230. simpleMetaData := TRUE
  11231. END;
  11232. IF options.GetString("metaData",string) THEN
  11233. IF string = "simple" THEN simpleMetaData := TRUE
  11234. ELSIF string ="full" THEN simpleMetaData := FALSE
  11235. END;
  11236. END;
  11237. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11238. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11239. optimize := options.GetFlag("optimize");
  11240. preregisterStatic := options.GetFlag("preregisterStatic");
  11241. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11242. END GetOptions;
  11243. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11244. BEGIN RETURN SymbolFileFormat.Get()
  11245. END DefaultSymbolFileFormat;
  11246. END IntermediateBackend;
  11247. (* ----------------------------------- register allocation ------------------------------------- *)
  11248. (* register mapping scheme
  11249. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11250. spill offset
  11251. part(n) --> ticket <--> physical register
  11252. spill offset
  11253. *)
  11254. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11255. emptyOperand: IntermediateCode.Operand;
  11256. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11257. statCoopResetVariables: LONGINT;
  11258. statCoopModifyAssignments: LONGINT;
  11259. modifyAssignmentsPC : LONGINT;
  11260. statCoopNilCheck: LONGINT;
  11261. statCoopSwitch: LONGINT;
  11262. statCoopAssignProcedure: LONGINT;
  11263. statCoopTraceMethod: LONGINT;
  11264. statCoopResetProcedure: LONGINT;
  11265. statCoopTraceModule: LONGINT;
  11266. PROCEDURE ResetStatistics*;
  11267. BEGIN
  11268. statCoopResetVariables := 0;
  11269. statCoopModifyAssignments := 0;
  11270. statCoopNilCheck:= 0;
  11271. statCoopSwitch:= 0;
  11272. statCoopAssignProcedure:= 0;
  11273. statCoopTraceMethod:= 0;
  11274. statCoopResetProcedure:= 0;
  11275. statCoopTraceModule:= 0;
  11276. END ResetStatistics;
  11277. PROCEDURE Statistics*;
  11278. BEGIN
  11279. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11280. TRACE(statCoopNilCheck, statCoopSwitch);
  11281. TRACE(statCoopAssignProcedure,
  11282. statCoopTraceMethod,
  11283. statCoopResetProcedure,
  11284. statCoopTraceModule)
  11285. END Statistics;
  11286. PROCEDURE AppendIndex(VAR name: ARRAY OF CHAR; index: LONGINT);
  11287. BEGIN
  11288. Strings.Append(name,"["); Basic.AppendNumber(name,index); Strings.Append(name,"]");
  11289. END AppendIndex;
  11290. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11291. BEGIN
  11292. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11293. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11294. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11295. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11296. 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)
  11297. END
  11298. END PassBySingleReference;
  11299. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11300. BEGIN
  11301. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11302. END PassInRegister;
  11303. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11304. VAR new: RegisterEntry;
  11305. BEGIN
  11306. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11307. IF queue = NIL THEN
  11308. queue := new
  11309. ELSE
  11310. new.next := queue;
  11311. IF queue#NIL THEN queue.prev := new END;
  11312. queue := new
  11313. END;
  11314. END AddRegisterEntry;
  11315. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11316. VAR this: RegisterEntry;
  11317. BEGIN
  11318. this := queue;
  11319. WHILE (this # NIL) & (this.register # register) DO
  11320. this := this.next;
  11321. END;
  11322. IF this = NIL THEN
  11323. RETURN FALSE
  11324. END;
  11325. ASSERT(this # NIL);
  11326. IF this = queue THEN queue := queue.next END;
  11327. IF this.prev # NIL THEN this.prev.next := this.next END;
  11328. IF this.next # NIL THEN this.next.prev := this.prev END;
  11329. RETURN TRUE
  11330. END RemoveRegisterEntry;
  11331. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11332. BEGIN ASSERT(cond);
  11333. END Assert;
  11334. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11335. BEGIN
  11336. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11337. END ReusableRegister;
  11338. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11339. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11340. BEGIN
  11341. procedure := moduleScope.bodyProcedure;
  11342. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11343. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11344. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11345. procedure.SetScope(moduleScope);
  11346. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11347. procedure.SetAccess(SyntaxTree.Hidden);
  11348. moduleScope.SetBodyProcedure(procedure);
  11349. moduleScope.AddProcedure(procedure);
  11350. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11351. END;
  11352. END EnsureBodyProcedure;
  11353. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11354. VAR import: SyntaxTree.Import;
  11355. s: Basic.MessageString;
  11356. selfName: SyntaxTree.IdentifierString;
  11357. module: SyntaxTree.Module;
  11358. BEGIN
  11359. scope.ownerModule.GetName(selfName);
  11360. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11361. module := scope.ownerModule
  11362. ELSE
  11363. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11364. IF import = NIL THEN
  11365. RETURN NIL
  11366. ELSIF import.module = NIL THEN
  11367. RETURN NIL
  11368. ELSE module := import.module
  11369. END;
  11370. END;
  11371. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11372. END GetSymbol;
  11373. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11374. BEGIN
  11375. op.mode := mode;
  11376. IntermediateCode.InitOperand(op.op);
  11377. IntermediateCode.InitOperand(op.tag);
  11378. IntermediateCode.InitOperand(op.extra);
  11379. op.dimOffset := 0;
  11380. END InitOperand;
  11381. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11382. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11383. BEGIN RETURN IntermediateCode.GetType(system, type)
  11384. END GetType;
  11385. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11386. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11387. BEGIN
  11388. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  11389. (*
  11390. UniqueId(name,module,name,adr);
  11391. *)
  11392. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  11393. constant.SetValue(value);
  11394. module.moduleScope.AddConstant(constant);
  11395. constant.SetScope(module.moduleScope);
  11396. RETURN constant
  11397. END BuildConstant;
  11398. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11399. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  11400. BEGIN
  11401. variable := scope.firstVariable;
  11402. WHILE variable # NIL DO
  11403. IF variable.NeedsTrace() THEN
  11404. RETURN TRUE;
  11405. END;
  11406. variable := variable.nextVariable;
  11407. END;
  11408. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11409. WHILE parameter # NIL DO
  11410. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11411. RETURN TRUE;
  11412. END;
  11413. parameter := parameter.nextParameter;
  11414. END;
  11415. RETURN FALSE;
  11416. END HasPointers;
  11417. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  11418. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  11419. END IsVariableParameter;
  11420. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11421. VAR parameter: SyntaxTree.Parameter;
  11422. BEGIN
  11423. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11424. WHILE parameter # NIL DO
  11425. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  11426. IF parameter.movable THEN RETURN TRUE END;
  11427. parameter := parameter.nextParameter;
  11428. END;
  11429. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  11430. END HasVariableParameters;
  11431. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  11432. BEGIN
  11433. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  11434. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  11435. END HasExplicitTraceMethod;
  11436. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  11437. BEGIN
  11438. IF expression.resolved # NIL THEN expression := expression.resolved END;
  11439. IF (expression IS SyntaxTree.IntegerValue) THEN
  11440. val := expression(SyntaxTree.IntegerValue).value;
  11441. RETURN TRUE
  11442. ELSE
  11443. RETURN FALSE
  11444. END;
  11445. END IsIntegerConstant;
  11446. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  11447. BEGIN
  11448. IF val <= 0 THEN RETURN FALSE END;
  11449. exp := 0;
  11450. WHILE ~ODD(val) DO
  11451. val := val DIV 2;
  11452. INC(exp)
  11453. END;
  11454. RETURN val = 1
  11455. END PowerOf2;
  11456. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  11457. VAR procedure: SyntaxTree.Procedure;
  11458. BEGIN
  11459. procedure := record.recordScope.constructor;
  11460. IF procedure = NIL THEN
  11461. record := record.GetBaseRecord();
  11462. IF record # NIL THEN
  11463. procedure := GetConstructor(record)
  11464. END;
  11465. END;
  11466. RETURN procedure;
  11467. END GetConstructor;
  11468. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  11469. BEGIN
  11470. value := SHORT(op.intValue);
  11471. RETURN op.mode = IntermediateCode.ModeImmediate;
  11472. END IsIntegerImmediate;
  11473. (** whether a type strictily is a pointer to record or object type
  11474. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  11475. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  11476. BEGIN
  11477. IF type = NIL THEN
  11478. RETURN FALSE
  11479. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  11480. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  11481. ELSE
  11482. RETURN FALSE
  11483. END
  11484. END IsStrictlyPointerToRecord;
  11485. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  11486. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  11487. END IsUnsafePointer;
  11488. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  11489. BEGIN type := type.resolved;
  11490. IF type IS SyntaxTree.PointerType THEN
  11491. type := type(SyntaxTree.PointerType).pointerBase;
  11492. type := type.resolved;
  11493. IF type IS SyntaxTree.RecordType THEN
  11494. recordType := type(SyntaxTree.RecordType);
  11495. RETURN TRUE
  11496. ELSE
  11497. RETURN FALSE
  11498. END
  11499. ELSIF type IS SyntaxTree.RecordType THEN
  11500. recordType := type(SyntaxTree.RecordType);
  11501. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  11502. ELSIF type IS SyntaxTree.ObjectType THEN
  11503. RETURN TRUE
  11504. ELSIF type IS SyntaxTree.AnyType THEN
  11505. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  11506. ELSE
  11507. RETURN FALSE
  11508. END;
  11509. END IsPointerToRecord;
  11510. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  11511. BEGIN
  11512. type := type.resolved;
  11513. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  11514. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  11515. END IsArrayOfSystemByte;
  11516. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  11517. BEGIN
  11518. IF type = NIL THEN RETURN FALSE END;
  11519. type := type.resolved;
  11520. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  11521. END IsOpenArray;
  11522. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  11523. BEGIN
  11524. IF type = NIL THEN RETURN FALSE END;
  11525. type := type.resolved;
  11526. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  11527. END IsStaticArray;
  11528. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  11529. VAR size: LONGINT;
  11530. BEGIN
  11531. size := 1;
  11532. WHILE (IsStaticArray(type)) DO
  11533. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  11534. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11535. END;
  11536. RETURN size;
  11537. END StaticArrayNumElements;
  11538. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11539. BEGIN
  11540. WHILE (IsStaticArray(type)) DO
  11541. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11542. END;
  11543. RETURN type;
  11544. END StaticArrayBaseType;
  11545. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11546. BEGIN
  11547. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  11548. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11549. END;
  11550. RETURN type;
  11551. END ArrayBaseType;
  11552. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  11553. BEGIN
  11554. IF type = NIL THEN RETURN FALSE END;
  11555. type := type.resolved;
  11556. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  11557. END IsDelegate;
  11558. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  11559. VAR i: LONGINT;
  11560. BEGIN
  11561. i := 0; type := type.resolved;
  11562. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  11563. INC(i);
  11564. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  11565. END;
  11566. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  11567. INC(i);
  11568. type := type(SyntaxTree.MathArrayType).arrayBase;
  11569. IF type # NIL THEN type := type.resolved END;
  11570. END;
  11571. RETURN i
  11572. END DynamicDim;
  11573. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  11574. BEGIN
  11575. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  11576. type := type(SyntaxTree.ArrayType).arrayBase;
  11577. END;
  11578. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  11579. type := type(SyntaxTree.MathArrayType).arrayBase;
  11580. END;
  11581. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  11582. END StaticSize;
  11583. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  11584. BEGIN
  11585. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  11586. END IsImmediate;
  11587. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  11588. BEGIN
  11589. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  11590. END IsAddress;
  11591. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  11592. BEGIN
  11593. RETURN (x.mode = IntermediateCode.ModeRegister);
  11594. END IsRegister;
  11595. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  11596. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  11597. BEGIN
  11598. typeDeclaration := recordType.typeDeclaration;
  11599. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11600. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11601. END GetRecordTypeName;
  11602. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  11603. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  11604. BEGIN
  11605. parSize := 0;
  11606. IF StructuredReturnType(procedureType) THEN
  11607. parameter := procedureType.returnParameter;
  11608. INC(parSize,system.SizeOfParameter(parameter));
  11609. parSize := parSize + (-parSize) MOD system.addressSize;
  11610. END;
  11611. parameter :=procedureType.lastParameter;
  11612. WHILE (parameter # NIL) DO
  11613. INC(parSize,system.SizeOfParameter(parameter));
  11614. parSize := parSize + (-parSize) MOD system.addressSize;
  11615. parameter := parameter.prevParameter;
  11616. END;
  11617. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  11618. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  11619. RETURN ToMemoryUnits(system,parSize)
  11620. END ParametersSize;
  11621. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  11622. BEGIN
  11623. IF type = NIL THEN RETURN FALSE
  11624. ELSE
  11625. type := type.resolved;
  11626. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  11627. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  11628. END
  11629. END ReturnedAsParameter;
  11630. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  11631. BEGIN
  11632. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  11633. END StructuredReturnType;
  11634. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  11635. BEGIN
  11636. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  11637. END IsNested;
  11638. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  11639. BEGIN
  11640. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  11641. scope := scope.outerScope;
  11642. END;
  11643. RETURN scope # NIL;
  11644. END InCellScope;
  11645. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  11646. BEGIN
  11647. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  11648. RETURN 0
  11649. ELSE
  11650. *)
  11651. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  11652. (*END;*)
  11653. END ProcedureParametersSize;
  11654. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  11655. VAR dataUnit: LONGINT;
  11656. BEGIN dataUnit := system.dataUnit;
  11657. ASSERT(size MOD system.dataUnit = 0);
  11658. RETURN size DIV system.dataUnit
  11659. END ToMemoryUnits;
  11660. PROCEDURE Get*(): Backend.Backend;
  11661. VAR backend: IntermediateBackend;
  11662. BEGIN NEW(backend); RETURN backend
  11663. END Get;
  11664. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  11665. VAR instruction: IntermediateCode.Instruction;
  11666. BEGIN
  11667. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  11668. RETURN instruction
  11669. END Nop;
  11670. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11671. VAR instruction: IntermediateCode.Instruction;
  11672. BEGIN
  11673. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  11674. RETURN instruction
  11675. END Mov;
  11676. (* like Mov but ensures that no new register will be allocated for dest *)
  11677. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11678. VAR instruction: IntermediateCode.Instruction;
  11679. BEGIN
  11680. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  11681. RETURN instruction
  11682. END MovReplace;
  11683. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11684. VAR instruction: IntermediateCode.Instruction;
  11685. BEGIN
  11686. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  11687. RETURN instruction
  11688. END Conv;
  11689. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  11690. VAR instruction: IntermediateCode.Instruction;
  11691. BEGIN
  11692. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  11693. RETURN instruction
  11694. END Call;
  11695. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  11696. VAR op1, op2: IntermediateCode.Operand;
  11697. VAR instruction: IntermediateCode.Instruction;
  11698. BEGIN
  11699. IntermediateCode.InitNumber(op1,pcOffset);
  11700. IntermediateCode.InitNumber(op2,callingConvention);
  11701. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  11702. RETURN instruction
  11703. END Exit;
  11704. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  11705. VAR instruction: IntermediateCode.Instruction;
  11706. BEGIN
  11707. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  11708. RETURN instruction
  11709. END Return;
  11710. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  11711. VAR instruction: IntermediateCode.Instruction;
  11712. BEGIN
  11713. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  11714. RETURN instruction
  11715. END Result;
  11716. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  11717. VAR op1: IntermediateCode.Operand;
  11718. VAR instruction: IntermediateCode.Instruction;
  11719. BEGIN
  11720. IntermediateCode.InitNumber(op1,nr);
  11721. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  11722. RETURN instruction
  11723. END Trap;
  11724. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  11725. VAR instruction: IntermediateCode.Instruction;
  11726. BEGIN
  11727. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  11728. RETURN instruction
  11729. END Br;
  11730. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11731. VAR instruction: IntermediateCode.Instruction;
  11732. BEGIN
  11733. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  11734. RETURN instruction
  11735. END Breq;
  11736. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11737. VAR instruction: IntermediateCode.Instruction;
  11738. BEGIN
  11739. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  11740. RETURN instruction
  11741. END Brne;
  11742. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11743. VAR instruction: IntermediateCode.Instruction;
  11744. BEGIN
  11745. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  11746. RETURN instruction
  11747. END Brge;
  11748. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11749. VAR instruction: IntermediateCode.Instruction;
  11750. BEGIN
  11751. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  11752. RETURN instruction
  11753. END Brlt;
  11754. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  11755. VAR instruction: IntermediateCode.Instruction;
  11756. BEGIN
  11757. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  11758. RETURN instruction
  11759. END Pop;
  11760. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  11761. VAR instruction: IntermediateCode.Instruction;
  11762. BEGIN
  11763. ASSERT(op.mode # IntermediateCode.Undefined);
  11764. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  11765. RETURN instruction
  11766. END Push;
  11767. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11768. VAR instruction: IntermediateCode.Instruction;
  11769. BEGIN
  11770. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  11771. RETURN instruction
  11772. END Neg;
  11773. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11774. VAR instruction: IntermediateCode.Instruction;
  11775. BEGIN
  11776. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  11777. RETURN instruction
  11778. END Not;
  11779. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11780. VAR instruction: IntermediateCode.Instruction;
  11781. BEGIN
  11782. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  11783. RETURN instruction
  11784. END Abs;
  11785. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11786. VAR instruction: IntermediateCode.Instruction;
  11787. BEGIN
  11788. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  11789. RETURN instruction
  11790. END Mul;
  11791. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11792. VAR instruction: IntermediateCode.Instruction;
  11793. BEGIN
  11794. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  11795. RETURN instruction
  11796. END Div;
  11797. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11798. VAR instruction: IntermediateCode.Instruction;
  11799. BEGIN
  11800. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  11801. RETURN instruction
  11802. END Mod;
  11803. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11804. VAR instruction: IntermediateCode.Instruction;
  11805. BEGIN
  11806. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  11807. RETURN instruction
  11808. END Sub;
  11809. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11810. VAR instruction: IntermediateCode.Instruction;
  11811. BEGIN
  11812. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  11813. RETURN instruction
  11814. END Add;
  11815. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11816. VAR instruction: IntermediateCode.Instruction;
  11817. BEGIN
  11818. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  11819. RETURN instruction
  11820. END And;
  11821. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11822. VAR instruction: IntermediateCode.Instruction;
  11823. BEGIN
  11824. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  11825. RETURN instruction
  11826. END Or;
  11827. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11828. VAR instruction: IntermediateCode.Instruction;
  11829. BEGIN
  11830. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  11831. RETURN instruction
  11832. END Xor;
  11833. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11834. VAR instruction: IntermediateCode.Instruction;
  11835. BEGIN
  11836. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  11837. RETURN instruction
  11838. END Shl;
  11839. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11840. VAR instruction: IntermediateCode.Instruction;
  11841. BEGIN
  11842. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  11843. RETURN instruction
  11844. END Shr;
  11845. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11846. VAR instruction: IntermediateCode.Instruction;
  11847. BEGIN
  11848. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  11849. RETURN instruction
  11850. END Rol;
  11851. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11852. VAR instruction: IntermediateCode.Instruction;
  11853. BEGIN
  11854. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  11855. RETURN instruction
  11856. END Ror;
  11857. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  11858. VAR instruction: IntermediateCode.Instruction;
  11859. BEGIN
  11860. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  11861. RETURN instruction
  11862. END Cas;
  11863. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  11864. VAR instruction: IntermediateCode.Instruction;
  11865. BEGIN
  11866. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  11867. RETURN instruction
  11868. END Copy;
  11869. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  11870. VAR instruction: IntermediateCode.Instruction;
  11871. BEGIN
  11872. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  11873. RETURN instruction
  11874. END Fill;
  11875. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  11876. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  11877. BEGIN
  11878. string := IntermediateCode.String(s);
  11879. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  11880. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  11881. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  11882. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  11883. RETURN instruction
  11884. END Asm;
  11885. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  11886. VAR instruction: IntermediateCode.Instruction;
  11887. BEGIN
  11888. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  11889. RETURN instruction
  11890. END Data;
  11891. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  11892. VAR instruction: IntermediateCode.Instruction;
  11893. BEGIN
  11894. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  11895. IntermediateCode.SetSubType(instruction, subtype);
  11896. RETURN instruction
  11897. END SpecialInstruction;
  11898. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  11899. VAR op1: IntermediateCode.Operand;
  11900. VAR instruction: IntermediateCode.Instruction;
  11901. BEGIN
  11902. (*! generate a warning if size exceeds a certain limit *)
  11903. (*
  11904. ASSERT(bytes < 1000000); (* sanity check *)
  11905. *)
  11906. ASSERT(0 <= units); (* sanity check *)
  11907. IntermediateCode.InitNumber(op1,units);
  11908. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  11909. RETURN instruction
  11910. END Reserve;
  11911. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  11912. VAR op1: IntermediateCode.Operand;
  11913. VAR instruction: IntermediateCode.Instruction;
  11914. BEGIN
  11915. IntermediateCode.InitNumber(op1,position);
  11916. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  11917. RETURN instruction
  11918. END LabelInstruction;
  11919. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  11920. VAR pc: LONGINT;
  11921. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  11922. BEGIN
  11923. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  11924. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  11925. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  11926. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  11927. IF instr.op1.type.form = IntermediateCode.Float THEN
  11928. RETURN instr.op1.floatValue = op.floatValue
  11929. ELSE
  11930. RETURN instr.op1.intValue = op.intValue
  11931. END;
  11932. END ProvidesValue;
  11933. BEGIN
  11934. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  11935. pc := 0;
  11936. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  11937. INC(pc);
  11938. END;
  11939. IF pc = data.pc THEN
  11940. data.Emit(Data(-1,vop));
  11941. END;
  11942. RETURN pc
  11943. END EnterImmediate;
  11944. PROCEDURE Init;
  11945. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  11946. BEGIN
  11947. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  11948. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  11949. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  11950. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  11951. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  11952. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  11953. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  11954. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  11955. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  11956. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  11957. IntermediateCode.InitOperand(emptyOperand);
  11958. FOR i := 0 TO NumberSystemCalls-1 DO
  11959. name := "@SystemCall";
  11960. Basic.AppendNumber(name,i);
  11961. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  11962. END;
  11963. END Init;
  11964. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  11965. BEGIN
  11966. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  11967. END IsExported;
  11968. BEGIN
  11969. Init;
  11970. END FoxIntermediateBackend.
  11971. Compiler.Compile FoxIntermediateBackend.Mod ~