FoxIntermediateBackend.Mod 531 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. suppressModuleRegistration=FALSE;
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. StrictChecks = FALSE;
  63. BasePointerTypeSize = 5;
  64. BaseArrayTypeSize = BasePointerTypeSize + 3;
  65. LengthOffset = BasePointerTypeSize + 0;
  66. DataOffset = BasePointerTypeSize + 1;
  67. DescriptorOffset = BasePointerTypeSize + 2;
  68. BaseRecordTypeSize = BasePointerTypeSize + 2;
  69. ActionOffset = BasePointerTypeSize + 0;
  70. MonitorOffset = BasePointerTypeSize + 1;
  71. BaseObjectTypeSize = BaseRecordTypeSize;
  72. ActionTypeSize = 3;
  73. MonitorTypeSize = 7;
  74. ProcessorOffset = BaseObjectTypeSize + 1;
  75. StackLimitOffset* = BaseObjectTypeSize + 3;
  76. QuantumOffset = BaseObjectTypeSize + 4;
  77. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  78. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  79. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  80. Size2Flag = 4; (* size = 2 *)
  81. Size3Flag = 5; (* size = 3 *)
  82. Size4Flag = 6; (* size = 4 *)
  83. Size5Flag = 7; (* size = 5 *)
  84. Size6Flag = 8; (* size = 6 *)
  85. Size7Flag = 9; (* size = 7 *)
  86. Size8Flag = 10; (* size = 8 *)
  87. ReflectionSupport = TRUE;
  88. TYPE
  89. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  90. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  91. Operand = RECORD
  92. mode: SHORTINT;
  93. op: IntermediateCode.Operand;
  94. tag: IntermediateCode.Operand;
  95. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  96. dimOffset: LONGINT;
  97. END;
  98. Fixup= POINTER TO RECORD
  99. pc: LONGINT;
  100. nextFixup: Fixup;
  101. END;
  102. WriteBackCall = POINTER TO RECORD
  103. call: SyntaxTree.ProcedureCallDesignator;
  104. next: WriteBackCall;
  105. END;
  106. Label= OBJECT
  107. VAR
  108. fixups: Fixup;
  109. section: IntermediateCode.Section;
  110. pc: LONGINT;
  111. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  112. BEGIN
  113. SELF.section := section; pc := -1;
  114. END InitLabel;
  115. PROCEDURE Resolve(pc: LONGINT);
  116. VAR at: LONGINT;
  117. BEGIN
  118. SELF.pc := pc;
  119. WHILE(fixups # NIL) DO
  120. at := fixups.pc;
  121. section.PatchAddress(at,pc);
  122. fixups := fixups.nextFixup;
  123. END;
  124. END Resolve;
  125. PROCEDURE AddFixup(at: LONGINT);
  126. VAR fixup: Fixup;
  127. BEGIN
  128. ASSERT(pc=-1);
  129. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  130. END AddFixup;
  131. END Label;
  132. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  133. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  134. VAR
  135. backend: IntermediateBackend;
  136. implementationVisitor: ImplementationVisitor;
  137. meta: MetaDataGenerator;
  138. system: Global.System;
  139. currentScope: SyntaxTree.Scope;
  140. module: Sections.Module;
  141. moduleSelf: SyntaxTree.Variable;
  142. dump: BOOLEAN;
  143. forceModuleBody: BOOLEAN;
  144. addressType: IntermediateCode.Type;
  145. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  146. BEGIN
  147. currentScope := NIL; module := NIL; moduleSelf := NIL;
  148. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  149. SELF.dump := dump;
  150. SELF.backend := backend;
  151. SELF.forceModuleBody := forceModuleBody;
  152. addressType := IntermediateCode.GetType(system,system.addressType)
  153. END Init;
  154. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  155. BEGIN
  156. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  157. END Error;
  158. PROCEDURE Type(x: SyntaxTree.Type);
  159. BEGIN
  160. x.Accept(SELF);
  161. END Type;
  162. (** types **)
  163. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  164. BEGIN (* no code emission *) END VisitBasicType;
  165. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  166. BEGIN (* no code emission *) END VisitCharacterType;
  167. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  168. BEGIN (* no code emission *) END VisitIntegerType;
  169. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  170. BEGIN (* no code emission *) END VisitFloatType;
  171. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  172. BEGIN (* no code emission *) END VisitComplexType;
  173. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  174. VAR type: SyntaxTree.Type;
  175. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  176. type := x.resolved;
  177. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  178. meta.CheckTypeDeclaration(type);
  179. END;
  180. END VisitQualifiedType;
  181. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  182. BEGIN (* no code emission *) END VisitStringType;
  183. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  184. BEGIN (* no code emission *)
  185. END VisitArrayRangeType;
  186. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  187. BEGIN (* no code emission *) END VisitArrayType;
  188. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  189. BEGIN
  190. meta.CheckTypeDeclaration(x);
  191. END VisitMathArrayType;
  192. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  193. BEGIN
  194. meta.CheckTypeDeclaration(x);
  195. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  196. END VisitPointerType;
  197. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  198. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  199. BEGIN (* no code emission *)
  200. meta.CheckTypeDeclaration(x);
  201. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  202. IF x.pointerType.typeDeclaration # NIL THEN
  203. td := x.pointerType.typeDeclaration
  204. ELSE
  205. td := x.typeDeclaration
  206. END;
  207. Global.GetSymbolName(td,name);
  208. (* code section for object *)
  209. END;
  210. Scope(x.recordScope);
  211. END VisitRecordType;
  212. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  213. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  214. BEGIN
  215. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  216. WHILE (this # NIL) & (this.identifier# id) DO
  217. this := this.nextModifier;
  218. END;
  219. RETURN this # NIL
  220. END HasFlag;
  221. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  222. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  223. (*
  224. PROCEDURE CreatePorts(type: SyntaxTree.Type; len: LONGINT);
  225. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  226. BEGIN
  227. FOR i := 0 TO len-1 DO
  228. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  229. CreatePorts(baseType, len*len2);
  230. ELSIF IsSemiDynamicArray(type) THEN
  231. port := MIN(LONGINT); (* unknown port address from here on *)
  232. ELSE
  233. IntermediateCode.InitImmediate(op,addressType,adr);
  234. symbol.Emit(Data(-1,op));
  235. INC(port);
  236. END;
  237. END;
  238. END CreatePorts;
  239. *)
  240. BEGIN
  241. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  242. (*
  243. IF (x.cellScope.ownerModule = module.module) THEN
  244. td := x.typeDeclaration;
  245. Global.GetSymbolSegmentedName(td,name);
  246. (* code section for object *)
  247. END;
  248. *)
  249. (* unnecessary to generate space for ports: already represented as hidden variables *)
  250. (*
  251. port := 0;
  252. parameter := x.firstParameter;
  253. WHILE parameter # NIL DO
  254. type := parameter.type.resolved;
  255. Global.GetSymbolSegmentedName(parameter,name);
  256. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection,name,parameter,dump);
  257. IF port >= 0 THEN
  258. (*! could be used for optimization: query value here ???
  259. parameter.SetResolved(SyntaxTree.NewIntegerValue(-1, port));
  260. *)
  261. END;
  262. CreatePorts(type, 1);
  263. IF backend.cellsAreObjects THEN
  264. IF IsStaticArray(parameter.type.resolved) THEN
  265. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  266. END;
  267. END;
  268. parameter := parameter.nextParameter;
  269. END;
  270. *)
  271. capabilities := {};
  272. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  273. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  274. backend.SetCapabilities(capabilities);
  275. Scope(x.cellScope);
  276. END VisitCellType;
  277. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  278. BEGIN (* no code emission *) END VisitProcedureType;
  279. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  280. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  281. END VisitEnumerationType;
  282. (* symbols *)
  283. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  284. BEGIN
  285. Procedure(x);
  286. END VisitProcedure;
  287. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  288. BEGIN
  289. Procedure(x);
  290. END VisitOperator;
  291. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  292. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i: LONGINT;
  293. BEGIN
  294. IF x.externalName # NIL THEN RETURN END;
  295. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  296. (* code section for variable *)
  297. Global.GetSymbolSegmentedName(x,name);
  298. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  299. irv.SetExported(IsExported(x));
  300. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  301. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  302. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  303. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  304. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  305. FOR i := 0 TO DynamicDim(x.type)-1 DO
  306. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  307. END;
  308. ELSE
  309. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))));
  310. IF ~x.fixed THEN
  311. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  312. ELSE
  313. align := x.alignment;
  314. END;
  315. irv.SetPositionOrAlignment(x.fixed, align);
  316. meta.CheckTypeDeclaration(x.type);
  317. END;
  318. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  319. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  320. END;
  321. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  322. END VisitVariable;
  323. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  324. VAR name: Basic.SegmentedName; irv, irl: IntermediateCode.Section; op: Operand; dim: LONGINT;
  325. BEGIN
  326. HALT(100);
  327. (*
  328. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  329. (* code section for variable *)
  330. Global.GetSymbolSegmentedName(x,name);
  331. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  332. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  333. (*
  334. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  335. *)
  336. IF IsSemiDynamicArray(x.type) & ~backend.cellsAreObjects THEN
  337. HALT(100);
  338. irv.Emit(Reserve(x.position, system.addressSize));
  339. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  340. irl := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  341. irl.Emit(Reserve(x.position, DynamicDim(x.type) * system.addressSize));
  342. ELSIF x.defaultValue = NIL THEN
  343. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  344. ELSE
  345. implementationVisitor.inData := TRUE;
  346. implementationVisitor.Evaluate(x.defaultValue, op);
  347. irv.Emit(Data(x.position,op.op));
  348. implementationVisitor.inData := FALSE;
  349. END;
  350. meta.CheckTypeDeclaration(x.type);
  351. *)
  352. END VisitParameter;
  353. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  354. BEGIN
  355. Type(x.declaredType); (* => code in objects *)
  356. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  357. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  358. END;
  359. END VisitTypeDeclaration;
  360. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  361. BEGIN
  362. IF (SyntaxTree.Public * x.access # {}) THEN
  363. implementationVisitor.VisitConstant(x);
  364. END;
  365. END VisitConstant;
  366. PROCEDURE Scope(x: SyntaxTree.Scope);
  367. VAR procedure: SyntaxTree.Procedure;
  368. constant: SyntaxTree.Constant;
  369. variable: SyntaxTree.Variable;
  370. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  371. BEGIN
  372. prevScope := currentScope;
  373. currentScope := x;
  374. (* constants treated in implementation visitor *)
  375. typeDeclaration := x.firstTypeDeclaration;
  376. WHILE typeDeclaration # NIL DO
  377. VisitTypeDeclaration(typeDeclaration);
  378. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  379. END;
  380. variable := x.firstVariable;
  381. WHILE variable # NIL DO
  382. VisitVariable(variable);
  383. variable := variable.nextVariable;
  384. END;
  385. procedure := x.firstProcedure;
  386. WHILE procedure # NIL DO
  387. VisitProcedure(procedure);
  388. procedure := procedure.nextProcedure;
  389. END;
  390. constant := x.firstConstant;
  391. WHILE constant # NIL DO
  392. VisitConstant(constant);
  393. constant := constant.nextConstant;
  394. END;
  395. currentScope := prevScope;
  396. END Scope;
  397. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  398. VAR parameter: SyntaxTree.Parameter;
  399. BEGIN
  400. parameter := first;
  401. WHILE parameter # NIL DO
  402. VisitParameter(parameter);
  403. parameter := parameter.nextParameter;
  404. END;
  405. END Parameters;
  406. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  407. VAR scope: SyntaxTree.ProcedureScope;
  408. prevScope: SyntaxTree.Scope;
  409. inline, finalizer: BOOLEAN;
  410. procedureType: SyntaxTree.ProcedureType;
  411. pc: LONGINT;
  412. stackSize: LONGINT;
  413. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  414. null,size,src,dest,fp,res: IntermediateCode.Operand;
  415. cc: LONGINT;
  416. cellType: SyntaxTree.CellType;
  417. registerNumber: LONGINT;
  418. registerClass: IntermediateCode.RegisterClass;
  419. type: IntermediateCode.Type;
  420. formalParameter: SyntaxTree.Parameter;
  421. recordType: SyntaxTree.RecordType;
  422. isModuleBody: BOOLEAN;
  423. PROCEDURE Signature;
  424. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  425. BEGIN
  426. procedureType := x.type(SyntaxTree.ProcedureType);
  427. returnType := procedureType.returnType;
  428. IF returnType # NIL THEN
  429. meta.CheckTypeDeclaration(returnType)
  430. END;
  431. parameter := procedureType.firstParameter;
  432. WHILE parameter # NIL DO
  433. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  434. parameter := parameter.nextParameter;
  435. END;
  436. END Signature;
  437. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  438. VAR result: BOOLEAN;
  439. BEGIN
  440. result := FALSE;
  441. IF x = SyntaxTree.invalidExpression THEN
  442. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  443. result := TRUE;
  444. value := x.resolved(SyntaxTree.IntegerValue).value;
  445. ELSE
  446. Error(x.position,"expression is not an integer constant");
  447. END;
  448. RETURN result;
  449. END CheckIntegerValue;
  450. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  451. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  452. BEGIN
  453. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  454. WHILE (this # NIL) & (this.identifier # id) DO
  455. this := this.nextModifier;
  456. END;
  457. IF this # NIL THEN
  458. IF this.expression = NIL THEN
  459. Error(this.position,"expected expression value");
  460. ELSIF CheckIntegerValue(this.expression,value) THEN
  461. END;
  462. RETURN TRUE
  463. ELSE RETURN FALSE
  464. END;
  465. END HasValue;
  466. CONST DefaultDataMemorySize=512;
  467. BEGIN
  468. IF x.externalName # NIL THEN RETURN END;
  469. (*
  470. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  471. *)
  472. (* code section for this procedure *)
  473. scope := x.procedureScope;
  474. prevScope := currentScope;
  475. currentScope := scope;
  476. procedureType := x.type(SyntaxTree.ProcedureType);
  477. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  478. implementationVisitor.temporaries.Init;
  479. implementationVisitor.usedRegisters := NIL;
  480. implementationVisitor.registerUsageCount.Init;
  481. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  482. IF (scope.body # NIL) & (x.isInline) THEN
  483. inline := TRUE;
  484. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  485. ir.SetExported(IsExported(x));
  486. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  487. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  488. IF backend.cellsAreObjects THEN
  489. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  490. ir.SetExported(IsExported(x));
  491. ELSE
  492. RETURN; (* cellnet cannot be compiled for final static hardware *)
  493. END;
  494. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  495. inline := FALSE;
  496. AddBodyCallStub(x);
  497. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  498. ir.SetExported(IsExported(x));
  499. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  500. inline := FALSE;
  501. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  502. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  503. AddBodyCallStub(x);
  504. AddStackAllocation(x,stackSize);
  505. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  506. ir.SetExported(IsExported(x));
  507. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  508. inline := FALSE;
  509. Parameters(procedureType.firstParameter);
  510. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  511. ir.SetExported(IsExported(x));
  512. ELSE
  513. inline := FALSE;
  514. IF x.isEntry OR x.isExit THEN
  515. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  516. ir.SetExported(TRUE);
  517. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  518. ELSE
  519. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  520. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  521. END;
  522. END;
  523. cc := procedureType.callingConvention;
  524. IF scope.body # NIL THEN
  525. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  526. registerNumber := 0;
  527. IF ~inline THEN
  528. IF scope.lastVariable = NIL THEN
  529. stackSize := 0
  530. ELSE
  531. stackSize := scope.lastVariable.offsetInBits;
  532. IF stackSize <0 THEN stackSize := -stackSize END;
  533. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  534. END;
  535. (*
  536. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  537. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  538. *)
  539. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  540. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  541. END;
  542. pc := ir.pc-1;
  543. (*
  544. ir.Emit(Nop(position)); (* placeholder for fill *)
  545. *)
  546. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  547. formalParameter := procedureType.lastParameter;
  548. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  549. IF ~PassInRegister(formalParameter) THEN
  550. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  551. ELSE
  552. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  553. type := GetType(system, formalParameter.type);
  554. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  555. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  556. ir.Emit(Mov(-1,dest, src));
  557. implementationVisitor.ReleaseIntermediateOperand(src);
  558. INC(registerNumber);
  559. formalParameter := formalParameter.prevParameter;
  560. END;
  561. END;
  562. END;
  563. ir.EnterValidPAF;
  564. END;
  565. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  566. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  567. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  568. IF scope.lastVariable # NIL THEN
  569. stackSize := scope.lastVariable.offsetInBits;
  570. IF stackSize <0 THEN stackSize := -stackSize END;
  571. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  572. END;
  573. END;
  574. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  575. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  576. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  577. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  578. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  579. ir.EmitAt(pc,Push(size));
  580. implementationVisitor.StaticCallOperand(result,procedure);
  581. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  582. END;
  583. *)
  584. END;
  585. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  586. IF stackSize > 0 THEN
  587. IF (stackSize MOD system.addressSize = 0) THEN
  588. null := IntermediateCode.Immediate(addressType,0);
  589. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  590. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  591. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  592. ELSE
  593. null := IntermediateCode.Immediate(int8,0);
  594. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  595. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  596. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  597. END;
  598. (*! should potentially be called by backend -- enter might initialize
  599. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  600. *)
  601. END;
  602. ir.ExitValidPAF;
  603. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  604. finalizer := FALSE;
  605. IF backend.cooperative & x.isFinalizer THEN
  606. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  607. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  608. GetRecordTypeName(recordType,name);
  609. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  610. END;
  611. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  612. IF backend.cooperative THEN
  613. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  614. IF implementationVisitor.profile & ~isModuleBody THEN
  615. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  616. END;
  617. END;
  618. implementationVisitor.EmitLeave(ir, x.position,cc);
  619. IF finalizer THEN
  620. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  621. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  622. ir.Emit(Br(x.position,dest));
  623. ELSE
  624. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  625. END;
  626. ELSE
  627. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  628. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  629. END;
  630. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  631. IF backend.cooperative THEN
  632. IF HasPointers (scope) THEN
  633. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  634. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  635. ir.Emit(Result(x.position, res));
  636. ir.Emit(Push(x.position, res));
  637. implementationVisitor.ResetVariables(scope);
  638. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  639. ir.Emit(Pop(x.position, res));
  640. ir.Emit(Return(x.position, res));
  641. ELSE
  642. implementationVisitor.ResetVariables(scope);
  643. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  644. END;
  645. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  646. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  647. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  648. ir.Emit(Result(x.position, res));
  649. ir.Emit(Push(x.position, res));
  650. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  651. ir.Emit(Pop(x.position, res));
  652. ir.Emit(Return(x.position, res));
  653. ELSE
  654. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  655. END;
  656. END;
  657. implementationVisitor.EmitLeave(ir,x.position,cc);
  658. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  659. ELSE
  660. ir.Emit(Nop(x.position));
  661. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  662. implementationVisitor.EmitLeave(ir,x.position,cc);
  663. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  664. END;
  665. END;
  666. END
  667. END;
  668. ELSE (* force body for procedures *)
  669. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  670. ir.EnterValidPAF;
  671. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  672. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  673. ir.ExitValidPAF;
  674. implementationVisitor.EmitLeave(ir,x.position,cc);
  675. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  676. END;
  677. Scope(scope);
  678. Signature;
  679. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  680. currentScope := prevScope;
  681. END Procedure;
  682. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  683. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  684. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  685. BEGIN
  686. ASSERT (bodyProcedure # NIL);
  687. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  688. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  689. procedure.SetScope(bodyProcedure.scope);
  690. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  691. procedure.SetAccess(SyntaxTree.Hidden);
  692. Global.GetSymbolSegmentedName (procedure,name);
  693. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  694. ir.SetExported(TRUE);
  695. ir.SetPriority(InitPriority);
  696. Global.GetSymbolSegmentedName (bodyProcedure,name);
  697. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  698. implementationVisitor.currentScope := module.module.moduleScope;
  699. implementationVisitor.section := ir;
  700. implementationVisitor.PushSelfPointer();
  701. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  702. ELSIF backend.preregisterStatic THEN
  703. implementationVisitor.currentScope := module.module.moduleScope;
  704. implementationVisitor.section := ir;
  705. implementationVisitor.PushSelfPointer();
  706. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  707. ELSE
  708. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  709. ir.Emit(Call(bodyProcedure.position,op, 0));
  710. END;
  711. END AddBodyCallStub;
  712. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  713. VAR name: Basic.SegmentedName;
  714. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  715. BEGIN
  716. Global.GetSymbolSegmentedName (symbol,name);
  717. Basic.RemoveSuffix(name);
  718. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  719. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  720. ir.SetExported(TRUE);
  721. ir.SetPriority(FirstPriority);
  722. IntermediateCode.InitImmediate(op,addressType,initStack);
  723. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  724. END AddStackAllocation;
  725. (** entry function to visit a complete module *)
  726. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  727. VAR
  728. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  729. hasDynamicOperatorDeclarations: BOOLEAN;
  730. operator: SyntaxTree.Operator;
  731. import: SyntaxTree.Import;
  732. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  733. BEGIN
  734. type := type.resolved;
  735. IF type IS SyntaxTree.RecordType THEN
  736. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  737. ELSIF (type IS SyntaxTree.ArrayType) THEN
  738. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  739. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  740. END;
  741. ELSIF type IS SyntaxTree.MathArrayType THEN
  742. WITH type: SyntaxTree.MathArrayType DO
  743. IF type.form = SyntaxTree.Open THEN
  744. RETURN TRUE
  745. ELSIF type.form = SyntaxTree.Static THEN
  746. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  747. END;
  748. END;
  749. END;
  750. RETURN FALSE
  751. END TypeNeedsInitialization;
  752. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  753. VAR variable: SyntaxTree.Variable;
  754. BEGIN
  755. variable := scope.firstVariable;
  756. WHILE variable # NIL DO
  757. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  758. IF variable.initializer # NIL THEN RETURN TRUE END;
  759. variable := variable.nextVariable;
  760. END;
  761. RETURN FALSE
  762. END ScopeNeedsInitialization;
  763. BEGIN
  764. ASSERT(x # NIL); ASSERT(module # NIL);
  765. SELF.module := module;
  766. (* add import names to the generated Sections.Module *)
  767. import := x.moduleScope.firstImport;
  768. WHILE import # NIL DO
  769. import.module.GetName(idstr);
  770. module.imports.AddName(idstr);
  771. import := import.nextImport
  772. END;
  773. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  774. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  775. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  776. moduleSelf.SetType(system.anyType);
  777. moduleSelf.SetScope(x.moduleScope);
  778. moduleSelf.SetUntraced(TRUE);
  779. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  780. ir.SetExported(TRUE);
  781. IntermediateCode.InitImmediate(op,addressType,0);
  782. ir.Emit(Data(-1,op));
  783. END;
  784. implementationVisitor.module := module;
  785. implementationVisitor.moduleScope := x.moduleScope;
  786. implementationVisitor.moduleSelf := moduleSelf;
  787. implementationVisitor.canBeLoaded := TRUE;
  788. meta.SetModule(module);
  789. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  790. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  791. END;
  792. IF backend.profile THEN
  793. EnsureBodyProcedure(x.moduleScope);
  794. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  795. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  796. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  797. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  798. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  799. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  800. Global.GetModuleName(module.module,idstr);
  801. implementationVisitor.ProfilerAddModule(idstr);
  802. implementationVisitor.numberProcedures := 0;
  803. END;
  804. implementationVisitor.profile := backend.profile;
  805. (* check if there is at least one dynamic operator locally defined *)
  806. hasDynamicOperatorDeclarations := FALSE;
  807. operator := x.moduleScope.firstOperator;
  808. WHILE operator # NIL DO
  809. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  810. operator := operator.nextOperator
  811. END;
  812. (* add operator initialization code section *)
  813. IF hasDynamicOperatorDeclarations THEN
  814. EnsureBodyProcedure(x.moduleScope);
  815. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  816. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  817. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  818. END;
  819. Scope(x.moduleScope);
  820. IF hasDynamicOperatorDeclarations THEN
  821. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  822. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  823. END;
  824. IF backend.profile THEN
  825. implementationVisitor.ProfilerPatchInit;
  826. END;
  827. END Module;
  828. END DeclarationVisitor;
  829. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  830. RegisterUsageCount*=OBJECT
  831. VAR used: UsedArray; count: LONGINT;
  832. PROCEDURE &Init;
  833. VAR i: LONGINT;
  834. BEGIN
  835. count := 0;
  836. IF used = NIL THEN NEW(used,64); END;
  837. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  838. END Init;
  839. PROCEDURE Grow;
  840. VAR new: UsedArray; size,i: LONGINT;
  841. BEGIN
  842. size := LEN(used)*2;
  843. NEW(new,size);
  844. FOR i := 0 TO LEN(used)-1 DO
  845. new[i].count := used[i].count;
  846. new[i].type := used[i].type;
  847. new[i].map := used[i].map
  848. END;
  849. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  850. used := new
  851. END Grow;
  852. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  853. BEGIN
  854. INC(count);
  855. IF count = LEN(used) THEN Grow END;
  856. used[count].type := type;
  857. used[count].class := class;
  858. used[count].map := count;
  859. RETURN count;
  860. END Next;
  861. PROCEDURE IncUse(register: LONGINT);
  862. BEGIN
  863. INC(used[register].count);
  864. (*
  865. IF (register = 1) & (count > 30) THEN
  866. D.TraceBack;
  867. END;
  868. *)
  869. END IncUse;
  870. PROCEDURE DecUse(register: LONGINT);
  871. BEGIN
  872. DEC(used[register].count);
  873. END DecUse;
  874. PROCEDURE Map(register: LONGINT): LONGINT;
  875. VAR map : LONGINT;
  876. BEGIN
  877. IF register > 0 THEN
  878. map := used[register].map;
  879. WHILE register # map DO register := map; map := used[register].map END;
  880. END;
  881. RETURN register
  882. END Map;
  883. PROCEDURE Use(register: LONGINT): LONGINT;
  884. BEGIN
  885. IF register< LEN(used) THEN
  886. RETURN used[register].count
  887. ELSE
  888. RETURN 0
  889. END
  890. END Use;
  891. END RegisterUsageCount;
  892. RegisterEntry = POINTER TO RECORD
  893. prev,next: RegisterEntry;
  894. register: LONGINT;
  895. registerClass: IntermediateCode.RegisterClass;
  896. type: IntermediateCode.Type;
  897. END;
  898. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  899. Variables = OBJECT (Basic.List)
  900. VAR
  901. inUse: VariableUse;
  902. registerIndex: LONGINT;
  903. PROCEDURE & Init;
  904. VAR i: LONGINT;
  905. BEGIN
  906. InitList(16);
  907. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  908. registerIndex := 1024;
  909. END Init;
  910. PROCEDURE GetUsage(VAR use: VariableUse);
  911. BEGIN
  912. use := inUse;
  913. END GetUsage;
  914. PROCEDURE SetUsage(CONST use: VariableUse);
  915. BEGIN
  916. inUse := use;
  917. END SetUsage;
  918. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  919. VAR any: ANY;
  920. BEGIN
  921. any := Get(i);;
  922. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  923. END GetVariable;
  924. PROCEDURE Occupy(pos: LONGINT);
  925. BEGIN
  926. INCL(inUse[pos DIV 32], pos MOD 32);
  927. END Occupy;
  928. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  929. BEGIN
  930. Occupy(Length());
  931. Add(v);
  932. END AddVariable;
  933. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  934. VAR var : SyntaxTree.Variable;
  935. BEGIN
  936. FOR pos := 0 TO Length()-1 DO
  937. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  938. var := GetVariable(pos);
  939. IF type.SameType(var.type) THEN
  940. Occupy(pos); RETURN var
  941. END;
  942. END;
  943. END;
  944. pos := Length();
  945. RETURN NIL
  946. END GetFreeVariable;
  947. END Variables;
  948. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  949. SymbolMapper = OBJECT
  950. VAR
  951. first: SymbolMap;
  952. PROCEDURE & Init;
  953. BEGIN
  954. first := NIL;
  955. END Init;
  956. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  957. VAR new: SymbolMap;
  958. BEGIN
  959. NEW(new); new.this := this; new.to := to; new.tag := tag;
  960. new.next := first; first := new;
  961. END Add;
  962. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  963. VAR s: SymbolMap;
  964. BEGIN
  965. s := first;
  966. WHILE (s # NIL) & (s.this # this) DO
  967. s := s.next
  968. END;
  969. RETURN s
  970. END Get;
  971. END SymbolMapper;
  972. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  973. VAR
  974. system: Global.System;
  975. section: IntermediateCode.Section;
  976. module: Sections.Module;
  977. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  978. awaitProcCounter, labelId, constId, caseId: LONGINT;
  979. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  980. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  981. checker: SemanticChecker.Checker;
  982. backend: IntermediateBackend;
  983. meta: MetaDataGenerator;
  984. position: LONGINT;
  985. moduleSelf: SyntaxTree.Variable;
  986. (* variables for hand over of variables / temporary state *)
  987. currentScope: SyntaxTree.Scope;
  988. constantDeclaration : SyntaxTree.Symbol;
  989. result: Operand; (* result of the most recent expression / statement *)
  990. destination: IntermediateCode.Operand;
  991. arrayDestinationTag: IntermediateCode.Operand;
  992. arrayDestinationDimension:LONGINT;
  993. currentLoop: Label; (* variable to hand over loop exit jump list *)
  994. conditional: BOOLEAN;
  995. trueLabel, falseLabel, exitLabel: Label;
  996. locked: BOOLEAN;
  997. (*
  998. usedRegisters: Registers;
  999. *)
  1000. registerUsageCount: RegisterUsageCount;
  1001. usedRegisters: RegisterEntry;
  1002. (* useful operands and types *)
  1003. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1004. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1005. commentPrintout: Printout.Printer;
  1006. dump: Streams.Writer;
  1007. tagsAvailable : BOOLEAN;
  1008. supportedInstruction: SupportedInstructionProcedure;
  1009. supportedImmediate: SupportedImmediateProcedure;
  1010. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1011. emitLabels: BOOLEAN;
  1012. runtimeModuleName : SyntaxTree.IdentifierString;
  1013. newObjectFile: BOOLEAN;
  1014. indexCounter: LONGINT;
  1015. profile: BOOLEAN;
  1016. profileId, profileInit: IntermediateCode.Section;
  1017. profileInitPatchPosition: LONGINT;
  1018. numberProcedures: LONGINT;
  1019. procedureResultDesignator : SyntaxTree.Designator;
  1020. operatorInitializationCodeSection: IntermediateCode.Section;
  1021. fingerPrinter: FingerPrinter.FingerPrinter;
  1022. temporaries: Variables;
  1023. canBeLoaded : BOOLEAN;
  1024. currentIsInline: BOOLEAN;
  1025. currentMapper: SymbolMapper;
  1026. currentInlineExit: Label;
  1027. moduleBodySection: IntermediateCode.Section;
  1028. NeedDescriptor : BOOLEAN;
  1029. cooperativeSwitches: BOOLEAN;
  1030. lastSwitchPC: LONGINT;
  1031. isUnchecked: BOOLEAN;
  1032. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1033. newObjectFile: BOOLEAN);
  1034. BEGIN
  1035. SELF.system := system;
  1036. SELF.runtimeModuleName := runtime;
  1037. currentScope := NIL;
  1038. hiddenPointerType := NIL;
  1039. delegatePointerType := NIL;
  1040. awaitProcCounter := 0;
  1041. labelId := 0; constId := 0; labelId := 0;
  1042. SELF.checker := checker;
  1043. SELF.backend := backend;
  1044. position := Diagnostics.Invalid;
  1045. conditional := FALSE;
  1046. locked := FALSE;
  1047. InitOperand(result,ModeUndefined);
  1048. addressType := IntermediateCode.GetType(system,system.addressType);
  1049. setType := IntermediateCode.GetType(system,system.setType);
  1050. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1051. byteType := IntermediateCode.GetType(system, system.byteType);
  1052. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1053. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1054. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1055. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1056. nil := IntermediateCode.Immediate(addressType,0);
  1057. IntermediateCode.InitOperand(destination);
  1058. tagsAvailable := TRUE;
  1059. supportedInstruction := supportedInstructionProcedure;
  1060. supportedImmediate := supportedImmediateProcedure;
  1061. inData := FALSE;
  1062. SELF.emitLabels := emitLabels;
  1063. IntermediateCode.InitOperand(arrayDestinationTag);
  1064. bool := IntermediateCode.GetType(system,system.booleanType);
  1065. IntermediateCode.InitImmediate(false,bool,0);
  1066. IntermediateCode.InitImmediate(true,bool,1);
  1067. SELF.newObjectFile := newObjectFile;
  1068. indexCounter := 0;
  1069. NEW(registerUsageCount);
  1070. usedRegisters := NIL;
  1071. procedureResultDesignator := NIL;
  1072. NEW(fingerPrinter, system);
  1073. NEW(temporaries);
  1074. currentIsInline := FALSE;
  1075. NeedDescriptor := FALSE;
  1076. isUnchecked := backend.noRuntimeChecks;
  1077. END Init;
  1078. TYPE Context = RECORD
  1079. section: IntermediateCode.Section;
  1080. registerUsageCount: RegisterUsageCount;
  1081. usedRegisters: RegisterEntry;
  1082. END;
  1083. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1084. VAR context: Context;
  1085. BEGIN
  1086. context.section := section;
  1087. context.registerUsageCount := registerUsageCount;
  1088. context.usedRegisters := usedRegisters;
  1089. section := new;
  1090. NEW(registerUsageCount);
  1091. usedRegisters := NIL;
  1092. RETURN context;
  1093. END SwitchContext;
  1094. PROCEDURE ReturnToContext(context: Context);
  1095. BEGIN
  1096. section := context.section;
  1097. registerUsageCount := context.registerUsageCount;
  1098. usedRegisters := context.usedRegisters;
  1099. END ReturnToContext;
  1100. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1101. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1102. BEGIN
  1103. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1104. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1105. END;
  1106. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1107. section.SetExported(IsExported(syntaxTreeSymbol));
  1108. RETURN section
  1109. END NewSection;
  1110. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1111. VAR new: LONGINT;
  1112. BEGIN
  1113. new := registerUsageCount.Next(type,class);
  1114. UseRegister(new);
  1115. RETURN new
  1116. END AcquireRegister;
  1117. (** get the name for the code section that represens a certain symbol
  1118. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1119. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1120. VAR
  1121. operatorFingerPrint: SyntaxTree.FingerPrint;
  1122. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1123. BEGIN
  1124. Global.GetSymbolSegmentedName(symbol, name);
  1125. (* if the symbol is an operator, then append the fingerprint to the name *)
  1126. IF symbol IS SyntaxTree.Operator THEN
  1127. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1128. string := "[";
  1129. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1130. Strings.Append(string, operatorFingerPrintString);
  1131. Strings.Append(string, "]");
  1132. Basic.AppendToSegmentedName(name,string);
  1133. END
  1134. END GetCodeSectionNameForSymbol;
  1135. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1136. BEGIN
  1137. IF dump # NIL THEN
  1138. dump.String("enter "); dump.String(s); dump.Ln;
  1139. END;
  1140. END TraceEnter;
  1141. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1142. BEGIN
  1143. IF dump # NIL THEN
  1144. dump.String("exit "); dump.String(s); dump.Ln;
  1145. END;
  1146. END TraceExit;
  1147. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1148. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1149. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1150. VAR i: LONGINT;
  1151. BEGIN
  1152. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1153. IF op.rule # NIL THEN
  1154. FOR i := 0 TO LEN(op.rule)-1 DO
  1155. CheckRegister(op.rule[i])
  1156. END;
  1157. END;
  1158. END CheckRegister;
  1159. BEGIN
  1160. CheckRegister(instruction.op1);
  1161. CheckRegister(instruction.op2);
  1162. CheckRegister(instruction.op3);
  1163. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1164. ELSE section.Emit(instruction);
  1165. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1166. END;
  1167. END Emit;
  1168. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1169. BEGIN
  1170. IF backend.cooperative THEN
  1171. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1172. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1173. ELSE
  1174. Emit(Trap(position,trapNo));
  1175. END;
  1176. END EmitTrap;
  1177. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1178. VAR name: Basic.SegmentedName;
  1179. VAR op1, op2, reg: IntermediateCode.Operand;
  1180. VAR call, nocall: Label;
  1181. VAR parametersSize: LONGINT;
  1182. VAR prevSection: IntermediateCode.Section;
  1183. VAR prevDump: Streams.Writer;
  1184. VAR body: SyntaxTree.Body;
  1185. BEGIN
  1186. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1187. prevSection := SELF.section;
  1188. SELF.section := section;
  1189. prevDump := dump;
  1190. dump := section.comments;
  1191. IF backend.hasLinkRegister THEN
  1192. Emit(Push(-1, lr));
  1193. END;
  1194. Emit(Push(-1,fp));
  1195. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1196. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1197. GetCodeSectionNameForSymbol(procedure, name);
  1198. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1199. ELSE
  1200. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1201. END;
  1202. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1203. Emit(Push(-1,op1));
  1204. Emit(Mov(-1,fp, sp));
  1205. body := procedure.procedureScope.body;
  1206. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1207. NEW(call, section);
  1208. NEW(nocall, section);
  1209. reg := NewRegisterOperand(addressType);
  1210. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1211. Emit(Sub(-1,reg, sp, op1));
  1212. BrltL(call, sp, reg);
  1213. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1214. BrgeL(nocall, sp, op2);
  1215. call.Resolve(section.pc);
  1216. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1217. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1218. Emit(Push(-1, op2));
  1219. Emit(Push(-1, reg));
  1220. ReleaseIntermediateOperand(reg);
  1221. CallThis(position, "Activities","ExpandStack",2);
  1222. Emit(Result(-1, sp));
  1223. nocall.Resolve(section.pc);
  1224. END;
  1225. ELSE
  1226. Emit(Mov(-1, fp, sp));
  1227. END;
  1228. Emit(Enter(-1, callconv, varSize));
  1229. SELF.section := prevSection;
  1230. dump := prevDump;
  1231. END EmitEnter;
  1232. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1233. VAR op1,op2: IntermediateCode.Operand;
  1234. VAR instruction: IntermediateCode.Instruction;
  1235. BEGIN
  1236. IntermediateCode.InitNumber(op1,callconv);
  1237. IntermediateCode.InitNumber(op2,varSize);
  1238. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1239. RETURN instruction
  1240. END Enter;
  1241. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1242. VAR op1: IntermediateCode.Operand;
  1243. VAR instruction: IntermediateCode.Instruction;
  1244. BEGIN
  1245. IntermediateCode.InitNumber(op1,callconv);
  1246. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1247. RETURN instruction
  1248. END Leave;
  1249. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1250. VAR prevSection: IntermediateCode.Section;
  1251. VAR op2: IntermediateCode.Operand;
  1252. BEGIN
  1253. prevSection := SELF.section;
  1254. SELF.section := section;
  1255. Emit(Leave(position, callconv));
  1256. IF backend.cooperative THEN
  1257. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1258. Emit(Add(position, sp, fp, op2));
  1259. ELSE
  1260. Emit(Mov(position, sp, fp));
  1261. END;
  1262. Emit(Pop(position, fp));
  1263. SELF.section := prevSection;
  1264. END EmitLeave;
  1265. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1266. VAR m: SymbolMap;
  1267. BEGIN
  1268. position := x.position;
  1269. IF currentIsInline THEN
  1270. m := currentMapper.Get(x);
  1271. IF m # NIL THEN
  1272. (*
  1273. Printout.Info("mapping from", x);
  1274. Printout.Info("mapping to ", m.to);
  1275. *)
  1276. m.to.Accept(SELF);
  1277. op := result;
  1278. IF m.tag # NIL THEN
  1279. ReleaseIntermediateOperand(result.tag);
  1280. m.tag.Accept(SELF);
  1281. op.tag := result.op;
  1282. ReleaseIntermediateOperand(result.tag);
  1283. END;
  1284. RETURN
  1285. END;
  1286. END;
  1287. x.Accept(SELF);
  1288. op := result;
  1289. END Symbol;
  1290. PROCEDURE Expression(x: SyntaxTree.Expression);
  1291. BEGIN
  1292. position := x.position;
  1293. constantDeclaration := NIL;
  1294. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1295. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1296. END;
  1297. IF x.resolved # NIL THEN
  1298. x.resolved.Accept(SELF)
  1299. ELSE
  1300. x.Accept(SELF)
  1301. END;
  1302. (* check this, was commented out in ActiveCells3 *)
  1303. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1304. Error(x.position, "unsupported modifier");
  1305. END;
  1306. END Expression;
  1307. (*
  1308. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1309. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1310. BEGIN
  1311. temporaries.GetUsage(current);
  1312. FOR i := 0 TO LEN(current)-1 DO
  1313. set := current[i] - previous[i];
  1314. IF set # {} THEN
  1315. FOR j := 0 TO MAX(SET)-1 DO
  1316. IF j IN set THEN
  1317. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1318. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1319. Symbol(variable, op);
  1320. MakeMemory(tmp,op.op,addressType,0);
  1321. ReleaseOperand(op);
  1322. Emit(Mov(position,tmp, nil ) );
  1323. ReleaseIntermediateOperand(tmp);
  1324. END;
  1325. END;
  1326. END;
  1327. END;
  1328. END;
  1329. END ResetUsedTemporaries;
  1330. *)
  1331. PROCEDURE Statement(x: SyntaxTree.Statement);
  1332. VAR use: VariableUse;
  1333. BEGIN
  1334. temporaries.GetUsage(use);
  1335. position := x.position;
  1336. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1337. IF commentPrintout # NIL THEN
  1338. commentPrintout.Statement(x);
  1339. dump.Ln;
  1340. (*dump.Update;*)
  1341. END;
  1342. x.Accept(SELF);
  1343. (*
  1344. CheckRegistersFree();
  1345. *)
  1346. (*ResetUsedTemporaries(use);*)
  1347. temporaries.SetUsage(use);
  1348. END Statement;
  1349. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1350. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1351. *)
  1352. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1353. BEGIN
  1354. IF op.mode = IntermediateCode.ModeMemory THEN
  1355. ReuseCopy(res,op);
  1356. ELSE
  1357. res := op;
  1358. UseIntermediateOperand(res);
  1359. END;
  1360. IntermediateCode.AddOffset(res,offset);
  1361. IntermediateCode.MakeMemory(res,type);
  1362. END MakeMemory;
  1363. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1364. VAR mem: IntermediateCode.Operand;
  1365. BEGIN
  1366. MakeMemory(mem,res,type,offset);
  1367. ReleaseIntermediateOperand(res);
  1368. res := mem;
  1369. END ToMemory;
  1370. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1371. VAR mem: IntermediateCode.Operand;
  1372. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1373. componentType: SyntaxTree.Type;
  1374. BEGIN
  1375. type := type.resolved;
  1376. IF operand.mode = ModeReference THEN
  1377. IF type IS SyntaxTree.RangeType THEN
  1378. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1379. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1380. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1381. ReleaseOperand(operand);
  1382. operand.op := firstOp;
  1383. operand.tag := lastOp;
  1384. operand.extra := stepOp;
  1385. ELSIF type IS SyntaxTree.ComplexType THEN
  1386. componentType := type(SyntaxTree.ComplexType).componentType;
  1387. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1388. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1389. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1390. ReleaseOperand(operand);
  1391. operand.op := firstOp;
  1392. operand.tag := lastOp
  1393. ELSE
  1394. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1395. ReleaseIntermediateOperand(operand.op);
  1396. operand.op := mem;
  1397. END;
  1398. operand.mode := ModeValue;
  1399. END;
  1400. ASSERT(operand.mode = ModeValue);
  1401. END LoadValue;
  1402. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1403. VAR prevConditional: BOOLEAN;
  1404. BEGIN
  1405. prevConditional := conditional;
  1406. conditional := FALSE;
  1407. InitOperand(result, ModeUndefined);
  1408. Expression(x);
  1409. op := result;
  1410. LoadValue(op,x.type.resolved);
  1411. conditional := prevConditional;
  1412. END Evaluate;
  1413. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1414. VAR prevConditional: BOOLEAN;
  1415. BEGIN
  1416. prevConditional := conditional;
  1417. conditional := FALSE;
  1418. InitOperand(result,ModeUndefined);
  1419. Expression(x);
  1420. op := result;
  1421. (*
  1422. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1423. *)
  1424. conditional := prevConditional;
  1425. END Designate;
  1426. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1427. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1428. BEGIN
  1429. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1430. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1431. conditional := TRUE;
  1432. trueLabel := trueL; falseLabel := falseL;
  1433. Expression(x);
  1434. trueL := trueLabel; falseL := falseLabel;
  1435. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1436. END Condition;
  1437. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1438. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1439. BEGIN
  1440. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1441. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1442. RETURN op
  1443. END NewRegisterOperand;
  1444. PROCEDURE UnuseRegister(register: LONGINT);
  1445. BEGIN
  1446. IF (register > 0) THEN
  1447. register := registerUsageCount.Map(register);
  1448. registerUsageCount.DecUse(register);
  1449. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1450. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1451. END;
  1452. IF registerUsageCount.Use(register)=0 THEN
  1453. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1454. Warning(position, "register cannot be removed");
  1455. END;
  1456. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1457. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1458. END;
  1459. ELSIF registerUsageCount.Use(register)<0 THEN
  1460. Warning(position, "register removed too often");
  1461. IF dump # NIL THEN
  1462. dump.String("register removed too often"); dump.Ln; dump.Update;
  1463. END;
  1464. D.TraceBack;
  1465. END;
  1466. END;
  1467. END UnuseRegister;
  1468. PROCEDURE UseRegister(register: LONGINT);
  1469. BEGIN
  1470. IF (register > 0) THEN
  1471. register := registerUsageCount.Map(register);
  1472. registerUsageCount.IncUse(register);
  1473. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1474. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1475. END;
  1476. IF registerUsageCount.Use(register)=1 THEN
  1477. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1478. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1479. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1480. END;
  1481. END;
  1482. END;
  1483. END UseRegister;
  1484. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1485. BEGIN
  1486. UnuseRegister(op.register)
  1487. END ReleaseIntermediateOperand;
  1488. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1489. BEGIN
  1490. UseRegister(op.register)
  1491. END UseIntermediateOperand;
  1492. PROCEDURE ReleaseOperand(CONST op: Operand);
  1493. BEGIN
  1494. UnuseRegister(op.op.register);
  1495. UnuseRegister(op.tag.register);
  1496. UnuseRegister(op.extra.register);
  1497. END ReleaseOperand;
  1498. (* save registers marked in array "markedRegisters" to the stack
  1499. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1500. *)
  1501. PROCEDURE SaveRegisters();
  1502. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1503. BEGIN
  1504. entry := usedRegisters;
  1505. WHILE entry # NIL DO
  1506. type := registerUsageCount.used[entry.register].type;
  1507. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1508. Emit(Push(position,op));
  1509. entry := entry.next;
  1510. END;
  1511. END SaveRegisters;
  1512. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1513. BEGIN
  1514. saved := usedRegisters;
  1515. usedRegisters := NIL;
  1516. END ReleaseUsedRegisters;
  1517. (** remove parameter registers from used queue *)
  1518. PROCEDURE ReleaseParameterRegisters;
  1519. VAR entry,prev,next: RegisterEntry;
  1520. BEGIN
  1521. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1522. WHILE entry # NIL DO
  1523. next := entry.next;
  1524. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1525. registerUsageCount.DecUse(entry.register);
  1526. ASSERT(registerUsageCount.Use(entry.register)=0);
  1527. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1528. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1529. END;
  1530. ELSIF prev = NIL THEN
  1531. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1532. ELSE
  1533. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1534. END;
  1535. entry := next;
  1536. END;
  1537. END ReleaseParameterRegisters;
  1538. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1539. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1540. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1541. BEGIN
  1542. entry := saved;
  1543. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1544. entry := prev;
  1545. WHILE entry # NIL DO
  1546. prev := entry.prev;
  1547. type := entry.type;
  1548. class := entry.registerClass;
  1549. IntermediateCode.InitRegister(op,type,class,entry.register);
  1550. (*
  1551. new := registerUsageCount.Next(type,class);
  1552. registerUsageCount.Remap(entry.register,new);
  1553. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1554. dump.String("remap register "); dump.Int(entry.register,1);
  1555. dump.String("to "); dump.Int(new,1);
  1556. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1557. END;
  1558. entry.register := new;
  1559. *)
  1560. Emit(Pop(position,op));
  1561. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1562. entry := prev;
  1563. END;
  1564. (*
  1565. usedRegisters := saved;
  1566. *)
  1567. END RestoreRegisters;
  1568. PROCEDURE CheckRegistersFree;
  1569. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1570. BEGIN
  1571. IF usedRegisters # NIL THEN
  1572. r := usedRegisters;
  1573. WHILE r # NIL DO
  1574. warning := "register ";
  1575. Strings.AppendInt(warning, r.register);
  1576. Strings.Append(warning, " not released.");
  1577. Warning(position,warning);
  1578. r := r .next;
  1579. END;
  1580. END;
  1581. FOR i := 0 TO registerUsageCount.count-1 DO
  1582. IF registerUsageCount.used[i].count < 0 THEN
  1583. warning := "register ";
  1584. Strings.AppendInt(warning, i);
  1585. Strings.Append(warning, " unused too often.");
  1586. Warning(position,warning);
  1587. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1588. warning := "register ";
  1589. Strings.AppendInt(warning, i);
  1590. Strings.Append(warning, " not unused often enough.");
  1591. Warning(position,warning);
  1592. END;
  1593. END;
  1594. END CheckRegistersFree;
  1595. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1596. Otherwise allocate a new register.
  1597. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1598. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1599. BEGIN
  1600. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1601. UseIntermediateOperand(result);
  1602. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1603. UseIntermediateOperand(result);
  1604. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1605. END;
  1606. END Reuse2;
  1607. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1608. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1609. If not then allocate a new register.
  1610. Does NOT necessarily keep the content of src1 or src2 in result!
  1611. *)
  1612. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1613. BEGIN
  1614. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1615. UseIntermediateOperand(result);
  1616. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1617. UseIntermediateOperand(result);
  1618. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1619. result := alternative; alternative := emptyOperand;
  1620. UseIntermediateOperand(result);
  1621. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1622. END;
  1623. END Reuse2a;
  1624. (* like reuse2 but only one source *)
  1625. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1626. BEGIN
  1627. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1628. UseIntermediateOperand(result);
  1629. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1630. END;
  1631. END Reuse1;
  1632. (* like reuse2a but only one source *)
  1633. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1634. BEGIN
  1635. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1636. UseIntermediateOperand(result);
  1637. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1638. UseIntermediateOperand(result);
  1639. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1640. END;
  1641. END Reuse1a;
  1642. (* like reuse1 but guarantees that content of src1 is in result *)
  1643. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1644. BEGIN
  1645. IF ReusableRegister(src1) THEN
  1646. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1647. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1648. UseIntermediateOperand(result);
  1649. ELSE
  1650. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1651. Emit(Mov(position,result,src1));
  1652. END
  1653. END ReuseCopy;
  1654. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1655. BEGIN
  1656. IF ReusableRegister(src) THEN
  1657. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1658. ELSE
  1659. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1660. Emit(Mov(position,result,src));
  1661. ReleaseIntermediateOperand(src);
  1662. END
  1663. END TransferToRegister;
  1664. (** labels and branches **)
  1665. PROCEDURE NewLabel(): Label;
  1666. VAR label: Label;
  1667. BEGIN
  1668. NEW(label,section); RETURN label;
  1669. END NewLabel;
  1670. PROCEDURE SetLabel(label: Label);
  1671. BEGIN label.Resolve(section.pc);
  1672. END SetLabel;
  1673. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1674. BEGIN
  1675. ASSERT(label # NIL);
  1676. IF label.pc < 0 THEN (* label not yet set *)
  1677. label.AddFixup(section.pc);
  1678. END;
  1679. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1680. END LabelOperand;
  1681. PROCEDURE BrL(label: Label);
  1682. BEGIN
  1683. Emit(Br(position,LabelOperand(label)));
  1684. END BrL;
  1685. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1686. BEGIN
  1687. Emit(Brge(position,LabelOperand(label),left,right));
  1688. END BrgeL;
  1689. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1690. BEGIN
  1691. Emit(Brlt(position,LabelOperand(label),left,right));
  1692. END BrltL;
  1693. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1694. BEGIN
  1695. Emit(Breq(position,LabelOperand(label),left,right));
  1696. END BreqL;
  1697. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1698. BEGIN
  1699. Emit(Brne(position,LabelOperand(label),left,right));
  1700. END BrneL;
  1701. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1702. VAR new: IntermediateCode.Operand;
  1703. BEGIN
  1704. IF Trace THEN TraceEnter("Convert") END;
  1705. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1706. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1707. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1708. & (operand.offset = 0)
  1709. THEN
  1710. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1711. Emit(Conv(position,new,operand));
  1712. ELSE
  1713. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1714. Emit(Conv(position,new,operand));
  1715. ReleaseIntermediateOperand(operand);
  1716. END;
  1717. operand := new;
  1718. ELSIF (operand.mode = IntermediateCode.ModeImmediate) & (operand.symbol.name = "") & (operand.type.sizeInBits <= type.sizeInBits) & (operand.type.form IN IntermediateCode.Integer) & (type.form IN IntermediateCode.Integer) THEN
  1719. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1720. ELSE
  1721. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1722. Emit(Conv(position,new,operand));
  1723. ReleaseIntermediateOperand(operand);
  1724. operand := new;
  1725. END;
  1726. IF Trace THEN TraceExit("Convert") END;
  1727. END Convert;
  1728. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1729. VAR exit: Label;
  1730. BEGIN
  1731. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1732. exit := NewLabel();
  1733. br(exit,left,right);
  1734. EmitTrap(position,trapNo);
  1735. SetLabel(exit);
  1736. END TrapC;
  1737. (** expressions *)
  1738. (** emit necessary runtime check for set elements **)
  1739. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1740. VAR max: IntermediateCode.Operand;
  1741. BEGIN
  1742. IF isUnchecked THEN RETURN END;
  1743. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1744. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1745. TrapC(BrgeL, max, o, SetElementTrap);
  1746. END;
  1747. END CheckSetElement;
  1748. (** the set that a range represents **)
  1749. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1750. VAR
  1751. operand: Operand;
  1752. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1753. BEGIN
  1754. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1755. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1756. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1757. one := IntermediateCode.Immediate(setType, 1);
  1758. Evaluate(x, operand);
  1759. Convert(operand.op, setType);
  1760. Convert(operand.tag, setType);
  1761. CheckSetElement(operand.op);
  1762. CheckSetElement(operand.tag);
  1763. (* create mask for lower bound
  1764. i.e. shift 11111111 to the left by the value of the lower bound
  1765. *)
  1766. Reuse1(temp, operand.op);
  1767. Emit(Shl(position,temp, allBits, operand.op));
  1768. ReleaseIntermediateOperand(operand.op);
  1769. operand.op := temp;
  1770. (* create mask for upper bound
  1771. i.e. shift 11111111 to the right by the difference between the
  1772. upper bound and the maximum number of set elements
  1773. *)
  1774. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1775. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1776. Reuse1(temp, operand.tag);
  1777. ELSE
  1778. Reuse1(temp, operand.tag);
  1779. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1780. Emit(Sub(position,temp, size, operand.tag));
  1781. END;
  1782. Emit(Shr(position,temp, allBits, operand.tag));
  1783. ReleaseIntermediateOperand(operand.tag);
  1784. operand.tag := temp;
  1785. Reuse2(resultingSet, operand.op, operand.tag);
  1786. (* intersect the two masks *)
  1787. Emit(And(position,resultingSet, operand.op, operand.tag));
  1788. ReleaseOperand(operand);
  1789. RETURN resultingSet
  1790. END SetFromRange;
  1791. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1792. VAR
  1793. res, operand: Operand;
  1794. temp, one, noBits, dest: IntermediateCode.Operand;
  1795. expression: SyntaxTree.Expression;
  1796. i: LONGINT;
  1797. BEGIN
  1798. IF Trace THEN TraceEnter("VisitSet") END;
  1799. dest := destination;
  1800. destination := emptyOperand;
  1801. noBits := IntermediateCode.Immediate(setType, 0);
  1802. one := IntermediateCode.Immediate(setType, 1);
  1803. (* start off with the empty set *)
  1804. InitOperand(res, ModeValue);
  1805. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1806. Emit(Mov(position,res.op, noBits));
  1807. FOR i := 0 TO x.elements.Length() - 1 DO
  1808. expression := x.elements.GetExpression(i);
  1809. IF expression IS SyntaxTree.RangeExpression THEN
  1810. (* range of set elements *)
  1811. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1812. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1813. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1814. ReleaseIntermediateOperand(temp)
  1815. ELSE
  1816. (* singelton element *)
  1817. Evaluate(expression, operand);
  1818. Convert(operand.op, setType);
  1819. CheckSetElement(operand.op);
  1820. (* create subset containing single element *)
  1821. Reuse1(temp, operand.op);
  1822. Emit(Shl(position,temp, one, operand.op));
  1823. ReleaseOperand(operand);
  1824. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1825. ReleaseIntermediateOperand(temp);
  1826. END
  1827. END;
  1828. result := res;
  1829. destination := dest;
  1830. IF Trace THEN TraceExit("VisitSet") END;
  1831. END VisitSet;
  1832. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1833. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1834. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1835. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1836. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1837. element: SyntaxTree.IntegerValue;
  1838. BEGIN
  1839. numberElements := x.elements.Length();
  1840. expression := index.parameters.GetExpression(dim);
  1841. element := expression(SyntaxTree.IntegerValue);
  1842. FOR i := 0 TO numberElements-1 DO
  1843. expression := x.elements.GetExpression(i);
  1844. element.SetValue(i);
  1845. IF expression IS SyntaxTree.MathArrayExpression THEN
  1846. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1847. ELSE
  1848. Assign(index,expression);
  1849. END;
  1850. END;
  1851. END RecursiveAssignment;
  1852. BEGIN
  1853. variable := GetTemporaryVariable(x.type, FALSE);
  1854. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1855. designator.SetType(variable.type);
  1856. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1857. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1858. FOR i := 0 TO dim-1 DO
  1859. element := SyntaxTree.NewIntegerValue(x.position,0);
  1860. element.SetType(system.longintType);
  1861. index.parameters.AddExpression(element);
  1862. END;
  1863. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1864. RecursiveAssignment(x,0);
  1865. Expression(designator);
  1866. END VisitMathArrayExpression;
  1867. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1868. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1869. BEGIN
  1870. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1871. dest := destination; destination := emptyOperand;
  1872. IF x.operator = Scanner.Not THEN
  1873. IF conditional THEN
  1874. Condition(x.left,falseLabel,trueLabel)
  1875. ELSE
  1876. Evaluate(x.left,operand);
  1877. InitOperand(result,ModeValue);
  1878. Reuse1a(result.op,operand.op,dest);
  1879. Emit(Xor(position,result.op,operand.op,true));
  1880. ReleaseOperand(operand);
  1881. END;
  1882. ELSIF x.operator = Scanner.Minus THEN
  1883. Evaluate(x.left,operand);
  1884. InitOperand(result,ModeValue);
  1885. Reuse1a(result.op,operand.op,dest);
  1886. type := x.left.type.resolved;
  1887. IF type IS SyntaxTree.SetType THEN
  1888. Emit(Not(position,result.op,operand.op));
  1889. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1890. Reuse1(result.tag,operand.tag);
  1891. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1892. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1893. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  1894. Emit(Neg(position,result.op,operand.op));
  1895. ELSE HALT(200)
  1896. END;
  1897. ReleaseOperand(operand);
  1898. ELSIF x.operator = Scanner.Address THEN
  1899. Designate(x.left,operand);
  1900. operand.mode := ModeValue;
  1901. t0 := x.left.type.resolved;
  1902. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  1903. ReleaseIntermediateOperand(operand.op);
  1904. operand.op := operand.tag;
  1905. IntermediateCode.InitOperand(operand.tag);
  1906. END;
  1907. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  1908. result := operand;
  1909. ELSE HALT(100)
  1910. END;
  1911. destination := dest;
  1912. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  1913. END VisitUnaryExpression;
  1914. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  1915. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  1916. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  1917. BEGIN
  1918. type := type.resolved;
  1919. originalType := type;
  1920. IF type IS SyntaxTree.PointerType THEN
  1921. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  1922. END;
  1923. IF type IS SyntaxTree.ObjectType THEN
  1924. BrL(trueL);
  1925. ELSE
  1926. ASSERT(type IS SyntaxTree.RecordType);
  1927. (*
  1928. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  1929. *)
  1930. ReuseCopy(left,tag);
  1931. right := TypeDescriptorAdr(type);
  1932. IF ~newObjectFile THEN
  1933. IntermediateCode.MakeMemory(right,addressType);
  1934. END;
  1935. IF backend.cooperative THEN
  1936. repeatL := NewLabel();
  1937. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  1938. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  1939. END;
  1940. SetLabel(repeatL);
  1941. BreqL(trueL,left,right);
  1942. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  1943. BrneL(repeatL,left,nil);
  1944. ELSIF meta.simple THEN
  1945. level := type(SyntaxTree.RecordType).Level();
  1946. (* get type desc tag of level relative to base tag *)
  1947. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  1948. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1949. IntermediateCode.MakeMemory(left,addressType);
  1950. BreqL(trueL,left,right);
  1951. ELSE
  1952. level := type(SyntaxTree.RecordType).Level();
  1953. (* get type desc tag of level relative to base tag *)
  1954. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  1955. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1956. IntermediateCode.MakeMemory(left,addressType);
  1957. BreqL(trueL,left,right);
  1958. END;
  1959. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  1960. BrL(falseL);
  1961. END;
  1962. END TypeTest;
  1963. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  1964. BEGIN
  1965. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  1966. IF dump # NIL THEN
  1967. dump.String(s); dump.Ln;
  1968. END;
  1969. END Error;
  1970. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  1971. BEGIN
  1972. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  1973. IF dump # NIL THEN
  1974. dump.String(s); dump.Ln; dump.Update;
  1975. END;
  1976. END Warning;
  1977. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  1978. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  1979. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  1980. operand:Operand;
  1981. BEGIN
  1982. previousSection := section;
  1983. Global.GetModuleName(mod,name);
  1984. Strings.Append(name,".@Trace");
  1985. Basic.ToSegmentedName(name, pooledName);
  1986. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  1987. IF dump # NIL THEN dump := section.comments END;
  1988. variable := mod.moduleScope.firstVariable;
  1989. WHILE variable # NIL DO
  1990. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  1991. Symbol(variable, operand);
  1992. register := operand.op;
  1993. CallTraceMethod(register, variable.type);
  1994. ReleaseIntermediateOperand(register);
  1995. END;
  1996. variable := variable.nextVariable;
  1997. END;
  1998. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  1999. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2000. Emit(Br(position,op));
  2001. INC(statCoopTraceModule, section.pc);
  2002. section := previousSection;
  2003. IF dump # NIL THEN dump := section.comments END;
  2004. END CreateTraceModuleMethod;
  2005. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2006. BEGIN
  2007. Emit (Push(position, dst));
  2008. Emit (Push(position, src));
  2009. CallThis(position,"GarbageCollector","Assign", 2);
  2010. END CallAssignPointer;
  2011. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2012. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2013. BEGIN
  2014. IF SemanticChecker.IsPointerType (type) THEN
  2015. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2016. ELSIF type.IsRecordType() THEN
  2017. Emit (Push(position,dst));
  2018. Emit (Push(position,src));
  2019. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2020. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2021. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2022. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2023. ELSIF IsStaticArray(type) THEN
  2024. size := StaticArrayNumElements(type);
  2025. base := StaticArrayBaseType(type);
  2026. IF base.IsRecordType() THEN
  2027. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2028. Emit (Push(position, dst));
  2029. Emit (Push(position, src));
  2030. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2031. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2032. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2033. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2034. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2035. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2036. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2037. Emit (Push(position, dst));
  2038. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2039. Emit (Push(position, src));
  2040. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2041. ELSE
  2042. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2043. Emit (Push(position, dst));
  2044. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2045. Emit (Push(position, src));
  2046. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2047. ASSERT(StaticArrayBaseType(type).IsPointer());
  2048. END;
  2049. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2050. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2051. Emit (Push(position, dst));
  2052. Emit (Push(position, src));
  2053. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2054. ELSE HALT(100); (* missing ? *)
  2055. END;
  2056. END CallAssignMethod;
  2057. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2058. VAR name: Basic.SegmentedName;
  2059. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2060. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2061. context: Context;
  2062. BEGIN
  2063. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2064. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2065. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2066. GetRecordTypeName (recordType,name);
  2067. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2068. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2069. IF dump # NIL THEN dump := section.comments END;
  2070. variable := recordType.recordScope.firstVariable;
  2071. WHILE variable # NIL DO
  2072. IF variable.NeedsTrace() THEN
  2073. dst := NewRegisterOperand (addressType);
  2074. src := NewRegisterOperand (addressType);
  2075. Emit (Mov(position, dst, parameter1));
  2076. Emit (Mov(position, src, parameter2));
  2077. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2078. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2079. CallAssignMethod(dst, src, variable.type);
  2080. ReleaseIntermediateOperand(src);
  2081. ReleaseIntermediateOperand(dst);
  2082. END;
  2083. variable := variable.nextVariable;
  2084. END;
  2085. recordBase := recordType.GetBaseRecord();
  2086. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2087. GetRecordTypeName (recordBase,name);
  2088. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2089. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2090. Emit(Br(position,op));
  2091. ELSE
  2092. Emit(Exit(position,0,0));
  2093. END;
  2094. IF ~recordType.isObject THEN
  2095. GetRecordTypeName (recordType,name);
  2096. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2097. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2098. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2099. NEW(registerUsageCount);
  2100. usedRegisters := NIL;
  2101. dst := NewRegisterOperand (addressType);
  2102. src := NewRegisterOperand (addressType);
  2103. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2104. Emit(Mov(position, dst, parameter1));
  2105. Emit(Mov(position, src, parameter2));
  2106. label := NewLabel();
  2107. SetLabel(label);
  2108. Emit(Push(position, dst));
  2109. Emit(Push(position, src));
  2110. GetRecordTypeName (recordType,name);
  2111. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2112. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2113. Emit(Call(position, op, 0));
  2114. Emit(Pop(position, src));
  2115. Emit(Pop(position, dst));
  2116. Emit(Add(position, dst, dst, ofs));
  2117. Emit(Add(position, src, src, ofs));
  2118. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2119. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2120. Emit(Exit(position,0,0));
  2121. END;
  2122. INC(statCoopAssignProcedure, section.pc);
  2123. ReturnToContext(context);
  2124. IF dump # NIL THEN dump := section.comments END;
  2125. END CreateAssignProcedure;
  2126. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2127. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2128. BEGIN
  2129. IF IsUnsafePointer (type) THEN
  2130. skip := NewLabel();
  2131. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2132. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2133. BreqL (skip, op, nil);
  2134. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2135. SetLabel (skip);
  2136. ELSIF SemanticChecker.IsPointerType (type) THEN
  2137. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2138. CallThis(position,"GarbageCollector","Mark", 1);
  2139. ELSIF type.IsRecordType() THEN
  2140. Emit (Push(position,register));
  2141. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2142. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2143. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2144. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2145. ELSIF IsStaticArray(type) THEN
  2146. size := StaticArrayNumElements(type);
  2147. base := StaticArrayBaseType(type);
  2148. IF base.IsRecordType() THEN
  2149. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2150. Emit (Push(position, register));
  2151. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2152. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2153. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2154. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2155. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2156. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2157. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2158. Emit (Push(position, register));
  2159. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2160. ELSE
  2161. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2162. Emit (Push(position, register));
  2163. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2164. ASSERT(base.IsPointer());
  2165. END;
  2166. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2167. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2168. CallThis(position,"GarbageCollector","Mark", 1);
  2169. ELSE HALT(100); (* missing ? *)
  2170. END;
  2171. END CallTraceMethod;
  2172. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2173. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2174. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2175. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2176. BEGIN
  2177. previousSection := section;
  2178. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2179. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2180. GetRecordTypeName (recordType,name);
  2181. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2182. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2183. IF dump # NIL THEN dump := section.comments END;
  2184. variable := recordType.recordScope.firstVariable;
  2185. WHILE variable # NIL DO
  2186. IF variable.NeedsTrace() THEN
  2187. register := NewRegisterOperand (addressType);
  2188. Emit (Mov(position,register,parameter1));
  2189. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2190. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2191. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2192. END;
  2193. CallTraceMethod(register, variable.type);
  2194. ReleaseIntermediateOperand(register);
  2195. END;
  2196. variable := variable.nextVariable;
  2197. END;
  2198. recordBase := recordType.GetBaseRecord();
  2199. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2200. recordBase := recordBase.GetBaseRecord();
  2201. END;
  2202. IF recordBase # NIL THEN
  2203. GetRecordTypeName (recordBase,name);
  2204. IF HasExplicitTraceMethod (recordBase) THEN
  2205. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2206. ELSE
  2207. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2208. END;
  2209. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2210. Emit(Br(position,op));
  2211. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2212. Emit(Exit(position,0,0));
  2213. ELSE
  2214. IF recordType.isObject THEN
  2215. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2216. ELSE
  2217. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2218. END;
  2219. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2220. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2221. Emit(Br(position,op));
  2222. END;
  2223. IF ~recordType.isObject THEN
  2224. GetRecordTypeName (recordType,name);
  2225. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2226. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2227. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2228. NEW(registerUsageCount);
  2229. usedRegisters := NIL;
  2230. IF dump # NIL THEN dump := section.comments END;
  2231. register := NewRegisterOperand (addressType);
  2232. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2233. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2234. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2235. END;
  2236. Emit (Push(position,register));
  2237. GetRecordTypeName (recordType,name);
  2238. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2239. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2240. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2241. ReleaseIntermediateOperand(register);
  2242. Emit(Exit(position,0,0));
  2243. GetRecordTypeName (recordType,name);
  2244. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2245. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2246. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2247. NEW(registerUsageCount);
  2248. usedRegisters := NIL;
  2249. register := NewRegisterOperand (addressType);
  2250. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2251. Emit(Mov(position, register, parameter1));
  2252. label := NewLabel();
  2253. SetLabel(label);
  2254. Emit(Push(position, register));
  2255. GetRecordTypeName (recordType,name);
  2256. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2257. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2258. Emit(Call(position, op, 0));
  2259. Emit(Pop(position, register));
  2260. Emit(Add(position, register, register, ofs));
  2261. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2262. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2263. Emit(Exit(position,0,0));
  2264. END;
  2265. INC(statCoopTraceMethod, section.pc);
  2266. ReturnToContext(context);
  2267. IF dump # NIL THEN dump := section.comments END;
  2268. END CreateTraceMethod;
  2269. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2270. VAR name: Basic.SegmentedName;
  2271. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2272. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2273. context: Context;
  2274. BEGIN
  2275. IF recordType.isObject THEN RETURN END;
  2276. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2277. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2278. GetRecordTypeName (recordType,name);
  2279. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2280. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2281. IF dump # NIL THEN dump := section.comments END;
  2282. variable := recordType.recordScope.firstVariable;
  2283. WHILE variable # NIL DO
  2284. IF variable.NeedsTrace() THEN
  2285. dst := NewRegisterOperand (addressType);
  2286. Emit (Mov(position, dst, parameter1));
  2287. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2288. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2289. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2290. END;
  2291. CallResetProcedure(dst, nil, variable.type);
  2292. ReleaseIntermediateOperand(dst);
  2293. END;
  2294. variable := variable.nextVariable;
  2295. END;
  2296. recordBase := recordType.GetBaseRecord();
  2297. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2298. GetRecordTypeName (recordBase,name);
  2299. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2300. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2301. Emit(Br(position,op));
  2302. ELSE
  2303. Emit(Exit(position,0,0));
  2304. END;
  2305. GetRecordTypeName (recordType,name);
  2306. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2307. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2308. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2309. NEW(registerUsageCount);
  2310. usedRegisters := NIL;
  2311. dst := NewRegisterOperand (addressType);
  2312. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2313. Emit(Mov(position, dst, parameter1));
  2314. label := NewLabel();
  2315. SetLabel(label);
  2316. Emit(Push(position, dst));
  2317. GetRecordTypeName (recordType,name);
  2318. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2319. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2320. Emit(Call(position, op, 0));
  2321. Emit(Pop(position, dst));
  2322. Emit(Add(position, dst, dst, ofs));
  2323. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2324. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2325. Emit(Exit(position,0,0));
  2326. INC(statCoopResetProcedure, section.pc);
  2327. ReturnToContext(context);
  2328. IF dump # NIL THEN dump := section.comments END;
  2329. END CreateResetProcedure;
  2330. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2331. VAR name: Basic.SegmentedName; context: Context;
  2332. BEGIN
  2333. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2334. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2335. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2336. IF dump # NIL THEN dump := section.comments END;
  2337. IF backend.hasLinkRegister THEN
  2338. Emit(Push(-1, lr));
  2339. END;
  2340. Emit(Push(position,fp));
  2341. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2342. ResetVariables(scope);
  2343. Emit(Pop(position,fp));
  2344. Emit(Exit(position,0,0));
  2345. ReturnToContext(context);
  2346. IF dump # NIL THEN dump := section.comments END;
  2347. END CreateResetMethod;
  2348. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2349. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2350. BEGIN
  2351. IF SemanticChecker.IsPointerType (type) THEN
  2352. Emit (Push(position, dest));
  2353. CallThis(position,"GarbageCollector","Reset", 1);
  2354. ELSIF type.IsRecordType() THEN
  2355. Emit (Push(position, dest));
  2356. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2357. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2358. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2359. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2360. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2361. size := GetArrayLength(type, tag);
  2362. base := ArrayBaseType(type);
  2363. IF base.IsRecordType() THEN
  2364. Emit (Push(position, size));
  2365. Emit (Push(position, dest));
  2366. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2367. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2369. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2370. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2371. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2372. Emit (Push(position, size));
  2373. Emit (Push(position, dest));
  2374. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2375. ELSE
  2376. Emit (Push(position, size));
  2377. Emit (Push(position, dest));
  2378. CallThis(position,"GarbageCollector","ResetArray", 2);
  2379. ASSERT(ArrayBaseType(type).IsPointer());
  2380. END;
  2381. ReleaseIntermediateOperand(size);
  2382. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2383. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2384. Emit (Push(position, dest));
  2385. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2386. ELSE HALT(100); (* missing ? *)
  2387. END;
  2388. END CallResetProcedure;
  2389. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2390. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2391. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2392. VAR operand: Operand;
  2393. BEGIN
  2394. Symbol (symbol, operand);
  2395. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2396. ReleaseOperand(operand);
  2397. END Reset;
  2398. BEGIN
  2399. previousScope := currentScope;
  2400. currentScope := scope;
  2401. pc := section.pc;
  2402. variable := scope.firstVariable;
  2403. WHILE variable # NIL DO
  2404. IF variable.NeedsTrace() THEN
  2405. Reset (variable);
  2406. END;
  2407. variable := variable.nextVariable;
  2408. END;
  2409. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2410. WHILE parameter # NIL DO
  2411. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2412. Reset (parameter);
  2413. END;
  2414. parameter := parameter.nextParameter;
  2415. END;
  2416. INC(statCoopResetVariables, section.pc - pc);
  2417. currentScope := previousScope;
  2418. END ResetVariables;
  2419. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2420. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2421. VAR op: IntermediateCode.Operand; context: Context;
  2422. BEGIN
  2423. previousSection := section;
  2424. GetCodeSectionNameForSymbol(procedure, name);
  2425. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2426. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2427. IF dump # NIL THEN dump := section.comments END;
  2428. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2429. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2430. Emit(Data(position,op));
  2431. Emit(Data(position,nil));
  2432. IF HasPointers (procedure.procedureScope) THEN
  2433. GetCodeSectionNameForSymbol(procedure, name);
  2434. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2435. ELSE
  2436. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2437. END;
  2438. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2439. Emit(Data(position,op));
  2440. ReturnToContext(context);
  2441. IF dump # NIL THEN dump := section.comments END;
  2442. END CreateProcedureDescriptor;
  2443. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2444. VAR import: SyntaxTree.Import;
  2445. s: Basic.MessageString;
  2446. selfName: SyntaxTree.IdentifierString;
  2447. BEGIN
  2448. moduleScope.ownerModule.GetName(selfName);
  2449. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2450. module := moduleScope.ownerModule
  2451. ELSE
  2452. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2453. IF import = NIL THEN
  2454. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2455. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2456. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2457. s := "Module ";
  2458. Strings.Append(s,moduleName);
  2459. Strings.Append(s," cannot be imported.");
  2460. IF force THEN
  2461. Error(position,s);
  2462. ELSIF canBeLoaded THEN
  2463. Strings.Append(s, "=> no dynamic linking.");
  2464. Warning(position, s);
  2465. canBeLoaded := FALSE;
  2466. END;
  2467. RETURN FALSE
  2468. ELSE
  2469. SELF.module.imports.AddName(moduleName)
  2470. END;
  2471. ELSIF import.module = NIL THEN (* already tried *)
  2472. RETURN FALSE
  2473. END;
  2474. module := import.module;
  2475. END;
  2476. RETURN TRUE
  2477. END AddImport;
  2478. (* needed for old binary object file format*)
  2479. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2480. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2481. BEGIN
  2482. IF AddImport(moduleName,module,TRUE) THEN
  2483. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2484. IF procedure = NIL THEN
  2485. s := "Instruction not supported on target, emulation procedure ";
  2486. Strings.Append(s,moduleName);
  2487. Strings.Append(s,".");
  2488. Strings.Append(s,procedureName);
  2489. Strings.Append(s," not present");
  2490. Error(position,s);
  2491. ELSE
  2492. StaticCallOperand(r,procedure);
  2493. ReleaseOperand(r);
  2494. fp := GetFingerprint(procedure);
  2495. END;
  2496. END;
  2497. END EnsureSymbol;
  2498. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2499. VAR exit: Label; trueL,falseL: Label;
  2500. BEGIN
  2501. trueL := NewLabel();
  2502. falseL := NewLabel();
  2503. exit := NewLabel();
  2504. Condition(x,trueL,falseL);
  2505. InitOperand(result,ModeValue);
  2506. SetLabel(trueL);
  2507. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2508. Emit(Mov(position,result.op,true));
  2509. BrL(exit);
  2510. SetLabel(falseL);
  2511. Emit(MovReplace(position,result.op,false));
  2512. SetLabel(exit);
  2513. END ConditionToValue;
  2514. PROCEDURE ValueToCondition(VAR op: Operand);
  2515. BEGIN
  2516. LoadValue(op,system.booleanType);
  2517. BrneL(trueLabel,op.op, false);
  2518. ReleaseOperand(op);
  2519. BrL(falseLabel);
  2520. END ValueToCondition;
  2521. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2522. VAR size: LONGINT;
  2523. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2524. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2525. BEGIN
  2526. ASSERT(type.form = SyntaxTree.Open);
  2527. baseType := type.arrayBase.resolved;
  2528. IF IsOpenArray(baseType) THEN
  2529. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2530. ELSE
  2531. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2532. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2533. END;
  2534. len := tag;
  2535. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2536. IntermediateCode.MakeMemory(len,addressType);
  2537. UseIntermediateOperand(len);
  2538. Reuse2(res,sizeOperand,len);
  2539. Emit(Mul(position,res,sizeOperand,len));
  2540. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2541. RETURN res
  2542. END GetArraySize;
  2543. BEGIN
  2544. type := type.resolved;
  2545. IF IsOpenArray(type) THEN
  2546. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2547. RETURN tag
  2548. ELSE
  2549. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2550. END;
  2551. ELSE
  2552. size := ToMemoryUnits(system,system.SizeOf(type));
  2553. RETURN IntermediateCode.Immediate(addressType,size)
  2554. END;
  2555. END GetDynamicSize;
  2556. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2557. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2558. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2559. BEGIN
  2560. ASSERT(type.form = SyntaxTree.Open);
  2561. baseType := type.arrayBase.resolved;
  2562. IF IsOpenArray(baseType) THEN
  2563. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2564. ELSE
  2565. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2566. END;
  2567. len := tag;
  2568. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2569. IntermediateCode.MakeMemory(len,addressType);
  2570. UseIntermediateOperand(len);
  2571. Reuse2(res,sizeOperand,len);
  2572. Emit(Mul(position,res,sizeOperand,len));
  2573. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2574. RETURN res
  2575. END GetLength;
  2576. BEGIN
  2577. type := type.resolved;
  2578. IF IsOpenArray(type) THEN
  2579. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2580. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2581. ELSE
  2582. RETURN IntermediateCode.Immediate(addressType,1)
  2583. END;
  2584. END GetArrayLength;
  2585. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2586. VAR result: IntermediateCode.Operand;
  2587. BEGIN
  2588. IF backend.cooperative THEN
  2589. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2590. ELSE
  2591. MakeMemory(result, tag, addressType, 0);
  2592. END;
  2593. RETURN result
  2594. END GetSizeFromTag;
  2595. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2596. VAR parameter: SyntaxTree.Parameter;
  2597. BEGIN
  2598. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2599. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2600. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2601. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2602. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2603. END;
  2604. RETURN GetDynamicSize(e.type, tag);
  2605. END GetArrayOfBytesSize;
  2606. (*
  2607. to find imported symbol. not needed ?
  2608. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2609. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2610. BEGIN
  2611. IF AddImport(moduleName,importedModule,FALSE) THEN
  2612. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2613. RETURN symbol
  2614. ELSE
  2615. RETURN NIL
  2616. END
  2617. END SymbolByName;
  2618. *)
  2619. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2620. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2621. BEGIN
  2622. IF AddImport(moduleName,runtimeModule,force) THEN
  2623. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2624. IF procedure = NIL THEN
  2625. s := "Procedure ";
  2626. Strings.Append(s,moduleName);
  2627. Strings.Append(s,".");
  2628. Strings.Append(s,procedureName);
  2629. Strings.Append(s," not present");
  2630. Error(position,s);
  2631. RETURN FALSE
  2632. ELSE
  2633. RETURN TRUE
  2634. END;
  2635. ELSE RETURN FALSE
  2636. END;
  2637. END GetRuntimeProcedure;
  2638. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2639. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2640. s: Basic.MessageString;
  2641. BEGIN
  2642. Basic.InitSegmentedName(name);
  2643. name[0] := Basic.MakeString(moduleName);
  2644. name[1] := Basic.MakeString(typeName);
  2645. name[2] := -1;
  2646. IF AddImport(moduleName,importedModule, FALSE) THEN
  2647. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2648. IF symbol = NIL THEN
  2649. s := "type ";
  2650. Strings.Append(s,moduleName);
  2651. Strings.Append(s,".");
  2652. Strings.Append(s,typeName);
  2653. Strings.Append(s," not present");
  2654. Error(position,s);
  2655. END;
  2656. ELSE symbol := NIL;
  2657. END;
  2658. IF importedModule = moduleScope.ownerModule THEN
  2659. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2660. ELSE
  2661. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2662. END;
  2663. RETURN symbol
  2664. END GetTypeDescriptor;
  2665. (* 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. *)
  2666. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2667. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2668. pooledName: Basic.SegmentedName; size: LONGINT;
  2669. BEGIN
  2670. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2671. StaticCallOperand(result,procedure);
  2672. IF numberParameters < 0 THEN
  2673. size := ProcedureParametersSize(system,procedure);
  2674. ELSE
  2675. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2676. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2677. Error(position,"runtime call parameter count mismatch");
  2678. END;
  2679. END;
  2680. Emit(Call(position, result.op, size));
  2681. ReleaseOperand(result);
  2682. ELSE (* only static linking possible *)
  2683. ASSERT(numberParameters >= 0);
  2684. Basic.InitSegmentedName(pooledName);
  2685. pooledName[0] := Basic.MakeString(moduleName);
  2686. pooledName[1] := Basic.MakeString(procedureName);
  2687. pooledName[2] := -1;
  2688. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2689. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2690. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2691. END;
  2692. END CallThisChecked;
  2693. (* 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. *)
  2694. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2695. BEGIN
  2696. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2697. END CallThis;
  2698. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2699. VAR
  2700. left,right: Operand;
  2701. leftSize, rightSize: IntermediateCode.Operand;
  2702. saved: RegisterEntry;
  2703. reg: IntermediateCode.Operand;
  2704. procedureName: SyntaxTree.IdentifierString;
  2705. BEGIN
  2706. procedureName := "CompareString";
  2707. SaveRegisters();ReleaseUsedRegisters(saved);
  2708. Designate(leftExpression,left);
  2709. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2710. Emit(Push(position,leftSize));
  2711. ReleaseIntermediateOperand(leftSize);
  2712. Emit(Push(position,left.op));
  2713. ReleaseOperand(left);
  2714. Designate(rightExpression,right);
  2715. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2716. Emit(Push(position,rightSize));
  2717. ReleaseIntermediateOperand(rightSize);
  2718. Emit(Push(position,right.op));
  2719. ReleaseOperand(right);
  2720. IF backend.cooperative THEN
  2721. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2722. ELSE
  2723. CallThis(position,runtimeModuleName,procedureName, 4);
  2724. END;
  2725. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2726. Emit(Result(position,reg));
  2727. (*
  2728. AcquireThisRegister(int8,IntermediateCode.Result);
  2729. *)
  2730. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2731. (*
  2732. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2733. *)
  2734. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2735. ReleaseIntermediateOperand(reg);
  2736. BrL(falseLabel);
  2737. END CompareString;
  2738. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2739. VAR
  2740. left,right: Operand;
  2741. leftSize, rightSize: IntermediateCode.Operand;
  2742. saved: RegisterEntry;
  2743. procedureName: SyntaxTree.IdentifierString;
  2744. BEGIN
  2745. procedureName := "CopyString";
  2746. SaveRegisters();ReleaseUsedRegisters(saved);
  2747. Designate(leftExpression,left);
  2748. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2749. Emit(Push(position,leftSize));
  2750. ReleaseIntermediateOperand(leftSize);
  2751. Emit(Push(position,left.op));
  2752. ReleaseOperand(left);
  2753. Designate(rightExpression,right);
  2754. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2755. Emit(Push(position,rightSize));
  2756. ReleaseIntermediateOperand(rightSize);
  2757. Emit(Push(position,right.op));
  2758. ReleaseOperand(right);
  2759. IF backend.cooperative THEN
  2760. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2761. ELSE
  2762. CallThis(position,runtimeModuleName,procedureName,4);
  2763. END;
  2764. RestoreRegisters(saved);
  2765. END CopyString;
  2766. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2767. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2768. leftType,rightType: SyntaxTree.Type;
  2769. leftExpression,rightExpression : SyntaxTree.Expression;
  2770. componentType: IntermediateCode.Type;
  2771. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2772. size: LONGINT;
  2773. BEGIN
  2774. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2775. dest := destination; destination := emptyOperand;
  2776. leftType := x.left.type.resolved;
  2777. rightType := x.right.type.resolved;
  2778. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2779. CASE x.operator OF
  2780. Scanner.Or:
  2781. (* shortcut evaluation of left OR right *)
  2782. IF ~conditional THEN ConditionToValue(x);
  2783. ELSE
  2784. next := NewLabel();
  2785. Condition(x.left,trueLabel,next);
  2786. SetLabel(next);
  2787. Condition(x.right,trueLabel,falseLabel);
  2788. END;
  2789. |Scanner.And:
  2790. (* shortcut evaluation of left & right *)
  2791. IF ~conditional THEN ConditionToValue(x);
  2792. ELSE
  2793. next := NewLabel();
  2794. Condition(x.left,next,falseLabel);
  2795. SetLabel(next);
  2796. Condition(x.right,trueLabel,falseLabel);
  2797. END;
  2798. |Scanner.Is:
  2799. IF ~conditional THEN ConditionToValue(x);
  2800. ELSE
  2801. (* get type desc tag *)
  2802. IF IsPointerToRecord(leftType,recordType) THEN
  2803. Evaluate(x.left,left);
  2804. Dereference(left,recordType,IsUnsafePointer(leftType))
  2805. ELSE
  2806. Designate(x.left,left);
  2807. END;
  2808. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2809. ReleaseOperand(left);
  2810. END;
  2811. |Scanner.Plus:
  2812. Evaluate(x.left,left);
  2813. Evaluate(x.right,right);
  2814. IF leftType IS SyntaxTree.SetType THEN
  2815. InitOperand(result,ModeValue);
  2816. Reuse2a(result.op,left.op,right.op,dest);
  2817. Emit(Or(position,result.op,left.op,right.op));
  2818. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2819. InitOperand(result,ModeValue);
  2820. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2821. Reuse2(result.tag,left.tag,right.tag);
  2822. Emit(Add(position,result.op,left.op,right.op));
  2823. Emit(Add(position,result.tag,left.tag,right.tag))
  2824. ELSE
  2825. InitOperand(result,ModeValue);
  2826. Reuse2a(result.op,left.op,right.op,dest);
  2827. Emit(Add(position,result.op,left.op,right.op));
  2828. END;
  2829. ReleaseOperand(left); ReleaseOperand(right);
  2830. |Scanner.Minus:
  2831. Evaluate(x.left,left);
  2832. Evaluate(x.right,right);
  2833. IF leftType IS SyntaxTree.SetType THEN
  2834. InitOperand(result,ModeValue);
  2835. Reuse1(result.op,right.op);
  2836. Emit(Not(position,result.op,right.op));
  2837. ReleaseOperand(right);
  2838. Emit(And(position,result.op,result.op,left.op));
  2839. ReleaseOperand(left);
  2840. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2841. InitOperand(result,ModeValue);
  2842. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2843. Reuse2(result.tag,left.tag,right.tag);
  2844. Emit(Sub(position,result.op,left.op,right.op));
  2845. Emit(Sub(position,result.tag,left.tag,right.tag));
  2846. ReleaseOperand(left); ReleaseOperand(right)
  2847. ELSE
  2848. InitOperand(result,ModeValue);
  2849. Reuse2a(result.op,left.op,right.op,dest);
  2850. Emit(Sub(position,result.op,left.op,right.op));
  2851. ReleaseOperand(left); ReleaseOperand(right);
  2852. END;
  2853. |Scanner.Times:
  2854. Evaluate(x.left,left);
  2855. Evaluate(x.right,right);
  2856. IF leftType IS SyntaxTree.SetType THEN
  2857. InitOperand(result,ModeValue);
  2858. Reuse2a(result.op,left.op,right.op,dest);
  2859. Emit(And(position,result.op,left.op,right.op));
  2860. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2861. InitOperand(result,ModeValue);
  2862. Reuse1a(result.op,left.op,dest);
  2863. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2864. Emit(Shl(position,result.op,left.op,right.op));
  2865. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2866. InitOperand(result, ModeValue);
  2867. componentType := left.op.type;
  2868. (* TODO: review this *)
  2869. (*
  2870. result.op = left.op * right.op - left.tag * right.tag
  2871. result.tag = left.tag * right.op + left.op * right.tag
  2872. *)
  2873. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2874. Emit(Mul(position,result.op, left.op, right.op));
  2875. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2876. Emit(Mul(position,tempReg, left.tag, right.tag));
  2877. Emit(Sub(position,result.op, result.op, tempReg));
  2878. Reuse2(result.tag, left.tag, right.op);
  2879. Emit(Mul(position,result.tag, left.tag, right.op));
  2880. Emit(Mul(position,tempReg, left.op, right.tag));
  2881. Emit(Add(position,result.tag, result.tag, tempReg));
  2882. ReleaseIntermediateOperand(tempReg)
  2883. ELSE
  2884. InitOperand(result,ModeValue);
  2885. Reuse2a(result.op,left.op,right.op,dest);
  2886. Emit(Mul(position,result.op,left.op,right.op));
  2887. END;
  2888. ReleaseOperand(left); ReleaseOperand(right);
  2889. |Scanner.Div:
  2890. Evaluate(x.left,left);
  2891. Evaluate(x.right,right);
  2892. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2893. InitOperand(result,ModeValue);
  2894. Reuse1a(result.op,left.op,dest);
  2895. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2896. Emit(Shr(position,result.op,left.op,right.op));
  2897. ELSE
  2898. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2899. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2900. IF ~isUnchecked THEN
  2901. exit := NewLabel();
  2902. BrltL(exit,zero,right.op);
  2903. EmitTrap(position,NegativeDivisorTrap);
  2904. SetLabel(exit);
  2905. END;
  2906. END;
  2907. InitOperand(result,ModeValue);
  2908. Reuse2a(result.op,left.op,right.op,dest);
  2909. Emit(Div(position,result.op,left.op,right.op));
  2910. END;
  2911. ReleaseOperand(left); ReleaseOperand(right);
  2912. |Scanner.Mod:
  2913. Evaluate(x.left,left);
  2914. Evaluate(x.right,right);
  2915. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2916. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  2917. InitOperand(result,ModeValue);
  2918. Reuse1a(result.op,left.op,dest);
  2919. Emit(And(position,result.op,left.op,right.op));
  2920. ELSE
  2921. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2922. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2923. IF ~isUnchecked THEN
  2924. exit := NewLabel();
  2925. BrltL(exit,zero,right.op);
  2926. EmitTrap(position,NegativeDivisorTrap);
  2927. SetLabel(exit);
  2928. END;
  2929. END;
  2930. InitOperand(result,ModeValue);
  2931. Reuse2a(result.op,left.op,right.op,dest);
  2932. Emit(Mod(position,result.op,left.op,right.op));
  2933. END;
  2934. ReleaseOperand(left); ReleaseOperand(right);
  2935. |Scanner.Slash:
  2936. Evaluate(x.left,left);
  2937. Evaluate(x.right,right);
  2938. IF leftType IS SyntaxTree.SetType THEN
  2939. InitOperand(result,ModeValue);
  2940. Reuse2a(result.op,left.op,right.op,dest);
  2941. Emit(Xor(position,result.op,left.op,right.op));
  2942. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2943. InitOperand(result,ModeValue);
  2944. componentType := left.op.type;
  2945. (* review this *)
  2946. (*
  2947. divisor = right.op * right.op + right.tag * right.tag
  2948. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2949. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2950. *)
  2951. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2952. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2953. Emit(Mul(position,tempReg, right.op, right.op));
  2954. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2955. Emit(Add(position,tempReg, tempReg, tempReg2));
  2956. result.op := tempReg2;
  2957. Emit(Mul(position,result.op, left.op, right.op));
  2958. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2959. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2960. Emit(Add(position,result.op, result.op, tempReg2));
  2961. Emit(Div(position,result.op, result.op, tempReg));
  2962. Reuse2(result.tag, left.tag, right.op);
  2963. Emit(Mul(position,result.tag, left.tag, right.op));
  2964. Emit(Mul(position,tempReg2, left.op, right.tag));
  2965. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2966. Emit(Div(position,result.tag, result.tag, tempReg));
  2967. ReleaseIntermediateOperand(tempReg);
  2968. ReleaseIntermediateOperand(tempReg2)
  2969. ELSE
  2970. InitOperand(result,ModeValue);
  2971. Reuse2a(result.op,left.op,right.op,dest);
  2972. Emit(Div(position,result.op,left.op,right.op));
  2973. END;
  2974. ReleaseOperand(left); ReleaseOperand(right);
  2975. |Scanner.Equal:
  2976. IF ~conditional THEN ConditionToValue(x);
  2977. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2978. CompareString(BreqL,x.left,x.right);
  2979. ELSE
  2980. Evaluate(x.left,left);
  2981. Evaluate(x.right,right);
  2982. IF leftType IS SyntaxTree.RangeType THEN
  2983. ASSERT(rightType IS SyntaxTree.RangeType);
  2984. BrneL(falseLabel, left.op, right.op); (* first *)
  2985. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2986. BrneL(falseLabel, left.extra, right.extra); (* step *)
  2987. ReleaseOperand(left); ReleaseOperand(right);
  2988. BrL(trueLabel)
  2989. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  2990. BrneL(falseLabel, left.op, right.op); (* first *)
  2991. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2992. ReleaseOperand(left); ReleaseOperand(right);
  2993. BrL(trueLabel)
  2994. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2995. (* TODO: review this *)
  2996. BrneL(falseLabel, left.op, right.op); (* real part *)
  2997. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  2998. ReleaseOperand(left); ReleaseOperand(right);
  2999. BrL(trueLabel)
  3000. ELSE
  3001. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3002. ReleaseOperand(left); ReleaseOperand(right);
  3003. BrL(trueLabel);
  3004. END;
  3005. END;
  3006. |Scanner.LessEqual:
  3007. IF ~conditional THEN ConditionToValue(x);
  3008. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3009. CompareString(BrgeL,x.right,x.left);
  3010. ELSE
  3011. Evaluate(x.left,left);
  3012. Evaluate(x.right,right);
  3013. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3014. Reuse1(temp.op,right.op);
  3015. Emit(And(position,temp.op,left.op,right.op));
  3016. ReleaseOperand(right);
  3017. BreqL(trueLabel,temp.op,left.op);
  3018. BrL(falseLabel);
  3019. ReleaseOperand(temp);ReleaseOperand(left);
  3020. ELSE
  3021. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3022. ReleaseOperand(left); ReleaseOperand(right);
  3023. BrL(trueLabel);
  3024. END;
  3025. END;
  3026. |Scanner.Less:
  3027. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3028. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3029. leftExpression.SetType(system.booleanType);
  3030. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3031. rightExpression.SetType(system.booleanType);
  3032. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3033. leftExpression.SetType(system.booleanType);
  3034. Expression(leftExpression);
  3035. ELSIF ~conditional THEN ConditionToValue(x);
  3036. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3037. CompareString(BrltL,x.left,x.right);
  3038. ELSE
  3039. Evaluate(x.left,left);
  3040. Evaluate(x.right,right);
  3041. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3042. ReleaseOperand(left); ReleaseOperand(right);
  3043. BrL(trueLabel);
  3044. END;
  3045. |Scanner.Greater:
  3046. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3047. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3048. leftExpression.SetType(system.booleanType);
  3049. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3050. rightExpression.SetType(system.booleanType);
  3051. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3052. leftExpression.SetType(system.booleanType);
  3053. Expression(leftExpression);
  3054. ELSIF ~conditional THEN ConditionToValue(x);
  3055. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3056. CompareString(BrltL,x.right,x.left);
  3057. ELSE
  3058. Evaluate(x.left,left);
  3059. Evaluate(x.right,right);
  3060. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3061. ReleaseOperand(left); ReleaseOperand(right);
  3062. BrL(trueLabel);
  3063. END;
  3064. |Scanner.GreaterEqual:
  3065. IF ~conditional THEN ConditionToValue(x);
  3066. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3067. CompareString(BrgeL,x.left,x.right);
  3068. ELSE
  3069. Evaluate(x.left,left);
  3070. Evaluate(x.right,right);
  3071. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3072. Reuse1(temp.op,left.op);
  3073. Emit(And(position,temp.op,left.op,right.op));
  3074. ReleaseOperand(left);
  3075. BreqL(trueLabel, temp.op,right.op);
  3076. ReleaseOperand(temp); ReleaseOperand(right);
  3077. BrL(falseLabel);
  3078. ELSE
  3079. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3080. ReleaseOperand(left); ReleaseOperand(right);
  3081. BrL(trueLabel);
  3082. END;
  3083. END;
  3084. |Scanner.Unequal:
  3085. IF ~conditional THEN ConditionToValue(x);
  3086. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3087. CompareString(BrneL,x.left,x.right);
  3088. ELSE
  3089. Evaluate(x.left,left);
  3090. Evaluate(x.right,right);
  3091. IF leftType IS SyntaxTree.RangeType THEN
  3092. ASSERT(rightType IS SyntaxTree.RangeType);
  3093. BrneL(trueLabel, left.op, right.op); (* first *)
  3094. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3095. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3096. ReleaseOperand(left); ReleaseOperand(right);
  3097. BrL(falseLabel)
  3098. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3099. BrneL(trueLabel, left.op, right.op); (* first *)
  3100. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3101. ReleaseOperand(left); ReleaseOperand(right);
  3102. BrL(falseLabel)
  3103. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3104. (* TODO: review this *)
  3105. BrneL(trueLabel, left.op, right.op); (* real part *)
  3106. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3107. ReleaseOperand(left); ReleaseOperand(right);
  3108. BrL(falseLabel)
  3109. ELSE
  3110. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3111. ReleaseOperand(left); ReleaseOperand(right);
  3112. BrL(trueLabel);
  3113. END;
  3114. END;
  3115. |Scanner.In:
  3116. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3117. Evaluate(x.left,left);
  3118. Evaluate(x.right,right);
  3119. Convert(left.op,setType);
  3120. ReuseCopy(temp.op,right.op);
  3121. Emit(Shr(position,temp.op,temp.op,left.op));
  3122. ReleaseOperand(right); ReleaseOperand(left);
  3123. IntermediateCode.InitImmediate(one,setType,1);
  3124. Emit(And(position,temp.op,temp.op,one));
  3125. IF conditional THEN
  3126. IntermediateCode.InitImmediate(zero,setType,0);
  3127. BrneL(trueLabel,temp.op,zero);
  3128. ReleaseOperand(temp);
  3129. BrL(falseLabel);
  3130. ELSE
  3131. Convert(temp.op,bool);
  3132. result.mode := ModeValue;
  3133. result.op := temp.op;
  3134. result.tag := nil; (* may be left over from calls to evaluate *)
  3135. END;
  3136. ELSE
  3137. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3138. IF x.operator = Scanner.Questionmarks THEN
  3139. leftExpression := x.left;
  3140. rightExpression := x.right;
  3141. ELSE
  3142. leftExpression := x.right;
  3143. rightExpression := x.left;
  3144. END;
  3145. Evaluate(leftExpression, left);
  3146. Emit(Push(position,left.op));
  3147. ReleaseOperand(left);
  3148. Designate(rightExpression, right);
  3149. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3150. IF ~backend.cellsAreObjects THEN
  3151. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3152. END;
  3153. Emit(Push(position,right.op));
  3154. ReleaseOperand(right);
  3155. IF backend.cellsAreObjects THEN
  3156. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3157. ELSE
  3158. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3159. END;
  3160. InitOperand(result, ModeValue);
  3161. result.op := NewRegisterOperand(bool);
  3162. Emit(Result(position,result.op));
  3163. IF conditional THEN
  3164. IntermediateCode.InitImmediate(zero,setType,0);
  3165. BrneL(trueLabel,result.op,zero);
  3166. ReleaseOperand(result);
  3167. BrL(falseLabel);
  3168. END;
  3169. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3170. leftExpression := x.left;
  3171. rightExpression := x.right;
  3172. Evaluate(leftExpression, left);
  3173. Emit(Push(position,left.op));
  3174. ReleaseOperand(left);
  3175. Evaluate(rightExpression, right);
  3176. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3177. IF ~backend.cellsAreObjects THEN
  3178. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3179. END;
  3180. Emit(Push(position,right.op));
  3181. ReleaseOperand(right);
  3182. IF backend.cellsAreObjects THEN
  3183. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3184. ELSE
  3185. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3186. END;
  3187. InitOperand(result, ModeValue);
  3188. result.op := NewRegisterOperand(bool);
  3189. Emit(Result(position,result.op));
  3190. IF conditional THEN
  3191. IntermediateCode.InitImmediate(zero,setType,0);
  3192. BrneL(trueLabel,result.op,zero);
  3193. ReleaseOperand(result);
  3194. BrL(falseLabel);
  3195. END;
  3196. ELSE
  3197. HALT(100);
  3198. END;
  3199. END;
  3200. destination := dest;
  3201. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3202. END VisitBinaryExpression;
  3203. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3204. VAR localResult, operand: Operand;
  3205. BEGIN
  3206. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3207. InitOperand(localResult, ModeValue);
  3208. ASSERT(x.first # NIL);
  3209. Evaluate(x.first, operand);
  3210. localResult.op := operand.op;
  3211. ReleaseOperand(operand);
  3212. UseIntermediateOperand(localResult.op);
  3213. ASSERT(x.last # NIL);
  3214. Evaluate(x.last, operand);
  3215. localResult.tag := operand.op;
  3216. ReleaseOperand(operand);
  3217. UseIntermediateOperand(localResult.tag);
  3218. IF x.step # NIL THEN
  3219. Evaluate(x.step, operand);
  3220. localResult.extra := operand.op;
  3221. ReleaseOperand(operand);
  3222. UseIntermediateOperand(localResult.extra);
  3223. END;
  3224. result := localResult;
  3225. IF Trace THEN TraceExit("VisitRangeExpression") END
  3226. END VisitRangeExpression;
  3227. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3228. BEGIN
  3229. HALT(100); (* should never be evaluated *)
  3230. END VisitTensorRangeExpression;
  3231. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3232. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3233. BEGIN
  3234. IF Trace THEN TraceEnter("VisitConversion") END;
  3235. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3236. dest := destination; destination := emptyOperand;
  3237. Evaluate(x.expression,old);
  3238. InitOperand(result,ModeValue);
  3239. result.op := old.op;
  3240. ASSERT(result.op.mode # 0);
  3241. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3242. (* convert TO a complex number *)
  3243. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3244. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3245. ASSERT(result.op.mode # 0);
  3246. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3247. (* convert FROM a complex number TO a complex number*)
  3248. result.tag := old.tag;
  3249. ASSERT(result.tag.mode # 0);
  3250. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3251. ASSERT(result.tag.mode # 0)
  3252. ELSE
  3253. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3254. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3255. END
  3256. ELSE
  3257. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3258. ASSERT(result.op.mode # 0);
  3259. result.tag := old.tag; (*! probably never used *)
  3260. END;
  3261. destination := dest;
  3262. IF Trace THEN TraceExit("VisitConversion") END;
  3263. END VisitConversion;
  3264. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3265. BEGIN
  3266. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3267. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3268. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3269. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3270. END VisitTypeDeclaration;
  3271. (** designators (expressions) *)
  3272. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3273. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3274. BEGIN
  3275. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3276. IF x.left # NIL THEN Expression(x.left) END;
  3277. Symbol(x.symbol,result);
  3278. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3279. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3280. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3281. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3282. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3283. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3284. END;
  3285. END;
  3286. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3287. END VisitSymbolDesignator;
  3288. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3289. BEGIN
  3290. IF isUnchecked THEN RETURN END;
  3291. IF tagsAvailable THEN
  3292. TrapC(BrltL,index,length,IndexCheckTrap);
  3293. END;
  3294. END BoundCheck;
  3295. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3296. VAR d: IntermediateCode.Operand;
  3297. BEGIN
  3298. IF isUnchecked THEN RETURN END;
  3299. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3300. TrapC(op,dim,d,ArraySizeTrap);
  3301. ReleaseIntermediateOperand(d);
  3302. END DimensionCheck;
  3303. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3304. VAR
  3305. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3306. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3307. expression: SyntaxTree.Expression;
  3308. resultingType, leftType, baseType: SyntaxTree.Type;
  3309. skipLabel1: Label;
  3310. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3311. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3312. variableOp: Operand;
  3313. variable: SyntaxTree.Variable;
  3314. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3315. VAR expression: SyntaxTree.Expression;
  3316. BEGIN
  3317. (* count the number of indices, ranges and tensorRanges in the index list *)
  3318. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3319. FOR i := 0 TO parameters.Length() - 1 DO
  3320. expression := parameters.GetExpression(i);
  3321. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3322. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3323. ELSE INC(indexCount)
  3324. END
  3325. END;
  3326. END CountIndices;
  3327. BEGIN
  3328. ASSERT(tagsAvailable);
  3329. resultingType := x.type.resolved; (* resulting type *)
  3330. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3331. InitOperand(localResult, ModeReference);
  3332. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3333. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3334. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3335. (* a globally defined array destination tag is available -> use and invalidate it*)
  3336. localResult.tag := arrayDestinationTag;
  3337. IntermediateCode.InitOperand(arrayDestinationTag)
  3338. ELSE
  3339. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3340. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3341. Symbol(variable, variableOp);
  3342. ReuseCopy(localResult.tag, variableOp.op);
  3343. ReleaseOperand(variableOp);
  3344. END
  3345. END;
  3346. indexListSize := x.parameters.Length();
  3347. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3348. ASSERT(tensorRangeCount <= 1);
  3349. (* designate the array to be indexed over, perform tensor range check if known *)
  3350. Designate(x.left, array);
  3351. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3352. Dereference(array, leftType,FALSE);
  3353. IF tensorRangeCount=0 THEN
  3354. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3355. END
  3356. END;
  3357. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3358. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3359. srcDimOffset := -indexListSize;
  3360. destDimOffset := -rangeCount
  3361. ELSE
  3362. srcDimOffset := 0;
  3363. destDimOffset := 0
  3364. END;
  3365. indexDim := 0;
  3366. (* use address of source array as basis *)
  3367. (*
  3368. ReuseCopy(localResult.op, array.op);
  3369. *)
  3370. localResult.op := array.op;
  3371. UseIntermediateOperand(localResult.op);
  3372. (* go through the index list *)
  3373. FOR i := 0 TO indexListSize - 1 DO
  3374. expression := x.parameters.GetExpression(i);
  3375. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3376. (* nothing to do *)
  3377. ELSE
  3378. (* determine which dimension of source array is currently looked at *)
  3379. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3380. (* get the memory operand pointing to array descriptor dimension *)
  3381. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3382. (* make a reusable register from it *)
  3383. ReuseCopy(srcDim, tmp);
  3384. ReleaseIntermediateOperand(tmp);
  3385. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3386. ELSE
  3387. srcDim := IntermediateCode.Immediate(int32, i)
  3388. END;
  3389. (* get length and increment of source array for current dimension *)
  3390. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3391. Convert(sourceLength.op, sizeType);
  3392. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3393. Convert(sourceIncrement.op, sizeType);
  3394. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3395. ReleaseIntermediateOperand(srcDim);
  3396. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3397. (* SINGLE INDEX *)
  3398. Evaluate(expression, index);
  3399. ReleaseIntermediateOperand(index.tag);
  3400. index.tag := emptyOperand;
  3401. Convert(index.op, sizeType);
  3402. (* lower bound check *)
  3403. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3404. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3405. ELSIF isUnchecked THEN (* do nothing *)
  3406. ELSE
  3407. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3408. END;
  3409. (* upper bound check *)
  3410. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3411. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3412. ELSIF isUnchecked THEN (* do nothing *)
  3413. ELSE
  3414. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3415. END;
  3416. ReleaseOperand(sourceLength);
  3417. Convert(index.op, addressType);
  3418. summand := index.op;
  3419. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3420. (* RANGE OF INDICES *)
  3421. Evaluate(expression, range);
  3422. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3423. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3424. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3425. ReleaseOperand(range);
  3426. Convert(firstIndex, sizeType);
  3427. Convert(lastIndex, sizeType);
  3428. Convert(stepSize, sizeType);
  3429. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3430. if it is 'MAX(LONGINT)' *)
  3431. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3432. TransferToRegister(lastIndex, lastIndex);
  3433. skipLabel1 := NewLabel();
  3434. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3435. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3436. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3437. SetLabel(skipLabel1)
  3438. END;
  3439. (* check if step size is valid *)
  3440. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3441. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3442. ELSIF isUnchecked THEN (* do nothing *)
  3443. ELSE
  3444. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3445. END;
  3446. (* check lower bound check *)
  3447. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3448. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3449. ELSIF isUnchecked THEN (* do nothing *)
  3450. ELSE
  3451. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3452. END;
  3453. (* check upper bound check *)
  3454. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3455. (* statically open range: nothing to do *)
  3456. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3457. ASSERT(staticLastIndex < staticSourceLength)
  3458. ELSIF isUnchecked THEN (* do nothing *)
  3459. ELSE
  3460. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3461. END;
  3462. (* determine length of target array for current dimension *)
  3463. (* 1. incorporate last index: *)
  3464. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3465. (* last index is static *)
  3466. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3467. targetLength := sourceLength.op
  3468. ELSE
  3469. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3470. END;
  3471. UseIntermediateOperand(targetLength);
  3472. ELSE
  3473. (* targetLength := lastIndex + 1
  3474. Reuse1(targetLength, lastIndex);
  3475. *)
  3476. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3477. END;
  3478. ReleaseOperand(sourceLength);
  3479. ReleaseIntermediateOperand(lastIndex);
  3480. (* 2. incorporate first index: *)
  3481. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3482. (* first index and current target length are static *)
  3483. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3484. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3485. (* first index = 0: nothing to do *)
  3486. ELSE
  3487. (* targetLength := targetLength - firstIndex *)
  3488. TransferToRegister(targetLength, targetLength);
  3489. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3490. END;
  3491. (* clip negative lengths to 0 *)
  3492. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3493. IF staticTargetLength < 0 THEN
  3494. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3495. END
  3496. ELSE
  3497. skipLabel1 := NewLabel();
  3498. TransferToRegister(targetLength, targetLength);
  3499. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3500. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3501. SetLabel(skipLabel1)
  3502. END;
  3503. (* 3. incorporate index step size: *)
  3504. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3505. (*step size and current target length are static *)
  3506. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3507. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3508. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3509. (* step size = 1: nothing to do *)
  3510. ELSE
  3511. (* emit code for this:
  3512. targetLength := (targetLength-1) DIV stepSize +1;
  3513. *)
  3514. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3515. DivInt(targetLength, targetLength, stepSize);
  3516. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3517. END;
  3518. (* determine increment of target array for current dimension *)
  3519. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3520. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3521. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3522. (* step size = 1 *)
  3523. targetIncrement := sourceIncrement.op;
  3524. UseIntermediateOperand(targetIncrement)
  3525. ELSE
  3526. (* targetIncrement := sourceIncrement * stepSize *)
  3527. Reuse1(targetIncrement, stepSize);
  3528. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3529. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3530. END;
  3531. ReleaseIntermediateOperand(stepSize);
  3532. (* write length and increment of target array to descriptor *)
  3533. IF destDimOffset < 0 THEN
  3534. (* determine which dimension of target array is currently looked at *)
  3535. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3536. TransferToRegister(destDim, tmp);
  3537. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3538. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3539. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3540. ReleaseIntermediateOperand(destDim)
  3541. ELSE
  3542. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3543. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3544. END;
  3545. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3546. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3547. INC(indexDim);
  3548. Convert(firstIndex, addressType);
  3549. TransferToRegister(summand, firstIndex);
  3550. ELSE HALT(100);
  3551. END;
  3552. (*
  3553. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3554. *)
  3555. Convert(sourceIncrement.op, addressType);
  3556. Convert(summand, addressType);
  3557. MulInt(summand, summand, sourceIncrement.op);
  3558. ReleaseIntermediateOperand(sourceIncrement.op);
  3559. AddInt(localResult.op, localResult.op, summand);
  3560. ReleaseIntermediateOperand(summand);
  3561. END
  3562. END;
  3563. result := localResult;
  3564. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3565. ReleaseIntermediateOperand(result.tag);
  3566. result.tag := TypeDescriptorAdr(resultingType);
  3567. IF ~newObjectFile THEN
  3568. IntermediateCode.MakeMemory(result.tag,addressType);
  3569. END;
  3570. ELSIF IsDelegate(resultingType) THEN
  3571. ReleaseIntermediateOperand(result.tag);
  3572. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3573. UseIntermediateOperand(result.tag);
  3574. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3575. ReleaseIntermediateOperand(result.tag);
  3576. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3577. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3578. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3579. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3580. (* finalize target array descriptor *)
  3581. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3582. (* write lengths and increments of target array for remaining dimensions *)
  3583. i := indexListSize;
  3584. WHILE indexDim < targetArrayDimensionality DO
  3585. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3586. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3587. ReleaseOperand(sourceLength);
  3588. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3589. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3590. ReleaseOperand(sourceIncrement);
  3591. INC(i); INC(indexDim);
  3592. END;
  3593. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3594. tmp := nil;
  3595. ELSE
  3596. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3597. END;
  3598. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3599. ReleaseIntermediateOperand(tmp);
  3600. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3601. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3602. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3603. ELSE
  3604. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3605. END;
  3606. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3607. ReleaseIntermediateOperand(tmp);
  3608. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3609. (* write dimensionality *)
  3610. IF targetArrayDimensionality # 0 THEN
  3611. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3612. END;
  3613. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3614. END;
  3615. ReleaseOperand(array);
  3616. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3617. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3618. END;
  3619. END MathIndexDesignator;
  3620. (* TENTATIVE *)
  3621. PROCEDURE DumpOperand(operand: Operand);
  3622. BEGIN
  3623. D.Log.String(" op = ");
  3624. IntermediateCode.DumpOperand(D.Log, operand.op );
  3625. D.Log.Ln;
  3626. D.Log.String(" tag = ");
  3627. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3628. D.Log.Ln;
  3629. D.Log.String(" extra = ");
  3630. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3631. D.Log.Ln;
  3632. D.Log.Update
  3633. END DumpOperand;
  3634. (* get the length of an array , trying to make use of static information *)
  3635. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3636. VAR res: IntermediateCode.Operand; size: LONGINT;
  3637. BEGIN
  3638. type := type.resolved;
  3639. IF type IS SyntaxTree.ArrayType THEN
  3640. WITH type: SyntaxTree.ArrayType DO
  3641. IF type.form = SyntaxTree.Static THEN
  3642. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3643. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3644. Evaluate(type.length, op);
  3645. ReleaseIntermediateOperand(op.tag);
  3646. RETURN op.op;*)
  3647. ELSE
  3648. res := tag;
  3649. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3650. IntermediateCode.MakeMemory(res,addressType);
  3651. UseIntermediateOperand(res);
  3652. RETURN res
  3653. END
  3654. END;
  3655. ELSE
  3656. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3657. RETURN IntermediateCode.Immediate(addressType,size);
  3658. END;
  3659. END ArrayLength;
  3660. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3661. BEGIN
  3662. ReleaseIntermediateOperand(res);
  3663. IF IsImmediate(x) & IsImmediate(y) THEN
  3664. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3665. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3666. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3667. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3668. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3669. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3670. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3671. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3672. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3673. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3674. UseIntermediateOperand(res);
  3675. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3676. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3677. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3678. UseIntermediateOperand(res);
  3679. ELSE
  3680. IF ~ReusableRegister(res) THEN
  3681. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3682. ELSE
  3683. UseIntermediateOperand(res);
  3684. END;
  3685. IF IsImmediate(x) & (x.intValue = 0) THEN
  3686. Emit(Mov(position,res,y))
  3687. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3688. Emit(Mov(position,res,x))
  3689. ELSE
  3690. Emit(Add(position,res, x, y));
  3691. END;
  3692. END;
  3693. END AddInt;
  3694. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3695. BEGIN
  3696. ReleaseIntermediateOperand(res);
  3697. IF IsImmediate(x) & IsImmediate(y) THEN
  3698. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3699. ELSE
  3700. IF ~ReusableRegister(res) THEN
  3701. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3702. ELSE UseIntermediateOperand(res);
  3703. END;
  3704. IF IsImmediate(x) & (x.intValue = 1) THEN
  3705. Emit(Mov(position,res,y))
  3706. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3707. Emit(Mov(position,res,x))
  3708. ELSE
  3709. Emit(Mul(position,res, x, y));
  3710. END;
  3711. END;
  3712. END MulInt;
  3713. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3714. BEGIN
  3715. ReleaseIntermediateOperand(res);
  3716. IF IsImmediate(x) & IsImmediate(y) THEN
  3717. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3718. ELSE
  3719. IF ~ReusableRegister(res) THEN
  3720. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3721. ELSE UseIntermediateOperand(res);
  3722. END;
  3723. IF IsImmediate(x) & (x.intValue = 1) THEN
  3724. Emit(Mov(position,res,y))
  3725. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3726. Emit(Mov(position,res,x))
  3727. ELSE
  3728. Emit(Div(position,res, x, y));
  3729. END;
  3730. END;
  3731. END DivInt;
  3732. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3733. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3734. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3735. BEGIN
  3736. type := x.left.type.resolved;
  3737. IF type IS SyntaxTree.StringType THEN
  3738. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3739. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3740. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3741. type := atype;
  3742. x.left.SetType(type);
  3743. END;
  3744. IntermediateCode.InitImmediate(res,addressType,0);
  3745. maxDim := x.parameters.Length()-1;
  3746. FOR i := 0 TO maxDim DO
  3747. e := x.parameters.GetExpression(i);
  3748. Evaluate(e,index);
  3749. Convert(index.op,addressType);
  3750. AddInt(res, res, index.op);
  3751. IF i = 0 THEN
  3752. (*
  3753. ReuseCopy(res, index.op);
  3754. *)
  3755. Designate(x.left,array);
  3756. type := x.left.type.resolved;
  3757. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3758. Dereference(array, type, FALSE);
  3759. END;
  3760. (*
  3761. ELSE AddInt(res, res, index.op);
  3762. *)
  3763. END;
  3764. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3765. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3766. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3767. BoundCheck(index.op, length);
  3768. END;
  3769. ReleaseIntermediateOperand(length);
  3770. END;
  3771. ReleaseOperand(index);
  3772. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3773. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3774. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3775. MulInt(res,res,length);
  3776. END;
  3777. ReleaseIntermediateOperand(length);
  3778. END;
  3779. IF (type IS SyntaxTree.ArrayType) THEN
  3780. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3781. size := StaticSize(system, type);
  3782. IF size # 1 THEN
  3783. length := IntermediateCode.Immediate(addressType,size);
  3784. MulInt(res,res,length);
  3785. END;
  3786. ELSE
  3787. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3788. IF size # 1 THEN
  3789. length := IntermediateCode.Immediate(addressType,size);
  3790. MulInt(res,res,length);
  3791. END;
  3792. END;
  3793. END;
  3794. AddInt(res,res,array.op);
  3795. InitOperand(result,ModeReference);
  3796. result.op := res;
  3797. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3798. ReleaseIntermediateOperand(result.tag);
  3799. result.tag := TypeDescriptorAdr(type);
  3800. IF ~newObjectFile THEN
  3801. IntermediateCode.MakeMemory(result.tag,addressType);
  3802. END
  3803. ELSIF IsDelegate(type) THEN
  3804. ReleaseIntermediateOperand(result.tag);
  3805. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3806. UseIntermediateOperand(result.tag);
  3807. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3808. ReleaseIntermediateOperand(result.tag);
  3809. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3810. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3811. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3812. END;
  3813. ReleaseOperand(array);
  3814. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3815. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3816. END;
  3817. END IndexDesignator;
  3818. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3819. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3820. BEGIN
  3821. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3822. dest := destination; destination := emptyOperand;
  3823. type := x.left.type.resolved;
  3824. IF type IS SyntaxTree.MathArrayType THEN
  3825. MathIndexDesignator(x);
  3826. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3827. IndexDesignator(x);
  3828. END;
  3829. destination := dest;
  3830. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3831. END VisitIndexDesignator;
  3832. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3833. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3834. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3835. procedure: SyntaxTree.Procedure;
  3836. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3837. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3838. BEGIN
  3839. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3840. parameters := expression.parameters;
  3841. moduleName := "FoxArrayBase";
  3842. procedureName := "CopyDescriptor";
  3843. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3844. SaveRegisters();ReleaseUsedRegisters(saved);
  3845. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3846. IF procedure = NIL THEN
  3847. s := "procedure ";
  3848. Strings.Append(s,moduleName);
  3849. Strings.Append(s,".");
  3850. Strings.Append(s,procedureName);
  3851. Strings.Append(s," not present");
  3852. Error(position,s);
  3853. ELSE
  3854. (* push address of temporary variable *)
  3855. Symbol(variable,destOperand);
  3856. Emit(Push(position,destOperand.op));
  3857. ReleaseOperand(destOperand);
  3858. (* push src *)
  3859. Evaluate(expression.left,srcOperand);
  3860. (*
  3861. Dereference(srcOperand,expression.type.resolved);
  3862. Emit(Push(position,srcOperand.tag));
  3863. *)
  3864. Emit(Push(position,srcOperand.op));
  3865. ReleaseOperand(srcOperand);
  3866. tensorFound := FALSE;
  3867. FOR i := 0 TO parameters.Length()-1 DO
  3868. e := parameters.GetExpression(i);
  3869. IF e IS SyntaxTree.TensorRangeExpression THEN
  3870. tensorFound := TRUE;
  3871. ELSIF e IS SyntaxTree.RangeExpression THEN
  3872. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3873. ELSE
  3874. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3875. END;
  3876. END;
  3877. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  3878. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  3879. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  3880. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  3881. StaticCallOperand(procOp,procedure);
  3882. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  3883. ReleaseOperand(procOp);
  3884. END;
  3885. RestoreRegisters(saved);
  3886. END;
  3887. RETURN variable
  3888. END PrepareTensorDescriptor;
  3889. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  3890. VAR
  3891. type, descriptorType, baseType: SyntaxTree.Type;
  3892. operand, tmpOperand, variableOp, variable2Op: Operand;
  3893. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  3894. variable, variable2: SyntaxTree.Variable;
  3895. dim, i, size: LONGINT;
  3896. (* TODO: needed? *)
  3897. oldArrayDestinationTag: IntermediateCode.Operand;
  3898. oldArrayDestinationDimension: LONGINT;
  3899. position: LONGINT;
  3900. saved: RegisterEntry;
  3901. arrayFlags: SET;
  3902. m, n: LONGINT;
  3903. PROCEDURE Pass(op: IntermediateCode.Operand);
  3904. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  3905. BEGIN
  3906. IF numberRegister >= 0 THEN
  3907. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  3908. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  3909. Emit(Mov(position,parameterRegister, op));
  3910. ELSE
  3911. Emit(Push(position,op))
  3912. END
  3913. END Pass;
  3914. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  3915. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  3916. BEGIN
  3917. formalType := formalType.resolved; actualType := actualType.resolved;
  3918. IF IsOpenArray(formalType)THEN
  3919. IF actualType IS SyntaxTree.StringType THEN
  3920. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  3921. RETURN;
  3922. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  3923. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  3924. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  3925. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  3926. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  3927. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3928. ELSE
  3929. tmp := baseReg;
  3930. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  3931. IntermediateCode.MakeMemory(tmp,addressType);
  3932. Pass((tmp));
  3933. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3934. END;
  3935. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  3936. END;
  3937. END PushArrayLens;
  3938. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  3939. BEGIN
  3940. CASE size OF
  3941. |2: INCL(flags,Size2Flag);
  3942. |3: INCL(flags,Size3Flag);
  3943. |4: INCL(flags,Size4Flag);
  3944. |5: INCL(flags,Size5Flag);
  3945. |6: INCL(flags,Size6Flag);
  3946. |7: INCL(flags,Size7Flag);
  3947. |8: INCL(flags,Size8Flag);
  3948. END;
  3949. END SetSmallArraySizeFlag;
  3950. BEGIN
  3951. IF Trace THEN TraceEnter("PushParameter") END;
  3952. position := expression.position;
  3953. IF expression.resolved # NIL THEN expression := expression.resolved END;
  3954. type := expression.type.resolved;
  3955. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  3956. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  3957. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  3958. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  3959. );
  3960. (* TODO: needed? *)
  3961. oldArrayDestinationTag := arrayDestinationTag;
  3962. oldArrayDestinationDimension := arrayDestinationDimension;
  3963. IF IsArrayOfSystemByte(parameter.type) THEN
  3964. Designate(expression,operand);
  3965. tmp := GetArrayOfBytesSize(expression,operand.tag);
  3966. ReleaseIntermediateOperand(operand.tag);
  3967. operand.tag := tmp;
  3968. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3969. Pass((operand.tag));
  3970. END;
  3971. Pass((operand.op));
  3972. ELSIF IsOpenArray(parameter.type) THEN
  3973. Designate(expression,operand);
  3974. baseReg := operand.tag;
  3975. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3976. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  3977. END;
  3978. Pass((operand.op)); (* address of the array *)
  3979. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  3980. (* case 1 *)
  3981. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  3982. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  3983. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3984. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  3985. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  3986. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3987. arrayDestinationTag := sp;
  3988. (* case 1b *)
  3989. IF expression IS SyntaxTree.IndexDesignator THEN
  3990. (*
  3991. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3992. descriptorType := GetMathArrayDescriptorType(dim);
  3993. variable := GetTemporaryVariable(descriptorType,expression.position);
  3994. Symbol(variable,variableOp);
  3995. arrayDestinationTag := variableOp.op;
  3996. *)
  3997. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  3998. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3999. arrayDestinationDimension := dim;
  4000. Designate(expression,operand);
  4001. (* case 1a *)
  4002. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4003. Designate(expression,operand);
  4004. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4005. i := 0;
  4006. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4007. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4008. INC(i);
  4009. END;
  4010. type := expression.type.resolved;
  4011. WHILE (i<dim) DO (* remaining static dimensions *)
  4012. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4013. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4014. ReleaseOperand(tmpOperand);
  4015. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4016. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4017. ReleaseOperand(tmpOperand);
  4018. INC(i);
  4019. END;
  4020. dimOp := IntermediateCode.Immediate(addressType,dim);
  4021. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4022. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4023. (* case 1d *)
  4024. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4025. Designate(expression,operand);
  4026. Dereference(operand,type.resolved,FALSE);
  4027. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4028. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4029. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4030. (* case 1f *)
  4031. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4032. Designate(expression,operand);
  4033. FOR i := 0 TO dim-1 DO
  4034. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4035. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4036. ReleaseOperand(tmpOperand);
  4037. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4038. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4039. ReleaseOperand(tmpOperand);
  4040. END;
  4041. (*******
  4042. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4043. *)
  4044. arrayFlags := {StaticFlag};
  4045. IF dim = 1 THEN
  4046. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4047. ReleaseOperand(tmpOperand);
  4048. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4049. m := LONGINT(tmpOperand.op.intValue);
  4050. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4051. ELSIF dim = 2 THEN
  4052. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4053. ReleaseOperand(tmpOperand);
  4054. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4055. m := LONGINT(tmpOperand.op.intValue);
  4056. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4057. ReleaseOperand(tmpOperand);
  4058. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4059. n := LONGINT(tmpOperand.op.intValue);
  4060. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4061. INCL(arrayFlags,SmallMatrixFlag);
  4062. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4063. END;
  4064. END;
  4065. (*******)
  4066. dimOp := IntermediateCode.Immediate(addressType,dim);
  4067. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4068. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4069. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4070. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4071. baseType := SemanticChecker.ArrayBase(type,dim);
  4072. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4073. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4074. ELSE HALT(100);
  4075. END;
  4076. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4077. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4078. (* case 2b *)
  4079. IF expression IS SyntaxTree.IndexDesignator THEN
  4080. descriptorType := GetMathArrayDescriptorType(dim);
  4081. variable := GetTemporaryVariable(descriptorType, FALSE);
  4082. Symbol(variable,variableOp);
  4083. arrayDestinationTag := variableOp.op;
  4084. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4085. arrayDestinationDimension := dim;
  4086. NeedDescriptor := TRUE;
  4087. Designate(expression,operand);
  4088. Pass((operand.tag));
  4089. NeedDescriptor := FALSE;
  4090. (* case 2a *)
  4091. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4092. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4093. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4094. INC(i);
  4095. END;
  4096. IF i = dim THEN
  4097. Designate(expression,operand);
  4098. Pass((operand.tag));
  4099. ELSE (* open-static *)
  4100. type := expression.type.resolved;
  4101. descriptorType := GetMathArrayDescriptorType(dim);
  4102. variable := GetTemporaryVariable(descriptorType, FALSE);
  4103. Symbol(variable,variableOp);
  4104. arrayDestinationTag := variableOp.op;
  4105. Designate(expression,operand);
  4106. FOR i := 0 TO dim-1 DO
  4107. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4108. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4109. ReleaseOperand(tmpOperand);
  4110. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4111. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4112. ReleaseOperand(tmpOperand);
  4113. END;
  4114. dimOp := IntermediateCode.Immediate(addressType,dim);
  4115. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4116. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4117. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4118. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4119. baseType := SemanticChecker.ArrayBase(type,dim);
  4120. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4121. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4122. Pass((arrayDestinationTag));
  4123. END;
  4124. (* case 2d *)
  4125. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4126. Designate(expression,operand);
  4127. Dereference(operand,type.resolved,FALSE);
  4128. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4129. Pass((operand.tag));
  4130. (* case 2f *)
  4131. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4132. descriptorType := GetMathArrayDescriptorType(dim);
  4133. variable := GetTemporaryVariable(descriptorType, FALSE);
  4134. Symbol(variable,variableOp);
  4135. arrayDestinationTag := variableOp.op;
  4136. Designate(expression,operand);
  4137. FOR i := 0 TO dim-1 DO
  4138. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4139. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4140. ReleaseOperand(tmpOperand);
  4141. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4142. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4143. ReleaseOperand(tmpOperand);
  4144. END;
  4145. (*
  4146. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4147. *)
  4148. arrayFlags := {StaticFlag};
  4149. IF dim = 1 THEN
  4150. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4151. ReleaseOperand(tmpOperand);
  4152. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4153. m := LONGINT(tmpOperand.op.intValue);
  4154. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4155. ELSIF dim = 2 THEN
  4156. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4157. ReleaseOperand(tmpOperand);
  4158. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4159. m := LONGINT(tmpOperand.op.intValue);
  4160. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4161. ReleaseOperand(tmpOperand);
  4162. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4163. n := LONGINT(tmpOperand.op.intValue);
  4164. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4165. INCL(arrayFlags,SmallMatrixFlag);
  4166. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4167. END;
  4168. END;
  4169. (*******)
  4170. dimOp := IntermediateCode.Immediate(addressType,dim);
  4171. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4172. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4173. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4174. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4175. baseType := SemanticChecker.ArrayBase(type,dim);
  4176. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4177. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4178. Pass((arrayDestinationTag));
  4179. ELSE HALT(100);
  4180. END;
  4181. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4182. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4183. (* case 3b *)
  4184. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4185. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4186. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4187. Symbol(variable,variableOp);
  4188. LoadValue(variableOp,system.addressType);
  4189. ELSE
  4190. descriptorType := GetMathArrayDescriptorType(dim);
  4191. variable := GetTemporaryVariable(descriptorType, FALSE);
  4192. Symbol(variable,variableOp);
  4193. END;
  4194. arrayDestinationTag := variableOp.op;
  4195. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4196. arrayDestinationDimension := 0;
  4197. Designate(expression,operand);
  4198. Pass((operand.tag));
  4199. (* case 3a *)
  4200. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4201. i := 0;
  4202. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4203. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4204. INC(i);
  4205. END;
  4206. IF i = dim THEN
  4207. Designate(expression,operand);
  4208. Pass((operand.tag));
  4209. ELSE (* open-static *)
  4210. type := expression.type.resolved;
  4211. descriptorType := GetMathArrayDescriptorType(dim);
  4212. variable := GetTemporaryVariable(descriptorType, FALSE);
  4213. Symbol(variable,variableOp);
  4214. arrayDestinationTag := variableOp.op;
  4215. Designate(expression,operand);
  4216. FOR i := 0 TO dim-1 DO
  4217. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4218. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4219. ReleaseOperand(tmpOperand);
  4220. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4221. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4222. ReleaseOperand(tmpOperand);
  4223. END;
  4224. dimOp := IntermediateCode.Immediate(addressType,dim);
  4225. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4226. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4227. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4228. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4229. baseType := SemanticChecker.ArrayBase(type,dim);
  4230. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4231. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4232. Pass((arrayDestinationTag));
  4233. END;
  4234. (* case 3d *)
  4235. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4236. Designate(expression,operand);
  4237. Dereference(operand,type.resolved,FALSE);
  4238. (*
  4239. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4240. *)
  4241. Pass((operand.tag));
  4242. (* case 3f *)
  4243. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4244. descriptorType := GetMathArrayDescriptorType(dim);
  4245. variable := GetTemporaryVariable(descriptorType, FALSE);
  4246. Symbol(variable,variableOp);
  4247. arrayDestinationTag := variableOp.op;
  4248. Designate(expression,operand);
  4249. IF operand.op.type.length >1 THEN (* vector register *)
  4250. variable2 := GetTemporaryVariable(type, FALSE);
  4251. Symbol(variable2, variable2Op);
  4252. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4253. Emit(Mov(position,tmp, operand.op));
  4254. ReleaseOperand(operand);
  4255. Symbol(variable2, operand);
  4256. END;
  4257. FOR i := 0 TO dim-1 DO
  4258. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4259. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4260. ReleaseOperand(tmpOperand);
  4261. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4262. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4263. ReleaseOperand(tmpOperand);
  4264. END;
  4265. dimOp := IntermediateCode.Immediate(addressType,dim);
  4266. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4267. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4268. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4269. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4270. baseType := SemanticChecker.ArrayBase(type,dim);
  4271. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4272. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4273. Pass((arrayDestinationTag));
  4274. ELSE HALT(100);
  4275. END;
  4276. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4277. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4278. (* case 4b *)
  4279. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4280. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4281. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4282. Symbol(variable,variableOp);
  4283. LoadValue(variableOp,system.addressType);
  4284. ELSE
  4285. descriptorType := GetMathArrayDescriptorType(dim);
  4286. variable := GetTemporaryVariable(descriptorType, FALSE);
  4287. Symbol(variable,variableOp);
  4288. END;
  4289. arrayDestinationTag := variableOp.op;
  4290. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4291. arrayDestinationDimension := 0;
  4292. Designate(expression,operand);
  4293. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4294. Symbol(variable,variableOp);
  4295. ELSE
  4296. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4297. Symbol(variable,variableOp);
  4298. MakeMemory(tmp,variableOp.op,addressType,0);
  4299. Emit(Mov(position,tmp,operand.tag));
  4300. ReleaseIntermediateOperand(tmp);
  4301. END;
  4302. Pass((variableOp.op));
  4303. ReleaseOperand(variableOp);
  4304. (* case 4a *)
  4305. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4306. i := 0;
  4307. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4308. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4309. INC(i);
  4310. END;
  4311. IF i = dim THEN
  4312. Designate(expression,operand);
  4313. arrayDestinationTag := operand.tag;
  4314. ELSE (* open-static *)
  4315. type := expression.type.resolved;
  4316. descriptorType := GetMathArrayDescriptorType(dim);
  4317. variable := GetTemporaryVariable(descriptorType, FALSE);
  4318. Symbol(variable,variableOp);
  4319. arrayDestinationTag := variableOp.op;
  4320. Designate(expression,operand);
  4321. FOR i := 0 TO dim-1 DO
  4322. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4323. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4324. ReleaseOperand(tmpOperand);
  4325. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4326. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4327. ReleaseOperand(tmpOperand);
  4328. END;
  4329. dimOp := IntermediateCode.Immediate(addressType,dim);
  4330. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4331. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4332. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4333. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4334. baseType := SemanticChecker.ArrayBase(type,dim);
  4335. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4336. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4337. END;
  4338. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4339. Symbol(variable,variableOp);
  4340. MakeMemory(tmp,variableOp.op,addressType,0);
  4341. Emit(Mov(position,tmp,arrayDestinationTag));
  4342. ReleaseIntermediateOperand(tmp);
  4343. Pass((variableOp.op));
  4344. ReleaseOperand(variableOp);
  4345. (* case 4d *)
  4346. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4347. Designate(expression,operand);
  4348. (*
  4349. Dereference(operand,type.resolved,FALSE);
  4350. *)
  4351. (*
  4352. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4353. *)
  4354. Pass((operand.op));
  4355. (* case 4f *)
  4356. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4357. descriptorType := GetMathArrayDescriptorType(dim);
  4358. variable := GetTemporaryVariable(descriptorType, FALSE);
  4359. Symbol(variable,variableOp);
  4360. arrayDestinationTag := variableOp.op;
  4361. Designate(expression,operand);
  4362. FOR i := 0 TO dim-1 DO
  4363. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4364. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4365. ReleaseOperand(tmpOperand);
  4366. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4367. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4368. ReleaseOperand(tmpOperand);
  4369. END;
  4370. dimOp := IntermediateCode.Immediate(addressType,dim);
  4371. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4372. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4373. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4374. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4375. baseType := SemanticChecker.ArrayBase(type,dim);
  4376. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4377. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4378. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4379. Symbol(variable,variableOp);
  4380. MakeMemory(tmp,variableOp.op,addressType,0);
  4381. Emit(Mov(position,tmp,arrayDestinationTag));
  4382. ReleaseIntermediateOperand(tmp);
  4383. Pass((variableOp.op));
  4384. ReleaseOperand(variableOp);
  4385. ELSE HALT(100);
  4386. END;
  4387. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4388. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4389. Designate(expression,operand);
  4390. IF operand.op.type.length > 1 THEN
  4391. Emit(Push(position, operand.op));
  4392. ReleaseOperand(operand);
  4393. ELSE
  4394. size := system.SizeOf(type);
  4395. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4396. size := ToMemoryUnits(system,size);
  4397. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4398. arrayDestinationTag := sp;
  4399. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4400. END;
  4401. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4402. Designate(expression,operand);
  4403. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4404. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4405. Symbol(variable,variableOp);
  4406. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4407. Emit(Mov(position,tmp,operand.op));
  4408. Emit(Push(position,variableOp.op));
  4409. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4410. Pass((operand.op));
  4411. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4412. END;
  4413. ELSE HALT(200)
  4414. END;
  4415. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4416. IF parameter.kind = SyntaxTree.VarParameter THEN
  4417. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4418. Designate(expression, operand);
  4419. Pass((operand.op));
  4420. ELSE
  4421. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4422. Evaluate(expression, operand);
  4423. Pass((operand.extra)); (* step *)
  4424. Pass((operand.tag)); (* last *)
  4425. Pass((operand.op)) (* first *)
  4426. END
  4427. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4428. IF parameter.kind = SyntaxTree.VarParameter THEN
  4429. Designate(expression, operand);
  4430. Pass((operand.op));
  4431. ELSE
  4432. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4433. Evaluate(expression, operand);
  4434. Pass((operand.tag)); (* real part *)
  4435. Pass((operand.op)) (* imaginary part *)
  4436. END
  4437. ELSE
  4438. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4439. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4440. Designate(expression,operand);
  4441. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4442. (* stack allocation *)
  4443. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4444. (*! parameter alignment to be discussed ... *)
  4445. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4446. size := type(SyntaxTree.StringType).length;
  4447. END;
  4448. IF backend.cooperative & parameter.NeedsTrace() THEN
  4449. dst := NewRegisterOperand (addressType);
  4450. Emit(Mov(position,dst, sp));
  4451. IntermediateCode.InitImmediate(null, byteType, 0);
  4452. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4453. ReleaseIntermediateOperand(dst);
  4454. SaveRegisters();ReleaseUsedRegisters(saved);
  4455. (* register dst has been freed before SaveRegisters already *)
  4456. CallAssignMethod(dst, operand.op, parameter.type);
  4457. RestoreRegisters(saved);
  4458. END;
  4459. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4460. ELSIF IsOpenArray(parameter.type) THEN
  4461. Designate(expression,operand);
  4462. baseReg := operand.tag;
  4463. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4464. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4465. END;
  4466. Pass((operand.op)); (* address of the array *)
  4467. ELSIF IsDelegate(parameter.type) THEN
  4468. Evaluate(expression,operand);
  4469. IF backend.cooperative & parameter.NeedsTrace() THEN
  4470. Emit(Push(position, nil));
  4471. dst := NewRegisterOperand (addressType);
  4472. Emit(Mov(position,dst, sp));
  4473. ReleaseIntermediateOperand(dst);
  4474. SaveRegisters();ReleaseUsedRegisters(saved);
  4475. Emit(Push(position, dst));
  4476. (* register dst has been freed before SaveRegisters already *)
  4477. Emit(Push(position, operand.tag));
  4478. CallThis(position,"GarbageCollector","Assign",2);
  4479. RestoreRegisters(saved);
  4480. ELSE
  4481. Pass((operand.tag));
  4482. END;
  4483. Pass((operand.op));
  4484. ELSE
  4485. Evaluate(expression,operand);
  4486. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4487. Emit(Push(position, nil));
  4488. dst := NewRegisterOperand (addressType);
  4489. Emit(Mov(position,dst, sp));
  4490. ReleaseIntermediateOperand(dst);
  4491. SaveRegisters();ReleaseUsedRegisters(saved);
  4492. Emit(Push(position, dst));
  4493. (* register dst has been freed before SaveRegisters already *)
  4494. Emit(Push(position, operand.op));
  4495. CallThis(position,"GarbageCollector","Assign",2);
  4496. RestoreRegisters(saved);
  4497. ELSE
  4498. Pass((operand.op));
  4499. END;
  4500. END;
  4501. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4502. Evaluate(expression,operand);
  4503. Pass((operand.op));
  4504. ELSE (* var parameter *)
  4505. Designate(expression,operand);
  4506. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4507. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4508. Pass((operand.tag));
  4509. END;
  4510. END;
  4511. Pass((operand.op));
  4512. END;
  4513. END;
  4514. (* TODO: needed? *)
  4515. arrayDestinationTag := oldArrayDestinationTag;
  4516. arrayDestinationDimension := oldArrayDestinationDimension;
  4517. IF needsParameterBackup THEN
  4518. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4519. ReuseCopy(parameterBackup, operand.op)
  4520. END;
  4521. ReleaseOperand(operand);
  4522. IF Trace THEN TraceExit("PushParameter") END;
  4523. END PushParameter;
  4524. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4525. VAR prevConditional: BOOLEAN;
  4526. BEGIN
  4527. prevConditional := conditional;
  4528. conditional := FALSE;
  4529. 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
  4530. Expression(x.result); (* use register *)
  4531. END;
  4532. Statement(x.statement);
  4533. conditional := prevConditional;
  4534. IF x.result # NIL THEN Expression(x.result) END;
  4535. 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
  4536. ReleaseIntermediateOperand(result.op);
  4537. END;
  4538. END VisitStatementDesignator;
  4539. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4540. VAR
  4541. procedure: SyntaxTree.Procedure;
  4542. procedureType: SyntaxTree.ProcedureType;
  4543. wasInline: BOOLEAN;
  4544. actualParameters: SyntaxTree.ExpressionList;
  4545. formalParameter: SyntaxTree.Parameter;
  4546. actualParameter: SyntaxTree.Expression;
  4547. i: LONGINT;
  4548. localVariable: SyntaxTree.Variable;
  4549. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4550. src, dest: Operand;
  4551. prevInlineExit : Label;
  4552. prevMapper: SymbolMapper;
  4553. tooComplex: BOOLEAN;
  4554. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4555. BEGIN
  4556. IF e = NIL THEN RETURN TRUE
  4557. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4558. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4559. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4560. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4561. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4562. ELSE RETURN FALSE
  4563. END;
  4564. END SimpleExpression;
  4565. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4566. BEGIN
  4567. RETURN checker.CanPassInRegister(type)
  4568. END FitsInRegister;
  4569. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4570. VAR
  4571. variable: SyntaxTree.Variable;
  4572. variableDesignator: SyntaxTree.Designator;
  4573. BEGIN
  4574. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4575. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4576. variableDesignator.SetType(type);
  4577. RETURN variableDesignator
  4578. END GetTemp;
  4579. BEGIN
  4580. wasInline := currentIsInline;
  4581. prevInlineExit := currentInlineExit;
  4582. prevMapper := currentMapper;
  4583. currentInlineExit := NewLabel();
  4584. tooComplex := FALSE;
  4585. NEW(currentMapper);
  4586. currentIsInline := TRUE;
  4587. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4588. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4589. formalParameter := procedureType.firstParameter;
  4590. actualParameters := x.parameters;
  4591. i := 0;
  4592. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4593. actualParameter := actualParameters.GetExpression(i);
  4594. IF actualParameter.resolved # NIL THEN
  4595. actualParameter := actualParameter.resolved
  4596. END;
  4597. (*
  4598. if expression is simple and can be passed immediately
  4599. or if type fits in register then we can proceed
  4600. otherwise we escape to ordinary procedure call.
  4601. *)
  4602. (* cases where the expression can be mapped identically *)
  4603. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4604. currentMapper.Add(formalParameter, actualParameter, NIL);
  4605. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4606. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4607. (*
  4608. Assign(variableDesignator, actualParameter);
  4609. *)
  4610. Evaluate(actualParameter, src);
  4611. Designate(variableDesignator, dest);
  4612. Emit(Mov(x.position, dest.op, src.op));
  4613. ReleaseOperand(dest);
  4614. ReleaseOperand(src);
  4615. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4616. ELSE tooComplex := TRUE
  4617. END;
  4618. (*
  4619. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4620. currentMapper.Add(formalParameter, actualParameter, NIL);
  4621. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4622. variableDesignator := GetTemp(system.addressType, FALSE);
  4623. Designate(actualParameter, src);
  4624. Designate(variableDesignator, dest);
  4625. IntermediateCode.MakeMemory(dest.op,addressType);
  4626. Emit(Mov(x.position, dest.op, src.op));
  4627. ReleaseOperand(dest);
  4628. IF src.tag.mode # IntermediateCode.Undefined THEN
  4629. tagDesignator := GetTemp(system.addressType, FALSE);
  4630. Designate(tagDesignator, dest);
  4631. IntermediateCode.MakeMemory(dest.op,addressType);
  4632. Emit(Mov(x.position, dest.op, src.op));
  4633. END;
  4634. ReleaseOperand(dest); ReleaseOperand(src);
  4635. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4636. END;
  4637. *)
  4638. formalParameter := formalParameter.nextParameter;
  4639. INC(i);
  4640. END;
  4641. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4642. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4643. currentMapper.Add(NIL, returnDesignator, NIL);
  4644. END;
  4645. localVariable := procedure.procedureScope.firstVariable;
  4646. WHILE ~tooComplex & (localVariable # NIL) DO
  4647. variableDesignator := GetTemp(localVariable.type, FALSE);
  4648. currentMapper.Add(localVariable, variableDesignator, NIL);
  4649. localVariable := localVariable.nextVariable;
  4650. END;
  4651. IF ~tooComplex THEN
  4652. VisitStatementBlock(procedure.procedureScope.body);
  4653. SetLabel(currentInlineExit);
  4654. IF procedureType.returnType # NIL THEN
  4655. Designate(returnDesignator, result);
  4656. IF conditional THEN
  4657. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4658. ValueToCondition(result)
  4659. END;
  4660. END;
  4661. END;
  4662. currentMapper := prevMapper;
  4663. currentInlineExit := prevInlineExit;
  4664. currentIsInline := wasInline;
  4665. RETURN ~tooComplex
  4666. END InlineProcedureCall;
  4667. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4668. VAR
  4669. parameters: SyntaxTree.ExpressionList;
  4670. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4671. designator: SyntaxTree.Designator;
  4672. procedureType: SyntaxTree.ProcedureType;
  4673. formalParameter: SyntaxTree.Parameter;
  4674. operand, returnValue: Operand;
  4675. reg, size, mask, dest: IntermediateCode.Operand;
  4676. saved: RegisterEntry;
  4677. symbol: SyntaxTree.Symbol;
  4678. variable: SyntaxTree.Variable;
  4679. i, parametersSize, returnTypeSize : LONGINT;
  4680. structuredReturnType: BOOLEAN;
  4681. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4682. tempVariableDesignator: SyntaxTree.Designator;
  4683. gap, alignment: LONGINT; (*fld*)
  4684. (* TODO: remove unnecessary backup variables *)
  4685. oldResult: Operand;
  4686. oldCurrentScope: SyntaxTree.Scope;
  4687. oldArrayDestinationTag: IntermediateCode.Operand;
  4688. oldArrayDestinationDimension: LONGINT;
  4689. oldConstantDeclaration: SyntaxTree.Symbol;
  4690. oldDestination: IntermediateCode.Operand;
  4691. oldCurrentLoop: Label;
  4692. oldConditional: BOOLEAN;
  4693. oldTrueLabel, oldFalseLabel: Label;
  4694. oldLocked: BOOLEAN;
  4695. usedRegisters,oldUsedRegisters: RegisterEntry;
  4696. return: IntermediateCode.Operand;
  4697. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4698. arg: IntermediateCode.Operand;
  4699. dummy: IntermediateCode.Operand;
  4700. recordType: SyntaxTree.RecordType;
  4701. operatorSelectionProcedureOperand: Operand;
  4702. operatorSelectionProcedure: SyntaxTree.Procedure;
  4703. fingerPrint: SyntaxTree.FingerPrint;
  4704. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4705. identifierNumber: LONGINT;
  4706. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4707. procedure: SyntaxTree.Procedure;
  4708. PROCEDURE BackupGlobalState;
  4709. BEGIN
  4710. oldResult := result;
  4711. oldCurrentScope := currentScope;
  4712. oldArrayDestinationTag := arrayDestinationTag;
  4713. oldArrayDestinationDimension := arrayDestinationDimension;
  4714. oldConstantDeclaration := constantDeclaration;
  4715. oldDestination := destination;
  4716. oldCurrentLoop := currentLoop;
  4717. oldConditional := conditional;
  4718. oldTrueLabel := trueLabel;
  4719. oldFalseLabel := falseLabel;
  4720. oldLocked := locked;
  4721. oldUsedRegisters := usedRegisters
  4722. END BackupGlobalState;
  4723. PROCEDURE RestoreGlobalState;
  4724. BEGIN
  4725. result := oldResult;
  4726. currentScope := oldCurrentScope;
  4727. arrayDestinationTag := oldArrayDestinationTag;
  4728. arrayDestinationDimension := oldArrayDestinationDimension;
  4729. constantDeclaration := oldConstantDeclaration;
  4730. destination := oldDestination;
  4731. currentLoop := oldCurrentLoop;
  4732. conditional := oldConditional;
  4733. trueLabel := oldTrueLabel;
  4734. falseLabel := oldFalseLabel;
  4735. locked := oldLocked;
  4736. usedRegisters := oldUsedRegisters
  4737. END RestoreGlobalState;
  4738. (** do preparations before parameter push for array-structured object types (ASOTs):
  4739. if ASOT is passed as VAR parameter:
  4740. - allocate temporary variable of math array type
  4741. - copy contents of ASOT to be passed to temporary variable
  4742. - use temporary variable as the actual parameter instead
  4743. - 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)
  4744. **)
  4745. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4746. VAR
  4747. expression: SyntaxTree.Expression;
  4748. BEGIN
  4749. IF actualParameter IS SyntaxTree.Designator THEN
  4750. designator := actualParameter(SyntaxTree.Designator);
  4751. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4752. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4753. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4754. ASSERT(checker # NIL);
  4755. checker.SetCurrentScope(currentScope);
  4756. (* allocate temporary variable *)
  4757. ASSERT(actualParameter.type # NIL);
  4758. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4759. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4760. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4761. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4762. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4763. ASSERT(tempVariableDesignator.type # NIL);
  4764. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4765. (* copy math array stored in actual parameter to temporary variable *)
  4766. BackupGlobalState;
  4767. AssignMathArray(tempVariableDesignator, actualParameter);
  4768. RestoreGlobalState;
  4769. (* use temporary variable as actual parameter instead of the original one *)
  4770. actualParameter := tempVariableDesignator;
  4771. (* create write-back call and store it in linked list *)
  4772. (* create new list entry *)
  4773. IF firstWriteBackCall = NIL THEN
  4774. NEW(firstWriteBackCall);
  4775. currentWriteBackCall := firstWriteBackCall
  4776. ELSE
  4777. ASSERT(currentWriteBackCall # NIL);
  4778. NEW(currentWriteBackCall.next);
  4779. currentWriteBackCall := currentWriteBackCall.next
  4780. END;
  4781. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4782. ASSERT(expression.type = NIL);
  4783. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4784. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4785. (* prepare writeback for any other "normal" indexer *)
  4786. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4787. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4788. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4789. Assign(tempVariableDesignator, actualParameter);
  4790. actualParameter := tempVariableDesignator;
  4791. IF firstWriteBackCall = NIL THEN
  4792. NEW(firstWriteBackCall);
  4793. currentWriteBackCall := firstWriteBackCall
  4794. ELSE
  4795. ASSERT(currentWriteBackCall # NIL);
  4796. NEW(currentWriteBackCall.next);
  4797. currentWriteBackCall := currentWriteBackCall.next
  4798. END;
  4799. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4800. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4801. END
  4802. END
  4803. END PrepareParameter;
  4804. BEGIN
  4805. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4806. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4807. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4808. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4809. IF InlineProcedureCall(x) THEN
  4810. RETURN
  4811. ELSE
  4812. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4813. END
  4814. END;
  4815. END;
  4816. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4817. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4818. dest := destination; destination := emptyOperand;
  4819. SaveRegisters();ReleaseUsedRegisters(saved);
  4820. parameters := x.parameters;
  4821. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4822. (* an operator is called *)
  4823. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4824. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4825. (* check if a dynamic operator call should be performed *)
  4826. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4827. ELSE
  4828. isCallOfDynamicOperator := FALSE
  4829. END;
  4830. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4831. Emit(Push(position, ap));
  4832. END;
  4833. alignment := procedureType.stackAlignment;
  4834. IF alignment > 1 THEN
  4835. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4836. Emit(Mov(position,reg, sp));
  4837. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4838. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4839. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4840. Emit(And(position,sp, sp, mask));
  4841. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4842. Emit(Push(position,reg));
  4843. (*
  4844. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4845. Emit(Mov(position,mem,reg));
  4846. *)
  4847. ReleaseIntermediateOperand(reg);
  4848. END;
  4849. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4850. IntermediateCode.InitImmediate(mask,addressType,-16);
  4851. Emit(And(position,sp, sp, mask));
  4852. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4853. IF gap # 0 THEN
  4854. IntermediateCode.InitImmediate(size,addressType,gap);
  4855. Emit(Sub(position,sp,sp,size))
  4856. END;
  4857. END;
  4858. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4859. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4860. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4861. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4862. ELSE
  4863. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4864. END;
  4865. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4866. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  4867. (* push ID *)
  4868. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4869. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  4870. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  4871. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  4872. formalParameter := procedureType.firstParameter;
  4873. FOR i := 0 TO parameters.Length() - 1 DO
  4874. IF formalParameter.access # SyntaxTree.Hidden THEN
  4875. ASSERT(i < 2);
  4876. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  4877. (* push pointer *)
  4878. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4879. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  4880. (* add dereference *)
  4881. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4882. ReleaseIntermediateOperand(parameterBackups[i]);
  4883. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  4884. END;
  4885. Emit(Push(position,parameterBackups[i]));
  4886. ReleaseIntermediateOperand(parameterBackups[i]);
  4887. (* push typetag *)
  4888. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4889. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  4890. arg := TypeDescriptorAdr(recordType);
  4891. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  4892. Emit(Push(position,arg));
  4893. ELSE
  4894. (* push 'NonPointer' *)
  4895. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4896. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4897. (* push fingerprint *)
  4898. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4899. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  4900. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  4901. END
  4902. END;
  4903. formalParameter := formalParameter.nextParameter
  4904. END;
  4905. (* for unary operators: complete the information for the second parameter *)
  4906. IF procedureType.numberParameters < 2 THEN
  4907. (* push 'NonPointer' *)
  4908. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4909. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4910. (* push 'NoType' *)
  4911. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4912. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  4913. END;
  4914. (* call operator selection procedure *)
  4915. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  4916. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  4917. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  4918. ReleaseOperand(operatorSelectionProcedureOperand);
  4919. (* use the address that the operator selection procedure returned as the target address of the call *)
  4920. InitOperand(operand, ModeValue);
  4921. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4922. Emit(Result(position,operand.op))
  4923. END
  4924. ELSE
  4925. Evaluate(x.left, operand)
  4926. END;
  4927. IF symbol IS SyntaxTree.Procedure THEN
  4928. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4929. Emit(Push(position,operand.tag));
  4930. ELSIF (procedureType.isDelegate) THEN
  4931. Emit(Push(position,operand.tag));
  4932. END;
  4933. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4934. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  4935. Emit(Push(position,operand.tag));
  4936. END;
  4937. ELSE HALT(200);
  4938. END;
  4939. ReleaseIntermediateOperand(operand.tag);
  4940. operand.tag := emptyOperand;
  4941. (* determine if a structured return type is needed *)
  4942. structuredReturnType := StructuredReturnType(procedureType);
  4943. IF structuredReturnType THEN
  4944. IF resultDesignator # NIL THEN
  4945. d := resultDesignator;
  4946. ELSE
  4947. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  4948. variable.SetUntraced(procedureType.hasUntracedReturn);
  4949. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  4950. d.SetType(variable.type);
  4951. END;
  4952. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  4953. Designate(d,returnValue);
  4954. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  4955. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  4956. Emit(Push(position,size));
  4957. Emit(Push(position,returnValue.op));
  4958. ReleaseOperand(returnValue);
  4959. ELSE
  4960. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  4961. END;
  4962. END;
  4963. firstWriteBackCall := NIL; (* reset write-back call list *)
  4964. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  4965. passByRegister := system.registerParameters > 0;
  4966. registerNumber := 0;
  4967. formalParameter := procedureType.lastParameter;
  4968. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  4969. actualParameter := parameters.GetExpression(i);
  4970. PrepareParameter(actualParameter, formalParameter);
  4971. IF passByRegister & (i < system.registerParameters) THEN
  4972. IF ~PassInRegister(formalParameter) THEN
  4973. Error(actualParameter.position,"cannot be passed by register")
  4974. ELSE
  4975. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  4976. END;
  4977. INC(registerNumber);
  4978. ELSE
  4979. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4980. END;
  4981. formalParameter := formalParameter.prevParameter;
  4982. END;
  4983. IF passByRegister & (registerNumber > 0) THEN
  4984. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  4985. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4986. END;
  4987. ELSE
  4988. hasDynamicOperands := FALSE;
  4989. formalParameter := procedureType.firstParameter;
  4990. FOR i := 0 TO parameters.Length() - 1 DO
  4991. actualParameter := parameters.GetExpression(i);
  4992. IF formalParameter # NIL THEN (* TENTATIVE *)
  4993. PrepareParameter(actualParameter, formalParameter);
  4994. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  4995. ASSERT(i < 2);
  4996. hasDynamicOperands := TRUE;
  4997. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  4998. ELSE
  4999. IF passByRegister & (registerNumber > 0) THEN
  5000. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5001. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5002. END;
  5003. passByRegister := FALSE;
  5004. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5005. END;
  5006. formalParameter := formalParameter.nextParameter;
  5007. END;
  5008. END;
  5009. END;
  5010. IF symbol IS SyntaxTree.Procedure THEN
  5011. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5012. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5013. Emit(Push(position,reg));
  5014. ReleaseIntermediateOperand(reg);
  5015. END;
  5016. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5017. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5018. parametersSize := ParametersSize(system,procedureType,FALSE);
  5019. END;
  5020. ReleaseParameterRegisters();
  5021. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  5022. Emit(Call(position,operand.op,0));
  5023. ELSE
  5024. Emit(Call(position,operand.op,parametersSize));
  5025. END;
  5026. ReleaseOperand(operand);
  5027. IF procedureType.noReturn THEN
  5028. EmitTrap(position,NoReturnTrap);
  5029. END;
  5030. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5031. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5032. Emit(Result(position,return));
  5033. END;
  5034. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  5035. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  5036. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5037. END;
  5038. size := IntermediateCode.Immediate(addressType,parametersSize);
  5039. Emit(Add(position,sp,sp,size));
  5040. END;
  5041. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5042. IF structuredReturnType THEN
  5043. (* stack pointer rewinding done by callee
  5044. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5045. Emit(Add(position,sp,sp,size));
  5046. *)
  5047. RestoreRegisters(saved);
  5048. InitOperand(result,ModeReference);
  5049. Symbol(variable,result);
  5050. ELSE
  5051. RestoreRegisters(saved);
  5052. InitOperand(result,ModeValue);
  5053. result.op := return;
  5054. END;
  5055. END;
  5056. IF alignment > 1 THEN
  5057. Emit(Pop(position,sp));
  5058. END;
  5059. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5060. Emit(Pop(position, ap));
  5061. END;
  5062. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5063. ValueToCondition(result);
  5064. END;
  5065. destination := dest;
  5066. (* perform all write-back calls in the list *)
  5067. BackupGlobalState;
  5068. currentWriteBackCall := firstWriteBackCall;
  5069. WHILE currentWriteBackCall # NIL DO
  5070. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5071. currentWriteBackCall := currentWriteBackCall.next
  5072. END;
  5073. RestoreGlobalState;
  5074. (* TENATIVE *)
  5075. (*
  5076. IF isOperatorCall THEN
  5077. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5078. END;
  5079. *)
  5080. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5081. END VisitProcedureCallDesignator;
  5082. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5083. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5084. td: SyntaxTree.Symbol;
  5085. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5086. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5087. BEGIN
  5088. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5089. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5090. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5091. variable.SetType(system.anyType);
  5092. scope.AddVariable(variable);
  5093. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5094. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5095. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5096. typeDeclaration.SetScope(module.module.moduleScope);
  5097. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5098. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5099. END;
  5100. RETURN hiddenPointerType;
  5101. END GetHiddenPointerType;
  5102. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5103. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5104. BEGIN
  5105. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5106. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5107. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5108. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5109. scope.AddVariable(variable);
  5110. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5111. variable.SetType(system.anyType);
  5112. scope.AddVariable(variable);
  5113. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5114. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5115. typeDeclaration.SetDeclaredType(delegatePointerType);
  5116. typeDeclaration.SetScope(module.module.moduleScope);
  5117. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5118. delegatePointerType.SetState(SyntaxTree.Resolved);
  5119. END;
  5120. RETURN delegatePointerType
  5121. END GetDelegateType;
  5122. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5123. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5124. such as in VAR a: RECORD ... END;
  5125. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5126. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5127. *)
  5128. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5129. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5130. BEGIN (* no code emission *)
  5131. source := NIL;
  5132. x := x.resolved;
  5133. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5134. x := GetHiddenPointerType();
  5135. ELSIF IsDelegate(x) THEN
  5136. x := GetDelegateType();
  5137. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5138. ELSE HALT(200);
  5139. END;
  5140. td := x.typeDeclaration;
  5141. IF td = NIL THEN
  5142. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5143. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5144. ASSERT(td # NIL);
  5145. END;
  5146. IF newObjectFile THEN
  5147. GetCodeSectionNameForSymbol(td,name);
  5148. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5149. meta.CheckTypeDeclaration(x);
  5150. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5151. ELSE
  5152. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5153. END;
  5154. IF backend.cooperative OR meta.simple THEN
  5155. offset := 0;
  5156. ELSE
  5157. IF x IS SyntaxTree.CellType THEN
  5158. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5159. IF baseRecord = NIL THEN
  5160. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5161. ELSE
  5162. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5163. END;
  5164. ELSE
  5165. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5166. END;
  5167. END;
  5168. ELSE
  5169. offset := 0;
  5170. source := module.allSections.FindBySymbol(td); (*TODO*)
  5171. IF source = NIL THEN
  5172. null := 0;
  5173. GetCodeSectionNameForSymbol(td,name);
  5174. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5175. IntermediateCode.InitImmediate(op,addressType,0);
  5176. source(IntermediateCode.Section).Emit(Data(position,op));
  5177. source.SetReferenced(FALSE)
  5178. ELSE
  5179. name := source.name;
  5180. END;
  5181. END;
  5182. RETURN td
  5183. END GetBackendType;
  5184. BEGIN
  5185. (*td := t.typeDeclaration;*)
  5186. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5187. (*
  5188. IF t IS SyntaxTree.PointerType THEN
  5189. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5190. ELSE
  5191. source := GetBackendType(t);
  5192. END;
  5193. *)
  5194. IF newObjectFile THEN
  5195. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5196. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5197. IntermediateCode.SetOffset(res,offset);
  5198. ELSE
  5199. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5200. END;
  5201. (*
  5202. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5203. make memory should be used when tag is used, not earlier
  5204. *)
  5205. RETURN res
  5206. END TypeDescriptorAdr;
  5207. (*
  5208. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5209. VAR result: IntermediateCode.Operand;
  5210. BEGIN
  5211. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5212. operand.tag := TypeDescriptorAdr(operand.type);
  5213. IntermediateCode.MakeMemory(operand.tag,addressType);
  5214. UseIntermediateOperand(operand.tag);
  5215. END;
  5216. END MakeTypeTag;
  5217. *)
  5218. PROCEDURE ProfilerInit;
  5219. VAR reg: IntermediateCode.Operand;
  5220. BEGIN
  5221. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5222. Emit(Call(position,reg,0));
  5223. END ProfilerInit;
  5224. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5225. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5226. BEGIN
  5227. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5228. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5229. THEN
  5230. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5231. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5232. Emit(Push(position,reg));
  5233. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5234. Emit(Push(position,reg));
  5235. StaticCallOperand(result,procedure);
  5236. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5237. ReleaseOperand(result);
  5238. END;
  5239. END ProfilerEnterExit;
  5240. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5241. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5242. BEGIN
  5243. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5244. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5245. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5246. profileInit.Emit(Push(position,reg));
  5247. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5248. profileInit.Emit(Push(position,reg));
  5249. NEW(string, LEN(name)); COPY(name, string^);
  5250. sv := SyntaxTree.NewStringValue(-1,string);
  5251. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5252. sv.SetType(type);
  5253. Designate(sv,result);
  5254. profileInit.Emit(Push(position,result.tag));
  5255. profileInit.Emit(Push(position,result.op));
  5256. StaticCallOperand(result,procedure);
  5257. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5258. ReleaseOperand(result);
  5259. END;
  5260. END ProfilerAddProcedure;
  5261. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5262. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5263. BEGIN
  5264. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5265. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5266. profileInit.Emit(Push(position,reg));
  5267. profileInitPatchPosition := profileInit.pc;
  5268. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5269. NEW(string, LEN(name)); COPY(name, string^);
  5270. sv := SyntaxTree.NewStringValue(-1,string);
  5271. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5272. sv.SetType(type);
  5273. Designate(sv,result);
  5274. profileInit.Emit(Push(position,result.tag));
  5275. profileInit.Emit(Push(position,result.op));
  5276. StaticCallOperand(result,procedure);
  5277. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5278. ReleaseOperand(result);
  5279. END;
  5280. END ProfilerAddModule;
  5281. PROCEDURE ProfilerPatchInit;
  5282. VAR reg: IntermediateCode.Operand;
  5283. BEGIN
  5284. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5285. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5286. EmitLeave(profileInit,position,0);
  5287. profileInit.Emit(Exit(position,0,0));
  5288. END ProfilerPatchInit;
  5289. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5290. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5291. VAR
  5292. id: LONGINT;
  5293. leftType, rightType: SyntaxTree.Type;
  5294. procedureType: SyntaxTree.ProcedureType;
  5295. runtimeProcedure: SyntaxTree.Procedure;
  5296. runtimeProcedureOperand, operatorOperand: Operand;
  5297. kind: SET;
  5298. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5299. VAR
  5300. arg: IntermediateCode.Operand;
  5301. recordType: SyntaxTree.RecordType;
  5302. fingerPrint: SyntaxTree.FingerPrint;
  5303. BEGIN
  5304. IF type = NIL THEN
  5305. (* no type: push 'NoType' *)
  5306. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5307. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5308. ELSIF IsStrictlyPointerToRecord(type) THEN
  5309. (* pointer to record type: push typetag *)
  5310. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5311. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5312. arg := TypeDescriptorAdr(recordType);
  5313. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5314. ELSE
  5315. (* non-pointer to record type: push fingerprint *)
  5316. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5317. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5318. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5319. END;
  5320. operatorInitializationCodeSection.Emit(Push(position,arg))
  5321. END PushTypeInfo;
  5322. BEGIN
  5323. ASSERT(operatorInitializationCodeSection # NIL);
  5324. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5325. procedureType := operator.type(SyntaxTree.ProcedureType);
  5326. (* determine types *)
  5327. leftType := procedureType.firstParameter.type;
  5328. IF procedureType.numberParameters = 2 THEN
  5329. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5330. rightType := procedureType.firstParameter.nextParameter.type;
  5331. ELSE
  5332. rightType := NIL
  5333. END;
  5334. (* determine operator kind *)
  5335. IF IsStrictlyPointerToRecord(leftType) THEN
  5336. kind := {LhsIsPointer}
  5337. ELSE
  5338. kind := {}
  5339. END;
  5340. IF IsStrictlyPointerToRecord(rightType) THEN
  5341. kind := kind + {RhsIsPointer}
  5342. END;
  5343. IF kind # {} THEN (* TODO: to be removed later on *)
  5344. (* at least one of the types is a pointer to record *)
  5345. (* emit a code that registers this specific operator in the runtime *)
  5346. dump := operatorInitializationCodeSection.comments;
  5347. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5348. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5349. (* push ID *)
  5350. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5351. id := Global.GetSymbol(module.module.case, operator.name);
  5352. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5353. (* push kind *)
  5354. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5355. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5356. (* push type infos *)
  5357. PushTypeInfo(leftType);
  5358. PushTypeInfo(rightType);
  5359. (* push operator address *)
  5360. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5361. StaticCallOperand(operatorOperand, operator);
  5362. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5363. ReleaseOperand(operatorOperand);
  5364. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5365. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5366. ReleaseOperand(runtimeProcedureOperand)
  5367. END
  5368. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5369. END
  5370. END RegisterDynamicOperator;
  5371. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5372. VAR
  5373. traceModule: SyntaxTree.Module;
  5374. procedure: SyntaxTree.Procedure;
  5375. procedureVariable: SyntaxTree.Variable;
  5376. s,msg: Basic.MessageString;
  5377. res: Operand;
  5378. i: LONGINT;
  5379. sv: SyntaxTree.StringValue;
  5380. type: SyntaxTree.Type;
  5381. recordType: SyntaxTree.RecordType;
  5382. printout: Printout.Printer;
  5383. stringWriter: Streams.StringWriter;
  5384. expression: SyntaxTree.Expression;
  5385. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5386. BEGIN
  5387. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5388. IF procedure = NIL THEN
  5389. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5390. END;
  5391. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5392. s := "procedure ";
  5393. Strings.Append(s,backend.traceModuleName);
  5394. Strings.Append(s,".");
  5395. Strings.Append(s,procedureName);
  5396. Strings.Append(s," not present");
  5397. Error(position,s);
  5398. RETURN FALSE
  5399. ELSE
  5400. RETURN TRUE
  5401. END;
  5402. END GetProcedure;
  5403. PROCEDURE CallProcedure;
  5404. VAR size: LONGINT;
  5405. BEGIN
  5406. IF procedure # NIL THEN
  5407. StaticCallOperand(result,procedure);
  5408. size := ProcedureParametersSize(system,procedure);
  5409. ELSE
  5410. Symbol(procedureVariable, result);
  5411. LoadValue(result, procedureVariable.type.resolved);
  5412. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5413. END;
  5414. Emit(Call(position,result.op,size));
  5415. END CallProcedure;
  5416. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5417. VAR res: Operand; string: SyntaxTree.String;
  5418. BEGIN
  5419. IF GetProcedure("String") THEN
  5420. NEW(string, LEN(s)); COPY(s, string^);
  5421. sv := SyntaxTree.NewStringValue(-1,string);
  5422. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5423. sv.SetType(type);
  5424. Designate(sv,res);
  5425. Emit(Push(position,res.tag));
  5426. Emit(Push(position,res.op));
  5427. ReleaseOperand(res);
  5428. CallProcedure;
  5429. END;
  5430. END String;
  5431. PROCEDURE Integer(op: IntermediateCode.Operand);
  5432. BEGIN
  5433. IF GetProcedure("Int") THEN
  5434. Emit(Push(position,op));
  5435. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5436. CallProcedure;
  5437. END;
  5438. END Integer;
  5439. PROCEDURE Float(op: IntermediateCode.Operand);
  5440. BEGIN
  5441. IF GetProcedure("HIntHex") THEN
  5442. Emit(Push(position,op));
  5443. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5444. CallProcedure;
  5445. END;
  5446. END Float;
  5447. PROCEDURE Set(op: IntermediateCode.Operand);
  5448. BEGIN
  5449. IF GetProcedure("Set") THEN
  5450. Emit(Push(position,op));
  5451. (*
  5452. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5453. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5454. *)
  5455. CallProcedure;
  5456. END;
  5457. END Set;
  5458. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5459. BEGIN
  5460. IF GetProcedure("Boolean") THEN
  5461. Emit(Push(position,op));
  5462. CallProcedure;
  5463. END;
  5464. END Boolean;
  5465. PROCEDURE Char(op: IntermediateCode.Operand);
  5466. BEGIN
  5467. IF GetProcedure("Char") THEN
  5468. Emit(Push(position,op));
  5469. CallProcedure;
  5470. END;
  5471. END Char;
  5472. PROCEDURE Address(op: IntermediateCode.Operand);
  5473. BEGIN
  5474. IF GetProcedure("Address") THEN
  5475. Emit(Push(position,op));
  5476. CallProcedure;
  5477. END;
  5478. END Address;
  5479. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5480. BEGIN
  5481. IF GetProcedure("String") THEN
  5482. Emit(Push(position,tag));
  5483. Emit(Push(position,op));
  5484. CallProcedure;
  5485. END;
  5486. END StringOperand;
  5487. PROCEDURE Ln;
  5488. BEGIN
  5489. IF GetProcedure("Ln") THEN
  5490. CallProcedure;
  5491. END;
  5492. END Ln;
  5493. BEGIN
  5494. IF backend.traceModuleName = "" THEN RETURN END;
  5495. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5496. IF GetProcedure("Enter") THEN
  5497. CallProcedure
  5498. END;
  5499. NEW(stringWriter,LEN(s));
  5500. FOR i := 0 TO x.Length()-1 DO
  5501. msg := "";
  5502. expression := x.GetExpression(i);
  5503. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5504. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5505. ELSE
  5506. Global.GetModuleName(module.module, s);
  5507. END;
  5508. IF i = 0 THEN
  5509. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5510. stringWriter.String(":");
  5511. END;
  5512. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5513. IF ~(expression IS SyntaxTree.StringValue) THEN
  5514. printout.Expression(expression);
  5515. stringWriter.Get(s);
  5516. Strings.Append(msg,s);
  5517. Strings.Append(msg,"= ");
  5518. ELSE stringWriter.Get(s); (* remove from string writer *)
  5519. Strings.Append(msg, s);
  5520. END;
  5521. String(msg);
  5522. IF SemanticChecker.IsStringType(expression.type) THEN
  5523. Designate(expression,res);
  5524. StringOperand(res.op,res.tag);
  5525. ELSE
  5526. Evaluate(expression,res);
  5527. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5528. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5529. Convert(res.op,int64);
  5530. END;
  5531. Integer(res.op);
  5532. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5533. Boolean(res.op);
  5534. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5535. Set(res.op);
  5536. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5537. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5538. Convert(res.op,float64);
  5539. END;
  5540. Float(res.op);
  5541. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5542. Char(res.op);
  5543. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5544. Address(res.op);String("H");
  5545. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5546. Address(res.op);String("H");
  5547. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5548. Address(res.op);String("H");
  5549. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5550. Address(res.op);String("H");
  5551. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5552. String("NIL");
  5553. ELSE HALT(200);
  5554. END;
  5555. END;
  5556. ReleaseOperand(res);
  5557. String("; ");
  5558. END;
  5559. IF GetProcedure("Exit") THEN
  5560. CallProcedure
  5561. ELSE
  5562. Ln;
  5563. END;
  5564. END;
  5565. END SystemTrace;
  5566. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5567. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5568. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5569. BEGIN
  5570. type := type.resolved;
  5571. IF type IS SyntaxTree.RecordType THEN
  5572. WITH type: SyntaxTree.RecordType DO
  5573. baseType := type.baseType;
  5574. IF baseType # NIL THEN
  5575. baseType := baseType.resolved;
  5576. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5577. InitFields(baseType,adr,offset);
  5578. END;
  5579. variable := type.recordScope.firstVariable;
  5580. WHILE variable # NIL DO
  5581. IF variable.initializer # NIL THEN
  5582. Evaluate(variable.initializer,initializerOp);
  5583. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5584. Emit(Mov(position,mem,initializerOp.op));
  5585. ReleaseOperand(initializerOp);
  5586. ReleaseIntermediateOperand(mem);
  5587. END;
  5588. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5589. variable := variable.nextVariable
  5590. END;
  5591. END;
  5592. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5593. WITH type: SyntaxTree.ArrayType DO
  5594. IF type.form = SyntaxTree.Static THEN
  5595. baseType := type.arrayBase;
  5596. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5597. FOR i := 0 TO type.staticLength-1 DO
  5598. InitFields(baseType,adr,offset+i*size);
  5599. END;
  5600. END;
  5601. END;
  5602. ELSIF type IS SyntaxTree.MathArrayType THEN
  5603. WITH type: SyntaxTree.MathArrayType DO
  5604. IF type.form = SyntaxTree.Open THEN
  5605. dim := DynamicDim(type);
  5606. imm := IntermediateCode.Immediate(addressType,dim);
  5607. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5608. baseType := SemanticChecker.ArrayBase(type,dim);
  5609. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5610. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5611. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5612. ReleaseIntermediateOperand(imm);
  5613. (* flags remain empty (=0) for open array *)
  5614. ELSIF type.form = SyntaxTree.Static THEN
  5615. baseType := type.arrayBase;
  5616. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5617. ASSERT(type.staticLength < 1024*1024*1024);
  5618. FOR i := 0 TO type.staticLength-1 DO
  5619. InitFields(baseType,adr,offset+i*size);
  5620. END;
  5621. END;
  5622. END;
  5623. END;
  5624. END InitFields;
  5625. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5626. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5627. BEGIN
  5628. type := variable.type.resolved;
  5629. IF (type IS SyntaxTree.MathArrayType) THEN
  5630. WITH type: SyntaxTree.MathArrayType DO
  5631. IF type.form = SyntaxTree.Open THEN
  5632. Symbol(variable,operand);
  5633. InitFields(type, operand.tag,0);
  5634. ELSIF type.form = SyntaxTree.Tensor THEN
  5635. Symbol(variable, operand);
  5636. MakeMemory(tmp,operand.op,addressType,0);
  5637. ReleaseOperand(operand);
  5638. Emit(Mov(position,tmp, nil ) );
  5639. ReleaseIntermediateOperand(tmp);
  5640. END;
  5641. END;
  5642. ELSE
  5643. Symbol(variable,operand);
  5644. IF variable.initializer # NIL THEN
  5645. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5646. reference.SetType(variable.type.resolved);
  5647. reference.SetAssignable(TRUE);
  5648. Assign(reference,variable.initializer);
  5649. END;
  5650. InitFields(type, operand.op,0);
  5651. ReleaseOperand(operand);
  5652. END;
  5653. END InitVariable;
  5654. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5655. VAR end: Label;
  5656. BEGIN
  5657. IF type.form = SyntaxTree.Tensor THEN
  5658. InitOperand(result,ModeValue);
  5659. ReuseCopy(result.op,base);
  5660. end := NewLabel();
  5661. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5662. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5663. SetLabel(end);
  5664. Convert(result.op,int32);
  5665. ELSE
  5666. InitOperand(result,ModeValue);
  5667. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5668. END
  5669. END MathArrayDim;
  5670. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5671. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5672. BEGIN
  5673. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5674. MakeMemory(mem,base,addressType,offset);
  5675. Emit(Mov(position,mem,value));
  5676. ReleaseIntermediateOperand(mem);
  5677. END PutMathArrayField;
  5678. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5679. VAR mem: IntermediateCode.Operand;
  5680. BEGIN
  5681. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5682. MakeMemory(mem,base,addressType,offset);
  5683. Emit(Mov(position,mem,value));
  5684. ReleaseIntermediateOperand(mem);
  5685. END PutMathArrayFieldOffset;
  5686. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5687. BEGIN
  5688. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5689. MakeMemory(value,base,addressType,offset);
  5690. END GetMathArrayField;
  5691. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5692. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5693. BEGIN
  5694. IF incr THEN
  5695. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5696. ELSE
  5697. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5698. END;
  5699. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5700. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5701. ELSE
  5702. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5703. Emit(Mov(position,reg,dim));
  5704. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5705. Emit(Add(position,reg,reg,base));
  5706. MakeMemory(mem, reg, addressType, offset);
  5707. ReleaseIntermediateOperand(reg);
  5708. Emit(Mov(position,mem,value));
  5709. ReleaseIntermediateOperand(mem);
  5710. END;
  5711. END PutMathArrayLenOrIncr;
  5712. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5713. BEGIN
  5714. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5715. END PutMathArrayLength;
  5716. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5717. BEGIN
  5718. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5719. END PutMathArrayIncrement;
  5720. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5721. BEGIN
  5722. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5723. END GetMathArrayIncrement;
  5724. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5725. BEGIN
  5726. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5727. END GetMathArrayLength;
  5728. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5729. VAR dimOp: IntermediateCode.Operand;
  5730. BEGIN
  5731. dimOp := IntermediateCode.Immediate(int32, dim);
  5732. GetMathArrayLength(type, operand, dimOp, check, result);
  5733. END GetMathArrayLengthAt;
  5734. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5735. VAR dimOp: IntermediateCode.Operand;
  5736. BEGIN
  5737. dimOp := IntermediateCode.Immediate(int32, dim);
  5738. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5739. END GetMathArrayIncrementAt;
  5740. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5741. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5742. offset: LONGINT;
  5743. BEGIN
  5744. IF increment THEN
  5745. offset := MathIncrOffset;
  5746. ELSE
  5747. offset := MathLenOffset;
  5748. END;
  5749. INC(offset,operand.dimOffset*2);
  5750. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5751. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5752. END;
  5753. (* static dimension *)
  5754. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5755. IF check & (type.form = SyntaxTree.Tensor) THEN
  5756. DimensionCheck(operand.tag,dim,BrltL);
  5757. END;
  5758. val := SHORT(dim.intValue);
  5759. IF type.form # SyntaxTree.Tensor THEN
  5760. t := SemanticChecker.ArrayBase(type,val);
  5761. type := t.resolved(SyntaxTree.MathArrayType);
  5762. IF type.form = SyntaxTree.Static THEN
  5763. IF increment THEN
  5764. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5765. ELSE
  5766. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5767. END;
  5768. InitOperand(result,ModeValue);
  5769. result.op := res;
  5770. RETURN;
  5771. END;
  5772. END;
  5773. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5774. MakeMemory(res,operand.tag,addressType,offset);
  5775. (*
  5776. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5777. *)
  5778. InitOperand(result,ModeValue);
  5779. result.op := res;
  5780. ELSE
  5781. Convert(dim,addressType);
  5782. IF check THEN
  5783. IF type.form = SyntaxTree.Tensor THEN
  5784. DimensionCheck(operand.tag,dim,BrltL);
  5785. ELSIF isUnchecked THEN (* do nothing *)
  5786. ELSE
  5787. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5788. END;
  5789. END;
  5790. end := NewLabel(); next := NIL;
  5791. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5792. Emit(Mov(position,res,dim));
  5793. Convert(res,int32);
  5794. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5795. WHILE t IS SyntaxTree.MathArrayType DO
  5796. type := t(SyntaxTree.MathArrayType);
  5797. IF type.form = SyntaxTree.Static THEN
  5798. imm := IntermediateCode.Immediate(int32,val);
  5799. next := NewLabel();
  5800. BrneL(next,imm,res);
  5801. IF increment THEN
  5802. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5803. ELSE
  5804. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5805. END;
  5806. Emit(MovReplace(position,res,imm));
  5807. BrL(end);
  5808. ELSE hasDynamicPart := TRUE;
  5809. END;
  5810. t := type.arrayBase.resolved;
  5811. val := val + 1;
  5812. IF next # NIL THEN SetLabel(next) END;
  5813. END;
  5814. IF hasDynamicPart THEN
  5815. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5816. Emit(Mov(position,res2,dim));
  5817. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5818. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5819. Emit(Add(position,res2,res2,imm));
  5820. Emit(Add(position,res2,res2,operand.tag));
  5821. IntermediateCode.MakeMemory(res2,int32);
  5822. Emit(MovReplace(position,res,res2));
  5823. ReleaseIntermediateOperand(res2);
  5824. END;
  5825. SetLabel(end);
  5826. Convert(res,int32);
  5827. InitOperand(result,ModeValue);
  5828. result.op := res;
  5829. END;
  5830. END MathArrayLenOrIncr;
  5831. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5832. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5833. offset: LONGINT;
  5834. BEGIN
  5835. offset := operand.dimOffset+DynamicDim(type)-1;
  5836. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5837. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5838. val := SHORT(dim.intValue);
  5839. t := SemanticChecker.ArrayBase(type,val);
  5840. type := t.resolved(SyntaxTree.ArrayType);
  5841. IF type.form = SyntaxTree.Static THEN
  5842. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5843. ELSE
  5844. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5845. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5846. END;
  5847. UseIntermediateOperand(res);
  5848. InitOperand(result,ModeValue);
  5849. result.op := res;
  5850. ELSE
  5851. Convert(dim,addressType);
  5852. IF ~isUnchecked THEN
  5853. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5854. END;
  5855. end := NewLabel(); next := NIL;
  5856. (* ReuseCopy(dim,res); *)
  5857. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5858. Emit(Mov(position,res,dim));
  5859. Convert(res,int32);
  5860. Convert(res,int32);
  5861. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5862. WHILE t IS SyntaxTree.ArrayType DO
  5863. type := t(SyntaxTree.ArrayType);
  5864. IF type.form = SyntaxTree.Static THEN
  5865. imm := IntermediateCode.Immediate(int32,val);
  5866. next := NewLabel();
  5867. BrneL(next,imm,res);
  5868. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5869. Emit(MovReplace(position,res,imm));
  5870. BrL(end);
  5871. ELSE hasDynamicPart := TRUE;
  5872. END;
  5873. t := type.arrayBase.resolved;
  5874. val := val + 1;
  5875. IF next # NIL THEN SetLabel(next) END;
  5876. END;
  5877. IF hasDynamicPart THEN
  5878. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  5879. Convert(res2,addressType);
  5880. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  5881. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5882. Emit(Sub(position,res2,imm,res2));
  5883. Emit(Add(position,res2,res2,operand.tag));
  5884. IntermediateCode.MakeMemory(res2,int32);
  5885. Emit(MovReplace(position,res,res2));
  5886. ReleaseIntermediateOperand(res2);
  5887. END;
  5888. SetLabel(end);
  5889. Convert(res,int32);
  5890. InitOperand(result,ModeValue);
  5891. result.op := res;
  5892. END;
  5893. END ArrayLen;
  5894. (**
  5895. create a temporary variable in current scope
  5896. **)
  5897. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  5898. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  5899. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  5900. BEGIN
  5901. IF ~register THEN
  5902. variable := temporaries.GetFreeVariable(type, index);
  5903. ELSE
  5904. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  5905. END;
  5906. scope := currentScope;
  5907. IF variable = NIL THEN
  5908. COPY("@hiddenIRVar",string);
  5909. Basic.AppendNumber(string,index);
  5910. name := SyntaxTree.NewIdentifier(string);
  5911. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  5912. variable.SetType(type);
  5913. variable.SetAccess(SyntaxTree.Hidden);
  5914. IF ~register THEN
  5915. temporaries.AddVariable(variable);
  5916. IF scope.lastVariable # NIL THEN
  5917. offset := scope.lastVariable.offsetInBits;
  5918. ELSE
  5919. offset := 0;
  5920. END;
  5921. DEC(offset,system.SizeOf(variable.type));
  5922. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  5923. variable(SyntaxTree.Variable).SetOffset(offset);
  5924. scope.AddVariable(variable(SyntaxTree.Variable));
  5925. scope.EnterSymbol(variable, duplicate);
  5926. ASSERT(~duplicate);
  5927. InitVariable(variable(SyntaxTree.Variable));
  5928. ELSE
  5929. variable.SetUseRegister(TRUE);
  5930. variable(SyntaxTree.Variable).SetOffset(0);
  5931. END;
  5932. ELSE
  5933. InitVariable(variable(SyntaxTree.Variable));
  5934. (*
  5935. ASSERT(variable.type.resolved = type.resolved)
  5936. *)
  5937. END;
  5938. RETURN variable(SyntaxTree.Variable)
  5939. END GetTemporaryVariable;
  5940. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  5941. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  5942. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  5943. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  5944. i: LONGINT; duplicate: BOOLEAN;
  5945. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  5946. VAR variable: SyntaxTree.Variable;
  5947. BEGIN
  5948. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  5949. variable.SetType(type);
  5950. recordScope.AddVariable(variable);
  5951. END AddVariable;
  5952. BEGIN
  5953. name := "@ArrayDescriptor";
  5954. Basic.AppendNumber(name,dimensions);
  5955. identifier := SyntaxTree.NewIdentifier(name);
  5956. parentScope := module.module.moduleScope;
  5957. symbol := parentScope.FindSymbol(identifier);
  5958. IF symbol # NIL THEN
  5959. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  5960. type := typeDeclaration.declaredType;
  5961. ELSE
  5962. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  5963. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  5964. recordScope := SyntaxTree.NewRecordScope(parentScope);
  5965. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  5966. recordType.SetTypeDeclaration(typeDeclaration);
  5967. recordType.SetState(SyntaxTree.Resolved);
  5968. typeDeclaration.SetDeclaredType(recordType);
  5969. AddVariable("@ptr",system.anyType);
  5970. AddVariable("@adr",system.addressType);
  5971. AddVariable("@flags",system.addressType);
  5972. AddVariable("@dim",system.addressType);
  5973. AddVariable("@elementSize",system.addressType);
  5974. FOR i := 0 TO dimensions-1 DO
  5975. name := "@len";
  5976. Basic.AppendNumber(name,i);
  5977. AddVariable(name,system.addressType);
  5978. name := "@incr";
  5979. Basic.AppendNumber(name,i);
  5980. AddVariable(name,system.addressType);
  5981. END;
  5982. parentScope.AddTypeDeclaration(typeDeclaration);
  5983. parentScope.EnterSymbol(typeDeclaration,duplicate);
  5984. ASSERT(~duplicate);
  5985. type := recordType;
  5986. END;
  5987. RETURN type
  5988. END GetMathArrayDescriptorType;
  5989. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  5990. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  5991. BEGIN
  5992. type := GetMathArrayDescriptorType(dimensions);
  5993. Emit(Push(position,op.op));
  5994. (* push type descriptor *)
  5995. reg := TypeDescriptorAdr(type);
  5996. IF ~newObjectFile THEN
  5997. IntermediateCode.MakeMemory(reg,addressType);
  5998. END;
  5999. Emit(Push(position,reg));
  6000. ReleaseIntermediateOperand(reg);
  6001. (* push realtime flag: false by default *)
  6002. Emit(Push(position,false));
  6003. CallThis(position,"Heaps","NewRec",3);
  6004. END NewMathArrayDescriptor;
  6005. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6006. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6007. BEGIN
  6008. NEW(string, LEN(s)); COPY(s, string^);
  6009. sv := SyntaxTree.NewStringValue(-1,string);
  6010. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6011. sv.SetType(type);
  6012. Designate(sv,res);
  6013. Emit(Push(position,res.tag));
  6014. Emit(Push(position,res.op));
  6015. ReleaseOperand(res);
  6016. END PushConstString;
  6017. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6018. BEGIN
  6019. IF b THEN
  6020. Emit(Push(-1, true));
  6021. ELSE
  6022. Emit(Push(-1, false));
  6023. END;
  6024. END PushConstBoolean;
  6025. PROCEDURE PushConstSet(v: SET);
  6026. VAR value: SyntaxTree.Value; op: Operand;
  6027. BEGIN
  6028. value := SyntaxTree.NewSetValue(-1, v);
  6029. value.SetType(system.setType);
  6030. Evaluate(value, op);
  6031. Emit(Push(-1, op.op));
  6032. ReleaseOperand(op);
  6033. END PushConstSet;
  6034. PROCEDURE PushConstInteger(v: LONGINT);
  6035. VAR value: SyntaxTree.Value; op: Operand;
  6036. BEGIN
  6037. value := SyntaxTree.NewIntegerValue(-1, v);
  6038. value.SetType(system.longintType);
  6039. Evaluate(value, op);
  6040. Emit(Push(-1, op.op));
  6041. ReleaseOperand(op);
  6042. END PushConstInteger;
  6043. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6044. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6045. section: IntermediateCode.Section;
  6046. BEGIN
  6047. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6048. Global.GetSymbolSegmentedName(symbol, name);
  6049. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6050. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6051. procedure.SetScope(moduleScope);
  6052. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6053. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6054. procedure.SetAccess(SyntaxTree.Hidden);
  6055. currentScope := procedureScope;
  6056. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6057. EmitEnter(section, -1,NIL,0,0,0);
  6058. RETURN section;
  6059. END OpenInitializer;
  6060. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6061. BEGIN
  6062. EmitLeave(section, 0, 0 );
  6063. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6064. section := prev;
  6065. END CloseInitializer;
  6066. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6067. VAR name: SyntaxTree.IdentifierString;
  6068. variable: SyntaxTree.Variable;
  6069. type: SyntaxTree.Type;
  6070. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6071. BEGIN
  6072. InitOperand(op,ModeReference);
  6073. op.op := fp;
  6074. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6075. Dereference(op, x, FALSE);
  6076. result := op;
  6077. Symbol(symbol, op);
  6078. END Field;
  6079. PROCEDURE Direction(direction: LONGINT): SET;
  6080. BEGIN
  6081. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6082. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6083. ELSE HALT(100);
  6084. END;
  6085. END Direction;
  6086. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6087. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6088. BEGIN
  6089. Field(port, op);
  6090. ToMemory(op.op,addressType,0);
  6091. Emit(Push(-1, op.op));
  6092. ReleaseOperand(op);
  6093. Basic.GetString(modifier.identifier, name);
  6094. PushConstString(name);
  6095. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6096. ASSERT(SemanticChecker.IsStringType(value.type));
  6097. Designate(value, op);
  6098. Emit(Push(modifier.position, op.tag));
  6099. Emit(Push(modifier.position, op.op));
  6100. ReleaseOperand(op);
  6101. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6102. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6103. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6104. Evaluate(value, op);
  6105. Emit(Push(modifier.position, op.op));
  6106. ReleaseOperand(op);
  6107. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6108. ELSE
  6109. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6110. END;
  6111. END AddPortProperty;
  6112. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6113. VAR modifier: SyntaxTree.Modifier;
  6114. BEGIN
  6115. modifier := variable.modifiers;
  6116. WHILE modifier # NIL DO
  6117. AddPortProperty(variable,modifier, modifier.expression);
  6118. modifier := modifier.nextModifier;
  6119. END;
  6120. END AddPortProperties;
  6121. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6122. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6123. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6124. PROCEDURE PushLens(type: SyntaxTree.Type);
  6125. BEGIN
  6126. IF IsSemiDynamicArray(type) THEN
  6127. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6128. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6129. Emit(Push(-1, op.op));
  6130. ReleaseOperand(op);
  6131. INC(dim);
  6132. ELSIF IsStaticArray(type) THEN
  6133. len := len * type(SyntaxTree.ArrayType).staticLength;
  6134. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6135. INC(dim);
  6136. ELSE
  6137. baseType := type;
  6138. END;
  6139. END PushLens;
  6140. BEGIN
  6141. (* cell *)
  6142. IF variable.type IS SyntaxTree.ArrayType THEN
  6143. type := variable.type;
  6144. dim := 0;
  6145. len := 1;
  6146. PushLens(type);
  6147. portType := baseType.resolved(SyntaxTree.PortType);
  6148. ELSE
  6149. portType := variable.type(SyntaxTree.PortType);
  6150. END;
  6151. PushSelfPointer();
  6152. (* port / array of ports *)
  6153. IF IsStaticArray(type) THEN
  6154. PushConstInteger(len);
  6155. END;
  6156. Field(variable, op);
  6157. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6158. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6159. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6160. Designate(d, op);*)
  6161. Emit(Push(-1, op.op));
  6162. ReleaseOperand(op);
  6163. (* name *)
  6164. PushConstString(name);
  6165. (* inout *)
  6166. PushConstSet(Direction(portType.direction));
  6167. (* width *)
  6168. PushConstInteger(portType.sizeInBits);
  6169. IF variable.type IS SyntaxTree.PortType THEN
  6170. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6171. AddPortProperties(variable);
  6172. ELSIF IsStaticArray(type)THEN
  6173. CallThis(variable.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6174. ELSIF IsSemiDynamicArray(type) THEN
  6175. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6176. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6177. Emit(Add(position,reg, sp, size));
  6178. (* dim *)
  6179. PushConstInteger(dim);
  6180. (* len array *)
  6181. Emit(Push(position, reg));
  6182. ReleaseIntermediateOperand(reg);
  6183. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6184. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6185. Emit(Add(position, sp,sp, size));
  6186. ELSE
  6187. HALT(100);
  6188. END;
  6189. END Variable;
  6190. BEGIN
  6191. IF backend.cellsAreObjects THEN
  6192. variable := x.cellScope.firstVariable;
  6193. WHILE (variable # NIL) DO
  6194. type := variable.type.resolved;
  6195. WHILE (type IS SyntaxTree.ArrayType) DO
  6196. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6197. END;
  6198. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6199. Global.GetSymbolNameInScope(variable,x.cellScope,name);
  6200. Variable(name,variable);
  6201. END;
  6202. variable := variable.nextVariable;
  6203. END;
  6204. ELSE HALT(200)
  6205. END;
  6206. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6207. (*
  6208. x.typeDeclaration.GetName(componentName);
  6209. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6210. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6211. instanceType.SetDataMemorySize(dataMemorySize);
  6212. END;
  6213. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6214. instanceType.SetInstructionMemorySize(codeMemorySize)
  6215. END;
  6216. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6217. instanceType.AddCapability(ActiveCells.VectorCapability)
  6218. END;
  6219. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6220. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6221. END;
  6222. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6223. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6224. END;
  6225. AddDevices(instanceType, x);
  6226. *)
  6227. (*
  6228. IF x.isCellNet THEN
  6229. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6230. END;
  6231. *)
  6232. (*currentActiveCellsScope := instanceType;*)
  6233. (*
  6234. parameter := x.firstParameter;
  6235. portIndex := 0;
  6236. WHILE parameter # NIL DO
  6237. parameter.GetName(parameterName);
  6238. parameterType := parameter.type.resolved;
  6239. Parameter(parameterName, parameterType);
  6240. (*
  6241. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6242. ParameterArray(parameterType);
  6243. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6244. FOR i := 0 TO len-1 DO
  6245. COPY(parameterName,name);
  6246. AppendIndex(name,i);
  6247. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6248. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6249. INC(portIndex);
  6250. END;
  6251. ELSE
  6252. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6253. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6254. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6255. INC(portIndex);
  6256. END;
  6257. *)
  6258. parameter := parameter.nextParameter;
  6259. END;
  6260. *)
  6261. (*
  6262. Scope(x.cellScope);
  6263. currentActiveCellsScope := prevActiveCellsScope;
  6264. AddModules(instanceType,x.cellScope);
  6265. *)
  6266. END AddPorts;
  6267. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6268. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6269. BEGIN
  6270. Symbol(cell,op);
  6271. ToMemory(op.op,addressType,0);
  6272. Emit(Push(position,op.op));
  6273. ReleaseOperand(op);
  6274. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6275. PushConstString(name);
  6276. IF SemanticChecker.IsStringType(property.type) OR (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6277. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6278. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6279. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6280. Designate(d, op);
  6281. IF SemanticChecker.IsStringType(property.type) THEN
  6282. Emit(Push(-1, op.tag))
  6283. END;
  6284. Emit(Push(-1, op.op));
  6285. ReleaseOperand(op);
  6286. END;
  6287. IF SemanticChecker.IsStringType(property.type) THEN
  6288. ASSERT(SemanticChecker.IsStringType(value.type));
  6289. Designate(value, op);
  6290. Emit(Push(property.position, op.tag));
  6291. Emit(Push(property.position, op.op));
  6292. ReleaseOperand(op);
  6293. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6294. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6295. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6296. Evaluate(value, op);
  6297. Emit(Push(property.position, op.op));
  6298. ReleaseOperand(op);
  6299. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6300. ELSE
  6301. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6302. END;
  6303. END AddProperty;
  6304. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6305. VAR symbol: SyntaxTree.Symbol;
  6306. BEGIN
  6307. WHILE modifier # NIL DO
  6308. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6309. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6310. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6311. ELSE
  6312. (*! move this check to checker *)
  6313. Error(modifier.position, "undefined property");
  6314. END;
  6315. modifier := modifier.nextModifier;
  6316. END;
  6317. END AddModifiers;
  6318. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6319. VAR last: SyntaxTree.Modifier;
  6320. BEGIN
  6321. IF to = NIL THEN
  6322. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6323. ELSE
  6324. last := to;
  6325. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6326. last := last.nextModifier;
  6327. END;
  6328. IF last.identifier # this.identifier THEN
  6329. ASSERT(last.nextModifier = NIL);
  6330. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6331. END;
  6332. END;
  6333. END AppendModifier;
  6334. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6335. BEGIN
  6336. WHILE this # NIL DO
  6337. AppendModifier(to, this);
  6338. this := this.nextModifier;
  6339. END;
  6340. END AppendModifiers;
  6341. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6342. VAR op: Operand;
  6343. BEGIN
  6344. Evaluate(p, op);
  6345. Emit(Push(p.position, op.op));
  6346. ReleaseOperand(op);
  6347. (*
  6348. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6349. p := p(SyntaxTree.Designator).left;
  6350. END;
  6351. IF p # NIL THEN
  6352. Evaluate(p, op);
  6353. Emit(Push(p.position, op.op));
  6354. ReleaseOperand(op);
  6355. ELSE
  6356. Emit(Push(-1, nil));
  6357. END;
  6358. *)
  6359. END PushPort;
  6360. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6361. VAR
  6362. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6363. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6364. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6365. tmp:IntermediateCode.Operand;
  6366. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6367. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6368. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6369. dest: IntermediateCode.Operand;
  6370. staticLength: LONGINT; itype: IntermediateCode.Type;
  6371. convert,isTensor: BOOLEAN;
  6372. recordType: SyntaxTree.RecordType;
  6373. baseType: SyntaxTree.Type;
  6374. flags: SET;
  6375. left: SyntaxTree.Expression;
  6376. call: SyntaxTree.Designator;
  6377. procedure: SyntaxTree.Procedure;
  6378. temporaryVariable: SyntaxTree.Variable;
  6379. dummy: IntermediateCode.Operand;
  6380. customBuiltin: SyntaxTree.CustomBuiltin;
  6381. isVarPar: ARRAY 3 OF BOOLEAN;
  6382. callsection: Sections.Section;
  6383. segmentedName: Basic.SegmentedName;
  6384. needsTrace: BOOLEAN;
  6385. n: ARRAY 256 OF CHAR;
  6386. modifier: SyntaxTree.Modifier;
  6387. previous, init: IntermediateCode.Section;
  6388. prevScope: SyntaxTree.Scope;
  6389. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6390. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6391. priority: IntermediateCode.Operand;
  6392. op,callop: Operand;
  6393. BEGIN
  6394. IF type = NIL THEN RETURN END;
  6395. type := type.resolved;
  6396. IF type IS SyntaxTree.PointerType THEN
  6397. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6398. END;
  6399. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6400. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6401. recordScope := type(SyntaxTree.RecordType).recordScope;
  6402. IF recordScope.bodyProcedure # NIL THEN
  6403. procedure := recordScope.bodyProcedure;
  6404. body := procedure.procedureScope.body;
  6405. Emit(Push(position,self));
  6406. IF body.isActive THEN
  6407. StaticCallOperand(callop,procedure);
  6408. Emit(Push(position,callop.op));
  6409. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6410. Convert(priority,sizeType);
  6411. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6412. END;
  6413. Emit(Push(position,priority));
  6414. ReleaseIntermediateOperand(priority);
  6415. IF backend.cooperative THEN
  6416. Emit(Push(position,self));
  6417. CallThis(position,"Activities","Create",3)
  6418. ELSE
  6419. flags := 0;
  6420. IF body.isSafe THEN
  6421. flags := 1;
  6422. END;
  6423. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6424. Emit(Push(position,self));
  6425. CallThis(position,"Objects","CreateProcess",4)
  6426. END;
  6427. ELSE
  6428. Emit(Push(position,self));
  6429. StaticCallOperand(callop,procedure);
  6430. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6431. END;
  6432. Emit(Pop(position,self));
  6433. END;
  6434. END CallBodies;
  6435. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6436. BEGIN
  6437. actualType := actualType.resolved;
  6438. IF actualType IS SyntaxTree.StringType THEN
  6439. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6440. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6441. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6442. ELSE
  6443. tmp := op.tag;
  6444. IntermediateCode.MakeMemory(tmp,addressType);
  6445. Emit(Push(position,tmp));
  6446. END;
  6447. Emit(Push(position,op.op))
  6448. END PushString;
  6449. PROCEDURE PushTD(type: SyntaxTree.Type);
  6450. VAR op: IntermediateCode.Operand;
  6451. BEGIN
  6452. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6453. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6454. ELSE
  6455. IF type.resolved IS SyntaxTree.PointerType THEN
  6456. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6457. END;
  6458. op := TypeDescriptorAdr(type.resolved);
  6459. IF ~newObjectFile THEN
  6460. IntermediateCode.MakeMemory(op,addressType);
  6461. END;
  6462. Emit(Push(position,op));
  6463. END
  6464. END PushTD;
  6465. BEGIN
  6466. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6467. dest := destination; destination := emptyOperand;
  6468. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6469. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6470. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6471. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6472. CASE x.id OF
  6473. (* ---- COPY ----- *)
  6474. |Global.Copy:
  6475. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6476. (* ---- EXCL, INCL----- *)
  6477. |Global.Excl,Global.Incl:
  6478. Evaluate(p0,s0);
  6479. Evaluate(p1,s1);
  6480. Convert(s1.op,setType);
  6481. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6482. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6483. END;
  6484. ReuseCopy(res,s0.op);
  6485. ReleaseOperand(s0);
  6486. Reuse1(tmp,s1.op);
  6487. ReleaseOperand(s1);
  6488. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6489. IF x.id = Global.Excl THEN
  6490. Emit(Not(position,tmp,tmp));
  6491. Emit(And(position,res,res,tmp));
  6492. ELSE
  6493. Emit(Or(position,res,res,tmp));
  6494. END;
  6495. ReleaseIntermediateOperand(tmp);
  6496. Designate(p0,s0);
  6497. ToMemory(s0.op,setType,0);
  6498. Emit(Mov(position,s0.op,res));
  6499. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6500. (* ---- DISPOSE ----- *)
  6501. |Global.Dispose:
  6502. Designate(p0,s0);
  6503. Emit(Push(position,s0.op));
  6504. ReleaseOperand(s0);
  6505. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6506. (* ---- GETPROCEDURE ----- *)
  6507. |Global.GetProcedure:
  6508. Designate(p0,s0);
  6509. PushString(s0,p0.type);
  6510. Designate(p1,s1);
  6511. PushString(s1,p1.type);
  6512. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6513. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6514. ELSE PushTD(procedureType.firstParameter.type)
  6515. END;
  6516. PushTD(procedureType.returnType);
  6517. Designate(p2,s2);
  6518. Emit(Push(position,s2.op));
  6519. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6520. CallThis(position,"Modules","GetProcedure", 7);
  6521. (* ---- ASH, LSH, ROT ----- *)
  6522. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6523. Evaluate(p0,s0);
  6524. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6525. (* make unsigned arguments in order to produced a logical shift *)
  6526. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6527. convert:= TRUE;
  6528. itype := s0.op.type;
  6529. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6530. Convert(s0.op,itype);
  6531. ELSE
  6532. convert := FALSE;
  6533. END;
  6534. END;
  6535. Evaluate(p1,s1);
  6536. IF IsIntegerConstant(p1,hint) THEN
  6537. ReuseCopy(reg,s0.op);
  6538. IF hint > 0 THEN
  6539. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6540. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6541. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6542. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6543. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6544. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6545. END;
  6546. ELSIF hint < 0 THEN
  6547. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6548. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6549. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6550. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6551. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6552. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6553. END;
  6554. END;
  6555. ReleaseOperand(s0); ReleaseOperand(s1);
  6556. ELSE
  6557. exit := NewLabel();
  6558. end := NewLabel();
  6559. ReuseCopy(reg,s0.op);
  6560. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6561. Reuse1(tmp,s1.op);
  6562. Emit(Neg(position,tmp,s1.op));
  6563. Convert(tmp,s1.op.type);
  6564. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6565. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6566. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6567. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6568. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6569. END;
  6570. ReleaseIntermediateOperand(tmp);
  6571. BrL(end);
  6572. SetLabel(exit);
  6573. ReuseCopy(tmp,s1.op);
  6574. Convert(tmp,s1.op.type);
  6575. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6576. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6577. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6578. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6579. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6580. END;
  6581. ReleaseIntermediateOperand(tmp);
  6582. SetLabel(end);
  6583. ReleaseOperand(s0); ReleaseOperand(s1);
  6584. END;
  6585. InitOperand(result,ModeValue);
  6586. IF convert THEN
  6587. itype := reg.type;
  6588. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6589. Convert(reg,itype);
  6590. END;
  6591. result.op := reg;
  6592. (* ---- CAP ----- *)
  6593. |Global.Cap:
  6594. Evaluate(p0,result);
  6595. ReuseCopy(reg,result.op);
  6596. ReleaseIntermediateOperand(result.op);
  6597. ignore := NewLabel();
  6598. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6599. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6600. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6601. SetLabel(ignore);
  6602. result.op := reg;
  6603. (* ---- CHR ----- *)
  6604. |Global.Chr, Global.Chr32:
  6605. Evaluate(p0,result);
  6606. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6607. |Global.Entier, Global.EntierH:
  6608. Evaluate(p0,result);
  6609. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6610. (* ---- MIN and MAX ----- *)
  6611. |Global.Max,Global.Min:
  6612. Evaluate(p0,s0);
  6613. Evaluate(p1,s1);
  6614. Reuse2(res,s0.op,s1.op);
  6615. else := NewLabel();
  6616. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6617. ELSE BrltL(else,s1.op,s0.op) END;
  6618. Emit(Mov(position,res,s0.op));
  6619. ReleaseOperand(s0);
  6620. end := NewLabel();
  6621. BrL(end);
  6622. SetLabel(else);
  6623. Emit(MovReplace(position,res,s1.op));
  6624. SetLabel(end);
  6625. ReleaseOperand(s1);
  6626. InitOperand(result,ModeValue);
  6627. result.op := res;
  6628. (* ---- ODD ----- *)
  6629. |Global.Odd:
  6630. IF ~conditional THEN
  6631. ConditionToValue(x)
  6632. ELSE
  6633. Evaluate(p0,result);
  6634. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6635. Reuse1(res,result.op);
  6636. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6637. ReleaseIntermediateOperand(result.op);
  6638. result.op := res;
  6639. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6640. ReleaseOperand(result);
  6641. BrL(falseLabel);
  6642. END;
  6643. (* ---- ORD ----- *)
  6644. |Global.Ord, Global.Ord32:
  6645. Evaluate(p0,result);
  6646. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6647. (* ---- SHORT, LONG ----- *)
  6648. |Global.Short, Global.Long:
  6649. Evaluate(p0,result);
  6650. IF x.type IS SyntaxTree.ComplexType THEN
  6651. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6652. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6653. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6654. ELSE
  6655. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6656. END
  6657. (* ---- HALT, SYSTEM.HALT----- *)
  6658. |Global.Halt, Global.systemHalt:
  6659. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6660. EmitTrap (position, val);
  6661. (* ---- ASSERT ----- *)
  6662. |Global.Assert:
  6663. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6664. trueL := NewLabel();
  6665. falseL := NewLabel();
  6666. Condition(p0,trueL,falseL);
  6667. IF p1 = NIL THEN val := AssertTrap
  6668. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6669. END;
  6670. SetLabel(falseL);
  6671. EmitTrap(position,val);
  6672. SetLabel(trueL);
  6673. END;
  6674. (*
  6675. Emit(TrapC(result.op,val);
  6676. *)
  6677. (* ---- INC, DEC----- *)
  6678. |Global.Inc,Global.Dec:
  6679. Expression(p0); adr := result.op;
  6680. LoadValue(result,p0.type); l := result;
  6681. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6682. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6683. END;
  6684. IF x.id = Global.Inc THEN
  6685. Emit(Add(position,l.op,l.op,r.op));
  6686. ELSE
  6687. Emit(Sub(position,l.op,l.op,r.op));
  6688. END;
  6689. ReleaseOperand(l); ReleaseOperand(r);
  6690. (* ---- LEN ----- *)
  6691. |Global.Len: (* dynamic length, static length done by checker *)
  6692. Designate(p0,operand);
  6693. IF p1 = NIL THEN
  6694. InitOperand(l,ModeValue);
  6695. l.op := IntermediateCode.Immediate(int32,0);
  6696. ELSE
  6697. Evaluate(p1,l);
  6698. END;
  6699. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6700. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6701. Dereference(operand, p0.type.resolved, FALSE);
  6702. END;
  6703. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6704. ReleaseOperand(operand); ReleaseOperand(l);
  6705. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6706. ASSERT(p1 # NIL);
  6707. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6708. Dereference(operand,p0.type.resolved,FALSE);
  6709. END;
  6710. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6711. ReleaseOperand(operand); ReleaseOperand(l);
  6712. ELSE HALT(100);
  6713. END;
  6714. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6715. (* ---- FIRST ---- *)
  6716. |Global.First:
  6717. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6718. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6719. ELSE
  6720. Designate(p0, result)
  6721. END
  6722. (* ---- LAST ---- *)
  6723. |Global.Last:
  6724. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6725. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6726. ELSE
  6727. Designate(p0, result);
  6728. (* make sure result.op is a register *)
  6729. tmp := result.op;
  6730. ReuseCopy(result.op, result.op);
  6731. ReleaseIntermediateOperand(tmp);
  6732. (* add offset to result.op *)
  6733. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6734. END
  6735. (* ---- STEP ---- *)
  6736. |Global.Step:
  6737. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6738. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6739. ELSE
  6740. Designate(p0, result);
  6741. (* make sure result.op is a register *)
  6742. tmp := result.op;
  6743. ReuseCopy(result.op, result.op);
  6744. ReleaseIntermediateOperand(tmp);
  6745. (* add offset to result.op *)
  6746. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6747. END
  6748. (* ---- RE ---- *)
  6749. |Global.Re:
  6750. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6751. Designate(p0, result)
  6752. ELSE
  6753. Evaluate(p0, result)
  6754. END
  6755. (* ---- IM ---- *)
  6756. |Global.Im:
  6757. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6758. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6759. Designate(p0, result);
  6760. (* make sure result.op is a register *)
  6761. tmp := result.op;
  6762. ReuseCopy(result.op, result.op);
  6763. ReleaseIntermediateOperand(tmp);
  6764. (* add offset to result.op *)
  6765. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6766. (* ---- ABS ----- *)
  6767. |Global.Abs:
  6768. Evaluate(p0,operand);
  6769. type := p0.type.resolved;
  6770. InitOperand(result,ModeValue);
  6771. Reuse1a(result.op,operand.op,dest);
  6772. Emit(Abs(position,result.op,operand.op));
  6773. ReleaseOperand(operand);
  6774. (* ---- WAIT ----- *)
  6775. |Global.Wait:
  6776. Evaluate(p0,operand);
  6777. Emit(Push(position,operand.op));
  6778. ReleaseOperand(operand);
  6779. CallThis(position,"Activities","Wait", 1);
  6780. (* ---- NEW ----- *)
  6781. |Global.New:
  6782. (*! the following code is only correct for "standard" Oberon calling convention *)
  6783. type := p0.type.resolved;
  6784. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6785. THEN
  6786. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6787. IF backend.cooperative THEN
  6788. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6789. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6790. IF recordType.isObject THEN
  6791. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6792. IF recordType.IsActive() THEN
  6793. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6794. END;
  6795. IF recordType.IsProtected() THEN
  6796. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6797. END;
  6798. ELSE
  6799. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6800. END;
  6801. END;
  6802. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6803. CallThis(position,"Runtime","New", 1);
  6804. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6805. Emit(Result(position, pointer));
  6806. exit := NewLabel();
  6807. BreqL(exit,pointer,nil);
  6808. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6809. GetRecordTypeName (recordType,name);
  6810. IF ~recordType.isObject THEN
  6811. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6812. END;
  6813. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6814. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6815. IF recordType.isObject THEN
  6816. IF recordType.IsProtected() THEN
  6817. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6818. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6819. END;
  6820. IF recordType.IsActive() THEN
  6821. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6822. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6823. END;
  6824. END;
  6825. END;
  6826. (* initialize fields *)
  6827. IF type(SyntaxTree.PointerType).isPlain THEN
  6828. size := 0;
  6829. ELSIF recordType.isObject THEN
  6830. size := BaseObjectTypeSize;
  6831. ELSE
  6832. size := BaseRecordTypeSize;
  6833. END;
  6834. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  6835. (* call initializer *)
  6836. constructor := GetConstructor(recordType);
  6837. IF constructor # NIL THEN
  6838. (*! should be unified with ProcedureCallDesignator *)
  6839. Emit(Push(position,pointer));
  6840. ReleaseIntermediateOperand(pointer);
  6841. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6842. FOR i := 1 TO x.parameters.Length()-1 DO
  6843. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6844. formalParameter := formalParameter.nextParameter;
  6845. END;
  6846. (* static call of the constructor *)
  6847. GetCodeSectionNameForSymbol(constructor,name);
  6848. ASSERT(~constructor.isInline);
  6849. IF constructor.scope.ownerModule # module.module THEN
  6850. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6851. ELSE
  6852. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6853. END;
  6854. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  6855. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6856. Emit(Pop(position,pointer));
  6857. END;
  6858. (* call bodies *)
  6859. CallBodies(pointer,p0.type);
  6860. SetLabel(exit);
  6861. needsTrace := p0.NeedsTrace();
  6862. IF needsTrace THEN ModifyAssignments(true) END;
  6863. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  6864. Emit(Push(position, pointer));
  6865. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  6866. Emit(Pop(position, pointer));
  6867. END;
  6868. Designate(p0,l);
  6869. IF needsTrace THEN
  6870. CallAssignPointer(l.op, pointer);
  6871. ELSE
  6872. ToMemory(l.op,addressType,0);
  6873. Emit(Mov(position,l.op,pointer));
  6874. END;
  6875. ReleaseIntermediateOperand(pointer);
  6876. ReleaseOperand(l);
  6877. IF needsTrace THEN ModifyAssignments(false) END;
  6878. ELSE
  6879. temporaryVariable := GetTemporaryVariable(type, FALSE);
  6880. IF temporaryVariable # NIL THEN
  6881. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  6882. ELSE
  6883. Designate(p0,l);
  6884. END;
  6885. (* l.op contains address of pointer to record *)
  6886. Emit(Push(position,l.op)); (* address for use after syscall *)
  6887. Emit(Push(position,l.op));
  6888. ReleaseOperand(l);
  6889. (* push type descriptor *)
  6890. reg := TypeDescriptorAdr(recordType);
  6891. IF ~newObjectFile THEN
  6892. IntermediateCode.MakeMemory(reg,addressType);
  6893. END;
  6894. Emit(Push(position,reg));
  6895. ReleaseIntermediateOperand(reg);
  6896. (* push realtime flag *)
  6897. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6898. ELSE Emit(Push(position,false));
  6899. END;
  6900. CallThis(position,"Heaps","NewRec", 3);
  6901. (* check allocation success, if not successful then do not call initializers and bodies *)
  6902. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6903. Emit(Pop(position,pointer));
  6904. MakeMemory(reg,pointer,addressType,0);
  6905. ReleaseIntermediateOperand(pointer);
  6906. pointer := reg;
  6907. exit := NewLabel();
  6908. BreqL(exit,pointer,nil);
  6909. Emit(Push(position,pointer));
  6910. (* initialize fields *)
  6911. InitFields(recordType, pointer,0);
  6912. (* call initializer *)
  6913. constructor := GetConstructor(recordType);
  6914. IF constructor # NIL THEN
  6915. (*! should be unified with ProcedureCallDesignator *)
  6916. Emit(Push(position,pointer));
  6917. ReleaseIntermediateOperand(pointer);
  6918. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6919. FOR i := 1 TO x.parameters.Length()-1 DO
  6920. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6921. formalParameter := formalParameter.nextParameter;
  6922. END;
  6923. (* static call of the constructor *)
  6924. GetCodeSectionNameForSymbol(constructor,name);
  6925. ASSERT(~constructor.isInline);
  6926. IF constructor.scope.ownerModule # module.module THEN
  6927. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6928. ELSE
  6929. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6930. END;
  6931. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  6932. ELSE
  6933. ReleaseIntermediateOperand(pointer);
  6934. END;
  6935. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6936. Emit(Pop(position,pointer));
  6937. IF temporaryVariable # NIL THEN
  6938. Designate(p0,l);
  6939. ToMemory(l.op,addressType,0);
  6940. Emit(Mov(position,l.op,pointer));
  6941. ReleaseOperand(l);
  6942. result.tag := emptyOperand;
  6943. END;
  6944. (* call bodies *)
  6945. CallBodies(pointer,p0.type);
  6946. ReleaseIntermediateOperand(pointer);
  6947. IF temporaryVariable # NIL THEN
  6948. end := NewLabel();
  6949. BrL(end);
  6950. SetLabel(exit);
  6951. Designate(p0,l);
  6952. ToMemory(l.op,addressType,0);
  6953. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  6954. ReleaseOperand(l);
  6955. SetLabel(end);
  6956. ELSE
  6957. SetLabel(exit);
  6958. END;
  6959. END;
  6960. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  6961. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  6962. dim := 0;
  6963. IF p1 # NIL THEN
  6964. FOR i := 1 TO x.parameters.Length()-1 DO
  6965. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6966. parameter := x.parameters.GetExpression(i);
  6967. Evaluate(parameter,r);
  6968. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6969. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  6970. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  6971. END;
  6972. Emit(Push(position,r.op));
  6973. IF i=1 THEN
  6974. ReuseCopy(reg,r.op);
  6975. ELSE
  6976. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  6977. END;
  6978. ReleaseOperand(r);
  6979. INC(dim);
  6980. END;
  6981. Convert(reg,addressType);
  6982. ELSE
  6983. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6984. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  6985. END;
  6986. openDim := dim;
  6987. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  6988. IF backend.cooperative THEN
  6989. size := ToMemoryUnits(system,system.SizeOf(type));
  6990. WHILE type IS SyntaxTree.ArrayType DO
  6991. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6992. END;
  6993. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  6994. IF (size # 1) THEN
  6995. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6996. END;
  6997. Emit(Push(position,reg));
  6998. size := ToMemoryUnits(system,system.SizeOf(type));
  6999. IF (size # 1) THEN
  7000. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7001. END;
  7002. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7003. Emit(Push(position,reg));
  7004. ReleaseIntermediateOperand(reg);
  7005. CallThis(position,"Runtime","New", 1);
  7006. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7007. Emit(Result(position, pointer));
  7008. exit := NewLabel();
  7009. else := NewLabel();
  7010. BreqL(else,pointer,nil);
  7011. IF ~type.hasPointers THEN
  7012. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7013. ELSIF type IS SyntaxTree.RecordType THEN
  7014. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7015. ELSIF type IS SyntaxTree.ProcedureType THEN
  7016. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7017. ELSE
  7018. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7019. END;
  7020. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7021. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7022. 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))));
  7023. IF type IS SyntaxTree.RecordType THEN
  7024. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7025. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7026. ELSE
  7027. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7028. END;
  7029. i := openDim;
  7030. WHILE i > 0 DO
  7031. DEC (i);
  7032. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7033. END;
  7034. needsTrace := p0.NeedsTrace();
  7035. IF needsTrace THEN ModifyAssignments(true) END;
  7036. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7037. Emit(Push(position, pointer));
  7038. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7039. Emit(Pop(position, pointer));
  7040. END;
  7041. Designate(p0,l);
  7042. IF needsTrace THEN
  7043. CallAssignPointer(l.op, pointer);
  7044. ModifyAssignments(false);
  7045. ELSE
  7046. ToMemory(l.op,addressType,0);
  7047. Emit(Mov(position,l.op,pointer));
  7048. END;
  7049. ReleaseIntermediateOperand(pointer);
  7050. ReleaseOperand(l);
  7051. BrL(exit);
  7052. SetLabel(else);
  7053. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7054. Designate(p0,l);
  7055. IF needsTrace THEN
  7056. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7057. ELSE
  7058. ToMemory(l.op,addressType,0);
  7059. Emit(Mov(position,l.op,pointer));
  7060. END;
  7061. ReleaseOperand(l);
  7062. SetLabel(exit);
  7063. ELSE
  7064. (*! the following code is only correct for "standard" Oberon calling convention *)
  7065. IF SemanticChecker.ContainsPointer(type) THEN
  7066. IF type IS SyntaxTree.ArrayType THEN
  7067. staticLength := 1;
  7068. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7069. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7070. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7071. END;
  7072. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7073. Emit(Mul(position,reg,reg,tmp));
  7074. END;
  7075. Designate(p0,l);
  7076. IF openDim > 0 THEN
  7077. Emit(Push(position,l.op)); (* address for use after syscall *)
  7078. END;
  7079. Emit(Push(position,l.op)); (* address *)
  7080. ReleaseOperand(l);
  7081. tmp := TypeDescriptorAdr(type);
  7082. IF ~newObjectFile THEN
  7083. IntermediateCode.MakeMemory(tmp,addressType);
  7084. END;
  7085. Emit(Push(position,tmp)); (* type descriptor *)
  7086. ReleaseIntermediateOperand(tmp);
  7087. Emit(Push(position,reg)); (* number Elements *)
  7088. ReleaseIntermediateOperand(reg);
  7089. tmp := IntermediateCode.Immediate(addressType,dim);
  7090. Emit(Push(position,tmp)); (* dimensions *)
  7091. (* push realtime flag *)
  7092. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7093. ELSE Emit(Push(position,false));
  7094. END;
  7095. CallThis(position,"Heaps","NewArr",5)
  7096. ELSE
  7097. size := ToMemoryUnits(system,system.SizeOf(type));
  7098. IF (size # 1) THEN
  7099. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7100. END;
  7101. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7102. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7103. Emit(Add(position,reg,reg,tmp));
  7104. Designate(p0,l);
  7105. IF openDim >0 THEN
  7106. Emit(Push(position,l.op)); (* address for use after syscall *)
  7107. END;
  7108. Emit(Push(position,l.op)); (* address for syscall *)
  7109. ReleaseOperand(l); (* pointer address *)
  7110. Emit(Push(position,reg)); (* size *)
  7111. ReleaseIntermediateOperand(reg);
  7112. (* push realtime flag *)
  7113. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7114. ELSE Emit(Push(position,false));
  7115. END;
  7116. CallThis(position,"Heaps","NewSys", 3)
  7117. END;
  7118. IF openDim > 0 THEN
  7119. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7120. Emit(Pop(position,adr));
  7121. ToMemory(adr,addressType,0);
  7122. ReuseCopy(tmp,adr);
  7123. ReleaseIntermediateOperand(adr);
  7124. adr := tmp;
  7125. else := NewLabel();
  7126. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7127. i := openDim-1;
  7128. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7129. WHILE (i >= 0) DO
  7130. Emit(Pop(position,reg));
  7131. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7132. Emit(Mov(position,res,reg));
  7133. DEC(i);
  7134. END;
  7135. ReleaseIntermediateOperand(adr);
  7136. ReleaseIntermediateOperand(reg);
  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. END;
  7146. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7147. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7148. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7149. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7150. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7151. left.SetType(procedure.type);
  7152. formalParameter := procedureType.firstParameter;
  7153. (* push array to allocate *)
  7154. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7155. formalParameter :=formalParameter.nextParameter;
  7156. (* push length array *)
  7157. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7158. (* push size *)
  7159. type := t0;
  7160. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7161. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7162. END;
  7163. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7164. Emit(Push(position,tmp));
  7165. (* *)
  7166. IF SemanticChecker.ContainsPointer(type) THEN
  7167. tmp := TypeDescriptorAdr(type);
  7168. IF ~newObjectFile THEN
  7169. IntermediateCode.MakeMemory(tmp,addressType);
  7170. END;
  7171. ELSE
  7172. tmp := IntermediateCode.Immediate(addressType, 0);
  7173. END;
  7174. Emit(Push(position,tmp)); (* type descriptor *)
  7175. StaticCallOperand(result,procedure);
  7176. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7177. ReleaseOperand(result);
  7178. END;
  7179. (*
  7180. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7181. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7182. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7183. *)
  7184. ELSE
  7185. dim := 0;
  7186. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7187. (* generate geometry descriptor *)
  7188. Designate(p0,l);
  7189. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7190. ReleaseOperand(l);
  7191. isTensor := TRUE;
  7192. ELSE
  7193. isTensor := FALSE;
  7194. END;
  7195. FOR i := 1 TO x.parameters.Length()-1 DO
  7196. IF ~isTensor THEN
  7197. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7198. END;
  7199. parameter := x.parameters.GetExpression(i);
  7200. Evaluate(parameter,r);
  7201. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7202. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7203. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7204. END;
  7205. Emit(Push(position,r.op));
  7206. IF i=1 THEN
  7207. ReuseCopy(reg,r.op);
  7208. ELSE
  7209. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7210. END;
  7211. ReleaseOperand(r);
  7212. INC(dim);
  7213. END;
  7214. Convert(reg,addressType);
  7215. openDim := dim;
  7216. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7217. (*! the following code is only correct for "standard" Oberon calling convention *)
  7218. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7219. t := type;
  7220. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7221. staticLength := 1;
  7222. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7223. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7224. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7225. END;
  7226. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7227. Emit(Mul(position,reg,reg,tmp));
  7228. END;
  7229. Designate(p0,l);
  7230. IF isTensor THEN
  7231. Dereference(l,type,FALSE);
  7232. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7233. END;
  7234. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7235. Emit(Push(position,l.tag)); (* address *)
  7236. ReleaseOperand(l);
  7237. tmp := TypeDescriptorAdr(t);
  7238. IF ~newObjectFile THEN
  7239. IntermediateCode.MakeMemory(tmp,addressType);
  7240. END;
  7241. Emit(Push(position,tmp)); (* type descriptor *)
  7242. ReleaseIntermediateOperand(tmp);
  7243. Emit(Push(position,reg)); (* number Elements *)
  7244. ReleaseIntermediateOperand(reg);
  7245. tmp := IntermediateCode.Immediate(addressType,0);
  7246. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7247. (* push realtime flag: false by default *)
  7248. Emit(Push(position,false));
  7249. CallThis(position,"Heaps","NewArr",5);
  7250. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7251. Emit(Pop(position,adr));
  7252. GetMathArrayField(tmp,adr,MathPtrOffset);
  7253. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7254. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7255. PutMathArrayField(adr,reg,MathAdrOffset);
  7256. ReleaseIntermediateOperand(tmp);
  7257. ReleaseIntermediateOperand(reg);
  7258. ELSE
  7259. IF isTensor THEN
  7260. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7261. ELSE
  7262. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7263. END;
  7264. IF (size # 1) THEN
  7265. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7266. END;
  7267. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7268. Emit(Add(position,reg,reg,tmp));
  7269. Designate(p0,l);
  7270. IF isTensor THEN
  7271. Dereference(l,type,FALSE);
  7272. END;
  7273. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7274. Emit(Push(position,l.tag)); (* address for syscall *)
  7275. ReleaseOperand(l); (* pointer address *)
  7276. Emit(Push(position,reg)); (* size *)
  7277. ReleaseIntermediateOperand(reg);
  7278. (* push realtime flag: false by default *)
  7279. Emit(Push(position,false));
  7280. CallThis(position,"Heaps","NewSys",3);
  7281. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7282. Emit(Pop(position,adr));
  7283. GetMathArrayField(tmp,adr,MathPtrOffset);
  7284. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7285. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7286. PutMathArrayField(adr,reg,MathAdrOffset);
  7287. ReleaseIntermediateOperand(tmp);
  7288. ReleaseIntermediateOperand(reg);
  7289. END;
  7290. flags := {};
  7291. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7292. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7293. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7294. PutMathArrayField(adr,tmp,MathDimOffset);
  7295. else := NewLabel();
  7296. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7297. i := openDim-1;
  7298. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7299. IF isTensor THEN
  7300. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7301. ELSE
  7302. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7303. END;
  7304. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7305. WHILE (i >= 0) DO
  7306. Emit(Pop(position,reg));
  7307. PutMathArrayLength(adr,reg,i);
  7308. PutMathArrayIncrement(adr,tmp,i);
  7309. IF i > 0 THEN
  7310. IF i=openDim-1 THEN
  7311. ReuseCopy(tmp,tmp);
  7312. END;
  7313. Emit(Mul(position,tmp,tmp,reg));
  7314. END;
  7315. DEC(i);
  7316. END;
  7317. ReleaseIntermediateOperand(adr);
  7318. ReleaseIntermediateOperand(reg);
  7319. ReleaseIntermediateOperand(tmp);
  7320. exit := NewLabel();
  7321. BrL(exit);
  7322. SetLabel(else);
  7323. (* else part: array could not be allocated *)
  7324. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7325. Emit(Add(position,sp,sp,tmp));
  7326. SetLabel(exit);
  7327. END;
  7328. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7329. THEN
  7330. IF ~backend.cellsAreObjects THEN RETURN END;
  7331. IF InCellScope(currentScope) THEN
  7332. PushSelfPointer()
  7333. ELSE
  7334. Emit(Push(position, nil));
  7335. END;
  7336. (* push temp address *)
  7337. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7338. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7339. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7340. (* l.op contains address of pointer to record *)
  7341. Emit(Push(position,l.op)); (* address for use after syscall *)
  7342. ReleaseOperand(l);
  7343. (* push type descriptor *)
  7344. reg := TypeDescriptorAdr(baseType);
  7345. IF ~newObjectFile THEN
  7346. IntermediateCode.MakeMemory(reg,addressType);
  7347. END;
  7348. Emit(Push(position,reg));
  7349. ReleaseIntermediateOperand(reg);
  7350. (* push name *)
  7351. (*Global.GetSymbolName(p0, n);*)
  7352. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7353. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7354. ELSE
  7355. Global.GetModuleName(module.module, n);
  7356. END;
  7357. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7358. (*type.typeDeclaration.GetName(n);*)
  7359. PushConstString(n);
  7360. (* push cellnet boolean *)
  7361. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7362. (* push engine boolean *)
  7363. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7364. (* allocate *)
  7365. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7366. (* add capabilities *)
  7367. modifier := p0(SyntaxTree.Designator).modifiers;
  7368. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7369. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7370. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7371. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7372. END;
  7373. AppendModifiers(modifier, baseType(SyntaxTree.CellType).modifiers);
  7374. (*
  7375. modifier := baseType(SyntaxTree.CellType).modifiers;
  7376. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7377. modifier := p0(SyntaxTree.Designator).modifiers;
  7378. *)
  7379. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7380. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7381. (* l.op contains address of pointer to record *)
  7382. ToMemory(l.op,addressType,0);
  7383. (* l.op contains value of pointer to record *)
  7384. Emit(Push(position,l.op)); (* address for use after syscall *)
  7385. ReleaseOperand(l);
  7386. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7387. prevScope := currentScope;
  7388. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7389. previous := section;
  7390. section := init;
  7391. (* add ports *)
  7392. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7393. CloseInitializer(previous);
  7394. currentScope := prevScope;
  7395. Symbol(temporaryVariable,l);
  7396. ToMemory(l.op,addressType,0);
  7397. Emit(Push(position,l.op));
  7398. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7399. (*
  7400. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7401. IF constructor # NIL THEN
  7402. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7403. FOR i := 1 TO x.parameters.Length()-1 DO
  7404. p := x.parameters.GetExpression(i);
  7405. Global.GetSymbolName(parameter,name);
  7406. Evaluate(p, value);
  7407. ASSERT(value.type # NIL);
  7408. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7409. par := instance.AddParameter(name);
  7410. par.SetInteger(value.integer);
  7411. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7412. par := instance.AddParameter(name);
  7413. par.SetBoolean(value.boolean);
  7414. ELSE Error(x.position,NotYetImplemented)
  7415. END;
  7416. parameter := parameter.nextParameter
  7417. END;
  7418. END;
  7419. *)
  7420. (* call initializer *)
  7421. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7422. IF constructor # NIL THEN
  7423. (*! should be unified with ProcedureCallDesignator *)
  7424. IF backend.cellsAreObjects THEN
  7425. Symbol(temporaryVariable,l);
  7426. ToMemory(l.op,addressType,0);
  7427. Emit(Push(position,l.op));
  7428. ReleaseOperand(l);
  7429. END;
  7430. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7431. FOR i := 1 TO x.parameters.Length()-1 DO
  7432. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7433. formalParameter := formalParameter.nextParameter;
  7434. END;
  7435. (* static call of the constructor *)
  7436. Global.GetSymbolSegmentedName(constructor,name);
  7437. ASSERT(~constructor.isInline);
  7438. IF constructor.scope.ownerModule # module.module THEN
  7439. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7440. ELSE
  7441. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7442. END;
  7443. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7444. (*ELSE
  7445. ReleaseIntermediateOperand(pointer);*)
  7446. END;
  7447. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7448. ToMemory(l.op, addressType, 0);
  7449. Designate(p0,s0);
  7450. ToMemory(s0.op,addressType,0);
  7451. Emit(Mov(position,s0.op,l.op));
  7452. ReleaseOperand(l);
  7453. ReleaseOperand(s0);
  7454. result.tag := emptyOperand;
  7455. (* start *)
  7456. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7457. (* push cell *)
  7458. Symbol(temporaryVariable, l);
  7459. ToMemory(l.op,addressType,0);
  7460. Emit(Push(-1,l.op));
  7461. (* push delegate *)
  7462. Emit(Push(-1,l.op));
  7463. ReleaseOperand(l);
  7464. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7465. Emit(Push(position, s1.op));
  7466. ReleaseOperand(s1);
  7467. CallThis(position,"ActiveCellsRuntime","Start",3);
  7468. END;
  7469. (*IF temporaryVariable # NIL THEN
  7470. end := NewLabel();
  7471. BrL(end);
  7472. SetLabel(exit);
  7473. Designate(p0,l);
  7474. ToMemory(l.op,addressType,0);
  7475. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7476. ReleaseOperand(l);
  7477. SetLabel(end);
  7478. ELSE
  7479. SetLabel(exit);
  7480. END;
  7481. *)
  7482. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7483. ELSE (* no pointer to record, no pointer to array *)
  7484. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7485. (* ignore new statement *)
  7486. Warning(p0.position, "cannot run on final hardware");
  7487. ELSE
  7488. HALT(200);
  7489. END;
  7490. END;
  7491. (* ---- ADDRESSOF----- *)
  7492. |Global.systemAdr:
  7493. Designate(p0,s0);
  7494. s0.mode := ModeValue;
  7495. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7496. ReleaseIntermediateOperand(s0.op);
  7497. s0.op := s0.tag;
  7498. IntermediateCode.InitOperand(s0.tag);
  7499. END;
  7500. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7501. result := s0;
  7502. (* ---- BIT ----- *)
  7503. |Global.systemBit:
  7504. Evaluate(p0,s0);
  7505. ToMemory(s0.op,addressType,0);
  7506. ReuseCopy(res,s0.op);
  7507. ReleaseOperand(s0);
  7508. Evaluate(p1,s1);
  7509. Emit(Ror(position,res,res,s1.op));
  7510. ReleaseOperand(s1);
  7511. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7512. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7513. IF ~conditional THEN
  7514. InitOperand(result,ModeValue); result.op := res;
  7515. ELSE
  7516. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7517. BrL(falseLabel);
  7518. ReleaseIntermediateOperand(res);
  7519. END;
  7520. (* --- MSK ----*)
  7521. |Global.systemMsk:
  7522. Evaluate(p0,s0);
  7523. Evaluate(p1,s1);
  7524. ReuseCopy(res,s0.op);
  7525. ReleaseOperand(s0);
  7526. Emit(And(position,res,res,s1.op));
  7527. ReleaseOperand(s1);
  7528. InitOperand(result,ModeValue);
  7529. result.op := res;
  7530. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7531. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7532. Evaluate(p0,s0);
  7533. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7534. ReleaseOperand(s0);
  7535. InitOperand(result,ModeValue);
  7536. result.op := res;
  7537. (* ---- SYSTEM.GetStackPointer ----- *)
  7538. |Global.systemGetStackPointer:
  7539. InitOperand(result,ModeValue);
  7540. result.op := sp;
  7541. (* ---- SYSTEM.GetFramePointer ----- *)
  7542. |Global.systemGetFramePointer:
  7543. InitOperand(result,ModeValue);
  7544. result.op := fp;
  7545. (* ---- SYSTEM.GetActivity ----- *)
  7546. |Global.systemGetActivity:
  7547. ASSERT(backend.cooperative);
  7548. InitOperand(result,ModeValue);
  7549. result.op := ap;
  7550. (* ---- SYSTEM.SetStackPointer ----- *)
  7551. |Global.systemSetStackPointer:
  7552. Evaluate(p0,s0); (* *)
  7553. Emit(Mov(position,sp,s0.op));
  7554. ReleaseOperand(s0);
  7555. (* ---- SYSTEM.SetFramePointer ----- *)
  7556. |Global.systemSetFramePointer:
  7557. Evaluate(p0,s0); (* *)
  7558. Emit(Mov(position,fp,s0.op));
  7559. ReleaseOperand(s0);
  7560. (* ---- SYSTEM.Activity ----- *)
  7561. |Global.systemSetActivity:
  7562. ASSERT(backend.cooperative);
  7563. Evaluate(p0,s0); (* *)
  7564. Emit(Mov(position,ap,s0.op));
  7565. ReleaseOperand(s0);
  7566. (* ---- SYSTEM.VAL ----- *)
  7567. |Global.systemVal:
  7568. Expression(p1);
  7569. s1 := result;
  7570. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7571. IF s1.mode = ModeReference THEN
  7572. (* nothing to be done if not record type, just take over new type *)
  7573. IF (type IS SyntaxTree.RecordType) THEN
  7574. ReleaseIntermediateOperand(s1.tag);
  7575. s1.tag := TypeDescriptorAdr(type);
  7576. IF ~newObjectFile THEN
  7577. IntermediateCode.MakeMemory(s1.tag,addressType);
  7578. END;
  7579. UseIntermediateOperand(s1.tag);
  7580. END;
  7581. result := s1;
  7582. ELSE (* copy over result to different type, may not use convert *)
  7583. itype := IntermediateCode.GetType(system,type);
  7584. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7585. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7586. Emit(Mov(position,s0.op,s1.op));
  7587. ReleaseOperand(s1);
  7588. InitOperand(result,ModeValue);
  7589. result.op := s0.op;
  7590. ELSE (* different size, must convert *)
  7591. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7592. Convert(s1.op, IntermediateCode.GetType(system,type));
  7593. result := s1;
  7594. END;
  7595. END;
  7596. (* ---- SYSTEM.GET ----- *)
  7597. |Global.systemGet:
  7598. Evaluate(p0,s0); (* adr *)
  7599. Designate(p1,s1); (* variable *)
  7600. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7601. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7602. Emit(Mov(position,s1.op,s0.op));
  7603. ReleaseOperand(s1);
  7604. ReleaseOperand(s0);
  7605. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7606. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7607. Evaluate(p0,s0); (* *)
  7608. Evaluate(p1,s1); (* variable *)
  7609. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7610. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7611. (* real part *)
  7612. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7613. Emit(Mov(position,res, s1.op));
  7614. ReleaseIntermediateOperand(res);
  7615. (* imaginary part *)
  7616. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7617. Emit(Mov(position,res, s1.tag));
  7618. ReleaseIntermediateOperand(res);
  7619. ReleaseOperand(s1);
  7620. ReleaseOperand(s0);
  7621. ELSE
  7622. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7623. ReleaseOperand(s0);
  7624. Emit(Mov(position,res,s1.op));
  7625. ReleaseIntermediateOperand(res);
  7626. ReleaseOperand(s1);
  7627. END;
  7628. (* ---- SYSTEM.MOVE ----- *)
  7629. |Global.systemMove:
  7630. Evaluate(p0,s0);
  7631. Evaluate(p1,s1);
  7632. Evaluate(p2,s2);
  7633. Emit(Copy(position,s1.op,s0.op,s2.op));
  7634. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7635. (* ---- SYSTEM.NEW ----- *)
  7636. |Global.systemNew:
  7637. Designate(p0,s0);
  7638. Emit(Push(position,s0.op));
  7639. ReleaseOperand(s0);
  7640. Evaluate(p1,s1);
  7641. Emit(Push(position,s1.op));
  7642. ReleaseOperand(s1);
  7643. (* push realtime flag: false by default *)
  7644. Emit(Push(position,false));
  7645. CallThis(position,"Heaps","NewSys",3);
  7646. (* ---- SYSTEM.CALL ----- *)
  7647. |Global.systemRef:
  7648. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7649. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7650. s0.mode := ModeValue;
  7651. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7652. result := s0
  7653. (* ---- INCR ----- *)
  7654. |Global.Incr:
  7655. Designate(p0,operand);
  7656. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7657. Dereference(operand,p0.type.resolved,FALSE);
  7658. END;
  7659. ASSERT(p1 # NIL);
  7660. Evaluate(p1,l);
  7661. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7662. ReleaseOperand(operand); ReleaseOperand(l);
  7663. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7664. (* ---- SUM ----- *)
  7665. |Global.Sum: HALT(200);
  7666. (* ---- ALL ----- *)
  7667. |Global.All: HALT(200);
  7668. (* ---- CAS ----- *)
  7669. |Global.Cas:
  7670. needsTrace := p0.NeedsTrace();
  7671. IF needsTrace THEN ModifyAssignments(true) END;
  7672. Designate(p0,s0);
  7673. Evaluate(p1,s1);
  7674. Evaluate(p2,s2);
  7675. IF needsTrace THEN
  7676. Emit(Push(position, s0.op));
  7677. Emit(Push(position, s1.op));
  7678. Emit(Push(position, s2.op));
  7679. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7680. ELSE
  7681. Emit(Cas(position,s0.op,s1.op,s2.op));
  7682. END;
  7683. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7684. IF needsTrace THEN ModifyAssignments(false) END;
  7685. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7686. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7687. IF conditional THEN
  7688. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7689. BrL(falseLabel);
  7690. ReleaseIntermediateOperand(res);
  7691. END;
  7692. (* ---- DIM ----- *)
  7693. |Global.Dim:
  7694. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7695. Designate(p0,s0);
  7696. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7697. Dereference(s0,p0.type.resolved,FALSE);
  7698. END;
  7699. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7700. ReleaseOperand(s0);
  7701. (* ---- RESHAPE ----- *)
  7702. |Global.Reshape:
  7703. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7704. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7705. left.SetType(procedure.type);
  7706. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7707. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7708. END;
  7709. (* ---- SYSTEM.TYPECODE ----- *)
  7710. |Global.systemTypeCode:
  7711. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7712. IF type.resolved IS SyntaxTree.PointerType THEN
  7713. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7714. END;
  7715. result.op := TypeDescriptorAdr(type);
  7716. IF ~newObjectFile THEN
  7717. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7718. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7719. END;
  7720. result.mode := ModeValue;
  7721. (* ---- SYSTEM.TRACE ----- *)
  7722. |Global.systemTrace:
  7723. SystemTrace(x.parameters, x.position);
  7724. (* ----- CONNECT ------*)
  7725. |Global.Connect:
  7726. IF backend.cellsAreObjects THEN
  7727. PushPort(p0);
  7728. PushPort(p1);
  7729. IF p2 # NIL THEN
  7730. Evaluate(p2, s2);
  7731. Emit(Push(p2.position, s2.op));
  7732. ReleaseOperand(s2);
  7733. ELSE
  7734. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7735. END;
  7736. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7737. ELSE
  7738. Warning(x.position, "cannot run on final hardware");
  7739. END;
  7740. (* ----- DELEGATE ------*)
  7741. |Global.Delegate:
  7742. IF backend.cellsAreObjects THEN
  7743. PushPort(p0);
  7744. PushPort(p1);
  7745. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7746. ELSE
  7747. Warning(x.position, "cannot run on final hardware");
  7748. END;
  7749. (* ----- SEND ------*)
  7750. |Global.Send:
  7751. Evaluate(p0,s0);
  7752. Evaluate(p1,s1);
  7753. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7754. Emit(Push(position,s0.op));
  7755. Emit(Push(position,s1.op));
  7756. (*
  7757. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7758. *)
  7759. IF ~backend.cellsAreObjects THEN
  7760. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7761. END;
  7762. ReleaseOperand(s0);
  7763. ReleaseOperand(s1);
  7764. IF backend.cellsAreObjects THEN
  7765. CallThis(position,"ActiveCellsRuntime","Send",2);
  7766. ELSE
  7767. CallThis(position,ChannelModuleName,"Send",2);
  7768. END;
  7769. (* ----- RECEIVE ------*)
  7770. |Global.Receive:
  7771. Evaluate(p0,s0);
  7772. Emit(Push(position,s0.op));
  7773. Designate(p1,s1);
  7774. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7775. Emit(Push(position,s1.op));
  7776. IF p2 # NIL THEN
  7777. Designate(p2,s2);
  7778. Emit(Push(position,s2.op));
  7779. END;
  7780. (*
  7781. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7782. *)
  7783. IF ~backend.cellsAreObjects THEN
  7784. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7785. END;
  7786. ReleaseOperand(s0);
  7787. ReleaseOperand(s1);
  7788. ReleaseOperand(s2);
  7789. IF backend.cellsAreObjects THEN
  7790. IF p2 = NIL THEN
  7791. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7792. ELSE
  7793. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7794. END;
  7795. ELSE
  7796. IF p2 = NIL THEN
  7797. CallThis(position,ChannelModuleName,"Receive",2)
  7798. ELSE
  7799. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7800. END;
  7801. END;
  7802. | Global.systemSpecial:
  7803. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7804. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7805. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7806. (* determine if parameters are of the VAR kind *)
  7807. ASSERT(x.parameters.Length() <= 3);
  7808. formalParameter := procedureType.firstParameter;
  7809. FOR i := 0 TO x.parameters.Length() - 1 DO
  7810. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7811. formalParameter := formalParameter.nextParameter
  7812. END;
  7813. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7814. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7815. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7816. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7817. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7818. IF procedureType.returnType # NIL THEN
  7819. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7820. Emit(Result(position, res));
  7821. (*InitOperand(result,ModeValue);
  7822. result.op := res;
  7823. *)
  7824. IF ~conditional THEN
  7825. InitOperand(result,ModeValue); result.op := res;
  7826. ELSE
  7827. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7828. BrL(falseLabel);
  7829. ReleaseIntermediateOperand(res);
  7830. END;
  7831. END
  7832. ELSE (* function not yet implemented *)
  7833. Error(position,"not yet implemented");
  7834. END;
  7835. destination := dest;
  7836. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  7837. END VisitBuiltinCallDesignator;
  7838. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  7839. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  7840. BEGIN
  7841. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  7842. dest := destination; destination := emptyOperand;
  7843. Expression(x.left);
  7844. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  7845. ELSIF isUnchecked THEN (* no check *)
  7846. ELSE
  7847. trueL := NewLabel();
  7848. falseL := NewLabel();
  7849. IF IsPointerToRecord(x.left.type,recordType) THEN
  7850. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7851. Emit(Mov(position,tag, result.op));
  7852. IF result.mode # ModeValue THEN
  7853. ptr := tag;
  7854. IntermediateCode.MakeMemory(ptr,addressType);
  7855. Emit(Mov(position,tag, ptr));
  7856. END;
  7857. IF ~backend.cooperative THEN
  7858. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7859. END;
  7860. IntermediateCode.MakeMemory(tag,addressType);
  7861. ELSE
  7862. tag := result.tag;
  7863. END;
  7864. TypeTest(tag,x.type,trueL,falseL);
  7865. ReleaseIntermediateOperand(tag);
  7866. SetLabel(falseL);
  7867. EmitTrap(position,TypeCheckTrap);
  7868. SetLabel(trueL);
  7869. END;
  7870. destination := dest;
  7871. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  7872. END VisitTypeGuardDesignator;
  7873. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  7874. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  7875. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  7876. VAR label: Label; pc: LONGINT;
  7877. BEGIN
  7878. IF backend.cooperative & ~isUnchecked THEN
  7879. pc := section.pc;
  7880. label := NewLabel();
  7881. BrneL(label, operand.op, nil);
  7882. EmitTrap(position, NilPointerTrap);
  7883. SetLabel(label);
  7884. INC(statCoopNilCheck, section.pc - pc);
  7885. END;
  7886. END NilCheck;
  7887. BEGIN
  7888. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  7889. ReuseCopy(dereferenced,operand.op);
  7890. ReleaseOperand(operand);
  7891. operand.mode := ModeReference;
  7892. operand.op := dereferenced;
  7893. operand.tag := dereferenced;
  7894. UseIntermediateOperand(operand.tag);
  7895. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  7896. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  7897. ReleaseIntermediateOperand(operand.tag);
  7898. operand.tag := TypeDescriptorAdr(type);
  7899. IF ~newObjectFile THEN
  7900. IntermediateCode.MakeMemory(operand.tag,addressType);
  7901. END;
  7902. ELSE
  7903. IF ~backend.cooperative THEN
  7904. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7905. END;
  7906. IntermediateCode.MakeMemory(operand.tag,addressType);
  7907. END;
  7908. NilCheck(operand.op);
  7909. ELSIF type IS SyntaxTree.ArrayType THEN
  7910. IF isUnsafe THEN
  7911. NilCheck(operand.op);
  7912. ReleaseIntermediateOperand(operand.tag);
  7913. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7914. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  7915. ELSE
  7916. operand.tag := emptyOperand;
  7917. END;
  7918. ELSE
  7919. NilCheck(operand.op);
  7920. IF backend.cooperative THEN
  7921. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  7922. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7923. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  7924. ELSE
  7925. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  7926. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  7927. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7928. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  7929. END;
  7930. END;
  7931. ELSIF type IS SyntaxTree.MathArrayType THEN
  7932. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  7933. IntermediateCode.MakeMemory(operand.op,addressType);
  7934. ELSE HALT(100);
  7935. END;
  7936. END Dereference;
  7937. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  7938. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  7939. BEGIN
  7940. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  7941. dest := destination; destination := emptyOperand;
  7942. Evaluate(x.left,d);
  7943. type := x.type.resolved;
  7944. prevIsUnchecked := isUnchecked;
  7945. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  7946. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  7947. END;
  7948. Dereference(d,type,IsUnsafePointer(x.left.type));
  7949. isUnchecked := prevIsUnchecked;
  7950. result := d;
  7951. 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
  7952. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  7953. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7954. END;
  7955. END;
  7956. destination := dest;
  7957. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  7958. END VisitDereferenceDesignator;
  7959. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  7960. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  7961. BEGIN
  7962. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  7963. dest := destination; destination := emptyOperand;
  7964. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  7965. tag := result.op;
  7966. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  7967. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  7968. StaticCallOperand(result,procedure.super);
  7969. ReleaseIntermediateOperand(result.tag);
  7970. UseIntermediateOperand(tag); (* necessary ? *)
  7971. result.tag := tag;
  7972. destination := dest;
  7973. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  7974. END VisitSupercallDesignator;
  7975. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  7976. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  7977. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  7978. name: Basic.SegmentedName;
  7979. BEGIN
  7980. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  7981. dest := destination; destination := emptyOperand;
  7982. scope := currentScope;
  7983. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  7984. scope := scope.outerScope;
  7985. END;
  7986. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  7987. IF newObjectFile THEN
  7988. moduleSection := meta.ModuleSection();
  7989. IF backend.cooperative THEN
  7990. moduleOffset := 0;
  7991. ELSE
  7992. moduleOffset := moduleSection.pc;
  7993. END;
  7994. result.mode := ModeValue;
  7995. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  7996. ELSE
  7997. Symbol(moduleSelf,result);
  7998. IntermediateCode.MakeMemory(result.op,addressType);
  7999. END
  8000. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8001. result.mode := ModeValue;
  8002. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8003. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8004. ELSE
  8005. GetBaseRegister(basereg,currentScope,scope);
  8006. InitOperand(result,ModeReference);
  8007. result.op := basereg;
  8008. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  8009. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  8010. IF backend.cooperative THEN
  8011. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8012. END;
  8013. (* tag must be loaded when dereferencing SELF pointer *)
  8014. END;
  8015. destination := dest;
  8016. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8017. END VisitSelfDesignator;
  8018. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8019. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8020. BEGIN
  8021. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8022. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8023. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8024. parameter := procedureType.returnParameter;
  8025. VisitParameter(parameter);
  8026. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8027. END VisitResultDesignator;
  8028. (** values *)
  8029. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8030. BEGIN
  8031. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8032. IF conditional THEN
  8033. IF x.value THEN BrL(trueLabel)
  8034. ELSE BrL(falseLabel)
  8035. END;
  8036. ELSE
  8037. InitOperand(result,ModeValue);
  8038. IF x.value THEN result.op := true ELSE result.op := false END;
  8039. END;
  8040. END VisitBooleanValue;
  8041. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8042. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8043. BEGIN
  8044. Global.GetModuleSegmentedName(module.module, name);
  8045. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8046. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8047. RETURN section
  8048. END GetDataSection;
  8049. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8050. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8051. BEGIN
  8052. type := vop.type;
  8053. data := GetDataSection();
  8054. pc := EnterImmediate(data,vop);
  8055. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8056. IntermediateCode.MakeMemory(vop, type);
  8057. END GetImmediateMem;
  8058. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8059. BEGIN
  8060. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8061. InitOperand(result,ModeValue);
  8062. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8063. IF ~supportedImmediate(result.op) &~inData THEN
  8064. GetImmediateMem(result.op)
  8065. END;
  8066. END VisitIntegerValue;
  8067. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8068. BEGIN
  8069. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8070. InitOperand(result,ModeValue);
  8071. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8072. END VisitCharacterValue;
  8073. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8074. BEGIN
  8075. IF Trace THEN TraceEnter("VisitSetValue") END;
  8076. InitOperand(result,ModeValue);
  8077. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8078. END VisitSetValue;
  8079. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8080. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8081. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8082. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8083. BEGIN
  8084. numberElements := x.elements.Length();
  8085. FOR i := 0 TO numberElements-1 DO
  8086. expression := x.elements.GetExpression(i);
  8087. IF expression IS SyntaxTree.MathArrayExpression THEN
  8088. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8089. ELSE
  8090. inData := TRUE;
  8091. Evaluate(expression,op);
  8092. irv.Emit(Data(position,op.op));
  8093. inData := FALSE;
  8094. ReleaseOperand(op);
  8095. END;
  8096. END;
  8097. END RecursiveData;
  8098. BEGIN
  8099. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8100. IF ~TryConstantDeclaration() THEN
  8101. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8102. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8103. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8104. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8105. ELSE
  8106. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8107. END;
  8108. RecursiveData(x.array);
  8109. InitOperand(result,ModeReference);
  8110. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8111. END
  8112. END VisitMathArrayValue;
  8113. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8114. VAR constant: Sections.Section;
  8115. BEGIN
  8116. IF constantDeclaration = NIL THEN
  8117. RETURN FALSE
  8118. ELSE
  8119. (* Is a constant in this module: did we generate it already? *)
  8120. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8121. IF constant # NIL THEN
  8122. InitOperand(result,ModeReference);
  8123. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8124. RETURN TRUE;
  8125. END;
  8126. END;
  8127. RETURN FALSE
  8128. END TryConstantDeclaration;
  8129. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8130. BEGIN
  8131. constantDeclaration := x;
  8132. x.value.resolved.Accept(SELF);
  8133. END VisitConstant;
  8134. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8135. BEGIN
  8136. IF Trace THEN TraceEnter("VisitRealValue") END;
  8137. InitOperand(result,ModeValue);
  8138. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8139. END VisitRealValue;
  8140. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8141. VAR
  8142. componentType: SyntaxTree.Type;
  8143. BEGIN
  8144. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8145. ASSERT(x.type IS SyntaxTree.ComplexType);
  8146. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8147. InitOperand(result,ModeValue);
  8148. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8149. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8150. END VisitComplexValue;
  8151. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8152. VAR i: LONGINT; name: Basic.SegmentedName;
  8153. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8154. BEGIN
  8155. IF Trace THEN TraceEnter("VisitStringValue") END;
  8156. IF ~TryConstantDeclaration() THEN
  8157. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8158. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8159. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8160. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8161. ELSE
  8162. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8163. END;
  8164. FOR i := 0 TO x.length-1 DO
  8165. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8166. irv.Emit(Data(position,op));
  8167. END;
  8168. InitOperand(result,ModeReference);
  8169. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8170. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8171. END
  8172. END VisitStringValue;
  8173. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8174. BEGIN
  8175. IF Trace THEN TraceEnter("VisitNilValue") END;
  8176. InitOperand(result,ModeValue);
  8177. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8178. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8179. END VisitNilValue;
  8180. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8181. BEGIN
  8182. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8183. InitOperand(result,ModeValue);
  8184. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8185. END VisitEnumerationValue;
  8186. (** symbols *)
  8187. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8188. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8189. END VisitImport;
  8190. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8191. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8192. BEGIN
  8193. IF scope # baseScope THEN
  8194. (* left := [fp+8] *)
  8195. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8196. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8197. ReuseCopy(left,right);
  8198. ReleaseIntermediateOperand(right);
  8199. scope := scope.outerScope; DEC(level);
  8200. (* { left := [left+8] } *)
  8201. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8202. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8203. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8204. Emit(Mov(position,left,right));
  8205. scope := scope.outerScope; DEC(level);
  8206. END;
  8207. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8208. result := left;
  8209. ELSE
  8210. result := fp;
  8211. END;
  8212. END GetBaseRegister;
  8213. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8214. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8215. BEGIN
  8216. IF Trace THEN TraceEnter("VisitVariable"); END;
  8217. type := x.type.resolved;
  8218. IF (x.useRegister) THEN
  8219. InitOperand(result, ModeValue);
  8220. IF x.registerNumber < 0 THEN
  8221. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8222. reg := x.registerNumber;
  8223. ELSE
  8224. reg := registerUsageCount.Map(x.registerNumber);
  8225. UseRegister(reg);
  8226. END;
  8227. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8228. ELSIF x.externalName # NIL THEN
  8229. InitOperand(result,ModeReference);
  8230. Basic.ToSegmentedName(x.externalName^, name);
  8231. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8232. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8233. InitOperand(result,ModeReference);
  8234. GetBaseRegister(result.op,currentScope,x.scope);
  8235. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8236. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8237. InitOperand(result,ModeReference);
  8238. GetCodeSectionNameForSymbol(x,name);
  8239. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8240. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8241. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8242. InitOperand(result,ModeReference);
  8243. GetCodeSectionNameForSymbol(x,name);
  8244. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8245. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8246. ELSE (* field, left designator must have been emitted *)
  8247. ASSERT(result.mode = ModeReference);
  8248. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8249. ReuseCopy(temp,result.op);
  8250. ReleaseIntermediateOperand(result.op);
  8251. result.op := temp;
  8252. END;
  8253. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8254. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8255. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8256. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8257. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8258. END;
  8259. END;
  8260. END;
  8261. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8262. ValueToCondition(result);
  8263. ELSIF type IS SyntaxTree.ProcedureType THEN
  8264. ReleaseIntermediateOperand(result.tag);
  8265. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8266. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8267. UseIntermediateOperand(result.tag);
  8268. ELSE
  8269. result.tag := nil; (* nil *)
  8270. END;
  8271. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8272. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8273. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8274. ReleaseIntermediateOperand(result.tag);
  8275. Global.GetSymbolSegmentedName(x,name);
  8276. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8277. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8278. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8279. ELSE
  8280. END;
  8281. ELSE
  8282. ReleaseIntermediateOperand(result.tag);
  8283. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8284. END;
  8285. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8286. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8287. ReleaseIntermediateOperand(result.tag);
  8288. result.tag := result.op;
  8289. UseIntermediateOperand(result.tag);
  8290. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8291. IntermediateCode.MakeMemory(result.op,addressType);
  8292. END;
  8293. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8294. ReleaseIntermediateOperand(result.tag);
  8295. result.tag := TypeDescriptorAdr(type);
  8296. IF ~newObjectFile THEN
  8297. IntermediateCode.MakeMemory(result.tag,addressType);
  8298. END;
  8299. UseIntermediateOperand(result.tag);
  8300. (* tag for pointer type computed not here but during dereferencing *)
  8301. END;
  8302. IF Trace THEN TraceExit("VisitVariable") END;
  8303. END VisitVariable;
  8304. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8305. BEGIN
  8306. VisitVariable(property);
  8307. END VisitProperty;
  8308. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8309. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8310. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8311. BEGIN
  8312. type := x.type.resolved;
  8313. IF Trace THEN TraceEnter("VisitParameter") END;
  8314. IF x.ownerType IS SyntaxTree.CellType THEN
  8315. ptype := x.type.resolved;
  8316. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8317. IF ~(ptype IS SyntaxTree.PortType) THEN
  8318. InitOperand(result,ModeReference);
  8319. GetCodeSectionNameForSymbol(x,name);
  8320. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8321. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8322. RETURN
  8323. ELSE
  8324. InitOperand(result, ModeValue);
  8325. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8326. adr := 0;
  8327. WHILE parameter # x DO
  8328. parameterType := parameter.type;
  8329. inc := 1;
  8330. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8331. INC(adr, inc);
  8332. parameter := parameter.nextParameter
  8333. END;
  8334. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8335. RETURN
  8336. END;
  8337. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8338. InitOperand(result,ModeReference);
  8339. GetCodeSectionNameForSymbol(x,name);
  8340. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8341. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8342. RETURN
  8343. ELSE
  8344. GetBaseRegister(basereg,currentScope,x.scope);
  8345. InitOperand(result,ModeReference);
  8346. result.op := basereg;
  8347. END;
  8348. IF IsOpenArray(type) THEN
  8349. result.tag := basereg;
  8350. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8351. IntermediateCode.MakeMemory(result.op,addressType);
  8352. IF Global.IsOberonProcedure(x.ownerType) THEN
  8353. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8354. UseIntermediateOperand(result.tag);
  8355. ELSE
  8356. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8357. END;
  8358. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8359. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8360. ELSIF IsStaticArray(type) THEN
  8361. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8362. IntermediateCode.MakeMemory(result.op,addressType);
  8363. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8364. ELSIF type IS SyntaxTree.MathArrayType THEN
  8365. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8366. WITH type: SyntaxTree.MathArrayType DO
  8367. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8368. IF type.form = SyntaxTree.Tensor THEN
  8369. ELSIF type.form = SyntaxTree.Open THEN
  8370. result.tag := result.op;
  8371. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8372. IntermediateCode.MakeMemory(result.op,addressType);
  8373. UseIntermediateOperand(result.tag);
  8374. ELSIF type.form = SyntaxTree.Static THEN
  8375. IF x.kind = SyntaxTree.ConstParameter THEN
  8376. IntermediateCode.MakeMemory(result.op,addressType);
  8377. END;
  8378. ELSE HALT(100)
  8379. END;
  8380. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8381. IF type.form = SyntaxTree.Tensor THEN
  8382. ToMemory(result.op,addressType,0);
  8383. ELSIF type.form = SyntaxTree.Open THEN
  8384. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8385. ReuseCopy(result.tag, mem);
  8386. ReleaseIntermediateOperand(mem);
  8387. ReleaseIntermediateOperand(result.op);
  8388. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8389. ELSIF type.form = SyntaxTree.Static THEN
  8390. IntermediateCode.MakeMemory(result.op,addressType);
  8391. ELSE HALT(100)
  8392. END;
  8393. ELSE HALT(100)
  8394. END;
  8395. END;
  8396. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8397. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8398. IntermediateCode.MakeMemory(result.op,addressType);
  8399. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8400. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8401. END;
  8402. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8403. ValueToCondition(result);
  8404. ELSIF type IS SyntaxTree.ProcedureType THEN
  8405. ReleaseIntermediateOperand(result.tag);
  8406. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8407. IF x.kind = SyntaxTree.VarParameter THEN
  8408. ReuseCopy(result.tag,result.op);
  8409. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8410. IntermediateCode.MakeMemory(result.tag,addressType);
  8411. ELSE
  8412. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8413. UseIntermediateOperand(result.tag);
  8414. END;
  8415. ELSE
  8416. result.tag := nil;
  8417. END;
  8418. (* tag for pointer type computed not here but during dereferencing *)
  8419. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8420. ReleaseIntermediateOperand(result.tag);
  8421. result.tag := basereg;
  8422. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8423. IntermediateCode.MakeMemory(result.tag,addressType);
  8424. UseIntermediateOperand(result.tag);
  8425. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8426. ReleaseIntermediateOperand(result.tag);
  8427. result.tag := TypeDescriptorAdr(type);
  8428. IF ~newObjectFile THEN
  8429. IntermediateCode.MakeMemory(result.tag,addressType);
  8430. END;
  8431. UseIntermediateOperand(result.tag);
  8432. END;
  8433. IF Trace THEN TraceExit("VisitParameter") END;
  8434. END VisitParameter;
  8435. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8436. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8437. BEGIN
  8438. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8439. (* left.p: left already emitted *)
  8440. tag := result.op; (* value of pointer to left *)
  8441. (* get type desc *)
  8442. tmp := result.tag;
  8443. IntermediateCode.MakeMemory(tmp,addressType);
  8444. (* get method adr *)
  8445. Reuse1(reg,tmp);
  8446. ReleaseIntermediateOperand(tmp);
  8447. IF backend.cooperative THEN
  8448. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8449. WHILE recordType.baseType # NIL DO
  8450. recordType := recordType.GetBaseRecord ();
  8451. END;
  8452. GetRecordTypeName (recordType,name);
  8453. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8454. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8455. offset := 0;
  8456. ELSE
  8457. offset := 2;
  8458. END;
  8459. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8460. ELSE
  8461. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8462. END;
  8463. InitOperand(operand,ModeReference);
  8464. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8465. operand.op := reg;
  8466. operand.tag := tag;
  8467. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8468. END DynamicCallOperand;
  8469. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8470. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8471. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8472. BEGIN
  8473. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8474. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8475. tag := operand.op;
  8476. ReleaseIntermediateOperand(operand.tag);
  8477. ELSE tag := nil
  8478. END;
  8479. IF x.isInline THEN
  8480. sectionType := Sections.InlineCodeSection;
  8481. ELSE
  8482. sectionType := Sections.CodeSection;
  8483. END;
  8484. IF x.externalName # NIL THEN
  8485. Basic.ToSegmentedName(x.externalName^, name);
  8486. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8487. ELSE
  8488. GetCodeSectionNameForSymbol(x, name);
  8489. IF (x.scope.ownerModule = module.module) THEN
  8490. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8491. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8492. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8493. IF source.pc = 0 THEN (* no code yet *)
  8494. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8495. END;
  8496. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8497. bits := x.procedureScope.body.code.inlineCode;
  8498. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8499. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8500. binary.CopyBits(bits, 0, bits.GetSize());
  8501. source.SetResolved(binary);
  8502. ELSE
  8503. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8504. END;
  8505. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8506. END;
  8507. InitOperand(operand,ModeValue);
  8508. operand.op := reg;
  8509. operand.tag := tag;
  8510. IF Trace THEN TraceExit("StaticCallOperand") END;
  8511. END StaticCallOperand;
  8512. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8513. (* handle expressions of the form designator.procedure or procedure *)
  8514. BEGIN
  8515. IF Trace THEN TraceEnter("VisitProcedure") END;
  8516. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8517. DynamicCallOperand(result,x);
  8518. ELSIF x.isInline THEN
  8519. StaticCallOperand(result,x);
  8520. ELSE
  8521. StaticCallOperand(result,x);
  8522. END;
  8523. IF Trace THEN TraceExit("VisitProcedure") END;
  8524. END VisitProcedure;
  8525. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8526. BEGIN
  8527. VisitProcedure(x);
  8528. END VisitOperator;
  8529. (** statements *)
  8530. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8531. BEGIN
  8532. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8533. Expression(x.call);
  8534. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8535. ReleaseOperand(result)
  8536. END;
  8537. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8538. END VisitProcedureCallStatement;
  8539. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8540. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8541. leftBase, rightBase: SyntaxTree.Type;
  8542. procedureName,s: SyntaxTree.IdentifierString;
  8543. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8544. size: LONGINT; rightKind: LONGINT;
  8545. dummy: IntermediateCode.Operand;
  8546. CONST moduleName = "FoxArrayBase";
  8547. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8548. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8549. BEGIN
  8550. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8551. IF base IS SyntaxTree.MathArrayType THEN
  8552. base := OpenArray(base(SyntaxTree.MathArrayType));
  8553. END;
  8554. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8555. result.SetArrayBase(base);
  8556. RETURN result
  8557. END OpenArray;
  8558. BEGIN
  8559. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8560. SaveRegisters();ReleaseUsedRegisters(saved);
  8561. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8562. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8563. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8564. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8565. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8566. IF leftType.form = SyntaxTree.Tensor THEN
  8567. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8568. ELSIF leftType.form = SyntaxTree.Open THEN
  8569. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8570. ELSIF leftType.form = SyntaxTree.Static THEN
  8571. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8572. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8573. END;
  8574. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8575. IF procedure = NIL THEN
  8576. s := "Instruction not supported on target, emulation procedure ";
  8577. Strings.Append(s,moduleName);
  8578. Strings.Append(s,".");
  8579. Strings.Append(s,procedureName);
  8580. Strings.Append(s," not present");
  8581. Error(position,s);
  8582. ELSE
  8583. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8584. parameter.SetType(leftType);
  8585. parameter.SetAccess(SyntaxTree.Internal);
  8586. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8587. parameter.SetKind(rightKind);
  8588. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8589. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8590. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8591. StaticCallOperand(result,procedure);
  8592. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8593. ReleaseOperand(result);
  8594. END;
  8595. RestoreRegisters(saved);
  8596. END;
  8597. END AssignMathArray;
  8598. VAR modifyAssignmentCounter := 0: LONGINT;
  8599. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8600. VAR processor,mem,dst: IntermediateCode.Operand;
  8601. BEGIN
  8602. IF value.intValue = true.intValue THEN
  8603. INC(modifyAssignmentCounter);
  8604. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8605. modifyAssignmentsPC := section.pc;
  8606. ELSE
  8607. DEC(modifyAssignmentCounter);
  8608. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8609. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8610. END;
  8611. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8612. dst := NewRegisterOperand (addressType);
  8613. Emit(Mov(position,dst, processor));
  8614. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8615. Emit(Mov(position,mem, value));
  8616. ReleaseIntermediateOperand(dst);
  8617. END ModifyAssignments;
  8618. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8619. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8620. BEGIN
  8621. type := left.type.resolved;
  8622. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8623. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8624. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8625. IF procedureType.returnParameter = parameter THEN
  8626. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8627. END;
  8628. END;
  8629. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8630. END CopySize;
  8631. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8632. VAR
  8633. leftO, rightO: Operand;
  8634. mem, sizeOp: IntermediateCode.Operand;
  8635. leftType, rightType, componentType: SyntaxTree.Type;
  8636. size: LONGINT;
  8637. parameters: SyntaxTree.ExpressionList;
  8638. procedure: SyntaxTree.Procedure;
  8639. call: SyntaxTree.ProcedureCallDesignator;
  8640. designator: SyntaxTree.Designator;
  8641. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8642. VAR procedureType: SyntaxTree.ProcedureType;
  8643. BEGIN
  8644. IF ReturnedAsParameter(right.type) THEN
  8645. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8646. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8647. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8648. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8649. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8650. IF right.id = Global.Reshape THEN RETURN TRUE
  8651. END;
  8652. END;
  8653. END;
  8654. END;
  8655. RETURN FALSE
  8656. END CanPassAsResultParameter;
  8657. BEGIN
  8658. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8659. leftType := left.type.resolved; rightType:= right.type.resolved;
  8660. IF backend.cooperative & left.NeedsTrace() THEN
  8661. ModifyAssignments(true);
  8662. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8663. Designate(right, rightO);
  8664. Designate(left, leftO);
  8665. ASSERT(leftO.mode = ModeReference);
  8666. TransferToRegister(leftO.op, leftO.op);
  8667. TransferToRegister(rightO.op, rightO.op);
  8668. Emit(Push(position, leftO.op));
  8669. Emit(Push(position, rightO.op));
  8670. CallAssignMethod(leftO.op, rightO.op, left.type);
  8671. Emit(Pop(position, rightO.op));
  8672. Emit(Pop(position, leftO.op));
  8673. sizeOp := CopySize(left);
  8674. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8675. ReleaseOperand(leftO);
  8676. ReleaseOperand(rightO);
  8677. ELSE
  8678. Evaluate(right,rightO);
  8679. Designate(left,leftO);
  8680. ASSERT(leftO.mode = ModeReference);
  8681. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8682. (* copy procedure address first *)
  8683. MakeMemory(mem,leftO.op,addressType,0);
  8684. Emit(Mov(position,mem,rightO.op));
  8685. ReleaseIntermediateOperand(mem);
  8686. (* copy pointer address *)
  8687. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8688. CallAssignPointer(leftO.tag, rightO.tag);
  8689. ELSE
  8690. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8691. CallAssignPointer(leftO.op, rightO.op);
  8692. END;
  8693. ReleaseOperand(leftO);
  8694. ReleaseOperand(rightO);
  8695. END;
  8696. ModifyAssignments(false);
  8697. RETURN;
  8698. END;
  8699. IF CanPassAsResultParameter(right) THEN
  8700. procedureResultDesignator := left(SyntaxTree.Designator);
  8701. Expression(right);
  8702. procedureResultDesignator := NIL;
  8703. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8704. (* left <-- ALIAS OF right: zerocopy *)
  8705. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8706. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8707. designator.SetType(procedure.type);
  8708. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8709. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8710. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8711. END;
  8712. ELSIF leftType IS SyntaxTree.RangeType THEN
  8713. (* LHS is of array range type *)
  8714. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8715. Evaluate(right, rightO);
  8716. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8717. (* first *)
  8718. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8719. Emit(Mov(position,mem, rightO.op));
  8720. ReleaseIntermediateOperand(mem);
  8721. (* last *)
  8722. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8723. Emit(Mov(position,mem, rightO.tag));
  8724. ReleaseIntermediateOperand(mem);
  8725. (* step *)
  8726. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8727. Emit(Mov(position,mem, rightO.extra));
  8728. ReleaseIntermediateOperand(mem);
  8729. ReleaseOperand(rightO);
  8730. ReleaseOperand(leftO)
  8731. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8732. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8733. Evaluate(right, rightO);
  8734. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8735. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8736. (* real part *)
  8737. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8738. Emit(Mov(position,mem, rightO.op));
  8739. ReleaseIntermediateOperand(mem);
  8740. (* imaginary part *)
  8741. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8742. Emit(Mov(position,mem, rightO.tag));
  8743. ReleaseIntermediateOperand(mem);
  8744. ReleaseOperand(rightO);
  8745. ReleaseOperand(leftO)
  8746. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8747. OR (leftType IS SyntaxTree.PortType) THEN
  8748. (* rightO := leftO;*)
  8749. Evaluate(right,rightO);
  8750. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8751. Designate(left,leftO);
  8752. IF leftO.mode = ModeReference THEN
  8753. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8754. destination := mem;
  8755. ELSE
  8756. destination := leftO.op;
  8757. END;
  8758. ReleaseOperand(leftO);
  8759. IF destination.mode # IntermediateCode.Undefined THEN
  8760. Emit(Mov(position,destination,rightO.op));
  8761. END;
  8762. ReleaseOperand(rightO);
  8763. ReleaseIntermediateOperand(mem);
  8764. IntermediateCode.InitOperand(destination);
  8765. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8766. Evaluate(right,rightO);
  8767. Designate(left,leftO);
  8768. MakeMemory(mem,leftO.op,addressType,0);
  8769. Emit(Mov(position,mem,rightO.op));
  8770. ReleaseIntermediateOperand(mem);
  8771. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8772. (* delegate *)
  8773. (*
  8774. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8775. *)
  8776. Emit(Mov(position,leftO.tag,rightO.tag));
  8777. END;
  8778. ReleaseOperand(leftO);
  8779. ReleaseOperand(rightO);
  8780. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8781. Designate(right,rightO);
  8782. Designate(left,leftO);
  8783. sizeOp := CopySize(left);
  8784. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8785. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8786. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8787. IF (rightType IS SyntaxTree.StringType) THEN
  8788. CopyString(left,right);
  8789. 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
  8790. Designate(right,rightO);
  8791. Designate(left,leftO);
  8792. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8793. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8794. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8795. ELSE
  8796. HALT(201)
  8797. END;
  8798. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8799. AssignMathArray(left,right);
  8800. ELSE
  8801. HALT(200);
  8802. END;
  8803. END Assign;
  8804. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8805. BEGIN
  8806. IF Trace THEN TraceEnter("VisitAssignment") END;
  8807. Assign(x.left,x.right);
  8808. IF Trace THEN TraceExit("VisitAssignment") END;
  8809. END VisitAssignment;
  8810. PROCEDURE EmitCooperativeSwitch;
  8811. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8812. BEGIN
  8813. ASSERT (cooperativeSwitches);
  8814. pc := section.pc;
  8815. IF lastSwitchPC = section.pc THEN RETURN END;
  8816. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8817. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8818. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8819. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  8820. INC(statCoopSwitch, section.pc - pc);
  8821. END EmitCooperativeSwitch;
  8822. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8823. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  8824. BEGIN
  8825. p0 := communication.left; p1 := communication.right;
  8826. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  8827. Evaluate(p0,s0);
  8828. Evaluate(p1,s1);
  8829. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8830. Emit(Push(position,s0.op));
  8831. Emit(Push(position,s1.op));
  8832. (*
  8833. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8834. *)
  8835. IF ~backend.cellsAreObjects THEN
  8836. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  8837. END;
  8838. ReleaseOperand(s0);
  8839. ReleaseOperand(s1);
  8840. IF backend.cellsAreObjects THEN
  8841. CallThis(position,"ActiveCellsRuntime","Send",2);
  8842. ELSE
  8843. CallThis(position,ChannelModuleName,"Send",2);
  8844. END;
  8845. (* ----- RECEIVE ------*)
  8846. ELSE
  8847. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  8848. tmp := p0; p0 := p1; p1 := tmp;
  8849. END;
  8850. Evaluate(p0,s0);
  8851. Emit(Push(position,s0.op));
  8852. Designate(p1,s1);
  8853. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8854. Emit(Push(position,s1.op));
  8855. (*
  8856. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8857. *)
  8858. IF ~backend.cellsAreObjects THEN
  8859. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  8860. END;
  8861. ReleaseOperand(s0);
  8862. ReleaseOperand(s1);
  8863. IF backend.cellsAreObjects THEN
  8864. CallThis(position,"ActiveCellsRuntime","Receive",2);
  8865. ELSE
  8866. CallThis(position,ChannelModuleName,"Receive",2)
  8867. END;
  8868. END;
  8869. END VisitCommunicationStatement;
  8870. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  8871. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  8872. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  8873. VAR true, false: Label; condition, value: BOOLEAN;
  8874. BEGIN
  8875. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  8876. IF condition THEN
  8877. true := NewLabel();
  8878. false := NewLabel();
  8879. Condition(if.condition,true,false);
  8880. SetLabel(true);
  8881. StatementSequence(if.statements);
  8882. BrL(end);
  8883. SetLabel(false);
  8884. ELSE
  8885. IF value THEN (* always true *)
  8886. escape := TRUE;
  8887. StatementSequence(if.statements);
  8888. (* no branch necessary -- rest skipped *)
  8889. END;
  8890. END;
  8891. END IfPart;
  8892. BEGIN
  8893. IF Trace THEN TraceEnter("VisitIfStatement") END;
  8894. end := NewLabel();
  8895. elsifs := x.ElsifParts();
  8896. IfPart(x.ifPart);
  8897. FOR i := 0 TO elsifs-1 DO
  8898. IF ~escape THEN
  8899. elsif := x.GetElsifPart(i);
  8900. IfPart(elsif);
  8901. END;
  8902. END;
  8903. IF (x.elsePart # NIL) & ~escape THEN
  8904. StatementSequence(x.elsePart);
  8905. END;
  8906. SetLabel(end);
  8907. IF Trace THEN TraceExit("VisitIfStatement") END;
  8908. END VisitIfStatement;
  8909. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  8910. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  8911. BEGIN
  8912. (*IF x.variable.type.resolved = x.type.resolved THEN
  8913. (* always true, do nothing *)
  8914. ELSE*)
  8915. Designate(x.variable,res);
  8916. IF IsPointerToRecord(x.variable.type,recordType) THEN
  8917. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  8918. END;
  8919. trueL := NewLabel();
  8920. TypeTest(res.tag,x.type,trueL,falseL);
  8921. ReleaseOperand(res);
  8922. SetLabel(trueL);
  8923. StatementSequence(x.statements);
  8924. BrL(endL);
  8925. END WithPart;
  8926. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  8927. VAR endL,falseL: Label;i: LONGINT;
  8928. BEGIN
  8929. IF Trace THEN TraceEnter("VisitWithStatement") END;
  8930. endL := NewLabel();
  8931. FOR i := 0 TO x.WithParts()-1 DO
  8932. falseL := NewLabel();
  8933. WithPart(x.GetWithPart(i),falseL,endL);
  8934. SetLabel(falseL);
  8935. END;
  8936. IF x.elsePart = NIL THEN
  8937. IF ~isUnchecked THEN
  8938. EmitTrap(position,WithTrap);
  8939. END;
  8940. ELSE
  8941. StatementSequence(x.elsePart)
  8942. END;
  8943. SetLabel(endL);
  8944. IF Trace THEN TraceExit("VisitWithStatement") END;
  8945. END VisitWithStatement;
  8946. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  8947. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  8948. out,else: Label; label: Label;
  8949. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  8950. symbol: SyntaxTree.Symbol;
  8951. BEGIN
  8952. (*! split case statement into if-elsif statements for large case label lists *)
  8953. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  8954. size := x.max-x.min+1;
  8955. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  8956. END;
  8957. Evaluate(x.variable,var);
  8958. ReuseCopy(tmp,var.op);
  8959. ReleaseIntermediateOperand(var.op);
  8960. var.op := tmp;
  8961. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  8962. Convert(var.op,addressType);
  8963. size := x.max-x.min+1;
  8964. else := NewLabel();
  8965. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  8966. (*
  8967. UniqueId(name,module.module,"case",caseId);
  8968. *)
  8969. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  8970. Global.GetModuleSegmentedName(module.module, name);
  8971. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  8972. symbol := SyntaxTree.NewSymbol(name[1]);
  8973. symbol.SetScope(moduleScope);
  8974. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  8975. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  8976. section.isCaseTable := TRUE;
  8977. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  8978. ReuseCopy(res,var.op);
  8979. ReleaseOperand(var);
  8980. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  8981. Emit(Add(position,res,res,jmp));
  8982. IntermediateCode.MakeMemory(res,addressType);
  8983. Emit(Br(position,res));
  8984. ReleaseIntermediateOperand(res);
  8985. out := NewLabel();
  8986. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  8987. part := x.GetCasePart(i);
  8988. constant := part.firstConstant;
  8989. label := NewLabel();
  8990. SetLabel(label);
  8991. WHILE(constant # NIL) DO (* case labels for this case part *)
  8992. FOR j := constant.min TO constant.max DO
  8993. fixups[j-x.min] := label;
  8994. END;
  8995. constant := constant.next;
  8996. END;
  8997. StatementSequence(part.statements);
  8998. BrL(out);
  8999. END;
  9000. SetLabel(else);
  9001. FOR i := 0 TO size-1 DO
  9002. IF fixups[i] = NIL THEN
  9003. fixups[i] := else;
  9004. END;
  9005. END;
  9006. IF x.elsePart # NIL THEN
  9007. StatementSequence(x.elsePart);
  9008. ELSIF ~isUnchecked THEN
  9009. EmitTrap(position,CaseTrap);
  9010. END;
  9011. SetLabel(out);
  9012. FOR i := 0 TO size-1 DO
  9013. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9014. section.Emit(Data(position,op));
  9015. END;
  9016. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9017. END VisitCaseStatement;
  9018. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9019. VAR start: Label; true,false: Label;
  9020. BEGIN
  9021. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9022. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9023. start := NewLabel();
  9024. true := NewLabel();
  9025. false := NewLabel();
  9026. SetLabel(start);
  9027. Condition(x.condition,true,false);
  9028. SetLabel(true);
  9029. StatementSequence(x.statements);
  9030. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9031. BrL(start);
  9032. SetLabel(false);
  9033. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9034. END VisitWhileStatement;
  9035. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9036. VAR false,true: Label;
  9037. BEGIN
  9038. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9039. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9040. true := NewLabel();
  9041. false := NewLabel();
  9042. SetLabel(false);
  9043. StatementSequence(x.statements);
  9044. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9045. Condition(x.condition,true,false);
  9046. SetLabel(true);
  9047. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9048. END VisitRepeatStatement;
  9049. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9050. VAR
  9051. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9052. temporaryVariable: SyntaxTree.Variable;
  9053. temporaryVariableDesignator : SyntaxTree.Designator;
  9054. BEGIN
  9055. IF Trace THEN TraceEnter("VisitForStatement") END;
  9056. true := NewLabel();
  9057. false := NewLabel();
  9058. start := NewLabel();
  9059. Assign(x.variable,x.from);
  9060. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9061. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9062. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9063. Assign(temporaryVariableDesignator,x.to);
  9064. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9065. IF by > 0 THEN
  9066. cmp := Scanner.LessEqual
  9067. ELSE
  9068. cmp := Scanner.GreaterEqual
  9069. END;
  9070. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9071. binary.SetType(system.booleanType);
  9072. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9073. SetLabel(start);
  9074. Condition(binary,true,false);
  9075. SetLabel(true);
  9076. StatementSequence(x.statements);
  9077. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9078. binary.SetType(x.variable.type);
  9079. Assign(x.variable,binary);
  9080. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9081. BrL(start);
  9082. SetLabel(false);
  9083. IF Trace THEN TraceExit("VisitForStatement") END;
  9084. END VisitForStatement;
  9085. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9086. VAR prevLoop: Label;
  9087. BEGIN
  9088. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9089. prevLoop := currentLoop;
  9090. currentLoop := NewLabel();
  9091. StatementSequence(x.statements);
  9092. SetLabel(currentLoop);
  9093. currentLoop := prevLoop;
  9094. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9095. END VisitExitableBlock;
  9096. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9097. VAR prevLoop,start: Label;
  9098. BEGIN
  9099. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9100. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9101. start := NewLabel();
  9102. prevLoop := currentLoop;
  9103. SetLabel(start);
  9104. currentLoop := NewLabel();
  9105. StatementSequence(x.statements);
  9106. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9107. BrL(start);
  9108. SetLabel(currentLoop);
  9109. currentLoop := prevLoop;
  9110. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9111. END VisitLoopStatement;
  9112. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9113. VAR outer: SyntaxTree.Statement;
  9114. BEGIN
  9115. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9116. IF locked THEN (* r if we jump out of an exclusive block *)
  9117. outer := x.outer;
  9118. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9119. outer := outer.outer;
  9120. END;
  9121. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9122. Lock(FALSE);
  9123. END;
  9124. END;
  9125. BrL(currentLoop);
  9126. IF Trace THEN TraceExit("VisitExitStatement") END;
  9127. END VisitExitStatement;
  9128. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9129. VAR
  9130. expression, parameterDesignator: SyntaxTree.Expression;
  9131. type, componentType: SyntaxTree.Type;
  9132. res, right: Operand;
  9133. left, mem, reg: IntermediateCode.Operand;
  9134. parameter: SyntaxTree.Parameter;
  9135. procedure: SyntaxTree.Procedure;
  9136. procedureType: SyntaxTree.ProcedureType;
  9137. returnTypeOffset: LONGINT;
  9138. delegate: BOOLEAN;
  9139. map: SymbolMap;
  9140. BEGIN
  9141. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9142. expression := x.returnValue;
  9143. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9144. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9145. IF currentIsInline THEN
  9146. IF expression # NIL THEN
  9147. map := currentMapper.Get(NIL);
  9148. IF map # NIL THEN
  9149. Assign(map.to, expression);
  9150. END;
  9151. END;
  9152. BrL(currentInlineExit);
  9153. RETURN;
  9154. END;
  9155. IF expression # NIL THEN
  9156. type := expression.type.resolved;
  9157. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9158. IF locked THEN Lock(FALSE) END;
  9159. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9160. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9161. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9162. (* return without structured return parameter *)
  9163. Evaluate(expression,res);
  9164. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9165. IF locked OR profile THEN
  9166. Emit(Push(position,res.op));
  9167. IF delegate THEN HALT(200) END;
  9168. ReleaseOperand(res);
  9169. IF locked THEN Lock(FALSE) END;
  9170. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9171. reg := NewRegisterOperand(res.op.type);
  9172. Emit(Pop(position,reg));
  9173. Emit(Return(position,reg));
  9174. ReleaseIntermediateOperand(reg);
  9175. ELSE
  9176. Emit(Return(position,res.op));
  9177. ReleaseOperand(res);
  9178. END;
  9179. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9180. THEN
  9181. (* return using structured return parameter *)
  9182. 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)
  9183. OR SemanticChecker.IsPointerType(type));
  9184. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9185. parameter :=procedureType.returnParameter;
  9186. ASSERT(parameter # NIL);
  9187. returnTypeOffset := parameter.offsetInBits;
  9188. (*
  9189. IF parameter# NIL THEN
  9190. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9191. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9192. ELSE
  9193. returnTypeOffset := system.offsetFirstParameter
  9194. END;
  9195. *)
  9196. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9197. IF type IS SyntaxTree.RangeType THEN
  9198. (* array range type *)
  9199. Evaluate(expression, right);
  9200. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9201. Emit(Mov(position,mem, right.op)); (* first *)
  9202. ReleaseIntermediateOperand(mem);
  9203. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9204. Emit(Mov(position,mem, right.tag)); (* last *)
  9205. ReleaseIntermediateOperand(mem);
  9206. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9207. Emit(Mov(position,mem, right.extra)); (* step *)
  9208. ReleaseIntermediateOperand(mem);
  9209. ReleaseOperand(right);
  9210. ELSIF type IS SyntaxTree.ComplexType THEN
  9211. Evaluate(expression, right);
  9212. componentType := type(SyntaxTree.ComplexType).componentType;
  9213. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9214. Emit(Mov(position,mem, right.op)); (* real part *)
  9215. ReleaseIntermediateOperand(mem);
  9216. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9217. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9218. ReleaseIntermediateOperand(mem);
  9219. ReleaseOperand(right);
  9220. ELSE (* covers cases: pointer / record / array *)
  9221. parameter := procedureType.returnParameter;
  9222. checker.SetCurrentScope(currentScope);
  9223. ASSERT(parameter # NIL);
  9224. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9225. Assign(parameterDesignator,expression);
  9226. END;
  9227. ReleaseIntermediateOperand(left);
  9228. IF locked THEN Lock(FALSE) END;
  9229. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9230. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9231. parameter := procedureType.returnParameter;
  9232. checker.SetCurrentScope(currentScope);
  9233. IF parameter = NIL THEN
  9234. Error(procedure.position, "structured return of parameter of procedure not found");
  9235. ELSE
  9236. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9237. Assign(parameterDesignator,expression);
  9238. END;
  9239. IF locked THEN Lock(FALSE) END;
  9240. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9241. ELSE
  9242. HALT(200);
  9243. END;
  9244. ELSE
  9245. IF locked THEN Lock(FALSE) END;
  9246. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9247. END;
  9248. IF backend.cooperative THEN
  9249. BrL(exitLabel);
  9250. ELSE
  9251. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9252. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9253. END;
  9254. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9255. END VisitReturnStatement;
  9256. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9257. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9258. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9259. statements: SyntaxTree.StatementSequence;
  9260. name, suffix: SyntaxTree.IdentifierString;
  9261. BEGIN
  9262. Strings.IntToStr(awaitProcCounter,suffix);
  9263. Strings.Concat("@AwaitProcedure",suffix,name);
  9264. identifier := SyntaxTree.NewIdentifier(name);
  9265. INC(awaitProcCounter);
  9266. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9267. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9268. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9269. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9270. procedure.SetAccess(SyntaxTree.Hidden);
  9271. procedure.SetScope(currentScope);
  9272. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9273. procedureType.SetReturnType(system.booleanType);
  9274. procedure.SetType(procedureType);
  9275. body := SyntaxTree.NewBody(x.position,procedureScope);
  9276. procedureScope.SetBody(body);
  9277. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9278. returnStatement.SetReturnValue(x.condition);
  9279. statements := SyntaxTree.NewStatementSequence();
  9280. statements.AddStatement(returnStatement);
  9281. body.SetStatementSequence(statements);
  9282. currentScope.AddProcedure(procedure);
  9283. RETURN procedure
  9284. END MakeAwaitProcedure;
  9285. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9286. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9287. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9288. BEGIN
  9289. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9290. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9291. IF backend.cooperative THEN
  9292. start := NewLabel();
  9293. true := NewLabel();
  9294. false := NewLabel();
  9295. SetLabel(start);
  9296. Condition(x.condition,true,false);
  9297. SetLabel(false);
  9298. PushSelfPointer();
  9299. CallThis(position,"ExclusiveBlocks","Await",1);
  9300. BrL(start);
  9301. SetLabel(true);
  9302. PushSelfPointer();
  9303. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9304. ELSE
  9305. proc := MakeAwaitProcedure(x);
  9306. Emit(Push(position,fp));
  9307. GetCodeSectionNameForSymbol(proc,name);
  9308. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9309. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9310. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9311. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9312. Emit(Result(position,res));
  9313. (*
  9314. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9315. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9316. *)
  9317. InitOperand(result,ModeValue);
  9318. result.op := res;
  9319. label := NewLabel();
  9320. BreqL(label, result.op, SELF.true);
  9321. ReleaseOperand(result);
  9322. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9323. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9324. Emit(Push(position,res));
  9325. Emit(Push(position,fp));
  9326. PushSelfPointer();
  9327. Emit(Push(position,nil));
  9328. CallThis(position,"Objects","Await",4);
  9329. SetLabel(label);
  9330. END;
  9331. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9332. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9333. END VisitAwaitStatement;
  9334. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9335. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9336. BEGIN
  9337. FOR i := 0 TO x.Length() - 1 DO
  9338. statement := x.GetStatement( i );
  9339. Statement(statement);
  9340. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9341. END;
  9342. END StatementSequence;
  9343. PROCEDURE PushSelfPointer;
  9344. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9345. BEGIN
  9346. scope := currentScope;
  9347. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9348. scope := scope.outerScope;
  9349. END;
  9350. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9351. IF ~newObjectFile THEN
  9352. Symbol(moduleSelf,op);
  9353. IntermediateCode.MakeMemory(op.op,addressType);
  9354. ELSE
  9355. moduleSection := meta.ModuleSection();
  9356. IF backend.cooperative THEN
  9357. moduleOffset := 0;
  9358. ELSE
  9359. moduleOffset := moduleSection.pc;
  9360. END;
  9361. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9362. END;
  9363. ELSE
  9364. GetBaseRegister(op.op,currentScope,scope);
  9365. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9366. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9367. IF backend.cooperative THEN
  9368. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9369. END;
  9370. IntermediateCode.MakeMemory(op.op,addressType);
  9371. END;
  9372. Emit(Push(position,op.op));
  9373. ReleaseOperand(op);
  9374. END PushSelfPointer;
  9375. PROCEDURE Lock(lock: BOOLEAN);
  9376. BEGIN
  9377. IF Trace THEN TraceEnter("Lock") END;
  9378. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9379. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9380. ASSERT(modifyAssignmentCounter = 0);
  9381. IF dump # NIL THEN
  9382. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9383. dump.Ln;dump.Update;
  9384. END;
  9385. PushSelfPointer;
  9386. IF backend.cooperative THEN
  9387. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9388. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9389. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9390. END;
  9391. ELSE
  9392. Emit(Push(position,true));
  9393. IF lock THEN CallThis(position,"Objects","Lock",2)
  9394. ELSE CallThis(position,"Objects","Unlock",2);
  9395. END;
  9396. END;
  9397. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9398. IF Trace THEN TraceExit("Lock") END;
  9399. END Lock;
  9400. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9401. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9402. BEGIN
  9403. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9404. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9405. previouslyUnchecked := isUnchecked;
  9406. isUnchecked := isUnchecked OR x.isUnchecked;
  9407. previouslyCooperativeSwitches := cooperativeSwitches;
  9408. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9409. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9410. IF x.statements # NIL THEN
  9411. StatementSequence(x.statements);
  9412. END;
  9413. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9414. isUnchecked := previouslyUnchecked;
  9415. cooperativeSwitches := previouslyCooperativeSwitches;
  9416. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9417. END VisitStatementBlock;
  9418. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9419. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9420. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9421. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9422. procedure: SyntaxTree.Procedure;
  9423. map: SymbolMap;
  9424. BEGIN
  9425. scope := currentScope;
  9426. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9427. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9428. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9429. return := emptyOperand;
  9430. IF Trace THEN TraceEnter("VisitCode") END;
  9431. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9432. NEW(in, x.inRules.Length());
  9433. FOR i := 0 TO LEN(in)-1 DO
  9434. statement := x.inRules.GetStatement(i);
  9435. WITH statement: SyntaxTree.Assignment DO
  9436. Evaluate(statement.right, operand);
  9437. result := operand.op;
  9438. NEW(str, 64);
  9439. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9440. in[i] := result; IntermediateCode.SetString(in[i], str);
  9441. ReleaseIntermediateOperand(operand.tag);
  9442. END;
  9443. END;
  9444. ELSE in := NIL
  9445. END;
  9446. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9447. NEW(out, x.outRules.Length());
  9448. FOR i := 0 TO LEN(out)-1 DO
  9449. statement := x.outRules.GetStatement(i);
  9450. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9451. WITH statement: SyntaxTree.Assignment DO
  9452. Evaluate(statement.left, operand); (*?? or designate *)
  9453. result := operand.op;
  9454. NEW(str, 64);
  9455. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9456. out[i] := result; IntermediateCode.SetString(out[i], str);
  9457. ReleaseIntermediateOperand(operand.tag);
  9458. |statement: SyntaxTree.ReturnStatement DO
  9459. NEW(str, 64);
  9460. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9461. IF currentIsInline THEN
  9462. map := currentMapper.Get(NIL);
  9463. Evaluate(map.to, operand);
  9464. out[i] := operand.op;
  9465. ELSE
  9466. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9467. END;
  9468. IntermediateCode.SetString(out[i], str);
  9469. ReleaseIntermediateOperand(operand.tag);
  9470. return := out[i];
  9471. ELSE
  9472. END;
  9473. END;
  9474. ELSE out := NIL
  9475. END;
  9476. Emit(Asm(x.position,x.sourceCode, in, out));
  9477. IF in # NIL THEN
  9478. FOR i := 0 TO LEN(in)-1 DO
  9479. ReleaseIntermediateOperand(in[i]);
  9480. END;
  9481. END;
  9482. IF out # NIL THEN
  9483. FOR i := 0 TO LEN(out)-1 DO
  9484. WITH statement: SyntaxTree.Assignment DO
  9485. ReleaseIntermediateOperand(out[i]);
  9486. ELSE
  9487. IF currentIsInline THEN
  9488. ReleaseIntermediateOperand(out[i]);
  9489. END;
  9490. END;
  9491. statement := x.outRules.GetStatement(i);
  9492. END;
  9493. END;
  9494. IF return.mode # IntermediateCode.Undefined THEN
  9495. IF currentIsInline THEN
  9496. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9497. Symbol(procedureType.returnParameter, par);
  9498. MakeMemory(mem, par.op, return.type, 0);
  9499. ReleaseOperand(par);
  9500. Emit(Mov(position, mem, return));
  9501. ReleaseIntermediateOperand(mem);
  9502. ELSE
  9503. Emit(Return(position,return));
  9504. END;
  9505. IF currentIsInline THEN RETURN END;
  9506. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9507. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9508. ReleaseIntermediateOperand(return);
  9509. END;
  9510. IF Trace THEN TraceExit("VisitCode") END;
  9511. END VisitCode;
  9512. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9513. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9514. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9515. const, call: IntermediateCode.Operand;
  9516. parameterDesignator: SyntaxTree.Expression;
  9517. saved: RegisterEntry;
  9518. name: Basic.SegmentedName;
  9519. BEGIN
  9520. IF Trace THEN TraceEnter("ParameterCopies") END;
  9521. parameter := x.firstParameter;
  9522. WHILE parameter # NIL DO
  9523. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9524. type := parameter.type.resolved;
  9525. IF IsOpenArray(type) THEN
  9526. VisitParameter(parameter);
  9527. op := result;
  9528. IF backend.cooperative & parameter.NeedsTrace() THEN
  9529. length := GetArrayLength(type, op.tag);
  9530. size := NewRegisterOperand(addressType);
  9531. base := ArrayBaseType(type);
  9532. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9533. Emit(Mul(position, size, length, const));
  9534. dst := NewRegisterOperand (addressType);
  9535. Emit(Mov(position, dst, size));
  9536. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9537. Emit(Sub(position,dst,sp,dst));
  9538. Emit(And(position,dst,dst,const));
  9539. Emit(Mov(position,sp,dst));
  9540. par := fp;
  9541. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9542. IntermediateCode.InitImmediate(null, byteType, 0);
  9543. Emit(Fill(position, dst, size, null));
  9544. ReleaseIntermediateOperand(dst);
  9545. ReleaseIntermediateOperand(length);
  9546. SaveRegisters();ReleaseUsedRegisters(saved);
  9547. (* register dst has been freed before SaveRegisters already *)
  9548. base := ArrayBaseType(type);
  9549. (* assign method of open array *)
  9550. IF base.IsRecordType() THEN
  9551. Emit (Push(position, length));
  9552. Emit (Push(position, dst));
  9553. Emit (Push(position, op.op));
  9554. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9555. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9556. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9557. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9558. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9559. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9560. Emit (Push(position,length));
  9561. Emit (Push(position, dst));
  9562. Emit (Push(position, length));
  9563. Emit (Push(position, op.op));
  9564. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9565. ELSE
  9566. Emit (Push(position, length));
  9567. Emit (Push(position, dst));
  9568. Emit (Push(position, length));
  9569. Emit (Push(position, op.op));
  9570. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9571. ASSERT(ArrayBaseType(type).IsPointer());
  9572. END;
  9573. RestoreRegisters(saved);
  9574. ELSE
  9575. temp := GetDynamicSize(type,op.tag);
  9576. ReuseCopy(size,temp);
  9577. ReleaseIntermediateOperand(temp);
  9578. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9579. Emit(Sub(position,size,sp,size));
  9580. Emit(And(position,size,size,const));
  9581. Emit(Mov(position,sp,size));
  9582. par := fp;
  9583. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9584. ReleaseIntermediateOperand(size);
  9585. size := GetDynamicSize(type,op.tag);
  9586. END;
  9587. Emit(Copy(position,sp,op.op,size));
  9588. ReleaseIntermediateOperand(size);
  9589. ReleaseOperand(op);
  9590. IntermediateCode.MakeMemory(par,addressType);
  9591. Emit(Mov(position,par,sp));
  9592. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9593. checker.SetCurrentScope(currentScope);
  9594. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9595. Assign(parameterDesignator,parameterDesignator);
  9596. END;
  9597. END;
  9598. parameter := parameter.nextParameter;
  9599. END;
  9600. IF Trace THEN TraceExit("ParameterCopies") END;
  9601. END ParameterCopies;
  9602. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9603. VAR x: SyntaxTree.Variable;
  9604. BEGIN
  9605. x := scope.firstVariable;
  9606. WHILE x # NIL DO
  9607. InitVariable(x);
  9608. x := x.nextVariable;
  9609. END;
  9610. END InitVariables;
  9611. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9612. BEGIN
  9613. IF (symbol # NIL) THEN
  9614. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9615. ELSE
  9616. RETURN 0
  9617. END;
  9618. END GetFingerprint;
  9619. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9620. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9621. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9622. saved: RegisterEntry;
  9623. BEGIN
  9624. IF Trace THEN TraceEnter("Body") END;
  9625. ReleaseUsedRegisters(saved); (* just in case ... *)
  9626. section := ir;
  9627. exitLabel := NewLabel ();
  9628. IF moduleBody THEN moduleBodySection := section END;
  9629. IF ir.comments # NIL THEN
  9630. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9631. commentPrintout.SingleStatement(TRUE);
  9632. dump := ir.comments;
  9633. ELSE
  9634. commentPrintout := NIL;
  9635. dump := NIL;
  9636. END;
  9637. prevScope := currentScope;
  9638. currentScope := scope;
  9639. lastSwitchPC := 0;
  9640. cooperativeSwitches := backend.cooperative;
  9641. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9642. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9643. IF x # NIL THEN
  9644. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9645. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9646. IF moduleBody THEN
  9647. ProfilerInit();
  9648. ELSE
  9649. Basic.SegmentedNameToString(ir.name, string);
  9650. ProfilerAddProcedure(numberProcedures,string);
  9651. ProfilerEnterExit(numberProcedures,TRUE);
  9652. END;
  9653. END;
  9654. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9655. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9656. END;
  9657. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9658. IF moduleBody THEN
  9659. InitVariables(moduleScope)
  9660. END;
  9661. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9662. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9663. IF procedure = cellScope.bodyProcedure THEN
  9664. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9665. StaticCallOperand(op, cellScope.constructor);
  9666. Emit(Call(position,op.op,0));
  9667. END;
  9668. END;
  9669. END;
  9670. ParameterCopies(procedureType);
  9671. InitVariables(scope);
  9672. IF x.code = NIL THEN
  9673. VisitStatementBlock(x);
  9674. ELSE
  9675. VisitCode(x.code)
  9676. END;
  9677. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9678. ir.SetFinally(ir.pc);
  9679. StatementSequence(x.finally)
  9680. END;
  9681. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9682. IF ~backend.cooperative THEN
  9683. ProfilerEnterExit(numberProcedures,FALSE);
  9684. END;
  9685. INC(numberProcedures);
  9686. END;
  9687. END;
  9688. IF backend.cooperative THEN
  9689. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9690. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9691. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9692. (*! not required any more? check and delete!
  9693. PushSelfPointer();
  9694. CallThis(position,"Modules","SetInitialized",1);
  9695. *)
  9696. (*
  9697. SetLabel(end);
  9698. *)
  9699. END;
  9700. IF x # NIL THEN
  9701. SELF.position := x.position;
  9702. END;
  9703. CheckRegistersFree();
  9704. ASSERT(modifyAssignmentCounter = 0);
  9705. currentScope := prevScope;
  9706. IF Trace THEN TraceExit("Body") END;
  9707. END Body;
  9708. END ImplementationVisitor;
  9709. MetaDataGenerator=OBJECT
  9710. VAR
  9711. implementationVisitor: ImplementationVisitor;
  9712. declarationVisitor: DeclarationVisitor;
  9713. module: Sections.Module;
  9714. moduleName: ARRAY 128 OF CHAR;
  9715. moduleNamePool: Basic.HashTableInt;
  9716. moduleNamePoolSection: IntermediateCode.Section;
  9717. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9718. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9719. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9720. TypeTags: LONGINT; (* type extension level support *)
  9721. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9722. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9723. BEGIN
  9724. IF implementationVisitor.backend.cooperative THEN
  9725. TypeTags := MAX(LONGINT);
  9726. BaseTypesTableOffset := 0;
  9727. MethodTableOffset := 2;
  9728. TypeRecordBaseOffset := 0;
  9729. ELSIF simple THEN
  9730. TypeTags := 3; (* only 3 extensions allowed *)
  9731. BaseTypesTableOffset := 1;
  9732. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9733. TypeRecordBaseOffset := 0;
  9734. ELSE
  9735. TypeTags := 16;
  9736. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9737. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9738. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9739. END;
  9740. SELF.simple := simple;
  9741. SELF.implementationVisitor := implementationVisitor;
  9742. SELF.declarationVisitor := declarationVisitor;
  9743. implementationVisitor.meta := SELF;
  9744. declarationVisitor.meta := SELF;
  9745. END InitMetaDataGenerator;
  9746. PROCEDURE SetModule(module: Sections.Module);
  9747. VAR namePoolOffset: LONGINT;
  9748. BEGIN
  9749. SELF.module := module;
  9750. Global.GetModuleName(module.module,moduleName);
  9751. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9752. NEW(moduleNamePool, 32);
  9753. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9754. END;
  9755. END SetModule;
  9756. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9757. BEGIN
  9758. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9759. END GetTypeRecordBaseOffset;
  9760. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9761. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9762. BEGIN
  9763. INC(dataAdrOffset,6);
  9764. Info(section,"headerAdr");
  9765. Address(section,0);
  9766. Info(section,"typeDesc");
  9767. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9768. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9769. NamedSymbol(section, name, symbol, 0, offset);
  9770. Info(section,"mark: LONGINT;");
  9771. Longint(section,-1);
  9772. Info(section,"dataAdr-: ADDRESS");
  9773. Symbol(section,section, dataAdrOffset,0);
  9774. Info(section,"size-: SIZE");
  9775. Address(section,0);
  9776. Info(section,"nextRealtime: HeapBlock;");
  9777. Address(section,0);
  9778. END HeapBlock;
  9779. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9780. VAR i: LONGINT;
  9781. BEGIN
  9782. INC(dataAdrOffset,14);
  9783. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9784. Info(section,"count*: LONGINT");
  9785. Longint(section,0);
  9786. Info(section,"locked*: BOOLEAN");
  9787. Longint(section,0);
  9788. Info(section,"awaitingLock*: ProcessQueue");
  9789. Address(section,0);
  9790. Address(section,0);
  9791. Info(section,"awaitingCond*: ProcessQueue");
  9792. Address(section,0);
  9793. Address(section,0);
  9794. Info(section,"lockedBy*: ANY");
  9795. Address(section,0);
  9796. Info(section,"lock*: ANY");
  9797. Address(section,0);
  9798. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9799. Longint(section,1);
  9800. FOR i := 2 TO 6 DO
  9801. Longint(section,0);
  9802. END;
  9803. END ProtectedHeapBlock;
  9804. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9805. BEGIN
  9806. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9807. END Info;
  9808. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9809. VAR op: IntermediateCode.Operand;
  9810. BEGIN
  9811. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9812. section.Emit(Data(-11,op));
  9813. END Address;
  9814. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9815. VAR op: IntermediateCode.Operand;
  9816. BEGIN
  9817. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9818. section.Emit(Data(-12,op));
  9819. END Size;
  9820. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9821. VAR op: IntermediateCode.Operand;
  9822. BEGIN
  9823. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9824. section.Emit(Data(-1,op));
  9825. END Set;
  9826. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9827. VAR op: IntermediateCode.Operand;
  9828. BEGIN
  9829. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9830. section.Emit(Data(-1,op));
  9831. END Longint;
  9832. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  9833. VAR op,noOperand: IntermediateCode.Operand;
  9834. BEGIN
  9835. IntermediateCode.InitOperand(noOperand);
  9836. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9837. section.PatchOperands(pc,op,noOperand,noOperand);
  9838. END PatchLongint;
  9839. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9840. VAR op, noOperand: IntermediateCode.Operand;
  9841. BEGIN
  9842. IntermediateCode.InitOperand(noOperand);
  9843. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9844. section.PatchOperands(pc,op,noOperand,noOperand);
  9845. END PatchSymbol;
  9846. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  9847. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  9848. BEGIN
  9849. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  9850. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  9851. section.Emit(Data(-1,op));
  9852. END Boolean;
  9853. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  9854. VAR op: IntermediateCode.Operand;
  9855. BEGIN
  9856. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  9857. section.Emit(Data(-1,op));
  9858. END Char;
  9859. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  9860. VAR i: LONGINT;
  9861. BEGIN
  9862. Info(section,str);
  9863. i := 0;
  9864. WHILE(str[i] # 0X) DO
  9865. Char(section,str[i]);
  9866. INC(i);
  9867. END;
  9868. Char(section,0X);
  9869. END String;
  9870. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9871. VAR op: IntermediateCode.Operand;
  9872. BEGIN
  9873. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9874. IntermediateCode.SetOffset(op,realOffset);
  9875. section.Emit(Data(-1,op));
  9876. END NamedSymbol;
  9877. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  9878. BEGIN
  9879. IF symbol= NIL THEN
  9880. Address( section, realOffset);
  9881. ASSERT(virtualOffset = 0);
  9882. ELSE
  9883. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  9884. END;
  9885. END Symbol;
  9886. (* OutPointers delivers
  9887. {pointerOffset}
  9888. *)
  9889. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  9890. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  9891. BEGIN
  9892. type := type.resolved;
  9893. IF type IS SyntaxTree.AnyType THEN
  9894. Symbol(section, symbol, 0, (offset ));
  9895. INC(numberPointers);
  9896. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9897. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  9898. Symbol(section, symbol, 0, offset); INC(numberPointers);
  9899. ELSIF type IS SyntaxTree.PointerType THEN
  9900. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  9901. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  9902. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  9903. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  9904. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  9905. ELSIF (type IS SyntaxTree.RecordType) THEN
  9906. (* never treat a record like a pointer, even if the pointer field is set! *)
  9907. WITH type: SyntaxTree.RecordType DO
  9908. base := type.GetBaseRecord();
  9909. IF base # NIL THEN
  9910. Pointers(offset,symbol,section, base,numberPointers);
  9911. END;
  9912. variable := type.recordScope.firstVariable;
  9913. WHILE(variable # NIL) DO
  9914. IF ~(variable.untraced) THEN
  9915. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9916. END;
  9917. variable := variable.nextVariable;
  9918. END;
  9919. END;
  9920. ELSIF (type IS SyntaxTree.CellType) THEN
  9921. WITH type: SyntaxTree.CellType DO
  9922. base := type.GetBaseRecord();
  9923. IF base # NIL THEN
  9924. Pointers(offset,symbol,section, base,numberPointers);
  9925. END;
  9926. variable := type.cellScope.firstVariable;
  9927. WHILE(variable # NIL) DO
  9928. IF ~(variable.untraced) THEN
  9929. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9930. END;
  9931. variable := variable.nextVariable;
  9932. END;
  9933. END;
  9934. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9935. WITH type: SyntaxTree.ArrayType DO
  9936. IF type.form= SyntaxTree.Static THEN
  9937. n := type.staticLength;
  9938. base := type.arrayBase.resolved;
  9939. WHILE(base IS SyntaxTree.ArrayType) DO
  9940. type := base(SyntaxTree.ArrayType);
  9941. n := n* type.staticLength;
  9942. base := type.arrayBase.resolved;
  9943. END;
  9944. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9945. IF SemanticChecker.ContainsPointer(base) THEN
  9946. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9947. FOR i := 0 TO n-1 DO
  9948. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9949. END;
  9950. END;
  9951. ELSE
  9952. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  9953. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9954. END;
  9955. END;
  9956. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9957. WITH type: SyntaxTree.MathArrayType DO
  9958. IF type.form = SyntaxTree.Static THEN
  9959. n := type.staticLength;
  9960. base := type.arrayBase.resolved;
  9961. WHILE(base IS SyntaxTree.MathArrayType) DO
  9962. type := base(SyntaxTree.MathArrayType);
  9963. n := n* type.staticLength;
  9964. base := type.arrayBase.resolved;
  9965. END;
  9966. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9967. IF SemanticChecker.ContainsPointer(base) THEN
  9968. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9969. FOR i := 0 TO n-1 DO
  9970. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9971. END;
  9972. END;
  9973. ELSE
  9974. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  9975. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9976. END
  9977. END;
  9978. (* ELSE no pointers in type *)
  9979. END;
  9980. END Pointers;
  9981. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  9982. VAR position,i: LONGINT; ch: CHAR;
  9983. BEGIN
  9984. IF pool.Has(index) THEN
  9985. RETURN pool.GetInt(index)
  9986. ELSE
  9987. position := source.pc;
  9988. pool.PutInt(index, position);
  9989. Info(source, name);
  9990. i := 0;
  9991. REPEAT
  9992. ch := name[i]; INC(i);
  9993. Char( source, ch);
  9994. UNTIL ch = 0X;
  9995. END;
  9996. RETURN position;
  9997. END EnterDynamicName;
  9998. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  9999. VAR name: Basic.SectionName; position: LONGINT;
  10000. BEGIN
  10001. IF pool.Has(index) THEN
  10002. RETURN pool.GetInt(index)
  10003. ELSE
  10004. StringPool.GetString(index, name);
  10005. position := EnterDynamicName(source,name,index, pool);
  10006. END;
  10007. RETURN position;
  10008. END DynamicName;
  10009. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10010. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10011. BEGIN
  10012. COPY(moduleName,name);
  10013. Strings.Append(name,suffix);
  10014. Basic.ToSegmentedName(name, pooledName);
  10015. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10016. IF implementationVisitor.backend.cooperative THEN
  10017. Info(section, "TypeDescriptor");
  10018. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10019. NamedSymbol(section, pooledName,NIL, 0, 0);
  10020. BasePointer(section);
  10021. offset := 0;
  10022. ELSE
  10023. HeapBlock(mName,typeName,section,2);
  10024. Info(section, "HeapBlock");
  10025. (*
  10026. Symbol(section,section,2,0);
  10027. *)
  10028. Address(section,0); (* empty such that GC does not go on traversing *)
  10029. Info(section, "TypeDescriptor");
  10030. Address(section,0);
  10031. offset := section.pc;
  10032. END;
  10033. RETURN section
  10034. END Block;
  10035. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10036. VAR name: Basic.SegmentedName;
  10037. BEGIN
  10038. Info(source,"ArrayHeader");
  10039. IF implementationVisitor.backend.cooperative THEN
  10040. sizePC := source.pc;
  10041. Address(source,0);
  10042. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10043. IF baseType # "" THEN
  10044. Basic.ToSegmentedName(baseType, name);
  10045. NamedSymbol(source, name,NIL, 0, 0);
  10046. ELSE
  10047. Address(source,0);
  10048. END;
  10049. Address(source,0);
  10050. ELSE
  10051. Address(source,0);
  10052. Address(source,0);
  10053. Address(source,0);
  10054. sizePC := source.pc;
  10055. Address(source,0);
  10056. Info(source,"array data");
  10057. END;
  10058. END Array;
  10059. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10060. BEGIN
  10061. IF implementationVisitor.backend.cooperative THEN
  10062. PatchLongint(section, pc, size);
  10063. PatchLongint(section, pc + 3, size);
  10064. ELSE
  10065. PatchLongint(section, pc, size);
  10066. END;
  10067. END PatchArray;
  10068. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10069. VAR
  10070. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10071. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10072. poolMap: Basic.HashTableInt;
  10073. namePool: IntermediateCode.Section;
  10074. namePoolOffset: LONGINT;
  10075. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10076. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10077. BEGIN
  10078. Basic.SegmentedNameToString(s1.name,n1);
  10079. Basic.SegmentedNameToString(s2.name,n2);
  10080. index := 0;
  10081. ch1 := n1[index];
  10082. ch2 := n2[index];
  10083. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10084. INC(index);
  10085. ch1 := n1[index];
  10086. ch2 := n2[index];
  10087. END;
  10088. RETURN ch1 < ch2;
  10089. END Compare;
  10090. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10091. VAR
  10092. i, j: LONGINT;
  10093. x, t: Sections.Section;
  10094. BEGIN
  10095. IF lo < hi THEN
  10096. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10097. WHILE i <= j DO
  10098. WHILE Compare(list[i], x) DO INC(i) END;
  10099. WHILE Compare(x, list[j]) DO DEC(j) END;
  10100. IF i <= j THEN
  10101. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10102. INC(i); DEC(j)
  10103. END
  10104. END;
  10105. IF lo < j THEN QuickSort(list, lo, j) END;
  10106. IF i < hi THEN QuickSort(list, i, hi) END
  10107. END;
  10108. END QuickSort;
  10109. (*
  10110. ExportDesc* = RECORD
  10111. fp*: ADDRESS;
  10112. name* {UNTRACED}: DynamicName;
  10113. adr*: ADDRESS;
  10114. exports*: LONGINT;
  10115. dsc* {UNTRACED}: ExportArray
  10116. END;
  10117. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10118. *)
  10119. PROCEDURE ExportDesc2(
  10120. source: IntermediateCode.Section;
  10121. namePool: IntermediateCode.Section;
  10122. fingerPrinter: FingerPrinter.FingerPrinter;
  10123. symbol: Sections.Section;
  10124. name: StringPool.Index;
  10125. VAR patchAdr: LONGINT
  10126. ): BOOLEAN;
  10127. VAR fingerPrint: SyntaxTree.FingerPrint;
  10128. BEGIN
  10129. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10130. & (symbol.type # Sections.InlineCodeSection)
  10131. THEN
  10132. *)
  10133. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10134. & (symbol.type # Sections.InlineCodeSection))
  10135. THEN
  10136. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10137. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10138. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10139. Longint(source,fingerPrint.shallow);
  10140. ELSE
  10141. Longint(source, 0);
  10142. END;
  10143. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10144. Symbol(source, symbol,0,0);
  10145. patchAdr := source.pc;
  10146. Address(source,0);
  10147. Address(source,0);
  10148. END;
  10149. RETURN TRUE
  10150. ELSE
  10151. RETURN FALSE
  10152. END;
  10153. END ExportDesc2;
  10154. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10155. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10156. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10157. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10158. TYPE
  10159. Scope = RECORD
  10160. elements: LONGINT;
  10161. gelements: LONGINT;
  10162. section: IntermediateCode.Section;
  10163. patchAdr: LONGINT;
  10164. arraySizePC: LONGINT;
  10165. beginPC: LONGINT; (* current scope start pc *)
  10166. END;
  10167. BEGIN
  10168. Basic.InitSegmentedName(prev);
  10169. olevel := -1;
  10170. scopes[0].section := source;
  10171. FOR s := 0 TO LEN(sections)-1 DO
  10172. symbol := sections[s];
  10173. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10174. this := sections[s].name;
  10175. level := 0;
  10176. WHILE (this[level] > 0) DO
  10177. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10178. INC(level);
  10179. END;
  10180. WHILE level < olevel DO
  10181. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10182. IF olevel > 0 THEN
  10183. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10184. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10185. END;
  10186. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10187. DEC(olevel);
  10188. END;
  10189. IF (this[level] > 0) THEN
  10190. IF level > olevel THEN
  10191. (*TRACE("opening",level); *)
  10192. IF scopes[level].section = NIL THEN
  10193. arrayName := ".@ExportArray";
  10194. Strings.AppendInt(arrayName, level);
  10195. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10196. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10197. END;
  10198. scopes[level].beginPC := scopes[level].section.pc;
  10199. olevel := level;
  10200. scopes[olevel].elements := 0;
  10201. END;
  10202. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10203. sym := sections[s];
  10204. ELSE
  10205. sym := NIL;
  10206. END;
  10207. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10208. THEN
  10209. INC(scopes[olevel].elements);
  10210. END;
  10211. (*StringPool.GetString(this[level], name);*)
  10212. (*TRACE(level, name);*)
  10213. (* enter string in scope *)
  10214. INC(level);
  10215. END;
  10216. END;
  10217. Basic.SegmentedNameToString(this, name);
  10218. (*TRACE(level, "enter", name);*)
  10219. prev := this;
  10220. END;
  10221. END;
  10222. WHILE 0 <= olevel DO
  10223. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10224. IF olevel > 0 THEN
  10225. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10226. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10227. END;
  10228. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10229. DEC(olevel);
  10230. END;
  10231. level := 0;
  10232. WHILE (level < LEN(scopes)) DO
  10233. IF scopes[level].section # NIL THEN
  10234. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10235. END;
  10236. INC(level);
  10237. END;
  10238. END Export;
  10239. BEGIN
  10240. NEW(fingerPrinter, module.system);
  10241. NEW(poolMap, 64);
  10242. (* this is the name pool private to the export table -- it is sorted and should not be mixed / used for other names in a module *)
  10243. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10244. NEW(sectionArray, module.allSections.Length());
  10245. FOR i := 0 TO module.allSections.Length() - 1 DO
  10246. section := module.allSections.GetSection(i);
  10247. sectionArray[i] := section;
  10248. END;
  10249. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10250. Export(sectionArray^);
  10251. END ExportDesc;
  10252. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10253. VAR
  10254. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10255. BEGIN
  10256. Info(source, "exception table offsets array descriptor");
  10257. size := 0;
  10258. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10259. Info(source, "exception table content");
  10260. FOR i := 0 TO module.allSections.Length() - 1 DO
  10261. p := module.allSections.GetSection(i);
  10262. IF p.type = Sections.CodeSection THEN
  10263. finallyPC := p(IntermediateCode.Section).finally;
  10264. IF finallyPC>=0 THEN
  10265. Symbol( source, p, 0,0);
  10266. Symbol( source, p, finallyPC, 0);
  10267. Symbol( source, p, finallyPC,0);
  10268. INC(size);
  10269. END;
  10270. END
  10271. END;
  10272. PatchArray(source,sizePC,size);
  10273. END ExceptionArray;
  10274. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10275. VAR i: LONGINT; ch: CHAR;
  10276. BEGIN
  10277. i := 0;
  10278. REPEAT
  10279. ch := name[i]; INC(i);
  10280. Char( section, ch);
  10281. UNTIL ch = 0X;
  10282. WHILE i < 32 DO
  10283. Char( section, 0X); INC(i);
  10284. END;
  10285. END Name;
  10286. PROCEDURE References(section: IntermediateCode.Section);
  10287. CONST
  10288. rfDirect = 1X; rfIndirect = 3X;
  10289. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10290. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10291. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10292. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10293. rfRecordPointer=1DX;
  10294. rfArrayFlag = 80X;
  10295. VAR
  10296. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10297. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10298. VAR char: CHAR;
  10299. BEGIN
  10300. IF type = NIL THEN char := rfLongint
  10301. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10302. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10303. ELSIF type IS SyntaxTree.CharacterType THEN
  10304. IF type.sizeInBits = 8 THEN char := rfChar8
  10305. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10306. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10307. END;
  10308. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10309. IF type.sizeInBits = 8 THEN char := rfShortint
  10310. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10311. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10312. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10313. END;
  10314. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10315. ELSIF type IS SyntaxTree.FloatType THEN
  10316. IF type.sizeInBits = 32 THEN char := rfReal
  10317. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10318. END;
  10319. ELSIF type IS SyntaxTree.ComplexType THEN
  10320. IF type.sizeInBits = 64 THEN char := rfComplex
  10321. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10322. END;
  10323. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10324. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10325. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10326. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10327. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10328. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10329. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10330. END;
  10331. RETURN char
  10332. END BaseType;
  10333. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10334. VAR destination: Sections.Section;
  10335. BEGIN
  10336. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10337. IF type.pointerType # NIL THEN
  10338. Char(section,rfRecordPointer)
  10339. ELSE
  10340. Char(section,rfRecord);
  10341. END;
  10342. IF destination = NIL THEN
  10343. Longint(section,0);
  10344. ELSE
  10345. Longint(section,destination.offset); (* used for ? *)
  10346. END;
  10347. END RecordType;
  10348. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10349. BEGIN
  10350. baseType := type.arrayBase.resolved;
  10351. IF type.form = SyntaxTree.Static THEN
  10352. IF baseType IS SyntaxTree.ArrayType THEN
  10353. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10354. ELSE
  10355. RETURN type.staticLength
  10356. END
  10357. ELSE
  10358. RETURN 0
  10359. END;
  10360. END StaticArrayLength;
  10361. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10362. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10363. BEGIN
  10364. length := StaticArrayLength(type, baseType);
  10365. char := BaseType(baseType);
  10366. IF type.form # SyntaxTree.Open THEN
  10367. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10368. Longint(section, length)
  10369. ELSE
  10370. length :=0;
  10371. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10372. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10373. Longint(section, length)
  10374. END;
  10375. END ArrayType;
  10376. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10377. BEGIN
  10378. baseType := type.arrayBase;
  10379. IF baseType # NIL THEN
  10380. baseType := baseType.resolved;
  10381. END;
  10382. IF type.form = SyntaxTree.Static THEN
  10383. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10384. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10385. ELSE
  10386. RETURN type.staticLength
  10387. END
  10388. ELSE
  10389. RETURN 0
  10390. END;
  10391. END StaticMathArrayLength;
  10392. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10393. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10394. BEGIN
  10395. length := StaticMathArrayLength(type, baseType);
  10396. char := BaseType(baseType);
  10397. IF type.form = SyntaxTree.Open THEN
  10398. char := BaseType(module.system.addressType);
  10399. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10400. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10401. Longint(section, length)
  10402. ELSIF type.form=SyntaxTree.Tensor THEN
  10403. char := BaseType(module.system.addressType);
  10404. Char(section, CHR(ORD(char)));
  10405. ELSE
  10406. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10407. Longint(section, length)
  10408. END;
  10409. END MathArrayType;
  10410. PROCEDURE Type(type: SyntaxTree.Type);
  10411. BEGIN
  10412. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10413. IF type IS SyntaxTree.BasicType THEN
  10414. Char(section, BaseType(type));
  10415. ELSIF type IS SyntaxTree.RecordType THEN
  10416. RecordType(type(SyntaxTree.RecordType));
  10417. ELSIF type IS SyntaxTree.ArrayType THEN
  10418. ArrayType(type(SyntaxTree.ArrayType))
  10419. ELSIF type IS SyntaxTree.EnumerationType THEN
  10420. Char(section, BaseType(module.system.longintType))
  10421. ELSIF type IS SyntaxTree.PointerType THEN
  10422. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10423. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10424. ELSE
  10425. Char(section, BaseType(type))
  10426. END;
  10427. ELSIF type IS SyntaxTree.ProcedureType THEN
  10428. Char(section, BaseType(type));
  10429. ELSIF type IS SyntaxTree.MathArrayType THEN
  10430. MathArrayType(type(SyntaxTree.MathArrayType));
  10431. ELSIF type IS SyntaxTree.CellType THEN
  10432. Char(section, BaseType(module.system.anyType));
  10433. ELSE HALT(200)
  10434. END;
  10435. END Type;
  10436. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10437. VAR name: ARRAY 256 OF CHAR;
  10438. BEGIN
  10439. IF variable.externalName # NIL THEN RETURN END;
  10440. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10441. variable.GetName(name);
  10442. Type(variable.type);
  10443. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10444. String(section,name);
  10445. END WriteVariable;
  10446. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10447. VAR name: ARRAY 256 OF CHAR;
  10448. BEGIN
  10449. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10450. variable.GetName(name);
  10451. Type(variable.type);
  10452. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10453. variable.GetName(name);
  10454. String(section,name);
  10455. END WriteParameter;
  10456. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10457. BEGIN
  10458. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10459. IF type IS SyntaxTree.ArrayType THEN
  10460. WITH type: SyntaxTree.ArrayType DO
  10461. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10462. ELSE Char(section,rfOpenArray)
  10463. END;
  10464. END
  10465. ELSIF type IS SyntaxTree.MathArrayType THEN
  10466. WITH type: SyntaxTree.MathArrayType DO
  10467. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10468. ELSE Char(section,rfOpenArray)
  10469. END;
  10470. END
  10471. ELSIF type IS SyntaxTree.RecordType THEN
  10472. Char(section,rfRecord);
  10473. ELSE
  10474. Char(section, BaseType(type));
  10475. END;
  10476. END ReturnType;
  10477. PROCEDURE Procedure(s: Sections.Section);
  10478. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10479. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10480. name: ARRAY 256 OF CHAR;
  10481. BEGIN
  10482. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10483. (*procedure.name,name);*)
  10484. Global.GetSymbolNameInScope(procedure,module.module.moduleScope,name);
  10485. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10486. Char(section,0F9X);
  10487. Symbol(section,s,0,0);
  10488. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10489. Longint(section,procedureType.numberParameters);
  10490. ReturnType(procedureType.returnType);
  10491. Longint(section,0); (*! level *)
  10492. Longint(section,0);
  10493. (*
  10494. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10495. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10496. recordName := "";
  10497. IF record.pointerType # NIL THEN
  10498. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10499. ELSE
  10500. DeclarationName(record.typeDeclaration,recordName);
  10501. END;
  10502. i := 0;
  10503. Info(section,recordName);
  10504. WHILE recordName[i] # 0X DO
  10505. Char(section,recordName[i]); INC(i);
  10506. INC(size);
  10507. END;
  10508. Char(section,".");
  10509. INC(size);
  10510. END;
  10511. *)
  10512. String(section,name);
  10513. parameter := procedureType.firstParameter;
  10514. WHILE(parameter # NIL) DO
  10515. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10516. parameter := parameter.nextParameter;
  10517. END;
  10518. variable := procedure.procedureScope.firstVariable;
  10519. WHILE(variable # NIL) DO
  10520. WriteVariable(variable,FALSE);
  10521. variable := variable.nextVariable;
  10522. END;
  10523. END Procedure;
  10524. PROCEDURE Scope(s: Sections.Section);
  10525. BEGIN
  10526. Char(section,0F8X);
  10527. Symbol(section,s,0,0); (* start *)
  10528. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10529. String(section,"$$");
  10530. (* removed variables -- wrongly interpreted by Reflection
  10531. variable := module.module.moduleScope.firstVariable;
  10532. WHILE(variable # NIL) DO
  10533. WriteVariable(variable,FALSE);
  10534. variable := variable.nextVariable;
  10535. END;
  10536. *)
  10537. END Scope;
  10538. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10539. VAR result, i: LONGINT;
  10540. BEGIN
  10541. FOR i := startPC TO endPC -1 DO
  10542. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10543. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10544. END;
  10545. RETURN result;
  10546. END ComputeSize;
  10547. BEGIN
  10548. Array(section,sizePC,"");
  10549. startPC := section.pc;
  10550. Char(section,0FFX); (* sign for trap writer *)
  10551. FOR i := 0 TO module.allSections.Length() - 1 DO
  10552. s := module.allSections.GetSection(i);
  10553. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10554. Scope(s) (*! must be first procedure in ref section *)
  10555. END
  10556. END;
  10557. FOR i := 0 TO module.allSections.Length() - 1 DO
  10558. s := module.allSections.GetSection(i);
  10559. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10560. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10561. Procedure(s)
  10562. END
  10563. END;
  10564. endPC := section.pc;
  10565. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10566. END References;
  10567. (*
  10568. Command* = RECORD
  10569. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10570. name*: Name; (* name of the procedure *)
  10571. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10572. entryAdr* : ADDRESS; (* entry address of procedure *)
  10573. END;
  10574. *)
  10575. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10576. VAR
  10577. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10578. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10579. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  10580. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10581. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10582. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10583. BEGIN
  10584. RETURN
  10585. (type = NIL) OR
  10586. (type.resolved IS SyntaxTree.RecordType) OR
  10587. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10588. (type.resolved IS SyntaxTree.AnyType);
  10589. END TypeAllowed;
  10590. BEGIN
  10591. numberParameters := procedureType.numberParameters;
  10592. RETURN
  10593. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10594. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10595. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10596. END GetProcedureAllowed;
  10597. PROCEDURE WriteType(type : SyntaxTree.Type);
  10598. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10599. name: Basic.SegmentedName; offset: LONGINT;
  10600. BEGIN
  10601. IF type = NIL THEN
  10602. Address(source,0);
  10603. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10604. Address(source,1);
  10605. ELSE
  10606. type := type.resolved;
  10607. IF type IS SyntaxTree.PointerType THEN
  10608. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10609. END;
  10610. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10611. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10612. name[0] := typeDeclaration.name; name[1] := -1;
  10613. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10614. ASSERT(section # NIL);
  10615. ELSE
  10616. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10617. (* TODO *)
  10618. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10619. END;
  10620. IF implementationVisitor.backend.cooperative THEN
  10621. offset := 0;
  10622. ELSE
  10623. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10624. END;
  10625. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10626. END;
  10627. END WriteType;
  10628. BEGIN
  10629. Info(source, "command array descriptor");
  10630. Array(source,sizePC,"Modules.Command");
  10631. numberCommands := 0;
  10632. Info(source, "command array content");
  10633. FOR i := 0 TO module.allSections.Length() - 1 DO
  10634. p := module.allSections.GetSection(i);
  10635. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10636. procedure := p.symbol(SyntaxTree.Procedure);
  10637. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10638. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10639. procedure.GetName(name);
  10640. Name(source,name);
  10641. numberParameters := procedureType.numberParameters;
  10642. (* offset of type of first parameter *)
  10643. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10644. ELSE WriteType(procedureType.firstParameter.type)
  10645. END;
  10646. (* offset of type of return parameter *)
  10647. WriteType(procedureType.returnType);
  10648. (* command name *)
  10649. (* command code offset *)
  10650. Symbol(source,p,0,0);
  10651. INC(numberCommands);
  10652. IF Trace THEN
  10653. D.Ln;
  10654. END;
  10655. END;
  10656. END
  10657. END;
  10658. PatchArray(source,sizePC,numberCommands);
  10659. END CommandArray;
  10660. (* to prevent from double import of different module aliases *)
  10661. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10662. VAR i: SyntaxTree.Import;
  10663. BEGIN
  10664. i := module.module.moduleScope.firstImport;
  10665. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10666. i := i.nextImport;
  10667. END;
  10668. RETURN i = import
  10669. END IsFirstDirectOccurence;
  10670. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10671. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10672. BEGIN
  10673. Array(source,pc,"");
  10674. Info(source, "import module array data");
  10675. IF implementationVisitor.backend.cooperative THEN
  10676. offset := 0;
  10677. ELSE
  10678. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10679. END;
  10680. import := module.module.moduleScope.firstImport;
  10681. numberImports := 0;
  10682. WHILE import # NIL DO
  10683. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10684. Global.GetModuleSegmentedName(import.module,name);
  10685. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10686. NamedSymbol(source, name, NIL, 0, offset);
  10687. INC(numberImports);
  10688. END;
  10689. import := import.nextImport
  10690. END;
  10691. PatchArray(source,pc,numberImports);
  10692. END ImportsArray;
  10693. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10694. VAR
  10695. p: Sections.Section; sizePC, size, i: LONGINT;
  10696. BEGIN
  10697. Info(source, "Type info section");
  10698. size := 0;
  10699. Array(source,sizePC,"Modules.TypeDesc");
  10700. FOR i := 0 TO module.allSections.Length() - 1 DO
  10701. p := module.allSections.GetSection(i);
  10702. WITH p: IntermediateCode.Section DO
  10703. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10704. Symbol(source,p,0,0);
  10705. INC(size);
  10706. END;
  10707. END
  10708. END;
  10709. PatchArray(source,sizePC,size);
  10710. END TypeInfoSection;
  10711. (*
  10712. ProcTableEntry* = RECORD
  10713. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10714. noPtr*: LONGINT;
  10715. END;
  10716. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10717. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10718. *)
  10719. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10720. VAR
  10721. destination: Sections.Section;
  10722. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10723. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10724. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10725. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10726. BEGIN
  10727. Info(procArray,"pcFrom");
  10728. Symbol(procArray,destination,0,0);
  10729. Info(procArray,"pcTo");
  10730. Symbol(procArray,destination,destination.pc,0);
  10731. Info(procArray,"pcStatementBegin");
  10732. Symbol(procArray,destination,destination.validPAFEnter,0);
  10733. Info(procArray,"pcStatementEnd");
  10734. Symbol(procArray,destination,destination.validPAFExit,0);
  10735. IF ~implementationVisitor.backend.cooperative THEN
  10736. Basic.SegmentedNameToString(destination.name, string);
  10737. Info(pointerArray,string);
  10738. procedure := destination.symbol(SyntaxTree.Procedure);
  10739. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10740. variable := procedure.procedureScope.firstVariable;
  10741. WHILE(variable # NIL) DO
  10742. IF ~(variable.untraced) THEN
  10743. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10744. END;
  10745. variable := variable.nextVariable
  10746. END;
  10747. parameter := procedureType.firstParameter;
  10748. WHILE(parameter # NIL) DO
  10749. IF ~(parameter.untraced) THEN
  10750. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10751. END;
  10752. parameter := parameter.nextParameter;
  10753. END;
  10754. END;
  10755. Info(procArray,"numberPointers");
  10756. Longint(procArray,numberPointers);
  10757. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10758. INC(pointerArraySize, numberPointers);
  10759. END PointerOffsets;
  10760. BEGIN
  10761. maxPointers := 0;
  10762. Info(procArray, "proc array descriptor");
  10763. Address(procArray,0);
  10764. Address(procArray,0);
  10765. Address(procArray,0);
  10766. procArraySizePC := procArray.pc;
  10767. Address(procArray,0);
  10768. procArraySize := 0;
  10769. IF ~implementationVisitor.backend.cooperative THEN
  10770. Info(pointerArray, "pointer array descriptor");
  10771. Address(pointerArray,0);
  10772. Address(pointerArray,0);
  10773. Address(pointerArray,0);
  10774. pointerArraySizePC := pointerArray.pc;
  10775. Address(pointerArray,0);
  10776. pointerArraySize := 0;
  10777. END;
  10778. procArraySize := 0;
  10779. FOR i := 0 TO module.allSections.Length() - 1 DO
  10780. destination := module.allSections.GetSection(i);
  10781. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10782. PointerOffsets(destination(IntermediateCode.Section));
  10783. INC(procArraySize);
  10784. END
  10785. END;
  10786. PatchLongint(procArray,procArraySizePC,procArraySize);
  10787. IF ~implementationVisitor.backend.cooperative THEN
  10788. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10789. END;
  10790. END PointersInProcTables;
  10791. (*
  10792. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10793. VAR
  10794. next*: Module; (** once a module is published, all fields are read-only *)
  10795. name*: Name;
  10796. init, published: BOOLEAN;
  10797. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10798. sb*: ADDRESS; <- set to beginning of data section by loader
  10799. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10800. command*: POINTER TO ARRAY OF Command;
  10801. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10802. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10803. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10804. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10805. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10806. data*, code*: Bytes;
  10807. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10808. export*: ExportDesc;
  10809. term*: TerminationHandler;
  10810. exTable*: ExceptionTable;
  10811. noProcs*: LONGINT;
  10812. firstProc*: ADDRESS; <- done by loader
  10813. maxPtrs*: LONGINT;
  10814. crc*: LONGINT;
  10815. *)
  10816. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10817. BEGIN
  10818. Info(section, "cycle");
  10819. Size(section,0);
  10820. Info(section, "references");
  10821. Size(section,0);
  10822. Info(section, "nextMarked");
  10823. Address(section,0);
  10824. Info(section, "nextWatched");
  10825. Address(section,0);
  10826. END BasePointer;
  10827. PROCEDURE BaseObject (section: IntermediateCode.Section);
  10828. BEGIN
  10829. BasePointer(section);
  10830. Info(section, "action");
  10831. Address(section,0);
  10832. Info(section, "monitor");
  10833. Address(section,0);
  10834. END BaseObject;
  10835. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  10836. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  10837. pooledName: Basic.SegmentedName;
  10838. symbol: SyntaxTree.Symbol;
  10839. BEGIN
  10840. Global.GetModuleName(module.module,name);
  10841. Strings.Append(name,".@Module.@Descriptor");
  10842. Basic.ToSegmentedName(name, pooledName);
  10843. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10844. Symbol(section,descriptorSection,0,0);
  10845. Info(descriptorSection, "descriptor");
  10846. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10847. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  10848. Address(descriptorSection,0);
  10849. Global.GetModuleName(module.module,name);
  10850. Strings.Append(name,".@Trace");
  10851. Basic.ToSegmentedName(name, pooledName);
  10852. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10853. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  10854. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10855. END ModuleDescriptor;
  10856. PROCEDURE ModuleSection(): IntermediateCode.Section;
  10857. VAR name: ARRAY 128 OF CHAR;
  10858. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  10859. symbol: SyntaxTree.Symbol;
  10860. BEGIN
  10861. Global.GetModuleName(module.module,name);
  10862. Strings.Append(name,".@Module");
  10863. Basic.ToSegmentedName(name, pooledName);
  10864. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10865. moduleSection.SetExported(TRUE);
  10866. IF moduleSection.pc = 0 THEN
  10867. IF implementationVisitor.backend.cooperative THEN
  10868. Info(moduleSection, "descriptor");
  10869. ModuleDescriptor(moduleSection);
  10870. BaseObject(moduleSection);
  10871. implementationVisitor.CreateTraceModuleMethod(module.module);
  10872. ELSE
  10873. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  10874. Info(moduleSection, "HeapBlock");
  10875. Symbol(moduleSection,moduleSection,2,0);
  10876. Info(moduleSection, "TypeDescriptor");
  10877. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10878. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  10879. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  10880. END;
  10881. END;
  10882. RETURN moduleSection;
  10883. END ModuleSection;
  10884. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  10885. VAR
  10886. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  10887. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  10888. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  10889. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  10890. referenceSectionOffset : LONGINT;
  10891. BEGIN
  10892. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  10893. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  10894. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  10895. ImportsArray(importSection);
  10896. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  10897. CommandArray(commandsSection);
  10898. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  10899. ExceptionArray(exceptionSection);
  10900. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  10901. TypeInfoSection(typeInfoSection);
  10902. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  10903. References(referenceSection);
  10904. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  10905. IF ~implementationVisitor.backend.cooperative THEN
  10906. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  10907. ELSE
  10908. ptrTableSection := NIL;
  10909. END;
  10910. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  10911. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  10912. Array(emptyArraySection,temp,"");
  10913. moduleSection := ModuleSection();
  10914. Info(moduleSection, "nextRoot*: RootObject");
  10915. Address(moduleSection,0);
  10916. Info(moduleSection, "next*: Module");
  10917. Address(moduleSection,0);
  10918. Info(moduleSection, "name*: Name");
  10919. Name(moduleSection,moduleName);
  10920. Info(moduleSection, "init, published: BOOLEAN");
  10921. Boolean(moduleSection,FALSE);
  10922. Boolean(moduleSection,FALSE);
  10923. Info(moduleSection,"filler"); (*! introduce alignment! *)
  10924. Boolean(moduleSection,FALSE);
  10925. Boolean(moduleSection,FALSE);
  10926. Info(moduleSection, "refcnt*: LONGINT");
  10927. Longint(moduleSection,0);
  10928. Info(moduleSection, "sb*: ADDRESS");
  10929. Address(moduleSection,0);
  10930. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  10931. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10932. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  10933. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  10934. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  10935. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  10936. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  10937. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  10938. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  10939. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  10940. Info(moduleSection, "procTable*: ProcTable");
  10941. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  10942. Info(moduleSection, "ptrTable*: PtrTable");
  10943. IF ~implementationVisitor.backend.cooperative THEN
  10944. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  10945. ELSE
  10946. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10947. END;
  10948. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  10949. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10950. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10951. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10952. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  10953. Info(moduleSection, "export*: ExportDesc");
  10954. ExportDesc(moduleSection);
  10955. Info(moduleSection, "term*: TerminationHandler");
  10956. Address(moduleSection,0);
  10957. Info(moduleSection, "exTable*: ExceptionTable");
  10958. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  10959. Info(moduleSection, "noProcs*: LONGINT");
  10960. Longint(moduleSection,numberProcs);
  10961. Info(moduleSection, "firstProc*: ADDRESS");
  10962. Address(moduleSection,0);
  10963. Info(moduleSection, "maxPtrs*: LONGINT");
  10964. Longint(moduleSection,maxPointers);
  10965. Info(moduleSection, "crc*: LONGINT");
  10966. Longint(moduleSection, 0); (*! must be implemented *)
  10967. Info(moduleSection, "body*: ADDRESS");
  10968. Symbol(moduleSection, bodyProc, 0,0);
  10969. IF implementationVisitor.backend.cooperative THEN
  10970. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  10971. Info(moduleSection, "monitor.owner");
  10972. Address(moduleSection,0);
  10973. Info(moduleSection, "monitor.nestingLevel");
  10974. Address(moduleSection,0);
  10975. Info(moduleSection, "monitor.blockedQueue");
  10976. Address(moduleSection,0); Address(moduleSection,0);
  10977. Info(moduleSection, "monitor.waitingQueue");
  10978. Address(moduleSection,0); Address(moduleSection,0);
  10979. Info(moduleSection, "monitor.waitingSentinel");
  10980. Address(moduleSection,0);
  10981. END;
  10982. END Module;
  10983. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  10984. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  10985. BEGIN
  10986. Array(source,pc,"");
  10987. Info(source, "pointer offsets array data");
  10988. IF scope IS SyntaxTree.RecordScope THEN
  10989. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  10990. ELSIF scope IS SyntaxTree.CellScope THEN
  10991. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  10992. ELSIF scope IS SyntaxTree.ModuleScope THEN
  10993. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  10994. WHILE variable # NIL DO
  10995. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  10996. symbol := module.allSections.FindBySymbol(variable);
  10997. ASSERT(symbol # NIL);
  10998. Pointers(0,symbol, source,variable.type,numberPointers);
  10999. END;
  11000. variable := variable.nextVariable;
  11001. END;
  11002. END;
  11003. PatchArray(source,pc,numberPointers);
  11004. END PointerArray;
  11005. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11006. VAR
  11007. name: Basic.SegmentedName;
  11008. section: IntermediateCode.Section;
  11009. BEGIN
  11010. ASSERT(implementationVisitor.newObjectFile);
  11011. Global.GetSymbolSegmentedName(symbol,name);
  11012. Basic.AppendToSegmentedName(name,suffix);
  11013. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11014. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11015. Info(section, "HeapBlock");
  11016. Address(section,0); (* empty such that GC does not go on traversing *)
  11017. Info(section, suffix);
  11018. Address(section,0);
  11019. pc := section.pc;
  11020. RETURN section;
  11021. END SymbolSection;
  11022. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11023. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11024. BEGIN
  11025. ASSERT(implementationVisitor.newObjectFile);
  11026. IF ~ReflectionSupport OR simple THEN variable := NIL
  11027. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11028. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11029. IF type IS SyntaxTree.PointerType THEN
  11030. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11031. END;
  11032. IF type IS SyntaxTree.RecordType THEN
  11033. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11034. ELSIF type IS SyntaxTree.CellType THEN
  11035. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11036. END;
  11037. ELSIF symbol IS SyntaxTree.Procedure THEN
  11038. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11039. END;
  11040. Info(in, "variables");
  11041. IF variable # NIL THEN
  11042. section := SymbolSection(symbol, "@Variables",pc);
  11043. VariableArray(section, variable);
  11044. Symbol(in, section, pc, 0);
  11045. ELSE
  11046. Address(in, 0);
  11047. END;
  11048. END ReflectVariables;
  11049. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11050. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11051. BEGIN
  11052. ASSERT(implementationVisitor.newObjectFile);
  11053. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11054. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11055. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11056. IF type IS SyntaxTree.PointerType THEN
  11057. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11058. END;
  11059. IF type IS SyntaxTree.RecordType THEN
  11060. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11061. ELSIF type IS SyntaxTree.CellType THEN
  11062. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11063. END;
  11064. ELSIF symbol IS SyntaxTree.Procedure THEN
  11065. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11066. END;
  11067. Info(in, "procedures");
  11068. IF procedure # NIL THEN
  11069. section := SymbolSection(symbol, "@Procedures",pc);
  11070. ProcedureArray(section, procedure);
  11071. Symbol(in, section, pc, 0);
  11072. ELSE
  11073. Address(in, 0);
  11074. END;
  11075. END ReflectProcedures;
  11076. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11077. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11078. segmentedName: Basic.SegmentedName;
  11079. td: SyntaxTree.TypeDeclaration;
  11080. type: SyntaxTree.Type;
  11081. BEGIN
  11082. Array(source,pc,"Modules.FieldEntry");
  11083. Info(source, "FieldArray");
  11084. size :=0;
  11085. WHILE variable # NIL DO
  11086. Info(source,"name");
  11087. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11088. type := variable.type.resolved;
  11089. Info(source,"offset");
  11090. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11091. Info(source,"type class");
  11092. IF type IS SyntaxTree.PointerType THEN
  11093. Size(source, 1);
  11094. ELSIF type IS SyntaxTree.RecordType THEN
  11095. Size(source, 2);
  11096. ELSIF type IS SyntaxTree.NumberType THEN
  11097. Size(source, 3);
  11098. ELSE
  11099. Size(source, 0);
  11100. END;
  11101. Info(source, "type desc");
  11102. IF type IS SyntaxTree.RecordType THEN
  11103. td := type(SyntaxTree.RecordType).typeDeclaration;
  11104. Global.GetSymbolSegmentedName(td,segmentedName);
  11105. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11106. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11107. ELSE
  11108. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11109. END;
  11110. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11111. Symbol(source, tir, 0, offset);
  11112. ELSE
  11113. Address(source, 0);
  11114. END;
  11115. Info(source,"flags");
  11116. Set(source, {});
  11117. variable := variable.nextVariable;
  11118. INC(size);
  11119. END;
  11120. PatchArray(source,pc,size);
  11121. END VariableArray;
  11122. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11123. VAR pc: LONGINT; size: LONGINT;
  11124. segmentedName: Basic.SegmentedName;
  11125. BEGIN
  11126. Array(source,pc,"Modules.ProcedureEntry");
  11127. Info(source, "ProcedureArray");
  11128. size :=0;
  11129. WHILE procedure # NIL DO
  11130. Info(source,"name");
  11131. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11132. Global.GetSymbolSegmentedName(procedure, segmentedName);
  11133. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11134. (* size *)
  11135. Size(source, 0);
  11136. (* parameters *)
  11137. Address(source, 0);
  11138. (* variables *)
  11139. ReflectVariables(source, procedure);
  11140. ReflectProcedures(source, procedure);
  11141. (* return type entry *)
  11142. Address(source, 0);
  11143. Address(source, 0);
  11144. procedure := procedure.nextProcedure;
  11145. INC(size);
  11146. END;
  11147. PatchArray(source,pc,size);
  11148. END ProcedureArray;
  11149. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11150. VAR recordType: SyntaxTree.RecordType;
  11151. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11152. section: Sections.Section; cellType: SyntaxTree.CellType;
  11153. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11154. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11155. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11156. sectionName: Basic.SectionName;
  11157. CONST MPO=-40000000H;
  11158. BEGIN
  11159. (*
  11160. TypeDesc* = POINTER TO RECORD
  11161. descSize: LONGINT;
  11162. sentinel: LONGINT; (* = MPO-4 *)
  11163. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11164. flags*: SET;
  11165. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11166. name*: Name;
  11167. END;
  11168. *)
  11169. (* source := module.sections.FindByName(...) *)
  11170. Global.GetSymbolSegmentedName(td,name);
  11171. Basic.AppendToSegmentedName(name,"@Info");
  11172. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11173. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11174. Address(source,MPO-4);
  11175. Info(source, "type tag pointer");
  11176. Symbol( source, tag, offset, 0);
  11177. Info(source, "type flags");
  11178. flags := {};
  11179. IF isProtected THEN INCL(flags,31) END;
  11180. Set( source, flags);
  11181. Info(source, "pointer to module");
  11182. moduleSection := ModuleSection();
  11183. Symbol( source, moduleSection, moduleSection.pc,0);
  11184. Info(source, "type name");
  11185. i := 0;
  11186. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11187. (*
  11188. Global.GetSymbolSegmentedName(td,name);
  11189. Basic.SegmentedNameToString(name, sectionName);
  11190. *)
  11191. Name(source,sectionName);
  11192. source.SetReferenced(FALSE);
  11193. Global.GetSymbolSegmentedName(td,name);
  11194. Basic.AppendToSegmentedName(name,"@Fields");
  11195. ReflectVariables(source, td);
  11196. ReflectProcedures(source, td);
  11197. (*
  11198. fieldSection := VariableArray(
  11199. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11200. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11201. Info(fieldSection, "HeapBlock");
  11202. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11203. Info(fieldSection, "TypeDescriptor");
  11204. Address(fieldSection,0);
  11205. Info(source, "FieldArray ref");
  11206. Symbol(source, fieldSection, fieldSection.pc, 0);
  11207. FieldArray(fieldSection);
  11208. Global.GetSymbolSegmentedName(td,name);
  11209. Basic.AppendToSegmentedName(name,"@Procedures");
  11210. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11211. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11212. Info(fieldSection, "HeapBlock");
  11213. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11214. Info(fieldSection, "TypeDescriptor");
  11215. Address(fieldSection,0);
  11216. Info(source, "Procedure Array ref");
  11217. Symbol(source, fieldSection, fieldSection.pc, 0);
  11218. ProcedureArray(fieldSection);
  11219. *)
  11220. RETURN source;
  11221. END NewTypeDescriptorInfo;
  11222. PROCEDURE NewTypeDescriptor;
  11223. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11224. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11225. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11226. numberPointers: LONGINT; padding, i: LONGINT;
  11227. CONST MPO=-40000000H;
  11228. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11229. VAR i: LONGINT;
  11230. PROCEDURE Td(record: SyntaxTree.RecordType);
  11231. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11232. BEGIN
  11233. IF record # NIL THEN
  11234. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11235. baseTD := record.typeDeclaration;
  11236. Global.GetSymbolSegmentedName(baseTD,name);
  11237. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11238. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11239. ELSE
  11240. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11241. END;
  11242. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11243. Symbol(source, tir, 0, offset);
  11244. IF reverse THEN Td(record.GetBaseRecord()) END;
  11245. END;
  11246. END Td;
  11247. BEGIN
  11248. Info(source, "tag table");
  11249. baseRecord := recordType;
  11250. i := 0;
  11251. WHILE baseRecord # NIL DO
  11252. INC(i);
  11253. baseRecord := baseRecord.GetBaseRecord();
  11254. END;
  11255. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11256. IF ~reverse THEN Td(recordType) END;
  11257. WHILE i < size DO
  11258. Address(source,0);
  11259. INC(i);
  11260. END;
  11261. IF reverse THEN Td(recordType) END;
  11262. END TdTable;
  11263. PROCEDURE MethodTable(reverse: BOOLEAN);
  11264. VAR i,methods: LONGINT;
  11265. BEGIN
  11266. Info(source, "method table");
  11267. IF recordType # NIL THEN
  11268. methods := recordType.recordScope.numberMethods;
  11269. IF reverse THEN
  11270. FOR i := methods-1 TO 0 BY -1 DO
  11271. procedure := recordType.recordScope.FindMethod(i);
  11272. Global.GetSymbolSegmentedName(procedure, name);
  11273. NamedSymbol(source, name,procedure, 0,0);
  11274. END;
  11275. ELSE
  11276. FOR i := 0 TO methods-1 DO
  11277. procedure := recordType.recordScope.FindMethod(i);
  11278. Global.GetSymbolSegmentedName(procedure, name);
  11279. NamedSymbol(source, name,procedure, 0,0);
  11280. END;
  11281. END;
  11282. END;
  11283. END MethodTable;
  11284. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11285. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11286. BEGIN
  11287. Info(source, "method table");
  11288. baseRecord := recordType;
  11289. WHILE baseRecord.baseType # NIL DO
  11290. baseRecord := baseRecord.GetBaseRecord ();
  11291. END;
  11292. GetRecordTypeName (baseRecord, name);
  11293. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11294. IF name = stackFrame THEN
  11295. start := 0;
  11296. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11297. baseRecord := recordType;
  11298. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11299. baseRecord := baseRecord.GetBaseRecord ();
  11300. END;
  11301. IF baseRecord # NIL THEN
  11302. GetRecordTypeName (baseRecord, name);
  11303. IF pointer & ~baseRecord.isObject THEN
  11304. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11305. END;
  11306. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11307. ELSIF recordType.isObject THEN
  11308. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11309. ELSIF pointer THEN
  11310. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11311. ELSE
  11312. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11313. END;
  11314. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11315. Symbol(source, tir, 0, 0);
  11316. start := 0;
  11317. baseRecord := recordType;
  11318. WHILE (baseRecord # NIL) DO
  11319. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11320. baseRecord := baseRecord.GetBaseRecord ();
  11321. END;
  11322. ELSE
  11323. (* explicit trace method: *)
  11324. procedure := recordType.recordScope.FindMethod(0);
  11325. IF ~procedure.isFinalizer THEN
  11326. Global.GetSymbolSegmentedName(procedure, name);
  11327. NamedSymbol(source, name,procedure, 0,0);
  11328. END;
  11329. start := 1;
  11330. END;
  11331. IF (name # stackFrame) & recordType.isObject THEN
  11332. baseRecord := recordType;
  11333. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11334. baseRecord := baseRecord.GetBaseRecord ();
  11335. END;
  11336. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11337. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11338. ELSE
  11339. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11340. END;
  11341. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11342. Symbol(source, tir, 0, 0);
  11343. END;
  11344. methods := recordType.recordScope.numberMethods;
  11345. FOR i := start TO methods-1 DO
  11346. procedure := recordType.recordScope.FindMethod(i);
  11347. IF ~procedure.isFinalizer THEN
  11348. Global.GetSymbolSegmentedName(procedure, name);
  11349. NamedSymbol(source, name,procedure, 0,0);
  11350. END;
  11351. END;
  11352. END CooperativeMethodTable;
  11353. BEGIN
  11354. Global.GetSymbolSegmentedName(td,name);
  11355. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11356. source.SetExported(IsExported(td));
  11357. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11358. IF implementationVisitor.backend.cooperative THEN
  11359. base := NIL;
  11360. baseRecord := recordType.GetBaseRecord();
  11361. IF baseRecord # NIL THEN
  11362. baseTD := baseRecord.typeDeclaration;
  11363. END;
  11364. IF ~recordType.isObject THEN
  11365. Info(source, "parent");
  11366. IF baseRecord # NIL THEN
  11367. Global.GetSymbolSegmentedName(baseTD,name);
  11368. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11369. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11370. ELSE
  11371. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11372. END;
  11373. Symbol(source, tir, 0, 0);
  11374. ELSE
  11375. Address(source,0);
  11376. END;
  11377. Info(source, "record size");
  11378. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11379. source.SetReferenced(FALSE);
  11380. CooperativeMethodTable(FALSE);
  11381. base := source;
  11382. Global.GetSymbolSegmentedName(td,name);
  11383. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11384. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11385. source.SetExported(IsExported(td));
  11386. source.SetReferenced(FALSE);
  11387. END;
  11388. Info(source, "parent");
  11389. IF baseRecord # NIL THEN
  11390. Global.GetSymbolSegmentedName(baseTD,name);
  11391. sym := baseTD;
  11392. IF ~recordType.isObject THEN
  11393. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11394. sym := NIL;
  11395. END;
  11396. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11397. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11398. ELSE
  11399. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11400. END;
  11401. Symbol(source, tir, 0, 0);
  11402. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11403. Address(source,0);
  11404. ELSE
  11405. IF recordType.isObject THEN
  11406. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11407. ELSE
  11408. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11409. END;
  11410. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11411. Symbol(source, tir, 0, 0);
  11412. END;
  11413. Info(source, "base record descriptor");
  11414. Symbol(source, base, 0, 0);
  11415. CooperativeMethodTable(TRUE);
  11416. source.SetReferenced(FALSE);
  11417. IF recordType.hasPointers THEN
  11418. IF ~HasExplicitTraceMethod (recordType) THEN
  11419. implementationVisitor.CreateTraceMethod(recordType);
  11420. END;
  11421. implementationVisitor.CreateResetProcedure(recordType);
  11422. implementationVisitor.CreateAssignProcedure(recordType);
  11423. END;
  11424. ELSIF ~simple THEN
  11425. (*
  11426. MethodEnd = MPO
  11427. ---
  11428. methods (# methods)
  11429. ---
  11430. tags (16)
  11431. ---
  11432. TypeDesc = TypeInfoAdr
  11433. ---
  11434. td adr ---> rec size
  11435. ----
  11436. pointer offsets
  11437. ----
  11438. (padding)
  11439. -----
  11440. empty [2 addresses aligned]
  11441. empty
  11442. empty
  11443. numPtrs
  11444. ---
  11445. pointer offsets
  11446. ---
  11447. *)
  11448. Info(source, "MethodEnd = MPO");
  11449. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11450. source(IntermediateCode.Section).Emit(Data(-1,op));
  11451. MethodTable(TRUE);
  11452. TdTable(TypeTags, TRUE);
  11453. Info(source, "type descriptor info pointer");
  11454. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11455. IF (cellType # NIL) THEN
  11456. IF cellType.sizeInBits < 0 THEN
  11457. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11458. END;
  11459. Info(source, "cell size");
  11460. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11461. ELSE
  11462. Info(source, "record size");
  11463. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11464. END;
  11465. Info(source, "pointer offsets pointer");
  11466. padding := 1- source.pc MOD 2;
  11467. Symbol(source, source, source.pc+1+padding,0);
  11468. IF padding >0 THEN
  11469. Info(source, "padding");
  11470. FOR i := 1 TO padding DO Address(source,0) END;
  11471. END;
  11472. IF cellType # NIL THEN
  11473. PointerArray(source, cellType.cellScope, numberPointers);
  11474. ELSE
  11475. PointerArray(source, recordType.recordScope, numberPointers);
  11476. END;
  11477. ELSE
  11478. (*
  11479. simple:
  11480. td adr --> size
  11481. tag(1)
  11482. tag(2)
  11483. tag(3)
  11484. methods ->
  11485. *)
  11486. Info(source, "record size");
  11487. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11488. TdTable(TypeTags, FALSE);
  11489. MethodTable(FALSE);
  11490. source.SetReferenced(FALSE);
  11491. END;
  11492. END NewTypeDescriptor;
  11493. BEGIN
  11494. x := x.resolved;
  11495. IF (x IS SyntaxTree.PointerType) THEN
  11496. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11497. END;
  11498. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11499. recordType := x(SyntaxTree.RecordType);
  11500. td := x.typeDeclaration;
  11501. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11502. ASSERT(td # NIL);
  11503. section := module.allSections.FindBySymbol(td); (* TODO *)
  11504. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11505. IF implementationVisitor.newObjectFile THEN
  11506. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11507. NewTypeDescriptor
  11508. END;
  11509. ELSE
  11510. (* data section in intermediate code *)
  11511. Global.GetSymbolSegmentedName(td,name);
  11512. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11513. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11514. tir.Emit(Data(-1,op));
  11515. END;
  11516. END;
  11517. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11518. cellType := x(SyntaxTree.CellType);
  11519. td := x.typeDeclaration;
  11520. section := module.allSections.FindBySymbol(td); (* TODO *)
  11521. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11522. IF implementationVisitor.newObjectFile THEN
  11523. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11524. NewTypeDescriptor
  11525. END;
  11526. END;
  11527. END;
  11528. END
  11529. END CheckTypeDeclaration
  11530. END MetaDataGenerator;
  11531. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11532. VAR
  11533. trace-: BOOLEAN;
  11534. traceString-: SyntaxTree.IdentifierString;
  11535. traceModuleName-: SyntaxTree.IdentifierString;
  11536. newObjectFile-: BOOLEAN;
  11537. profile-: BOOLEAN;
  11538. noRuntimeChecks: BOOLEAN;
  11539. simpleMetaData-: BOOLEAN;
  11540. noAsserts: BOOLEAN;
  11541. optimize-: BOOLEAN;
  11542. cooperative-: BOOLEAN;
  11543. preregisterStatic-: BOOLEAN;
  11544. dump-: Basic.Writer;
  11545. cellsAreObjects: BOOLEAN;
  11546. PROCEDURE &InitIntermediateBackend*;
  11547. BEGIN
  11548. simpleMetaData := FALSE;
  11549. newObjectFile := FALSE;
  11550. InitBackend;
  11551. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11552. SetTraceModuleName(DefaultTraceModuleName);
  11553. END InitIntermediateBackend;
  11554. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11555. VAR
  11556. declarationVisitor: DeclarationVisitor;
  11557. implementationVisitor: ImplementationVisitor;
  11558. module: Sections.Module;
  11559. name, platformName: SyntaxTree.IdentifierString;
  11560. meta: MetaDataGenerator;
  11561. BEGIN
  11562. ResetError;
  11563. Global.GetSymbolName(x,name);
  11564. NEW(module,x,system); (* backend structures *)
  11565. Global.GetModuleName(x, name);
  11566. module.SetModuleName(name);
  11567. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11568. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11569. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11570. declarationVisitor.Module(x,module);
  11571. IF newObjectFile & ~meta.simple THEN
  11572. meta.Module(implementationVisitor.moduleBodySection);
  11573. END;
  11574. GetDescription(platformName);
  11575. module.SetPlatformName(platformName);
  11576. RETURN module
  11577. END GenerateIntermediate;
  11578. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11579. BEGIN RETURN TRUE
  11580. END SupportedImmediate;
  11581. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11582. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11583. END ProcessSyntaxTreeModule;
  11584. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11585. VAR
  11586. result: Sections.Module;
  11587. traceName: Basic.MessageString;
  11588. BEGIN
  11589. ASSERT(intermediateCodeModule IS Sections.Module);
  11590. result := intermediateCodeModule(Sections.Module);
  11591. IF trace THEN
  11592. traceName := "intermediate code trace: ";
  11593. Strings.Append(traceName,traceString);
  11594. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11595. IF (traceString="") OR (traceString="*") THEN
  11596. result.Dump(dump);
  11597. dump.Update
  11598. ELSE
  11599. Sections.DumpFiltered(dump, result, traceString);
  11600. END
  11601. END;
  11602. RETURN result
  11603. END ProcessIntermediateCodeModule;
  11604. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11605. BEGIN instructionSet := "Intermediate";
  11606. END GetDescription;
  11607. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11608. BEGIN
  11609. SELF.newObjectFile := newObjectFile;
  11610. SELF.simpleMetaData := simpleMetaData;
  11611. END SetNewObjectFile;
  11612. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11613. BEGIN COPY(name, traceModuleName)
  11614. END SetTraceModuleName;
  11615. PROCEDURE DefineOptions(options: Options.Options);
  11616. BEGIN
  11617. DefineOptions^(options);
  11618. options.Add(0X,"trace",Options.String);
  11619. options.Add(0X,"runtime",Options.String);
  11620. options.Add(0X,"newObjectFile",Options.Flag);
  11621. options.Add(0X,"traceModule",Options.String);
  11622. options.Add(0X,"profile",Options.Flag);
  11623. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11624. options.Add(0X,"noAsserts",Options.Flag);
  11625. options.Add(0X,"metaData",Options.String);
  11626. options.Add('o',"optimize", Options.Flag);
  11627. options.Add(0X,"preregisterStatic", Options.Flag);
  11628. options.Add(0X,"cellsAreObjects", Options.Flag);
  11629. END DefineOptions;
  11630. PROCEDURE GetOptions(options: Options.Options);
  11631. VAR name,string: SyntaxTree.IdentifierString;
  11632. BEGIN
  11633. GetOptions^(options);
  11634. trace := options.GetString("trace",traceString);
  11635. profile := options.GetFlag("profile");
  11636. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11637. noAsserts := options.GetFlag("noAsserts");
  11638. cooperative := options.GetFlag("cooperative");
  11639. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11640. IF cooperative THEN
  11641. SetRuntimeModuleName("CPU") END
  11642. END;
  11643. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11644. simpleMetaData := TRUE
  11645. END;
  11646. IF options.GetString("metaData",string) THEN
  11647. IF string = "simple" THEN simpleMetaData := TRUE
  11648. ELSIF string ="full" THEN simpleMetaData := FALSE
  11649. END;
  11650. END;
  11651. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11652. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11653. optimize := options.GetFlag("optimize");
  11654. preregisterStatic := options.GetFlag("preregisterStatic");
  11655. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11656. END GetOptions;
  11657. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11658. BEGIN RETURN SymbolFileFormat.Get()
  11659. END DefaultSymbolFileFormat;
  11660. END IntermediateBackend;
  11661. (* ----------------------------------- register allocation ------------------------------------- *)
  11662. (* register mapping scheme
  11663. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11664. spill offset
  11665. part(n) --> ticket <--> physical register
  11666. spill offset
  11667. *)
  11668. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11669. emptyOperand: IntermediateCode.Operand;
  11670. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11671. statCoopResetVariables: LONGINT;
  11672. statCoopModifyAssignments: LONGINT;
  11673. modifyAssignmentsPC : LONGINT;
  11674. statCoopNilCheck: LONGINT;
  11675. statCoopSwitch: LONGINT;
  11676. statCoopAssignProcedure: LONGINT;
  11677. statCoopTraceMethod: LONGINT;
  11678. statCoopResetProcedure: LONGINT;
  11679. statCoopTraceModule: LONGINT;
  11680. PROCEDURE ResetStatistics*;
  11681. BEGIN
  11682. statCoopResetVariables := 0;
  11683. statCoopModifyAssignments := 0;
  11684. statCoopNilCheck:= 0;
  11685. statCoopSwitch:= 0;
  11686. statCoopAssignProcedure:= 0;
  11687. statCoopTraceMethod:= 0;
  11688. statCoopResetProcedure:= 0;
  11689. statCoopTraceModule:= 0;
  11690. END ResetStatistics;
  11691. PROCEDURE Statistics*;
  11692. BEGIN
  11693. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11694. TRACE(statCoopNilCheck, statCoopSwitch);
  11695. TRACE(statCoopAssignProcedure,
  11696. statCoopTraceMethod,
  11697. statCoopResetProcedure,
  11698. statCoopTraceModule)
  11699. END Statistics;
  11700. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11701. VAR h: LONGINT;
  11702. BEGIN
  11703. WHILE b # 0 DO
  11704. h := a MOD b;
  11705. a := b;
  11706. b := h;
  11707. END;
  11708. RETURN a
  11709. END GCD;
  11710. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11711. BEGIN
  11712. RETURN a*b DIV GCD(a,b)
  11713. END SCM;
  11714. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11715. BEGIN
  11716. (*TRACE(a,b);*)
  11717. IF a = 0 THEN RETURN b
  11718. ELSIF b = 0 THEN RETURN a
  11719. ELSE RETURN SCM(a,b)
  11720. END;
  11721. END CommonAlignment;
  11722. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11723. BEGIN
  11724. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11725. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11726. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11727. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11728. 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)
  11729. END
  11730. END PassBySingleReference;
  11731. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11732. BEGIN
  11733. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11734. END PassInRegister;
  11735. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11736. VAR new: RegisterEntry;
  11737. BEGIN
  11738. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11739. IF queue = NIL THEN
  11740. queue := new
  11741. ELSE
  11742. new.next := queue;
  11743. IF queue#NIL THEN queue.prev := new END;
  11744. queue := new
  11745. END;
  11746. END AddRegisterEntry;
  11747. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11748. VAR this: RegisterEntry;
  11749. BEGIN
  11750. this := queue;
  11751. WHILE (this # NIL) & (this.register # register) DO
  11752. this := this.next;
  11753. END;
  11754. IF this = NIL THEN
  11755. RETURN FALSE
  11756. END;
  11757. ASSERT(this # NIL);
  11758. IF this = queue THEN queue := queue.next END;
  11759. IF this.prev # NIL THEN this.prev.next := this.next END;
  11760. IF this.next # NIL THEN this.next.prev := this.prev END;
  11761. RETURN TRUE
  11762. END RemoveRegisterEntry;
  11763. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11764. BEGIN ASSERT(cond);
  11765. END Assert;
  11766. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11767. BEGIN
  11768. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11769. END ReusableRegister;
  11770. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11771. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11772. BEGIN
  11773. procedure := moduleScope.bodyProcedure;
  11774. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11775. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11776. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11777. procedure.SetScope(moduleScope);
  11778. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11779. procedure.SetAccess(SyntaxTree.Hidden);
  11780. moduleScope.SetBodyProcedure(procedure);
  11781. moduleScope.AddProcedure(procedure);
  11782. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11783. END;
  11784. END EnsureBodyProcedure;
  11785. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11786. VAR import: SyntaxTree.Import;
  11787. selfName: SyntaxTree.IdentifierString;
  11788. module: SyntaxTree.Module;
  11789. BEGIN
  11790. scope.ownerModule.GetName(selfName);
  11791. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11792. module := scope.ownerModule
  11793. ELSE
  11794. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11795. IF import = NIL THEN
  11796. RETURN NIL
  11797. ELSIF import.module = NIL THEN
  11798. RETURN NIL
  11799. ELSE module := import.module
  11800. END;
  11801. END;
  11802. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11803. END GetSymbol;
  11804. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11805. BEGIN
  11806. op.mode := mode;
  11807. IntermediateCode.InitOperand(op.op);
  11808. IntermediateCode.InitOperand(op.tag);
  11809. IntermediateCode.InitOperand(op.extra);
  11810. op.dimOffset := 0;
  11811. END InitOperand;
  11812. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11813. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11814. BEGIN RETURN IntermediateCode.GetType(system, type)
  11815. END GetType;
  11816. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11817. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11818. BEGIN
  11819. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  11820. (*
  11821. UniqueId(name,module,name,adr);
  11822. *)
  11823. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  11824. constant.SetValue(value);
  11825. module.moduleScope.AddConstant(constant);
  11826. constant.SetScope(module.moduleScope);
  11827. RETURN constant
  11828. END BuildConstant;
  11829. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11830. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  11831. BEGIN
  11832. variable := scope.firstVariable;
  11833. WHILE variable # NIL DO
  11834. IF variable.NeedsTrace() THEN
  11835. RETURN TRUE;
  11836. END;
  11837. variable := variable.nextVariable;
  11838. END;
  11839. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11840. WHILE parameter # NIL DO
  11841. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11842. RETURN TRUE;
  11843. END;
  11844. parameter := parameter.nextParameter;
  11845. END;
  11846. RETURN FALSE;
  11847. END HasPointers;
  11848. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  11849. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  11850. END IsVariableParameter;
  11851. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11852. VAR parameter: SyntaxTree.Parameter;
  11853. BEGIN
  11854. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11855. WHILE parameter # NIL DO
  11856. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  11857. IF parameter.movable THEN RETURN TRUE END;
  11858. parameter := parameter.nextParameter;
  11859. END;
  11860. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  11861. END HasVariableParameters;
  11862. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  11863. BEGIN
  11864. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  11865. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  11866. END HasExplicitTraceMethod;
  11867. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  11868. BEGIN
  11869. IF expression.resolved # NIL THEN expression := expression.resolved END;
  11870. IF (expression IS SyntaxTree.IntegerValue) THEN
  11871. val := expression(SyntaxTree.IntegerValue).value;
  11872. RETURN TRUE
  11873. ELSE
  11874. RETURN FALSE
  11875. END;
  11876. END IsIntegerConstant;
  11877. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  11878. BEGIN
  11879. IF val <= 0 THEN RETURN FALSE END;
  11880. exp := 0;
  11881. WHILE ~ODD(val) DO
  11882. val := val DIV 2;
  11883. INC(exp)
  11884. END;
  11885. RETURN val = 1
  11886. END PowerOf2;
  11887. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  11888. VAR procedure: SyntaxTree.Procedure;
  11889. BEGIN
  11890. procedure := record.recordScope.constructor;
  11891. IF procedure = NIL THEN
  11892. record := record.GetBaseRecord();
  11893. IF record # NIL THEN
  11894. procedure := GetConstructor(record)
  11895. END;
  11896. END;
  11897. RETURN procedure;
  11898. END GetConstructor;
  11899. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  11900. BEGIN
  11901. value := SHORT(op.intValue);
  11902. RETURN op.mode = IntermediateCode.ModeImmediate;
  11903. END IsIntegerImmediate;
  11904. (** whether a type strictily is a pointer to record or object type
  11905. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  11906. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  11907. BEGIN
  11908. IF type = NIL THEN
  11909. RETURN FALSE
  11910. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  11911. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  11912. ELSE
  11913. RETURN FALSE
  11914. END
  11915. END IsStrictlyPointerToRecord;
  11916. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  11917. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  11918. END IsUnsafePointer;
  11919. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  11920. BEGIN type := type.resolved;
  11921. IF type IS SyntaxTree.PointerType THEN
  11922. type := type(SyntaxTree.PointerType).pointerBase;
  11923. type := type.resolved;
  11924. IF type IS SyntaxTree.RecordType THEN
  11925. recordType := type(SyntaxTree.RecordType);
  11926. RETURN TRUE
  11927. ELSE
  11928. RETURN FALSE
  11929. END
  11930. ELSIF type IS SyntaxTree.RecordType THEN
  11931. recordType := type(SyntaxTree.RecordType);
  11932. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  11933. ELSIF type IS SyntaxTree.ObjectType THEN
  11934. RETURN TRUE
  11935. ELSIF type IS SyntaxTree.AnyType THEN
  11936. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  11937. ELSE
  11938. RETURN FALSE
  11939. END;
  11940. END IsPointerToRecord;
  11941. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  11942. BEGIN
  11943. type := type.resolved;
  11944. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  11945. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  11946. END IsArrayOfSystemByte;
  11947. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  11948. BEGIN
  11949. IF type = NIL THEN RETURN FALSE END;
  11950. type := type.resolved;
  11951. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  11952. END IsOpenArray;
  11953. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  11954. BEGIN
  11955. IF type = NIL THEN RETURN FALSE END;
  11956. type := type.resolved;
  11957. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  11958. END IsSemiDynamicArray;
  11959. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  11960. BEGIN
  11961. IF type = NIL THEN RETURN FALSE END;
  11962. type := type.resolved;
  11963. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  11964. END IsStaticArray;
  11965. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  11966. VAR size: LONGINT;
  11967. BEGIN
  11968. size := 1;
  11969. WHILE (IsStaticArray(type)) DO
  11970. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  11971. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11972. END;
  11973. RETURN size;
  11974. END StaticArrayNumElements;
  11975. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11976. BEGIN
  11977. WHILE (IsStaticArray(type)) DO
  11978. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11979. END;
  11980. RETURN type;
  11981. END StaticArrayBaseType;
  11982. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11983. BEGIN
  11984. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  11985. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11986. END;
  11987. RETURN type;
  11988. END ArrayBaseType;
  11989. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  11990. BEGIN
  11991. IF type = NIL THEN RETURN FALSE END;
  11992. type := type.resolved;
  11993. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  11994. END IsDelegate;
  11995. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  11996. VAR i: LONGINT;
  11997. BEGIN
  11998. i := 0; type := type.resolved;
  11999. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12000. INC(i);
  12001. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12002. END;
  12003. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12004. INC(i);
  12005. type := type(SyntaxTree.MathArrayType).arrayBase;
  12006. IF type # NIL THEN type := type.resolved END;
  12007. END;
  12008. RETURN i
  12009. END DynamicDim;
  12010. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12011. BEGIN
  12012. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12013. type := type(SyntaxTree.ArrayType).arrayBase;
  12014. END;
  12015. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12016. type := type(SyntaxTree.MathArrayType).arrayBase;
  12017. END;
  12018. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12019. END StaticSize;
  12020. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12021. BEGIN
  12022. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12023. END IsImmediate;
  12024. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12025. BEGIN
  12026. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12027. END IsAddress;
  12028. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12029. BEGIN
  12030. RETURN (x.mode = IntermediateCode.ModeRegister);
  12031. END IsRegister;
  12032. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12033. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12034. BEGIN
  12035. typeDeclaration := recordType.typeDeclaration;
  12036. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12037. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12038. END GetRecordTypeName;
  12039. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12040. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12041. BEGIN
  12042. parSize := 0;
  12043. IF StructuredReturnType(procedureType) THEN
  12044. parameter := procedureType.returnParameter;
  12045. INC(parSize,system.SizeOfParameter(parameter));
  12046. parSize := parSize + (-parSize) MOD system.addressSize;
  12047. END;
  12048. parameter :=procedureType.lastParameter;
  12049. WHILE (parameter # NIL) DO
  12050. INC(parSize,system.SizeOfParameter(parameter));
  12051. parSize := parSize + (-parSize) MOD system.addressSize;
  12052. parameter := parameter.prevParameter;
  12053. END;
  12054. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12055. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12056. RETURN ToMemoryUnits(system,parSize)
  12057. END ParametersSize;
  12058. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12059. BEGIN
  12060. IF type = NIL THEN RETURN FALSE
  12061. ELSE
  12062. type := type.resolved;
  12063. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12064. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12065. END
  12066. END ReturnedAsParameter;
  12067. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12068. BEGIN
  12069. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12070. END StructuredReturnType;
  12071. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12072. BEGIN
  12073. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12074. END IsNested;
  12075. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12076. BEGIN
  12077. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12078. scope := scope.outerScope;
  12079. END;
  12080. RETURN scope # NIL;
  12081. END InCellScope;
  12082. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12083. BEGIN
  12084. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12085. RETURN 0
  12086. ELSE
  12087. *)
  12088. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12089. (*END;*)
  12090. END ProcedureParametersSize;
  12091. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12092. VAR dataUnit: LONGINT;
  12093. BEGIN dataUnit := system.dataUnit;
  12094. ASSERT(size MOD system.dataUnit = 0);
  12095. RETURN size DIV system.dataUnit
  12096. END ToMemoryUnits;
  12097. PROCEDURE Get*(): Backend.Backend;
  12098. VAR backend: IntermediateBackend;
  12099. BEGIN NEW(backend); RETURN backend
  12100. END Get;
  12101. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12102. VAR instruction: IntermediateCode.Instruction;
  12103. BEGIN
  12104. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12105. RETURN instruction
  12106. END Nop;
  12107. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12108. VAR instruction: IntermediateCode.Instruction;
  12109. BEGIN
  12110. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12111. RETURN instruction
  12112. END Mov;
  12113. (* like Mov but ensures that no new register will be allocated for dest *)
  12114. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12115. VAR instruction: IntermediateCode.Instruction;
  12116. BEGIN
  12117. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12118. RETURN instruction
  12119. END MovReplace;
  12120. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12121. VAR instruction: IntermediateCode.Instruction;
  12122. BEGIN
  12123. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12124. RETURN instruction
  12125. END Conv;
  12126. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12127. VAR instruction: IntermediateCode.Instruction;
  12128. BEGIN
  12129. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12130. RETURN instruction
  12131. END Call;
  12132. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12133. VAR op1, op2: IntermediateCode.Operand;
  12134. VAR instruction: IntermediateCode.Instruction;
  12135. BEGIN
  12136. IntermediateCode.InitNumber(op1,pcOffset);
  12137. IntermediateCode.InitNumber(op2,callingConvention);
  12138. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12139. RETURN instruction
  12140. END Exit;
  12141. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12142. VAR instruction: IntermediateCode.Instruction;
  12143. BEGIN
  12144. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12145. RETURN instruction
  12146. END Return;
  12147. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12148. VAR instruction: IntermediateCode.Instruction;
  12149. BEGIN
  12150. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12151. RETURN instruction
  12152. END Result;
  12153. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12154. VAR op1: IntermediateCode.Operand;
  12155. VAR instruction: IntermediateCode.Instruction;
  12156. BEGIN
  12157. IntermediateCode.InitNumber(op1,nr);
  12158. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12159. RETURN instruction
  12160. END Trap;
  12161. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12162. VAR instruction: IntermediateCode.Instruction;
  12163. BEGIN
  12164. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12165. RETURN instruction
  12166. END Br;
  12167. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12168. VAR instruction: IntermediateCode.Instruction;
  12169. BEGIN
  12170. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12171. RETURN instruction
  12172. END Breq;
  12173. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12174. VAR instruction: IntermediateCode.Instruction;
  12175. BEGIN
  12176. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12177. RETURN instruction
  12178. END Brne;
  12179. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12180. VAR instruction: IntermediateCode.Instruction;
  12181. BEGIN
  12182. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12183. RETURN instruction
  12184. END Brge;
  12185. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12186. VAR instruction: IntermediateCode.Instruction;
  12187. BEGIN
  12188. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12189. RETURN instruction
  12190. END Brlt;
  12191. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12192. VAR instruction: IntermediateCode.Instruction;
  12193. BEGIN
  12194. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12195. RETURN instruction
  12196. END Pop;
  12197. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12198. VAR instruction: IntermediateCode.Instruction;
  12199. BEGIN
  12200. ASSERT(op.mode # IntermediateCode.Undefined);
  12201. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12202. RETURN instruction
  12203. END Push;
  12204. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12205. VAR instruction: IntermediateCode.Instruction;
  12206. BEGIN
  12207. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12208. RETURN instruction
  12209. END Neg;
  12210. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12211. VAR instruction: IntermediateCode.Instruction;
  12212. BEGIN
  12213. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12214. RETURN instruction
  12215. END Not;
  12216. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12217. VAR instruction: IntermediateCode.Instruction;
  12218. BEGIN
  12219. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12220. RETURN instruction
  12221. END Abs;
  12222. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12223. VAR instruction: IntermediateCode.Instruction;
  12224. BEGIN
  12225. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12226. RETURN instruction
  12227. END Mul;
  12228. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12229. VAR instruction: IntermediateCode.Instruction;
  12230. BEGIN
  12231. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12232. RETURN instruction
  12233. END Div;
  12234. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12235. VAR instruction: IntermediateCode.Instruction;
  12236. BEGIN
  12237. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12238. RETURN instruction
  12239. END Mod;
  12240. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12241. VAR instruction: IntermediateCode.Instruction;
  12242. BEGIN
  12243. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12244. RETURN instruction
  12245. END Sub;
  12246. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12247. VAR instruction: IntermediateCode.Instruction;
  12248. BEGIN
  12249. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12250. RETURN instruction
  12251. END Add;
  12252. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12253. VAR instruction: IntermediateCode.Instruction;
  12254. BEGIN
  12255. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12256. RETURN instruction
  12257. END And;
  12258. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12259. VAR instruction: IntermediateCode.Instruction;
  12260. BEGIN
  12261. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12262. RETURN instruction
  12263. END Or;
  12264. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12265. VAR instruction: IntermediateCode.Instruction;
  12266. BEGIN
  12267. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12268. RETURN instruction
  12269. END Xor;
  12270. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12271. VAR instruction: IntermediateCode.Instruction;
  12272. BEGIN
  12273. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12274. RETURN instruction
  12275. END Shl;
  12276. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12277. VAR instruction: IntermediateCode.Instruction;
  12278. BEGIN
  12279. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12280. RETURN instruction
  12281. END Shr;
  12282. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12283. VAR instruction: IntermediateCode.Instruction;
  12284. BEGIN
  12285. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12286. RETURN instruction
  12287. END Rol;
  12288. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12289. VAR instruction: IntermediateCode.Instruction;
  12290. BEGIN
  12291. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12292. RETURN instruction
  12293. END Ror;
  12294. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12295. VAR instruction: IntermediateCode.Instruction;
  12296. BEGIN
  12297. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12298. RETURN instruction
  12299. END Cas;
  12300. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12301. VAR instruction: IntermediateCode.Instruction;
  12302. BEGIN
  12303. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12304. RETURN instruction
  12305. END Copy;
  12306. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12307. VAR instruction: IntermediateCode.Instruction;
  12308. BEGIN
  12309. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12310. RETURN instruction
  12311. END Fill;
  12312. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12313. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12314. BEGIN
  12315. string := IntermediateCode.String(s);
  12316. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12317. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12318. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12319. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12320. RETURN instruction
  12321. END Asm;
  12322. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12323. VAR instruction: IntermediateCode.Instruction;
  12324. BEGIN
  12325. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12326. RETURN instruction
  12327. END Data;
  12328. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12329. VAR instruction: IntermediateCode.Instruction;
  12330. BEGIN
  12331. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12332. IntermediateCode.SetSubType(instruction, subtype);
  12333. RETURN instruction
  12334. END SpecialInstruction;
  12335. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12336. VAR op1: IntermediateCode.Operand;
  12337. VAR instruction: IntermediateCode.Instruction;
  12338. BEGIN
  12339. (*! generate a warning if size exceeds a certain limit *)
  12340. (*
  12341. ASSERT(bytes < 1000000); (* sanity check *)
  12342. *)
  12343. ASSERT(0 <= units); (* sanity check *)
  12344. IntermediateCode.InitNumber(op1,units);
  12345. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12346. RETURN instruction
  12347. END Reserve;
  12348. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12349. VAR op1: IntermediateCode.Operand;
  12350. VAR instruction: IntermediateCode.Instruction;
  12351. BEGIN
  12352. IntermediateCode.InitNumber(op1,position);
  12353. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12354. RETURN instruction
  12355. END LabelInstruction;
  12356. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12357. VAR pc: LONGINT;
  12358. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12359. BEGIN
  12360. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12361. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12362. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12363. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12364. IF instr.op1.type.form = IntermediateCode.Float THEN
  12365. RETURN instr.op1.floatValue = op.floatValue
  12366. ELSE
  12367. RETURN instr.op1.intValue = op.intValue
  12368. END;
  12369. END ProvidesValue;
  12370. BEGIN
  12371. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12372. pc := 0;
  12373. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12374. INC(pc);
  12375. END;
  12376. IF pc = data.pc THEN
  12377. data.Emit(Data(-1,vop));
  12378. END;
  12379. RETURN pc
  12380. END EnterImmediate;
  12381. PROCEDURE Init;
  12382. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12383. BEGIN
  12384. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12385. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12386. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12387. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12388. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12389. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12390. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12391. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12392. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12393. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12394. IntermediateCode.InitOperand(emptyOperand);
  12395. FOR i := 0 TO NumberSystemCalls-1 DO
  12396. name := "@SystemCall";
  12397. Basic.AppendNumber(name,i);
  12398. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12399. END;
  12400. END Init;
  12401. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12402. BEGIN
  12403. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12404. END IsExported;
  12405. BEGIN
  12406. Init;
  12407. END FoxIntermediateBackend.
  12408. Compiler.Compile FoxIntermediateBackend.Mod ~