FoxIntermediateBackend.Mod 535 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746
  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, dim: LONGINT;
  293. size, addressSize: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  294. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset: LONGINT);
  295. BEGIN
  296. size := offset - lastUpdated;
  297. IF size > 0 THEN
  298. irv.Emit(Reserve(x.position,size));
  299. END;
  300. irv.Emit(Data(x.position, op));
  301. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  302. END SingleInitialize;
  303. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset: LONGINT);
  304. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable;
  305. BEGIN
  306. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  307. WITH type: SyntaxTree.RecordType DO
  308. baseType := type.baseType;
  309. IF baseType # NIL THEN
  310. baseType := baseType.resolved;
  311. IF baseType IS SyntaxTree.PointerType THEN
  312. baseType := baseType(SyntaxTree.PointerType).pointerBase
  313. END;
  314. Initialize(baseType,NIL, offset);
  315. END;
  316. variable := type.recordScope.firstVariable;
  317. WHILE variable # NIL DO
  318. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  319. variable := variable.nextVariable
  320. END;
  321. | type: SyntaxTree.ArrayType DO
  322. IF type.form = SyntaxTree.Static THEN
  323. baseType := type.arrayBase;
  324. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  325. FOR i := 0 TO type.staticLength-1 DO
  326. Initialize(baseType,NIL,offset+i*size);
  327. END;
  328. END;
  329. | type: SyntaxTree.MathArrayType DO
  330. IF type.form = SyntaxTree.Open THEN
  331. dim := DynamicDim(type);
  332. baseType := SemanticChecker.ArrayBase(type,dim);
  333. imm := IntermediateCode.Immediate(addressType,dim);
  334. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  335. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  336. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  337. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  338. (* flags remain empty (=0) for open array *)
  339. ELSIF type.form = SyntaxTree.Static THEN
  340. baseType := type.arrayBase;
  341. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  342. ASSERT(type.staticLength < 1024*1024*1024);
  343. FOR i := 0 TO type.staticLength-1 DO
  344. Initialize(baseType,NIL,offset+i*size);
  345. END;
  346. END;
  347. ELSE
  348. IF initializer # NIL THEN
  349. implementationVisitor.Evaluate(initializer, op);
  350. SingleInitialize(op.op, offset);
  351. END;
  352. END;
  353. END Initialize;
  354. BEGIN
  355. IF x.externalName # NIL THEN RETURN END;
  356. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  357. (* code section for variable *)
  358. Global.GetSymbolSegmentedName(x,name);
  359. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  360. irv.SetExported(IsExported(x));
  361. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  362. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  363. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  364. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  365. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  366. FOR i := 0 TO DynamicDim(x.type)-1 DO
  367. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  368. END;
  369. ELSE
  370. lastUpdated:= 0;
  371. IF implementationVisitor.newObjectFile THEN
  372. Initialize(x.type, x.initializer, 0);
  373. END;
  374. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  375. IF size > 0 THEN
  376. irv.Emit(Reserve(x.position,size));
  377. END;
  378. IF ~x.fixed THEN
  379. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  380. ELSE
  381. align := x.alignment;
  382. END;
  383. irv.SetPositionOrAlignment(x.fixed, align);
  384. meta.CheckTypeDeclaration(x.type);
  385. END;
  386. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  387. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  388. END;
  389. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  390. END VisitVariable;
  391. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  392. VAR name: Basic.SegmentedName; irv, irl: IntermediateCode.Section; op: Operand; dim: LONGINT;
  393. BEGIN
  394. HALT(100);
  395. (*
  396. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  397. (* code section for variable *)
  398. Global.GetSymbolSegmentedName(x,name);
  399. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  400. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  401. (*
  402. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  403. *)
  404. IF IsSemiDynamicArray(x.type) & ~backend.cellsAreObjects THEN
  405. HALT(100);
  406. irv.Emit(Reserve(x.position, system.addressSize));
  407. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  408. irl := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  409. irl.Emit(Reserve(x.position, DynamicDim(x.type) * system.addressSize));
  410. ELSIF x.defaultValue = NIL THEN
  411. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  412. ELSE
  413. implementationVisitor.inData := TRUE;
  414. implementationVisitor.Evaluate(x.defaultValue, op);
  415. irv.Emit(Data(x.position,op.op));
  416. implementationVisitor.inData := FALSE;
  417. END;
  418. meta.CheckTypeDeclaration(x.type);
  419. *)
  420. END VisitParameter;
  421. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  422. BEGIN
  423. Type(x.declaredType); (* => code in objects *)
  424. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  425. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  426. END;
  427. END VisitTypeDeclaration;
  428. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  429. BEGIN
  430. IF (SyntaxTree.Public * x.access # {}) THEN
  431. implementationVisitor.VisitConstant(x);
  432. END;
  433. END VisitConstant;
  434. PROCEDURE Scope(x: SyntaxTree.Scope);
  435. VAR procedure: SyntaxTree.Procedure;
  436. constant: SyntaxTree.Constant;
  437. variable: SyntaxTree.Variable;
  438. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  439. BEGIN
  440. prevScope := currentScope;
  441. currentScope := x;
  442. (* constants treated in implementation visitor *)
  443. typeDeclaration := x.firstTypeDeclaration;
  444. WHILE typeDeclaration # NIL DO
  445. VisitTypeDeclaration(typeDeclaration);
  446. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  447. END;
  448. variable := x.firstVariable;
  449. WHILE variable # NIL DO
  450. VisitVariable(variable);
  451. variable := variable.nextVariable;
  452. END;
  453. procedure := x.firstProcedure;
  454. WHILE procedure # NIL DO
  455. VisitProcedure(procedure);
  456. procedure := procedure.nextProcedure;
  457. END;
  458. constant := x.firstConstant;
  459. WHILE constant # NIL DO
  460. VisitConstant(constant);
  461. constant := constant.nextConstant;
  462. END;
  463. currentScope := prevScope;
  464. END Scope;
  465. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  466. VAR parameter: SyntaxTree.Parameter;
  467. BEGIN
  468. parameter := first;
  469. WHILE parameter # NIL DO
  470. VisitParameter(parameter);
  471. parameter := parameter.nextParameter;
  472. END;
  473. END Parameters;
  474. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  475. VAR scope: SyntaxTree.ProcedureScope;
  476. prevScope: SyntaxTree.Scope;
  477. inline, finalizer: BOOLEAN;
  478. procedureType: SyntaxTree.ProcedureType;
  479. pc: LONGINT;
  480. stackSize: LONGINT;
  481. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  482. null,size,src,dest,fp,res: IntermediateCode.Operand;
  483. cc: LONGINT;
  484. cellType: SyntaxTree.CellType;
  485. registerNumber: LONGINT;
  486. registerClass: IntermediateCode.RegisterClass;
  487. type: IntermediateCode.Type;
  488. formalParameter: SyntaxTree.Parameter;
  489. recordType: SyntaxTree.RecordType;
  490. isModuleBody: BOOLEAN;
  491. PROCEDURE Signature;
  492. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  493. BEGIN
  494. procedureType := x.type(SyntaxTree.ProcedureType);
  495. returnType := procedureType.returnType;
  496. IF returnType # NIL THEN
  497. meta.CheckTypeDeclaration(returnType)
  498. END;
  499. parameter := procedureType.firstParameter;
  500. WHILE parameter # NIL DO
  501. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  502. parameter := parameter.nextParameter;
  503. END;
  504. END Signature;
  505. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  506. VAR result: BOOLEAN;
  507. BEGIN
  508. result := FALSE;
  509. IF x = SyntaxTree.invalidExpression THEN
  510. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  511. result := TRUE;
  512. value := x.resolved(SyntaxTree.IntegerValue).value;
  513. ELSE
  514. Error(x.position,"expression is not an integer constant");
  515. END;
  516. RETURN result;
  517. END CheckIntegerValue;
  518. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  519. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  520. BEGIN
  521. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  522. WHILE (this # NIL) & (this.identifier # id) DO
  523. this := this.nextModifier;
  524. END;
  525. IF this # NIL THEN
  526. IF this.expression = NIL THEN
  527. Error(this.position,"expected expression value");
  528. ELSIF CheckIntegerValue(this.expression,value) THEN
  529. END;
  530. RETURN TRUE
  531. ELSE RETURN FALSE
  532. END;
  533. END HasValue;
  534. CONST DefaultDataMemorySize=512;
  535. BEGIN
  536. IF x.externalName # NIL THEN RETURN END;
  537. (*
  538. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  539. *)
  540. (* code section for this procedure *)
  541. scope := x.procedureScope;
  542. prevScope := currentScope;
  543. currentScope := scope;
  544. procedureType := x.type(SyntaxTree.ProcedureType);
  545. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  546. implementationVisitor.temporaries.Init;
  547. implementationVisitor.usedRegisters := NIL;
  548. implementationVisitor.registerUsageCount.Init;
  549. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  550. IF (scope.body # NIL) & (x.isInline) THEN
  551. inline := TRUE;
  552. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  553. ir.SetExported(IsExported(x));
  554. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  555. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  556. IF backend.cellsAreObjects THEN
  557. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  558. ir.SetExported(IsExported(x));
  559. ELSE
  560. RETURN; (* cellnet cannot be compiled for final static hardware *)
  561. END;
  562. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  563. inline := FALSE;
  564. AddBodyCallStub(x);
  565. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  566. ir.SetExported(IsExported(x));
  567. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  568. inline := FALSE;
  569. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  570. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  571. AddBodyCallStub(x);
  572. AddStackAllocation(x,stackSize);
  573. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  574. ir.SetExported(IsExported(x));
  575. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  576. inline := FALSE;
  577. Parameters(procedureType.firstParameter);
  578. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  579. ir.SetExported(IsExported(x));
  580. ELSE
  581. inline := FALSE;
  582. IF x.isEntry OR x.isExit THEN
  583. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  584. ir.SetExported(TRUE);
  585. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  586. ELSE
  587. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  588. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  589. END;
  590. END;
  591. cc := procedureType.callingConvention;
  592. IF scope.body # NIL THEN
  593. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  594. registerNumber := 0;
  595. IF ~inline THEN
  596. IF scope.lastVariable = NIL THEN
  597. stackSize := 0
  598. ELSE
  599. stackSize := scope.lastVariable.offsetInBits;
  600. IF stackSize <0 THEN stackSize := -stackSize END;
  601. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  602. END;
  603. (*
  604. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  605. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  606. *)
  607. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  608. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  609. END;
  610. pc := ir.pc-1;
  611. (*
  612. ir.Emit(Nop(position)); (* placeholder for fill *)
  613. *)
  614. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  615. formalParameter := procedureType.lastParameter;
  616. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  617. IF ~PassInRegister(formalParameter) THEN
  618. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  619. ELSE
  620. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  621. type := GetType(system, formalParameter.type);
  622. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  623. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  624. ir.Emit(Mov(-1,dest, src));
  625. implementationVisitor.ReleaseIntermediateOperand(src);
  626. INC(registerNumber);
  627. formalParameter := formalParameter.prevParameter;
  628. END;
  629. END;
  630. END;
  631. ir.EnterValidPAF;
  632. END;
  633. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  634. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  635. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  636. IF scope.lastVariable # NIL THEN
  637. stackSize := scope.lastVariable.offsetInBits;
  638. IF stackSize <0 THEN stackSize := -stackSize END;
  639. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  640. END;
  641. END;
  642. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  643. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  644. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  645. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  646. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  647. ir.EmitAt(pc,Push(size));
  648. implementationVisitor.StaticCallOperand(result,procedure);
  649. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  650. END;
  651. *)
  652. END;
  653. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  654. IF stackSize > 0 THEN
  655. IF (stackSize MOD system.addressSize = 0) THEN
  656. null := IntermediateCode.Immediate(addressType,0);
  657. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  658. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  659. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  660. ELSE
  661. null := IntermediateCode.Immediate(int8,0);
  662. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  663. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  664. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  665. END;
  666. (*! should potentially be called by backend -- enter might initialize
  667. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  668. *)
  669. END;
  670. ir.ExitValidPAF;
  671. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  672. finalizer := FALSE;
  673. IF backend.cooperative & x.isFinalizer THEN
  674. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  675. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  676. GetRecordTypeName(recordType,name);
  677. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  678. END;
  679. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  680. IF backend.cooperative THEN
  681. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  682. IF implementationVisitor.profile & ~isModuleBody THEN
  683. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  684. END;
  685. END;
  686. implementationVisitor.EmitLeave(ir, x.position,cc);
  687. IF finalizer THEN
  688. IF backend.hasLinkRegister THEN
  689. ir.Emit(Pop(-1, implementationVisitor.lr));
  690. END;
  691. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  692. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  693. ir.Emit(Br(x.position,dest));
  694. ELSE
  695. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  696. END;
  697. ELSE
  698. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  699. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  700. END;
  701. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  702. IF backend.cooperative THEN
  703. IF HasPointers (scope) THEN
  704. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  705. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  706. ir.Emit(Result(x.position, res));
  707. ir.Emit(Push(x.position, res));
  708. implementationVisitor.ResetVariables(scope);
  709. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  710. ir.Emit(Pop(x.position, res));
  711. ir.Emit(Return(x.position, res));
  712. ELSE
  713. implementationVisitor.ResetVariables(scope);
  714. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  715. END;
  716. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  717. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  718. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  719. ir.Emit(Result(x.position, res));
  720. ir.Emit(Push(x.position, res));
  721. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  722. ir.Emit(Pop(x.position, res));
  723. ir.Emit(Return(x.position, res));
  724. ELSE
  725. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  726. END;
  727. END;
  728. implementationVisitor.EmitLeave(ir,x.position,cc);
  729. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  730. ELSE
  731. ir.Emit(Nop(x.position));
  732. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  733. implementationVisitor.EmitLeave(ir,x.position,cc);
  734. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  735. END;
  736. END;
  737. END
  738. END;
  739. ELSE (* force body for procedures *)
  740. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  741. ir.EnterValidPAF;
  742. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  743. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  744. ir.ExitValidPAF;
  745. implementationVisitor.EmitLeave(ir,x.position,cc);
  746. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  747. END;
  748. Scope(scope);
  749. Signature;
  750. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  751. currentScope := prevScope;
  752. END Procedure;
  753. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  754. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  755. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  756. BEGIN
  757. ASSERT (bodyProcedure # NIL);
  758. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  759. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  760. procedure.SetScope(bodyProcedure.scope);
  761. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  762. procedure.SetAccess(SyntaxTree.Hidden);
  763. Global.GetSymbolSegmentedName (procedure,name);
  764. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  765. ir.SetExported(TRUE);
  766. ir.SetPriority(InitPriority);
  767. Global.GetSymbolSegmentedName (bodyProcedure,name);
  768. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  769. implementationVisitor.currentScope := module.module.moduleScope;
  770. implementationVisitor.section := ir;
  771. implementationVisitor.PushSelfPointer();
  772. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  773. ELSIF backend.preregisterStatic THEN
  774. implementationVisitor.currentScope := module.module.moduleScope;
  775. implementationVisitor.section := ir;
  776. implementationVisitor.PushSelfPointer();
  777. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  778. ELSE
  779. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  780. ir.Emit(Call(bodyProcedure.position,op, 0));
  781. END;
  782. END AddBodyCallStub;
  783. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  784. VAR name: Basic.SegmentedName;
  785. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  786. BEGIN
  787. Global.GetSymbolSegmentedName (symbol,name);
  788. Basic.RemoveSuffix(name);
  789. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  790. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  791. ir.SetExported(TRUE);
  792. ir.SetPriority(FirstPriority);
  793. IntermediateCode.InitImmediate(op,addressType,initStack);
  794. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  795. END AddStackAllocation;
  796. (** entry function to visit a complete module *)
  797. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  798. VAR
  799. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  800. hasDynamicOperatorDeclarations: BOOLEAN;
  801. operator: SyntaxTree.Operator;
  802. import: SyntaxTree.Import;
  803. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  804. BEGIN
  805. type := type.resolved;
  806. IF type IS SyntaxTree.RecordType THEN
  807. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  808. ELSIF (type IS SyntaxTree.ArrayType) THEN
  809. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  810. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  811. END;
  812. ELSIF type IS SyntaxTree.MathArrayType THEN
  813. WITH type: SyntaxTree.MathArrayType DO
  814. IF type.form = SyntaxTree.Open THEN
  815. RETURN TRUE
  816. ELSIF type.form = SyntaxTree.Static THEN
  817. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  818. END;
  819. END;
  820. END;
  821. RETURN FALSE
  822. END TypeNeedsInitialization;
  823. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  824. VAR variable: SyntaxTree.Variable;
  825. BEGIN
  826. variable := scope.firstVariable;
  827. WHILE variable # NIL DO
  828. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  829. IF variable.initializer # NIL THEN RETURN TRUE END;
  830. variable := variable.nextVariable;
  831. END;
  832. RETURN FALSE
  833. END ScopeNeedsInitialization;
  834. BEGIN
  835. ASSERT(x # NIL); ASSERT(module # NIL);
  836. SELF.module := module;
  837. (* add import names to the generated Sections.Module *)
  838. import := x.moduleScope.firstImport;
  839. WHILE import # NIL DO
  840. import.module.GetName(idstr);
  841. module.imports.AddName(idstr);
  842. import := import.nextImport
  843. END;
  844. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  845. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  846. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  847. moduleSelf.SetType(system.anyType);
  848. moduleSelf.SetScope(x.moduleScope);
  849. moduleSelf.SetUntraced(TRUE);
  850. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  851. ir.SetExported(TRUE);
  852. IntermediateCode.InitImmediate(op,addressType,0);
  853. ir.Emit(Data(-1,op));
  854. END;
  855. implementationVisitor.module := module;
  856. implementationVisitor.moduleScope := x.moduleScope;
  857. implementationVisitor.moduleSelf := moduleSelf;
  858. implementationVisitor.canBeLoaded := TRUE;
  859. meta.SetModule(module);
  860. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  861. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  862. END;
  863. IF backend.profile THEN
  864. EnsureBodyProcedure(x.moduleScope);
  865. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  866. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  867. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  868. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  869. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  870. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  871. Global.GetModuleName(module.module,idstr);
  872. implementationVisitor.ProfilerAddModule(idstr);
  873. implementationVisitor.numberProcedures := 0;
  874. END;
  875. implementationVisitor.profile := backend.profile;
  876. (* check if there is at least one dynamic operator locally defined *)
  877. hasDynamicOperatorDeclarations := FALSE;
  878. operator := x.moduleScope.firstOperator;
  879. WHILE operator # NIL DO
  880. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  881. operator := operator.nextOperator
  882. END;
  883. (* add operator initialization code section *)
  884. IF hasDynamicOperatorDeclarations THEN
  885. EnsureBodyProcedure(x.moduleScope);
  886. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  887. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  888. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  889. END;
  890. Scope(x.moduleScope);
  891. IF hasDynamicOperatorDeclarations THEN
  892. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  893. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  894. END;
  895. IF backend.profile THEN
  896. implementationVisitor.ProfilerPatchInit;
  897. END;
  898. END Module;
  899. END DeclarationVisitor;
  900. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  901. RegisterUsageCount*=OBJECT
  902. VAR used: UsedArray; count: LONGINT;
  903. PROCEDURE &Init;
  904. VAR i: LONGINT;
  905. BEGIN
  906. count := 0;
  907. IF used = NIL THEN NEW(used,64); END;
  908. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  909. END Init;
  910. PROCEDURE Grow;
  911. VAR new: UsedArray; size,i: LONGINT;
  912. BEGIN
  913. size := LEN(used)*2;
  914. NEW(new,size);
  915. FOR i := 0 TO LEN(used)-1 DO
  916. new[i].count := used[i].count;
  917. new[i].type := used[i].type;
  918. new[i].map := used[i].map
  919. END;
  920. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  921. used := new
  922. END Grow;
  923. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  924. BEGIN
  925. INC(count);
  926. IF count = LEN(used) THEN Grow END;
  927. used[count].type := type;
  928. used[count].class := class;
  929. used[count].map := count;
  930. RETURN count;
  931. END Next;
  932. PROCEDURE IncUse(register: LONGINT);
  933. BEGIN
  934. INC(used[register].count);
  935. (*
  936. IF (register = 1) & (count > 30) THEN
  937. D.TraceBack;
  938. END;
  939. *)
  940. END IncUse;
  941. PROCEDURE DecUse(register: LONGINT);
  942. BEGIN
  943. DEC(used[register].count);
  944. END DecUse;
  945. PROCEDURE Map(register: LONGINT): LONGINT;
  946. VAR map : LONGINT;
  947. BEGIN
  948. IF register > 0 THEN
  949. map := used[register].map;
  950. WHILE register # map DO register := map; map := used[register].map END;
  951. END;
  952. RETURN register
  953. END Map;
  954. PROCEDURE Use(register: LONGINT): LONGINT;
  955. BEGIN
  956. IF register< LEN(used) THEN
  957. RETURN used[register].count
  958. ELSE
  959. RETURN 0
  960. END
  961. END Use;
  962. END RegisterUsageCount;
  963. RegisterEntry = POINTER TO RECORD
  964. prev,next: RegisterEntry;
  965. register: LONGINT;
  966. registerClass: IntermediateCode.RegisterClass;
  967. type: IntermediateCode.Type;
  968. END;
  969. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  970. Variables = OBJECT (Basic.List)
  971. VAR
  972. inUse: VariableUse;
  973. registerIndex: LONGINT;
  974. PROCEDURE & Init;
  975. VAR i: LONGINT;
  976. BEGIN
  977. InitList(16);
  978. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  979. registerIndex := 1024;
  980. END Init;
  981. PROCEDURE GetUsage(VAR use: VariableUse);
  982. BEGIN
  983. use := inUse;
  984. END GetUsage;
  985. PROCEDURE SetUsage(CONST use: VariableUse);
  986. BEGIN
  987. inUse := use;
  988. END SetUsage;
  989. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  990. VAR any: ANY;
  991. BEGIN
  992. any := Get(i);;
  993. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  994. END GetVariable;
  995. PROCEDURE Occupy(pos: LONGINT);
  996. BEGIN
  997. INCL(inUse[pos DIV 32], pos MOD 32);
  998. END Occupy;
  999. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1000. BEGIN
  1001. Occupy(Length());
  1002. Add(v);
  1003. END AddVariable;
  1004. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  1005. VAR var : SyntaxTree.Variable;
  1006. BEGIN
  1007. FOR pos := 0 TO Length()-1 DO
  1008. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  1009. var := GetVariable(pos);
  1010. IF type.SameType(var.type) THEN
  1011. Occupy(pos); RETURN var
  1012. END;
  1013. END;
  1014. END;
  1015. pos := Length();
  1016. RETURN NIL
  1017. END GetFreeVariable;
  1018. END Variables;
  1019. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  1020. SymbolMapper = OBJECT
  1021. VAR
  1022. first: SymbolMap;
  1023. PROCEDURE & Init;
  1024. BEGIN
  1025. first := NIL;
  1026. END Init;
  1027. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  1028. VAR new: SymbolMap;
  1029. BEGIN
  1030. NEW(new); new.this := this; new.to := to; new.tag := tag;
  1031. new.next := first; first := new;
  1032. END Add;
  1033. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1034. VAR s: SymbolMap;
  1035. BEGIN
  1036. s := first;
  1037. WHILE (s # NIL) & (s.this # this) DO
  1038. s := s.next
  1039. END;
  1040. RETURN s
  1041. END Get;
  1042. END SymbolMapper;
  1043. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1044. VAR
  1045. system: Global.System;
  1046. section: IntermediateCode.Section;
  1047. module: Sections.Module;
  1048. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1049. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1050. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1051. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1052. checker: SemanticChecker.Checker;
  1053. backend: IntermediateBackend;
  1054. meta: MetaDataGenerator;
  1055. position: LONGINT;
  1056. moduleSelf: SyntaxTree.Variable;
  1057. (* variables for hand over of variables / temporary state *)
  1058. currentScope: SyntaxTree.Scope;
  1059. constantDeclaration : SyntaxTree.Symbol;
  1060. result: Operand; (* result of the most recent expression / statement *)
  1061. destination: IntermediateCode.Operand;
  1062. arrayDestinationTag: IntermediateCode.Operand;
  1063. arrayDestinationDimension:LONGINT;
  1064. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1065. conditional: BOOLEAN;
  1066. trueLabel, falseLabel, exitLabel: Label;
  1067. locked: BOOLEAN;
  1068. (*
  1069. usedRegisters: Registers;
  1070. *)
  1071. registerUsageCount: RegisterUsageCount;
  1072. usedRegisters: RegisterEntry;
  1073. (* useful operands and types *)
  1074. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1075. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1076. commentPrintout: Printout.Printer;
  1077. dump: Streams.Writer;
  1078. tagsAvailable : BOOLEAN;
  1079. supportedInstruction: SupportedInstructionProcedure;
  1080. supportedImmediate: SupportedImmediateProcedure;
  1081. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1082. emitLabels: BOOLEAN;
  1083. runtimeModuleName : SyntaxTree.IdentifierString;
  1084. newObjectFile: BOOLEAN;
  1085. indexCounter: LONGINT;
  1086. profile: BOOLEAN;
  1087. profileId, profileInit: IntermediateCode.Section;
  1088. profileInitPatchPosition: LONGINT;
  1089. numberProcedures: LONGINT;
  1090. procedureResultDesignator : SyntaxTree.Designator;
  1091. operatorInitializationCodeSection: IntermediateCode.Section;
  1092. fingerPrinter: FingerPrinter.FingerPrinter;
  1093. temporaries: Variables;
  1094. canBeLoaded : BOOLEAN;
  1095. currentIsInline: BOOLEAN;
  1096. currentMapper: SymbolMapper;
  1097. currentInlineExit: Label;
  1098. moduleBodySection: IntermediateCode.Section;
  1099. NeedDescriptor : BOOLEAN;
  1100. cooperativeSwitches: BOOLEAN;
  1101. lastSwitchPC: LONGINT;
  1102. isUnchecked: BOOLEAN;
  1103. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1104. newObjectFile: BOOLEAN);
  1105. BEGIN
  1106. SELF.system := system;
  1107. SELF.runtimeModuleName := runtime;
  1108. currentScope := NIL;
  1109. hiddenPointerType := NIL;
  1110. delegatePointerType := NIL;
  1111. awaitProcCounter := 0;
  1112. labelId := 0; constId := 0; labelId := 0;
  1113. SELF.checker := checker;
  1114. SELF.backend := backend;
  1115. position := Diagnostics.Invalid;
  1116. conditional := FALSE;
  1117. locked := FALSE;
  1118. InitOperand(result,ModeUndefined);
  1119. addressType := IntermediateCode.GetType(system,system.addressType);
  1120. setType := IntermediateCode.GetType(system,system.setType);
  1121. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1122. byteType := IntermediateCode.GetType(system, system.byteType);
  1123. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1124. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1125. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1126. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1127. nil := IntermediateCode.Immediate(addressType,0);
  1128. IntermediateCode.InitOperand(destination);
  1129. tagsAvailable := TRUE;
  1130. supportedInstruction := supportedInstructionProcedure;
  1131. supportedImmediate := supportedImmediateProcedure;
  1132. inData := FALSE;
  1133. SELF.emitLabels := emitLabels;
  1134. IntermediateCode.InitOperand(arrayDestinationTag);
  1135. bool := IntermediateCode.GetType(system,system.booleanType);
  1136. IntermediateCode.InitImmediate(false,bool,0);
  1137. IntermediateCode.InitImmediate(true,bool,1);
  1138. SELF.newObjectFile := newObjectFile;
  1139. indexCounter := 0;
  1140. NEW(registerUsageCount);
  1141. usedRegisters := NIL;
  1142. procedureResultDesignator := NIL;
  1143. NEW(fingerPrinter, system);
  1144. NEW(temporaries);
  1145. currentIsInline := FALSE;
  1146. NeedDescriptor := FALSE;
  1147. isUnchecked := backend.noRuntimeChecks;
  1148. END Init;
  1149. TYPE Context = RECORD
  1150. section: IntermediateCode.Section;
  1151. registerUsageCount: RegisterUsageCount;
  1152. usedRegisters: RegisterEntry;
  1153. END;
  1154. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1155. VAR context: Context;
  1156. BEGIN
  1157. context.section := section;
  1158. context.registerUsageCount := registerUsageCount;
  1159. context.usedRegisters := usedRegisters;
  1160. section := new;
  1161. NEW(registerUsageCount);
  1162. usedRegisters := NIL;
  1163. RETURN context;
  1164. END SwitchContext;
  1165. PROCEDURE ReturnToContext(context: Context);
  1166. BEGIN
  1167. section := context.section;
  1168. registerUsageCount := context.registerUsageCount;
  1169. usedRegisters := context.usedRegisters;
  1170. END ReturnToContext;
  1171. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1172. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1173. BEGIN
  1174. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1175. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1176. END;
  1177. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1178. section.SetExported(IsExported(syntaxTreeSymbol));
  1179. RETURN section
  1180. END NewSection;
  1181. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1182. VAR new: LONGINT;
  1183. BEGIN
  1184. new := registerUsageCount.Next(type,class);
  1185. UseRegister(new);
  1186. RETURN new
  1187. END AcquireRegister;
  1188. (** get the name for the code section that represens a certain symbol
  1189. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1190. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1191. VAR
  1192. operatorFingerPrint: SyntaxTree.FingerPrint;
  1193. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1194. BEGIN
  1195. Global.GetSymbolSegmentedName(symbol, name);
  1196. (* if the symbol is an operator, then append the fingerprint to the name *)
  1197. IF symbol IS SyntaxTree.Operator THEN
  1198. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1199. string := "[";
  1200. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1201. Strings.Append(string, operatorFingerPrintString);
  1202. Strings.Append(string, "]");
  1203. Basic.AppendToSegmentedName(name,string);
  1204. END
  1205. END GetCodeSectionNameForSymbol;
  1206. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1207. BEGIN
  1208. IF dump # NIL THEN
  1209. dump.String("enter "); dump.String(s); dump.Ln;
  1210. END;
  1211. END TraceEnter;
  1212. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1213. BEGIN
  1214. IF dump # NIL THEN
  1215. dump.String("exit "); dump.String(s); dump.Ln;
  1216. END;
  1217. END TraceExit;
  1218. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1219. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1220. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1221. VAR i: LONGINT;
  1222. BEGIN
  1223. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1224. IF op.rule # NIL THEN
  1225. FOR i := 0 TO LEN(op.rule)-1 DO
  1226. CheckRegister(op.rule[i])
  1227. END;
  1228. END;
  1229. END CheckRegister;
  1230. BEGIN
  1231. CheckRegister(instruction.op1);
  1232. CheckRegister(instruction.op2);
  1233. CheckRegister(instruction.op3);
  1234. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1235. ELSE section.Emit(instruction);
  1236. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1237. END;
  1238. END Emit;
  1239. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1240. BEGIN
  1241. IF backend.cooperative THEN
  1242. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1243. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1244. ELSE
  1245. Emit(Trap(position,trapNo));
  1246. END;
  1247. END EmitTrap;
  1248. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1249. VAR name: Basic.SegmentedName;
  1250. VAR op1, op2, reg: IntermediateCode.Operand;
  1251. VAR call, nocall: Label;
  1252. VAR parametersSize: LONGINT;
  1253. VAR prevSection: IntermediateCode.Section;
  1254. VAR prevDump: Streams.Writer;
  1255. VAR body: SyntaxTree.Body;
  1256. BEGIN
  1257. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1258. prevSection := SELF.section;
  1259. SELF.section := section;
  1260. prevDump := dump;
  1261. dump := section.comments;
  1262. IF backend.hasLinkRegister THEN
  1263. Emit(Push(-1, lr));
  1264. END;
  1265. Emit(Push(-1,fp));
  1266. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1267. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1268. GetCodeSectionNameForSymbol(procedure, name);
  1269. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1270. ELSE
  1271. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1272. END;
  1273. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1274. Emit(Push(-1,op1));
  1275. Emit(Mov(-1,fp, sp));
  1276. body := procedure.procedureScope.body;
  1277. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1278. NEW(call, section);
  1279. NEW(nocall, section);
  1280. reg := NewRegisterOperand(addressType);
  1281. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1282. Emit(Sub(-1,reg, sp, op1));
  1283. BrltL(call, sp, reg);
  1284. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1285. BrgeL(nocall, sp, op2);
  1286. call.Resolve(section.pc);
  1287. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1288. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1289. Emit(Push(-1, op2));
  1290. Emit(Push(-1, reg));
  1291. ReleaseIntermediateOperand(reg);
  1292. CallThis(position, "Activities","ExpandStack",2);
  1293. Emit(Result(-1, sp));
  1294. nocall.Resolve(section.pc);
  1295. END;
  1296. ELSE
  1297. Emit(Mov(-1, fp, sp));
  1298. END;
  1299. Emit(Enter(-1, callconv, varSize));
  1300. SELF.section := prevSection;
  1301. dump := prevDump;
  1302. END EmitEnter;
  1303. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1304. VAR op1,op2: IntermediateCode.Operand;
  1305. VAR instruction: IntermediateCode.Instruction;
  1306. BEGIN
  1307. IntermediateCode.InitNumber(op1,callconv);
  1308. IntermediateCode.InitNumber(op2,varSize);
  1309. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1310. RETURN instruction
  1311. END Enter;
  1312. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1313. VAR op1: IntermediateCode.Operand;
  1314. VAR instruction: IntermediateCode.Instruction;
  1315. BEGIN
  1316. IntermediateCode.InitNumber(op1,callconv);
  1317. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1318. RETURN instruction
  1319. END Leave;
  1320. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1321. VAR prevSection: IntermediateCode.Section;
  1322. VAR op2: IntermediateCode.Operand;
  1323. BEGIN
  1324. prevSection := SELF.section;
  1325. SELF.section := section;
  1326. Emit(Leave(position, callconv));
  1327. IF backend.cooperative THEN
  1328. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1329. Emit(Add(position, sp, fp, op2));
  1330. ELSE
  1331. Emit(Mov(position, sp, fp));
  1332. END;
  1333. Emit(Pop(position, fp));
  1334. SELF.section := prevSection;
  1335. END EmitLeave;
  1336. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1337. VAR m: SymbolMap;
  1338. BEGIN
  1339. position := x.position;
  1340. IF currentIsInline THEN
  1341. m := currentMapper.Get(x);
  1342. IF m # NIL THEN
  1343. (*
  1344. Printout.Info("mapping from", x);
  1345. Printout.Info("mapping to ", m.to);
  1346. *)
  1347. m.to.Accept(SELF);
  1348. op := result;
  1349. IF m.tag # NIL THEN
  1350. ReleaseIntermediateOperand(result.tag);
  1351. m.tag.Accept(SELF);
  1352. op.tag := result.op;
  1353. ReleaseIntermediateOperand(result.tag);
  1354. END;
  1355. RETURN
  1356. END;
  1357. END;
  1358. x.Accept(SELF);
  1359. op := result;
  1360. END Symbol;
  1361. PROCEDURE Expression(x: SyntaxTree.Expression);
  1362. BEGIN
  1363. position := x.position;
  1364. constantDeclaration := NIL;
  1365. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1366. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1367. END;
  1368. IF x.resolved # NIL THEN
  1369. x.resolved.Accept(SELF)
  1370. ELSE
  1371. x.Accept(SELF)
  1372. END;
  1373. (* check this, was commented out in ActiveCells3 *)
  1374. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1375. Error(x.position, "unsupported modifier");
  1376. END;
  1377. END Expression;
  1378. (*
  1379. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1380. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1381. BEGIN
  1382. temporaries.GetUsage(current);
  1383. FOR i := 0 TO LEN(current)-1 DO
  1384. set := current[i] - previous[i];
  1385. IF set # {} THEN
  1386. FOR j := 0 TO MAX(SET)-1 DO
  1387. IF j IN set THEN
  1388. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1389. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1390. Symbol(variable, op);
  1391. MakeMemory(tmp,op.op,addressType,0);
  1392. ReleaseOperand(op);
  1393. Emit(Mov(position,tmp, nil ) );
  1394. ReleaseIntermediateOperand(tmp);
  1395. END;
  1396. END;
  1397. END;
  1398. END;
  1399. END;
  1400. END ResetUsedTemporaries;
  1401. *)
  1402. PROCEDURE Statement(x: SyntaxTree.Statement);
  1403. VAR use: VariableUse;
  1404. BEGIN
  1405. temporaries.GetUsage(use);
  1406. position := x.position;
  1407. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1408. IF commentPrintout # NIL THEN
  1409. commentPrintout.Statement(x);
  1410. dump.Ln;
  1411. (*dump.Update;*)
  1412. END;
  1413. x.Accept(SELF);
  1414. (*
  1415. CheckRegistersFree();
  1416. *)
  1417. (*ResetUsedTemporaries(use);*)
  1418. temporaries.SetUsage(use);
  1419. END Statement;
  1420. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1421. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1422. *)
  1423. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1424. BEGIN
  1425. IF op.mode = IntermediateCode.ModeMemory THEN
  1426. ReuseCopy(res,op);
  1427. ELSE
  1428. res := op;
  1429. UseIntermediateOperand(res);
  1430. END;
  1431. IntermediateCode.AddOffset(res,offset);
  1432. IntermediateCode.MakeMemory(res,type);
  1433. END MakeMemory;
  1434. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1435. VAR mem: IntermediateCode.Operand;
  1436. BEGIN
  1437. MakeMemory(mem,res,type,offset);
  1438. ReleaseIntermediateOperand(res);
  1439. res := mem;
  1440. END ToMemory;
  1441. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1442. VAR mem: IntermediateCode.Operand;
  1443. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1444. componentType: SyntaxTree.Type;
  1445. BEGIN
  1446. type := type.resolved;
  1447. IF operand.mode = ModeReference THEN
  1448. IF type IS SyntaxTree.RangeType THEN
  1449. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1450. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1451. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1452. ReleaseOperand(operand);
  1453. operand.op := firstOp;
  1454. operand.tag := lastOp;
  1455. operand.extra := stepOp;
  1456. ELSIF type IS SyntaxTree.ComplexType THEN
  1457. componentType := type(SyntaxTree.ComplexType).componentType;
  1458. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1459. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1460. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1461. ReleaseOperand(operand);
  1462. operand.op := firstOp;
  1463. operand.tag := lastOp
  1464. ELSE
  1465. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1466. ReleaseIntermediateOperand(operand.op);
  1467. operand.op := mem;
  1468. END;
  1469. operand.mode := ModeValue;
  1470. END;
  1471. ASSERT(operand.mode = ModeValue);
  1472. END LoadValue;
  1473. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1474. VAR prevConditional: BOOLEAN;
  1475. BEGIN
  1476. prevConditional := conditional;
  1477. conditional := FALSE;
  1478. InitOperand(result, ModeUndefined);
  1479. Expression(x);
  1480. op := result;
  1481. LoadValue(op,x.type.resolved);
  1482. conditional := prevConditional;
  1483. END Evaluate;
  1484. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1485. VAR prevConditional: BOOLEAN;
  1486. BEGIN
  1487. prevConditional := conditional;
  1488. conditional := FALSE;
  1489. InitOperand(result,ModeUndefined);
  1490. Expression(x);
  1491. op := result;
  1492. (*
  1493. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1494. *)
  1495. conditional := prevConditional;
  1496. END Designate;
  1497. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1498. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1499. BEGIN
  1500. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1501. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1502. conditional := TRUE;
  1503. trueLabel := trueL; falseLabel := falseL;
  1504. Expression(x);
  1505. trueL := trueLabel; falseL := falseLabel;
  1506. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1507. END Condition;
  1508. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1509. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1510. BEGIN
  1511. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1512. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1513. RETURN op
  1514. END NewRegisterOperand;
  1515. PROCEDURE UnuseRegister(register: LONGINT);
  1516. BEGIN
  1517. IF (register > 0) THEN
  1518. register := registerUsageCount.Map(register);
  1519. registerUsageCount.DecUse(register);
  1520. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1521. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1522. END;
  1523. IF registerUsageCount.Use(register)=0 THEN
  1524. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1525. Warning(position, "register cannot be removed");
  1526. END;
  1527. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1528. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1529. END;
  1530. ELSIF registerUsageCount.Use(register)<0 THEN
  1531. Warning(position, "register removed too often");
  1532. IF dump # NIL THEN
  1533. dump.String("register removed too often"); dump.Ln; dump.Update;
  1534. END;
  1535. D.TraceBack;
  1536. END;
  1537. END;
  1538. END UnuseRegister;
  1539. PROCEDURE UseRegister(register: LONGINT);
  1540. BEGIN
  1541. IF (register > 0) THEN
  1542. register := registerUsageCount.Map(register);
  1543. registerUsageCount.IncUse(register);
  1544. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1545. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1546. END;
  1547. IF registerUsageCount.Use(register)=1 THEN
  1548. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1549. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1550. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1551. END;
  1552. END;
  1553. END;
  1554. END UseRegister;
  1555. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1556. BEGIN
  1557. UnuseRegister(op.register)
  1558. END ReleaseIntermediateOperand;
  1559. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1560. BEGIN
  1561. UseRegister(op.register)
  1562. END UseIntermediateOperand;
  1563. PROCEDURE ReleaseOperand(CONST op: Operand);
  1564. BEGIN
  1565. UnuseRegister(op.op.register);
  1566. UnuseRegister(op.tag.register);
  1567. UnuseRegister(op.extra.register);
  1568. END ReleaseOperand;
  1569. (* save registers marked in array "markedRegisters" to the stack
  1570. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1571. *)
  1572. PROCEDURE SaveRegisters();
  1573. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1574. BEGIN
  1575. entry := usedRegisters;
  1576. WHILE entry # NIL DO
  1577. type := registerUsageCount.used[entry.register].type;
  1578. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1579. Emit(Push(position,op));
  1580. entry := entry.next;
  1581. END;
  1582. END SaveRegisters;
  1583. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1584. BEGIN
  1585. saved := usedRegisters;
  1586. usedRegisters := NIL;
  1587. END ReleaseUsedRegisters;
  1588. (** remove parameter registers from used queue *)
  1589. PROCEDURE ReleaseParameterRegisters;
  1590. VAR entry,prev,next: RegisterEntry;
  1591. BEGIN
  1592. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1593. WHILE entry # NIL DO
  1594. next := entry.next;
  1595. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1596. registerUsageCount.DecUse(entry.register);
  1597. ASSERT(registerUsageCount.Use(entry.register)=0);
  1598. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1599. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1600. END;
  1601. ELSIF prev = NIL THEN
  1602. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1603. ELSE
  1604. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1605. END;
  1606. entry := next;
  1607. END;
  1608. END ReleaseParameterRegisters;
  1609. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1610. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1611. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1612. BEGIN
  1613. entry := saved;
  1614. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1615. entry := prev;
  1616. WHILE entry # NIL DO
  1617. prev := entry.prev;
  1618. type := entry.type;
  1619. class := entry.registerClass;
  1620. IntermediateCode.InitRegister(op,type,class,entry.register);
  1621. (*
  1622. new := registerUsageCount.Next(type,class);
  1623. registerUsageCount.Remap(entry.register,new);
  1624. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1625. dump.String("remap register "); dump.Int(entry.register,1);
  1626. dump.String("to "); dump.Int(new,1);
  1627. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1628. END;
  1629. entry.register := new;
  1630. *)
  1631. Emit(Pop(position,op));
  1632. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1633. entry := prev;
  1634. END;
  1635. (*
  1636. usedRegisters := saved;
  1637. *)
  1638. END RestoreRegisters;
  1639. PROCEDURE CheckRegistersFree;
  1640. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1641. BEGIN
  1642. IF usedRegisters # NIL THEN
  1643. r := usedRegisters;
  1644. WHILE r # NIL DO
  1645. warning := "register ";
  1646. Strings.AppendInt(warning, r.register);
  1647. Strings.Append(warning, " not released.");
  1648. Warning(position,warning);
  1649. r := r .next;
  1650. END;
  1651. END;
  1652. FOR i := 0 TO registerUsageCount.count-1 DO
  1653. IF registerUsageCount.used[i].count < 0 THEN
  1654. warning := "register ";
  1655. Strings.AppendInt(warning, i);
  1656. Strings.Append(warning, " unused too often.");
  1657. Warning(position,warning);
  1658. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1659. warning := "register ";
  1660. Strings.AppendInt(warning, i);
  1661. Strings.Append(warning, " not unused often enough.");
  1662. Warning(position,warning);
  1663. END;
  1664. END;
  1665. END CheckRegistersFree;
  1666. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1667. Otherwise allocate a new register.
  1668. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1669. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1670. BEGIN
  1671. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1672. UseIntermediateOperand(result);
  1673. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1674. UseIntermediateOperand(result);
  1675. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1676. END;
  1677. END Reuse2;
  1678. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1679. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1680. If not then allocate a new register.
  1681. Does NOT necessarily keep the content of src1 or src2 in result!
  1682. *)
  1683. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1684. BEGIN
  1685. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1686. UseIntermediateOperand(result);
  1687. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1688. UseIntermediateOperand(result);
  1689. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1690. result := alternative; alternative := emptyOperand;
  1691. UseIntermediateOperand(result);
  1692. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1693. END;
  1694. END Reuse2a;
  1695. (* like reuse2 but only one source *)
  1696. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1697. BEGIN
  1698. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1699. UseIntermediateOperand(result);
  1700. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1701. END;
  1702. END Reuse1;
  1703. (* like reuse2a but only one source *)
  1704. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1705. BEGIN
  1706. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1707. UseIntermediateOperand(result);
  1708. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1709. UseIntermediateOperand(result);
  1710. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1711. END;
  1712. END Reuse1a;
  1713. (* like reuse1 but guarantees that content of src1 is in result *)
  1714. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1715. BEGIN
  1716. IF ReusableRegister(src1) THEN
  1717. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1718. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1719. UseIntermediateOperand(result);
  1720. ELSE
  1721. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1722. Emit(Mov(position,result,src1));
  1723. END
  1724. END ReuseCopy;
  1725. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1726. BEGIN
  1727. IF ReusableRegister(src) THEN
  1728. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1729. ELSE
  1730. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1731. Emit(Mov(position,result,src));
  1732. ReleaseIntermediateOperand(src);
  1733. END
  1734. END TransferToRegister;
  1735. (** labels and branches **)
  1736. PROCEDURE NewLabel(): Label;
  1737. VAR label: Label;
  1738. BEGIN
  1739. NEW(label,section); RETURN label;
  1740. END NewLabel;
  1741. PROCEDURE SetLabel(label: Label);
  1742. BEGIN label.Resolve(section.pc);
  1743. END SetLabel;
  1744. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1745. BEGIN
  1746. ASSERT(label # NIL);
  1747. IF label.pc < 0 THEN (* label not yet set *)
  1748. label.AddFixup(section.pc);
  1749. END;
  1750. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1751. END LabelOperand;
  1752. PROCEDURE BrL(label: Label);
  1753. BEGIN
  1754. Emit(Br(position,LabelOperand(label)));
  1755. END BrL;
  1756. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1757. BEGIN
  1758. Emit(Brge(position,LabelOperand(label),left,right));
  1759. END BrgeL;
  1760. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1761. BEGIN
  1762. Emit(Brlt(position,LabelOperand(label),left,right));
  1763. END BrltL;
  1764. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1765. BEGIN
  1766. Emit(Breq(position,LabelOperand(label),left,right));
  1767. END BreqL;
  1768. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1769. BEGIN
  1770. Emit(Brne(position,LabelOperand(label),left,right));
  1771. END BrneL;
  1772. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1773. VAR new: IntermediateCode.Operand;
  1774. BEGIN
  1775. IF Trace THEN TraceEnter("Convert") END;
  1776. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1777. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1778. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1779. & (operand.offset = 0)
  1780. THEN
  1781. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1782. Emit(Conv(position,new,operand));
  1783. ELSE
  1784. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1785. Emit(Conv(position,new,operand));
  1786. ReleaseIntermediateOperand(operand);
  1787. END;
  1788. operand := new;
  1789. 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
  1790. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1791. ELSE
  1792. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1793. Emit(Conv(position,new,operand));
  1794. ReleaseIntermediateOperand(operand);
  1795. operand := new;
  1796. END;
  1797. IF Trace THEN TraceExit("Convert") END;
  1798. END Convert;
  1799. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1800. VAR exit: Label;
  1801. BEGIN
  1802. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1803. exit := NewLabel();
  1804. br(exit,left,right);
  1805. EmitTrap(position,trapNo);
  1806. SetLabel(exit);
  1807. END TrapC;
  1808. (** expressions *)
  1809. (** emit necessary runtime check for set elements **)
  1810. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1811. VAR max: IntermediateCode.Operand;
  1812. BEGIN
  1813. IF isUnchecked THEN RETURN END;
  1814. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1815. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1816. TrapC(BrgeL, max, o, SetElementTrap);
  1817. END;
  1818. END CheckSetElement;
  1819. (** the set that a range represents **)
  1820. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1821. VAR
  1822. operand: Operand;
  1823. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1824. BEGIN
  1825. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1826. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1827. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1828. one := IntermediateCode.Immediate(setType, 1);
  1829. Evaluate(x, operand);
  1830. Convert(operand.op, setType);
  1831. Convert(operand.tag, setType);
  1832. CheckSetElement(operand.op);
  1833. CheckSetElement(operand.tag);
  1834. (* create mask for lower bound
  1835. i.e. shift 11111111 to the left by the value of the lower bound
  1836. *)
  1837. Reuse1(temp, operand.op);
  1838. Emit(Shl(position,temp, allBits, operand.op));
  1839. ReleaseIntermediateOperand(operand.op);
  1840. operand.op := temp;
  1841. (* create mask for upper bound
  1842. i.e. shift 11111111 to the right by the difference between the
  1843. upper bound and the maximum number of set elements
  1844. *)
  1845. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1846. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1847. Reuse1(temp, operand.tag);
  1848. ELSE
  1849. Reuse1(temp, operand.tag);
  1850. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1851. Emit(Sub(position,temp, size, operand.tag));
  1852. END;
  1853. Emit(Shr(position,temp, allBits, operand.tag));
  1854. ReleaseIntermediateOperand(operand.tag);
  1855. operand.tag := temp;
  1856. Reuse2(resultingSet, operand.op, operand.tag);
  1857. (* intersect the two masks *)
  1858. Emit(And(position,resultingSet, operand.op, operand.tag));
  1859. ReleaseOperand(operand);
  1860. RETURN resultingSet
  1861. END SetFromRange;
  1862. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1863. VAR
  1864. res, operand: Operand;
  1865. temp, one, noBits, dest: IntermediateCode.Operand;
  1866. expression: SyntaxTree.Expression;
  1867. i: LONGINT;
  1868. BEGIN
  1869. IF Trace THEN TraceEnter("VisitSet") END;
  1870. dest := destination;
  1871. destination := emptyOperand;
  1872. noBits := IntermediateCode.Immediate(setType, 0);
  1873. one := IntermediateCode.Immediate(setType, 1);
  1874. (* start off with the empty set *)
  1875. InitOperand(res, ModeValue);
  1876. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1877. Emit(Mov(position,res.op, noBits));
  1878. FOR i := 0 TO x.elements.Length() - 1 DO
  1879. expression := x.elements.GetExpression(i);
  1880. IF expression IS SyntaxTree.RangeExpression THEN
  1881. (* range of set elements *)
  1882. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1883. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1884. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1885. ReleaseIntermediateOperand(temp)
  1886. ELSE
  1887. (* singelton element *)
  1888. Evaluate(expression, operand);
  1889. Convert(operand.op, setType);
  1890. CheckSetElement(operand.op);
  1891. (* create subset containing single element *)
  1892. Reuse1(temp, operand.op);
  1893. Emit(Shl(position,temp, one, operand.op));
  1894. ReleaseOperand(operand);
  1895. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1896. ReleaseIntermediateOperand(temp);
  1897. END
  1898. END;
  1899. result := res;
  1900. destination := dest;
  1901. IF Trace THEN TraceExit("VisitSet") END;
  1902. END VisitSet;
  1903. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1904. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1905. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1906. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1907. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1908. element: SyntaxTree.IntegerValue;
  1909. BEGIN
  1910. numberElements := x.elements.Length();
  1911. expression := index.parameters.GetExpression(dim);
  1912. element := expression(SyntaxTree.IntegerValue);
  1913. FOR i := 0 TO numberElements-1 DO
  1914. expression := x.elements.GetExpression(i);
  1915. element.SetValue(i);
  1916. IF expression IS SyntaxTree.MathArrayExpression THEN
  1917. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1918. ELSE
  1919. Assign(index,expression);
  1920. END;
  1921. END;
  1922. END RecursiveAssignment;
  1923. BEGIN
  1924. variable := GetTemporaryVariable(x.type, FALSE);
  1925. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1926. designator.SetType(variable.type);
  1927. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1928. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1929. FOR i := 0 TO dim-1 DO
  1930. element := SyntaxTree.NewIntegerValue(x.position,0);
  1931. element.SetType(system.longintType);
  1932. index.parameters.AddExpression(element);
  1933. END;
  1934. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1935. RecursiveAssignment(x,0);
  1936. Expression(designator);
  1937. END VisitMathArrayExpression;
  1938. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1939. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1940. BEGIN
  1941. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1942. dest := destination; destination := emptyOperand;
  1943. IF x.operator = Scanner.Not THEN
  1944. IF conditional THEN
  1945. Condition(x.left,falseLabel,trueLabel)
  1946. ELSE
  1947. Evaluate(x.left,operand);
  1948. InitOperand(result,ModeValue);
  1949. Reuse1a(result.op,operand.op,dest);
  1950. Emit(Xor(position,result.op,operand.op,true));
  1951. ReleaseOperand(operand);
  1952. END;
  1953. ELSIF x.operator = Scanner.Minus THEN
  1954. Evaluate(x.left,operand);
  1955. InitOperand(result,ModeValue);
  1956. Reuse1a(result.op,operand.op,dest);
  1957. type := x.left.type.resolved;
  1958. IF type IS SyntaxTree.SetType THEN
  1959. Emit(Not(position,result.op,operand.op));
  1960. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1961. Reuse1(result.tag,operand.tag);
  1962. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1963. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1964. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  1965. Emit(Neg(position,result.op,operand.op));
  1966. ELSE HALT(200)
  1967. END;
  1968. ReleaseOperand(operand);
  1969. ELSIF x.operator = Scanner.Address THEN
  1970. Designate(x.left,operand);
  1971. operand.mode := ModeValue;
  1972. t0 := x.left.type.resolved;
  1973. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  1974. ReleaseIntermediateOperand(operand.op);
  1975. operand.op := operand.tag;
  1976. IntermediateCode.InitOperand(operand.tag);
  1977. END;
  1978. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  1979. result := operand;
  1980. ELSE HALT(100)
  1981. END;
  1982. destination := dest;
  1983. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  1984. END VisitUnaryExpression;
  1985. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  1986. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  1987. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  1988. BEGIN
  1989. type := type.resolved;
  1990. originalType := type;
  1991. IF type IS SyntaxTree.PointerType THEN
  1992. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  1993. END;
  1994. IF type IS SyntaxTree.ObjectType THEN
  1995. BrL(trueL);
  1996. ELSE
  1997. ASSERT(type IS SyntaxTree.RecordType);
  1998. (*
  1999. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2000. *)
  2001. ReuseCopy(left,tag);
  2002. right := TypeDescriptorAdr(type);
  2003. IF ~newObjectFile THEN
  2004. IntermediateCode.MakeMemory(right,addressType);
  2005. END;
  2006. IF backend.cooperative THEN
  2007. repeatL := NewLabel();
  2008. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2009. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2010. END;
  2011. SetLabel(repeatL);
  2012. BreqL(trueL,left,right);
  2013. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2014. BrneL(repeatL,left,nil);
  2015. ELSIF meta.simple THEN
  2016. level := type(SyntaxTree.RecordType).Level();
  2017. (* get type desc tag of level relative to base tag *)
  2018. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2019. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2020. IntermediateCode.MakeMemory(left,addressType);
  2021. BreqL(trueL,left,right);
  2022. ELSE
  2023. level := type(SyntaxTree.RecordType).Level();
  2024. (* get type desc tag of level relative to base tag *)
  2025. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2026. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2027. IntermediateCode.MakeMemory(left,addressType);
  2028. BreqL(trueL,left,right);
  2029. END;
  2030. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2031. BrL(falseL);
  2032. END;
  2033. END TypeTest;
  2034. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  2035. BEGIN
  2036. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2037. IF dump # NIL THEN
  2038. dump.String(s); dump.Ln;
  2039. END;
  2040. END Error;
  2041. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  2042. BEGIN
  2043. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  2044. IF dump # NIL THEN
  2045. dump.String(s); dump.Ln; dump.Update;
  2046. END;
  2047. END Warning;
  2048. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2049. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2050. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2051. operand:Operand;
  2052. BEGIN
  2053. previousSection := section;
  2054. Global.GetModuleName(mod,name);
  2055. Strings.Append(name,".@Trace");
  2056. Basic.ToSegmentedName(name, pooledName);
  2057. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2058. IF dump # NIL THEN dump := section.comments END;
  2059. IF backend.hasLinkRegister THEN
  2060. Emit(Push(-1, lr));
  2061. END;
  2062. variable := mod.moduleScope.firstVariable;
  2063. WHILE variable # NIL DO
  2064. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2065. Symbol(variable, operand);
  2066. register := operand.op;
  2067. CallTraceMethod(register, variable.type);
  2068. ReleaseIntermediateOperand(register);
  2069. END;
  2070. variable := variable.nextVariable;
  2071. END;
  2072. IF backend.hasLinkRegister THEN
  2073. Emit(Pop(-1, lr));
  2074. END;
  2075. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2076. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2077. Emit(Br(position,op));
  2078. INC(statCoopTraceModule, section.pc);
  2079. section := previousSection;
  2080. IF dump # NIL THEN dump := section.comments END;
  2081. END CreateTraceModuleMethod;
  2082. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2083. BEGIN
  2084. Emit (Push(position, dst));
  2085. Emit (Push(position, src));
  2086. CallThis(position,"GarbageCollector","Assign", 2);
  2087. END CallAssignPointer;
  2088. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2089. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2090. BEGIN
  2091. IF SemanticChecker.IsPointerType (type) THEN
  2092. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2093. ELSIF type.IsRecordType() THEN
  2094. Emit (Push(position,dst));
  2095. Emit (Push(position,src));
  2096. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2097. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2098. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2099. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2100. ELSIF IsStaticArray(type) THEN
  2101. size := StaticArrayNumElements(type);
  2102. base := StaticArrayBaseType(type);
  2103. IF base.IsRecordType() THEN
  2104. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2105. Emit (Push(position, dst));
  2106. Emit (Push(position, src));
  2107. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2108. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2109. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2110. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2111. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2112. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2113. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2114. Emit (Push(position, dst));
  2115. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2116. Emit (Push(position, src));
  2117. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2118. ELSE
  2119. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2120. Emit (Push(position, dst));
  2121. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2122. Emit (Push(position, src));
  2123. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2124. ASSERT(StaticArrayBaseType(type).IsPointer());
  2125. END;
  2126. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2127. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2128. Emit (Push(position, dst));
  2129. Emit (Push(position, src));
  2130. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2131. ELSE HALT(100); (* missing ? *)
  2132. END;
  2133. END CallAssignMethod;
  2134. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2135. VAR name: Basic.SegmentedName;
  2136. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2137. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2138. context: Context;
  2139. BEGIN
  2140. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2141. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2142. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2143. GetRecordTypeName (recordType,name);
  2144. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2145. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2146. IF dump # NIL THEN dump := section.comments END;
  2147. IF backend.hasLinkRegister THEN
  2148. Emit(Push(-1, lr));
  2149. END;
  2150. variable := recordType.recordScope.firstVariable;
  2151. WHILE variable # NIL DO
  2152. IF variable.NeedsTrace() THEN
  2153. dst := NewRegisterOperand (addressType);
  2154. src := NewRegisterOperand (addressType);
  2155. Emit (Mov(position, dst, parameter1));
  2156. Emit (Mov(position, src, parameter2));
  2157. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2158. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2159. CallAssignMethod(dst, src, variable.type);
  2160. ReleaseIntermediateOperand(src);
  2161. ReleaseIntermediateOperand(dst);
  2162. END;
  2163. variable := variable.nextVariable;
  2164. END;
  2165. recordBase := recordType.GetBaseRecord();
  2166. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2167. IF backend.hasLinkRegister THEN
  2168. Emit(Pop(-1, lr));
  2169. END;
  2170. GetRecordTypeName (recordBase,name);
  2171. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2172. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2173. Emit(Br(position,op));
  2174. ELSE
  2175. Emit(Exit(position,0,0));
  2176. END;
  2177. IF ~recordType.isObject THEN
  2178. GetRecordTypeName (recordType,name);
  2179. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2180. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2181. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2182. NEW(registerUsageCount);
  2183. usedRegisters := NIL;
  2184. dst := NewRegisterOperand (addressType);
  2185. src := NewRegisterOperand (addressType);
  2186. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2187. Emit(Mov(position, dst, parameter1));
  2188. Emit(Mov(position, src, parameter2));
  2189. label := NewLabel();
  2190. SetLabel(label);
  2191. Emit(Push(position, dst));
  2192. Emit(Push(position, src));
  2193. GetRecordTypeName (recordType,name);
  2194. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2195. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2196. Emit(Call(position, op, 0));
  2197. Emit(Pop(position, src));
  2198. Emit(Pop(position, dst));
  2199. Emit(Add(position, dst, dst, ofs));
  2200. Emit(Add(position, src, src, ofs));
  2201. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2202. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2203. Emit(Exit(position,0,0));
  2204. END;
  2205. INC(statCoopAssignProcedure, section.pc);
  2206. ReturnToContext(context);
  2207. IF dump # NIL THEN dump := section.comments END;
  2208. END CreateAssignProcedure;
  2209. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2210. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2211. BEGIN
  2212. IF IsUnsafePointer (type) THEN
  2213. skip := NewLabel();
  2214. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2215. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2216. BreqL (skip, op, nil);
  2217. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2218. SetLabel (skip);
  2219. ELSIF SemanticChecker.IsPointerType (type) THEN
  2220. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2221. CallThis(position,"GarbageCollector","Mark", 1);
  2222. ELSIF type.IsRecordType() THEN
  2223. Emit (Push(position,register));
  2224. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2225. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2226. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2227. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2228. ELSIF IsStaticArray(type) THEN
  2229. size := StaticArrayNumElements(type);
  2230. base := StaticArrayBaseType(type);
  2231. IF base.IsRecordType() THEN
  2232. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2233. Emit (Push(position, register));
  2234. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2235. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2236. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2237. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2238. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2239. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2240. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2241. Emit (Push(position, register));
  2242. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2243. ELSE
  2244. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2245. Emit (Push(position, register));
  2246. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2247. ASSERT(base.IsPointer());
  2248. END;
  2249. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2250. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2251. CallThis(position,"GarbageCollector","Mark", 1);
  2252. ELSE HALT(100); (* missing ? *)
  2253. END;
  2254. END CallTraceMethod;
  2255. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2256. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2257. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2258. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2259. BEGIN
  2260. previousSection := section;
  2261. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2262. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2263. GetRecordTypeName (recordType,name);
  2264. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2265. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2266. IF dump # NIL THEN dump := section.comments END;
  2267. IF backend.hasLinkRegister THEN
  2268. Emit(Push(-1, lr));
  2269. END;
  2270. variable := recordType.recordScope.firstVariable;
  2271. WHILE variable # NIL DO
  2272. IF variable.NeedsTrace() THEN
  2273. register := NewRegisterOperand (addressType);
  2274. Emit (Mov(position,register,parameter1));
  2275. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2276. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2277. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2278. END;
  2279. CallTraceMethod(register, variable.type);
  2280. ReleaseIntermediateOperand(register);
  2281. END;
  2282. variable := variable.nextVariable;
  2283. END;
  2284. recordBase := recordType.GetBaseRecord();
  2285. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2286. recordBase := recordBase.GetBaseRecord();
  2287. END;
  2288. IF recordBase # NIL THEN
  2289. IF backend.hasLinkRegister THEN
  2290. Emit(Pop(-1, lr));
  2291. END;
  2292. GetRecordTypeName (recordBase,name);
  2293. IF HasExplicitTraceMethod (recordBase) THEN
  2294. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2295. ELSE
  2296. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2297. END;
  2298. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2299. Emit(Br(position,op));
  2300. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2301. Emit(Exit(position,0,0));
  2302. ELSE
  2303. IF backend.hasLinkRegister THEN
  2304. Emit(Pop(-1, lr));
  2305. END;
  2306. IF recordType.isObject THEN
  2307. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2308. ELSE
  2309. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2310. END;
  2311. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2312. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2313. Emit(Br(position,op));
  2314. END;
  2315. IF ~recordType.isObject THEN
  2316. GetRecordTypeName (recordType,name);
  2317. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2318. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2319. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2320. NEW(registerUsageCount);
  2321. usedRegisters := NIL;
  2322. IF dump # NIL THEN dump := section.comments END;
  2323. register := NewRegisterOperand (addressType);
  2324. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2325. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2326. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2327. END;
  2328. Emit (Push(position,register));
  2329. GetRecordTypeName (recordType,name);
  2330. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2331. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2332. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2333. ReleaseIntermediateOperand(register);
  2334. Emit(Exit(position,0,0));
  2335. GetRecordTypeName (recordType,name);
  2336. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2337. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2338. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2339. NEW(registerUsageCount);
  2340. usedRegisters := NIL;
  2341. register := NewRegisterOperand (addressType);
  2342. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2343. Emit(Mov(position, register, parameter1));
  2344. label := NewLabel();
  2345. SetLabel(label);
  2346. Emit(Push(position, register));
  2347. GetRecordTypeName (recordType,name);
  2348. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2349. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2350. Emit(Call(position, op, 0));
  2351. Emit(Pop(position, register));
  2352. Emit(Add(position, register, register, ofs));
  2353. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2354. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2355. Emit(Exit(position,0,0));
  2356. END;
  2357. INC(statCoopTraceMethod, section.pc);
  2358. ReturnToContext(context);
  2359. IF dump # NIL THEN dump := section.comments END;
  2360. END CreateTraceMethod;
  2361. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2362. VAR name: Basic.SegmentedName;
  2363. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2364. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2365. context: Context;
  2366. BEGIN
  2367. IF recordType.isObject THEN RETURN END;
  2368. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2369. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2370. GetRecordTypeName (recordType,name);
  2371. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2372. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2373. IF dump # NIL THEN dump := section.comments END;
  2374. IF backend.hasLinkRegister THEN
  2375. Emit(Push(-1, lr));
  2376. END;
  2377. variable := recordType.recordScope.firstVariable;
  2378. WHILE variable # NIL DO
  2379. IF variable.NeedsTrace() THEN
  2380. dst := NewRegisterOperand (addressType);
  2381. Emit (Mov(position, dst, parameter1));
  2382. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2383. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2384. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2385. END;
  2386. CallResetProcedure(dst, nil, variable.type);
  2387. ReleaseIntermediateOperand(dst);
  2388. END;
  2389. variable := variable.nextVariable;
  2390. END;
  2391. recordBase := recordType.GetBaseRecord();
  2392. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2393. IF backend.hasLinkRegister THEN
  2394. Emit(Pop(-1, lr));
  2395. END;
  2396. GetRecordTypeName (recordBase,name);
  2397. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2398. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2399. Emit(Br(position,op));
  2400. ELSE
  2401. Emit(Exit(position,0,0));
  2402. END;
  2403. GetRecordTypeName (recordType,name);
  2404. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2405. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2406. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2407. NEW(registerUsageCount);
  2408. usedRegisters := NIL;
  2409. dst := NewRegisterOperand (addressType);
  2410. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2411. Emit(Mov(position, dst, parameter1));
  2412. label := NewLabel();
  2413. SetLabel(label);
  2414. Emit(Push(position, dst));
  2415. GetRecordTypeName (recordType,name);
  2416. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2417. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2418. Emit(Call(position, op, 0));
  2419. Emit(Pop(position, dst));
  2420. Emit(Add(position, dst, dst, ofs));
  2421. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2422. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2423. Emit(Exit(position,0,0));
  2424. INC(statCoopResetProcedure, section.pc);
  2425. ReturnToContext(context);
  2426. IF dump # NIL THEN dump := section.comments END;
  2427. END CreateResetProcedure;
  2428. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2429. VAR name: Basic.SegmentedName; context: Context;
  2430. BEGIN
  2431. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2432. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2433. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2434. IF dump # NIL THEN dump := section.comments END;
  2435. IF backend.hasLinkRegister THEN
  2436. Emit(Push(-1, lr));
  2437. END;
  2438. Emit(Push(position,fp));
  2439. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2440. ResetVariables(scope);
  2441. Emit(Pop(position,fp));
  2442. Emit(Exit(position,0,0));
  2443. ReturnToContext(context);
  2444. IF dump # NIL THEN dump := section.comments END;
  2445. END CreateResetMethod;
  2446. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2447. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2448. BEGIN
  2449. IF SemanticChecker.IsPointerType (type) THEN
  2450. Emit (Push(position, dest));
  2451. CallThis(position,"GarbageCollector","Reset", 1);
  2452. ELSIF type.IsRecordType() THEN
  2453. Emit (Push(position, dest));
  2454. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2455. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2456. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2457. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2458. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2459. size := GetArrayLength(type, tag);
  2460. base := ArrayBaseType(type);
  2461. IF base.IsRecordType() THEN
  2462. Emit (Push(position, size));
  2463. Emit (Push(position, dest));
  2464. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2465. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2466. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2467. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2468. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2469. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2470. Emit (Push(position, size));
  2471. Emit (Push(position, dest));
  2472. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2473. ELSE
  2474. Emit (Push(position, size));
  2475. Emit (Push(position, dest));
  2476. CallThis(position,"GarbageCollector","ResetArray", 2);
  2477. ASSERT(ArrayBaseType(type).IsPointer());
  2478. END;
  2479. ReleaseIntermediateOperand(size);
  2480. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2481. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2482. Emit (Push(position, dest));
  2483. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2484. ELSE HALT(100); (* missing ? *)
  2485. END;
  2486. END CallResetProcedure;
  2487. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2488. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2489. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2490. VAR operand: Operand;
  2491. BEGIN
  2492. Symbol (symbol, operand);
  2493. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2494. ReleaseOperand(operand);
  2495. END Reset;
  2496. BEGIN
  2497. previousScope := currentScope;
  2498. currentScope := scope;
  2499. pc := section.pc;
  2500. variable := scope.firstVariable;
  2501. WHILE variable # NIL DO
  2502. IF variable.NeedsTrace() THEN
  2503. Reset (variable);
  2504. END;
  2505. variable := variable.nextVariable;
  2506. END;
  2507. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2508. WHILE parameter # NIL DO
  2509. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2510. Reset (parameter);
  2511. END;
  2512. parameter := parameter.nextParameter;
  2513. END;
  2514. INC(statCoopResetVariables, section.pc - pc);
  2515. currentScope := previousScope;
  2516. END ResetVariables;
  2517. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2518. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2519. VAR op: IntermediateCode.Operand; context: Context;
  2520. BEGIN
  2521. previousSection := section;
  2522. GetCodeSectionNameForSymbol(procedure, name);
  2523. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2524. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2525. IF dump # NIL THEN dump := section.comments END;
  2526. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2527. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2528. Emit(Data(position,op));
  2529. Emit(Data(position,nil));
  2530. IF HasPointers (procedure.procedureScope) THEN
  2531. GetCodeSectionNameForSymbol(procedure, name);
  2532. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2533. ELSE
  2534. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2535. END;
  2536. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2537. Emit(Data(position,op));
  2538. ReturnToContext(context);
  2539. IF dump # NIL THEN dump := section.comments END;
  2540. END CreateProcedureDescriptor;
  2541. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2542. VAR import: SyntaxTree.Import;
  2543. s: Basic.MessageString;
  2544. selfName: SyntaxTree.IdentifierString;
  2545. BEGIN
  2546. moduleScope.ownerModule.GetName(selfName);
  2547. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2548. module := moduleScope.ownerModule
  2549. ELSE
  2550. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2551. IF import = NIL THEN
  2552. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2553. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2554. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2555. s := "Module ";
  2556. Strings.Append(s,moduleName);
  2557. Strings.Append(s," cannot be imported.");
  2558. IF force THEN
  2559. Error(position,s);
  2560. ELSIF canBeLoaded THEN
  2561. Strings.Append(s, "=> no dynamic linking.");
  2562. Warning(position, s);
  2563. canBeLoaded := FALSE;
  2564. END;
  2565. RETURN FALSE
  2566. ELSE
  2567. SELF.module.imports.AddName(moduleName)
  2568. END;
  2569. ELSIF import.module = NIL THEN (* already tried *)
  2570. RETURN FALSE
  2571. END;
  2572. module := import.module;
  2573. END;
  2574. RETURN TRUE
  2575. END AddImport;
  2576. (* needed for old binary object file format*)
  2577. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2578. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2579. BEGIN
  2580. IF AddImport(moduleName,module,TRUE) THEN
  2581. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2582. IF procedure = NIL THEN
  2583. s := "Instruction not supported on target, emulation procedure ";
  2584. Strings.Append(s,moduleName);
  2585. Strings.Append(s,".");
  2586. Strings.Append(s,procedureName);
  2587. Strings.Append(s," not present");
  2588. Error(position,s);
  2589. ELSE
  2590. StaticCallOperand(r,procedure);
  2591. ReleaseOperand(r);
  2592. fp := GetFingerprint(procedure);
  2593. END;
  2594. END;
  2595. END EnsureSymbol;
  2596. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2597. VAR exit: Label; trueL,falseL: Label;
  2598. BEGIN
  2599. trueL := NewLabel();
  2600. falseL := NewLabel();
  2601. exit := NewLabel();
  2602. Condition(x,trueL,falseL);
  2603. InitOperand(result,ModeValue);
  2604. SetLabel(trueL);
  2605. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2606. Emit(Mov(position,result.op,true));
  2607. BrL(exit);
  2608. SetLabel(falseL);
  2609. Emit(MovReplace(position,result.op,false));
  2610. SetLabel(exit);
  2611. END ConditionToValue;
  2612. PROCEDURE ValueToCondition(VAR op: Operand);
  2613. BEGIN
  2614. LoadValue(op,system.booleanType);
  2615. BrneL(trueLabel,op.op, false);
  2616. ReleaseOperand(op);
  2617. BrL(falseLabel);
  2618. END ValueToCondition;
  2619. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2620. VAR size: LONGINT;
  2621. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2622. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2623. BEGIN
  2624. ASSERT(type.form = SyntaxTree.Open);
  2625. baseType := type.arrayBase.resolved;
  2626. IF IsOpenArray(baseType) THEN
  2627. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2628. ELSE
  2629. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2630. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2631. END;
  2632. len := tag;
  2633. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2634. IntermediateCode.MakeMemory(len,addressType);
  2635. UseIntermediateOperand(len);
  2636. Reuse2(res,sizeOperand,len);
  2637. Emit(Mul(position,res,sizeOperand,len));
  2638. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2639. RETURN res
  2640. END GetArraySize;
  2641. BEGIN
  2642. type := type.resolved;
  2643. IF IsOpenArray(type) THEN
  2644. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2645. RETURN tag
  2646. ELSE
  2647. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2648. END;
  2649. ELSE
  2650. size := ToMemoryUnits(system,system.SizeOf(type));
  2651. RETURN IntermediateCode.Immediate(addressType,size)
  2652. END;
  2653. END GetDynamicSize;
  2654. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2655. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2656. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2657. BEGIN
  2658. ASSERT(type.form = SyntaxTree.Open);
  2659. baseType := type.arrayBase.resolved;
  2660. IF IsOpenArray(baseType) THEN
  2661. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2662. ELSE
  2663. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2664. END;
  2665. len := tag;
  2666. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2667. IntermediateCode.MakeMemory(len,addressType);
  2668. UseIntermediateOperand(len);
  2669. Reuse2(res,sizeOperand,len);
  2670. Emit(Mul(position,res,sizeOperand,len));
  2671. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2672. RETURN res
  2673. END GetLength;
  2674. BEGIN
  2675. type := type.resolved;
  2676. IF IsOpenArray(type) THEN
  2677. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2678. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2679. ELSE
  2680. RETURN IntermediateCode.Immediate(addressType,1)
  2681. END;
  2682. END GetArrayLength;
  2683. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2684. VAR result: IntermediateCode.Operand;
  2685. BEGIN
  2686. IF backend.cooperative THEN
  2687. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2688. ELSE
  2689. MakeMemory(result, tag, addressType, 0);
  2690. END;
  2691. RETURN result
  2692. END GetSizeFromTag;
  2693. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2694. VAR parameter: SyntaxTree.Parameter;
  2695. BEGIN
  2696. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2697. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2698. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2699. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2700. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2701. END;
  2702. RETURN GetDynamicSize(e.type, tag);
  2703. END GetArrayOfBytesSize;
  2704. (*
  2705. to find imported symbol. not needed ?
  2706. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2707. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2708. BEGIN
  2709. IF AddImport(moduleName,importedModule,FALSE) THEN
  2710. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2711. RETURN symbol
  2712. ELSE
  2713. RETURN NIL
  2714. END
  2715. END SymbolByName;
  2716. *)
  2717. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2718. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2719. BEGIN
  2720. IF AddImport(moduleName,runtimeModule,force) THEN
  2721. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2722. IF procedure = NIL THEN
  2723. s := "Procedure ";
  2724. Strings.Append(s,moduleName);
  2725. Strings.Append(s,".");
  2726. Strings.Append(s,procedureName);
  2727. Strings.Append(s," not present");
  2728. Error(position,s);
  2729. RETURN FALSE
  2730. ELSE
  2731. RETURN TRUE
  2732. END;
  2733. ELSE RETURN FALSE
  2734. END;
  2735. END GetRuntimeProcedure;
  2736. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2737. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2738. s: Basic.MessageString;
  2739. BEGIN
  2740. Basic.InitSegmentedName(name);
  2741. name[0] := Basic.MakeString(moduleName);
  2742. name[1] := Basic.MakeString(typeName);
  2743. name[2] := -1;
  2744. IF AddImport(moduleName,importedModule, FALSE) THEN
  2745. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2746. IF symbol = NIL THEN
  2747. s := "type ";
  2748. Strings.Append(s,moduleName);
  2749. Strings.Append(s,".");
  2750. Strings.Append(s,typeName);
  2751. Strings.Append(s," not present");
  2752. Error(position,s);
  2753. END;
  2754. ELSE symbol := NIL;
  2755. END;
  2756. IF importedModule = moduleScope.ownerModule THEN
  2757. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2758. ELSE
  2759. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2760. END;
  2761. RETURN symbol
  2762. END GetTypeDescriptor;
  2763. (* 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. *)
  2764. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2765. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2766. pooledName: Basic.SegmentedName; size: LONGINT;
  2767. BEGIN
  2768. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2769. StaticCallOperand(result,procedure);
  2770. IF numberParameters < 0 THEN
  2771. size := ProcedureParametersSize(system,procedure);
  2772. ELSE
  2773. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2774. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2775. Error(position,"runtime call parameter count mismatch");
  2776. END;
  2777. END;
  2778. Emit(Call(position, result.op, size));
  2779. ReleaseOperand(result);
  2780. ELSE (* only static linking possible *)
  2781. ASSERT(numberParameters >= 0);
  2782. Basic.InitSegmentedName(pooledName);
  2783. pooledName[0] := Basic.MakeString(moduleName);
  2784. pooledName[1] := Basic.MakeString(procedureName);
  2785. pooledName[2] := -1;
  2786. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2787. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2788. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2789. END;
  2790. END CallThisChecked;
  2791. (* 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. *)
  2792. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2793. BEGIN
  2794. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2795. END CallThis;
  2796. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2797. VAR
  2798. left,right: Operand;
  2799. leftSize, rightSize: IntermediateCode.Operand;
  2800. saved: RegisterEntry;
  2801. reg: IntermediateCode.Operand;
  2802. procedureName: SyntaxTree.IdentifierString;
  2803. BEGIN
  2804. procedureName := "CompareString";
  2805. SaveRegisters();ReleaseUsedRegisters(saved);
  2806. Designate(leftExpression,left);
  2807. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2808. Emit(Push(position,leftSize));
  2809. ReleaseIntermediateOperand(leftSize);
  2810. Emit(Push(position,left.op));
  2811. ReleaseOperand(left);
  2812. Designate(rightExpression,right);
  2813. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2814. Emit(Push(position,rightSize));
  2815. ReleaseIntermediateOperand(rightSize);
  2816. Emit(Push(position,right.op));
  2817. ReleaseOperand(right);
  2818. IF backend.cooperative THEN
  2819. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2820. ELSE
  2821. CallThis(position,runtimeModuleName,procedureName, 4);
  2822. END;
  2823. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2824. Emit(Result(position,reg));
  2825. (*
  2826. AcquireThisRegister(int8,IntermediateCode.Result);
  2827. *)
  2828. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2829. (*
  2830. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2831. *)
  2832. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2833. ReleaseIntermediateOperand(reg);
  2834. BrL(falseLabel);
  2835. END CompareString;
  2836. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2837. VAR
  2838. left,right: Operand;
  2839. leftSize, rightSize: IntermediateCode.Operand;
  2840. saved: RegisterEntry;
  2841. procedureName: SyntaxTree.IdentifierString;
  2842. BEGIN
  2843. procedureName := "CopyString";
  2844. SaveRegisters();ReleaseUsedRegisters(saved);
  2845. Designate(leftExpression,left);
  2846. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2847. Emit(Push(position,leftSize));
  2848. ReleaseIntermediateOperand(leftSize);
  2849. Emit(Push(position,left.op));
  2850. ReleaseOperand(left);
  2851. Designate(rightExpression,right);
  2852. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2853. Emit(Push(position,rightSize));
  2854. ReleaseIntermediateOperand(rightSize);
  2855. Emit(Push(position,right.op));
  2856. ReleaseOperand(right);
  2857. IF backend.cooperative THEN
  2858. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2859. ELSE
  2860. CallThis(position,runtimeModuleName,procedureName,4);
  2861. END;
  2862. RestoreRegisters(saved);
  2863. END CopyString;
  2864. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2865. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2866. leftType,rightType: SyntaxTree.Type;
  2867. leftExpression,rightExpression : SyntaxTree.Expression;
  2868. componentType: IntermediateCode.Type;
  2869. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2870. size: LONGINT;
  2871. BEGIN
  2872. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2873. dest := destination; destination := emptyOperand;
  2874. leftType := x.left.type.resolved;
  2875. rightType := x.right.type.resolved;
  2876. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2877. CASE x.operator OF
  2878. Scanner.Or:
  2879. (* shortcut evaluation of left OR right *)
  2880. IF ~conditional THEN ConditionToValue(x);
  2881. ELSE
  2882. next := NewLabel();
  2883. Condition(x.left,trueLabel,next);
  2884. SetLabel(next);
  2885. Condition(x.right,trueLabel,falseLabel);
  2886. END;
  2887. |Scanner.And:
  2888. (* shortcut evaluation of left & right *)
  2889. IF ~conditional THEN ConditionToValue(x);
  2890. ELSE
  2891. next := NewLabel();
  2892. Condition(x.left,next,falseLabel);
  2893. SetLabel(next);
  2894. Condition(x.right,trueLabel,falseLabel);
  2895. END;
  2896. |Scanner.Is:
  2897. IF ~conditional THEN ConditionToValue(x);
  2898. ELSE
  2899. (* get type desc tag *)
  2900. IF IsPointerToRecord(leftType,recordType) THEN
  2901. Evaluate(x.left,left);
  2902. Dereference(left,recordType,IsUnsafePointer(leftType))
  2903. ELSE
  2904. Designate(x.left,left);
  2905. END;
  2906. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2907. ReleaseOperand(left);
  2908. END;
  2909. |Scanner.Plus:
  2910. Evaluate(x.left,left);
  2911. Evaluate(x.right,right);
  2912. IF leftType IS SyntaxTree.SetType THEN
  2913. InitOperand(result,ModeValue);
  2914. Reuse2a(result.op,left.op,right.op,dest);
  2915. Emit(Or(position,result.op,left.op,right.op));
  2916. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2917. InitOperand(result,ModeValue);
  2918. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2919. Reuse2(result.tag,left.tag,right.tag);
  2920. Emit(Add(position,result.op,left.op,right.op));
  2921. Emit(Add(position,result.tag,left.tag,right.tag))
  2922. ELSE
  2923. InitOperand(result,ModeValue);
  2924. Reuse2a(result.op,left.op,right.op,dest);
  2925. Emit(Add(position,result.op,left.op,right.op));
  2926. END;
  2927. ReleaseOperand(left); ReleaseOperand(right);
  2928. |Scanner.Minus:
  2929. Evaluate(x.left,left);
  2930. Evaluate(x.right,right);
  2931. IF leftType IS SyntaxTree.SetType THEN
  2932. InitOperand(result,ModeValue);
  2933. Reuse1(result.op,right.op);
  2934. Emit(Not(position,result.op,right.op));
  2935. ReleaseOperand(right);
  2936. Emit(And(position,result.op,result.op,left.op));
  2937. ReleaseOperand(left);
  2938. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2939. InitOperand(result,ModeValue);
  2940. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2941. Reuse2(result.tag,left.tag,right.tag);
  2942. Emit(Sub(position,result.op,left.op,right.op));
  2943. Emit(Sub(position,result.tag,left.tag,right.tag));
  2944. ReleaseOperand(left); ReleaseOperand(right)
  2945. ELSE
  2946. InitOperand(result,ModeValue);
  2947. Reuse2a(result.op,left.op,right.op,dest);
  2948. Emit(Sub(position,result.op,left.op,right.op));
  2949. ReleaseOperand(left); ReleaseOperand(right);
  2950. END;
  2951. |Scanner.Times:
  2952. Evaluate(x.left,left);
  2953. Evaluate(x.right,right);
  2954. IF leftType IS SyntaxTree.SetType THEN
  2955. InitOperand(result,ModeValue);
  2956. Reuse2a(result.op,left.op,right.op,dest);
  2957. Emit(And(position,result.op,left.op,right.op));
  2958. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2959. InitOperand(result,ModeValue);
  2960. Reuse1a(result.op,left.op,dest);
  2961. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2962. Emit(Shl(position,result.op,left.op,right.op));
  2963. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2964. InitOperand(result, ModeValue);
  2965. componentType := left.op.type;
  2966. (* TODO: review this *)
  2967. (*
  2968. result.op = left.op * right.op - left.tag * right.tag
  2969. result.tag = left.tag * right.op + left.op * right.tag
  2970. *)
  2971. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2972. Emit(Mul(position,result.op, left.op, right.op));
  2973. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2974. Emit(Mul(position,tempReg, left.tag, right.tag));
  2975. Emit(Sub(position,result.op, result.op, tempReg));
  2976. Reuse2(result.tag, left.tag, right.op);
  2977. Emit(Mul(position,result.tag, left.tag, right.op));
  2978. Emit(Mul(position,tempReg, left.op, right.tag));
  2979. Emit(Add(position,result.tag, result.tag, tempReg));
  2980. ReleaseIntermediateOperand(tempReg)
  2981. ELSE
  2982. InitOperand(result,ModeValue);
  2983. Reuse2a(result.op,left.op,right.op,dest);
  2984. Emit(Mul(position,result.op,left.op,right.op));
  2985. END;
  2986. ReleaseOperand(left); ReleaseOperand(right);
  2987. |Scanner.Div:
  2988. Evaluate(x.left,left);
  2989. Evaluate(x.right,right);
  2990. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2991. InitOperand(result,ModeValue);
  2992. Reuse1a(result.op,left.op,dest);
  2993. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2994. Emit(Shr(position,result.op,left.op,right.op));
  2995. ELSE
  2996. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2997. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2998. IF ~isUnchecked THEN
  2999. exit := NewLabel();
  3000. BrltL(exit,zero,right.op);
  3001. EmitTrap(position,NegativeDivisorTrap);
  3002. SetLabel(exit);
  3003. END;
  3004. END;
  3005. InitOperand(result,ModeValue);
  3006. Reuse2a(result.op,left.op,right.op,dest);
  3007. Emit(Div(position,result.op,left.op,right.op));
  3008. END;
  3009. ReleaseOperand(left); ReleaseOperand(right);
  3010. |Scanner.Mod:
  3011. Evaluate(x.left,left);
  3012. Evaluate(x.right,right);
  3013. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3014. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  3015. InitOperand(result,ModeValue);
  3016. Reuse1a(result.op,left.op,dest);
  3017. Emit(And(position,result.op,left.op,right.op));
  3018. ELSE
  3019. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3020. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3021. IF ~isUnchecked THEN
  3022. exit := NewLabel();
  3023. BrltL(exit,zero,right.op);
  3024. EmitTrap(position,NegativeDivisorTrap);
  3025. SetLabel(exit);
  3026. END;
  3027. END;
  3028. InitOperand(result,ModeValue);
  3029. Reuse2a(result.op,left.op,right.op,dest);
  3030. Emit(Mod(position,result.op,left.op,right.op));
  3031. END;
  3032. ReleaseOperand(left); ReleaseOperand(right);
  3033. |Scanner.Slash:
  3034. Evaluate(x.left,left);
  3035. Evaluate(x.right,right);
  3036. IF leftType IS SyntaxTree.SetType THEN
  3037. InitOperand(result,ModeValue);
  3038. Reuse2a(result.op,left.op,right.op,dest);
  3039. Emit(Xor(position,result.op,left.op,right.op));
  3040. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3041. InitOperand(result,ModeValue);
  3042. componentType := left.op.type;
  3043. (* review this *)
  3044. (*
  3045. divisor = right.op * right.op + right.tag * right.tag
  3046. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3047. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3048. *)
  3049. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3050. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3051. Emit(Mul(position,tempReg, right.op, right.op));
  3052. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3053. Emit(Add(position,tempReg, tempReg, tempReg2));
  3054. result.op := tempReg2;
  3055. Emit(Mul(position,result.op, left.op, right.op));
  3056. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3057. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3058. Emit(Add(position,result.op, result.op, tempReg2));
  3059. Emit(Div(position,result.op, result.op, tempReg));
  3060. Reuse2(result.tag, left.tag, right.op);
  3061. Emit(Mul(position,result.tag, left.tag, right.op));
  3062. Emit(Mul(position,tempReg2, left.op, right.tag));
  3063. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3064. Emit(Div(position,result.tag, result.tag, tempReg));
  3065. ReleaseIntermediateOperand(tempReg);
  3066. ReleaseIntermediateOperand(tempReg2)
  3067. ELSE
  3068. InitOperand(result,ModeValue);
  3069. Reuse2a(result.op,left.op,right.op,dest);
  3070. Emit(Div(position,result.op,left.op,right.op));
  3071. END;
  3072. ReleaseOperand(left); ReleaseOperand(right);
  3073. |Scanner.Equal:
  3074. IF ~conditional THEN ConditionToValue(x);
  3075. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3076. CompareString(BreqL,x.left,x.right);
  3077. ELSE
  3078. Evaluate(x.left,left);
  3079. Evaluate(x.right,right);
  3080. IF leftType IS SyntaxTree.RangeType THEN
  3081. ASSERT(rightType IS SyntaxTree.RangeType);
  3082. BrneL(falseLabel, left.op, right.op); (* first *)
  3083. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3084. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3085. ReleaseOperand(left); ReleaseOperand(right);
  3086. BrL(trueLabel)
  3087. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3088. BrneL(falseLabel, left.op, right.op); (* first *)
  3089. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3090. ReleaseOperand(left); ReleaseOperand(right);
  3091. BrL(trueLabel)
  3092. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3093. (* TODO: review this *)
  3094. BrneL(falseLabel, left.op, right.op); (* real part *)
  3095. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3096. ReleaseOperand(left); ReleaseOperand(right);
  3097. BrL(trueLabel)
  3098. ELSE
  3099. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3100. ReleaseOperand(left); ReleaseOperand(right);
  3101. BrL(trueLabel);
  3102. END;
  3103. END;
  3104. |Scanner.LessEqual:
  3105. IF ~conditional THEN ConditionToValue(x);
  3106. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3107. CompareString(BrgeL,x.right,x.left);
  3108. ELSE
  3109. Evaluate(x.left,left);
  3110. Evaluate(x.right,right);
  3111. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3112. Reuse1(temp.op,right.op);
  3113. Emit(And(position,temp.op,left.op,right.op));
  3114. ReleaseOperand(right);
  3115. BreqL(trueLabel,temp.op,left.op);
  3116. BrL(falseLabel);
  3117. ReleaseOperand(temp);ReleaseOperand(left);
  3118. ELSE
  3119. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3120. ReleaseOperand(left); ReleaseOperand(right);
  3121. BrL(trueLabel);
  3122. END;
  3123. END;
  3124. |Scanner.Less:
  3125. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3126. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3127. leftExpression.SetType(system.booleanType);
  3128. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3129. rightExpression.SetType(system.booleanType);
  3130. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3131. leftExpression.SetType(system.booleanType);
  3132. Expression(leftExpression);
  3133. ELSIF ~conditional THEN ConditionToValue(x);
  3134. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3135. CompareString(BrltL,x.left,x.right);
  3136. ELSE
  3137. Evaluate(x.left,left);
  3138. Evaluate(x.right,right);
  3139. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3140. ReleaseOperand(left); ReleaseOperand(right);
  3141. BrL(trueLabel);
  3142. END;
  3143. |Scanner.Greater:
  3144. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3145. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3146. leftExpression.SetType(system.booleanType);
  3147. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3148. rightExpression.SetType(system.booleanType);
  3149. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3150. leftExpression.SetType(system.booleanType);
  3151. Expression(leftExpression);
  3152. ELSIF ~conditional THEN ConditionToValue(x);
  3153. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3154. CompareString(BrltL,x.right,x.left);
  3155. ELSE
  3156. Evaluate(x.left,left);
  3157. Evaluate(x.right,right);
  3158. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3159. ReleaseOperand(left); ReleaseOperand(right);
  3160. BrL(trueLabel);
  3161. END;
  3162. |Scanner.GreaterEqual:
  3163. IF ~conditional THEN ConditionToValue(x);
  3164. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3165. CompareString(BrgeL,x.left,x.right);
  3166. ELSE
  3167. Evaluate(x.left,left);
  3168. Evaluate(x.right,right);
  3169. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3170. Reuse1(temp.op,left.op);
  3171. Emit(And(position,temp.op,left.op,right.op));
  3172. ReleaseOperand(left);
  3173. BreqL(trueLabel, temp.op,right.op);
  3174. ReleaseOperand(temp); ReleaseOperand(right);
  3175. BrL(falseLabel);
  3176. ELSE
  3177. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3178. ReleaseOperand(left); ReleaseOperand(right);
  3179. BrL(trueLabel);
  3180. END;
  3181. END;
  3182. |Scanner.Unequal:
  3183. IF ~conditional THEN ConditionToValue(x);
  3184. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3185. CompareString(BrneL,x.left,x.right);
  3186. ELSE
  3187. Evaluate(x.left,left);
  3188. Evaluate(x.right,right);
  3189. IF leftType IS SyntaxTree.RangeType THEN
  3190. ASSERT(rightType IS SyntaxTree.RangeType);
  3191. BrneL(trueLabel, left.op, right.op); (* first *)
  3192. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3193. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3194. ReleaseOperand(left); ReleaseOperand(right);
  3195. BrL(falseLabel)
  3196. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3197. BrneL(trueLabel, left.op, right.op); (* first *)
  3198. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3199. ReleaseOperand(left); ReleaseOperand(right);
  3200. BrL(falseLabel)
  3201. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3202. (* TODO: review this *)
  3203. BrneL(trueLabel, left.op, right.op); (* real part *)
  3204. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3205. ReleaseOperand(left); ReleaseOperand(right);
  3206. BrL(falseLabel)
  3207. ELSE
  3208. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3209. ReleaseOperand(left); ReleaseOperand(right);
  3210. BrL(trueLabel);
  3211. END;
  3212. END;
  3213. |Scanner.In:
  3214. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3215. Evaluate(x.left,left);
  3216. Evaluate(x.right,right);
  3217. Convert(left.op,setType);
  3218. ReuseCopy(temp.op,right.op);
  3219. Emit(Shr(position,temp.op,temp.op,left.op));
  3220. ReleaseOperand(right); ReleaseOperand(left);
  3221. IntermediateCode.InitImmediate(one,setType,1);
  3222. Emit(And(position,temp.op,temp.op,one));
  3223. IF conditional THEN
  3224. IntermediateCode.InitImmediate(zero,setType,0);
  3225. BrneL(trueLabel,temp.op,zero);
  3226. ReleaseOperand(temp);
  3227. BrL(falseLabel);
  3228. ELSE
  3229. Convert(temp.op,bool);
  3230. result.mode := ModeValue;
  3231. result.op := temp.op;
  3232. result.tag := nil; (* may be left over from calls to evaluate *)
  3233. END;
  3234. ELSE
  3235. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3236. IF x.operator = Scanner.Questionmarks THEN
  3237. leftExpression := x.left;
  3238. rightExpression := x.right;
  3239. ELSE
  3240. leftExpression := x.right;
  3241. rightExpression := x.left;
  3242. END;
  3243. Evaluate(leftExpression, left);
  3244. Emit(Push(position,left.op));
  3245. ReleaseOperand(left);
  3246. Designate(rightExpression, right);
  3247. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3248. IF ~backend.cellsAreObjects THEN
  3249. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3250. END;
  3251. Emit(Push(position,right.op));
  3252. ReleaseOperand(right);
  3253. IF backend.cellsAreObjects THEN
  3254. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3255. ELSE
  3256. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3257. END;
  3258. InitOperand(result, ModeValue);
  3259. result.op := NewRegisterOperand(bool);
  3260. Emit(Result(position,result.op));
  3261. IF conditional THEN
  3262. IntermediateCode.InitImmediate(zero,setType,0);
  3263. BrneL(trueLabel,result.op,zero);
  3264. ReleaseOperand(result);
  3265. BrL(falseLabel);
  3266. END;
  3267. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3268. leftExpression := x.left;
  3269. rightExpression := x.right;
  3270. Evaluate(leftExpression, left);
  3271. Emit(Push(position,left.op));
  3272. ReleaseOperand(left);
  3273. Evaluate(rightExpression, right);
  3274. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3275. IF ~backend.cellsAreObjects THEN
  3276. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3277. END;
  3278. Emit(Push(position,right.op));
  3279. ReleaseOperand(right);
  3280. IF backend.cellsAreObjects THEN
  3281. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3282. ELSE
  3283. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3284. END;
  3285. InitOperand(result, ModeValue);
  3286. result.op := NewRegisterOperand(bool);
  3287. Emit(Result(position,result.op));
  3288. IF conditional THEN
  3289. IntermediateCode.InitImmediate(zero,setType,0);
  3290. BrneL(trueLabel,result.op,zero);
  3291. ReleaseOperand(result);
  3292. BrL(falseLabel);
  3293. END;
  3294. ELSE
  3295. HALT(100);
  3296. END;
  3297. END;
  3298. destination := dest;
  3299. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3300. END VisitBinaryExpression;
  3301. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3302. VAR localResult, operand: Operand;
  3303. BEGIN
  3304. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3305. InitOperand(localResult, ModeValue);
  3306. ASSERT(x.first # NIL);
  3307. Evaluate(x.first, operand);
  3308. localResult.op := operand.op;
  3309. ReleaseOperand(operand);
  3310. UseIntermediateOperand(localResult.op);
  3311. ASSERT(x.last # NIL);
  3312. Evaluate(x.last, operand);
  3313. localResult.tag := operand.op;
  3314. ReleaseOperand(operand);
  3315. UseIntermediateOperand(localResult.tag);
  3316. IF x.step # NIL THEN
  3317. Evaluate(x.step, operand);
  3318. localResult.extra := operand.op;
  3319. ReleaseOperand(operand);
  3320. UseIntermediateOperand(localResult.extra);
  3321. END;
  3322. result := localResult;
  3323. IF Trace THEN TraceExit("VisitRangeExpression") END
  3324. END VisitRangeExpression;
  3325. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3326. BEGIN
  3327. HALT(100); (* should never be evaluated *)
  3328. END VisitTensorRangeExpression;
  3329. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3330. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3331. BEGIN
  3332. IF Trace THEN TraceEnter("VisitConversion") END;
  3333. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3334. dest := destination; destination := emptyOperand;
  3335. Evaluate(x.expression,old);
  3336. InitOperand(result,ModeValue);
  3337. result.op := old.op;
  3338. ASSERT(result.op.mode # 0);
  3339. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3340. (* convert TO a complex number *)
  3341. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3342. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3343. ASSERT(result.op.mode # 0);
  3344. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3345. (* convert FROM a complex number TO a complex number*)
  3346. result.tag := old.tag;
  3347. ASSERT(result.tag.mode # 0);
  3348. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3349. ASSERT(result.tag.mode # 0)
  3350. ELSE
  3351. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3352. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3353. END
  3354. ELSE
  3355. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3356. ASSERT(result.op.mode # 0);
  3357. result.tag := old.tag; (*! probably never used *)
  3358. END;
  3359. destination := dest;
  3360. IF Trace THEN TraceExit("VisitConversion") END;
  3361. END VisitConversion;
  3362. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3363. BEGIN
  3364. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3365. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3366. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3367. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3368. END VisitTypeDeclaration;
  3369. (** designators (expressions) *)
  3370. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3371. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3372. BEGIN
  3373. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3374. IF x.left # NIL THEN Expression(x.left) END;
  3375. Symbol(x.symbol,result);
  3376. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3377. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3378. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3379. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3380. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3381. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3382. END;
  3383. END;
  3384. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3385. END VisitSymbolDesignator;
  3386. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3387. BEGIN
  3388. IF isUnchecked THEN RETURN END;
  3389. IF tagsAvailable THEN
  3390. TrapC(BrltL,index,length,IndexCheckTrap);
  3391. END;
  3392. END BoundCheck;
  3393. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3394. VAR d: IntermediateCode.Operand;
  3395. BEGIN
  3396. IF isUnchecked THEN RETURN END;
  3397. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3398. TrapC(op,dim,d,ArraySizeTrap);
  3399. ReleaseIntermediateOperand(d);
  3400. END DimensionCheck;
  3401. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3402. VAR
  3403. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3404. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3405. expression: SyntaxTree.Expression;
  3406. resultingType, leftType, baseType: SyntaxTree.Type;
  3407. skipLabel1: Label;
  3408. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3409. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3410. variableOp: Operand;
  3411. variable: SyntaxTree.Variable;
  3412. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3413. VAR expression: SyntaxTree.Expression;
  3414. BEGIN
  3415. (* count the number of indices, ranges and tensorRanges in the index list *)
  3416. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3417. FOR i := 0 TO parameters.Length() - 1 DO
  3418. expression := parameters.GetExpression(i);
  3419. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3420. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3421. ELSE INC(indexCount)
  3422. END
  3423. END;
  3424. END CountIndices;
  3425. BEGIN
  3426. ASSERT(tagsAvailable);
  3427. resultingType := x.type.resolved; (* resulting type *)
  3428. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3429. InitOperand(localResult, ModeReference);
  3430. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3431. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3432. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3433. (* a globally defined array destination tag is available -> use and invalidate it*)
  3434. localResult.tag := arrayDestinationTag;
  3435. IntermediateCode.InitOperand(arrayDestinationTag)
  3436. ELSE
  3437. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3438. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3439. Symbol(variable, variableOp);
  3440. ReuseCopy(localResult.tag, variableOp.op);
  3441. ReleaseOperand(variableOp);
  3442. END
  3443. END;
  3444. indexListSize := x.parameters.Length();
  3445. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3446. ASSERT(tensorRangeCount <= 1);
  3447. (* designate the array to be indexed over, perform tensor range check if known *)
  3448. Designate(x.left, array);
  3449. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3450. Dereference(array, leftType,FALSE);
  3451. IF tensorRangeCount=0 THEN
  3452. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3453. END
  3454. END;
  3455. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3456. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3457. srcDimOffset := -indexListSize;
  3458. destDimOffset := -rangeCount
  3459. ELSE
  3460. srcDimOffset := 0;
  3461. destDimOffset := 0
  3462. END;
  3463. indexDim := 0;
  3464. (* use address of source array as basis *)
  3465. (*
  3466. ReuseCopy(localResult.op, array.op);
  3467. *)
  3468. localResult.op := array.op;
  3469. UseIntermediateOperand(localResult.op);
  3470. (* go through the index list *)
  3471. FOR i := 0 TO indexListSize - 1 DO
  3472. expression := x.parameters.GetExpression(i);
  3473. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3474. (* nothing to do *)
  3475. ELSE
  3476. (* determine which dimension of source array is currently looked at *)
  3477. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3478. (* get the memory operand pointing to array descriptor dimension *)
  3479. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3480. (* make a reusable register from it *)
  3481. ReuseCopy(srcDim, tmp);
  3482. ReleaseIntermediateOperand(tmp);
  3483. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3484. ELSE
  3485. srcDim := IntermediateCode.Immediate(int32, i)
  3486. END;
  3487. (* get length and increment of source array for current dimension *)
  3488. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3489. Convert(sourceLength.op, sizeType);
  3490. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3491. Convert(sourceIncrement.op, sizeType);
  3492. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3493. ReleaseIntermediateOperand(srcDim);
  3494. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3495. (* SINGLE INDEX *)
  3496. Evaluate(expression, index);
  3497. ReleaseIntermediateOperand(index.tag);
  3498. index.tag := emptyOperand;
  3499. Convert(index.op, sizeType);
  3500. (* lower bound check *)
  3501. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3502. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3503. ELSIF isUnchecked THEN (* do nothing *)
  3504. ELSE
  3505. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3506. END;
  3507. (* upper bound check *)
  3508. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3509. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3510. ELSIF isUnchecked THEN (* do nothing *)
  3511. ELSE
  3512. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3513. END;
  3514. ReleaseOperand(sourceLength);
  3515. Convert(index.op, addressType);
  3516. summand := index.op;
  3517. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3518. (* RANGE OF INDICES *)
  3519. Evaluate(expression, range);
  3520. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3521. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3522. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3523. ReleaseOperand(range);
  3524. Convert(firstIndex, sizeType);
  3525. Convert(lastIndex, sizeType);
  3526. Convert(stepSize, sizeType);
  3527. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3528. if it is 'MAX(LONGINT)' *)
  3529. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3530. TransferToRegister(lastIndex, lastIndex);
  3531. skipLabel1 := NewLabel();
  3532. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3533. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3534. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3535. SetLabel(skipLabel1)
  3536. END;
  3537. (* check if step size is valid *)
  3538. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3539. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3540. ELSIF isUnchecked THEN (* do nothing *)
  3541. ELSE
  3542. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3543. END;
  3544. (* check lower bound check *)
  3545. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3546. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3547. ELSIF isUnchecked THEN (* do nothing *)
  3548. ELSE
  3549. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3550. END;
  3551. (* check upper bound check *)
  3552. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3553. (* statically open range: nothing to do *)
  3554. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3555. ASSERT(staticLastIndex < staticSourceLength)
  3556. ELSIF isUnchecked THEN (* do nothing *)
  3557. ELSE
  3558. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3559. END;
  3560. (* determine length of target array for current dimension *)
  3561. (* 1. incorporate last index: *)
  3562. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3563. (* last index is static *)
  3564. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3565. targetLength := sourceLength.op
  3566. ELSE
  3567. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3568. END;
  3569. UseIntermediateOperand(targetLength);
  3570. ELSE
  3571. (* targetLength := lastIndex + 1
  3572. Reuse1(targetLength, lastIndex);
  3573. *)
  3574. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3575. END;
  3576. ReleaseOperand(sourceLength);
  3577. ReleaseIntermediateOperand(lastIndex);
  3578. (* 2. incorporate first index: *)
  3579. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3580. (* first index and current target length are static *)
  3581. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3582. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3583. (* first index = 0: nothing to do *)
  3584. ELSE
  3585. (* targetLength := targetLength - firstIndex *)
  3586. TransferToRegister(targetLength, targetLength);
  3587. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3588. END;
  3589. (* clip negative lengths to 0 *)
  3590. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3591. IF staticTargetLength < 0 THEN
  3592. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3593. END
  3594. ELSE
  3595. skipLabel1 := NewLabel();
  3596. TransferToRegister(targetLength, targetLength);
  3597. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3598. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3599. SetLabel(skipLabel1)
  3600. END;
  3601. (* 3. incorporate index step size: *)
  3602. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3603. (*step size and current target length are static *)
  3604. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3605. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3606. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3607. (* step size = 1: nothing to do *)
  3608. ELSE
  3609. (* emit code for this:
  3610. targetLength := (targetLength-1) DIV stepSize +1;
  3611. *)
  3612. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3613. DivInt(targetLength, targetLength, stepSize);
  3614. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3615. END;
  3616. (* determine increment of target array for current dimension *)
  3617. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3618. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3619. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3620. (* step size = 1 *)
  3621. targetIncrement := sourceIncrement.op;
  3622. UseIntermediateOperand(targetIncrement)
  3623. ELSE
  3624. (* targetIncrement := sourceIncrement * stepSize *)
  3625. Reuse1(targetIncrement, stepSize);
  3626. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3627. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3628. END;
  3629. ReleaseIntermediateOperand(stepSize);
  3630. (* write length and increment of target array to descriptor *)
  3631. IF destDimOffset < 0 THEN
  3632. (* determine which dimension of target array is currently looked at *)
  3633. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3634. TransferToRegister(destDim, tmp);
  3635. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3636. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3637. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3638. ReleaseIntermediateOperand(destDim)
  3639. ELSE
  3640. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3641. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3642. END;
  3643. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3644. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3645. INC(indexDim);
  3646. Convert(firstIndex, addressType);
  3647. TransferToRegister(summand, firstIndex);
  3648. ELSE HALT(100);
  3649. END;
  3650. (*
  3651. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3652. *)
  3653. Convert(sourceIncrement.op, addressType);
  3654. Convert(summand, addressType);
  3655. MulInt(summand, summand, sourceIncrement.op);
  3656. ReleaseIntermediateOperand(sourceIncrement.op);
  3657. AddInt(localResult.op, localResult.op, summand);
  3658. ReleaseIntermediateOperand(summand);
  3659. END
  3660. END;
  3661. result := localResult;
  3662. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3663. ReleaseIntermediateOperand(result.tag);
  3664. result.tag := TypeDescriptorAdr(resultingType);
  3665. IF ~newObjectFile THEN
  3666. IntermediateCode.MakeMemory(result.tag,addressType);
  3667. END;
  3668. ELSIF IsDelegate(resultingType) THEN
  3669. ReleaseIntermediateOperand(result.tag);
  3670. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3671. UseIntermediateOperand(result.tag);
  3672. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3673. ReleaseIntermediateOperand(result.tag);
  3674. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3675. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3676. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3677. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3678. (* finalize target array descriptor *)
  3679. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3680. (* write lengths and increments of target array for remaining dimensions *)
  3681. i := indexListSize;
  3682. WHILE indexDim < targetArrayDimensionality DO
  3683. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3684. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3685. ReleaseOperand(sourceLength);
  3686. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3687. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3688. ReleaseOperand(sourceIncrement);
  3689. INC(i); INC(indexDim);
  3690. END;
  3691. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3692. tmp := nil;
  3693. ELSE
  3694. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3695. END;
  3696. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3697. ReleaseIntermediateOperand(tmp);
  3698. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3699. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3700. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3701. ELSE
  3702. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3703. END;
  3704. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3705. ReleaseIntermediateOperand(tmp);
  3706. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3707. (* write dimensionality *)
  3708. IF targetArrayDimensionality # 0 THEN
  3709. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3710. END;
  3711. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3712. END;
  3713. ReleaseOperand(array);
  3714. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3715. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3716. END;
  3717. END MathIndexDesignator;
  3718. (* TENTATIVE *)
  3719. PROCEDURE DumpOperand(operand: Operand);
  3720. BEGIN
  3721. D.Log.String(" op = ");
  3722. IntermediateCode.DumpOperand(D.Log, operand.op );
  3723. D.Log.Ln;
  3724. D.Log.String(" tag = ");
  3725. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3726. D.Log.Ln;
  3727. D.Log.String(" extra = ");
  3728. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3729. D.Log.Ln;
  3730. D.Log.Update
  3731. END DumpOperand;
  3732. (* get the length of an array , trying to make use of static information *)
  3733. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3734. VAR res: IntermediateCode.Operand; size: LONGINT;
  3735. BEGIN
  3736. type := type.resolved;
  3737. IF type IS SyntaxTree.ArrayType THEN
  3738. WITH type: SyntaxTree.ArrayType DO
  3739. IF type.form = SyntaxTree.Static THEN
  3740. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3741. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3742. Evaluate(type.length, op);
  3743. ReleaseIntermediateOperand(op.tag);
  3744. RETURN op.op;*)
  3745. ELSE
  3746. res := tag;
  3747. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3748. IntermediateCode.MakeMemory(res,addressType);
  3749. UseIntermediateOperand(res);
  3750. RETURN res
  3751. END
  3752. END;
  3753. ELSE
  3754. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3755. RETURN IntermediateCode.Immediate(addressType,size);
  3756. END;
  3757. END ArrayLength;
  3758. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3759. BEGIN
  3760. ReleaseIntermediateOperand(res);
  3761. IF IsImmediate(x) & IsImmediate(y) THEN
  3762. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3763. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3764. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3765. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3766. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3767. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3768. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3769. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3770. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3771. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3772. UseIntermediateOperand(res);
  3773. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3774. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3775. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3776. UseIntermediateOperand(res);
  3777. ELSE
  3778. IF ~ReusableRegister(res) THEN
  3779. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3780. ELSE
  3781. UseIntermediateOperand(res);
  3782. END;
  3783. IF IsImmediate(x) & (x.intValue = 0) THEN
  3784. Emit(Mov(position,res,y))
  3785. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3786. Emit(Mov(position,res,x))
  3787. ELSE
  3788. Emit(Add(position,res, x, y));
  3789. END;
  3790. END;
  3791. END AddInt;
  3792. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3793. BEGIN
  3794. ReleaseIntermediateOperand(res);
  3795. IF IsImmediate(x) & IsImmediate(y) THEN
  3796. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3797. ELSE
  3798. IF ~ReusableRegister(res) THEN
  3799. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3800. ELSE UseIntermediateOperand(res);
  3801. END;
  3802. IF IsImmediate(x) & (x.intValue = 1) THEN
  3803. Emit(Mov(position,res,y))
  3804. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3805. Emit(Mov(position,res,x))
  3806. ELSE
  3807. Emit(Mul(position,res, x, y));
  3808. END;
  3809. END;
  3810. END MulInt;
  3811. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3812. BEGIN
  3813. ReleaseIntermediateOperand(res);
  3814. IF IsImmediate(x) & IsImmediate(y) THEN
  3815. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3816. ELSE
  3817. IF ~ReusableRegister(res) THEN
  3818. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3819. ELSE UseIntermediateOperand(res);
  3820. END;
  3821. IF IsImmediate(x) & (x.intValue = 1) THEN
  3822. Emit(Mov(position,res,y))
  3823. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3824. Emit(Mov(position,res,x))
  3825. ELSE
  3826. Emit(Div(position,res, x, y));
  3827. END;
  3828. END;
  3829. END DivInt;
  3830. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3831. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3832. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3833. BEGIN
  3834. type := x.left.type.resolved;
  3835. IF type IS SyntaxTree.StringType THEN
  3836. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3837. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3838. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3839. type := atype;
  3840. x.left.SetType(type);
  3841. END;
  3842. IntermediateCode.InitImmediate(res,addressType,0);
  3843. maxDim := x.parameters.Length()-1;
  3844. FOR i := 0 TO maxDim DO
  3845. e := x.parameters.GetExpression(i);
  3846. Evaluate(e,index);
  3847. Convert(index.op,addressType);
  3848. AddInt(res, res, index.op);
  3849. IF i = 0 THEN
  3850. (*
  3851. ReuseCopy(res, index.op);
  3852. *)
  3853. Designate(x.left,array);
  3854. type := x.left.type.resolved;
  3855. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3856. Dereference(array, type, FALSE);
  3857. END;
  3858. (*
  3859. ELSE AddInt(res, res, index.op);
  3860. *)
  3861. END;
  3862. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3863. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3864. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3865. BoundCheck(index.op, length);
  3866. END;
  3867. ReleaseIntermediateOperand(length);
  3868. END;
  3869. ReleaseOperand(index);
  3870. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3871. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3872. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3873. MulInt(res,res,length);
  3874. END;
  3875. ReleaseIntermediateOperand(length);
  3876. END;
  3877. IF (type IS SyntaxTree.ArrayType) THEN
  3878. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3879. size := StaticSize(system, type);
  3880. IF size # 1 THEN
  3881. length := IntermediateCode.Immediate(addressType,size);
  3882. MulInt(res,res,length);
  3883. END;
  3884. ELSE
  3885. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3886. IF size # 1 THEN
  3887. length := IntermediateCode.Immediate(addressType,size);
  3888. MulInt(res,res,length);
  3889. END;
  3890. END;
  3891. END;
  3892. AddInt(res,res,array.op);
  3893. InitOperand(result,ModeReference);
  3894. result.op := res;
  3895. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3896. ReleaseIntermediateOperand(result.tag);
  3897. result.tag := TypeDescriptorAdr(type);
  3898. IF ~newObjectFile THEN
  3899. IntermediateCode.MakeMemory(result.tag,addressType);
  3900. END
  3901. ELSIF IsDelegate(type) THEN
  3902. ReleaseIntermediateOperand(result.tag);
  3903. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3904. UseIntermediateOperand(result.tag);
  3905. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3906. ReleaseIntermediateOperand(result.tag);
  3907. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3908. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3909. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3910. END;
  3911. ReleaseOperand(array);
  3912. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3913. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3914. END;
  3915. END IndexDesignator;
  3916. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3917. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3918. BEGIN
  3919. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3920. dest := destination; destination := emptyOperand;
  3921. type := x.left.type.resolved;
  3922. IF type IS SyntaxTree.MathArrayType THEN
  3923. MathIndexDesignator(x);
  3924. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3925. IndexDesignator(x);
  3926. END;
  3927. destination := dest;
  3928. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3929. END VisitIndexDesignator;
  3930. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3931. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3932. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3933. procedure: SyntaxTree.Procedure;
  3934. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3935. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3936. BEGIN
  3937. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3938. parameters := expression.parameters;
  3939. moduleName := "FoxArrayBase";
  3940. procedureName := "CopyDescriptor";
  3941. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3942. SaveRegisters();ReleaseUsedRegisters(saved);
  3943. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3944. IF procedure = NIL THEN
  3945. s := "procedure ";
  3946. Strings.Append(s,moduleName);
  3947. Strings.Append(s,".");
  3948. Strings.Append(s,procedureName);
  3949. Strings.Append(s," not present");
  3950. Error(position,s);
  3951. ELSE
  3952. (* push address of temporary variable *)
  3953. Symbol(variable,destOperand);
  3954. Emit(Push(position,destOperand.op));
  3955. ReleaseOperand(destOperand);
  3956. (* push src *)
  3957. Evaluate(expression.left,srcOperand);
  3958. (*
  3959. Dereference(srcOperand,expression.type.resolved);
  3960. Emit(Push(position,srcOperand.tag));
  3961. *)
  3962. Emit(Push(position,srcOperand.op));
  3963. ReleaseOperand(srcOperand);
  3964. tensorFound := FALSE;
  3965. FOR i := 0 TO parameters.Length()-1 DO
  3966. e := parameters.GetExpression(i);
  3967. IF e IS SyntaxTree.TensorRangeExpression THEN
  3968. tensorFound := TRUE;
  3969. ELSIF e IS SyntaxTree.RangeExpression THEN
  3970. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3971. ELSE
  3972. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3973. END;
  3974. END;
  3975. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  3976. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  3977. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  3978. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  3979. StaticCallOperand(procOp,procedure);
  3980. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  3981. ReleaseOperand(procOp);
  3982. END;
  3983. RestoreRegisters(saved);
  3984. END;
  3985. RETURN variable
  3986. END PrepareTensorDescriptor;
  3987. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  3988. VAR
  3989. type, descriptorType, baseType: SyntaxTree.Type;
  3990. operand, tmpOperand, variableOp, variable2Op: Operand;
  3991. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  3992. variable, variable2: SyntaxTree.Variable;
  3993. dim, i, size: LONGINT;
  3994. (* TODO: needed? *)
  3995. oldArrayDestinationTag: IntermediateCode.Operand;
  3996. oldArrayDestinationDimension: LONGINT;
  3997. position: LONGINT;
  3998. saved: RegisterEntry;
  3999. arrayFlags: SET;
  4000. m, n: LONGINT;
  4001. PROCEDURE Pass(op: IntermediateCode.Operand);
  4002. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4003. BEGIN
  4004. IF numberRegister >= 0 THEN
  4005. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4006. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4007. Emit(Mov(position,parameterRegister, op));
  4008. ELSE
  4009. Emit(Push(position,op))
  4010. END
  4011. END Pass;
  4012. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4013. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4014. BEGIN
  4015. formalType := formalType.resolved; actualType := actualType.resolved;
  4016. IF IsOpenArray(formalType)THEN
  4017. IF actualType IS SyntaxTree.StringType THEN
  4018. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4019. RETURN;
  4020. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4021. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4022. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4023. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4024. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4025. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4026. ELSE
  4027. tmp := baseReg;
  4028. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4029. IntermediateCode.MakeMemory(tmp,addressType);
  4030. Pass((tmp));
  4031. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4032. END;
  4033. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4034. END;
  4035. END PushArrayLens;
  4036. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4037. BEGIN
  4038. CASE size OF
  4039. |2: INCL(flags,Size2Flag);
  4040. |3: INCL(flags,Size3Flag);
  4041. |4: INCL(flags,Size4Flag);
  4042. |5: INCL(flags,Size5Flag);
  4043. |6: INCL(flags,Size6Flag);
  4044. |7: INCL(flags,Size7Flag);
  4045. |8: INCL(flags,Size8Flag);
  4046. END;
  4047. END SetSmallArraySizeFlag;
  4048. BEGIN
  4049. IF Trace THEN TraceEnter("PushParameter") END;
  4050. position := expression.position;
  4051. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4052. type := expression.type.resolved;
  4053. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4054. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4055. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4056. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4057. );
  4058. (* TODO: needed? *)
  4059. oldArrayDestinationTag := arrayDestinationTag;
  4060. oldArrayDestinationDimension := arrayDestinationDimension;
  4061. IF IsArrayOfSystemByte(parameter.type) THEN
  4062. Designate(expression,operand);
  4063. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4064. ReleaseIntermediateOperand(operand.tag);
  4065. operand.tag := tmp;
  4066. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4067. Pass((operand.tag));
  4068. END;
  4069. Pass((operand.op));
  4070. ELSIF IsOpenArray(parameter.type) THEN
  4071. Designate(expression,operand);
  4072. baseReg := operand.tag;
  4073. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4074. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4075. END;
  4076. Pass((operand.op)); (* address of the array *)
  4077. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4078. (* case 1 *)
  4079. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4080. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4081. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4082. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4083. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4084. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4085. arrayDestinationTag := sp;
  4086. (* case 1b *)
  4087. IF expression IS SyntaxTree.IndexDesignator THEN
  4088. (*
  4089. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4090. descriptorType := GetMathArrayDescriptorType(dim);
  4091. variable := GetTemporaryVariable(descriptorType,expression.position);
  4092. Symbol(variable,variableOp);
  4093. arrayDestinationTag := variableOp.op;
  4094. *)
  4095. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4096. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4097. arrayDestinationDimension := dim;
  4098. Designate(expression,operand);
  4099. (* case 1a *)
  4100. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4101. Designate(expression,operand);
  4102. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4103. i := 0;
  4104. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4105. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4106. INC(i);
  4107. END;
  4108. type := expression.type.resolved;
  4109. WHILE (i<dim) DO (* remaining static dimensions *)
  4110. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4111. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4112. ReleaseOperand(tmpOperand);
  4113. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4114. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4115. ReleaseOperand(tmpOperand);
  4116. INC(i);
  4117. END;
  4118. dimOp := IntermediateCode.Immediate(addressType,dim);
  4119. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4120. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4121. (* case 1d *)
  4122. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4123. Designate(expression,operand);
  4124. Dereference(operand,type.resolved,FALSE);
  4125. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4126. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4127. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4128. (* case 1f *)
  4129. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4130. Designate(expression,operand);
  4131. FOR i := 0 TO dim-1 DO
  4132. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4133. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4134. ReleaseOperand(tmpOperand);
  4135. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4136. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4137. ReleaseOperand(tmpOperand);
  4138. END;
  4139. (*******
  4140. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4141. *)
  4142. arrayFlags := {StaticFlag};
  4143. IF dim = 1 THEN
  4144. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4145. ReleaseOperand(tmpOperand);
  4146. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4147. m := LONGINT(tmpOperand.op.intValue);
  4148. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4149. ELSIF dim = 2 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. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4155. ReleaseOperand(tmpOperand);
  4156. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4157. n := LONGINT(tmpOperand.op.intValue);
  4158. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4159. INCL(arrayFlags,SmallMatrixFlag);
  4160. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4161. END;
  4162. END;
  4163. (*******)
  4164. dimOp := IntermediateCode.Immediate(addressType,dim);
  4165. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4166. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4167. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4168. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4169. baseType := SemanticChecker.ArrayBase(type,dim);
  4170. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4171. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4172. ELSE HALT(100);
  4173. END;
  4174. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4175. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4176. (* case 2b *)
  4177. IF expression IS SyntaxTree.IndexDesignator THEN
  4178. descriptorType := GetMathArrayDescriptorType(dim);
  4179. variable := GetTemporaryVariable(descriptorType, FALSE);
  4180. Symbol(variable,variableOp);
  4181. arrayDestinationTag := variableOp.op;
  4182. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4183. arrayDestinationDimension := dim;
  4184. NeedDescriptor := TRUE;
  4185. Designate(expression,operand);
  4186. Pass((operand.tag));
  4187. NeedDescriptor := FALSE;
  4188. (* case 2a *)
  4189. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4190. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4191. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4192. INC(i);
  4193. END;
  4194. IF i = dim THEN
  4195. Designate(expression,operand);
  4196. Pass((operand.tag));
  4197. ELSE (* open-static *)
  4198. type := expression.type.resolved;
  4199. descriptorType := GetMathArrayDescriptorType(dim);
  4200. variable := GetTemporaryVariable(descriptorType, FALSE);
  4201. Symbol(variable,variableOp);
  4202. arrayDestinationTag := variableOp.op;
  4203. Designate(expression,operand);
  4204. FOR i := 0 TO dim-1 DO
  4205. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4206. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4207. ReleaseOperand(tmpOperand);
  4208. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4209. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4210. ReleaseOperand(tmpOperand);
  4211. END;
  4212. dimOp := IntermediateCode.Immediate(addressType,dim);
  4213. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4214. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4215. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4216. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4217. baseType := SemanticChecker.ArrayBase(type,dim);
  4218. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4219. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4220. Pass((arrayDestinationTag));
  4221. END;
  4222. (* case 2d *)
  4223. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4224. Designate(expression,operand);
  4225. Dereference(operand,type.resolved,FALSE);
  4226. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4227. Pass((operand.tag));
  4228. (* case 2f *)
  4229. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4230. descriptorType := GetMathArrayDescriptorType(dim);
  4231. variable := GetTemporaryVariable(descriptorType, FALSE);
  4232. Symbol(variable,variableOp);
  4233. arrayDestinationTag := variableOp.op;
  4234. Designate(expression,operand);
  4235. FOR i := 0 TO dim-1 DO
  4236. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4237. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4238. ReleaseOperand(tmpOperand);
  4239. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4240. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4241. ReleaseOperand(tmpOperand);
  4242. END;
  4243. (*
  4244. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4245. *)
  4246. arrayFlags := {StaticFlag};
  4247. IF dim = 1 THEN
  4248. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4249. ReleaseOperand(tmpOperand);
  4250. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4251. m := LONGINT(tmpOperand.op.intValue);
  4252. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4253. ELSIF dim = 2 THEN
  4254. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4255. ReleaseOperand(tmpOperand);
  4256. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4257. m := LONGINT(tmpOperand.op.intValue);
  4258. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4259. ReleaseOperand(tmpOperand);
  4260. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4261. n := LONGINT(tmpOperand.op.intValue);
  4262. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4263. INCL(arrayFlags,SmallMatrixFlag);
  4264. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4265. END;
  4266. END;
  4267. (*******)
  4268. dimOp := IntermediateCode.Immediate(addressType,dim);
  4269. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4270. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4271. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4272. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4273. baseType := SemanticChecker.ArrayBase(type,dim);
  4274. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4275. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4276. Pass((arrayDestinationTag));
  4277. ELSE HALT(100);
  4278. END;
  4279. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4280. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4281. (* case 3b *)
  4282. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4283. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4284. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4285. Symbol(variable,variableOp);
  4286. LoadValue(variableOp,system.addressType);
  4287. ELSE
  4288. descriptorType := GetMathArrayDescriptorType(dim);
  4289. variable := GetTemporaryVariable(descriptorType, FALSE);
  4290. Symbol(variable,variableOp);
  4291. END;
  4292. arrayDestinationTag := variableOp.op;
  4293. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4294. arrayDestinationDimension := 0;
  4295. Designate(expression,operand);
  4296. Pass((operand.tag));
  4297. (* case 3a *)
  4298. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4299. i := 0;
  4300. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4301. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4302. INC(i);
  4303. END;
  4304. IF i = dim THEN
  4305. Designate(expression,operand);
  4306. Pass((operand.tag));
  4307. ELSE (* open-static *)
  4308. type := expression.type.resolved;
  4309. descriptorType := GetMathArrayDescriptorType(dim);
  4310. variable := GetTemporaryVariable(descriptorType, FALSE);
  4311. Symbol(variable,variableOp);
  4312. arrayDestinationTag := variableOp.op;
  4313. Designate(expression,operand);
  4314. FOR i := 0 TO dim-1 DO
  4315. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4316. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4317. ReleaseOperand(tmpOperand);
  4318. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4319. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4320. ReleaseOperand(tmpOperand);
  4321. END;
  4322. dimOp := IntermediateCode.Immediate(addressType,dim);
  4323. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4324. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4325. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4326. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4327. baseType := SemanticChecker.ArrayBase(type,dim);
  4328. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4329. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4330. Pass((arrayDestinationTag));
  4331. END;
  4332. (* case 3d *)
  4333. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4334. Designate(expression,operand);
  4335. Dereference(operand,type.resolved,FALSE);
  4336. (*
  4337. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4338. *)
  4339. Pass((operand.tag));
  4340. (* case 3f *)
  4341. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4342. descriptorType := GetMathArrayDescriptorType(dim);
  4343. variable := GetTemporaryVariable(descriptorType, FALSE);
  4344. Symbol(variable,variableOp);
  4345. arrayDestinationTag := variableOp.op;
  4346. Designate(expression,operand);
  4347. IF operand.op.type.length >1 THEN (* vector register *)
  4348. variable2 := GetTemporaryVariable(type, FALSE);
  4349. Symbol(variable2, variable2Op);
  4350. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4351. Emit(Mov(position,tmp, operand.op));
  4352. ReleaseOperand(operand);
  4353. Symbol(variable2, operand);
  4354. END;
  4355. FOR i := 0 TO dim-1 DO
  4356. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4357. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4358. ReleaseOperand(tmpOperand);
  4359. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4360. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4361. ReleaseOperand(tmpOperand);
  4362. END;
  4363. dimOp := IntermediateCode.Immediate(addressType,dim);
  4364. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4365. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4366. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4367. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4368. baseType := SemanticChecker.ArrayBase(type,dim);
  4369. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4370. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4371. Pass((arrayDestinationTag));
  4372. ELSE HALT(100);
  4373. END;
  4374. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4375. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4376. (* case 4b *)
  4377. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4378. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4379. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4380. Symbol(variable,variableOp);
  4381. LoadValue(variableOp,system.addressType);
  4382. ELSE
  4383. descriptorType := GetMathArrayDescriptorType(dim);
  4384. variable := GetTemporaryVariable(descriptorType, FALSE);
  4385. Symbol(variable,variableOp);
  4386. END;
  4387. arrayDestinationTag := variableOp.op;
  4388. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4389. arrayDestinationDimension := 0;
  4390. Designate(expression,operand);
  4391. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4392. Symbol(variable,variableOp);
  4393. ELSE
  4394. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4395. Symbol(variable,variableOp);
  4396. MakeMemory(tmp,variableOp.op,addressType,0);
  4397. Emit(Mov(position,tmp,operand.tag));
  4398. ReleaseIntermediateOperand(tmp);
  4399. END;
  4400. Pass((variableOp.op));
  4401. ReleaseOperand(variableOp);
  4402. (* case 4a *)
  4403. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4404. i := 0;
  4405. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4406. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4407. INC(i);
  4408. END;
  4409. IF i = dim THEN
  4410. Designate(expression,operand);
  4411. arrayDestinationTag := operand.tag;
  4412. ELSE (* open-static *)
  4413. type := expression.type.resolved;
  4414. descriptorType := GetMathArrayDescriptorType(dim);
  4415. variable := GetTemporaryVariable(descriptorType, FALSE);
  4416. Symbol(variable,variableOp);
  4417. arrayDestinationTag := variableOp.op;
  4418. Designate(expression,operand);
  4419. FOR i := 0 TO dim-1 DO
  4420. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4421. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4422. ReleaseOperand(tmpOperand);
  4423. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4424. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4425. ReleaseOperand(tmpOperand);
  4426. END;
  4427. dimOp := IntermediateCode.Immediate(addressType,dim);
  4428. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4429. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4430. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4431. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4432. baseType := SemanticChecker.ArrayBase(type,dim);
  4433. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4434. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4435. END;
  4436. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4437. Symbol(variable,variableOp);
  4438. MakeMemory(tmp,variableOp.op,addressType,0);
  4439. Emit(Mov(position,tmp,arrayDestinationTag));
  4440. ReleaseIntermediateOperand(tmp);
  4441. Pass((variableOp.op));
  4442. ReleaseOperand(variableOp);
  4443. (* case 4d *)
  4444. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4445. Designate(expression,operand);
  4446. (*
  4447. Dereference(operand,type.resolved,FALSE);
  4448. *)
  4449. (*
  4450. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4451. *)
  4452. Pass((operand.op));
  4453. (* case 4f *)
  4454. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4455. descriptorType := GetMathArrayDescriptorType(dim);
  4456. variable := GetTemporaryVariable(descriptorType, FALSE);
  4457. Symbol(variable,variableOp);
  4458. arrayDestinationTag := variableOp.op;
  4459. Designate(expression,operand);
  4460. FOR i := 0 TO dim-1 DO
  4461. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4462. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4463. ReleaseOperand(tmpOperand);
  4464. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4465. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4466. ReleaseOperand(tmpOperand);
  4467. END;
  4468. dimOp := IntermediateCode.Immediate(addressType,dim);
  4469. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4470. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4471. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4472. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4473. baseType := SemanticChecker.ArrayBase(type,dim);
  4474. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4475. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4476. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4477. Symbol(variable,variableOp);
  4478. MakeMemory(tmp,variableOp.op,addressType,0);
  4479. Emit(Mov(position,tmp,arrayDestinationTag));
  4480. ReleaseIntermediateOperand(tmp);
  4481. Pass((variableOp.op));
  4482. ReleaseOperand(variableOp);
  4483. ELSE HALT(100);
  4484. END;
  4485. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4486. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4487. Designate(expression,operand);
  4488. IF operand.op.type.length > 1 THEN
  4489. Emit(Push(position, operand.op));
  4490. ReleaseOperand(operand);
  4491. ELSE
  4492. size := system.SizeOf(type);
  4493. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4494. size := ToMemoryUnits(system,size);
  4495. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4496. arrayDestinationTag := sp;
  4497. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4498. END;
  4499. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4500. Designate(expression,operand);
  4501. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4502. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4503. Symbol(variable,variableOp);
  4504. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4505. Emit(Mov(position,tmp,operand.op));
  4506. Emit(Push(position,variableOp.op));
  4507. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4508. Pass((operand.op));
  4509. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4510. END;
  4511. ELSE HALT(200)
  4512. END;
  4513. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4514. IF parameter.kind = SyntaxTree.VarParameter THEN
  4515. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4516. Designate(expression, operand);
  4517. Pass((operand.op));
  4518. ELSE
  4519. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4520. Evaluate(expression, operand);
  4521. Pass((operand.extra)); (* step *)
  4522. Pass((operand.tag)); (* last *)
  4523. Pass((operand.op)) (* first *)
  4524. END
  4525. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4526. IF parameter.kind = SyntaxTree.VarParameter THEN
  4527. Designate(expression, operand);
  4528. Pass((operand.op));
  4529. ELSE
  4530. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4531. Evaluate(expression, operand);
  4532. Pass((operand.tag)); (* real part *)
  4533. Pass((operand.op)) (* imaginary part *)
  4534. END
  4535. ELSE
  4536. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4537. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4538. Designate(expression,operand);
  4539. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4540. (* stack allocation *)
  4541. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4542. (*! parameter alignment to be discussed ... *)
  4543. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4544. size := type(SyntaxTree.StringType).length;
  4545. END;
  4546. IF backend.cooperative & parameter.NeedsTrace() THEN
  4547. dst := NewRegisterOperand (addressType);
  4548. Emit(Mov(position,dst, sp));
  4549. IntermediateCode.InitImmediate(null, byteType, 0);
  4550. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4551. ReleaseIntermediateOperand(dst);
  4552. SaveRegisters();ReleaseUsedRegisters(saved);
  4553. (* register dst has been freed before SaveRegisters already *)
  4554. CallAssignMethod(dst, operand.op, parameter.type);
  4555. RestoreRegisters(saved);
  4556. END;
  4557. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4558. ELSIF IsOpenArray(parameter.type) THEN
  4559. Designate(expression,operand);
  4560. baseReg := operand.tag;
  4561. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4562. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4563. END;
  4564. Pass((operand.op)); (* address of the array *)
  4565. ELSIF IsDelegate(parameter.type) THEN
  4566. Evaluate(expression,operand);
  4567. IF backend.cooperative & parameter.NeedsTrace() THEN
  4568. Emit(Push(position, nil));
  4569. dst := NewRegisterOperand (addressType);
  4570. Emit(Mov(position,dst, sp));
  4571. ReleaseIntermediateOperand(dst);
  4572. SaveRegisters();ReleaseUsedRegisters(saved);
  4573. Emit(Push(position, dst));
  4574. (* register dst has been freed before SaveRegisters already *)
  4575. Emit(Push(position, operand.tag));
  4576. CallThis(position,"GarbageCollector","Assign",2);
  4577. RestoreRegisters(saved);
  4578. ELSE
  4579. Pass((operand.tag));
  4580. END;
  4581. Pass((operand.op));
  4582. ELSE
  4583. Evaluate(expression,operand);
  4584. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4585. Emit(Push(position, nil));
  4586. dst := NewRegisterOperand (addressType);
  4587. Emit(Mov(position,dst, sp));
  4588. ReleaseIntermediateOperand(dst);
  4589. SaveRegisters();ReleaseUsedRegisters(saved);
  4590. Emit(Push(position, dst));
  4591. (* register dst has been freed before SaveRegisters already *)
  4592. Emit(Push(position, operand.op));
  4593. CallThis(position,"GarbageCollector","Assign",2);
  4594. RestoreRegisters(saved);
  4595. ELSE
  4596. Pass((operand.op));
  4597. END;
  4598. END;
  4599. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4600. Evaluate(expression,operand);
  4601. Pass((operand.op));
  4602. ELSE (* var parameter *)
  4603. Designate(expression,operand);
  4604. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4605. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4606. Pass((operand.tag));
  4607. END;
  4608. END;
  4609. Pass((operand.op));
  4610. END;
  4611. END;
  4612. (* TODO: needed? *)
  4613. arrayDestinationTag := oldArrayDestinationTag;
  4614. arrayDestinationDimension := oldArrayDestinationDimension;
  4615. IF needsParameterBackup THEN
  4616. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4617. ReuseCopy(parameterBackup, operand.op)
  4618. END;
  4619. ReleaseOperand(operand);
  4620. IF Trace THEN TraceExit("PushParameter") END;
  4621. END PushParameter;
  4622. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4623. VAR prevConditional: BOOLEAN;
  4624. BEGIN
  4625. prevConditional := conditional;
  4626. conditional := FALSE;
  4627. 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
  4628. Expression(x.result); (* use register *)
  4629. END;
  4630. Statement(x.statement);
  4631. conditional := prevConditional;
  4632. IF x.result # NIL THEN Expression(x.result) END;
  4633. 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
  4634. ReleaseIntermediateOperand(result.op);
  4635. END;
  4636. END VisitStatementDesignator;
  4637. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4638. VAR
  4639. procedure: SyntaxTree.Procedure;
  4640. procedureType: SyntaxTree.ProcedureType;
  4641. wasInline: BOOLEAN;
  4642. actualParameters: SyntaxTree.ExpressionList;
  4643. formalParameter: SyntaxTree.Parameter;
  4644. actualParameter: SyntaxTree.Expression;
  4645. i: LONGINT;
  4646. localVariable: SyntaxTree.Variable;
  4647. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4648. src, dest: Operand;
  4649. prevInlineExit : Label;
  4650. prevMapper: SymbolMapper;
  4651. tooComplex: BOOLEAN;
  4652. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4653. BEGIN
  4654. IF e = NIL THEN RETURN TRUE
  4655. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4656. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4657. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4658. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4659. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4660. ELSE RETURN FALSE
  4661. END;
  4662. END SimpleExpression;
  4663. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4664. BEGIN
  4665. RETURN checker.CanPassInRegister(type)
  4666. END FitsInRegister;
  4667. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4668. VAR
  4669. variable: SyntaxTree.Variable;
  4670. variableDesignator: SyntaxTree.Designator;
  4671. BEGIN
  4672. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4673. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4674. variableDesignator.SetType(type);
  4675. RETURN variableDesignator
  4676. END GetTemp;
  4677. BEGIN
  4678. wasInline := currentIsInline;
  4679. prevInlineExit := currentInlineExit;
  4680. prevMapper := currentMapper;
  4681. currentInlineExit := NewLabel();
  4682. tooComplex := FALSE;
  4683. NEW(currentMapper);
  4684. currentIsInline := TRUE;
  4685. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4686. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4687. formalParameter := procedureType.firstParameter;
  4688. actualParameters := x.parameters;
  4689. i := 0;
  4690. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4691. actualParameter := actualParameters.GetExpression(i);
  4692. IF actualParameter.resolved # NIL THEN
  4693. actualParameter := actualParameter.resolved
  4694. END;
  4695. (*
  4696. if expression is simple and can be passed immediately
  4697. or if type fits in register then we can proceed
  4698. otherwise we escape to ordinary procedure call.
  4699. *)
  4700. (* cases where the expression can be mapped identically *)
  4701. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4702. currentMapper.Add(formalParameter, actualParameter, NIL);
  4703. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4704. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4705. (*
  4706. Assign(variableDesignator, actualParameter);
  4707. *)
  4708. Evaluate(actualParameter, src);
  4709. Designate(variableDesignator, dest);
  4710. Emit(Mov(x.position, dest.op, src.op));
  4711. ReleaseOperand(dest);
  4712. ReleaseOperand(src);
  4713. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4714. ELSE tooComplex := TRUE
  4715. END;
  4716. (*
  4717. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4718. currentMapper.Add(formalParameter, actualParameter, NIL);
  4719. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4720. variableDesignator := GetTemp(system.addressType, FALSE);
  4721. Designate(actualParameter, src);
  4722. Designate(variableDesignator, dest);
  4723. IntermediateCode.MakeMemory(dest.op,addressType);
  4724. Emit(Mov(x.position, dest.op, src.op));
  4725. ReleaseOperand(dest);
  4726. IF src.tag.mode # IntermediateCode.Undefined THEN
  4727. tagDesignator := GetTemp(system.addressType, FALSE);
  4728. Designate(tagDesignator, dest);
  4729. IntermediateCode.MakeMemory(dest.op,addressType);
  4730. Emit(Mov(x.position, dest.op, src.op));
  4731. END;
  4732. ReleaseOperand(dest); ReleaseOperand(src);
  4733. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4734. END;
  4735. *)
  4736. formalParameter := formalParameter.nextParameter;
  4737. INC(i);
  4738. END;
  4739. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4740. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4741. currentMapper.Add(NIL, returnDesignator, NIL);
  4742. END;
  4743. localVariable := procedure.procedureScope.firstVariable;
  4744. WHILE ~tooComplex & (localVariable # NIL) DO
  4745. variableDesignator := GetTemp(localVariable.type, FALSE);
  4746. currentMapper.Add(localVariable, variableDesignator, NIL);
  4747. localVariable := localVariable.nextVariable;
  4748. END;
  4749. IF ~tooComplex THEN
  4750. VisitStatementBlock(procedure.procedureScope.body);
  4751. SetLabel(currentInlineExit);
  4752. IF procedureType.returnType # NIL THEN
  4753. Designate(returnDesignator, result);
  4754. IF conditional THEN
  4755. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4756. ValueToCondition(result)
  4757. END;
  4758. END;
  4759. END;
  4760. currentMapper := prevMapper;
  4761. currentInlineExit := prevInlineExit;
  4762. currentIsInline := wasInline;
  4763. RETURN ~tooComplex
  4764. END InlineProcedureCall;
  4765. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4766. VAR
  4767. parameters: SyntaxTree.ExpressionList;
  4768. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4769. designator: SyntaxTree.Designator;
  4770. procedureType: SyntaxTree.ProcedureType;
  4771. formalParameter: SyntaxTree.Parameter;
  4772. operand, returnValue: Operand;
  4773. reg, size, mask, dest: IntermediateCode.Operand;
  4774. saved: RegisterEntry;
  4775. symbol: SyntaxTree.Symbol;
  4776. variable: SyntaxTree.Variable;
  4777. i, parametersSize, returnTypeSize : LONGINT;
  4778. structuredReturnType: BOOLEAN;
  4779. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4780. tempVariableDesignator: SyntaxTree.Designator;
  4781. gap, alignment: LONGINT; (*fld*)
  4782. (* TODO: remove unnecessary backup variables *)
  4783. oldResult: Operand;
  4784. oldCurrentScope: SyntaxTree.Scope;
  4785. oldArrayDestinationTag: IntermediateCode.Operand;
  4786. oldArrayDestinationDimension: LONGINT;
  4787. oldConstantDeclaration: SyntaxTree.Symbol;
  4788. oldDestination: IntermediateCode.Operand;
  4789. oldCurrentLoop: Label;
  4790. oldConditional: BOOLEAN;
  4791. oldTrueLabel, oldFalseLabel: Label;
  4792. oldLocked: BOOLEAN;
  4793. usedRegisters,oldUsedRegisters: RegisterEntry;
  4794. return: IntermediateCode.Operand;
  4795. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4796. arg: IntermediateCode.Operand;
  4797. dummy: IntermediateCode.Operand;
  4798. recordType: SyntaxTree.RecordType;
  4799. operatorSelectionProcedureOperand: Operand;
  4800. operatorSelectionProcedure: SyntaxTree.Procedure;
  4801. fingerPrint: SyntaxTree.FingerPrint;
  4802. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4803. identifierNumber: LONGINT;
  4804. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4805. procedure: SyntaxTree.Procedure;
  4806. PROCEDURE BackupGlobalState;
  4807. BEGIN
  4808. oldResult := result;
  4809. oldCurrentScope := currentScope;
  4810. oldArrayDestinationTag := arrayDestinationTag;
  4811. oldArrayDestinationDimension := arrayDestinationDimension;
  4812. oldConstantDeclaration := constantDeclaration;
  4813. oldDestination := destination;
  4814. oldCurrentLoop := currentLoop;
  4815. oldConditional := conditional;
  4816. oldTrueLabel := trueLabel;
  4817. oldFalseLabel := falseLabel;
  4818. oldLocked := locked;
  4819. oldUsedRegisters := usedRegisters
  4820. END BackupGlobalState;
  4821. PROCEDURE RestoreGlobalState;
  4822. BEGIN
  4823. result := oldResult;
  4824. currentScope := oldCurrentScope;
  4825. arrayDestinationTag := oldArrayDestinationTag;
  4826. arrayDestinationDimension := oldArrayDestinationDimension;
  4827. constantDeclaration := oldConstantDeclaration;
  4828. destination := oldDestination;
  4829. currentLoop := oldCurrentLoop;
  4830. conditional := oldConditional;
  4831. trueLabel := oldTrueLabel;
  4832. falseLabel := oldFalseLabel;
  4833. locked := oldLocked;
  4834. usedRegisters := oldUsedRegisters
  4835. END RestoreGlobalState;
  4836. (** do preparations before parameter push for array-structured object types (ASOTs):
  4837. if ASOT is passed as VAR parameter:
  4838. - allocate temporary variable of math array type
  4839. - copy contents of ASOT to be passed to temporary variable
  4840. - use temporary variable as the actual parameter instead
  4841. - 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)
  4842. **)
  4843. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4844. VAR
  4845. expression: SyntaxTree.Expression;
  4846. BEGIN
  4847. IF actualParameter IS SyntaxTree.Designator THEN
  4848. designator := actualParameter(SyntaxTree.Designator);
  4849. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4850. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4851. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4852. ASSERT(checker # NIL);
  4853. checker.SetCurrentScope(currentScope);
  4854. (* allocate temporary variable *)
  4855. ASSERT(actualParameter.type # NIL);
  4856. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4857. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4858. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4859. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4860. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4861. ASSERT(tempVariableDesignator.type # NIL);
  4862. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4863. (* copy math array stored in actual parameter to temporary variable *)
  4864. BackupGlobalState;
  4865. AssignMathArray(tempVariableDesignator, actualParameter);
  4866. RestoreGlobalState;
  4867. (* use temporary variable as actual parameter instead of the original one *)
  4868. actualParameter := tempVariableDesignator;
  4869. (* create write-back call and store it in linked list *)
  4870. (* create new list entry *)
  4871. IF firstWriteBackCall = NIL THEN
  4872. NEW(firstWriteBackCall);
  4873. currentWriteBackCall := firstWriteBackCall
  4874. ELSE
  4875. ASSERT(currentWriteBackCall # NIL);
  4876. NEW(currentWriteBackCall.next);
  4877. currentWriteBackCall := currentWriteBackCall.next
  4878. END;
  4879. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4880. ASSERT(expression.type = NIL);
  4881. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4882. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4883. (* prepare writeback for any other "normal" indexer *)
  4884. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4885. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4886. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4887. Assign(tempVariableDesignator, actualParameter);
  4888. actualParameter := tempVariableDesignator;
  4889. IF firstWriteBackCall = NIL THEN
  4890. NEW(firstWriteBackCall);
  4891. currentWriteBackCall := firstWriteBackCall
  4892. ELSE
  4893. ASSERT(currentWriteBackCall # NIL);
  4894. NEW(currentWriteBackCall.next);
  4895. currentWriteBackCall := currentWriteBackCall.next
  4896. END;
  4897. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4898. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4899. END
  4900. END
  4901. END PrepareParameter;
  4902. BEGIN
  4903. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4904. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4905. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4906. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4907. IF InlineProcedureCall(x) THEN
  4908. RETURN
  4909. ELSE
  4910. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4911. END
  4912. END;
  4913. END;
  4914. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4915. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4916. dest := destination; destination := emptyOperand;
  4917. SaveRegisters();ReleaseUsedRegisters(saved);
  4918. parameters := x.parameters;
  4919. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4920. (* an operator is called *)
  4921. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4922. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4923. (* check if a dynamic operator call should be performed *)
  4924. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4925. ELSE
  4926. isCallOfDynamicOperator := FALSE
  4927. END;
  4928. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4929. Emit(Push(position, ap));
  4930. END;
  4931. alignment := procedureType.stackAlignment;
  4932. IF alignment > 1 THEN
  4933. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4934. Emit(Mov(position,reg, sp));
  4935. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4936. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4937. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4938. Emit(And(position,sp, sp, mask));
  4939. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4940. Emit(Push(position,reg));
  4941. (*
  4942. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4943. Emit(Mov(position,mem,reg));
  4944. *)
  4945. ReleaseIntermediateOperand(reg);
  4946. END;
  4947. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4948. IntermediateCode.InitImmediate(mask,addressType,-16);
  4949. Emit(And(position,sp, sp, mask));
  4950. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4951. IF gap # 0 THEN
  4952. IntermediateCode.InitImmediate(size,addressType,gap);
  4953. Emit(Sub(position,sp,sp,size))
  4954. END;
  4955. END;
  4956. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4957. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4958. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4959. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4960. ELSE
  4961. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4962. END;
  4963. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4964. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  4965. (* push ID *)
  4966. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4967. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  4968. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  4969. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  4970. formalParameter := procedureType.firstParameter;
  4971. FOR i := 0 TO parameters.Length() - 1 DO
  4972. IF formalParameter.access # SyntaxTree.Hidden THEN
  4973. ASSERT(i < 2);
  4974. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  4975. (* push pointer *)
  4976. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4977. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  4978. (* add dereference *)
  4979. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4980. ReleaseIntermediateOperand(parameterBackups[i]);
  4981. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  4982. END;
  4983. Emit(Push(position,parameterBackups[i]));
  4984. ReleaseIntermediateOperand(parameterBackups[i]);
  4985. (* push typetag *)
  4986. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4987. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  4988. arg := TypeDescriptorAdr(recordType);
  4989. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  4990. Emit(Push(position,arg));
  4991. ELSE
  4992. (* push 'NonPointer' *)
  4993. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4994. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4995. (* push fingerprint *)
  4996. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4997. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  4998. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  4999. END
  5000. END;
  5001. formalParameter := formalParameter.nextParameter
  5002. END;
  5003. (* for unary operators: complete the information for the second parameter *)
  5004. IF procedureType.numberParameters < 2 THEN
  5005. (* push 'NonPointer' *)
  5006. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5007. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5008. (* push 'NoType' *)
  5009. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5010. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5011. END;
  5012. (* call operator selection procedure *)
  5013. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5014. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5015. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5016. ReleaseOperand(operatorSelectionProcedureOperand);
  5017. (* use the address that the operator selection procedure returned as the target address of the call *)
  5018. InitOperand(operand, ModeValue);
  5019. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5020. Emit(Result(position,operand.op))
  5021. END
  5022. ELSE
  5023. Evaluate(x.left, operand)
  5024. END;
  5025. IF symbol IS SyntaxTree.Procedure THEN
  5026. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5027. Emit(Push(position,operand.tag));
  5028. ELSIF (procedureType.isDelegate) THEN
  5029. Emit(Push(position,operand.tag));
  5030. END;
  5031. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5032. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5033. Emit(Push(position,operand.tag));
  5034. END;
  5035. ELSE HALT(200);
  5036. END;
  5037. ReleaseIntermediateOperand(operand.tag);
  5038. operand.tag := emptyOperand;
  5039. (* determine if a structured return type is needed *)
  5040. structuredReturnType := StructuredReturnType(procedureType);
  5041. IF structuredReturnType THEN
  5042. IF resultDesignator # NIL THEN
  5043. d := resultDesignator;
  5044. ELSE
  5045. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  5046. variable.SetUntraced(procedureType.hasUntracedReturn);
  5047. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  5048. d.SetType(variable.type);
  5049. END;
  5050. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5051. Designate(d,returnValue);
  5052. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5053. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5054. Emit(Push(position,size));
  5055. Emit(Push(position,returnValue.op));
  5056. ReleaseOperand(returnValue);
  5057. ELSE
  5058. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5059. END;
  5060. END;
  5061. firstWriteBackCall := NIL; (* reset write-back call list *)
  5062. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5063. passByRegister := system.registerParameters > 0;
  5064. registerNumber := 0;
  5065. formalParameter := procedureType.lastParameter;
  5066. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5067. actualParameter := parameters.GetExpression(i);
  5068. PrepareParameter(actualParameter, formalParameter);
  5069. IF passByRegister & (i < system.registerParameters) THEN
  5070. IF ~PassInRegister(formalParameter) THEN
  5071. Error(actualParameter.position,"cannot be passed by register")
  5072. ELSE
  5073. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  5074. END;
  5075. INC(registerNumber);
  5076. ELSE
  5077. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5078. END;
  5079. formalParameter := formalParameter.prevParameter;
  5080. END;
  5081. IF passByRegister & (registerNumber > 0) THEN
  5082. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5083. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5084. END;
  5085. ELSE
  5086. hasDynamicOperands := FALSE;
  5087. formalParameter := procedureType.firstParameter;
  5088. FOR i := 0 TO parameters.Length() - 1 DO
  5089. actualParameter := parameters.GetExpression(i);
  5090. IF formalParameter # NIL THEN (* TENTATIVE *)
  5091. PrepareParameter(actualParameter, formalParameter);
  5092. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5093. ASSERT(i < 2);
  5094. hasDynamicOperands := TRUE;
  5095. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5096. ELSE
  5097. IF passByRegister & (registerNumber > 0) THEN
  5098. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5099. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5100. END;
  5101. passByRegister := FALSE;
  5102. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5103. END;
  5104. formalParameter := formalParameter.nextParameter;
  5105. END;
  5106. END;
  5107. END;
  5108. IF symbol IS SyntaxTree.Procedure THEN
  5109. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5110. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5111. Emit(Push(position,reg));
  5112. ReleaseIntermediateOperand(reg);
  5113. END;
  5114. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5115. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5116. parametersSize := ParametersSize(system,procedureType,FALSE);
  5117. END;
  5118. ReleaseParameterRegisters();
  5119. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  5120. Emit(Call(position,operand.op,0));
  5121. ELSE
  5122. Emit(Call(position,operand.op,parametersSize));
  5123. END;
  5124. ReleaseOperand(operand);
  5125. IF procedureType.noReturn THEN
  5126. EmitTrap(position,NoReturnTrap);
  5127. END;
  5128. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5129. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5130. Emit(Result(position,return));
  5131. END;
  5132. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  5133. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  5134. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5135. END;
  5136. size := IntermediateCode.Immediate(addressType,parametersSize);
  5137. Emit(Add(position,sp,sp,size));
  5138. END;
  5139. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5140. IF structuredReturnType THEN
  5141. (* stack pointer rewinding done by callee
  5142. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5143. Emit(Add(position,sp,sp,size));
  5144. *)
  5145. RestoreRegisters(saved);
  5146. InitOperand(result,ModeReference);
  5147. Symbol(variable,result);
  5148. ELSE
  5149. RestoreRegisters(saved);
  5150. InitOperand(result,ModeValue);
  5151. result.op := return;
  5152. END;
  5153. END;
  5154. IF alignment > 1 THEN
  5155. Emit(Pop(position,sp));
  5156. END;
  5157. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5158. Emit(Pop(position, ap));
  5159. END;
  5160. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5161. ValueToCondition(result);
  5162. END;
  5163. destination := dest;
  5164. (* perform all write-back calls in the list *)
  5165. BackupGlobalState;
  5166. currentWriteBackCall := firstWriteBackCall;
  5167. WHILE currentWriteBackCall # NIL DO
  5168. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5169. currentWriteBackCall := currentWriteBackCall.next
  5170. END;
  5171. RestoreGlobalState;
  5172. (* TENATIVE *)
  5173. (*
  5174. IF isOperatorCall THEN
  5175. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5176. END;
  5177. *)
  5178. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5179. END VisitProcedureCallDesignator;
  5180. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5181. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5182. td: SyntaxTree.Symbol;
  5183. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5184. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5185. BEGIN
  5186. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5187. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5188. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5189. variable.SetType(system.anyType);
  5190. scope.AddVariable(variable);
  5191. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5192. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5193. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5194. typeDeclaration.SetScope(module.module.moduleScope);
  5195. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5196. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5197. END;
  5198. RETURN hiddenPointerType;
  5199. END GetHiddenPointerType;
  5200. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5201. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5202. BEGIN
  5203. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5204. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5205. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5206. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5207. scope.AddVariable(variable);
  5208. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5209. variable.SetType(system.anyType);
  5210. scope.AddVariable(variable);
  5211. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5212. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5213. typeDeclaration.SetDeclaredType(delegatePointerType);
  5214. typeDeclaration.SetScope(module.module.moduleScope);
  5215. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5216. delegatePointerType.SetState(SyntaxTree.Resolved);
  5217. END;
  5218. RETURN delegatePointerType
  5219. END GetDelegateType;
  5220. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5221. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5222. such as in VAR a: RECORD ... END;
  5223. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5224. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5225. *)
  5226. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5227. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5228. BEGIN (* no code emission *)
  5229. source := NIL;
  5230. x := x.resolved;
  5231. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5232. x := GetHiddenPointerType();
  5233. ELSIF IsDelegate(x) THEN
  5234. x := GetDelegateType();
  5235. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5236. ELSE HALT(200);
  5237. END;
  5238. td := x.typeDeclaration;
  5239. IF td = NIL THEN
  5240. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5241. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5242. ASSERT(td # NIL);
  5243. END;
  5244. IF newObjectFile THEN
  5245. GetCodeSectionNameForSymbol(td,name);
  5246. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5247. meta.CheckTypeDeclaration(x);
  5248. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5249. ELSE
  5250. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5251. END;
  5252. IF backend.cooperative OR meta.simple THEN
  5253. offset := 0;
  5254. ELSE
  5255. IF x IS SyntaxTree.CellType THEN
  5256. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5257. IF baseRecord = NIL THEN
  5258. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5259. ELSE
  5260. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5261. END;
  5262. ELSE
  5263. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5264. END;
  5265. END;
  5266. ELSE
  5267. offset := 0;
  5268. source := module.allSections.FindBySymbol(td); (*TODO*)
  5269. IF source = NIL THEN
  5270. null := 0;
  5271. GetCodeSectionNameForSymbol(td,name);
  5272. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5273. IntermediateCode.InitImmediate(op,addressType,0);
  5274. source(IntermediateCode.Section).Emit(Data(position,op));
  5275. source.SetReferenced(FALSE)
  5276. ELSE
  5277. name := source.name;
  5278. END;
  5279. END;
  5280. RETURN td
  5281. END GetBackendType;
  5282. BEGIN
  5283. (*td := t.typeDeclaration;*)
  5284. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5285. (*
  5286. IF t IS SyntaxTree.PointerType THEN
  5287. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5288. ELSE
  5289. source := GetBackendType(t);
  5290. END;
  5291. *)
  5292. IF newObjectFile THEN
  5293. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5294. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5295. IntermediateCode.SetOffset(res,offset);
  5296. ELSE
  5297. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5298. END;
  5299. (*
  5300. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5301. make memory should be used when tag is used, not earlier
  5302. *)
  5303. RETURN res
  5304. END TypeDescriptorAdr;
  5305. (*
  5306. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5307. VAR result: IntermediateCode.Operand;
  5308. BEGIN
  5309. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5310. operand.tag := TypeDescriptorAdr(operand.type);
  5311. IntermediateCode.MakeMemory(operand.tag,addressType);
  5312. UseIntermediateOperand(operand.tag);
  5313. END;
  5314. END MakeTypeTag;
  5315. *)
  5316. PROCEDURE ProfilerInit;
  5317. VAR reg: IntermediateCode.Operand;
  5318. BEGIN
  5319. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5320. Emit(Call(position,reg,0));
  5321. END ProfilerInit;
  5322. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5323. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5324. BEGIN
  5325. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5326. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5327. THEN
  5328. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5329. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5330. Emit(Push(position,reg));
  5331. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5332. Emit(Push(position,reg));
  5333. StaticCallOperand(result,procedure);
  5334. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5335. ReleaseOperand(result);
  5336. END;
  5337. END ProfilerEnterExit;
  5338. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5339. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5340. BEGIN
  5341. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5342. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5343. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5344. profileInit.Emit(Push(position,reg));
  5345. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5346. profileInit.Emit(Push(position,reg));
  5347. NEW(string, LEN(name)); COPY(name, string^);
  5348. sv := SyntaxTree.NewStringValue(-1,string);
  5349. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5350. sv.SetType(type);
  5351. Designate(sv,result);
  5352. profileInit.Emit(Push(position,result.tag));
  5353. profileInit.Emit(Push(position,result.op));
  5354. StaticCallOperand(result,procedure);
  5355. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5356. ReleaseOperand(result);
  5357. END;
  5358. END ProfilerAddProcedure;
  5359. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5360. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5361. BEGIN
  5362. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5363. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5364. profileInit.Emit(Push(position,reg));
  5365. profileInitPatchPosition := profileInit.pc;
  5366. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5367. NEW(string, LEN(name)); COPY(name, string^);
  5368. sv := SyntaxTree.NewStringValue(-1,string);
  5369. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5370. sv.SetType(type);
  5371. Designate(sv,result);
  5372. profileInit.Emit(Push(position,result.tag));
  5373. profileInit.Emit(Push(position,result.op));
  5374. StaticCallOperand(result,procedure);
  5375. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5376. ReleaseOperand(result);
  5377. END;
  5378. END ProfilerAddModule;
  5379. PROCEDURE ProfilerPatchInit;
  5380. VAR reg: IntermediateCode.Operand;
  5381. BEGIN
  5382. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5383. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5384. EmitLeave(profileInit,position,0);
  5385. profileInit.Emit(Exit(position,0,0));
  5386. END ProfilerPatchInit;
  5387. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5388. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5389. VAR
  5390. id: LONGINT;
  5391. leftType, rightType: SyntaxTree.Type;
  5392. procedureType: SyntaxTree.ProcedureType;
  5393. runtimeProcedure: SyntaxTree.Procedure;
  5394. runtimeProcedureOperand, operatorOperand: Operand;
  5395. kind: SET;
  5396. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5397. VAR
  5398. arg: IntermediateCode.Operand;
  5399. recordType: SyntaxTree.RecordType;
  5400. fingerPrint: SyntaxTree.FingerPrint;
  5401. BEGIN
  5402. IF type = NIL THEN
  5403. (* no type: push 'NoType' *)
  5404. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5405. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5406. ELSIF IsStrictlyPointerToRecord(type) THEN
  5407. (* pointer to record type: push typetag *)
  5408. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5409. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5410. arg := TypeDescriptorAdr(recordType);
  5411. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5412. ELSE
  5413. (* non-pointer to record type: push fingerprint *)
  5414. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5415. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5416. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5417. END;
  5418. operatorInitializationCodeSection.Emit(Push(position,arg))
  5419. END PushTypeInfo;
  5420. BEGIN
  5421. ASSERT(operatorInitializationCodeSection # NIL);
  5422. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5423. procedureType := operator.type(SyntaxTree.ProcedureType);
  5424. (* determine types *)
  5425. leftType := procedureType.firstParameter.type;
  5426. IF procedureType.numberParameters = 2 THEN
  5427. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5428. rightType := procedureType.firstParameter.nextParameter.type;
  5429. ELSE
  5430. rightType := NIL
  5431. END;
  5432. (* determine operator kind *)
  5433. IF IsStrictlyPointerToRecord(leftType) THEN
  5434. kind := {LhsIsPointer}
  5435. ELSE
  5436. kind := {}
  5437. END;
  5438. IF IsStrictlyPointerToRecord(rightType) THEN
  5439. kind := kind + {RhsIsPointer}
  5440. END;
  5441. IF kind # {} THEN (* TODO: to be removed later on *)
  5442. (* at least one of the types is a pointer to record *)
  5443. (* emit a code that registers this specific operator in the runtime *)
  5444. dump := operatorInitializationCodeSection.comments;
  5445. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5446. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5447. (* push ID *)
  5448. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5449. id := Global.GetSymbol(module.module.case, operator.name);
  5450. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5451. (* push kind *)
  5452. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5453. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5454. (* push type infos *)
  5455. PushTypeInfo(leftType);
  5456. PushTypeInfo(rightType);
  5457. (* push operator address *)
  5458. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5459. StaticCallOperand(operatorOperand, operator);
  5460. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5461. ReleaseOperand(operatorOperand);
  5462. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5463. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5464. ReleaseOperand(runtimeProcedureOperand)
  5465. END
  5466. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5467. END
  5468. END RegisterDynamicOperator;
  5469. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5470. VAR
  5471. traceModule: SyntaxTree.Module;
  5472. procedure: SyntaxTree.Procedure;
  5473. procedureVariable: SyntaxTree.Variable;
  5474. s,msg: Basic.MessageString;
  5475. res: Operand;
  5476. i: LONGINT;
  5477. sv: SyntaxTree.StringValue;
  5478. type: SyntaxTree.Type;
  5479. recordType: SyntaxTree.RecordType;
  5480. printout: Printout.Printer;
  5481. stringWriter: Streams.StringWriter;
  5482. expression: SyntaxTree.Expression;
  5483. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5484. BEGIN
  5485. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5486. IF procedure = NIL THEN
  5487. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5488. END;
  5489. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5490. s := "procedure ";
  5491. Strings.Append(s,backend.traceModuleName);
  5492. Strings.Append(s,".");
  5493. Strings.Append(s,procedureName);
  5494. Strings.Append(s," not present");
  5495. Error(position,s);
  5496. RETURN FALSE
  5497. ELSE
  5498. RETURN TRUE
  5499. END;
  5500. END GetProcedure;
  5501. PROCEDURE CallProcedure;
  5502. VAR size: LONGINT;
  5503. BEGIN
  5504. IF procedure # NIL THEN
  5505. StaticCallOperand(result,procedure);
  5506. size := ProcedureParametersSize(system,procedure);
  5507. ELSE
  5508. Symbol(procedureVariable, result);
  5509. LoadValue(result, procedureVariable.type.resolved);
  5510. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5511. END;
  5512. Emit(Call(position,result.op,size));
  5513. END CallProcedure;
  5514. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5515. VAR res: Operand; string: SyntaxTree.String;
  5516. BEGIN
  5517. IF GetProcedure("String") THEN
  5518. NEW(string, LEN(s)); COPY(s, string^);
  5519. sv := SyntaxTree.NewStringValue(-1,string);
  5520. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5521. sv.SetType(type);
  5522. Designate(sv,res);
  5523. Emit(Push(position,res.tag));
  5524. Emit(Push(position,res.op));
  5525. ReleaseOperand(res);
  5526. CallProcedure;
  5527. END;
  5528. END String;
  5529. PROCEDURE Integer(op: IntermediateCode.Operand);
  5530. BEGIN
  5531. IF GetProcedure("Int") THEN
  5532. Emit(Push(position,op));
  5533. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5534. CallProcedure;
  5535. END;
  5536. END Integer;
  5537. PROCEDURE Float(op: IntermediateCode.Operand);
  5538. BEGIN
  5539. IF GetProcedure("HIntHex") THEN
  5540. Emit(Push(position,op));
  5541. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5542. CallProcedure;
  5543. END;
  5544. END Float;
  5545. PROCEDURE Set(op: IntermediateCode.Operand);
  5546. BEGIN
  5547. IF GetProcedure("Set") THEN
  5548. Emit(Push(position,op));
  5549. (*
  5550. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5551. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5552. *)
  5553. CallProcedure;
  5554. END;
  5555. END Set;
  5556. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5557. BEGIN
  5558. IF GetProcedure("Boolean") THEN
  5559. Emit(Push(position,op));
  5560. CallProcedure;
  5561. END;
  5562. END Boolean;
  5563. PROCEDURE Char(op: IntermediateCode.Operand);
  5564. BEGIN
  5565. IF GetProcedure("Char") THEN
  5566. Emit(Push(position,op));
  5567. CallProcedure;
  5568. END;
  5569. END Char;
  5570. PROCEDURE Address(op: IntermediateCode.Operand);
  5571. BEGIN
  5572. IF GetProcedure("Address") THEN
  5573. Emit(Push(position,op));
  5574. CallProcedure;
  5575. END;
  5576. END Address;
  5577. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5578. BEGIN
  5579. IF GetProcedure("String") THEN
  5580. Emit(Push(position,tag));
  5581. Emit(Push(position,op));
  5582. CallProcedure;
  5583. END;
  5584. END StringOperand;
  5585. PROCEDURE Ln;
  5586. BEGIN
  5587. IF GetProcedure("Ln") THEN
  5588. CallProcedure;
  5589. END;
  5590. END Ln;
  5591. BEGIN
  5592. IF backend.traceModuleName = "" THEN RETURN END;
  5593. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5594. IF GetProcedure("Enter") THEN
  5595. CallProcedure
  5596. END;
  5597. NEW(stringWriter,LEN(s));
  5598. FOR i := 0 TO x.Length()-1 DO
  5599. msg := "";
  5600. expression := x.GetExpression(i);
  5601. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5602. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5603. ELSE
  5604. Global.GetModuleName(module.module, s);
  5605. END;
  5606. IF i = 0 THEN
  5607. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5608. stringWriter.String(":");
  5609. END;
  5610. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5611. IF ~(expression IS SyntaxTree.StringValue) THEN
  5612. printout.Expression(expression);
  5613. stringWriter.Get(s);
  5614. Strings.Append(msg,s);
  5615. Strings.Append(msg,"= ");
  5616. ELSE stringWriter.Get(s); (* remove from string writer *)
  5617. Strings.Append(msg, s);
  5618. END;
  5619. String(msg);
  5620. IF SemanticChecker.IsStringType(expression.type) THEN
  5621. Designate(expression,res);
  5622. StringOperand(res.op,res.tag);
  5623. ELSE
  5624. Evaluate(expression,res);
  5625. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5626. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5627. Convert(res.op,int64);
  5628. END;
  5629. Integer(res.op);
  5630. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5631. Boolean(res.op);
  5632. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5633. Set(res.op);
  5634. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5635. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5636. Convert(res.op,float64);
  5637. END;
  5638. Float(res.op);
  5639. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5640. Char(res.op);
  5641. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5642. Address(res.op);String("H");
  5643. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5644. Address(res.op);String("H");
  5645. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5646. Address(res.op);String("H");
  5647. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5648. Address(res.op);String("H");
  5649. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5650. String("NIL");
  5651. ELSE HALT(200);
  5652. END;
  5653. END;
  5654. ReleaseOperand(res);
  5655. String("; ");
  5656. END;
  5657. IF GetProcedure("Exit") THEN
  5658. CallProcedure
  5659. ELSE
  5660. Ln;
  5661. END;
  5662. END;
  5663. END SystemTrace;
  5664. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5665. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5666. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5667. BEGIN
  5668. type := type.resolved;
  5669. IF type IS SyntaxTree.RecordType THEN
  5670. WITH type: SyntaxTree.RecordType DO
  5671. baseType := type.baseType;
  5672. IF baseType # NIL THEN
  5673. baseType := baseType.resolved;
  5674. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5675. InitFields(baseType,adr,offset);
  5676. END;
  5677. variable := type.recordScope.firstVariable;
  5678. WHILE variable # NIL DO
  5679. IF variable.initializer # NIL THEN
  5680. Evaluate(variable.initializer,initializerOp);
  5681. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5682. Emit(Mov(position,mem,initializerOp.op));
  5683. ReleaseOperand(initializerOp);
  5684. ReleaseIntermediateOperand(mem);
  5685. END;
  5686. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5687. variable := variable.nextVariable
  5688. END;
  5689. END;
  5690. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5691. WITH type: SyntaxTree.ArrayType DO
  5692. IF type.form = SyntaxTree.Static THEN
  5693. baseType := type.arrayBase;
  5694. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5695. FOR i := 0 TO type.staticLength-1 DO
  5696. InitFields(baseType,adr,offset+i*size);
  5697. END;
  5698. END;
  5699. END;
  5700. ELSIF type IS SyntaxTree.MathArrayType THEN
  5701. WITH type: SyntaxTree.MathArrayType DO
  5702. IF type.form = SyntaxTree.Open THEN
  5703. dim := DynamicDim(type);
  5704. imm := IntermediateCode.Immediate(addressType,dim);
  5705. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5706. baseType := SemanticChecker.ArrayBase(type,dim);
  5707. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5708. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5709. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5710. ReleaseIntermediateOperand(imm);
  5711. (* flags remain empty (=0) for open array *)
  5712. ELSIF type.form = SyntaxTree.Static THEN
  5713. baseType := type.arrayBase;
  5714. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5715. ASSERT(type.staticLength < 1024*1024*1024);
  5716. FOR i := 0 TO type.staticLength-1 DO
  5717. InitFields(baseType,adr,offset+i*size);
  5718. END;
  5719. END;
  5720. END;
  5721. END;
  5722. END InitFields;
  5723. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5724. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5725. BEGIN
  5726. type := variable.type.resolved;
  5727. IF (type IS SyntaxTree.MathArrayType) THEN
  5728. WITH type: SyntaxTree.MathArrayType DO
  5729. IF type.form = SyntaxTree.Open THEN
  5730. Symbol(variable,operand);
  5731. InitFields(type, operand.tag,0);
  5732. ELSIF type.form = SyntaxTree.Tensor THEN
  5733. Symbol(variable, operand);
  5734. MakeMemory(tmp,operand.op,addressType,0);
  5735. ReleaseOperand(operand);
  5736. Emit(Mov(position,tmp, nil ) );
  5737. ReleaseIntermediateOperand(tmp);
  5738. END;
  5739. END;
  5740. ELSE
  5741. Symbol(variable,operand);
  5742. IF variable.initializer # NIL THEN
  5743. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5744. reference.SetType(variable.type.resolved);
  5745. reference.SetAssignable(TRUE);
  5746. Assign(reference,variable.initializer);
  5747. END;
  5748. InitFields(type, operand.op,0);
  5749. ReleaseOperand(operand);
  5750. END;
  5751. END InitVariable;
  5752. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5753. VAR end: Label;
  5754. BEGIN
  5755. IF type.form = SyntaxTree.Tensor THEN
  5756. InitOperand(result,ModeValue);
  5757. ReuseCopy(result.op,base);
  5758. end := NewLabel();
  5759. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5760. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5761. SetLabel(end);
  5762. Convert(result.op,int32);
  5763. ELSE
  5764. InitOperand(result,ModeValue);
  5765. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5766. END
  5767. END MathArrayDim;
  5768. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5769. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5770. BEGIN
  5771. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5772. MakeMemory(mem,base,addressType,offset);
  5773. Emit(Mov(position,mem,value));
  5774. ReleaseIntermediateOperand(mem);
  5775. END PutMathArrayField;
  5776. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5777. VAR mem: IntermediateCode.Operand;
  5778. BEGIN
  5779. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5780. MakeMemory(mem,base,addressType,offset);
  5781. Emit(Mov(position,mem,value));
  5782. ReleaseIntermediateOperand(mem);
  5783. END PutMathArrayFieldOffset;
  5784. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5785. BEGIN
  5786. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5787. MakeMemory(value,base,addressType,offset);
  5788. END GetMathArrayField;
  5789. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5790. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5791. BEGIN
  5792. IF incr THEN
  5793. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5794. ELSE
  5795. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5796. END;
  5797. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5798. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5799. ELSE
  5800. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5801. Emit(Mov(position,reg,dim));
  5802. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5803. Emit(Add(position,reg,reg,base));
  5804. MakeMemory(mem, reg, addressType, offset);
  5805. ReleaseIntermediateOperand(reg);
  5806. Emit(Mov(position,mem,value));
  5807. ReleaseIntermediateOperand(mem);
  5808. END;
  5809. END PutMathArrayLenOrIncr;
  5810. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5811. BEGIN
  5812. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5813. END PutMathArrayLength;
  5814. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5815. BEGIN
  5816. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5817. END PutMathArrayIncrement;
  5818. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5819. BEGIN
  5820. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5821. END GetMathArrayIncrement;
  5822. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5823. BEGIN
  5824. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5825. END GetMathArrayLength;
  5826. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5827. VAR dimOp: IntermediateCode.Operand;
  5828. BEGIN
  5829. dimOp := IntermediateCode.Immediate(int32, dim);
  5830. GetMathArrayLength(type, operand, dimOp, check, result);
  5831. END GetMathArrayLengthAt;
  5832. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5833. VAR dimOp: IntermediateCode.Operand;
  5834. BEGIN
  5835. dimOp := IntermediateCode.Immediate(int32, dim);
  5836. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5837. END GetMathArrayIncrementAt;
  5838. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5839. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5840. offset: LONGINT;
  5841. BEGIN
  5842. IF increment THEN
  5843. offset := MathIncrOffset;
  5844. ELSE
  5845. offset := MathLenOffset;
  5846. END;
  5847. INC(offset,operand.dimOffset*2);
  5848. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5849. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5850. END;
  5851. (* static dimension *)
  5852. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5853. IF check & (type.form = SyntaxTree.Tensor) THEN
  5854. DimensionCheck(operand.tag,dim,BrltL);
  5855. END;
  5856. val := SHORT(dim.intValue);
  5857. IF type.form # SyntaxTree.Tensor THEN
  5858. t := SemanticChecker.ArrayBase(type,val);
  5859. type := t.resolved(SyntaxTree.MathArrayType);
  5860. IF type.form = SyntaxTree.Static THEN
  5861. IF increment THEN
  5862. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5863. ELSE
  5864. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5865. END;
  5866. InitOperand(result,ModeValue);
  5867. result.op := res;
  5868. RETURN;
  5869. END;
  5870. END;
  5871. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5872. MakeMemory(res,operand.tag,addressType,offset);
  5873. (*
  5874. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5875. *)
  5876. InitOperand(result,ModeValue);
  5877. result.op := res;
  5878. ELSE
  5879. Convert(dim,addressType);
  5880. IF check THEN
  5881. IF type.form = SyntaxTree.Tensor THEN
  5882. DimensionCheck(operand.tag,dim,BrltL);
  5883. ELSIF isUnchecked THEN (* do nothing *)
  5884. ELSE
  5885. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5886. END;
  5887. END;
  5888. end := NewLabel(); next := NIL;
  5889. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5890. Emit(Mov(position,res,dim));
  5891. Convert(res,int32);
  5892. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5893. WHILE t IS SyntaxTree.MathArrayType DO
  5894. type := t(SyntaxTree.MathArrayType);
  5895. IF type.form = SyntaxTree.Static THEN
  5896. imm := IntermediateCode.Immediate(int32,val);
  5897. next := NewLabel();
  5898. BrneL(next,imm,res);
  5899. IF increment THEN
  5900. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5901. ELSE
  5902. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5903. END;
  5904. Emit(MovReplace(position,res,imm));
  5905. BrL(end);
  5906. ELSE hasDynamicPart := TRUE;
  5907. END;
  5908. t := type.arrayBase.resolved;
  5909. val := val + 1;
  5910. IF next # NIL THEN SetLabel(next) END;
  5911. END;
  5912. IF hasDynamicPart THEN
  5913. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5914. Emit(Mov(position,res2,dim));
  5915. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5916. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5917. Emit(Add(position,res2,res2,imm));
  5918. Emit(Add(position,res2,res2,operand.tag));
  5919. IntermediateCode.MakeMemory(res2,int32);
  5920. Emit(MovReplace(position,res,res2));
  5921. ReleaseIntermediateOperand(res2);
  5922. END;
  5923. SetLabel(end);
  5924. Convert(res,int32);
  5925. InitOperand(result,ModeValue);
  5926. result.op := res;
  5927. END;
  5928. END MathArrayLenOrIncr;
  5929. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5930. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5931. offset: LONGINT;
  5932. BEGIN
  5933. offset := operand.dimOffset+DynamicDim(type)-1;
  5934. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5935. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5936. val := SHORT(dim.intValue);
  5937. t := SemanticChecker.ArrayBase(type,val);
  5938. type := t.resolved(SyntaxTree.ArrayType);
  5939. IF type.form = SyntaxTree.Static THEN
  5940. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5941. ELSE
  5942. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5943. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5944. END;
  5945. UseIntermediateOperand(res);
  5946. InitOperand(result,ModeValue);
  5947. result.op := res;
  5948. ELSE
  5949. Convert(dim,addressType);
  5950. IF ~isUnchecked THEN
  5951. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5952. END;
  5953. end := NewLabel(); next := NIL;
  5954. (* ReuseCopy(dim,res); *)
  5955. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5956. Emit(Mov(position,res,dim));
  5957. Convert(res,int32);
  5958. Convert(res,int32);
  5959. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5960. WHILE t IS SyntaxTree.ArrayType DO
  5961. type := t(SyntaxTree.ArrayType);
  5962. IF type.form = SyntaxTree.Static THEN
  5963. imm := IntermediateCode.Immediate(int32,val);
  5964. next := NewLabel();
  5965. BrneL(next,imm,res);
  5966. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5967. Emit(MovReplace(position,res,imm));
  5968. BrL(end);
  5969. ELSE hasDynamicPart := TRUE;
  5970. END;
  5971. t := type.arrayBase.resolved;
  5972. val := val + 1;
  5973. IF next # NIL THEN SetLabel(next) END;
  5974. END;
  5975. IF hasDynamicPart THEN
  5976. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  5977. Convert(res2,addressType);
  5978. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  5979. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5980. Emit(Sub(position,res2,imm,res2));
  5981. Emit(Add(position,res2,res2,operand.tag));
  5982. IntermediateCode.MakeMemory(res2,int32);
  5983. Emit(MovReplace(position,res,res2));
  5984. ReleaseIntermediateOperand(res2);
  5985. END;
  5986. SetLabel(end);
  5987. Convert(res,int32);
  5988. InitOperand(result,ModeValue);
  5989. result.op := res;
  5990. END;
  5991. END ArrayLen;
  5992. (**
  5993. create a temporary variable in current scope
  5994. **)
  5995. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  5996. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  5997. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  5998. BEGIN
  5999. IF ~register THEN
  6000. variable := temporaries.GetFreeVariable(type, index);
  6001. ELSE
  6002. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6003. END;
  6004. scope := currentScope;
  6005. IF variable = NIL THEN
  6006. COPY("@hiddenIRVar",string);
  6007. Basic.AppendNumber(string,index);
  6008. name := SyntaxTree.NewIdentifier(string);
  6009. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  6010. variable.SetType(type);
  6011. variable.SetAccess(SyntaxTree.Hidden);
  6012. IF ~register THEN
  6013. temporaries.AddVariable(variable);
  6014. IF scope.lastVariable # NIL THEN
  6015. offset := scope.lastVariable.offsetInBits;
  6016. ELSE
  6017. offset := 0;
  6018. END;
  6019. DEC(offset,system.SizeOf(variable.type));
  6020. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6021. variable(SyntaxTree.Variable).SetOffset(offset);
  6022. scope.AddVariable(variable(SyntaxTree.Variable));
  6023. scope.EnterSymbol(variable, duplicate);
  6024. ASSERT(~duplicate);
  6025. InitVariable(variable(SyntaxTree.Variable));
  6026. ELSE
  6027. variable.SetUseRegister(TRUE);
  6028. variable(SyntaxTree.Variable).SetOffset(0);
  6029. END;
  6030. ELSE
  6031. InitVariable(variable(SyntaxTree.Variable));
  6032. (*
  6033. ASSERT(variable.type.resolved = type.resolved)
  6034. *)
  6035. END;
  6036. RETURN variable(SyntaxTree.Variable)
  6037. END GetTemporaryVariable;
  6038. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6039. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6040. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6041. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6042. i: LONGINT; duplicate: BOOLEAN;
  6043. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6044. VAR variable: SyntaxTree.Variable;
  6045. BEGIN
  6046. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  6047. variable.SetType(type);
  6048. recordScope.AddVariable(variable);
  6049. END AddVariable;
  6050. BEGIN
  6051. name := "@ArrayDescriptor";
  6052. Basic.AppendNumber(name,dimensions);
  6053. identifier := SyntaxTree.NewIdentifier(name);
  6054. parentScope := module.module.moduleScope;
  6055. symbol := parentScope.FindSymbol(identifier);
  6056. IF symbol # NIL THEN
  6057. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6058. type := typeDeclaration.declaredType;
  6059. ELSE
  6060. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  6061. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6062. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6063. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  6064. recordType.SetTypeDeclaration(typeDeclaration);
  6065. recordType.SetState(SyntaxTree.Resolved);
  6066. typeDeclaration.SetDeclaredType(recordType);
  6067. AddVariable("@ptr",system.anyType);
  6068. AddVariable("@adr",system.addressType);
  6069. AddVariable("@flags",system.addressType);
  6070. AddVariable("@dim",system.addressType);
  6071. AddVariable("@elementSize",system.addressType);
  6072. FOR i := 0 TO dimensions-1 DO
  6073. name := "@len";
  6074. Basic.AppendNumber(name,i);
  6075. AddVariable(name,system.addressType);
  6076. name := "@incr";
  6077. Basic.AppendNumber(name,i);
  6078. AddVariable(name,system.addressType);
  6079. END;
  6080. parentScope.AddTypeDeclaration(typeDeclaration);
  6081. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6082. ASSERT(~duplicate);
  6083. type := recordType;
  6084. END;
  6085. RETURN type
  6086. END GetMathArrayDescriptorType;
  6087. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6088. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6089. BEGIN
  6090. type := GetMathArrayDescriptorType(dimensions);
  6091. Emit(Push(position,op.op));
  6092. (* push type descriptor *)
  6093. reg := TypeDescriptorAdr(type);
  6094. IF ~newObjectFile THEN
  6095. IntermediateCode.MakeMemory(reg,addressType);
  6096. END;
  6097. Emit(Push(position,reg));
  6098. ReleaseIntermediateOperand(reg);
  6099. (* push realtime flag: false by default *)
  6100. Emit(Push(position,false));
  6101. CallThis(position,"Heaps","NewRec",3);
  6102. END NewMathArrayDescriptor;
  6103. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6104. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6105. BEGIN
  6106. NEW(string, LEN(s)); COPY(s, string^);
  6107. sv := SyntaxTree.NewStringValue(-1,string);
  6108. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6109. sv.SetType(type);
  6110. Designate(sv,res);
  6111. Emit(Push(position,res.tag));
  6112. Emit(Push(position,res.op));
  6113. ReleaseOperand(res);
  6114. END PushConstString;
  6115. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6116. BEGIN
  6117. IF b THEN
  6118. Emit(Push(-1, true));
  6119. ELSE
  6120. Emit(Push(-1, false));
  6121. END;
  6122. END PushConstBoolean;
  6123. PROCEDURE PushConstSet(v: SET);
  6124. VAR value: SyntaxTree.Value; op: Operand;
  6125. BEGIN
  6126. value := SyntaxTree.NewSetValue(-1, v);
  6127. value.SetType(system.setType);
  6128. Evaluate(value, op);
  6129. Emit(Push(-1, op.op));
  6130. ReleaseOperand(op);
  6131. END PushConstSet;
  6132. PROCEDURE PushConstInteger(v: LONGINT);
  6133. VAR value: SyntaxTree.Value; op: Operand;
  6134. BEGIN
  6135. value := SyntaxTree.NewIntegerValue(-1, v);
  6136. value.SetType(system.longintType);
  6137. Evaluate(value, op);
  6138. Emit(Push(-1, op.op));
  6139. ReleaseOperand(op);
  6140. END PushConstInteger;
  6141. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6142. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6143. section: IntermediateCode.Section;
  6144. BEGIN
  6145. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6146. Global.GetSymbolSegmentedName(symbol, name);
  6147. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6148. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6149. procedure.SetScope(moduleScope);
  6150. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6151. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6152. procedure.SetAccess(SyntaxTree.Hidden);
  6153. currentScope := procedureScope;
  6154. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6155. EmitEnter(section, -1,NIL,0,0,0);
  6156. RETURN section;
  6157. END OpenInitializer;
  6158. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6159. BEGIN
  6160. EmitLeave(section, 0, 0 );
  6161. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6162. section := prev;
  6163. END CloseInitializer;
  6164. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6165. VAR name: SyntaxTree.IdentifierString;
  6166. variable: SyntaxTree.Variable;
  6167. type: SyntaxTree.Type;
  6168. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6169. BEGIN
  6170. InitOperand(op,ModeReference);
  6171. op.op := fp;
  6172. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6173. Dereference(op, x, FALSE);
  6174. result := op;
  6175. Symbol(symbol, op);
  6176. END Field;
  6177. PROCEDURE Direction(direction: LONGINT): SET;
  6178. BEGIN
  6179. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6180. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6181. ELSE HALT(100);
  6182. END;
  6183. END Direction;
  6184. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6185. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6186. BEGIN
  6187. Field(port, op);
  6188. ToMemory(op.op,addressType,0);
  6189. Emit(Push(-1, op.op));
  6190. ReleaseOperand(op);
  6191. Basic.GetString(modifier.identifier, name);
  6192. PushConstString(name);
  6193. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6194. ASSERT(SemanticChecker.IsStringType(value.type));
  6195. Designate(value, op);
  6196. Emit(Push(modifier.position, op.tag));
  6197. Emit(Push(modifier.position, op.op));
  6198. ReleaseOperand(op);
  6199. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6200. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6201. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6202. Evaluate(value, op);
  6203. Emit(Push(modifier.position, op.op));
  6204. ReleaseOperand(op);
  6205. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6206. ELSE
  6207. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6208. END;
  6209. END AddPortProperty;
  6210. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6211. VAR modifier: SyntaxTree.Modifier;
  6212. BEGIN
  6213. modifier := variable.modifiers;
  6214. WHILE modifier # NIL DO
  6215. AddPortProperty(variable,modifier, modifier.expression);
  6216. modifier := modifier.nextModifier;
  6217. END;
  6218. END AddPortProperties;
  6219. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6220. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6221. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6222. PROCEDURE PushLens(type: SyntaxTree.Type);
  6223. BEGIN
  6224. IF IsSemiDynamicArray(type) THEN
  6225. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6226. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6227. Emit(Push(-1, op.op));
  6228. ReleaseOperand(op);
  6229. INC(dim);
  6230. ELSIF IsStaticArray(type) THEN
  6231. len := len * type(SyntaxTree.ArrayType).staticLength;
  6232. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6233. INC(dim);
  6234. ELSE
  6235. baseType := type;
  6236. END;
  6237. END PushLens;
  6238. BEGIN
  6239. (* cell *)
  6240. IF variable.type IS SyntaxTree.ArrayType THEN
  6241. type := variable.type;
  6242. dim := 0;
  6243. len := 1;
  6244. PushLens(type);
  6245. portType := baseType.resolved(SyntaxTree.PortType);
  6246. ELSE
  6247. portType := variable.type(SyntaxTree.PortType);
  6248. END;
  6249. PushSelfPointer();
  6250. (* port / array of ports *)
  6251. IF IsStaticArray(type) THEN
  6252. PushConstInteger(len);
  6253. END;
  6254. Field(variable, op);
  6255. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6256. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6257. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6258. Designate(d, op);*)
  6259. Emit(Push(-1, op.op));
  6260. ReleaseOperand(op);
  6261. (* name *)
  6262. PushConstString(name);
  6263. (* inout *)
  6264. PushConstSet(Direction(portType.direction));
  6265. (* width *)
  6266. PushConstInteger(portType.sizeInBits);
  6267. IF variable.type IS SyntaxTree.PortType THEN
  6268. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6269. AddPortProperties(variable);
  6270. ELSIF IsStaticArray(type)THEN
  6271. CallThis(variable.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6272. ELSIF IsSemiDynamicArray(type) THEN
  6273. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6274. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6275. Emit(Add(position,reg, sp, size));
  6276. (* dim *)
  6277. PushConstInteger(dim);
  6278. (* len array *)
  6279. Emit(Push(position, reg));
  6280. ReleaseIntermediateOperand(reg);
  6281. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6282. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6283. Emit(Add(position, sp,sp, size));
  6284. ELSE
  6285. HALT(100);
  6286. END;
  6287. END Variable;
  6288. BEGIN
  6289. IF backend.cellsAreObjects THEN
  6290. variable := x.cellScope.firstVariable;
  6291. WHILE (variable # NIL) DO
  6292. type := variable.type.resolved;
  6293. WHILE (type IS SyntaxTree.ArrayType) DO
  6294. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6295. END;
  6296. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6297. Global.GetSymbolNameInScope(variable,x.cellScope,name);
  6298. Variable(name,variable);
  6299. END;
  6300. variable := variable.nextVariable;
  6301. END;
  6302. ELSE HALT(200)
  6303. END;
  6304. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6305. (*
  6306. x.typeDeclaration.GetName(componentName);
  6307. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6308. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6309. instanceType.SetDataMemorySize(dataMemorySize);
  6310. END;
  6311. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6312. instanceType.SetInstructionMemorySize(codeMemorySize)
  6313. END;
  6314. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6315. instanceType.AddCapability(ActiveCells.VectorCapability)
  6316. END;
  6317. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6318. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6319. END;
  6320. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6321. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6322. END;
  6323. AddDevices(instanceType, x);
  6324. *)
  6325. (*
  6326. IF x.isCellNet THEN
  6327. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6328. END;
  6329. *)
  6330. (*currentActiveCellsScope := instanceType;*)
  6331. (*
  6332. parameter := x.firstParameter;
  6333. portIndex := 0;
  6334. WHILE parameter # NIL DO
  6335. parameter.GetName(parameterName);
  6336. parameterType := parameter.type.resolved;
  6337. Parameter(parameterName, parameterType);
  6338. (*
  6339. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6340. ParameterArray(parameterType);
  6341. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6342. FOR i := 0 TO len-1 DO
  6343. COPY(parameterName,name);
  6344. AppendIndex(name,i);
  6345. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6346. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6347. INC(portIndex);
  6348. END;
  6349. ELSE
  6350. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6351. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6352. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6353. INC(portIndex);
  6354. END;
  6355. *)
  6356. parameter := parameter.nextParameter;
  6357. END;
  6358. *)
  6359. (*
  6360. Scope(x.cellScope);
  6361. currentActiveCellsScope := prevActiveCellsScope;
  6362. AddModules(instanceType,x.cellScope);
  6363. *)
  6364. END AddPorts;
  6365. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6366. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6367. BEGIN
  6368. Symbol(cell,op);
  6369. ToMemory(op.op,addressType,0);
  6370. Emit(Push(position,op.op));
  6371. ReleaseOperand(op);
  6372. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6373. PushConstString(name);
  6374. IF SemanticChecker.IsStringType(property.type) OR (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6375. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6376. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6377. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6378. Designate(d, op);
  6379. IF SemanticChecker.IsStringType(property.type) THEN
  6380. Emit(Push(-1, op.tag))
  6381. END;
  6382. Emit(Push(-1, op.op));
  6383. ReleaseOperand(op);
  6384. END;
  6385. IF SemanticChecker.IsStringType(property.type) THEN
  6386. ASSERT(SemanticChecker.IsStringType(value.type));
  6387. Designate(value, op);
  6388. Emit(Push(property.position, op.tag));
  6389. Emit(Push(property.position, op.op));
  6390. ReleaseOperand(op);
  6391. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6392. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6393. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6394. Evaluate(value, op);
  6395. Emit(Push(property.position, op.op));
  6396. ReleaseOperand(op);
  6397. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6398. ELSE
  6399. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6400. END;
  6401. END AddProperty;
  6402. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6403. VAR symbol: SyntaxTree.Symbol;
  6404. BEGIN
  6405. WHILE modifier # NIL DO
  6406. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6407. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6408. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6409. ELSE
  6410. (*! move this check to checker *)
  6411. Error(modifier.position, "undefined property");
  6412. END;
  6413. modifier := modifier.nextModifier;
  6414. END;
  6415. END AddModifiers;
  6416. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6417. VAR last: SyntaxTree.Modifier;
  6418. BEGIN
  6419. IF to = NIL THEN
  6420. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6421. ELSE
  6422. last := to;
  6423. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6424. last := last.nextModifier;
  6425. END;
  6426. IF last.identifier # this.identifier THEN
  6427. ASSERT(last.nextModifier = NIL);
  6428. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6429. END;
  6430. END;
  6431. END AppendModifier;
  6432. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6433. BEGIN
  6434. WHILE this # NIL DO
  6435. AppendModifier(to, this);
  6436. this := this.nextModifier;
  6437. END;
  6438. END AppendModifiers;
  6439. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6440. VAR op: Operand;
  6441. BEGIN
  6442. Evaluate(p, op);
  6443. Emit(Push(p.position, op.op));
  6444. ReleaseOperand(op);
  6445. (*
  6446. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6447. p := p(SyntaxTree.Designator).left;
  6448. END;
  6449. IF p # NIL THEN
  6450. Evaluate(p, op);
  6451. Emit(Push(p.position, op.op));
  6452. ReleaseOperand(op);
  6453. ELSE
  6454. Emit(Push(-1, nil));
  6455. END;
  6456. *)
  6457. END PushPort;
  6458. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6459. VAR
  6460. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6461. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6462. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6463. tmp:IntermediateCode.Operand;
  6464. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6465. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6466. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6467. dest: IntermediateCode.Operand;
  6468. staticLength: LONGINT; itype: IntermediateCode.Type;
  6469. convert,isTensor: BOOLEAN;
  6470. recordType: SyntaxTree.RecordType;
  6471. baseType: SyntaxTree.Type;
  6472. flags: SET;
  6473. left: SyntaxTree.Expression;
  6474. call: SyntaxTree.Designator;
  6475. procedure: SyntaxTree.Procedure;
  6476. temporaryVariable: SyntaxTree.Variable;
  6477. dummy: IntermediateCode.Operand;
  6478. customBuiltin: SyntaxTree.CustomBuiltin;
  6479. isVarPar: ARRAY 3 OF BOOLEAN;
  6480. callsection: Sections.Section;
  6481. segmentedName: Basic.SegmentedName;
  6482. needsTrace: BOOLEAN;
  6483. n: ARRAY 256 OF CHAR;
  6484. modifier: SyntaxTree.Modifier;
  6485. previous, init: IntermediateCode.Section;
  6486. prevScope: SyntaxTree.Scope;
  6487. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6488. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6489. priority: IntermediateCode.Operand;
  6490. op,callop: Operand;
  6491. BEGIN
  6492. IF type = NIL THEN RETURN END;
  6493. type := type.resolved;
  6494. IF type IS SyntaxTree.PointerType THEN
  6495. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6496. END;
  6497. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6498. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6499. recordScope := type(SyntaxTree.RecordType).recordScope;
  6500. IF recordScope.bodyProcedure # NIL THEN
  6501. procedure := recordScope.bodyProcedure;
  6502. body := procedure.procedureScope.body;
  6503. Emit(Push(position,self));
  6504. IF body.isActive THEN
  6505. StaticCallOperand(callop,procedure);
  6506. Emit(Push(position,callop.op));
  6507. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6508. Convert(priority,sizeType);
  6509. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6510. END;
  6511. Emit(Push(position,priority));
  6512. ReleaseIntermediateOperand(priority);
  6513. IF backend.cooperative THEN
  6514. Emit(Push(position,self));
  6515. CallThis(position,"Activities","Create",3)
  6516. ELSE
  6517. flags := 0;
  6518. IF body.isSafe THEN
  6519. flags := 1;
  6520. END;
  6521. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6522. Emit(Push(position,self));
  6523. CallThis(position,"Objects","CreateProcess",4)
  6524. END;
  6525. ELSE
  6526. Emit(Push(position,self));
  6527. StaticCallOperand(callop,procedure);
  6528. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6529. END;
  6530. Emit(Pop(position,self));
  6531. END;
  6532. END CallBodies;
  6533. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6534. BEGIN
  6535. actualType := actualType.resolved;
  6536. IF actualType IS SyntaxTree.StringType THEN
  6537. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6538. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6539. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6540. ELSE
  6541. tmp := op.tag;
  6542. IntermediateCode.MakeMemory(tmp,addressType);
  6543. Emit(Push(position,tmp));
  6544. END;
  6545. Emit(Push(position,op.op))
  6546. END PushString;
  6547. PROCEDURE PushTD(type: SyntaxTree.Type);
  6548. VAR op: IntermediateCode.Operand;
  6549. BEGIN
  6550. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6551. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6552. ELSE
  6553. IF type.resolved IS SyntaxTree.PointerType THEN
  6554. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6555. END;
  6556. op := TypeDescriptorAdr(type.resolved);
  6557. IF ~newObjectFile THEN
  6558. IntermediateCode.MakeMemory(op,addressType);
  6559. END;
  6560. Emit(Push(position,op));
  6561. END
  6562. END PushTD;
  6563. BEGIN
  6564. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6565. dest := destination; destination := emptyOperand;
  6566. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6567. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6568. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6569. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6570. CASE x.id OF
  6571. (* ---- COPY ----- *)
  6572. |Global.Copy:
  6573. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6574. (* ---- EXCL, INCL----- *)
  6575. |Global.Excl,Global.Incl:
  6576. Evaluate(p0,s0);
  6577. Evaluate(p1,s1);
  6578. Convert(s1.op,setType);
  6579. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6580. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6581. END;
  6582. ReuseCopy(res,s0.op);
  6583. ReleaseOperand(s0);
  6584. Reuse1(tmp,s1.op);
  6585. ReleaseOperand(s1);
  6586. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6587. IF x.id = Global.Excl THEN
  6588. Emit(Not(position,tmp,tmp));
  6589. Emit(And(position,res,res,tmp));
  6590. ELSE
  6591. Emit(Or(position,res,res,tmp));
  6592. END;
  6593. ReleaseIntermediateOperand(tmp);
  6594. Designate(p0,s0);
  6595. ToMemory(s0.op,setType,0);
  6596. Emit(Mov(position,s0.op,res));
  6597. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6598. (* ---- DISPOSE ----- *)
  6599. |Global.Dispose:
  6600. Designate(p0,s0);
  6601. Emit(Push(position,s0.op));
  6602. ReleaseOperand(s0);
  6603. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6604. (* ---- GETPROCEDURE ----- *)
  6605. |Global.GetProcedure:
  6606. Designate(p0,s0);
  6607. PushString(s0,p0.type);
  6608. Designate(p1,s1);
  6609. PushString(s1,p1.type);
  6610. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6611. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6612. ELSE PushTD(procedureType.firstParameter.type)
  6613. END;
  6614. PushTD(procedureType.returnType);
  6615. Designate(p2,s2);
  6616. Emit(Push(position,s2.op));
  6617. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6618. CallThis(position,"Modules","GetProcedure", 7);
  6619. (* ---- ASH, LSH, ROT ----- *)
  6620. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6621. Evaluate(p0,s0);
  6622. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6623. (* make unsigned arguments in order to produced a logical shift *)
  6624. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6625. convert:= TRUE;
  6626. itype := s0.op.type;
  6627. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6628. Convert(s0.op,itype);
  6629. ELSE
  6630. convert := FALSE;
  6631. END;
  6632. END;
  6633. Evaluate(p1,s1);
  6634. IF IsIntegerConstant(p1,hint) THEN
  6635. ReuseCopy(reg,s0.op);
  6636. IF hint > 0 THEN
  6637. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6638. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6639. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6640. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6641. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6642. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6643. END;
  6644. ELSIF hint < 0 THEN
  6645. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6646. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6647. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6648. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6649. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6650. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6651. END;
  6652. END;
  6653. ReleaseOperand(s0); ReleaseOperand(s1);
  6654. ELSE
  6655. exit := NewLabel();
  6656. end := NewLabel();
  6657. ReuseCopy(reg,s0.op);
  6658. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6659. Reuse1(tmp,s1.op);
  6660. Emit(Neg(position,tmp,s1.op));
  6661. Convert(tmp,s1.op.type);
  6662. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6663. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6664. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6665. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6666. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6667. END;
  6668. ReleaseIntermediateOperand(tmp);
  6669. BrL(end);
  6670. SetLabel(exit);
  6671. ReuseCopy(tmp,s1.op);
  6672. Convert(tmp,s1.op.type);
  6673. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6674. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6675. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6676. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6677. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6678. END;
  6679. ReleaseIntermediateOperand(tmp);
  6680. SetLabel(end);
  6681. ReleaseOperand(s0); ReleaseOperand(s1);
  6682. END;
  6683. InitOperand(result,ModeValue);
  6684. IF convert THEN
  6685. itype := reg.type;
  6686. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6687. Convert(reg,itype);
  6688. END;
  6689. result.op := reg;
  6690. (* ---- CAP ----- *)
  6691. |Global.Cap:
  6692. Evaluate(p0,result);
  6693. ReuseCopy(reg,result.op);
  6694. ReleaseIntermediateOperand(result.op);
  6695. ignore := NewLabel();
  6696. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6697. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6698. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6699. SetLabel(ignore);
  6700. result.op := reg;
  6701. (* ---- CHR ----- *)
  6702. |Global.Chr, Global.Chr32:
  6703. Evaluate(p0,result);
  6704. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6705. |Global.Entier, Global.EntierH:
  6706. Evaluate(p0,result);
  6707. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6708. (* ---- MIN and MAX ----- *)
  6709. |Global.Max,Global.Min:
  6710. Evaluate(p0,s0);
  6711. Evaluate(p1,s1);
  6712. Reuse2(res,s0.op,s1.op);
  6713. else := NewLabel();
  6714. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6715. ELSE BrltL(else,s1.op,s0.op) END;
  6716. Emit(Mov(position,res,s0.op));
  6717. ReleaseOperand(s0);
  6718. end := NewLabel();
  6719. BrL(end);
  6720. SetLabel(else);
  6721. Emit(MovReplace(position,res,s1.op));
  6722. SetLabel(end);
  6723. ReleaseOperand(s1);
  6724. InitOperand(result,ModeValue);
  6725. result.op := res;
  6726. (* ---- ODD ----- *)
  6727. |Global.Odd:
  6728. IF ~conditional THEN
  6729. ConditionToValue(x)
  6730. ELSE
  6731. Evaluate(p0,result);
  6732. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6733. Reuse1(res,result.op);
  6734. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6735. ReleaseIntermediateOperand(result.op);
  6736. result.op := res;
  6737. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6738. ReleaseOperand(result);
  6739. BrL(falseLabel);
  6740. END;
  6741. (* ---- ORD ----- *)
  6742. |Global.Ord, Global.Ord32:
  6743. Evaluate(p0,result);
  6744. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6745. (* ---- SHORT, LONG ----- *)
  6746. |Global.Short, Global.Long:
  6747. Evaluate(p0,result);
  6748. IF x.type IS SyntaxTree.ComplexType THEN
  6749. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6750. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6751. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6752. ELSE
  6753. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6754. END
  6755. (* ---- HALT, SYSTEM.HALT----- *)
  6756. |Global.Halt, Global.systemHalt:
  6757. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6758. EmitTrap (position, val);
  6759. (* ---- ASSERT ----- *)
  6760. |Global.Assert:
  6761. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6762. trueL := NewLabel();
  6763. falseL := NewLabel();
  6764. Condition(p0,trueL,falseL);
  6765. IF p1 = NIL THEN val := AssertTrap
  6766. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6767. END;
  6768. SetLabel(falseL);
  6769. EmitTrap(position,val);
  6770. SetLabel(trueL);
  6771. END;
  6772. (*
  6773. Emit(TrapC(result.op,val);
  6774. *)
  6775. (* ---- INC, DEC----- *)
  6776. |Global.Inc,Global.Dec:
  6777. Expression(p0); adr := result.op;
  6778. LoadValue(result,p0.type); l := result;
  6779. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6780. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6781. END;
  6782. IF x.id = Global.Inc THEN
  6783. Emit(Add(position,l.op,l.op,r.op));
  6784. ELSE
  6785. Emit(Sub(position,l.op,l.op,r.op));
  6786. END;
  6787. ReleaseOperand(l); ReleaseOperand(r);
  6788. (* ---- LEN ----- *)
  6789. |Global.Len: (* dynamic length, static length done by checker *)
  6790. Designate(p0,operand);
  6791. IF p1 = NIL THEN
  6792. InitOperand(l,ModeValue);
  6793. l.op := IntermediateCode.Immediate(int32,0);
  6794. ELSE
  6795. Evaluate(p1,l);
  6796. END;
  6797. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6798. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6799. Dereference(operand, p0.type.resolved, FALSE);
  6800. END;
  6801. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6802. ReleaseOperand(operand); ReleaseOperand(l);
  6803. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6804. ASSERT(p1 # NIL);
  6805. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6806. Dereference(operand,p0.type.resolved,FALSE);
  6807. END;
  6808. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6809. ReleaseOperand(operand); ReleaseOperand(l);
  6810. ELSE HALT(100);
  6811. END;
  6812. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6813. (* ---- FIRST ---- *)
  6814. |Global.First:
  6815. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6816. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6817. ELSE
  6818. Designate(p0, result)
  6819. END
  6820. (* ---- LAST ---- *)
  6821. |Global.Last:
  6822. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6823. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6824. ELSE
  6825. Designate(p0, result);
  6826. (* make sure result.op is a register *)
  6827. tmp := result.op;
  6828. ReuseCopy(result.op, result.op);
  6829. ReleaseIntermediateOperand(tmp);
  6830. (* add offset to result.op *)
  6831. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6832. END
  6833. (* ---- STEP ---- *)
  6834. |Global.Step:
  6835. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6836. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6837. ELSE
  6838. Designate(p0, result);
  6839. (* make sure result.op is a register *)
  6840. tmp := result.op;
  6841. ReuseCopy(result.op, result.op);
  6842. ReleaseIntermediateOperand(tmp);
  6843. (* add offset to result.op *)
  6844. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6845. END
  6846. (* ---- RE ---- *)
  6847. |Global.Re:
  6848. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6849. Designate(p0, result)
  6850. ELSE
  6851. Evaluate(p0, result)
  6852. END
  6853. (* ---- IM ---- *)
  6854. |Global.Im:
  6855. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6856. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6857. Designate(p0, result);
  6858. (* make sure result.op is a register *)
  6859. tmp := result.op;
  6860. ReuseCopy(result.op, result.op);
  6861. ReleaseIntermediateOperand(tmp);
  6862. (* add offset to result.op *)
  6863. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6864. (* ---- ABS ----- *)
  6865. |Global.Abs:
  6866. Evaluate(p0,operand);
  6867. type := p0.type.resolved;
  6868. InitOperand(result,ModeValue);
  6869. Reuse1a(result.op,operand.op,dest);
  6870. Emit(Abs(position,result.op,operand.op));
  6871. ReleaseOperand(operand);
  6872. (* ---- WAIT ----- *)
  6873. |Global.Wait:
  6874. Evaluate(p0,operand);
  6875. Emit(Push(position,operand.op));
  6876. ReleaseOperand(operand);
  6877. CallThis(position,"Activities","Wait", 1);
  6878. (* ---- NEW ----- *)
  6879. |Global.New:
  6880. (*! the following code is only correct for "standard" Oberon calling convention *)
  6881. type := p0.type.resolved;
  6882. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6883. THEN
  6884. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6885. IF backend.cooperative THEN
  6886. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6887. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6888. IF recordType.isObject THEN
  6889. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6890. IF recordType.IsActive() THEN
  6891. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6892. END;
  6893. IF recordType.IsProtected() THEN
  6894. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6895. END;
  6896. ELSE
  6897. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6898. END;
  6899. END;
  6900. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6901. CallThis(position,"Runtime","New", 1);
  6902. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6903. Emit(Result(position, pointer));
  6904. exit := NewLabel();
  6905. BreqL(exit,pointer,nil);
  6906. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6907. GetRecordTypeName (recordType,name);
  6908. IF ~recordType.isObject THEN
  6909. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6910. END;
  6911. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6912. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6913. IF recordType.isObject THEN
  6914. IF recordType.IsProtected() THEN
  6915. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6916. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6917. END;
  6918. IF recordType.IsActive() THEN
  6919. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6920. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6921. END;
  6922. END;
  6923. END;
  6924. (* initialize fields *)
  6925. IF type(SyntaxTree.PointerType).isPlain THEN
  6926. size := 0;
  6927. ELSIF recordType.isObject THEN
  6928. size := BaseObjectTypeSize;
  6929. ELSE
  6930. size := BaseRecordTypeSize;
  6931. END;
  6932. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  6933. (* call initializer *)
  6934. constructor := GetConstructor(recordType);
  6935. IF constructor # NIL THEN
  6936. (*! should be unified with ProcedureCallDesignator *)
  6937. Emit(Push(position,pointer));
  6938. ReleaseIntermediateOperand(pointer);
  6939. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6940. FOR i := 1 TO x.parameters.Length()-1 DO
  6941. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6942. formalParameter := formalParameter.nextParameter;
  6943. END;
  6944. (* static call of the constructor *)
  6945. GetCodeSectionNameForSymbol(constructor,name);
  6946. ASSERT(~constructor.isInline);
  6947. IF constructor.scope.ownerModule # module.module THEN
  6948. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6949. ELSE
  6950. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6951. END;
  6952. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  6953. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6954. Emit(Pop(position,pointer));
  6955. END;
  6956. (* call bodies *)
  6957. CallBodies(pointer,p0.type);
  6958. SetLabel(exit);
  6959. needsTrace := p0.NeedsTrace();
  6960. IF needsTrace THEN ModifyAssignments(true) END;
  6961. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  6962. Emit(Push(position, pointer));
  6963. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  6964. Emit(Pop(position, pointer));
  6965. END;
  6966. Designate(p0,l);
  6967. IF needsTrace THEN
  6968. CallAssignPointer(l.op, pointer);
  6969. ELSE
  6970. ToMemory(l.op,addressType,0);
  6971. Emit(Mov(position,l.op,pointer));
  6972. END;
  6973. ReleaseIntermediateOperand(pointer);
  6974. ReleaseOperand(l);
  6975. IF needsTrace THEN ModifyAssignments(false) END;
  6976. ELSE
  6977. temporaryVariable := GetTemporaryVariable(type, FALSE);
  6978. IF temporaryVariable # NIL THEN
  6979. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  6980. ELSE
  6981. Designate(p0,l);
  6982. END;
  6983. (* l.op contains address of pointer to record *)
  6984. Emit(Push(position,l.op)); (* address for use after syscall *)
  6985. Emit(Push(position,l.op));
  6986. ReleaseOperand(l);
  6987. (* push type descriptor *)
  6988. reg := TypeDescriptorAdr(recordType);
  6989. IF ~newObjectFile THEN
  6990. IntermediateCode.MakeMemory(reg,addressType);
  6991. END;
  6992. Emit(Push(position,reg));
  6993. ReleaseIntermediateOperand(reg);
  6994. (* push realtime flag *)
  6995. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6996. ELSE Emit(Push(position,false));
  6997. END;
  6998. CallThis(position,"Heaps","NewRec", 3);
  6999. (* check allocation success, if not successful then do not call initializers and bodies *)
  7000. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7001. Emit(Pop(position,pointer));
  7002. MakeMemory(reg,pointer,addressType,0);
  7003. ReleaseIntermediateOperand(pointer);
  7004. pointer := reg;
  7005. exit := NewLabel();
  7006. BreqL(exit,pointer,nil);
  7007. Emit(Push(position,pointer));
  7008. (* initialize fields *)
  7009. InitFields(recordType, pointer,0);
  7010. (* call initializer *)
  7011. constructor := GetConstructor(recordType);
  7012. IF constructor # NIL THEN
  7013. (*! should be unified with ProcedureCallDesignator *)
  7014. Emit(Push(position,pointer));
  7015. ReleaseIntermediateOperand(pointer);
  7016. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7017. FOR i := 1 TO x.parameters.Length()-1 DO
  7018. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7019. formalParameter := formalParameter.nextParameter;
  7020. END;
  7021. (* static call of the constructor *)
  7022. GetCodeSectionNameForSymbol(constructor,name);
  7023. ASSERT(~constructor.isInline);
  7024. IF constructor.scope.ownerModule # module.module THEN
  7025. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7026. ELSE
  7027. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7028. END;
  7029. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7030. ELSE
  7031. ReleaseIntermediateOperand(pointer);
  7032. END;
  7033. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7034. Emit(Pop(position,pointer));
  7035. IF temporaryVariable # NIL THEN
  7036. Designate(p0,l);
  7037. ToMemory(l.op,addressType,0);
  7038. Emit(Mov(position,l.op,pointer));
  7039. ReleaseOperand(l);
  7040. result.tag := emptyOperand;
  7041. END;
  7042. (* call bodies *)
  7043. CallBodies(pointer,p0.type);
  7044. ReleaseIntermediateOperand(pointer);
  7045. IF temporaryVariable # NIL THEN
  7046. end := NewLabel();
  7047. BrL(end);
  7048. SetLabel(exit);
  7049. Designate(p0,l);
  7050. ToMemory(l.op,addressType,0);
  7051. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7052. ReleaseOperand(l);
  7053. SetLabel(end);
  7054. ELSE
  7055. SetLabel(exit);
  7056. END;
  7057. END;
  7058. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7059. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7060. dim := 0;
  7061. IF p1 # NIL THEN
  7062. FOR i := 1 TO x.parameters.Length()-1 DO
  7063. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7064. parameter := x.parameters.GetExpression(i);
  7065. Evaluate(parameter,r);
  7066. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7067. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7068. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7069. END;
  7070. Emit(Push(position,r.op));
  7071. IF i=1 THEN
  7072. ReuseCopy(reg,r.op);
  7073. ELSE
  7074. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7075. END;
  7076. ReleaseOperand(r);
  7077. INC(dim);
  7078. END;
  7079. Convert(reg,addressType);
  7080. ELSE
  7081. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7082. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7083. END;
  7084. openDim := dim;
  7085. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7086. IF backend.cooperative THEN
  7087. size := ToMemoryUnits(system,system.SizeOf(type));
  7088. WHILE type IS SyntaxTree.ArrayType DO
  7089. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7090. END;
  7091. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7092. IF (size # 1) THEN
  7093. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7094. END;
  7095. Emit(Push(position,reg));
  7096. size := ToMemoryUnits(system,system.SizeOf(type));
  7097. IF (size # 1) THEN
  7098. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7099. END;
  7100. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7101. Emit(Push(position,reg));
  7102. ReleaseIntermediateOperand(reg);
  7103. CallThis(position,"Runtime","New", 1);
  7104. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7105. Emit(Result(position, pointer));
  7106. exit := NewLabel();
  7107. else := NewLabel();
  7108. BreqL(else,pointer,nil);
  7109. IF ~type.hasPointers THEN
  7110. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7111. ELSIF type IS SyntaxTree.RecordType THEN
  7112. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7113. ELSIF type IS SyntaxTree.ProcedureType THEN
  7114. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7115. ELSE
  7116. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7117. END;
  7118. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7119. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7120. 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))));
  7121. IF type IS SyntaxTree.RecordType THEN
  7122. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7123. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7124. ELSE
  7125. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7126. END;
  7127. i := openDim;
  7128. WHILE i > 0 DO
  7129. DEC (i);
  7130. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7131. END;
  7132. needsTrace := p0.NeedsTrace();
  7133. IF needsTrace THEN ModifyAssignments(true) END;
  7134. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7135. Emit(Push(position, pointer));
  7136. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7137. Emit(Pop(position, pointer));
  7138. END;
  7139. Designate(p0,l);
  7140. IF needsTrace THEN
  7141. CallAssignPointer(l.op, pointer);
  7142. ModifyAssignments(false);
  7143. ELSE
  7144. ToMemory(l.op,addressType,0);
  7145. Emit(Mov(position,l.op,pointer));
  7146. END;
  7147. ReleaseIntermediateOperand(pointer);
  7148. ReleaseOperand(l);
  7149. BrL(exit);
  7150. SetLabel(else);
  7151. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7152. Designate(p0,l);
  7153. IF needsTrace THEN
  7154. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7155. ELSE
  7156. ToMemory(l.op,addressType,0);
  7157. Emit(Mov(position,l.op,pointer));
  7158. END;
  7159. ReleaseOperand(l);
  7160. SetLabel(exit);
  7161. ELSE
  7162. (*! the following code is only correct for "standard" Oberon calling convention *)
  7163. IF SemanticChecker.ContainsPointer(type) THEN
  7164. IF type IS SyntaxTree.ArrayType THEN
  7165. staticLength := 1;
  7166. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7167. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7168. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7169. END;
  7170. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7171. Emit(Mul(position,reg,reg,tmp));
  7172. END;
  7173. Designate(p0,l);
  7174. IF openDim > 0 THEN
  7175. Emit(Push(position,l.op)); (* address for use after syscall *)
  7176. END;
  7177. Emit(Push(position,l.op)); (* address *)
  7178. ReleaseOperand(l);
  7179. tmp := TypeDescriptorAdr(type);
  7180. IF ~newObjectFile THEN
  7181. IntermediateCode.MakeMemory(tmp,addressType);
  7182. END;
  7183. Emit(Push(position,tmp)); (* type descriptor *)
  7184. ReleaseIntermediateOperand(tmp);
  7185. Emit(Push(position,reg)); (* number Elements *)
  7186. ReleaseIntermediateOperand(reg);
  7187. tmp := IntermediateCode.Immediate(addressType,dim);
  7188. Emit(Push(position,tmp)); (* dimensions *)
  7189. (* push realtime flag *)
  7190. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7191. ELSE Emit(Push(position,false));
  7192. END;
  7193. CallThis(position,"Heaps","NewArr",5)
  7194. ELSE
  7195. size := ToMemoryUnits(system,system.SizeOf(type));
  7196. IF (size # 1) THEN
  7197. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7198. END;
  7199. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7200. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7201. Emit(Add(position,reg,reg,tmp));
  7202. Designate(p0,l);
  7203. IF openDim >0 THEN
  7204. Emit(Push(position,l.op)); (* address for use after syscall *)
  7205. END;
  7206. Emit(Push(position,l.op)); (* address for syscall *)
  7207. ReleaseOperand(l); (* pointer address *)
  7208. Emit(Push(position,reg)); (* size *)
  7209. ReleaseIntermediateOperand(reg);
  7210. (* push realtime flag *)
  7211. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7212. ELSE Emit(Push(position,false));
  7213. END;
  7214. CallThis(position,"Heaps","NewSys", 3)
  7215. END;
  7216. IF openDim > 0 THEN
  7217. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7218. Emit(Pop(position,adr));
  7219. ToMemory(adr,addressType,0);
  7220. ReuseCopy(tmp,adr);
  7221. ReleaseIntermediateOperand(adr);
  7222. adr := tmp;
  7223. else := NewLabel();
  7224. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7225. i := openDim-1;
  7226. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7227. WHILE (i >= 0) DO
  7228. Emit(Pop(position,reg));
  7229. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7230. Emit(Mov(position,res,reg));
  7231. DEC(i);
  7232. END;
  7233. ReleaseIntermediateOperand(adr);
  7234. ReleaseIntermediateOperand(reg);
  7235. exit := NewLabel();
  7236. BrL(exit);
  7237. SetLabel(else);
  7238. (* else part: array could not be allocated *)
  7239. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7240. Emit(Add(position,sp,sp,tmp));
  7241. SetLabel(exit);
  7242. END;
  7243. END;
  7244. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7245. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7246. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7247. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7248. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7249. left.SetType(procedure.type);
  7250. formalParameter := procedureType.firstParameter;
  7251. (* push array to allocate *)
  7252. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7253. formalParameter :=formalParameter.nextParameter;
  7254. (* push length array *)
  7255. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7256. (* push size *)
  7257. type := t0;
  7258. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7259. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7260. END;
  7261. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7262. Emit(Push(position,tmp));
  7263. (* *)
  7264. IF SemanticChecker.ContainsPointer(type) THEN
  7265. tmp := TypeDescriptorAdr(type);
  7266. IF ~newObjectFile THEN
  7267. IntermediateCode.MakeMemory(tmp,addressType);
  7268. END;
  7269. ELSE
  7270. tmp := IntermediateCode.Immediate(addressType, 0);
  7271. END;
  7272. Emit(Push(position,tmp)); (* type descriptor *)
  7273. StaticCallOperand(result,procedure);
  7274. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7275. ReleaseOperand(result);
  7276. END;
  7277. (*
  7278. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7279. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7280. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7281. *)
  7282. ELSE
  7283. dim := 0;
  7284. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7285. (* generate geometry descriptor *)
  7286. Designate(p0,l);
  7287. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7288. ReleaseOperand(l);
  7289. isTensor := TRUE;
  7290. ELSE
  7291. isTensor := FALSE;
  7292. END;
  7293. FOR i := 1 TO x.parameters.Length()-1 DO
  7294. IF ~isTensor THEN
  7295. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7296. END;
  7297. parameter := x.parameters.GetExpression(i);
  7298. Evaluate(parameter,r);
  7299. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7300. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7301. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7302. END;
  7303. Emit(Push(position,r.op));
  7304. IF i=1 THEN
  7305. ReuseCopy(reg,r.op);
  7306. ELSE
  7307. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7308. END;
  7309. ReleaseOperand(r);
  7310. INC(dim);
  7311. END;
  7312. Convert(reg,addressType);
  7313. openDim := dim;
  7314. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7315. (*! the following code is only correct for "standard" Oberon calling convention *)
  7316. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7317. t := type;
  7318. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7319. staticLength := 1;
  7320. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7321. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7322. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7323. END;
  7324. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7325. Emit(Mul(position,reg,reg,tmp));
  7326. END;
  7327. Designate(p0,l);
  7328. IF isTensor THEN
  7329. Dereference(l,type,FALSE);
  7330. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7331. END;
  7332. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7333. Emit(Push(position,l.tag)); (* address *)
  7334. ReleaseOperand(l);
  7335. tmp := TypeDescriptorAdr(t);
  7336. IF ~newObjectFile THEN
  7337. IntermediateCode.MakeMemory(tmp,addressType);
  7338. END;
  7339. Emit(Push(position,tmp)); (* type descriptor *)
  7340. ReleaseIntermediateOperand(tmp);
  7341. Emit(Push(position,reg)); (* number Elements *)
  7342. ReleaseIntermediateOperand(reg);
  7343. tmp := IntermediateCode.Immediate(addressType,0);
  7344. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7345. (* push realtime flag: false by default *)
  7346. Emit(Push(position,false));
  7347. CallThis(position,"Heaps","NewArr",5);
  7348. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7349. Emit(Pop(position,adr));
  7350. GetMathArrayField(tmp,adr,MathPtrOffset);
  7351. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7352. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7353. PutMathArrayField(adr,reg,MathAdrOffset);
  7354. ReleaseIntermediateOperand(tmp);
  7355. ReleaseIntermediateOperand(reg);
  7356. ELSE
  7357. IF isTensor THEN
  7358. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7359. ELSE
  7360. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7361. END;
  7362. IF (size # 1) THEN
  7363. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7364. END;
  7365. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7366. Emit(Add(position,reg,reg,tmp));
  7367. Designate(p0,l);
  7368. IF isTensor THEN
  7369. Dereference(l,type,FALSE);
  7370. END;
  7371. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7372. Emit(Push(position,l.tag)); (* address for syscall *)
  7373. ReleaseOperand(l); (* pointer address *)
  7374. Emit(Push(position,reg)); (* size *)
  7375. ReleaseIntermediateOperand(reg);
  7376. (* push realtime flag: false by default *)
  7377. Emit(Push(position,false));
  7378. CallThis(position,"Heaps","NewSys",3);
  7379. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7380. Emit(Pop(position,adr));
  7381. GetMathArrayField(tmp,adr,MathPtrOffset);
  7382. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7383. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7384. PutMathArrayField(adr,reg,MathAdrOffset);
  7385. ReleaseIntermediateOperand(tmp);
  7386. ReleaseIntermediateOperand(reg);
  7387. END;
  7388. flags := {};
  7389. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7390. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7391. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7392. PutMathArrayField(adr,tmp,MathDimOffset);
  7393. else := NewLabel();
  7394. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7395. i := openDim-1;
  7396. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7397. IF isTensor THEN
  7398. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7399. ELSE
  7400. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7401. END;
  7402. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7403. WHILE (i >= 0) DO
  7404. Emit(Pop(position,reg));
  7405. PutMathArrayLength(adr,reg,i);
  7406. PutMathArrayIncrement(adr,tmp,i);
  7407. IF i > 0 THEN
  7408. IF i=openDim-1 THEN
  7409. ReuseCopy(tmp,tmp);
  7410. END;
  7411. Emit(Mul(position,tmp,tmp,reg));
  7412. END;
  7413. DEC(i);
  7414. END;
  7415. ReleaseIntermediateOperand(adr);
  7416. ReleaseIntermediateOperand(reg);
  7417. ReleaseIntermediateOperand(tmp);
  7418. exit := NewLabel();
  7419. BrL(exit);
  7420. SetLabel(else);
  7421. (* else part: array could not be allocated *)
  7422. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7423. Emit(Add(position,sp,sp,tmp));
  7424. SetLabel(exit);
  7425. END;
  7426. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7427. THEN
  7428. IF ~backend.cellsAreObjects THEN RETURN END;
  7429. IF InCellScope(currentScope) THEN
  7430. PushSelfPointer()
  7431. ELSE
  7432. Emit(Push(position, nil));
  7433. END;
  7434. (* push temp address *)
  7435. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7436. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7437. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7438. (* l.op contains address of pointer to record *)
  7439. Emit(Push(position,l.op)); (* address for use after syscall *)
  7440. ReleaseOperand(l);
  7441. (* push type descriptor *)
  7442. reg := TypeDescriptorAdr(baseType);
  7443. IF ~newObjectFile THEN
  7444. IntermediateCode.MakeMemory(reg,addressType);
  7445. END;
  7446. Emit(Push(position,reg));
  7447. ReleaseIntermediateOperand(reg);
  7448. (* push name *)
  7449. (*Global.GetSymbolName(p0, n);*)
  7450. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7451. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7452. ELSE
  7453. Global.GetModuleName(module.module, n);
  7454. END;
  7455. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7456. (*type.typeDeclaration.GetName(n);*)
  7457. PushConstString(n);
  7458. (* push cellnet boolean *)
  7459. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7460. (* push engine boolean *)
  7461. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7462. (* allocate *)
  7463. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7464. (* add capabilities *)
  7465. modifier := p0(SyntaxTree.Designator).modifiers;
  7466. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7467. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7468. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7469. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7470. END;
  7471. AppendModifiers(modifier, baseType(SyntaxTree.CellType).modifiers);
  7472. (*
  7473. modifier := baseType(SyntaxTree.CellType).modifiers;
  7474. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7475. modifier := p0(SyntaxTree.Designator).modifiers;
  7476. *)
  7477. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7478. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7479. (* l.op contains address of pointer to record *)
  7480. ToMemory(l.op,addressType,0);
  7481. (* l.op contains value of pointer to record *)
  7482. Emit(Push(position,l.op)); (* address for use after syscall *)
  7483. ReleaseOperand(l);
  7484. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7485. prevScope := currentScope;
  7486. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7487. previous := section;
  7488. section := init;
  7489. (* add ports *)
  7490. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7491. CloseInitializer(previous);
  7492. currentScope := prevScope;
  7493. Symbol(temporaryVariable,l);
  7494. ToMemory(l.op,addressType,0);
  7495. Emit(Push(position,l.op));
  7496. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7497. (*
  7498. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7499. IF constructor # NIL THEN
  7500. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7501. FOR i := 1 TO x.parameters.Length()-1 DO
  7502. p := x.parameters.GetExpression(i);
  7503. Global.GetSymbolName(parameter,name);
  7504. Evaluate(p, value);
  7505. ASSERT(value.type # NIL);
  7506. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7507. par := instance.AddParameter(name);
  7508. par.SetInteger(value.integer);
  7509. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7510. par := instance.AddParameter(name);
  7511. par.SetBoolean(value.boolean);
  7512. ELSE Error(x.position,NotYetImplemented)
  7513. END;
  7514. parameter := parameter.nextParameter
  7515. END;
  7516. END;
  7517. *)
  7518. (* call initializer *)
  7519. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7520. IF constructor # NIL THEN
  7521. (*! should be unified with ProcedureCallDesignator *)
  7522. IF backend.cellsAreObjects THEN
  7523. Symbol(temporaryVariable,l);
  7524. ToMemory(l.op,addressType,0);
  7525. Emit(Push(position,l.op));
  7526. ReleaseOperand(l);
  7527. END;
  7528. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7529. FOR i := 1 TO x.parameters.Length()-1 DO
  7530. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7531. formalParameter := formalParameter.nextParameter;
  7532. END;
  7533. (* static call of the constructor *)
  7534. Global.GetSymbolSegmentedName(constructor,name);
  7535. ASSERT(~constructor.isInline);
  7536. IF constructor.scope.ownerModule # module.module THEN
  7537. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7538. ELSE
  7539. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7540. END;
  7541. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7542. (*ELSE
  7543. ReleaseIntermediateOperand(pointer);*)
  7544. END;
  7545. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7546. ToMemory(l.op, addressType, 0);
  7547. Designate(p0,s0);
  7548. ToMemory(s0.op,addressType,0);
  7549. Emit(Mov(position,s0.op,l.op));
  7550. ReleaseOperand(l);
  7551. ReleaseOperand(s0);
  7552. result.tag := emptyOperand;
  7553. (* start *)
  7554. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7555. (* push cell *)
  7556. Symbol(temporaryVariable, l);
  7557. ToMemory(l.op,addressType,0);
  7558. Emit(Push(-1,l.op));
  7559. (* push delegate *)
  7560. Emit(Push(-1,l.op));
  7561. ReleaseOperand(l);
  7562. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7563. Emit(Push(position, s1.op));
  7564. ReleaseOperand(s1);
  7565. CallThis(position,"ActiveCellsRuntime","Start",3);
  7566. END;
  7567. (*IF temporaryVariable # NIL THEN
  7568. end := NewLabel();
  7569. BrL(end);
  7570. SetLabel(exit);
  7571. Designate(p0,l);
  7572. ToMemory(l.op,addressType,0);
  7573. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7574. ReleaseOperand(l);
  7575. SetLabel(end);
  7576. ELSE
  7577. SetLabel(exit);
  7578. END;
  7579. *)
  7580. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7581. ELSE (* no pointer to record, no pointer to array *)
  7582. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7583. (* ignore new statement *)
  7584. Warning(p0.position, "cannot run on final hardware");
  7585. ELSE
  7586. HALT(200);
  7587. END;
  7588. END;
  7589. (* ---- ADDRESSOF----- *)
  7590. |Global.systemAdr:
  7591. Designate(p0,s0);
  7592. s0.mode := ModeValue;
  7593. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7594. ReleaseIntermediateOperand(s0.op);
  7595. s0.op := s0.tag;
  7596. IntermediateCode.InitOperand(s0.tag);
  7597. END;
  7598. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7599. result := s0;
  7600. (* ---- BIT ----- *)
  7601. |Global.systemBit:
  7602. Evaluate(p0,s0);
  7603. ToMemory(s0.op,addressType,0);
  7604. ReuseCopy(res,s0.op);
  7605. ReleaseOperand(s0);
  7606. Evaluate(p1,s1);
  7607. Emit(Ror(position,res,res,s1.op));
  7608. ReleaseOperand(s1);
  7609. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7610. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7611. IF ~conditional THEN
  7612. InitOperand(result,ModeValue); result.op := res;
  7613. ELSE
  7614. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7615. BrL(falseLabel);
  7616. ReleaseIntermediateOperand(res);
  7617. END;
  7618. (* --- MSK ----*)
  7619. |Global.systemMsk:
  7620. Evaluate(p0,s0);
  7621. Evaluate(p1,s1);
  7622. ReuseCopy(res,s0.op);
  7623. ReleaseOperand(s0);
  7624. Emit(And(position,res,res,s1.op));
  7625. ReleaseOperand(s1);
  7626. InitOperand(result,ModeValue);
  7627. result.op := res;
  7628. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7629. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7630. Evaluate(p0,s0);
  7631. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7632. ReleaseOperand(s0);
  7633. InitOperand(result,ModeValue);
  7634. result.op := res;
  7635. (* ---- SYSTEM.GetStackPointer ----- *)
  7636. |Global.systemGetStackPointer:
  7637. InitOperand(result,ModeValue);
  7638. result.op := sp;
  7639. (* ---- SYSTEM.GetFramePointer ----- *)
  7640. |Global.systemGetFramePointer:
  7641. InitOperand(result,ModeValue);
  7642. result.op := fp;
  7643. (* ---- SYSTEM.GetActivity ----- *)
  7644. |Global.systemGetActivity:
  7645. ASSERT(backend.cooperative);
  7646. InitOperand(result,ModeValue);
  7647. result.op := ap;
  7648. (* ---- SYSTEM.SetStackPointer ----- *)
  7649. |Global.systemSetStackPointer:
  7650. Evaluate(p0,s0); (* *)
  7651. Emit(Mov(position,sp,s0.op));
  7652. ReleaseOperand(s0);
  7653. (* ---- SYSTEM.SetFramePointer ----- *)
  7654. |Global.systemSetFramePointer:
  7655. Evaluate(p0,s0); (* *)
  7656. Emit(Mov(position,fp,s0.op));
  7657. ReleaseOperand(s0);
  7658. (* ---- SYSTEM.Activity ----- *)
  7659. |Global.systemSetActivity:
  7660. ASSERT(backend.cooperative);
  7661. Evaluate(p0,s0); (* *)
  7662. Emit(Mov(position,ap,s0.op));
  7663. ReleaseOperand(s0);
  7664. (* ---- SYSTEM.VAL ----- *)
  7665. |Global.systemVal:
  7666. Expression(p1);
  7667. s1 := result;
  7668. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7669. IF s1.mode = ModeReference THEN
  7670. (* nothing to be done if not record type, just take over new type *)
  7671. IF (type IS SyntaxTree.RecordType) THEN
  7672. ReleaseIntermediateOperand(s1.tag);
  7673. s1.tag := TypeDescriptorAdr(type);
  7674. IF ~newObjectFile THEN
  7675. IntermediateCode.MakeMemory(s1.tag,addressType);
  7676. END;
  7677. UseIntermediateOperand(s1.tag);
  7678. END;
  7679. result := s1;
  7680. ELSE (* copy over result to different type, may not use convert *)
  7681. itype := IntermediateCode.GetType(system,type);
  7682. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7683. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7684. Emit(Mov(position,s0.op,s1.op));
  7685. ReleaseOperand(s1);
  7686. InitOperand(result,ModeValue);
  7687. result.op := s0.op;
  7688. ELSE (* different size, must convert *)
  7689. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7690. Convert(s1.op, IntermediateCode.GetType(system,type));
  7691. result := s1;
  7692. END;
  7693. END;
  7694. (* ---- SYSTEM.GET ----- *)
  7695. |Global.systemGet:
  7696. Evaluate(p0,s0); (* adr *)
  7697. Designate(p1,s1); (* variable *)
  7698. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7699. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7700. Emit(Mov(position,s1.op,s0.op));
  7701. ReleaseOperand(s1);
  7702. ReleaseOperand(s0);
  7703. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7704. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7705. Evaluate(p0,s0); (* *)
  7706. Evaluate(p1,s1); (* variable *)
  7707. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7708. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7709. (* real part *)
  7710. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7711. Emit(Mov(position,res, s1.op));
  7712. ReleaseIntermediateOperand(res);
  7713. (* imaginary part *)
  7714. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7715. Emit(Mov(position,res, s1.tag));
  7716. ReleaseIntermediateOperand(res);
  7717. ReleaseOperand(s1);
  7718. ReleaseOperand(s0);
  7719. ELSE
  7720. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7721. ReleaseOperand(s0);
  7722. Emit(Mov(position,res,s1.op));
  7723. ReleaseIntermediateOperand(res);
  7724. ReleaseOperand(s1);
  7725. END;
  7726. (* ---- SYSTEM.MOVE ----- *)
  7727. |Global.systemMove:
  7728. Evaluate(p0,s0);
  7729. Evaluate(p1,s1);
  7730. Evaluate(p2,s2);
  7731. Emit(Copy(position,s1.op,s0.op,s2.op));
  7732. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7733. (* ---- SYSTEM.NEW ----- *)
  7734. |Global.systemNew:
  7735. Designate(p0,s0);
  7736. Emit(Push(position,s0.op));
  7737. ReleaseOperand(s0);
  7738. Evaluate(p1,s1);
  7739. Emit(Push(position,s1.op));
  7740. ReleaseOperand(s1);
  7741. (* push realtime flag: false by default *)
  7742. Emit(Push(position,false));
  7743. CallThis(position,"Heaps","NewSys",3);
  7744. (* ---- SYSTEM.CALL ----- *)
  7745. |Global.systemRef:
  7746. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7747. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7748. s0.mode := ModeValue;
  7749. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7750. result := s0
  7751. (* ---- INCR ----- *)
  7752. |Global.Incr:
  7753. Designate(p0,operand);
  7754. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7755. Dereference(operand,p0.type.resolved,FALSE);
  7756. END;
  7757. ASSERT(p1 # NIL);
  7758. Evaluate(p1,l);
  7759. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7760. ReleaseOperand(operand); ReleaseOperand(l);
  7761. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7762. (* ---- SUM ----- *)
  7763. |Global.Sum: HALT(200);
  7764. (* ---- ALL ----- *)
  7765. |Global.All: HALT(200);
  7766. (* ---- CAS ----- *)
  7767. |Global.Cas:
  7768. needsTrace := p0.NeedsTrace();
  7769. IF needsTrace THEN ModifyAssignments(true) END;
  7770. Designate(p0,s0);
  7771. Evaluate(p1,s1);
  7772. Evaluate(p2,s2);
  7773. IF needsTrace THEN
  7774. Emit(Push(position, s0.op));
  7775. Emit(Push(position, s1.op));
  7776. Emit(Push(position, s2.op));
  7777. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7778. ELSE
  7779. Emit(Cas(position,s0.op,s1.op,s2.op));
  7780. END;
  7781. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7782. IF needsTrace THEN ModifyAssignments(false) END;
  7783. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7784. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7785. IF conditional THEN
  7786. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7787. BrL(falseLabel);
  7788. ReleaseIntermediateOperand(res);
  7789. END;
  7790. (* ---- DIM ----- *)
  7791. |Global.Dim:
  7792. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7793. Designate(p0,s0);
  7794. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7795. Dereference(s0,p0.type.resolved,FALSE);
  7796. END;
  7797. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7798. ReleaseOperand(s0);
  7799. (* ---- RESHAPE ----- *)
  7800. |Global.Reshape:
  7801. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7802. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7803. left.SetType(procedure.type);
  7804. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7805. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7806. END;
  7807. (* ---- SYSTEM.TYPECODE ----- *)
  7808. |Global.systemTypeCode:
  7809. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7810. IF type.resolved IS SyntaxTree.PointerType THEN
  7811. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7812. END;
  7813. result.op := TypeDescriptorAdr(type);
  7814. IF ~newObjectFile THEN
  7815. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7816. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7817. END;
  7818. result.mode := ModeValue;
  7819. (* ---- SYSTEM.TRACE ----- *)
  7820. |Global.systemTrace:
  7821. SystemTrace(x.parameters, x.position);
  7822. (* ----- CONNECT ------*)
  7823. |Global.Connect:
  7824. IF backend.cellsAreObjects THEN
  7825. PushPort(p0);
  7826. PushPort(p1);
  7827. IF p2 # NIL THEN
  7828. Evaluate(p2, s2);
  7829. Emit(Push(p2.position, s2.op));
  7830. ReleaseOperand(s2);
  7831. ELSE
  7832. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7833. END;
  7834. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7835. ELSE
  7836. Warning(x.position, "cannot run on final hardware");
  7837. END;
  7838. (* ----- DELEGATE ------*)
  7839. |Global.Delegate:
  7840. IF backend.cellsAreObjects THEN
  7841. PushPort(p0);
  7842. PushPort(p1);
  7843. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7844. ELSE
  7845. Warning(x.position, "cannot run on final hardware");
  7846. END;
  7847. (* ----- SEND ------*)
  7848. |Global.Send:
  7849. Evaluate(p0,s0);
  7850. Evaluate(p1,s1);
  7851. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7852. Emit(Push(position,s0.op));
  7853. Emit(Push(position,s1.op));
  7854. (*
  7855. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7856. *)
  7857. IF ~backend.cellsAreObjects THEN
  7858. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7859. END;
  7860. ReleaseOperand(s0);
  7861. ReleaseOperand(s1);
  7862. IF backend.cellsAreObjects THEN
  7863. CallThis(position,"ActiveCellsRuntime","Send",2);
  7864. ELSE
  7865. CallThis(position,ChannelModuleName,"Send",2);
  7866. END;
  7867. (* ----- RECEIVE ------*)
  7868. |Global.Receive:
  7869. Evaluate(p0,s0);
  7870. Emit(Push(position,s0.op));
  7871. Designate(p1,s1);
  7872. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7873. Emit(Push(position,s1.op));
  7874. IF p2 # NIL THEN
  7875. Designate(p2,s2);
  7876. Emit(Push(position,s2.op));
  7877. END;
  7878. (*
  7879. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7880. *)
  7881. IF ~backend.cellsAreObjects THEN
  7882. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7883. END;
  7884. ReleaseOperand(s0);
  7885. ReleaseOperand(s1);
  7886. ReleaseOperand(s2);
  7887. IF backend.cellsAreObjects THEN
  7888. IF p2 = NIL THEN
  7889. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7890. ELSE
  7891. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7892. END;
  7893. ELSE
  7894. IF p2 = NIL THEN
  7895. CallThis(position,ChannelModuleName,"Receive",2)
  7896. ELSE
  7897. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7898. END;
  7899. END;
  7900. | Global.systemSpecial:
  7901. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7902. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7903. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7904. (* determine if parameters are of the VAR kind *)
  7905. ASSERT(x.parameters.Length() <= 3);
  7906. formalParameter := procedureType.firstParameter;
  7907. FOR i := 0 TO x.parameters.Length() - 1 DO
  7908. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7909. formalParameter := formalParameter.nextParameter
  7910. END;
  7911. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7912. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7913. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7914. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7915. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7916. IF procedureType.returnType # NIL THEN
  7917. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7918. Emit(Result(position, res));
  7919. (*InitOperand(result,ModeValue);
  7920. result.op := res;
  7921. *)
  7922. IF ~conditional THEN
  7923. InitOperand(result,ModeValue); result.op := res;
  7924. ELSE
  7925. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7926. BrL(falseLabel);
  7927. ReleaseIntermediateOperand(res);
  7928. END;
  7929. END
  7930. ELSE (* function not yet implemented *)
  7931. Error(position,"not yet implemented");
  7932. END;
  7933. destination := dest;
  7934. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  7935. END VisitBuiltinCallDesignator;
  7936. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  7937. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  7938. BEGIN
  7939. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  7940. dest := destination; destination := emptyOperand;
  7941. Expression(x.left);
  7942. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  7943. ELSIF isUnchecked THEN (* no check *)
  7944. ELSE
  7945. trueL := NewLabel();
  7946. falseL := NewLabel();
  7947. IF IsPointerToRecord(x.left.type,recordType) THEN
  7948. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7949. Emit(Mov(position,tag, result.op));
  7950. IF result.mode # ModeValue THEN
  7951. ptr := tag;
  7952. IntermediateCode.MakeMemory(ptr,addressType);
  7953. Emit(Mov(position,tag, ptr));
  7954. END;
  7955. IF ~backend.cooperative THEN
  7956. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7957. END;
  7958. IntermediateCode.MakeMemory(tag,addressType);
  7959. ELSE
  7960. tag := result.tag;
  7961. END;
  7962. TypeTest(tag,x.type,trueL,falseL);
  7963. ReleaseIntermediateOperand(tag);
  7964. SetLabel(falseL);
  7965. EmitTrap(position,TypeCheckTrap);
  7966. SetLabel(trueL);
  7967. END;
  7968. destination := dest;
  7969. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  7970. END VisitTypeGuardDesignator;
  7971. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  7972. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  7973. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  7974. VAR label: Label; pc: LONGINT;
  7975. BEGIN
  7976. IF backend.cooperative & ~isUnchecked THEN
  7977. pc := section.pc;
  7978. label := NewLabel();
  7979. BrneL(label, operand.op, nil);
  7980. EmitTrap(position, NilPointerTrap);
  7981. SetLabel(label);
  7982. INC(statCoopNilCheck, section.pc - pc);
  7983. END;
  7984. END NilCheck;
  7985. BEGIN
  7986. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  7987. ReuseCopy(dereferenced,operand.op);
  7988. ReleaseOperand(operand);
  7989. operand.mode := ModeReference;
  7990. operand.op := dereferenced;
  7991. operand.tag := dereferenced;
  7992. UseIntermediateOperand(operand.tag);
  7993. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  7994. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  7995. ReleaseIntermediateOperand(operand.tag);
  7996. operand.tag := TypeDescriptorAdr(type);
  7997. IF ~newObjectFile THEN
  7998. IntermediateCode.MakeMemory(operand.tag,addressType);
  7999. END;
  8000. ELSE
  8001. IF ~backend.cooperative THEN
  8002. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8003. END;
  8004. IntermediateCode.MakeMemory(operand.tag,addressType);
  8005. END;
  8006. NilCheck(operand.op);
  8007. ELSIF type IS SyntaxTree.ArrayType THEN
  8008. IF isUnsafe THEN
  8009. NilCheck(operand.op);
  8010. ReleaseIntermediateOperand(operand.tag);
  8011. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8012. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8013. ELSE
  8014. operand.tag := emptyOperand;
  8015. END;
  8016. ELSE
  8017. NilCheck(operand.op);
  8018. IF backend.cooperative THEN
  8019. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8020. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8021. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8022. ELSE
  8023. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8024. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8025. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8026. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8027. END;
  8028. END;
  8029. ELSIF type IS SyntaxTree.MathArrayType THEN
  8030. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8031. IntermediateCode.MakeMemory(operand.op,addressType);
  8032. ELSE HALT(100);
  8033. END;
  8034. END Dereference;
  8035. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8036. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8037. BEGIN
  8038. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8039. dest := destination; destination := emptyOperand;
  8040. Evaluate(x.left,d);
  8041. type := x.type.resolved;
  8042. prevIsUnchecked := isUnchecked;
  8043. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8044. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8045. END;
  8046. Dereference(d,type,IsUnsafePointer(x.left.type));
  8047. isUnchecked := prevIsUnchecked;
  8048. result := d;
  8049. 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
  8050. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8051. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8052. END;
  8053. END;
  8054. destination := dest;
  8055. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8056. END VisitDereferenceDesignator;
  8057. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8058. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8059. BEGIN
  8060. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8061. dest := destination; destination := emptyOperand;
  8062. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8063. tag := result.op;
  8064. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8065. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8066. StaticCallOperand(result,procedure.super);
  8067. ReleaseIntermediateOperand(result.tag);
  8068. UseIntermediateOperand(tag); (* necessary ? *)
  8069. result.tag := tag;
  8070. destination := dest;
  8071. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8072. END VisitSupercallDesignator;
  8073. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8074. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8075. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8076. name: Basic.SegmentedName;
  8077. BEGIN
  8078. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8079. dest := destination; destination := emptyOperand;
  8080. scope := currentScope;
  8081. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8082. scope := scope.outerScope;
  8083. END;
  8084. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8085. IF newObjectFile THEN
  8086. moduleSection := meta.ModuleSection();
  8087. IF backend.cooperative THEN
  8088. moduleOffset := 0;
  8089. ELSE
  8090. moduleOffset := moduleSection.pc;
  8091. END;
  8092. result.mode := ModeValue;
  8093. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8094. ELSE
  8095. Symbol(moduleSelf,result);
  8096. IntermediateCode.MakeMemory(result.op,addressType);
  8097. END
  8098. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8099. result.mode := ModeValue;
  8100. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8101. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8102. ELSE
  8103. GetBaseRegister(basereg,currentScope,scope);
  8104. InitOperand(result,ModeReference);
  8105. result.op := basereg;
  8106. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  8107. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  8108. IF backend.cooperative THEN
  8109. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8110. END;
  8111. (* tag must be loaded when dereferencing SELF pointer *)
  8112. END;
  8113. destination := dest;
  8114. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8115. END VisitSelfDesignator;
  8116. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8117. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8118. BEGIN
  8119. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8120. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8121. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8122. parameter := procedureType.returnParameter;
  8123. VisitParameter(parameter);
  8124. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8125. END VisitResultDesignator;
  8126. (** values *)
  8127. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8128. BEGIN
  8129. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8130. IF conditional THEN
  8131. IF x.value THEN BrL(trueLabel)
  8132. ELSE BrL(falseLabel)
  8133. END;
  8134. ELSE
  8135. InitOperand(result,ModeValue);
  8136. IF x.value THEN result.op := true ELSE result.op := false END;
  8137. END;
  8138. END VisitBooleanValue;
  8139. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8140. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8141. BEGIN
  8142. Global.GetModuleSegmentedName(module.module, name);
  8143. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8144. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8145. RETURN section
  8146. END GetDataSection;
  8147. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8148. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8149. BEGIN
  8150. type := vop.type;
  8151. data := GetDataSection();
  8152. pc := EnterImmediate(data,vop);
  8153. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8154. IntermediateCode.MakeMemory(vop, type);
  8155. END GetImmediateMem;
  8156. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8157. BEGIN
  8158. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8159. InitOperand(result,ModeValue);
  8160. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8161. IF ~supportedImmediate(result.op) &~inData THEN
  8162. GetImmediateMem(result.op)
  8163. END;
  8164. END VisitIntegerValue;
  8165. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8166. BEGIN
  8167. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8168. InitOperand(result,ModeValue);
  8169. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8170. END VisitCharacterValue;
  8171. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8172. BEGIN
  8173. IF Trace THEN TraceEnter("VisitSetValue") END;
  8174. InitOperand(result,ModeValue);
  8175. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8176. END VisitSetValue;
  8177. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8178. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8179. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8180. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8181. BEGIN
  8182. numberElements := x.elements.Length();
  8183. FOR i := 0 TO numberElements-1 DO
  8184. expression := x.elements.GetExpression(i);
  8185. IF expression IS SyntaxTree.MathArrayExpression THEN
  8186. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8187. ELSE
  8188. inData := TRUE;
  8189. Evaluate(expression,op);
  8190. irv.Emit(Data(position,op.op));
  8191. inData := FALSE;
  8192. ReleaseOperand(op);
  8193. END;
  8194. END;
  8195. END RecursiveData;
  8196. BEGIN
  8197. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8198. IF ~TryConstantDeclaration() THEN
  8199. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8200. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8201. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8202. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8203. ELSE
  8204. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8205. END;
  8206. RecursiveData(x.array);
  8207. InitOperand(result,ModeReference);
  8208. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8209. END
  8210. END VisitMathArrayValue;
  8211. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8212. VAR constant: Sections.Section;
  8213. BEGIN
  8214. IF constantDeclaration = NIL THEN
  8215. RETURN FALSE
  8216. ELSE
  8217. (* Is a constant in this module: did we generate it already? *)
  8218. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8219. IF constant # NIL THEN
  8220. InitOperand(result,ModeReference);
  8221. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8222. RETURN TRUE;
  8223. END;
  8224. END;
  8225. RETURN FALSE
  8226. END TryConstantDeclaration;
  8227. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8228. BEGIN
  8229. constantDeclaration := x;
  8230. x.value.resolved.Accept(SELF);
  8231. END VisitConstant;
  8232. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8233. BEGIN
  8234. IF Trace THEN TraceEnter("VisitRealValue") END;
  8235. InitOperand(result,ModeValue);
  8236. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8237. END VisitRealValue;
  8238. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8239. VAR
  8240. componentType: SyntaxTree.Type;
  8241. BEGIN
  8242. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8243. ASSERT(x.type IS SyntaxTree.ComplexType);
  8244. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8245. InitOperand(result,ModeValue);
  8246. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8247. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8248. END VisitComplexValue;
  8249. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8250. VAR i: LONGINT; name: Basic.SegmentedName;
  8251. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8252. BEGIN
  8253. IF Trace THEN TraceEnter("VisitStringValue") END;
  8254. IF ~TryConstantDeclaration() THEN
  8255. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8256. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8257. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8258. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8259. ELSE
  8260. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8261. END;
  8262. FOR i := 0 TO x.length-1 DO
  8263. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8264. irv.Emit(Data(position,op));
  8265. END;
  8266. InitOperand(result,ModeReference);
  8267. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8268. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8269. END
  8270. END VisitStringValue;
  8271. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8272. BEGIN
  8273. IF Trace THEN TraceEnter("VisitNilValue") END;
  8274. InitOperand(result,ModeValue);
  8275. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8276. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8277. END VisitNilValue;
  8278. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8279. BEGIN
  8280. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8281. InitOperand(result,ModeValue);
  8282. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8283. END VisitEnumerationValue;
  8284. (** symbols *)
  8285. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8286. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8287. END VisitImport;
  8288. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8289. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8290. BEGIN
  8291. IF scope # baseScope THEN
  8292. (* left := [fp+8] *)
  8293. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8294. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8295. ReuseCopy(left,right);
  8296. ReleaseIntermediateOperand(right);
  8297. scope := scope.outerScope; DEC(level);
  8298. (* { left := [left+8] } *)
  8299. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8300. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8301. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8302. Emit(Mov(position,left,right));
  8303. scope := scope.outerScope; DEC(level);
  8304. END;
  8305. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8306. result := left;
  8307. ELSE
  8308. result := fp;
  8309. END;
  8310. END GetBaseRegister;
  8311. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8312. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8313. BEGIN
  8314. IF Trace THEN TraceEnter("VisitVariable"); END;
  8315. type := x.type.resolved;
  8316. IF (x.useRegister) THEN
  8317. InitOperand(result, ModeValue);
  8318. IF x.registerNumber < 0 THEN
  8319. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8320. reg := x.registerNumber;
  8321. ELSE
  8322. reg := registerUsageCount.Map(x.registerNumber);
  8323. UseRegister(reg);
  8324. END;
  8325. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8326. ELSIF x.externalName # NIL THEN
  8327. InitOperand(result,ModeReference);
  8328. Basic.ToSegmentedName(x.externalName^, name);
  8329. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8330. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8331. InitOperand(result,ModeReference);
  8332. GetBaseRegister(result.op,currentScope,x.scope);
  8333. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8334. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8335. InitOperand(result,ModeReference);
  8336. GetCodeSectionNameForSymbol(x,name);
  8337. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8338. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8339. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8340. InitOperand(result,ModeReference);
  8341. GetCodeSectionNameForSymbol(x,name);
  8342. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8343. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8344. ELSE (* field, left designator must have been emitted *)
  8345. ASSERT(result.mode = ModeReference);
  8346. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8347. ReuseCopy(temp,result.op);
  8348. ReleaseIntermediateOperand(result.op);
  8349. result.op := temp;
  8350. END;
  8351. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8352. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8353. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8354. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8355. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8356. END;
  8357. END;
  8358. END;
  8359. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8360. ValueToCondition(result);
  8361. ELSIF type IS SyntaxTree.ProcedureType THEN
  8362. ReleaseIntermediateOperand(result.tag);
  8363. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8364. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8365. UseIntermediateOperand(result.tag);
  8366. ELSE
  8367. result.tag := nil; (* nil *)
  8368. END;
  8369. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8370. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8371. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8372. ReleaseIntermediateOperand(result.tag);
  8373. Global.GetSymbolSegmentedName(x,name);
  8374. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8375. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8376. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8377. ELSE
  8378. END;
  8379. ELSE
  8380. ReleaseIntermediateOperand(result.tag);
  8381. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8382. END;
  8383. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8384. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8385. ReleaseIntermediateOperand(result.tag);
  8386. result.tag := result.op;
  8387. UseIntermediateOperand(result.tag);
  8388. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8389. IntermediateCode.MakeMemory(result.op,addressType);
  8390. END;
  8391. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8392. ReleaseIntermediateOperand(result.tag);
  8393. result.tag := TypeDescriptorAdr(type);
  8394. IF ~newObjectFile THEN
  8395. IntermediateCode.MakeMemory(result.tag,addressType);
  8396. END;
  8397. UseIntermediateOperand(result.tag);
  8398. (* tag for pointer type computed not here but during dereferencing *)
  8399. END;
  8400. IF Trace THEN TraceExit("VisitVariable") END;
  8401. END VisitVariable;
  8402. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8403. BEGIN
  8404. VisitVariable(property);
  8405. END VisitProperty;
  8406. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8407. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8408. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8409. BEGIN
  8410. type := x.type.resolved;
  8411. IF Trace THEN TraceEnter("VisitParameter") END;
  8412. IF x.ownerType IS SyntaxTree.CellType THEN
  8413. ptype := x.type.resolved;
  8414. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8415. IF ~(ptype IS SyntaxTree.PortType) THEN
  8416. InitOperand(result,ModeReference);
  8417. GetCodeSectionNameForSymbol(x,name);
  8418. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8419. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8420. RETURN
  8421. ELSE
  8422. InitOperand(result, ModeValue);
  8423. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8424. adr := 0;
  8425. WHILE parameter # x DO
  8426. parameterType := parameter.type;
  8427. inc := 1;
  8428. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8429. INC(adr, inc);
  8430. parameter := parameter.nextParameter
  8431. END;
  8432. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8433. RETURN
  8434. END;
  8435. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8436. InitOperand(result,ModeReference);
  8437. GetCodeSectionNameForSymbol(x,name);
  8438. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8439. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8440. RETURN
  8441. ELSE
  8442. GetBaseRegister(basereg,currentScope,x.scope);
  8443. InitOperand(result,ModeReference);
  8444. result.op := basereg;
  8445. END;
  8446. IF IsOpenArray(type) THEN
  8447. result.tag := basereg;
  8448. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8449. IntermediateCode.MakeMemory(result.op,addressType);
  8450. IF Global.IsOberonProcedure(x.ownerType) THEN
  8451. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8452. UseIntermediateOperand(result.tag);
  8453. ELSE
  8454. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8455. END;
  8456. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8457. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8458. ELSIF IsStaticArray(type) THEN
  8459. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8460. IntermediateCode.MakeMemory(result.op,addressType);
  8461. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8462. ELSIF type IS SyntaxTree.MathArrayType THEN
  8463. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8464. WITH type: SyntaxTree.MathArrayType DO
  8465. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8466. IF type.form = SyntaxTree.Tensor THEN
  8467. ELSIF type.form = SyntaxTree.Open THEN
  8468. result.tag := result.op;
  8469. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8470. IntermediateCode.MakeMemory(result.op,addressType);
  8471. UseIntermediateOperand(result.tag);
  8472. ELSIF type.form = SyntaxTree.Static THEN
  8473. IF x.kind = SyntaxTree.ConstParameter THEN
  8474. IntermediateCode.MakeMemory(result.op,addressType);
  8475. END;
  8476. ELSE HALT(100)
  8477. END;
  8478. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8479. IF type.form = SyntaxTree.Tensor THEN
  8480. ToMemory(result.op,addressType,0);
  8481. ELSIF type.form = SyntaxTree.Open THEN
  8482. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8483. ReuseCopy(result.tag, mem);
  8484. ReleaseIntermediateOperand(mem);
  8485. ReleaseIntermediateOperand(result.op);
  8486. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8487. ELSIF type.form = SyntaxTree.Static THEN
  8488. IntermediateCode.MakeMemory(result.op,addressType);
  8489. ELSE HALT(100)
  8490. END;
  8491. ELSE HALT(100)
  8492. END;
  8493. END;
  8494. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8495. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8496. IntermediateCode.MakeMemory(result.op,addressType);
  8497. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8498. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8499. END;
  8500. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8501. ValueToCondition(result);
  8502. ELSIF type IS SyntaxTree.ProcedureType THEN
  8503. ReleaseIntermediateOperand(result.tag);
  8504. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8505. IF x.kind = SyntaxTree.VarParameter THEN
  8506. ReuseCopy(result.tag,result.op);
  8507. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8508. IntermediateCode.MakeMemory(result.tag,addressType);
  8509. ELSE
  8510. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8511. UseIntermediateOperand(result.tag);
  8512. END;
  8513. ELSE
  8514. result.tag := nil;
  8515. END;
  8516. (* tag for pointer type computed not here but during dereferencing *)
  8517. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8518. ReleaseIntermediateOperand(result.tag);
  8519. result.tag := basereg;
  8520. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8521. IntermediateCode.MakeMemory(result.tag,addressType);
  8522. UseIntermediateOperand(result.tag);
  8523. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8524. ReleaseIntermediateOperand(result.tag);
  8525. result.tag := TypeDescriptorAdr(type);
  8526. IF ~newObjectFile THEN
  8527. IntermediateCode.MakeMemory(result.tag,addressType);
  8528. END;
  8529. UseIntermediateOperand(result.tag);
  8530. END;
  8531. IF Trace THEN TraceExit("VisitParameter") END;
  8532. END VisitParameter;
  8533. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8534. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8535. BEGIN
  8536. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8537. (* left.p: left already emitted *)
  8538. tag := result.op; (* value of pointer to left *)
  8539. (* get type desc *)
  8540. tmp := result.tag;
  8541. IntermediateCode.MakeMemory(tmp,addressType);
  8542. (* get method adr *)
  8543. Reuse1(reg,tmp);
  8544. ReleaseIntermediateOperand(tmp);
  8545. IF backend.cooperative THEN
  8546. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8547. WHILE recordType.baseType # NIL DO
  8548. recordType := recordType.GetBaseRecord ();
  8549. END;
  8550. GetRecordTypeName (recordType,name);
  8551. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8552. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8553. offset := 0;
  8554. ELSE
  8555. offset := 2;
  8556. END;
  8557. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8558. ELSE
  8559. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8560. END;
  8561. InitOperand(operand,ModeReference);
  8562. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8563. operand.op := reg;
  8564. operand.tag := tag;
  8565. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8566. END DynamicCallOperand;
  8567. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8568. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8569. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8570. BEGIN
  8571. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8572. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8573. tag := operand.op;
  8574. ReleaseIntermediateOperand(operand.tag);
  8575. ELSE tag := nil
  8576. END;
  8577. IF x.isInline THEN
  8578. sectionType := Sections.InlineCodeSection;
  8579. ELSE
  8580. sectionType := Sections.CodeSection;
  8581. END;
  8582. IF x.externalName # NIL THEN
  8583. Basic.ToSegmentedName(x.externalName^, name);
  8584. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8585. ELSE
  8586. GetCodeSectionNameForSymbol(x, name);
  8587. IF (x.scope.ownerModule = module.module) THEN
  8588. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8589. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8590. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8591. IF source.pc = 0 THEN (* no code yet *)
  8592. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8593. END;
  8594. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8595. bits := x.procedureScope.body.code.inlineCode;
  8596. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8597. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8598. binary.CopyBits(bits, 0, bits.GetSize());
  8599. source.SetResolved(binary);
  8600. ELSE
  8601. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8602. END;
  8603. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8604. END;
  8605. InitOperand(operand,ModeValue);
  8606. operand.op := reg;
  8607. operand.tag := tag;
  8608. IF Trace THEN TraceExit("StaticCallOperand") END;
  8609. END StaticCallOperand;
  8610. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8611. (* handle expressions of the form designator.procedure or procedure *)
  8612. BEGIN
  8613. IF Trace THEN TraceEnter("VisitProcedure") END;
  8614. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8615. DynamicCallOperand(result,x);
  8616. ELSIF x.isInline THEN
  8617. StaticCallOperand(result,x);
  8618. ELSE
  8619. StaticCallOperand(result,x);
  8620. END;
  8621. IF Trace THEN TraceExit("VisitProcedure") END;
  8622. END VisitProcedure;
  8623. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8624. BEGIN
  8625. VisitProcedure(x);
  8626. END VisitOperator;
  8627. (** statements *)
  8628. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8629. BEGIN
  8630. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8631. Expression(x.call);
  8632. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8633. ReleaseOperand(result)
  8634. END;
  8635. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8636. END VisitProcedureCallStatement;
  8637. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8638. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8639. leftBase, rightBase: SyntaxTree.Type;
  8640. procedureName,s: SyntaxTree.IdentifierString;
  8641. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8642. size: LONGINT; rightKind: LONGINT;
  8643. dummy: IntermediateCode.Operand;
  8644. CONST moduleName = "FoxArrayBase";
  8645. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8646. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8647. BEGIN
  8648. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8649. IF base IS SyntaxTree.MathArrayType THEN
  8650. base := OpenArray(base(SyntaxTree.MathArrayType));
  8651. END;
  8652. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8653. result.SetArrayBase(base);
  8654. RETURN result
  8655. END OpenArray;
  8656. BEGIN
  8657. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8658. SaveRegisters();ReleaseUsedRegisters(saved);
  8659. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8660. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8661. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8662. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8663. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8664. IF leftType.form = SyntaxTree.Tensor THEN
  8665. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8666. ELSIF leftType.form = SyntaxTree.Open THEN
  8667. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8668. ELSIF leftType.form = SyntaxTree.Static THEN
  8669. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8670. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8671. END;
  8672. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8673. IF procedure = NIL THEN
  8674. s := "Instruction not supported on target, emulation procedure ";
  8675. Strings.Append(s,moduleName);
  8676. Strings.Append(s,".");
  8677. Strings.Append(s,procedureName);
  8678. Strings.Append(s," not present");
  8679. Error(position,s);
  8680. ELSE
  8681. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8682. parameter.SetType(leftType);
  8683. parameter.SetAccess(SyntaxTree.Internal);
  8684. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8685. parameter.SetKind(rightKind);
  8686. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8687. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8688. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8689. StaticCallOperand(result,procedure);
  8690. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8691. ReleaseOperand(result);
  8692. END;
  8693. RestoreRegisters(saved);
  8694. END;
  8695. END AssignMathArray;
  8696. VAR modifyAssignmentCounter := 0: LONGINT;
  8697. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8698. VAR processor,mem,dst: IntermediateCode.Operand;
  8699. BEGIN
  8700. IF value.intValue = true.intValue THEN
  8701. INC(modifyAssignmentCounter);
  8702. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8703. modifyAssignmentsPC := section.pc;
  8704. ELSE
  8705. DEC(modifyAssignmentCounter);
  8706. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8707. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8708. END;
  8709. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8710. dst := NewRegisterOperand (addressType);
  8711. Emit(Mov(position,dst, processor));
  8712. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8713. Emit(Mov(position,mem, value));
  8714. ReleaseIntermediateOperand(dst);
  8715. END ModifyAssignments;
  8716. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8717. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8718. BEGIN
  8719. type := left.type.resolved;
  8720. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8721. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8722. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8723. IF procedureType.returnParameter = parameter THEN
  8724. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8725. END;
  8726. END;
  8727. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8728. END CopySize;
  8729. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8730. VAR
  8731. leftO, rightO: Operand;
  8732. mem, sizeOp: IntermediateCode.Operand;
  8733. leftType, rightType, componentType: SyntaxTree.Type;
  8734. size: LONGINT;
  8735. parameters: SyntaxTree.ExpressionList;
  8736. procedure: SyntaxTree.Procedure;
  8737. call: SyntaxTree.ProcedureCallDesignator;
  8738. designator: SyntaxTree.Designator;
  8739. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8740. VAR procedureType: SyntaxTree.ProcedureType;
  8741. BEGIN
  8742. IF ReturnedAsParameter(right.type) THEN
  8743. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8744. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8745. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8746. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8747. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8748. IF right.id = Global.Reshape THEN RETURN TRUE
  8749. END;
  8750. END;
  8751. END;
  8752. END;
  8753. RETURN FALSE
  8754. END CanPassAsResultParameter;
  8755. BEGIN
  8756. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8757. leftType := left.type.resolved; rightType:= right.type.resolved;
  8758. IF backend.cooperative & left.NeedsTrace() THEN
  8759. ModifyAssignments(true);
  8760. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8761. Designate(right, rightO);
  8762. Designate(left, leftO);
  8763. ASSERT(leftO.mode = ModeReference);
  8764. TransferToRegister(leftO.op, leftO.op);
  8765. TransferToRegister(rightO.op, rightO.op);
  8766. Emit(Push(position, leftO.op));
  8767. Emit(Push(position, rightO.op));
  8768. CallAssignMethod(leftO.op, rightO.op, left.type);
  8769. Emit(Pop(position, rightO.op));
  8770. Emit(Pop(position, leftO.op));
  8771. sizeOp := CopySize(left);
  8772. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8773. ReleaseOperand(leftO);
  8774. ReleaseOperand(rightO);
  8775. ELSE
  8776. Evaluate(right,rightO);
  8777. Designate(left,leftO);
  8778. ASSERT(leftO.mode = ModeReference);
  8779. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8780. (* copy procedure address first *)
  8781. MakeMemory(mem,leftO.op,addressType,0);
  8782. Emit(Mov(position,mem,rightO.op));
  8783. ReleaseIntermediateOperand(mem);
  8784. (* copy pointer address *)
  8785. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8786. CallAssignPointer(leftO.tag, rightO.tag);
  8787. ELSE
  8788. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8789. CallAssignPointer(leftO.op, rightO.op);
  8790. END;
  8791. ReleaseOperand(leftO);
  8792. ReleaseOperand(rightO);
  8793. END;
  8794. ModifyAssignments(false);
  8795. RETURN;
  8796. END;
  8797. IF CanPassAsResultParameter(right) THEN
  8798. procedureResultDesignator := left(SyntaxTree.Designator);
  8799. Expression(right);
  8800. procedureResultDesignator := NIL;
  8801. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8802. (* left <-- ALIAS OF right: zerocopy *)
  8803. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8804. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8805. designator.SetType(procedure.type);
  8806. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8807. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8808. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8809. END;
  8810. ELSIF leftType IS SyntaxTree.RangeType THEN
  8811. (* LHS is of array range type *)
  8812. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8813. Evaluate(right, rightO);
  8814. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8815. (* first *)
  8816. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8817. Emit(Mov(position,mem, rightO.op));
  8818. ReleaseIntermediateOperand(mem);
  8819. (* last *)
  8820. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8821. Emit(Mov(position,mem, rightO.tag));
  8822. ReleaseIntermediateOperand(mem);
  8823. (* step *)
  8824. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8825. Emit(Mov(position,mem, rightO.extra));
  8826. ReleaseIntermediateOperand(mem);
  8827. ReleaseOperand(rightO);
  8828. ReleaseOperand(leftO)
  8829. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8830. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8831. Evaluate(right, rightO);
  8832. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8833. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8834. (* real part *)
  8835. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8836. Emit(Mov(position,mem, rightO.op));
  8837. ReleaseIntermediateOperand(mem);
  8838. (* imaginary part *)
  8839. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8840. Emit(Mov(position,mem, rightO.tag));
  8841. ReleaseIntermediateOperand(mem);
  8842. ReleaseOperand(rightO);
  8843. ReleaseOperand(leftO)
  8844. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8845. OR (leftType IS SyntaxTree.PortType) THEN
  8846. (* rightO := leftO;*)
  8847. Evaluate(right,rightO);
  8848. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8849. Designate(left,leftO);
  8850. IF leftO.mode = ModeReference THEN
  8851. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8852. destination := mem;
  8853. ELSE
  8854. destination := leftO.op;
  8855. END;
  8856. ReleaseOperand(leftO);
  8857. IF destination.mode # IntermediateCode.Undefined THEN
  8858. Emit(Mov(position,destination,rightO.op));
  8859. END;
  8860. ReleaseOperand(rightO);
  8861. ReleaseIntermediateOperand(mem);
  8862. IntermediateCode.InitOperand(destination);
  8863. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8864. Evaluate(right,rightO);
  8865. Designate(left,leftO);
  8866. MakeMemory(mem,leftO.op,addressType,0);
  8867. Emit(Mov(position,mem,rightO.op));
  8868. ReleaseIntermediateOperand(mem);
  8869. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8870. (* delegate *)
  8871. (*
  8872. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8873. *)
  8874. Emit(Mov(position,leftO.tag,rightO.tag));
  8875. END;
  8876. ReleaseOperand(leftO);
  8877. ReleaseOperand(rightO);
  8878. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8879. Designate(right,rightO);
  8880. Designate(left,leftO);
  8881. sizeOp := CopySize(left);
  8882. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8883. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8884. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8885. IF (rightType IS SyntaxTree.StringType) THEN
  8886. CopyString(left,right);
  8887. 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
  8888. Designate(right,rightO);
  8889. Designate(left,leftO);
  8890. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8891. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8892. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8893. ELSE
  8894. HALT(201)
  8895. END;
  8896. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8897. AssignMathArray(left,right);
  8898. ELSE
  8899. HALT(200);
  8900. END;
  8901. END Assign;
  8902. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8903. BEGIN
  8904. IF Trace THEN TraceEnter("VisitAssignment") END;
  8905. Assign(x.left,x.right);
  8906. IF Trace THEN TraceExit("VisitAssignment") END;
  8907. END VisitAssignment;
  8908. PROCEDURE EmitCooperativeSwitch;
  8909. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8910. BEGIN
  8911. ASSERT (cooperativeSwitches);
  8912. pc := section.pc;
  8913. IF lastSwitchPC = section.pc THEN RETURN END;
  8914. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8915. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8916. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8917. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  8918. INC(statCoopSwitch, section.pc - pc);
  8919. END EmitCooperativeSwitch;
  8920. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8921. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  8922. BEGIN
  8923. p0 := communication.left; p1 := communication.right;
  8924. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  8925. Evaluate(p0,s0);
  8926. Evaluate(p1,s1);
  8927. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8928. Emit(Push(position,s0.op));
  8929. Emit(Push(position,s1.op));
  8930. (*
  8931. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8932. *)
  8933. IF ~backend.cellsAreObjects THEN
  8934. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  8935. END;
  8936. ReleaseOperand(s0);
  8937. ReleaseOperand(s1);
  8938. IF backend.cellsAreObjects THEN
  8939. CallThis(position,"ActiveCellsRuntime","Send",2);
  8940. ELSE
  8941. CallThis(position,ChannelModuleName,"Send",2);
  8942. END;
  8943. (* ----- RECEIVE ------*)
  8944. ELSE
  8945. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  8946. tmp := p0; p0 := p1; p1 := tmp;
  8947. END;
  8948. Evaluate(p0,s0);
  8949. Emit(Push(position,s0.op));
  8950. Designate(p1,s1);
  8951. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8952. Emit(Push(position,s1.op));
  8953. (*
  8954. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8955. *)
  8956. IF ~backend.cellsAreObjects THEN
  8957. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  8958. END;
  8959. ReleaseOperand(s0);
  8960. ReleaseOperand(s1);
  8961. IF backend.cellsAreObjects THEN
  8962. CallThis(position,"ActiveCellsRuntime","Receive",2);
  8963. ELSE
  8964. CallThis(position,ChannelModuleName,"Receive",2)
  8965. END;
  8966. END;
  8967. END VisitCommunicationStatement;
  8968. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  8969. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  8970. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  8971. VAR true, false: Label; condition, value: BOOLEAN;
  8972. BEGIN
  8973. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  8974. IF condition THEN
  8975. true := NewLabel();
  8976. false := NewLabel();
  8977. Condition(if.condition,true,false);
  8978. SetLabel(true);
  8979. StatementSequence(if.statements);
  8980. BrL(end);
  8981. SetLabel(false);
  8982. ELSE
  8983. IF value THEN (* always true *)
  8984. escape := TRUE;
  8985. StatementSequence(if.statements);
  8986. (* no branch necessary -- rest skipped *)
  8987. END;
  8988. END;
  8989. END IfPart;
  8990. BEGIN
  8991. IF Trace THEN TraceEnter("VisitIfStatement") END;
  8992. end := NewLabel();
  8993. elsifs := x.ElsifParts();
  8994. IfPart(x.ifPart);
  8995. FOR i := 0 TO elsifs-1 DO
  8996. IF ~escape THEN
  8997. elsif := x.GetElsifPart(i);
  8998. IfPart(elsif);
  8999. END;
  9000. END;
  9001. IF (x.elsePart # NIL) & ~escape THEN
  9002. StatementSequence(x.elsePart);
  9003. END;
  9004. SetLabel(end);
  9005. IF Trace THEN TraceExit("VisitIfStatement") END;
  9006. END VisitIfStatement;
  9007. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9008. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9009. BEGIN
  9010. (*IF x.variable.type.resolved = x.type.resolved THEN
  9011. (* always true, do nothing *)
  9012. ELSE*)
  9013. Designate(x.variable,res);
  9014. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9015. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9016. END;
  9017. trueL := NewLabel();
  9018. TypeTest(res.tag,x.type,trueL,falseL);
  9019. ReleaseOperand(res);
  9020. SetLabel(trueL);
  9021. StatementSequence(x.statements);
  9022. BrL(endL);
  9023. END WithPart;
  9024. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9025. VAR endL,falseL: Label;i: LONGINT;
  9026. BEGIN
  9027. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9028. endL := NewLabel();
  9029. FOR i := 0 TO x.WithParts()-1 DO
  9030. falseL := NewLabel();
  9031. WithPart(x.GetWithPart(i),falseL,endL);
  9032. SetLabel(falseL);
  9033. END;
  9034. IF x.elsePart = NIL THEN
  9035. IF ~isUnchecked THEN
  9036. EmitTrap(position,WithTrap);
  9037. END;
  9038. ELSE
  9039. StatementSequence(x.elsePart)
  9040. END;
  9041. SetLabel(endL);
  9042. IF Trace THEN TraceExit("VisitWithStatement") END;
  9043. END VisitWithStatement;
  9044. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9045. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9046. out,else: Label; label: Label;
  9047. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9048. symbol: SyntaxTree.Symbol;
  9049. BEGIN
  9050. (*! split case statement into if-elsif statements for large case label lists *)
  9051. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9052. size := x.max-x.min+1;
  9053. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9054. END;
  9055. Evaluate(x.variable,var);
  9056. ReuseCopy(tmp,var.op);
  9057. ReleaseIntermediateOperand(var.op);
  9058. var.op := tmp;
  9059. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9060. Convert(var.op,addressType);
  9061. size := x.max-x.min+1;
  9062. else := NewLabel();
  9063. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9064. (*
  9065. UniqueId(name,module.module,"case",caseId);
  9066. *)
  9067. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9068. Global.GetModuleSegmentedName(module.module, name);
  9069. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9070. symbol := SyntaxTree.NewSymbol(name[1]);
  9071. symbol.SetScope(moduleScope);
  9072. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9073. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9074. section.isCaseTable := TRUE;
  9075. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9076. ReuseCopy(res,var.op);
  9077. ReleaseOperand(var);
  9078. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9079. Emit(Add(position,res,res,jmp));
  9080. IntermediateCode.MakeMemory(res,addressType);
  9081. Emit(Br(position,res));
  9082. ReleaseIntermediateOperand(res);
  9083. out := NewLabel();
  9084. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9085. part := x.GetCasePart(i);
  9086. constant := part.firstConstant;
  9087. label := NewLabel();
  9088. SetLabel(label);
  9089. WHILE(constant # NIL) DO (* case labels for this case part *)
  9090. FOR j := constant.min TO constant.max DO
  9091. fixups[j-x.min] := label;
  9092. END;
  9093. constant := constant.next;
  9094. END;
  9095. StatementSequence(part.statements);
  9096. BrL(out);
  9097. END;
  9098. SetLabel(else);
  9099. FOR i := 0 TO size-1 DO
  9100. IF fixups[i] = NIL THEN
  9101. fixups[i] := else;
  9102. END;
  9103. END;
  9104. IF x.elsePart # NIL THEN
  9105. StatementSequence(x.elsePart);
  9106. ELSIF ~isUnchecked THEN
  9107. EmitTrap(position,CaseTrap);
  9108. END;
  9109. SetLabel(out);
  9110. FOR i := 0 TO size-1 DO
  9111. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9112. section.Emit(Data(position,op));
  9113. END;
  9114. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9115. END VisitCaseStatement;
  9116. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9117. VAR start: Label; true,false: Label;
  9118. BEGIN
  9119. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9120. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9121. start := NewLabel();
  9122. true := NewLabel();
  9123. false := NewLabel();
  9124. SetLabel(start);
  9125. Condition(x.condition,true,false);
  9126. SetLabel(true);
  9127. StatementSequence(x.statements);
  9128. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9129. BrL(start);
  9130. SetLabel(false);
  9131. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9132. END VisitWhileStatement;
  9133. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9134. VAR false,true: Label;
  9135. BEGIN
  9136. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9137. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9138. true := NewLabel();
  9139. false := NewLabel();
  9140. SetLabel(false);
  9141. StatementSequence(x.statements);
  9142. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9143. Condition(x.condition,true,false);
  9144. SetLabel(true);
  9145. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9146. END VisitRepeatStatement;
  9147. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9148. VAR
  9149. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9150. temporaryVariable: SyntaxTree.Variable;
  9151. temporaryVariableDesignator : SyntaxTree.Designator;
  9152. BEGIN
  9153. IF Trace THEN TraceEnter("VisitForStatement") END;
  9154. true := NewLabel();
  9155. false := NewLabel();
  9156. start := NewLabel();
  9157. Assign(x.variable,x.from);
  9158. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9159. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9160. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9161. Assign(temporaryVariableDesignator,x.to);
  9162. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9163. IF by > 0 THEN
  9164. cmp := Scanner.LessEqual
  9165. ELSE
  9166. cmp := Scanner.GreaterEqual
  9167. END;
  9168. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9169. binary.SetType(system.booleanType);
  9170. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9171. SetLabel(start);
  9172. Condition(binary,true,false);
  9173. SetLabel(true);
  9174. StatementSequence(x.statements);
  9175. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9176. binary.SetType(x.variable.type);
  9177. Assign(x.variable,binary);
  9178. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9179. BrL(start);
  9180. SetLabel(false);
  9181. IF Trace THEN TraceExit("VisitForStatement") END;
  9182. END VisitForStatement;
  9183. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9184. VAR prevLoop: Label;
  9185. BEGIN
  9186. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9187. prevLoop := currentLoop;
  9188. currentLoop := NewLabel();
  9189. StatementSequence(x.statements);
  9190. SetLabel(currentLoop);
  9191. currentLoop := prevLoop;
  9192. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9193. END VisitExitableBlock;
  9194. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9195. VAR prevLoop,start: Label;
  9196. BEGIN
  9197. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9198. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9199. start := NewLabel();
  9200. prevLoop := currentLoop;
  9201. SetLabel(start);
  9202. currentLoop := NewLabel();
  9203. StatementSequence(x.statements);
  9204. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9205. BrL(start);
  9206. SetLabel(currentLoop);
  9207. currentLoop := prevLoop;
  9208. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9209. END VisitLoopStatement;
  9210. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9211. VAR outer: SyntaxTree.Statement;
  9212. BEGIN
  9213. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9214. IF locked THEN (* r if we jump out of an exclusive block *)
  9215. outer := x.outer;
  9216. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9217. outer := outer.outer;
  9218. END;
  9219. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9220. Lock(FALSE);
  9221. END;
  9222. END;
  9223. BrL(currentLoop);
  9224. IF Trace THEN TraceExit("VisitExitStatement") END;
  9225. END VisitExitStatement;
  9226. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9227. VAR
  9228. expression, parameterDesignator: SyntaxTree.Expression;
  9229. type, componentType: SyntaxTree.Type;
  9230. res, right: Operand;
  9231. left, mem, reg: IntermediateCode.Operand;
  9232. parameter: SyntaxTree.Parameter;
  9233. procedure: SyntaxTree.Procedure;
  9234. procedureType: SyntaxTree.ProcedureType;
  9235. returnTypeOffset: LONGINT;
  9236. delegate: BOOLEAN;
  9237. map: SymbolMap;
  9238. BEGIN
  9239. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9240. expression := x.returnValue;
  9241. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9242. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9243. IF currentIsInline THEN
  9244. IF expression # NIL THEN
  9245. map := currentMapper.Get(NIL);
  9246. IF map # NIL THEN
  9247. Assign(map.to, expression);
  9248. END;
  9249. END;
  9250. BrL(currentInlineExit);
  9251. RETURN;
  9252. END;
  9253. IF expression # NIL THEN
  9254. type := expression.type.resolved;
  9255. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9256. IF locked THEN Lock(FALSE) END;
  9257. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9258. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9259. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9260. (* return without structured return parameter *)
  9261. Evaluate(expression,res);
  9262. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9263. IF locked OR profile THEN
  9264. Emit(Push(position,res.op));
  9265. IF delegate THEN HALT(200) END;
  9266. ReleaseOperand(res);
  9267. IF locked THEN Lock(FALSE) END;
  9268. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9269. reg := NewRegisterOperand(res.op.type);
  9270. Emit(Pop(position,reg));
  9271. Emit(Return(position,reg));
  9272. ReleaseIntermediateOperand(reg);
  9273. ELSE
  9274. Emit(Return(position,res.op));
  9275. ReleaseOperand(res);
  9276. END;
  9277. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9278. THEN
  9279. (* return using structured return parameter *)
  9280. 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)
  9281. OR SemanticChecker.IsPointerType(type));
  9282. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9283. parameter :=procedureType.returnParameter;
  9284. ASSERT(parameter # NIL);
  9285. returnTypeOffset := parameter.offsetInBits;
  9286. (*
  9287. IF parameter# NIL THEN
  9288. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9289. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9290. ELSE
  9291. returnTypeOffset := system.offsetFirstParameter
  9292. END;
  9293. *)
  9294. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9295. IF type IS SyntaxTree.RangeType THEN
  9296. (* array range type *)
  9297. Evaluate(expression, right);
  9298. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9299. Emit(Mov(position,mem, right.op)); (* first *)
  9300. ReleaseIntermediateOperand(mem);
  9301. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9302. Emit(Mov(position,mem, right.tag)); (* last *)
  9303. ReleaseIntermediateOperand(mem);
  9304. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9305. Emit(Mov(position,mem, right.extra)); (* step *)
  9306. ReleaseIntermediateOperand(mem);
  9307. ReleaseOperand(right);
  9308. ELSIF type IS SyntaxTree.ComplexType THEN
  9309. Evaluate(expression, right);
  9310. componentType := type(SyntaxTree.ComplexType).componentType;
  9311. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9312. Emit(Mov(position,mem, right.op)); (* real part *)
  9313. ReleaseIntermediateOperand(mem);
  9314. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9315. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9316. ReleaseIntermediateOperand(mem);
  9317. ReleaseOperand(right);
  9318. ELSE (* covers cases: pointer / record / array *)
  9319. parameter := procedureType.returnParameter;
  9320. checker.SetCurrentScope(currentScope);
  9321. ASSERT(parameter # NIL);
  9322. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9323. Assign(parameterDesignator,expression);
  9324. END;
  9325. ReleaseIntermediateOperand(left);
  9326. IF locked THEN Lock(FALSE) END;
  9327. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9328. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9329. parameter := procedureType.returnParameter;
  9330. checker.SetCurrentScope(currentScope);
  9331. IF parameter = NIL THEN
  9332. Error(procedure.position, "structured return of parameter of procedure not found");
  9333. ELSE
  9334. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9335. Assign(parameterDesignator,expression);
  9336. END;
  9337. IF locked THEN Lock(FALSE) END;
  9338. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9339. ELSE
  9340. HALT(200);
  9341. END;
  9342. ELSE
  9343. IF locked THEN Lock(FALSE) END;
  9344. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9345. END;
  9346. IF backend.cooperative THEN
  9347. BrL(exitLabel);
  9348. ELSE
  9349. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9350. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9351. END;
  9352. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9353. END VisitReturnStatement;
  9354. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9355. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9356. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9357. statements: SyntaxTree.StatementSequence;
  9358. name, suffix: SyntaxTree.IdentifierString;
  9359. BEGIN
  9360. Strings.IntToStr(awaitProcCounter,suffix);
  9361. Strings.Concat("@AwaitProcedure",suffix,name);
  9362. identifier := SyntaxTree.NewIdentifier(name);
  9363. INC(awaitProcCounter);
  9364. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9365. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9366. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9367. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9368. procedure.SetAccess(SyntaxTree.Hidden);
  9369. procedure.SetScope(currentScope);
  9370. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9371. procedureType.SetReturnType(system.booleanType);
  9372. procedure.SetType(procedureType);
  9373. body := SyntaxTree.NewBody(x.position,procedureScope);
  9374. procedureScope.SetBody(body);
  9375. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9376. returnStatement.SetReturnValue(x.condition);
  9377. statements := SyntaxTree.NewStatementSequence();
  9378. statements.AddStatement(returnStatement);
  9379. body.SetStatementSequence(statements);
  9380. currentScope.AddProcedure(procedure);
  9381. RETURN procedure
  9382. END MakeAwaitProcedure;
  9383. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9384. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9385. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9386. BEGIN
  9387. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9388. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9389. IF backend.cooperative THEN
  9390. start := NewLabel();
  9391. true := NewLabel();
  9392. false := NewLabel();
  9393. SetLabel(start);
  9394. Condition(x.condition,true,false);
  9395. SetLabel(false);
  9396. PushSelfPointer();
  9397. CallThis(position,"ExclusiveBlocks","Await",1);
  9398. BrL(start);
  9399. SetLabel(true);
  9400. PushSelfPointer();
  9401. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9402. ELSE
  9403. proc := MakeAwaitProcedure(x);
  9404. Emit(Push(position,fp));
  9405. GetCodeSectionNameForSymbol(proc,name);
  9406. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9407. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9408. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9409. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9410. Emit(Result(position,res));
  9411. (*
  9412. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9413. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9414. *)
  9415. InitOperand(result,ModeValue);
  9416. result.op := res;
  9417. label := NewLabel();
  9418. BreqL(label, result.op, SELF.true);
  9419. ReleaseOperand(result);
  9420. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9421. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9422. Emit(Push(position,res));
  9423. Emit(Push(position,fp));
  9424. PushSelfPointer();
  9425. Emit(Push(position,nil));
  9426. CallThis(position,"Objects","Await",4);
  9427. SetLabel(label);
  9428. END;
  9429. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9430. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9431. END VisitAwaitStatement;
  9432. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9433. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9434. BEGIN
  9435. FOR i := 0 TO x.Length() - 1 DO
  9436. statement := x.GetStatement( i );
  9437. Statement(statement);
  9438. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9439. END;
  9440. END StatementSequence;
  9441. PROCEDURE PushSelfPointer;
  9442. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9443. BEGIN
  9444. scope := currentScope;
  9445. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9446. scope := scope.outerScope;
  9447. END;
  9448. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9449. IF ~newObjectFile THEN
  9450. Symbol(moduleSelf,op);
  9451. IntermediateCode.MakeMemory(op.op,addressType);
  9452. ELSE
  9453. moduleSection := meta.ModuleSection();
  9454. IF backend.cooperative THEN
  9455. moduleOffset := 0;
  9456. ELSE
  9457. moduleOffset := moduleSection.pc;
  9458. END;
  9459. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9460. END;
  9461. ELSE
  9462. GetBaseRegister(op.op,currentScope,scope);
  9463. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9464. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9465. IF backend.cooperative THEN
  9466. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9467. END;
  9468. IntermediateCode.MakeMemory(op.op,addressType);
  9469. END;
  9470. Emit(Push(position,op.op));
  9471. ReleaseOperand(op);
  9472. END PushSelfPointer;
  9473. PROCEDURE Lock(lock: BOOLEAN);
  9474. BEGIN
  9475. IF Trace THEN TraceEnter("Lock") END;
  9476. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9477. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9478. ASSERT(modifyAssignmentCounter = 0);
  9479. IF dump # NIL THEN
  9480. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9481. dump.Ln;dump.Update;
  9482. END;
  9483. PushSelfPointer;
  9484. IF backend.cooperative THEN
  9485. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9486. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9487. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9488. END;
  9489. ELSE
  9490. Emit(Push(position,true));
  9491. IF lock THEN CallThis(position,"Objects","Lock",2)
  9492. ELSE CallThis(position,"Objects","Unlock",2);
  9493. END;
  9494. END;
  9495. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9496. IF Trace THEN TraceExit("Lock") END;
  9497. END Lock;
  9498. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9499. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9500. BEGIN
  9501. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9502. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9503. previouslyUnchecked := isUnchecked;
  9504. isUnchecked := isUnchecked OR x.isUnchecked;
  9505. previouslyCooperativeSwitches := cooperativeSwitches;
  9506. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9507. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9508. IF x.statements # NIL THEN
  9509. StatementSequence(x.statements);
  9510. END;
  9511. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9512. isUnchecked := previouslyUnchecked;
  9513. cooperativeSwitches := previouslyCooperativeSwitches;
  9514. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9515. END VisitStatementBlock;
  9516. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9517. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9518. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9519. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9520. procedure: SyntaxTree.Procedure;
  9521. map: SymbolMap;
  9522. BEGIN
  9523. scope := currentScope;
  9524. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9525. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9526. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9527. return := emptyOperand;
  9528. IF Trace THEN TraceEnter("VisitCode") END;
  9529. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9530. NEW(in, x.inRules.Length());
  9531. FOR i := 0 TO LEN(in)-1 DO
  9532. statement := x.inRules.GetStatement(i);
  9533. WITH statement: SyntaxTree.Assignment DO
  9534. Evaluate(statement.right, operand);
  9535. result := operand.op;
  9536. NEW(str, 64);
  9537. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9538. in[i] := result; IntermediateCode.SetString(in[i], str);
  9539. ReleaseIntermediateOperand(operand.tag);
  9540. END;
  9541. END;
  9542. ELSE in := NIL
  9543. END;
  9544. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9545. NEW(out, x.outRules.Length());
  9546. FOR i := 0 TO LEN(out)-1 DO
  9547. statement := x.outRules.GetStatement(i);
  9548. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9549. WITH statement: SyntaxTree.Assignment DO
  9550. Evaluate(statement.left, operand); (*?? or designate *)
  9551. result := operand.op;
  9552. NEW(str, 64);
  9553. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9554. out[i] := result; IntermediateCode.SetString(out[i], str);
  9555. ReleaseIntermediateOperand(operand.tag);
  9556. |statement: SyntaxTree.ReturnStatement DO
  9557. NEW(str, 64);
  9558. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9559. IF currentIsInline THEN
  9560. map := currentMapper.Get(NIL);
  9561. Evaluate(map.to, operand);
  9562. out[i] := operand.op;
  9563. ELSE
  9564. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9565. END;
  9566. IntermediateCode.SetString(out[i], str);
  9567. ReleaseIntermediateOperand(operand.tag);
  9568. return := out[i];
  9569. ELSE
  9570. END;
  9571. END;
  9572. ELSE out := NIL
  9573. END;
  9574. Emit(Asm(x.position,x.sourceCode, in, out));
  9575. IF in # NIL THEN
  9576. FOR i := 0 TO LEN(in)-1 DO
  9577. ReleaseIntermediateOperand(in[i]);
  9578. END;
  9579. END;
  9580. IF out # NIL THEN
  9581. FOR i := 0 TO LEN(out)-1 DO
  9582. WITH statement: SyntaxTree.Assignment DO
  9583. ReleaseIntermediateOperand(out[i]);
  9584. ELSE
  9585. IF currentIsInline THEN
  9586. ReleaseIntermediateOperand(out[i]);
  9587. END;
  9588. END;
  9589. statement := x.outRules.GetStatement(i);
  9590. END;
  9591. END;
  9592. IF return.mode # IntermediateCode.Undefined THEN
  9593. IF currentIsInline THEN
  9594. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9595. Symbol(procedureType.returnParameter, par);
  9596. MakeMemory(mem, par.op, return.type, 0);
  9597. ReleaseOperand(par);
  9598. Emit(Mov(position, mem, return));
  9599. ReleaseIntermediateOperand(mem);
  9600. ELSE
  9601. Emit(Return(position,return));
  9602. END;
  9603. IF currentIsInline THEN RETURN END;
  9604. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9605. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9606. ReleaseIntermediateOperand(return);
  9607. END;
  9608. IF Trace THEN TraceExit("VisitCode") END;
  9609. END VisitCode;
  9610. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9611. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9612. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9613. const, call: IntermediateCode.Operand;
  9614. parameterDesignator: SyntaxTree.Expression;
  9615. saved: RegisterEntry;
  9616. name: Basic.SegmentedName;
  9617. BEGIN
  9618. IF Trace THEN TraceEnter("ParameterCopies") END;
  9619. parameter := x.firstParameter;
  9620. WHILE parameter # NIL DO
  9621. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9622. type := parameter.type.resolved;
  9623. IF IsOpenArray(type) THEN
  9624. VisitParameter(parameter);
  9625. op := result;
  9626. IF backend.cooperative & parameter.NeedsTrace() THEN
  9627. length := GetArrayLength(type, op.tag);
  9628. size := NewRegisterOperand(addressType);
  9629. base := ArrayBaseType(type);
  9630. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9631. Emit(Mul(position, size, length, const));
  9632. dst := NewRegisterOperand (addressType);
  9633. Emit(Mov(position, dst, size));
  9634. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9635. Emit(Sub(position,dst,sp,dst));
  9636. Emit(And(position,dst,dst,const));
  9637. Emit(Mov(position,sp,dst));
  9638. par := fp;
  9639. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9640. IntermediateCode.InitImmediate(null, byteType, 0);
  9641. Emit(Fill(position, dst, size, null));
  9642. ReleaseIntermediateOperand(dst);
  9643. ReleaseIntermediateOperand(length);
  9644. SaveRegisters();ReleaseUsedRegisters(saved);
  9645. (* register dst has been freed before SaveRegisters already *)
  9646. base := ArrayBaseType(type);
  9647. (* assign method of open array *)
  9648. IF base.IsRecordType() THEN
  9649. Emit (Push(position, length));
  9650. Emit (Push(position, dst));
  9651. Emit (Push(position, op.op));
  9652. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9653. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9654. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9655. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9656. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9657. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9658. Emit (Push(position,length));
  9659. Emit (Push(position, dst));
  9660. Emit (Push(position, length));
  9661. Emit (Push(position, op.op));
  9662. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9663. ELSE
  9664. Emit (Push(position, length));
  9665. Emit (Push(position, dst));
  9666. Emit (Push(position, length));
  9667. Emit (Push(position, op.op));
  9668. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9669. ASSERT(ArrayBaseType(type).IsPointer());
  9670. END;
  9671. RestoreRegisters(saved);
  9672. ELSE
  9673. temp := GetDynamicSize(type,op.tag);
  9674. ReuseCopy(size,temp);
  9675. ReleaseIntermediateOperand(temp);
  9676. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9677. Emit(Sub(position,size,sp,size));
  9678. Emit(And(position,size,size,const));
  9679. Emit(Mov(position,sp,size));
  9680. par := fp;
  9681. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9682. ReleaseIntermediateOperand(size);
  9683. size := GetDynamicSize(type,op.tag);
  9684. END;
  9685. Emit(Copy(position,sp,op.op,size));
  9686. ReleaseIntermediateOperand(size);
  9687. ReleaseOperand(op);
  9688. IntermediateCode.MakeMemory(par,addressType);
  9689. Emit(Mov(position,par,sp));
  9690. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9691. checker.SetCurrentScope(currentScope);
  9692. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9693. Assign(parameterDesignator,parameterDesignator);
  9694. END;
  9695. END;
  9696. parameter := parameter.nextParameter;
  9697. END;
  9698. IF Trace THEN TraceExit("ParameterCopies") END;
  9699. END ParameterCopies;
  9700. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9701. VAR x: SyntaxTree.Variable;
  9702. BEGIN
  9703. x := scope.firstVariable;
  9704. WHILE x # NIL DO
  9705. InitVariable(x);
  9706. x := x.nextVariable;
  9707. END;
  9708. END InitVariables;
  9709. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9710. BEGIN
  9711. IF (symbol # NIL) THEN
  9712. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9713. ELSE
  9714. RETURN 0
  9715. END;
  9716. END GetFingerprint;
  9717. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9718. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9719. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9720. saved: RegisterEntry;
  9721. BEGIN
  9722. IF Trace THEN TraceEnter("Body") END;
  9723. ReleaseUsedRegisters(saved); (* just in case ... *)
  9724. section := ir;
  9725. exitLabel := NewLabel ();
  9726. IF moduleBody THEN moduleBodySection := section END;
  9727. IF ir.comments # NIL THEN
  9728. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9729. commentPrintout.SingleStatement(TRUE);
  9730. dump := ir.comments;
  9731. ELSE
  9732. commentPrintout := NIL;
  9733. dump := NIL;
  9734. END;
  9735. prevScope := currentScope;
  9736. currentScope := scope;
  9737. lastSwitchPC := 0;
  9738. cooperativeSwitches := backend.cooperative;
  9739. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9740. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9741. IF x # NIL THEN
  9742. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9743. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9744. IF moduleBody THEN
  9745. ProfilerInit();
  9746. ELSE
  9747. Basic.SegmentedNameToString(ir.name, string);
  9748. ProfilerAddProcedure(numberProcedures,string);
  9749. ProfilerEnterExit(numberProcedures,TRUE);
  9750. END;
  9751. END;
  9752. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9753. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9754. END;
  9755. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9756. IF moduleBody & ~newObjectFile THEN
  9757. InitVariables(moduleScope)
  9758. END;
  9759. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9760. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9761. IF procedure = cellScope.bodyProcedure THEN
  9762. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9763. StaticCallOperand(op, cellScope.constructor);
  9764. Emit(Call(position,op.op,0));
  9765. END;
  9766. END;
  9767. END;
  9768. ParameterCopies(procedureType);
  9769. InitVariables(scope);
  9770. IF x.code = NIL THEN
  9771. VisitStatementBlock(x);
  9772. ELSE
  9773. VisitCode(x.code)
  9774. END;
  9775. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9776. ir.SetFinally(ir.pc);
  9777. StatementSequence(x.finally)
  9778. END;
  9779. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9780. IF ~backend.cooperative THEN
  9781. ProfilerEnterExit(numberProcedures,FALSE);
  9782. END;
  9783. INC(numberProcedures);
  9784. END;
  9785. END;
  9786. IF backend.cooperative THEN
  9787. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9788. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9789. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9790. (*! not required any more? check and delete!
  9791. PushSelfPointer();
  9792. CallThis(position,"Modules","SetInitialized",1);
  9793. *)
  9794. (*
  9795. SetLabel(end);
  9796. *)
  9797. END;
  9798. IF x # NIL THEN
  9799. SELF.position := x.position;
  9800. END;
  9801. CheckRegistersFree();
  9802. ASSERT(modifyAssignmentCounter = 0);
  9803. currentScope := prevScope;
  9804. IF Trace THEN TraceExit("Body") END;
  9805. END Body;
  9806. END ImplementationVisitor;
  9807. MetaDataGenerator=OBJECT
  9808. VAR
  9809. implementationVisitor: ImplementationVisitor;
  9810. declarationVisitor: DeclarationVisitor;
  9811. module: Sections.Module;
  9812. moduleName: ARRAY 128 OF CHAR;
  9813. moduleNamePool: Basic.HashTableInt;
  9814. moduleNamePoolSection: IntermediateCode.Section;
  9815. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9816. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9817. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9818. TypeTags: LONGINT; (* type extension level support *)
  9819. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9820. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9821. BEGIN
  9822. IF implementationVisitor.backend.cooperative THEN
  9823. TypeTags := MAX(LONGINT);
  9824. BaseTypesTableOffset := 0;
  9825. MethodTableOffset := 2;
  9826. TypeRecordBaseOffset := 0;
  9827. ELSIF simple THEN
  9828. TypeTags := 3; (* only 3 extensions allowed *)
  9829. BaseTypesTableOffset := 1;
  9830. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9831. TypeRecordBaseOffset := 0;
  9832. ELSE
  9833. TypeTags := 16;
  9834. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9835. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9836. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9837. END;
  9838. SELF.simple := simple;
  9839. SELF.implementationVisitor := implementationVisitor;
  9840. SELF.declarationVisitor := declarationVisitor;
  9841. implementationVisitor.meta := SELF;
  9842. declarationVisitor.meta := SELF;
  9843. END InitMetaDataGenerator;
  9844. PROCEDURE SetModule(module: Sections.Module);
  9845. VAR namePoolOffset: LONGINT;
  9846. BEGIN
  9847. SELF.module := module;
  9848. Global.GetModuleName(module.module,moduleName);
  9849. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9850. NEW(moduleNamePool, 32);
  9851. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9852. END;
  9853. END SetModule;
  9854. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9855. BEGIN
  9856. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9857. END GetTypeRecordBaseOffset;
  9858. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9859. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9860. BEGIN
  9861. INC(dataAdrOffset,6);
  9862. Info(section,"headerAdr");
  9863. Address(section,0);
  9864. Info(section,"typeDesc");
  9865. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9866. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9867. NamedSymbol(section, name, symbol, 0, offset);
  9868. Info(section,"mark: LONGINT;");
  9869. Longint(section,-1);
  9870. Info(section,"dataAdr-: ADDRESS");
  9871. Symbol(section,section, dataAdrOffset,0);
  9872. Info(section,"size-: SIZE");
  9873. Address(section,0);
  9874. Info(section,"nextRealtime: HeapBlock;");
  9875. Address(section,0);
  9876. END HeapBlock;
  9877. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9878. VAR i: LONGINT;
  9879. BEGIN
  9880. INC(dataAdrOffset,14);
  9881. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9882. Info(section,"count*: LONGINT");
  9883. Longint(section,0);
  9884. Info(section,"locked*: BOOLEAN");
  9885. Longint(section,0);
  9886. Info(section,"awaitingLock*: ProcessQueue");
  9887. Address(section,0);
  9888. Address(section,0);
  9889. Info(section,"awaitingCond*: ProcessQueue");
  9890. Address(section,0);
  9891. Address(section,0);
  9892. Info(section,"lockedBy*: ANY");
  9893. Address(section,0);
  9894. Info(section,"lock*: ANY");
  9895. Address(section,0);
  9896. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9897. Longint(section,1);
  9898. FOR i := 2 TO 6 DO
  9899. Longint(section,0);
  9900. END;
  9901. END ProtectedHeapBlock;
  9902. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9903. BEGIN
  9904. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9905. END Info;
  9906. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9907. VAR op: IntermediateCode.Operand;
  9908. BEGIN
  9909. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9910. section.Emit(Data(-11,op));
  9911. END Address;
  9912. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9913. VAR op: IntermediateCode.Operand;
  9914. BEGIN
  9915. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9916. section.Emit(Data(-12,op));
  9917. END Size;
  9918. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9919. VAR op: IntermediateCode.Operand;
  9920. BEGIN
  9921. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9922. section.Emit(Data(-1,op));
  9923. END Set;
  9924. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9925. VAR op: IntermediateCode.Operand;
  9926. BEGIN
  9927. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9928. section.Emit(Data(-1,op));
  9929. END Longint;
  9930. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  9931. VAR op,noOperand: IntermediateCode.Operand;
  9932. BEGIN
  9933. IntermediateCode.InitOperand(noOperand);
  9934. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9935. section.PatchOperands(pc,op,noOperand,noOperand);
  9936. END PatchLongint;
  9937. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9938. VAR op, noOperand: IntermediateCode.Operand;
  9939. BEGIN
  9940. IntermediateCode.InitOperand(noOperand);
  9941. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9942. section.PatchOperands(pc,op,noOperand,noOperand);
  9943. END PatchSymbol;
  9944. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  9945. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  9946. BEGIN
  9947. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  9948. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  9949. section.Emit(Data(-1,op));
  9950. END Boolean;
  9951. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  9952. VAR op: IntermediateCode.Operand;
  9953. BEGIN
  9954. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  9955. section.Emit(Data(-1,op));
  9956. END Char;
  9957. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  9958. VAR i: LONGINT;
  9959. BEGIN
  9960. Info(section,str);
  9961. i := 0;
  9962. WHILE(str[i] # 0X) DO
  9963. Char(section,str[i]);
  9964. INC(i);
  9965. END;
  9966. Char(section,0X);
  9967. END String;
  9968. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9969. VAR op: IntermediateCode.Operand;
  9970. BEGIN
  9971. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9972. IntermediateCode.SetOffset(op,realOffset);
  9973. section.Emit(Data(-1,op));
  9974. END NamedSymbol;
  9975. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  9976. BEGIN
  9977. IF symbol= NIL THEN
  9978. Address( section, realOffset);
  9979. ASSERT(virtualOffset = 0);
  9980. ELSE
  9981. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  9982. END;
  9983. END Symbol;
  9984. (* OutPointers delivers
  9985. {pointerOffset}
  9986. *)
  9987. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  9988. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  9989. BEGIN
  9990. type := type.resolved;
  9991. IF type IS SyntaxTree.AnyType THEN
  9992. Symbol(section, symbol, 0, (offset ));
  9993. INC(numberPointers);
  9994. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9995. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  9996. Symbol(section, symbol, 0, offset); INC(numberPointers);
  9997. ELSIF type IS SyntaxTree.PointerType THEN
  9998. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  9999. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10000. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10001. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10002. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10003. ELSIF (type IS SyntaxTree.RecordType) THEN
  10004. (* never treat a record like a pointer, even if the pointer field is set! *)
  10005. WITH type: SyntaxTree.RecordType DO
  10006. base := type.GetBaseRecord();
  10007. IF base # NIL THEN
  10008. Pointers(offset,symbol,section, base,numberPointers);
  10009. END;
  10010. variable := type.recordScope.firstVariable;
  10011. WHILE(variable # NIL) DO
  10012. IF ~(variable.untraced) THEN
  10013. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10014. END;
  10015. variable := variable.nextVariable;
  10016. END;
  10017. END;
  10018. ELSIF (type IS SyntaxTree.CellType) THEN
  10019. WITH type: SyntaxTree.CellType DO
  10020. base := type.GetBaseRecord();
  10021. IF base # NIL THEN
  10022. Pointers(offset,symbol,section, base,numberPointers);
  10023. END;
  10024. variable := type.cellScope.firstVariable;
  10025. WHILE(variable # NIL) DO
  10026. IF ~(variable.untraced) THEN
  10027. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10028. END;
  10029. variable := variable.nextVariable;
  10030. END;
  10031. END;
  10032. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10033. WITH type: SyntaxTree.ArrayType DO
  10034. IF type.form= SyntaxTree.Static THEN
  10035. n := type.staticLength;
  10036. base := type.arrayBase.resolved;
  10037. WHILE(base IS SyntaxTree.ArrayType) DO
  10038. type := base(SyntaxTree.ArrayType);
  10039. n := n* type.staticLength;
  10040. base := type.arrayBase.resolved;
  10041. END;
  10042. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10043. IF SemanticChecker.ContainsPointer(base) THEN
  10044. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10045. FOR i := 0 TO n-1 DO
  10046. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10047. END;
  10048. END;
  10049. ELSE
  10050. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10051. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10052. END;
  10053. END;
  10054. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10055. WITH type: SyntaxTree.MathArrayType DO
  10056. IF type.form = SyntaxTree.Static THEN
  10057. n := type.staticLength;
  10058. base := type.arrayBase.resolved;
  10059. WHILE(base IS SyntaxTree.MathArrayType) DO
  10060. type := base(SyntaxTree.MathArrayType);
  10061. n := n* type.staticLength;
  10062. base := type.arrayBase.resolved;
  10063. END;
  10064. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10065. IF SemanticChecker.ContainsPointer(base) THEN
  10066. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10067. FOR i := 0 TO n-1 DO
  10068. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10069. END;
  10070. END;
  10071. ELSE
  10072. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10073. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10074. END
  10075. END;
  10076. (* ELSE no pointers in type *)
  10077. END;
  10078. END Pointers;
  10079. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10080. VAR position,i: LONGINT; ch: CHAR;
  10081. BEGIN
  10082. IF pool.Has(index) THEN
  10083. RETURN pool.GetInt(index)
  10084. ELSE
  10085. position := source.pc;
  10086. pool.PutInt(index, position);
  10087. Info(source, name);
  10088. i := 0;
  10089. REPEAT
  10090. ch := name[i]; INC(i);
  10091. Char( source, ch);
  10092. UNTIL ch = 0X;
  10093. END;
  10094. RETURN position;
  10095. END EnterDynamicName;
  10096. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10097. VAR name: Basic.SectionName; position: LONGINT;
  10098. BEGIN
  10099. IF pool.Has(index) THEN
  10100. RETURN pool.GetInt(index)
  10101. ELSE
  10102. StringPool.GetString(index, name);
  10103. position := EnterDynamicName(source,name,index, pool);
  10104. END;
  10105. RETURN position;
  10106. END DynamicName;
  10107. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10108. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10109. BEGIN
  10110. COPY(moduleName,name);
  10111. Strings.Append(name,suffix);
  10112. Basic.ToSegmentedName(name, pooledName);
  10113. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10114. IF implementationVisitor.backend.cooperative THEN
  10115. Info(section, "TypeDescriptor");
  10116. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10117. NamedSymbol(section, pooledName,NIL, 0, 0);
  10118. BasePointer(section);
  10119. offset := 0;
  10120. ELSE
  10121. HeapBlock(mName,typeName,section,2);
  10122. Info(section, "HeapBlock");
  10123. (*
  10124. Symbol(section,section,2,0);
  10125. *)
  10126. Address(section,0); (* empty such that GC does not go on traversing *)
  10127. Info(section, "TypeDescriptor");
  10128. Address(section,0);
  10129. offset := section.pc;
  10130. END;
  10131. RETURN section
  10132. END Block;
  10133. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10134. VAR name: Basic.SegmentedName;
  10135. BEGIN
  10136. Info(source,"ArrayHeader");
  10137. IF implementationVisitor.backend.cooperative THEN
  10138. sizePC := source.pc;
  10139. Address(source,0);
  10140. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10141. IF baseType # "" THEN
  10142. Basic.ToSegmentedName(baseType, name);
  10143. NamedSymbol(source, name,NIL, 0, 0);
  10144. ELSE
  10145. Address(source,0);
  10146. END;
  10147. Address(source,0);
  10148. ELSE
  10149. Address(source,0);
  10150. Address(source,0);
  10151. Address(source,0);
  10152. sizePC := source.pc;
  10153. Address(source,0);
  10154. Info(source,"array data");
  10155. END;
  10156. END Array;
  10157. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10158. BEGIN
  10159. IF implementationVisitor.backend.cooperative THEN
  10160. PatchLongint(section, pc, size);
  10161. PatchLongint(section, pc + 3, size);
  10162. ELSE
  10163. PatchLongint(section, pc, size);
  10164. END;
  10165. END PatchArray;
  10166. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10167. VAR
  10168. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10169. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10170. poolMap: Basic.HashTableInt;
  10171. namePool: IntermediateCode.Section;
  10172. namePoolOffset: LONGINT;
  10173. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10174. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10175. BEGIN
  10176. Basic.SegmentedNameToString(s1.name,n1);
  10177. Basic.SegmentedNameToString(s2.name,n2);
  10178. index := 0;
  10179. ch1 := n1[index];
  10180. ch2 := n2[index];
  10181. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10182. INC(index);
  10183. ch1 := n1[index];
  10184. ch2 := n2[index];
  10185. END;
  10186. RETURN ch1 < ch2;
  10187. END Compare;
  10188. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10189. VAR
  10190. i, j: LONGINT;
  10191. x, t: Sections.Section;
  10192. BEGIN
  10193. IF lo < hi THEN
  10194. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10195. WHILE i <= j DO
  10196. WHILE Compare(list[i], x) DO INC(i) END;
  10197. WHILE Compare(x, list[j]) DO DEC(j) END;
  10198. IF i <= j THEN
  10199. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10200. INC(i); DEC(j)
  10201. END
  10202. END;
  10203. IF lo < j THEN QuickSort(list, lo, j) END;
  10204. IF i < hi THEN QuickSort(list, i, hi) END
  10205. END;
  10206. END QuickSort;
  10207. (*
  10208. ExportDesc* = RECORD
  10209. fp*: ADDRESS;
  10210. name* {UNTRACED}: DynamicName;
  10211. adr*: ADDRESS;
  10212. exports*: LONGINT;
  10213. dsc* {UNTRACED}: ExportArray
  10214. END;
  10215. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10216. *)
  10217. PROCEDURE ExportDesc2(
  10218. source: IntermediateCode.Section;
  10219. namePool: IntermediateCode.Section;
  10220. fingerPrinter: FingerPrinter.FingerPrinter;
  10221. symbol: Sections.Section;
  10222. name: StringPool.Index;
  10223. VAR patchAdr: LONGINT
  10224. ): BOOLEAN;
  10225. VAR fingerPrint: SyntaxTree.FingerPrint;
  10226. BEGIN
  10227. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10228. & (symbol.type # Sections.InlineCodeSection)
  10229. THEN
  10230. *)
  10231. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10232. & (symbol.type # Sections.InlineCodeSection))
  10233. THEN
  10234. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10235. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10236. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10237. Longint(source,fingerPrint.shallow);
  10238. ELSE
  10239. Longint(source, 0);
  10240. END;
  10241. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10242. Symbol(source, symbol,0,0);
  10243. patchAdr := source.pc;
  10244. Address(source,0);
  10245. Address(source,0);
  10246. END;
  10247. RETURN TRUE
  10248. ELSE
  10249. RETURN FALSE
  10250. END;
  10251. END ExportDesc2;
  10252. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10253. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10254. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10255. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10256. TYPE
  10257. Scope = RECORD
  10258. elements: LONGINT;
  10259. gelements: LONGINT;
  10260. section: IntermediateCode.Section;
  10261. patchAdr: LONGINT;
  10262. arraySizePC: LONGINT;
  10263. beginPC: LONGINT; (* current scope start pc *)
  10264. END;
  10265. BEGIN
  10266. Basic.InitSegmentedName(prev);
  10267. olevel := -1;
  10268. scopes[0].section := source;
  10269. FOR s := 0 TO LEN(sections)-1 DO
  10270. symbol := sections[s];
  10271. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10272. this := sections[s].name;
  10273. level := 0;
  10274. WHILE (this[level] > 0) DO
  10275. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10276. INC(level);
  10277. END;
  10278. WHILE level < olevel DO
  10279. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10280. IF olevel > 0 THEN
  10281. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10282. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10283. END;
  10284. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10285. DEC(olevel);
  10286. END;
  10287. IF (this[level] > 0) THEN
  10288. IF level > olevel THEN
  10289. (*TRACE("opening",level); *)
  10290. IF scopes[level].section = NIL THEN
  10291. arrayName := ".@ExportArray";
  10292. Strings.AppendInt(arrayName, level);
  10293. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10294. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10295. END;
  10296. scopes[level].beginPC := scopes[level].section.pc;
  10297. olevel := level;
  10298. scopes[olevel].elements := 0;
  10299. END;
  10300. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10301. sym := sections[s];
  10302. ELSE
  10303. sym := NIL;
  10304. END;
  10305. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10306. THEN
  10307. INC(scopes[olevel].elements);
  10308. END;
  10309. (*StringPool.GetString(this[level], name);*)
  10310. (*TRACE(level, name);*)
  10311. (* enter string in scope *)
  10312. INC(level);
  10313. END;
  10314. END;
  10315. Basic.SegmentedNameToString(this, name);
  10316. (*TRACE(level, "enter", name);*)
  10317. prev := this;
  10318. END;
  10319. END;
  10320. WHILE 0 <= olevel DO
  10321. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10322. IF olevel > 0 THEN
  10323. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10324. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10325. END;
  10326. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10327. DEC(olevel);
  10328. END;
  10329. level := 0;
  10330. WHILE (level < LEN(scopes)) DO
  10331. IF scopes[level].section # NIL THEN
  10332. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10333. END;
  10334. INC(level);
  10335. END;
  10336. END Export;
  10337. BEGIN
  10338. NEW(fingerPrinter, module.system);
  10339. NEW(poolMap, 64);
  10340. (* 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 *)
  10341. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10342. NEW(sectionArray, module.allSections.Length());
  10343. FOR i := 0 TO module.allSections.Length() - 1 DO
  10344. section := module.allSections.GetSection(i);
  10345. sectionArray[i] := section;
  10346. END;
  10347. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10348. Export(sectionArray^);
  10349. END ExportDesc;
  10350. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10351. VAR
  10352. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10353. BEGIN
  10354. Info(source, "exception table offsets array descriptor");
  10355. size := 0;
  10356. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10357. Info(source, "exception table content");
  10358. FOR i := 0 TO module.allSections.Length() - 1 DO
  10359. p := module.allSections.GetSection(i);
  10360. IF p.type = Sections.CodeSection THEN
  10361. finallyPC := p(IntermediateCode.Section).finally;
  10362. IF finallyPC>=0 THEN
  10363. Symbol( source, p, 0,0);
  10364. Symbol( source, p, finallyPC, 0);
  10365. Symbol( source, p, finallyPC,0);
  10366. INC(size);
  10367. END;
  10368. END
  10369. END;
  10370. PatchArray(source,sizePC,size);
  10371. END ExceptionArray;
  10372. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10373. VAR i: LONGINT; ch: CHAR;
  10374. BEGIN
  10375. i := 0;
  10376. REPEAT
  10377. ch := name[i]; INC(i);
  10378. Char( section, ch);
  10379. UNTIL ch = 0X;
  10380. WHILE i < 32 DO
  10381. Char( section, 0X); INC(i);
  10382. END;
  10383. END Name;
  10384. PROCEDURE References(section: IntermediateCode.Section);
  10385. CONST
  10386. rfDirect = 1X; rfIndirect = 3X;
  10387. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10388. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10389. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10390. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10391. rfRecordPointer=1DX;
  10392. rfArrayFlag = 80X;
  10393. VAR
  10394. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10395. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10396. VAR char: CHAR;
  10397. BEGIN
  10398. IF type = NIL THEN char := rfLongint
  10399. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10400. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10401. ELSIF type IS SyntaxTree.CharacterType THEN
  10402. IF type.sizeInBits = 8 THEN char := rfChar8
  10403. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10404. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10405. END;
  10406. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10407. IF type.sizeInBits = 8 THEN char := rfShortint
  10408. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10409. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10410. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10411. END;
  10412. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10413. ELSIF type IS SyntaxTree.FloatType THEN
  10414. IF type.sizeInBits = 32 THEN char := rfReal
  10415. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10416. END;
  10417. ELSIF type IS SyntaxTree.ComplexType THEN
  10418. IF type.sizeInBits = 64 THEN char := rfComplex
  10419. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10420. END;
  10421. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10422. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10423. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10424. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10425. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10426. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10427. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10428. END;
  10429. RETURN char
  10430. END BaseType;
  10431. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10432. VAR destination: Sections.Section;
  10433. BEGIN
  10434. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10435. IF type.pointerType # NIL THEN
  10436. Char(section,rfRecordPointer)
  10437. ELSE
  10438. Char(section,rfRecord);
  10439. END;
  10440. IF destination = NIL THEN
  10441. Longint(section,0);
  10442. ELSE
  10443. Longint(section,destination.offset); (* used for ? *)
  10444. END;
  10445. END RecordType;
  10446. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10447. BEGIN
  10448. baseType := type.arrayBase.resolved;
  10449. IF type.form = SyntaxTree.Static THEN
  10450. IF baseType IS SyntaxTree.ArrayType THEN
  10451. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10452. ELSE
  10453. RETURN type.staticLength
  10454. END
  10455. ELSE
  10456. RETURN 0
  10457. END;
  10458. END StaticArrayLength;
  10459. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10460. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10461. BEGIN
  10462. length := StaticArrayLength(type, baseType);
  10463. char := BaseType(baseType);
  10464. IF type.form # SyntaxTree.Open THEN
  10465. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10466. Longint(section, length)
  10467. ELSE
  10468. length :=0;
  10469. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10470. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10471. Longint(section, length)
  10472. END;
  10473. END ArrayType;
  10474. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10475. BEGIN
  10476. baseType := type.arrayBase;
  10477. IF baseType # NIL THEN
  10478. baseType := baseType.resolved;
  10479. END;
  10480. IF type.form = SyntaxTree.Static THEN
  10481. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10482. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10483. ELSE
  10484. RETURN type.staticLength
  10485. END
  10486. ELSE
  10487. RETURN 0
  10488. END;
  10489. END StaticMathArrayLength;
  10490. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10491. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10492. BEGIN
  10493. length := StaticMathArrayLength(type, baseType);
  10494. char := BaseType(baseType);
  10495. IF type.form = SyntaxTree.Open THEN
  10496. char := BaseType(module.system.addressType);
  10497. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10498. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10499. Longint(section, length)
  10500. ELSIF type.form=SyntaxTree.Tensor THEN
  10501. char := BaseType(module.system.addressType);
  10502. Char(section, CHR(ORD(char)));
  10503. ELSE
  10504. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10505. Longint(section, length)
  10506. END;
  10507. END MathArrayType;
  10508. PROCEDURE Type(type: SyntaxTree.Type);
  10509. BEGIN
  10510. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10511. IF type IS SyntaxTree.BasicType THEN
  10512. Char(section, BaseType(type));
  10513. ELSIF type IS SyntaxTree.RecordType THEN
  10514. RecordType(type(SyntaxTree.RecordType));
  10515. ELSIF type IS SyntaxTree.ArrayType THEN
  10516. ArrayType(type(SyntaxTree.ArrayType))
  10517. ELSIF type IS SyntaxTree.EnumerationType THEN
  10518. Char(section, BaseType(module.system.longintType))
  10519. ELSIF type IS SyntaxTree.PointerType THEN
  10520. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10521. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10522. ELSE
  10523. Char(section, BaseType(type))
  10524. END;
  10525. ELSIF type IS SyntaxTree.ProcedureType THEN
  10526. Char(section, BaseType(type));
  10527. ELSIF type IS SyntaxTree.MathArrayType THEN
  10528. MathArrayType(type(SyntaxTree.MathArrayType));
  10529. ELSIF type IS SyntaxTree.CellType THEN
  10530. Char(section, BaseType(module.system.anyType));
  10531. ELSE HALT(200)
  10532. END;
  10533. END Type;
  10534. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10535. VAR name: ARRAY 256 OF CHAR;
  10536. BEGIN
  10537. IF variable.externalName # NIL THEN RETURN END;
  10538. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10539. variable.GetName(name);
  10540. Type(variable.type);
  10541. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10542. String(section,name);
  10543. END WriteVariable;
  10544. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10545. VAR name: ARRAY 256 OF CHAR;
  10546. BEGIN
  10547. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10548. variable.GetName(name);
  10549. Type(variable.type);
  10550. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10551. variable.GetName(name);
  10552. String(section,name);
  10553. END WriteParameter;
  10554. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10555. BEGIN
  10556. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10557. IF type IS SyntaxTree.ArrayType THEN
  10558. WITH type: SyntaxTree.ArrayType DO
  10559. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10560. ELSE Char(section,rfOpenArray)
  10561. END;
  10562. END
  10563. ELSIF type IS SyntaxTree.MathArrayType THEN
  10564. WITH type: SyntaxTree.MathArrayType DO
  10565. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10566. ELSE Char(section,rfOpenArray)
  10567. END;
  10568. END
  10569. ELSIF type IS SyntaxTree.RecordType THEN
  10570. Char(section,rfRecord);
  10571. ELSE
  10572. Char(section, BaseType(type));
  10573. END;
  10574. END ReturnType;
  10575. PROCEDURE Procedure(s: Sections.Section);
  10576. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10577. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10578. name: ARRAY 256 OF CHAR;
  10579. BEGIN
  10580. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10581. (*procedure.name,name);*)
  10582. Global.GetSymbolNameInScope(procedure,module.module.moduleScope,name);
  10583. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10584. Char(section,0F9X);
  10585. Symbol(section,s,0,0);
  10586. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10587. Longint(section,procedureType.numberParameters);
  10588. ReturnType(procedureType.returnType);
  10589. Longint(section,0); (*! level *)
  10590. Longint(section,0);
  10591. (*
  10592. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10593. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10594. recordName := "";
  10595. IF record.pointerType # NIL THEN
  10596. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10597. ELSE
  10598. DeclarationName(record.typeDeclaration,recordName);
  10599. END;
  10600. i := 0;
  10601. Info(section,recordName);
  10602. WHILE recordName[i] # 0X DO
  10603. Char(section,recordName[i]); INC(i);
  10604. INC(size);
  10605. END;
  10606. Char(section,".");
  10607. INC(size);
  10608. END;
  10609. *)
  10610. String(section,name);
  10611. parameter := procedureType.firstParameter;
  10612. WHILE(parameter # NIL) DO
  10613. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10614. parameter := parameter.nextParameter;
  10615. END;
  10616. variable := procedure.procedureScope.firstVariable;
  10617. WHILE(variable # NIL) DO
  10618. WriteVariable(variable,FALSE);
  10619. variable := variable.nextVariable;
  10620. END;
  10621. END Procedure;
  10622. PROCEDURE Scope(s: Sections.Section);
  10623. BEGIN
  10624. Char(section,0F8X);
  10625. Symbol(section,s,0,0); (* start *)
  10626. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10627. String(section,"$$");
  10628. (* removed variables -- wrongly interpreted by Reflection
  10629. variable := module.module.moduleScope.firstVariable;
  10630. WHILE(variable # NIL) DO
  10631. WriteVariable(variable,FALSE);
  10632. variable := variable.nextVariable;
  10633. END;
  10634. *)
  10635. END Scope;
  10636. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10637. VAR result, i: LONGINT;
  10638. BEGIN
  10639. FOR i := startPC TO endPC -1 DO
  10640. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10641. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10642. END;
  10643. RETURN result;
  10644. END ComputeSize;
  10645. BEGIN
  10646. Array(section,sizePC,"");
  10647. startPC := section.pc;
  10648. Char(section,0FFX); (* sign for trap writer *)
  10649. FOR i := 0 TO module.allSections.Length() - 1 DO
  10650. s := module.allSections.GetSection(i);
  10651. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10652. Scope(s) (*! must be first procedure in ref section *)
  10653. END
  10654. END;
  10655. FOR i := 0 TO module.allSections.Length() - 1 DO
  10656. s := module.allSections.GetSection(i);
  10657. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10658. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10659. Procedure(s)
  10660. END
  10661. END;
  10662. endPC := section.pc;
  10663. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10664. END References;
  10665. (*
  10666. Command* = RECORD
  10667. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10668. name*: Name; (* name of the procedure *)
  10669. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10670. entryAdr* : ADDRESS; (* entry address of procedure *)
  10671. END;
  10672. *)
  10673. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10674. VAR
  10675. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10676. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10677. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  10678. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10679. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10680. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10681. BEGIN
  10682. RETURN
  10683. (type = NIL) OR
  10684. (type.resolved IS SyntaxTree.RecordType) OR
  10685. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10686. (type.resolved IS SyntaxTree.AnyType);
  10687. END TypeAllowed;
  10688. BEGIN
  10689. numberParameters := procedureType.numberParameters;
  10690. RETURN
  10691. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10692. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10693. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10694. END GetProcedureAllowed;
  10695. PROCEDURE WriteType(type : SyntaxTree.Type);
  10696. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10697. name: Basic.SegmentedName; offset: LONGINT;
  10698. BEGIN
  10699. IF type = NIL THEN
  10700. Address(source,0);
  10701. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10702. Address(source,1);
  10703. ELSE
  10704. type := type.resolved;
  10705. IF type IS SyntaxTree.PointerType THEN
  10706. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10707. END;
  10708. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10709. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10710. name[0] := typeDeclaration.name; name[1] := -1;
  10711. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10712. ASSERT(section # NIL);
  10713. ELSE
  10714. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10715. (* TODO *)
  10716. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10717. END;
  10718. IF implementationVisitor.backend.cooperative THEN
  10719. offset := 0;
  10720. ELSE
  10721. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10722. END;
  10723. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10724. END;
  10725. END WriteType;
  10726. BEGIN
  10727. Info(source, "command array descriptor");
  10728. Array(source,sizePC,"Modules.Command");
  10729. numberCommands := 0;
  10730. Info(source, "command array content");
  10731. FOR i := 0 TO module.allSections.Length() - 1 DO
  10732. p := module.allSections.GetSection(i);
  10733. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10734. procedure := p.symbol(SyntaxTree.Procedure);
  10735. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10736. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10737. procedure.GetName(name);
  10738. Name(source,name);
  10739. numberParameters := procedureType.numberParameters;
  10740. (* offset of type of first parameter *)
  10741. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10742. ELSE WriteType(procedureType.firstParameter.type)
  10743. END;
  10744. (* offset of type of return parameter *)
  10745. WriteType(procedureType.returnType);
  10746. (* command name *)
  10747. (* command code offset *)
  10748. Symbol(source,p,0,0);
  10749. INC(numberCommands);
  10750. IF Trace THEN
  10751. D.Ln;
  10752. END;
  10753. END;
  10754. END
  10755. END;
  10756. PatchArray(source,sizePC,numberCommands);
  10757. END CommandArray;
  10758. (* to prevent from double import of different module aliases *)
  10759. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10760. VAR i: SyntaxTree.Import;
  10761. BEGIN
  10762. i := module.module.moduleScope.firstImport;
  10763. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10764. i := i.nextImport;
  10765. END;
  10766. RETURN i = import
  10767. END IsFirstDirectOccurence;
  10768. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10769. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10770. BEGIN
  10771. Array(source,pc,"");
  10772. Info(source, "import module array data");
  10773. IF implementationVisitor.backend.cooperative THEN
  10774. offset := 0;
  10775. ELSE
  10776. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10777. END;
  10778. import := module.module.moduleScope.firstImport;
  10779. numberImports := 0;
  10780. WHILE import # NIL DO
  10781. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10782. Global.GetModuleSegmentedName(import.module,name);
  10783. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10784. NamedSymbol(source, name, NIL, 0, offset);
  10785. INC(numberImports);
  10786. END;
  10787. import := import.nextImport
  10788. END;
  10789. PatchArray(source,pc,numberImports);
  10790. END ImportsArray;
  10791. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10792. VAR
  10793. p: Sections.Section; sizePC, size, i: LONGINT;
  10794. BEGIN
  10795. Info(source, "Type info section");
  10796. size := 0;
  10797. Array(source,sizePC,"Modules.TypeDesc");
  10798. FOR i := 0 TO module.allSections.Length() - 1 DO
  10799. p := module.allSections.GetSection(i);
  10800. WITH p: IntermediateCode.Section DO
  10801. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10802. Symbol(source,p,0,0);
  10803. INC(size);
  10804. END;
  10805. END
  10806. END;
  10807. PatchArray(source,sizePC,size);
  10808. END TypeInfoSection;
  10809. (*
  10810. ProcTableEntry* = RECORD
  10811. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10812. noPtr*: LONGINT;
  10813. END;
  10814. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10815. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10816. *)
  10817. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10818. VAR
  10819. destination: Sections.Section;
  10820. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10821. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10822. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10823. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10824. BEGIN
  10825. Info(procArray,"pcFrom");
  10826. Symbol(procArray,destination,0,0);
  10827. Info(procArray,"pcTo");
  10828. Symbol(procArray,destination,destination.pc,0);
  10829. Info(procArray,"pcStatementBegin");
  10830. Symbol(procArray,destination,destination.validPAFEnter,0);
  10831. Info(procArray,"pcStatementEnd");
  10832. Symbol(procArray,destination,destination.validPAFExit,0);
  10833. IF ~implementationVisitor.backend.cooperative THEN
  10834. Basic.SegmentedNameToString(destination.name, string);
  10835. Info(pointerArray,string);
  10836. procedure := destination.symbol(SyntaxTree.Procedure);
  10837. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10838. variable := procedure.procedureScope.firstVariable;
  10839. WHILE(variable # NIL) DO
  10840. IF ~(variable.untraced) THEN
  10841. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10842. END;
  10843. variable := variable.nextVariable
  10844. END;
  10845. parameter := procedureType.firstParameter;
  10846. WHILE(parameter # NIL) DO
  10847. IF ~(parameter.untraced) THEN
  10848. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10849. END;
  10850. parameter := parameter.nextParameter;
  10851. END;
  10852. END;
  10853. Info(procArray,"numberPointers");
  10854. Longint(procArray,numberPointers);
  10855. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10856. INC(pointerArraySize, numberPointers);
  10857. END PointerOffsets;
  10858. BEGIN
  10859. maxPointers := 0;
  10860. Info(procArray, "proc array descriptor");
  10861. Address(procArray,0);
  10862. Address(procArray,0);
  10863. Address(procArray,0);
  10864. procArraySizePC := procArray.pc;
  10865. Address(procArray,0);
  10866. procArraySize := 0;
  10867. IF ~implementationVisitor.backend.cooperative THEN
  10868. Info(pointerArray, "pointer array descriptor");
  10869. Address(pointerArray,0);
  10870. Address(pointerArray,0);
  10871. Address(pointerArray,0);
  10872. pointerArraySizePC := pointerArray.pc;
  10873. Address(pointerArray,0);
  10874. pointerArraySize := 0;
  10875. END;
  10876. procArraySize := 0;
  10877. FOR i := 0 TO module.allSections.Length() - 1 DO
  10878. destination := module.allSections.GetSection(i);
  10879. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10880. PointerOffsets(destination(IntermediateCode.Section));
  10881. INC(procArraySize);
  10882. END
  10883. END;
  10884. PatchLongint(procArray,procArraySizePC,procArraySize);
  10885. IF ~implementationVisitor.backend.cooperative THEN
  10886. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10887. END;
  10888. END PointersInProcTables;
  10889. (*
  10890. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10891. VAR
  10892. next*: Module; (** once a module is published, all fields are read-only *)
  10893. name*: Name;
  10894. init, published: BOOLEAN;
  10895. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10896. sb*: ADDRESS; <- set to beginning of data section by loader
  10897. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10898. command*: POINTER TO ARRAY OF Command;
  10899. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10900. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10901. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10902. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10903. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10904. data*, code*: Bytes;
  10905. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10906. export*: ExportDesc;
  10907. term*: TerminationHandler;
  10908. exTable*: ExceptionTable;
  10909. noProcs*: LONGINT;
  10910. firstProc*: ADDRESS; <- done by loader
  10911. maxPtrs*: LONGINT;
  10912. crc*: LONGINT;
  10913. *)
  10914. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10915. BEGIN
  10916. Info(section, "cycle");
  10917. Size(section,0);
  10918. Info(section, "references");
  10919. Size(section,0);
  10920. Info(section, "nextMarked");
  10921. Address(section,0);
  10922. Info(section, "nextWatched");
  10923. Address(section,0);
  10924. END BasePointer;
  10925. PROCEDURE BaseObject (section: IntermediateCode.Section);
  10926. BEGIN
  10927. BasePointer(section);
  10928. Info(section, "action");
  10929. Address(section,0);
  10930. Info(section, "monitor");
  10931. Address(section,0);
  10932. END BaseObject;
  10933. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  10934. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  10935. pooledName: Basic.SegmentedName;
  10936. symbol: SyntaxTree.Symbol;
  10937. BEGIN
  10938. Global.GetModuleName(module.module,name);
  10939. Strings.Append(name,".@Module.@Descriptor");
  10940. Basic.ToSegmentedName(name, pooledName);
  10941. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10942. Symbol(section,descriptorSection,0,0);
  10943. Info(descriptorSection, "descriptor");
  10944. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10945. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  10946. Address(descriptorSection,0);
  10947. Global.GetModuleName(module.module,name);
  10948. Strings.Append(name,".@Trace");
  10949. Basic.ToSegmentedName(name, pooledName);
  10950. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10951. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  10952. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10953. END ModuleDescriptor;
  10954. PROCEDURE ModuleSection(): IntermediateCode.Section;
  10955. VAR name: ARRAY 128 OF CHAR;
  10956. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  10957. symbol: SyntaxTree.Symbol;
  10958. BEGIN
  10959. Global.GetModuleName(module.module,name);
  10960. Strings.Append(name,".@Module");
  10961. Basic.ToSegmentedName(name, pooledName);
  10962. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10963. moduleSection.SetExported(TRUE);
  10964. IF moduleSection.pc = 0 THEN
  10965. IF implementationVisitor.backend.cooperative THEN
  10966. Info(moduleSection, "descriptor");
  10967. ModuleDescriptor(moduleSection);
  10968. BaseObject(moduleSection);
  10969. implementationVisitor.CreateTraceModuleMethod(module.module);
  10970. ELSE
  10971. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  10972. Info(moduleSection, "HeapBlock");
  10973. Symbol(moduleSection,moduleSection,2,0);
  10974. Info(moduleSection, "TypeDescriptor");
  10975. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10976. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  10977. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  10978. END;
  10979. END;
  10980. RETURN moduleSection;
  10981. END ModuleSection;
  10982. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  10983. VAR
  10984. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  10985. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  10986. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  10987. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  10988. referenceSectionOffset : LONGINT;
  10989. BEGIN
  10990. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  10991. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  10992. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  10993. ImportsArray(importSection);
  10994. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  10995. CommandArray(commandsSection);
  10996. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  10997. ExceptionArray(exceptionSection);
  10998. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  10999. TypeInfoSection(typeInfoSection);
  11000. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11001. References(referenceSection);
  11002. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11003. IF ~implementationVisitor.backend.cooperative THEN
  11004. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  11005. ELSE
  11006. ptrTableSection := NIL;
  11007. END;
  11008. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  11009. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11010. Array(emptyArraySection,temp,"");
  11011. moduleSection := ModuleSection();
  11012. Info(moduleSection, "nextRoot*: RootObject");
  11013. Address(moduleSection,0);
  11014. Info(moduleSection, "next*: Module");
  11015. Address(moduleSection,0);
  11016. Info(moduleSection, "name*: Name");
  11017. Name(moduleSection,moduleName);
  11018. Info(moduleSection, "init, published: BOOLEAN");
  11019. Boolean(moduleSection,FALSE);
  11020. Boolean(moduleSection,FALSE);
  11021. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11022. Boolean(moduleSection,FALSE);
  11023. Boolean(moduleSection,FALSE);
  11024. Info(moduleSection, "refcnt*: LONGINT");
  11025. Longint(moduleSection,0);
  11026. Info(moduleSection, "sb*: ADDRESS");
  11027. Address(moduleSection,0);
  11028. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11029. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11030. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11031. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11032. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11033. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11034. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11035. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11036. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11037. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  11038. Info(moduleSection, "procTable*: ProcTable");
  11039. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11040. Info(moduleSection, "ptrTable*: PtrTable");
  11041. IF ~implementationVisitor.backend.cooperative THEN
  11042. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  11043. ELSE
  11044. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11045. END;
  11046. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11047. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11048. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11049. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11050. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11051. Info(moduleSection, "export*: ExportDesc");
  11052. ExportDesc(moduleSection);
  11053. Info(moduleSection, "term*: TerminationHandler");
  11054. Address(moduleSection,0);
  11055. Info(moduleSection, "exTable*: ExceptionTable");
  11056. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11057. Info(moduleSection, "noProcs*: LONGINT");
  11058. Longint(moduleSection,numberProcs);
  11059. Info(moduleSection, "firstProc*: ADDRESS");
  11060. Address(moduleSection,0);
  11061. Info(moduleSection, "maxPtrs*: LONGINT");
  11062. Longint(moduleSection,maxPointers);
  11063. Info(moduleSection, "crc*: LONGINT");
  11064. Longint(moduleSection, 0); (*! must be implemented *)
  11065. Info(moduleSection, "body*: ADDRESS");
  11066. Symbol(moduleSection, bodyProc, 0,0);
  11067. IF implementationVisitor.backend.cooperative THEN
  11068. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11069. Info(moduleSection, "monitor.owner");
  11070. Address(moduleSection,0);
  11071. Info(moduleSection, "monitor.nestingLevel");
  11072. Address(moduleSection,0);
  11073. Info(moduleSection, "monitor.blockedQueue");
  11074. Address(moduleSection,0); Address(moduleSection,0);
  11075. Info(moduleSection, "monitor.waitingQueue");
  11076. Address(moduleSection,0); Address(moduleSection,0);
  11077. Info(moduleSection, "monitor.waitingSentinel");
  11078. Address(moduleSection,0);
  11079. END;
  11080. END Module;
  11081. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11082. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  11083. BEGIN
  11084. Array(source,pc,"");
  11085. Info(source, "pointer offsets array data");
  11086. IF scope IS SyntaxTree.RecordScope THEN
  11087. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11088. ELSIF scope IS SyntaxTree.CellScope THEN
  11089. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11090. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11091. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11092. WHILE variable # NIL DO
  11093. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11094. symbol := module.allSections.FindBySymbol(variable);
  11095. ASSERT(symbol # NIL);
  11096. Pointers(0,symbol, source,variable.type,numberPointers);
  11097. END;
  11098. variable := variable.nextVariable;
  11099. END;
  11100. END;
  11101. PatchArray(source,pc,numberPointers);
  11102. END PointerArray;
  11103. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11104. VAR
  11105. name: Basic.SegmentedName;
  11106. section: IntermediateCode.Section;
  11107. BEGIN
  11108. ASSERT(implementationVisitor.newObjectFile);
  11109. Global.GetSymbolSegmentedName(symbol,name);
  11110. Basic.AppendToSegmentedName(name,suffix);
  11111. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11112. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11113. Info(section, "HeapBlock");
  11114. Address(section,0); (* empty such that GC does not go on traversing *)
  11115. Info(section, suffix);
  11116. Address(section,0);
  11117. pc := section.pc;
  11118. RETURN section;
  11119. END SymbolSection;
  11120. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11121. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11122. BEGIN
  11123. ASSERT(implementationVisitor.newObjectFile);
  11124. IF ~ReflectionSupport OR simple THEN variable := NIL
  11125. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11126. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11127. IF type IS SyntaxTree.PointerType THEN
  11128. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11129. END;
  11130. IF type IS SyntaxTree.RecordType THEN
  11131. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11132. ELSIF type IS SyntaxTree.CellType THEN
  11133. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11134. END;
  11135. ELSIF symbol IS SyntaxTree.Procedure THEN
  11136. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11137. END;
  11138. Info(in, "variables");
  11139. IF variable # NIL THEN
  11140. section := SymbolSection(symbol, "@Variables",pc);
  11141. VariableArray(section, variable);
  11142. Symbol(in, section, pc, 0);
  11143. ELSE
  11144. Address(in, 0);
  11145. END;
  11146. END ReflectVariables;
  11147. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11148. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11149. BEGIN
  11150. ASSERT(implementationVisitor.newObjectFile);
  11151. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11152. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11153. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11154. IF type IS SyntaxTree.PointerType THEN
  11155. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11156. END;
  11157. IF type IS SyntaxTree.RecordType THEN
  11158. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11159. ELSIF type IS SyntaxTree.CellType THEN
  11160. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11161. END;
  11162. ELSIF symbol IS SyntaxTree.Procedure THEN
  11163. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11164. END;
  11165. Info(in, "procedures");
  11166. IF procedure # NIL THEN
  11167. section := SymbolSection(symbol, "@Procedures",pc);
  11168. ProcedureArray(section, procedure);
  11169. Symbol(in, section, pc, 0);
  11170. ELSE
  11171. Address(in, 0);
  11172. END;
  11173. END ReflectProcedures;
  11174. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11175. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11176. segmentedName: Basic.SegmentedName;
  11177. td: SyntaxTree.TypeDeclaration;
  11178. type: SyntaxTree.Type;
  11179. BEGIN
  11180. Array(source,pc,"Modules.FieldEntry");
  11181. Info(source, "FieldArray");
  11182. size :=0;
  11183. WHILE variable # NIL DO
  11184. Info(source,"name");
  11185. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11186. type := variable.type.resolved;
  11187. Info(source,"offset");
  11188. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11189. Info(source,"type class");
  11190. IF type IS SyntaxTree.PointerType THEN
  11191. Size(source, 1);
  11192. ELSIF type IS SyntaxTree.RecordType THEN
  11193. Size(source, 2);
  11194. ELSIF type IS SyntaxTree.NumberType THEN
  11195. Size(source, 3);
  11196. ELSE
  11197. Size(source, 0);
  11198. END;
  11199. Info(source, "type desc");
  11200. IF type IS SyntaxTree.RecordType THEN
  11201. td := type(SyntaxTree.RecordType).typeDeclaration;
  11202. Global.GetSymbolSegmentedName(td,segmentedName);
  11203. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11204. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11205. ELSE
  11206. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11207. END;
  11208. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11209. Symbol(source, tir, 0, offset);
  11210. ELSE
  11211. Address(source, 0);
  11212. END;
  11213. Info(source,"flags");
  11214. Set(source, {});
  11215. variable := variable.nextVariable;
  11216. INC(size);
  11217. END;
  11218. PatchArray(source,pc,size);
  11219. END VariableArray;
  11220. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11221. VAR pc: LONGINT; size: LONGINT;
  11222. segmentedName: Basic.SegmentedName;
  11223. BEGIN
  11224. Array(source,pc,"Modules.ProcedureEntry");
  11225. Info(source, "ProcedureArray");
  11226. size :=0;
  11227. WHILE procedure # NIL DO
  11228. Info(source,"name");
  11229. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11230. Global.GetSymbolSegmentedName(procedure, segmentedName);
  11231. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11232. (* size *)
  11233. Size(source, 0);
  11234. (* parameters *)
  11235. Address(source, 0);
  11236. (* variables *)
  11237. ReflectVariables(source, procedure);
  11238. ReflectProcedures(source, procedure);
  11239. (* return type entry *)
  11240. Address(source, 0);
  11241. Address(source, 0);
  11242. procedure := procedure.nextProcedure;
  11243. INC(size);
  11244. END;
  11245. PatchArray(source,pc,size);
  11246. END ProcedureArray;
  11247. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11248. VAR recordType: SyntaxTree.RecordType;
  11249. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11250. section: Sections.Section; cellType: SyntaxTree.CellType;
  11251. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11252. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11253. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11254. sectionName: Basic.SectionName;
  11255. CONST MPO=-40000000H;
  11256. BEGIN
  11257. (*
  11258. TypeDesc* = POINTER TO RECORD
  11259. descSize: LONGINT;
  11260. sentinel: LONGINT; (* = MPO-4 *)
  11261. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11262. flags*: SET;
  11263. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11264. name*: Name;
  11265. END;
  11266. *)
  11267. (* source := module.sections.FindByName(...) *)
  11268. Global.GetSymbolSegmentedName(td,name);
  11269. Basic.AppendToSegmentedName(name,"@Info");
  11270. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11271. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11272. Address(source,MPO-4);
  11273. Info(source, "type tag pointer");
  11274. Symbol( source, tag, offset, 0);
  11275. Info(source, "type flags");
  11276. flags := {};
  11277. IF isProtected THEN INCL(flags,31) END;
  11278. Set( source, flags);
  11279. Info(source, "pointer to module");
  11280. moduleSection := ModuleSection();
  11281. Symbol( source, moduleSection, moduleSection.pc,0);
  11282. Info(source, "type name");
  11283. i := 0;
  11284. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11285. (*
  11286. Global.GetSymbolSegmentedName(td,name);
  11287. Basic.SegmentedNameToString(name, sectionName);
  11288. *)
  11289. Name(source,sectionName);
  11290. source.SetReferenced(FALSE);
  11291. Global.GetSymbolSegmentedName(td,name);
  11292. Basic.AppendToSegmentedName(name,"@Fields");
  11293. ReflectVariables(source, td);
  11294. ReflectProcedures(source, td);
  11295. (*
  11296. fieldSection := VariableArray(
  11297. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11298. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11299. Info(fieldSection, "HeapBlock");
  11300. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11301. Info(fieldSection, "TypeDescriptor");
  11302. Address(fieldSection,0);
  11303. Info(source, "FieldArray ref");
  11304. Symbol(source, fieldSection, fieldSection.pc, 0);
  11305. FieldArray(fieldSection);
  11306. Global.GetSymbolSegmentedName(td,name);
  11307. Basic.AppendToSegmentedName(name,"@Procedures");
  11308. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11309. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11310. Info(fieldSection, "HeapBlock");
  11311. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11312. Info(fieldSection, "TypeDescriptor");
  11313. Address(fieldSection,0);
  11314. Info(source, "Procedure Array ref");
  11315. Symbol(source, fieldSection, fieldSection.pc, 0);
  11316. ProcedureArray(fieldSection);
  11317. *)
  11318. RETURN source;
  11319. END NewTypeDescriptorInfo;
  11320. PROCEDURE NewTypeDescriptor;
  11321. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11322. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11323. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11324. numberPointers: LONGINT; padding, i: LONGINT;
  11325. CONST MPO=-40000000H;
  11326. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11327. VAR i: LONGINT;
  11328. PROCEDURE Td(record: SyntaxTree.RecordType);
  11329. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11330. BEGIN
  11331. IF record # NIL THEN
  11332. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11333. baseTD := record.typeDeclaration;
  11334. Global.GetSymbolSegmentedName(baseTD,name);
  11335. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11336. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11337. ELSE
  11338. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11339. END;
  11340. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11341. Symbol(source, tir, 0, offset);
  11342. IF reverse THEN Td(record.GetBaseRecord()) END;
  11343. END;
  11344. END Td;
  11345. BEGIN
  11346. Info(source, "tag table");
  11347. baseRecord := recordType;
  11348. i := 0;
  11349. WHILE baseRecord # NIL DO
  11350. INC(i);
  11351. baseRecord := baseRecord.GetBaseRecord();
  11352. END;
  11353. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11354. IF ~reverse THEN Td(recordType) END;
  11355. WHILE i < size DO
  11356. Address(source,0);
  11357. INC(i);
  11358. END;
  11359. IF reverse THEN Td(recordType) END;
  11360. END TdTable;
  11361. PROCEDURE MethodTable(reverse: BOOLEAN);
  11362. VAR i,methods: LONGINT;
  11363. BEGIN
  11364. Info(source, "method table");
  11365. IF recordType # NIL THEN
  11366. methods := recordType.recordScope.numberMethods;
  11367. IF reverse THEN
  11368. FOR i := methods-1 TO 0 BY -1 DO
  11369. procedure := recordType.recordScope.FindMethod(i);
  11370. Global.GetSymbolSegmentedName(procedure, name);
  11371. NamedSymbol(source, name,procedure, 0,0);
  11372. END;
  11373. ELSE
  11374. FOR i := 0 TO methods-1 DO
  11375. procedure := recordType.recordScope.FindMethod(i);
  11376. Global.GetSymbolSegmentedName(procedure, name);
  11377. NamedSymbol(source, name,procedure, 0,0);
  11378. END;
  11379. END;
  11380. END;
  11381. END MethodTable;
  11382. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11383. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11384. BEGIN
  11385. Info(source, "method table");
  11386. baseRecord := recordType;
  11387. WHILE baseRecord.baseType # NIL DO
  11388. baseRecord := baseRecord.GetBaseRecord ();
  11389. END;
  11390. GetRecordTypeName (baseRecord, name);
  11391. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11392. IF name = stackFrame THEN
  11393. start := 0;
  11394. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11395. baseRecord := recordType;
  11396. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11397. baseRecord := baseRecord.GetBaseRecord ();
  11398. END;
  11399. IF baseRecord # NIL THEN
  11400. GetRecordTypeName (baseRecord, name);
  11401. IF pointer & ~baseRecord.isObject THEN
  11402. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11403. END;
  11404. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11405. ELSIF recordType.isObject THEN
  11406. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11407. ELSIF pointer THEN
  11408. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11409. ELSE
  11410. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11411. END;
  11412. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11413. Symbol(source, tir, 0, 0);
  11414. start := 0;
  11415. baseRecord := recordType;
  11416. WHILE (baseRecord # NIL) DO
  11417. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11418. baseRecord := baseRecord.GetBaseRecord ();
  11419. END;
  11420. ELSE
  11421. (* explicit trace method: *)
  11422. procedure := recordType.recordScope.FindMethod(0);
  11423. IF ~procedure.isFinalizer THEN
  11424. Global.GetSymbolSegmentedName(procedure, name);
  11425. NamedSymbol(source, name,procedure, 0,0);
  11426. END;
  11427. start := 1;
  11428. END;
  11429. IF (name # stackFrame) & recordType.isObject THEN
  11430. baseRecord := recordType;
  11431. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11432. baseRecord := baseRecord.GetBaseRecord ();
  11433. END;
  11434. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11435. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11436. ELSE
  11437. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11438. END;
  11439. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11440. Symbol(source, tir, 0, 0);
  11441. END;
  11442. methods := recordType.recordScope.numberMethods;
  11443. FOR i := start TO methods-1 DO
  11444. procedure := recordType.recordScope.FindMethod(i);
  11445. IF ~procedure.isFinalizer THEN
  11446. Global.GetSymbolSegmentedName(procedure, name);
  11447. NamedSymbol(source, name,procedure, 0,0);
  11448. END;
  11449. END;
  11450. END CooperativeMethodTable;
  11451. BEGIN
  11452. Global.GetSymbolSegmentedName(td,name);
  11453. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11454. source.SetExported(IsExported(td));
  11455. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11456. IF implementationVisitor.backend.cooperative THEN
  11457. base := NIL;
  11458. baseRecord := recordType.GetBaseRecord();
  11459. IF baseRecord # NIL THEN
  11460. baseTD := baseRecord.typeDeclaration;
  11461. END;
  11462. IF ~recordType.isObject THEN
  11463. Info(source, "parent");
  11464. IF baseRecord # NIL THEN
  11465. Global.GetSymbolSegmentedName(baseTD,name);
  11466. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11467. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11468. ELSE
  11469. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11470. END;
  11471. Symbol(source, tir, 0, 0);
  11472. ELSE
  11473. Address(source,0);
  11474. END;
  11475. Info(source, "record size");
  11476. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11477. source.SetReferenced(FALSE);
  11478. CooperativeMethodTable(FALSE);
  11479. base := source;
  11480. Global.GetSymbolSegmentedName(td,name);
  11481. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11482. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11483. source.SetExported(IsExported(td));
  11484. source.SetReferenced(FALSE);
  11485. END;
  11486. Info(source, "parent");
  11487. IF baseRecord # NIL THEN
  11488. Global.GetSymbolSegmentedName(baseTD,name);
  11489. sym := baseTD;
  11490. IF ~recordType.isObject THEN
  11491. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11492. sym := NIL;
  11493. END;
  11494. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11495. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11496. ELSE
  11497. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11498. END;
  11499. Symbol(source, tir, 0, 0);
  11500. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11501. Address(source,0);
  11502. ELSE
  11503. IF recordType.isObject THEN
  11504. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11505. ELSE
  11506. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11507. END;
  11508. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11509. Symbol(source, tir, 0, 0);
  11510. END;
  11511. Info(source, "base record descriptor");
  11512. Symbol(source, base, 0, 0);
  11513. CooperativeMethodTable(TRUE);
  11514. source.SetReferenced(FALSE);
  11515. IF recordType.hasPointers THEN
  11516. IF ~HasExplicitTraceMethod (recordType) THEN
  11517. implementationVisitor.CreateTraceMethod(recordType);
  11518. END;
  11519. implementationVisitor.CreateResetProcedure(recordType);
  11520. implementationVisitor.CreateAssignProcedure(recordType);
  11521. END;
  11522. ELSIF ~simple THEN
  11523. (*
  11524. MethodEnd = MPO
  11525. ---
  11526. methods (# methods)
  11527. ---
  11528. tags (16)
  11529. ---
  11530. TypeDesc = TypeInfoAdr
  11531. ---
  11532. td adr ---> rec size
  11533. ----
  11534. pointer offsets
  11535. ----
  11536. (padding)
  11537. -----
  11538. empty [2 addresses aligned]
  11539. empty
  11540. empty
  11541. numPtrs
  11542. ---
  11543. pointer offsets
  11544. ---
  11545. *)
  11546. Info(source, "MethodEnd = MPO");
  11547. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11548. source(IntermediateCode.Section).Emit(Data(-1,op));
  11549. MethodTable(TRUE);
  11550. TdTable(TypeTags, TRUE);
  11551. Info(source, "type descriptor info pointer");
  11552. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11553. IF (cellType # NIL) THEN
  11554. IF cellType.sizeInBits < 0 THEN
  11555. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11556. END;
  11557. Info(source, "cell size");
  11558. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11559. ELSE
  11560. Info(source, "record size");
  11561. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11562. END;
  11563. Info(source, "pointer offsets pointer");
  11564. padding := 1- source.pc MOD 2;
  11565. Symbol(source, source, source.pc+1+padding,0);
  11566. IF padding >0 THEN
  11567. Info(source, "padding");
  11568. FOR i := 1 TO padding DO Address(source,0) END;
  11569. END;
  11570. IF cellType # NIL THEN
  11571. PointerArray(source, cellType.cellScope, numberPointers);
  11572. ELSE
  11573. PointerArray(source, recordType.recordScope, numberPointers);
  11574. END;
  11575. ELSE
  11576. (*
  11577. simple:
  11578. td adr --> size
  11579. tag(1)
  11580. tag(2)
  11581. tag(3)
  11582. methods ->
  11583. *)
  11584. Info(source, "record size");
  11585. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11586. TdTable(TypeTags, FALSE);
  11587. MethodTable(FALSE);
  11588. source.SetReferenced(FALSE);
  11589. END;
  11590. END NewTypeDescriptor;
  11591. BEGIN
  11592. x := x.resolved;
  11593. IF (x IS SyntaxTree.PointerType) THEN
  11594. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11595. END;
  11596. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11597. recordType := x(SyntaxTree.RecordType);
  11598. td := x.typeDeclaration;
  11599. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11600. ASSERT(td # NIL);
  11601. section := module.allSections.FindBySymbol(td); (* TODO *)
  11602. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11603. IF implementationVisitor.newObjectFile THEN
  11604. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11605. NewTypeDescriptor
  11606. END;
  11607. ELSE
  11608. (* data section in intermediate code *)
  11609. Global.GetSymbolSegmentedName(td,name);
  11610. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11611. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11612. tir.Emit(Data(-1,op));
  11613. END;
  11614. END;
  11615. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11616. cellType := x(SyntaxTree.CellType);
  11617. td := x.typeDeclaration;
  11618. section := module.allSections.FindBySymbol(td); (* TODO *)
  11619. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11620. IF implementationVisitor.newObjectFile THEN
  11621. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11622. NewTypeDescriptor
  11623. END;
  11624. END;
  11625. END;
  11626. END
  11627. END CheckTypeDeclaration
  11628. END MetaDataGenerator;
  11629. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11630. VAR
  11631. trace-: BOOLEAN;
  11632. traceString-: SyntaxTree.IdentifierString;
  11633. traceModuleName-: SyntaxTree.IdentifierString;
  11634. newObjectFile-: BOOLEAN;
  11635. profile-: BOOLEAN;
  11636. noRuntimeChecks: BOOLEAN;
  11637. simpleMetaData-: BOOLEAN;
  11638. noAsserts: BOOLEAN;
  11639. optimize-: BOOLEAN;
  11640. cooperative-: BOOLEAN;
  11641. preregisterStatic-: BOOLEAN;
  11642. dump-: Basic.Writer;
  11643. cellsAreObjects: BOOLEAN;
  11644. PROCEDURE &InitIntermediateBackend*;
  11645. BEGIN
  11646. simpleMetaData := FALSE;
  11647. newObjectFile := FALSE;
  11648. InitBackend;
  11649. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11650. SetTraceModuleName(DefaultTraceModuleName);
  11651. END InitIntermediateBackend;
  11652. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11653. VAR
  11654. declarationVisitor: DeclarationVisitor;
  11655. implementationVisitor: ImplementationVisitor;
  11656. module: Sections.Module;
  11657. name, platformName: SyntaxTree.IdentifierString;
  11658. meta: MetaDataGenerator;
  11659. BEGIN
  11660. ResetError;
  11661. Global.GetSymbolName(x,name);
  11662. NEW(module,x,system); (* backend structures *)
  11663. Global.GetModuleName(x, name);
  11664. module.SetModuleName(name);
  11665. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11666. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11667. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11668. declarationVisitor.Module(x,module);
  11669. IF newObjectFile & ~meta.simple THEN
  11670. meta.Module(implementationVisitor.moduleBodySection);
  11671. END;
  11672. GetDescription(platformName);
  11673. module.SetPlatformName(platformName);
  11674. RETURN module
  11675. END GenerateIntermediate;
  11676. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11677. BEGIN RETURN TRUE
  11678. END SupportedImmediate;
  11679. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11680. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11681. END ProcessSyntaxTreeModule;
  11682. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11683. VAR
  11684. result: Sections.Module;
  11685. traceName: Basic.MessageString;
  11686. BEGIN
  11687. ASSERT(intermediateCodeModule IS Sections.Module);
  11688. result := intermediateCodeModule(Sections.Module);
  11689. IF trace THEN
  11690. traceName := "intermediate code trace: ";
  11691. Strings.Append(traceName,traceString);
  11692. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11693. IF (traceString="") OR (traceString="*") THEN
  11694. result.Dump(dump);
  11695. dump.Update
  11696. ELSE
  11697. Sections.DumpFiltered(dump, result, traceString);
  11698. END
  11699. END;
  11700. RETURN result
  11701. END ProcessIntermediateCodeModule;
  11702. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11703. BEGIN instructionSet := "Intermediate";
  11704. END GetDescription;
  11705. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11706. BEGIN
  11707. SELF.newObjectFile := newObjectFile;
  11708. SELF.simpleMetaData := simpleMetaData;
  11709. END SetNewObjectFile;
  11710. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11711. BEGIN COPY(name, traceModuleName)
  11712. END SetTraceModuleName;
  11713. PROCEDURE DefineOptions(options: Options.Options);
  11714. BEGIN
  11715. DefineOptions^(options);
  11716. options.Add(0X,"trace",Options.String);
  11717. options.Add(0X,"runtime",Options.String);
  11718. options.Add(0X,"newObjectFile",Options.Flag);
  11719. options.Add(0X,"traceModule",Options.String);
  11720. options.Add(0X,"profile",Options.Flag);
  11721. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11722. options.Add(0X,"noAsserts",Options.Flag);
  11723. options.Add(0X,"metaData",Options.String);
  11724. options.Add('o',"optimize", Options.Flag);
  11725. options.Add(0X,"preregisterStatic", Options.Flag);
  11726. options.Add(0X,"cellsAreObjects", Options.Flag);
  11727. END DefineOptions;
  11728. PROCEDURE GetOptions(options: Options.Options);
  11729. VAR name,string: SyntaxTree.IdentifierString;
  11730. BEGIN
  11731. GetOptions^(options);
  11732. trace := options.GetString("trace",traceString);
  11733. profile := options.GetFlag("profile");
  11734. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11735. noAsserts := options.GetFlag("noAsserts");
  11736. cooperative := options.GetFlag("cooperative");
  11737. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11738. IF cooperative THEN
  11739. SetRuntimeModuleName("CPU") END
  11740. END;
  11741. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11742. simpleMetaData := TRUE
  11743. END;
  11744. IF options.GetString("metaData",string) THEN
  11745. IF string = "simple" THEN simpleMetaData := TRUE
  11746. ELSIF string ="full" THEN simpleMetaData := FALSE
  11747. END;
  11748. END;
  11749. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11750. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11751. optimize := options.GetFlag("optimize");
  11752. preregisterStatic := options.GetFlag("preregisterStatic");
  11753. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11754. END GetOptions;
  11755. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11756. BEGIN RETURN SymbolFileFormat.Get()
  11757. END DefaultSymbolFileFormat;
  11758. END IntermediateBackend;
  11759. (* ----------------------------------- register allocation ------------------------------------- *)
  11760. (* register mapping scheme
  11761. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11762. spill offset
  11763. part(n) --> ticket <--> physical register
  11764. spill offset
  11765. *)
  11766. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11767. emptyOperand: IntermediateCode.Operand;
  11768. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11769. statCoopResetVariables: LONGINT;
  11770. statCoopModifyAssignments: LONGINT;
  11771. modifyAssignmentsPC : LONGINT;
  11772. statCoopNilCheck: LONGINT;
  11773. statCoopSwitch: LONGINT;
  11774. statCoopAssignProcedure: LONGINT;
  11775. statCoopTraceMethod: LONGINT;
  11776. statCoopResetProcedure: LONGINT;
  11777. statCoopTraceModule: LONGINT;
  11778. PROCEDURE ResetStatistics*;
  11779. BEGIN
  11780. statCoopResetVariables := 0;
  11781. statCoopModifyAssignments := 0;
  11782. statCoopNilCheck:= 0;
  11783. statCoopSwitch:= 0;
  11784. statCoopAssignProcedure:= 0;
  11785. statCoopTraceMethod:= 0;
  11786. statCoopResetProcedure:= 0;
  11787. statCoopTraceModule:= 0;
  11788. END ResetStatistics;
  11789. PROCEDURE Statistics*;
  11790. BEGIN
  11791. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11792. TRACE(statCoopNilCheck, statCoopSwitch);
  11793. TRACE(statCoopAssignProcedure,
  11794. statCoopTraceMethod,
  11795. statCoopResetProcedure,
  11796. statCoopTraceModule)
  11797. END Statistics;
  11798. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11799. VAR h: LONGINT;
  11800. BEGIN
  11801. WHILE b # 0 DO
  11802. h := a MOD b;
  11803. a := b;
  11804. b := h;
  11805. END;
  11806. RETURN a
  11807. END GCD;
  11808. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11809. BEGIN
  11810. RETURN a*b DIV GCD(a,b)
  11811. END SCM;
  11812. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11813. BEGIN
  11814. (*TRACE(a,b);*)
  11815. IF a = 0 THEN RETURN b
  11816. ELSIF b = 0 THEN RETURN a
  11817. ELSE RETURN SCM(a,b)
  11818. END;
  11819. END CommonAlignment;
  11820. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11821. BEGIN
  11822. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11823. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11824. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11825. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11826. 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)
  11827. END
  11828. END PassBySingleReference;
  11829. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11830. BEGIN
  11831. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11832. END PassInRegister;
  11833. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11834. VAR new: RegisterEntry;
  11835. BEGIN
  11836. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11837. IF queue = NIL THEN
  11838. queue := new
  11839. ELSE
  11840. new.next := queue;
  11841. IF queue#NIL THEN queue.prev := new END;
  11842. queue := new
  11843. END;
  11844. END AddRegisterEntry;
  11845. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11846. VAR this: RegisterEntry;
  11847. BEGIN
  11848. this := queue;
  11849. WHILE (this # NIL) & (this.register # register) DO
  11850. this := this.next;
  11851. END;
  11852. IF this = NIL THEN
  11853. RETURN FALSE
  11854. END;
  11855. ASSERT(this # NIL);
  11856. IF this = queue THEN queue := queue.next END;
  11857. IF this.prev # NIL THEN this.prev.next := this.next END;
  11858. IF this.next # NIL THEN this.next.prev := this.prev END;
  11859. RETURN TRUE
  11860. END RemoveRegisterEntry;
  11861. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11862. BEGIN ASSERT(cond);
  11863. END Assert;
  11864. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11865. BEGIN
  11866. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11867. END ReusableRegister;
  11868. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11869. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11870. BEGIN
  11871. procedure := moduleScope.bodyProcedure;
  11872. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11873. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11874. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11875. procedure.SetScope(moduleScope);
  11876. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11877. procedure.SetAccess(SyntaxTree.Hidden);
  11878. moduleScope.SetBodyProcedure(procedure);
  11879. moduleScope.AddProcedure(procedure);
  11880. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11881. END;
  11882. END EnsureBodyProcedure;
  11883. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11884. VAR import: SyntaxTree.Import;
  11885. selfName: SyntaxTree.IdentifierString;
  11886. module: SyntaxTree.Module;
  11887. BEGIN
  11888. scope.ownerModule.GetName(selfName);
  11889. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11890. module := scope.ownerModule
  11891. ELSE
  11892. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11893. IF import = NIL THEN
  11894. RETURN NIL
  11895. ELSIF import.module = NIL THEN
  11896. RETURN NIL
  11897. ELSE module := import.module
  11898. END;
  11899. END;
  11900. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11901. END GetSymbol;
  11902. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11903. BEGIN
  11904. op.mode := mode;
  11905. IntermediateCode.InitOperand(op.op);
  11906. IntermediateCode.InitOperand(op.tag);
  11907. IntermediateCode.InitOperand(op.extra);
  11908. op.dimOffset := 0;
  11909. END InitOperand;
  11910. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11911. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11912. BEGIN RETURN IntermediateCode.GetType(system, type)
  11913. END GetType;
  11914. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11915. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11916. BEGIN
  11917. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  11918. (*
  11919. UniqueId(name,module,name,adr);
  11920. *)
  11921. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  11922. constant.SetValue(value);
  11923. module.moduleScope.AddConstant(constant);
  11924. constant.SetScope(module.moduleScope);
  11925. RETURN constant
  11926. END BuildConstant;
  11927. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11928. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  11929. BEGIN
  11930. variable := scope.firstVariable;
  11931. WHILE variable # NIL DO
  11932. IF variable.NeedsTrace() THEN
  11933. RETURN TRUE;
  11934. END;
  11935. variable := variable.nextVariable;
  11936. END;
  11937. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11938. WHILE parameter # NIL DO
  11939. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11940. RETURN TRUE;
  11941. END;
  11942. parameter := parameter.nextParameter;
  11943. END;
  11944. RETURN FALSE;
  11945. END HasPointers;
  11946. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  11947. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  11948. END IsVariableParameter;
  11949. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11950. VAR parameter: SyntaxTree.Parameter;
  11951. BEGIN
  11952. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11953. WHILE parameter # NIL DO
  11954. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  11955. IF parameter.movable THEN RETURN TRUE END;
  11956. parameter := parameter.nextParameter;
  11957. END;
  11958. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  11959. END HasVariableParameters;
  11960. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  11961. BEGIN
  11962. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  11963. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  11964. END HasExplicitTraceMethod;
  11965. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  11966. BEGIN
  11967. IF expression.resolved # NIL THEN expression := expression.resolved END;
  11968. IF (expression IS SyntaxTree.IntegerValue) THEN
  11969. val := expression(SyntaxTree.IntegerValue).value;
  11970. RETURN TRUE
  11971. ELSE
  11972. RETURN FALSE
  11973. END;
  11974. END IsIntegerConstant;
  11975. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  11976. BEGIN
  11977. IF val <= 0 THEN RETURN FALSE END;
  11978. exp := 0;
  11979. WHILE ~ODD(val) DO
  11980. val := val DIV 2;
  11981. INC(exp)
  11982. END;
  11983. RETURN val = 1
  11984. END PowerOf2;
  11985. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  11986. VAR procedure: SyntaxTree.Procedure;
  11987. BEGIN
  11988. procedure := record.recordScope.constructor;
  11989. IF procedure = NIL THEN
  11990. record := record.GetBaseRecord();
  11991. IF record # NIL THEN
  11992. procedure := GetConstructor(record)
  11993. END;
  11994. END;
  11995. RETURN procedure;
  11996. END GetConstructor;
  11997. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  11998. BEGIN
  11999. value := SHORT(op.intValue);
  12000. RETURN op.mode = IntermediateCode.ModeImmediate;
  12001. END IsIntegerImmediate;
  12002. (** whether a type strictily is a pointer to record or object type
  12003. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12004. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12005. BEGIN
  12006. IF type = NIL THEN
  12007. RETURN FALSE
  12008. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12009. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12010. ELSE
  12011. RETURN FALSE
  12012. END
  12013. END IsStrictlyPointerToRecord;
  12014. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12015. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12016. END IsUnsafePointer;
  12017. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12018. BEGIN type := type.resolved;
  12019. IF type IS SyntaxTree.PointerType THEN
  12020. type := type(SyntaxTree.PointerType).pointerBase;
  12021. type := type.resolved;
  12022. IF type IS SyntaxTree.RecordType THEN
  12023. recordType := type(SyntaxTree.RecordType);
  12024. RETURN TRUE
  12025. ELSE
  12026. RETURN FALSE
  12027. END
  12028. ELSIF type IS SyntaxTree.RecordType THEN
  12029. recordType := type(SyntaxTree.RecordType);
  12030. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12031. ELSIF type IS SyntaxTree.ObjectType THEN
  12032. RETURN TRUE
  12033. ELSIF type IS SyntaxTree.AnyType THEN
  12034. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12035. ELSE
  12036. RETURN FALSE
  12037. END;
  12038. END IsPointerToRecord;
  12039. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12040. BEGIN
  12041. type := type.resolved;
  12042. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12043. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12044. END IsArrayOfSystemByte;
  12045. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12046. BEGIN
  12047. IF type = NIL THEN RETURN FALSE END;
  12048. type := type.resolved;
  12049. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12050. END IsOpenArray;
  12051. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12052. BEGIN
  12053. IF type = NIL THEN RETURN FALSE END;
  12054. type := type.resolved;
  12055. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12056. END IsSemiDynamicArray;
  12057. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12058. BEGIN
  12059. IF type = NIL THEN RETURN FALSE END;
  12060. type := type.resolved;
  12061. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12062. END IsStaticArray;
  12063. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12064. VAR size: LONGINT;
  12065. BEGIN
  12066. size := 1;
  12067. WHILE (IsStaticArray(type)) DO
  12068. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12069. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12070. END;
  12071. RETURN size;
  12072. END StaticArrayNumElements;
  12073. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12074. BEGIN
  12075. WHILE (IsStaticArray(type)) DO
  12076. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12077. END;
  12078. RETURN type;
  12079. END StaticArrayBaseType;
  12080. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12081. BEGIN
  12082. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12083. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12084. END;
  12085. RETURN type;
  12086. END ArrayBaseType;
  12087. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12088. BEGIN
  12089. IF type = NIL THEN RETURN FALSE END;
  12090. type := type.resolved;
  12091. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12092. END IsDelegate;
  12093. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12094. VAR i: LONGINT;
  12095. BEGIN
  12096. i := 0; type := type.resolved;
  12097. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12098. INC(i);
  12099. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12100. END;
  12101. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12102. INC(i);
  12103. type := type(SyntaxTree.MathArrayType).arrayBase;
  12104. IF type # NIL THEN type := type.resolved END;
  12105. END;
  12106. RETURN i
  12107. END DynamicDim;
  12108. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12109. BEGIN
  12110. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12111. type := type(SyntaxTree.ArrayType).arrayBase;
  12112. END;
  12113. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12114. type := type(SyntaxTree.MathArrayType).arrayBase;
  12115. END;
  12116. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12117. END StaticSize;
  12118. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12119. BEGIN
  12120. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12121. END IsImmediate;
  12122. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12123. BEGIN
  12124. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12125. END IsAddress;
  12126. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12127. BEGIN
  12128. RETURN (x.mode = IntermediateCode.ModeRegister);
  12129. END IsRegister;
  12130. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12131. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12132. BEGIN
  12133. typeDeclaration := recordType.typeDeclaration;
  12134. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12135. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12136. END GetRecordTypeName;
  12137. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12138. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12139. BEGIN
  12140. parSize := 0;
  12141. IF StructuredReturnType(procedureType) THEN
  12142. parameter := procedureType.returnParameter;
  12143. INC(parSize,system.SizeOfParameter(parameter));
  12144. parSize := parSize + (-parSize) MOD system.addressSize;
  12145. END;
  12146. parameter :=procedureType.lastParameter;
  12147. WHILE (parameter # NIL) DO
  12148. INC(parSize,system.SizeOfParameter(parameter));
  12149. parSize := parSize + (-parSize) MOD system.addressSize;
  12150. parameter := parameter.prevParameter;
  12151. END;
  12152. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12153. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12154. RETURN ToMemoryUnits(system,parSize)
  12155. END ParametersSize;
  12156. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12157. BEGIN
  12158. IF type = NIL THEN RETURN FALSE
  12159. ELSE
  12160. type := type.resolved;
  12161. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12162. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12163. END
  12164. END ReturnedAsParameter;
  12165. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12166. BEGIN
  12167. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12168. END StructuredReturnType;
  12169. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12170. BEGIN
  12171. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12172. END IsNested;
  12173. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12174. BEGIN
  12175. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12176. scope := scope.outerScope;
  12177. END;
  12178. RETURN scope # NIL;
  12179. END InCellScope;
  12180. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12181. BEGIN
  12182. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12183. RETURN 0
  12184. ELSE
  12185. *)
  12186. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12187. (*END;*)
  12188. END ProcedureParametersSize;
  12189. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12190. VAR dataUnit: LONGINT;
  12191. BEGIN dataUnit := system.dataUnit;
  12192. ASSERT(size MOD system.dataUnit = 0);
  12193. RETURN size DIV system.dataUnit
  12194. END ToMemoryUnits;
  12195. PROCEDURE Get*(): Backend.Backend;
  12196. VAR backend: IntermediateBackend;
  12197. BEGIN NEW(backend); RETURN backend
  12198. END Get;
  12199. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12200. VAR instruction: IntermediateCode.Instruction;
  12201. BEGIN
  12202. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12203. RETURN instruction
  12204. END Nop;
  12205. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12206. VAR instruction: IntermediateCode.Instruction;
  12207. BEGIN
  12208. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12209. RETURN instruction
  12210. END Mov;
  12211. (* like Mov but ensures that no new register will be allocated for dest *)
  12212. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12213. VAR instruction: IntermediateCode.Instruction;
  12214. BEGIN
  12215. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12216. RETURN instruction
  12217. END MovReplace;
  12218. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12219. VAR instruction: IntermediateCode.Instruction;
  12220. BEGIN
  12221. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12222. RETURN instruction
  12223. END Conv;
  12224. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12225. VAR instruction: IntermediateCode.Instruction;
  12226. BEGIN
  12227. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12228. RETURN instruction
  12229. END Call;
  12230. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12231. VAR op1, op2: IntermediateCode.Operand;
  12232. VAR instruction: IntermediateCode.Instruction;
  12233. BEGIN
  12234. IntermediateCode.InitNumber(op1,pcOffset);
  12235. IntermediateCode.InitNumber(op2,callingConvention);
  12236. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12237. RETURN instruction
  12238. END Exit;
  12239. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12240. VAR instruction: IntermediateCode.Instruction;
  12241. BEGIN
  12242. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12243. RETURN instruction
  12244. END Return;
  12245. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12246. VAR instruction: IntermediateCode.Instruction;
  12247. BEGIN
  12248. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12249. RETURN instruction
  12250. END Result;
  12251. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12252. VAR op1: IntermediateCode.Operand;
  12253. VAR instruction: IntermediateCode.Instruction;
  12254. BEGIN
  12255. IntermediateCode.InitNumber(op1,nr);
  12256. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12257. RETURN instruction
  12258. END Trap;
  12259. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12260. VAR instruction: IntermediateCode.Instruction;
  12261. BEGIN
  12262. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12263. RETURN instruction
  12264. END Br;
  12265. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12266. VAR instruction: IntermediateCode.Instruction;
  12267. BEGIN
  12268. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12269. RETURN instruction
  12270. END Breq;
  12271. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12272. VAR instruction: IntermediateCode.Instruction;
  12273. BEGIN
  12274. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12275. RETURN instruction
  12276. END Brne;
  12277. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12278. VAR instruction: IntermediateCode.Instruction;
  12279. BEGIN
  12280. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12281. RETURN instruction
  12282. END Brge;
  12283. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12284. VAR instruction: IntermediateCode.Instruction;
  12285. BEGIN
  12286. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12287. RETURN instruction
  12288. END Brlt;
  12289. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12290. VAR instruction: IntermediateCode.Instruction;
  12291. BEGIN
  12292. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12293. RETURN instruction
  12294. END Pop;
  12295. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12296. VAR instruction: IntermediateCode.Instruction;
  12297. BEGIN
  12298. ASSERT(op.mode # IntermediateCode.Undefined);
  12299. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12300. RETURN instruction
  12301. END Push;
  12302. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12303. VAR instruction: IntermediateCode.Instruction;
  12304. BEGIN
  12305. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12306. RETURN instruction
  12307. END Neg;
  12308. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12309. VAR instruction: IntermediateCode.Instruction;
  12310. BEGIN
  12311. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12312. RETURN instruction
  12313. END Not;
  12314. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12315. VAR instruction: IntermediateCode.Instruction;
  12316. BEGIN
  12317. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12318. RETURN instruction
  12319. END Abs;
  12320. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12321. VAR instruction: IntermediateCode.Instruction;
  12322. BEGIN
  12323. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12324. RETURN instruction
  12325. END Mul;
  12326. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12327. VAR instruction: IntermediateCode.Instruction;
  12328. BEGIN
  12329. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12330. RETURN instruction
  12331. END Div;
  12332. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12333. VAR instruction: IntermediateCode.Instruction;
  12334. BEGIN
  12335. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12336. RETURN instruction
  12337. END Mod;
  12338. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12339. VAR instruction: IntermediateCode.Instruction;
  12340. BEGIN
  12341. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12342. RETURN instruction
  12343. END Sub;
  12344. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12345. VAR instruction: IntermediateCode.Instruction;
  12346. BEGIN
  12347. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12348. RETURN instruction
  12349. END Add;
  12350. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12351. VAR instruction: IntermediateCode.Instruction;
  12352. BEGIN
  12353. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12354. RETURN instruction
  12355. END And;
  12356. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12357. VAR instruction: IntermediateCode.Instruction;
  12358. BEGIN
  12359. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12360. RETURN instruction
  12361. END Or;
  12362. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12363. VAR instruction: IntermediateCode.Instruction;
  12364. BEGIN
  12365. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12366. RETURN instruction
  12367. END Xor;
  12368. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12369. VAR instruction: IntermediateCode.Instruction;
  12370. BEGIN
  12371. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12372. RETURN instruction
  12373. END Shl;
  12374. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12375. VAR instruction: IntermediateCode.Instruction;
  12376. BEGIN
  12377. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12378. RETURN instruction
  12379. END Shr;
  12380. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12381. VAR instruction: IntermediateCode.Instruction;
  12382. BEGIN
  12383. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12384. RETURN instruction
  12385. END Rol;
  12386. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12387. VAR instruction: IntermediateCode.Instruction;
  12388. BEGIN
  12389. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12390. RETURN instruction
  12391. END Ror;
  12392. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12393. VAR instruction: IntermediateCode.Instruction;
  12394. BEGIN
  12395. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12396. RETURN instruction
  12397. END Cas;
  12398. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12399. VAR instruction: IntermediateCode.Instruction;
  12400. BEGIN
  12401. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12402. RETURN instruction
  12403. END Copy;
  12404. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12405. VAR instruction: IntermediateCode.Instruction;
  12406. BEGIN
  12407. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12408. RETURN instruction
  12409. END Fill;
  12410. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12411. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12412. BEGIN
  12413. string := IntermediateCode.String(s);
  12414. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12415. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12416. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12417. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12418. RETURN instruction
  12419. END Asm;
  12420. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12421. VAR instruction: IntermediateCode.Instruction;
  12422. BEGIN
  12423. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12424. RETURN instruction
  12425. END Data;
  12426. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12427. VAR instruction: IntermediateCode.Instruction;
  12428. BEGIN
  12429. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12430. IntermediateCode.SetSubType(instruction, subtype);
  12431. RETURN instruction
  12432. END SpecialInstruction;
  12433. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12434. VAR op1: IntermediateCode.Operand;
  12435. VAR instruction: IntermediateCode.Instruction;
  12436. BEGIN
  12437. (*! generate a warning if size exceeds a certain limit *)
  12438. (*
  12439. ASSERT(bytes < 1000000); (* sanity check *)
  12440. *)
  12441. ASSERT(0 <= units); (* sanity check *)
  12442. IntermediateCode.InitNumber(op1,units);
  12443. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12444. RETURN instruction
  12445. END Reserve;
  12446. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12447. VAR op1: IntermediateCode.Operand;
  12448. VAR instruction: IntermediateCode.Instruction;
  12449. BEGIN
  12450. IntermediateCode.InitNumber(op1,position);
  12451. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12452. RETURN instruction
  12453. END LabelInstruction;
  12454. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12455. VAR pc: LONGINT;
  12456. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12457. BEGIN
  12458. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12459. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12460. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12461. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12462. IF instr.op1.type.form = IntermediateCode.Float THEN
  12463. RETURN instr.op1.floatValue = op.floatValue
  12464. ELSE
  12465. RETURN instr.op1.intValue = op.intValue
  12466. END;
  12467. END ProvidesValue;
  12468. BEGIN
  12469. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12470. pc := 0;
  12471. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12472. INC(pc);
  12473. END;
  12474. IF pc = data.pc THEN
  12475. data.Emit(Data(-1,vop));
  12476. END;
  12477. RETURN pc
  12478. END EnterImmediate;
  12479. PROCEDURE Init;
  12480. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12481. BEGIN
  12482. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12483. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12484. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12485. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12486. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12487. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12488. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12489. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12490. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12491. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12492. IntermediateCode.InitOperand(emptyOperand);
  12493. FOR i := 0 TO NumberSystemCalls-1 DO
  12494. name := "@SystemCall";
  12495. Basic.AppendNumber(name,i);
  12496. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12497. END;
  12498. END Init;
  12499. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12500. BEGIN
  12501. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12502. END IsExported;
  12503. BEGIN
  12504. Init;
  12505. END FoxIntermediateBackend.
  12506. Compiler.Compile FoxIntermediateBackend.Mod ~