FoxIntermediateBackend.Mod 530 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608
  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. PROCEDURE CreatePorts(type: SyntaxTree.Type; len: LONGINT);
  224. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  225. BEGIN
  226. FOR i := 0 TO len-1 DO
  227. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  228. CreatePorts(baseType, len*len2);
  229. ELSIF IsSemiDynamicArray(type) THEN
  230. port := MIN(LONGINT); (* unknown port address from here on *)
  231. ELSE
  232. IntermediateCode.InitImmediate(op,addressType,adr);
  233. symbol.Emit(Data(-1,op));
  234. INC(port);
  235. END;
  236. END;
  237. END CreatePorts;
  238. BEGIN
  239. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  240. (*
  241. IF (x.cellScope.ownerModule = module.module) THEN
  242. td := x.typeDeclaration;
  243. Global.GetSymbolSegmentedName(td,name);
  244. (* code section for object *)
  245. END;
  246. *)
  247. (* unnecessary to generate space for ports: already represented as hidden variables *)
  248. (*
  249. port := 0;
  250. parameter := x.firstParameter;
  251. WHILE parameter # NIL DO
  252. type := parameter.type.resolved;
  253. Global.GetSymbolSegmentedName(parameter,name);
  254. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection,name,parameter,dump);
  255. IF port >= 0 THEN
  256. (*! could be used for optimization: query value here ???
  257. parameter.SetResolved(SyntaxTree.NewIntegerValue(-1, port));
  258. *)
  259. END;
  260. CreatePorts(type, 1);
  261. IF backend.cellsAreObjects THEN
  262. IF IsStaticArray(parameter.type.resolved) THEN
  263. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  264. END;
  265. END;
  266. parameter := parameter.nextParameter;
  267. END;
  268. *)
  269. capabilities := {};
  270. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  271. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  272. backend.SetCapabilities(capabilities);
  273. Scope(x.cellScope);
  274. END VisitCellType;
  275. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  276. BEGIN (* no code emission *) END VisitProcedureType;
  277. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  278. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  279. END VisitEnumerationType;
  280. (* symbols *)
  281. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  282. BEGIN
  283. Procedure(x);
  284. END VisitProcedure;
  285. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  286. BEGIN
  287. Procedure(x);
  288. END VisitOperator;
  289. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  290. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align: LONGINT;
  291. BEGIN
  292. IF x.externalName # NIL THEN RETURN END;
  293. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  294. (* code section for variable *)
  295. Global.GetSymbolSegmentedName(x,name);
  296. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  297. irv.SetExported(IsExported(x));
  298. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  299. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))));
  300. IF ~x.fixed THEN
  301. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  302. ELSE
  303. align := x.alignment;
  304. END;
  305. irv.SetPositionOrAlignment(x.fixed, align);
  306. meta.CheckTypeDeclaration(x.type);
  307. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  308. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  309. END;
  310. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  311. END VisitVariable;
  312. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  313. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; op: Operand;
  314. BEGIN
  315. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  316. (* code section for variable *)
  317. Global.GetSymbolSegmentedName(x,name);
  318. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  319. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  320. (*
  321. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  322. *)
  323. IF x.defaultValue = NIL THEN
  324. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  325. ELSE
  326. implementationVisitor.inData := TRUE;
  327. implementationVisitor.Evaluate(x.defaultValue, op);
  328. irv.Emit(Data(x.position,op.op));
  329. implementationVisitor.inData := FALSE;
  330. END;
  331. meta.CheckTypeDeclaration(x.type);
  332. END VisitParameter;
  333. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  334. BEGIN
  335. Type(x.declaredType); (* => code in objects *)
  336. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  337. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  338. END;
  339. END VisitTypeDeclaration;
  340. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  341. BEGIN
  342. IF (SyntaxTree.Public * x.access # {}) THEN
  343. implementationVisitor.VisitConstant(x);
  344. END;
  345. END VisitConstant;
  346. PROCEDURE Scope(x: SyntaxTree.Scope);
  347. VAR procedure: SyntaxTree.Procedure;
  348. constant: SyntaxTree.Constant;
  349. variable: SyntaxTree.Variable;
  350. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  351. BEGIN
  352. prevScope := currentScope;
  353. currentScope := x;
  354. (* constants treated in implementation visitor *)
  355. typeDeclaration := x.firstTypeDeclaration;
  356. WHILE typeDeclaration # NIL DO
  357. VisitTypeDeclaration(typeDeclaration);
  358. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  359. END;
  360. variable := x.firstVariable;
  361. WHILE variable # NIL DO
  362. VisitVariable(variable);
  363. variable := variable.nextVariable;
  364. END;
  365. procedure := x.firstProcedure;
  366. WHILE procedure # NIL DO
  367. VisitProcedure(procedure);
  368. procedure := procedure.nextProcedure;
  369. END;
  370. constant := x.firstConstant;
  371. WHILE constant # NIL DO
  372. VisitConstant(constant);
  373. constant := constant.nextConstant;
  374. END;
  375. currentScope := prevScope;
  376. END Scope;
  377. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  378. VAR parameter: SyntaxTree.Parameter;
  379. BEGIN
  380. parameter := first;
  381. WHILE parameter # NIL DO
  382. VisitParameter(parameter);
  383. parameter := parameter.nextParameter;
  384. END;
  385. END Parameters;
  386. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  387. VAR scope: SyntaxTree.ProcedureScope;
  388. prevScope: SyntaxTree.Scope;
  389. inline, finalizer: BOOLEAN;
  390. procedureType: SyntaxTree.ProcedureType;
  391. pc: LONGINT;
  392. stackSize: LONGINT;
  393. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  394. null,size,src,dest,fp,res: IntermediateCode.Operand;
  395. cc: LONGINT;
  396. cellType: SyntaxTree.CellType;
  397. registerNumber: LONGINT;
  398. registerClass: IntermediateCode.RegisterClass;
  399. type: IntermediateCode.Type;
  400. formalParameter: SyntaxTree.Parameter;
  401. recordType: SyntaxTree.RecordType;
  402. isModuleBody: BOOLEAN;
  403. PROCEDURE Signature;
  404. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  405. BEGIN
  406. procedureType := x.type(SyntaxTree.ProcedureType);
  407. returnType := procedureType.returnType;
  408. IF returnType # NIL THEN
  409. meta.CheckTypeDeclaration(returnType)
  410. END;
  411. parameter := procedureType.firstParameter;
  412. WHILE parameter # NIL DO
  413. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  414. parameter := parameter.nextParameter;
  415. END;
  416. END Signature;
  417. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  418. VAR result: BOOLEAN;
  419. BEGIN
  420. result := FALSE;
  421. IF x = SyntaxTree.invalidExpression THEN
  422. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  423. result := TRUE;
  424. value := x.resolved(SyntaxTree.IntegerValue).value;
  425. ELSE
  426. Error(x.position,"expression is not an integer constant");
  427. END;
  428. RETURN result;
  429. END CheckIntegerValue;
  430. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  431. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  432. BEGIN
  433. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  434. WHILE (this # NIL) & (this.identifier # id) DO
  435. this := this.nextModifier;
  436. END;
  437. IF this # NIL THEN
  438. IF this.expression = NIL THEN
  439. Error(this.position,"expected expression value");
  440. ELSIF CheckIntegerValue(this.expression,value) THEN
  441. END;
  442. RETURN TRUE
  443. ELSE RETURN FALSE
  444. END;
  445. END HasValue;
  446. CONST DefaultDataMemorySize=512;
  447. BEGIN
  448. IF x.externalName # NIL THEN RETURN END;
  449. (*
  450. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  451. *)
  452. (* code section for this procedure *)
  453. scope := x.procedureScope;
  454. prevScope := currentScope;
  455. currentScope := scope;
  456. procedureType := x.type(SyntaxTree.ProcedureType);
  457. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  458. implementationVisitor.temporaries.Init;
  459. implementationVisitor.usedRegisters := NIL;
  460. implementationVisitor.registerUsageCount.Init;
  461. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  462. IF (scope.body # NIL) & (x.isInline) THEN
  463. inline := TRUE;
  464. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  465. ir.SetExported(IsExported(x));
  466. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  467. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  468. IF backend.cellsAreObjects THEN
  469. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  470. ir.SetExported(IsExported(x));
  471. ELSE
  472. RETURN; (* cellnet cannot be compiled for final static hardware *)
  473. END;
  474. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  475. inline := FALSE;
  476. AddBodyCallStub(x);
  477. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  478. ir.SetExported(IsExported(x));
  479. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  480. inline := FALSE;
  481. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  482. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  483. AddBodyCallStub(x);
  484. AddStackAllocation(x,stackSize);
  485. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  486. ir.SetExported(IsExported(x));
  487. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  488. inline := FALSE;
  489. Parameters(procedureType.firstParameter);
  490. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  491. ir.SetExported(IsExported(x));
  492. ELSE
  493. inline := FALSE;
  494. IF x.isEntry OR x.isExit THEN
  495. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  496. ir.SetExported(TRUE);
  497. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  498. ELSE
  499. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  500. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  501. END;
  502. END;
  503. cc := procedureType.callingConvention;
  504. IF scope.body # NIL THEN
  505. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  506. registerNumber := 0;
  507. IF ~inline THEN
  508. IF scope.lastVariable = NIL THEN
  509. stackSize := 0
  510. ELSE
  511. stackSize := scope.lastVariable.offsetInBits;
  512. IF stackSize <0 THEN stackSize := -stackSize END;
  513. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  514. END;
  515. (*
  516. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  517. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  518. *)
  519. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  520. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  521. END;
  522. pc := ir.pc-1;
  523. (*
  524. ir.Emit(Nop(position)); (* placeholder for fill *)
  525. *)
  526. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  527. formalParameter := procedureType.lastParameter;
  528. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  529. IF ~PassInRegister(formalParameter) THEN
  530. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  531. ELSE
  532. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  533. type := GetType(system, formalParameter.type);
  534. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  535. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  536. ir.Emit(Mov(-1,dest, src));
  537. implementationVisitor.ReleaseIntermediateOperand(src);
  538. INC(registerNumber);
  539. formalParameter := formalParameter.prevParameter;
  540. END;
  541. END;
  542. END;
  543. ir.EnterValidPAF;
  544. END;
  545. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  546. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  547. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  548. IF scope.lastVariable # NIL THEN
  549. stackSize := scope.lastVariable.offsetInBits;
  550. IF stackSize <0 THEN stackSize := -stackSize END;
  551. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  552. END;
  553. END;
  554. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  555. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  556. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  557. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  558. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  559. ir.EmitAt(pc,Push(size));
  560. implementationVisitor.StaticCallOperand(result,procedure);
  561. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  562. END;
  563. *)
  564. END;
  565. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  566. IF stackSize > 0 THEN
  567. IF (stackSize MOD system.addressSize = 0) THEN
  568. null := IntermediateCode.Immediate(addressType,0);
  569. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  570. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  571. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  572. ELSE
  573. null := IntermediateCode.Immediate(int8,0);
  574. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  575. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  576. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  577. END;
  578. (*! should potentially be called by backend -- enter might initialize
  579. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  580. *)
  581. END;
  582. ir.ExitValidPAF;
  583. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  584. finalizer := FALSE;
  585. IF backend.cooperative & x.isFinalizer THEN
  586. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  587. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  588. GetRecordTypeName(recordType,name);
  589. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  590. END;
  591. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  592. IF backend.cooperative THEN
  593. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  594. IF implementationVisitor.profile & ~isModuleBody THEN
  595. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  596. END;
  597. END;
  598. implementationVisitor.EmitLeave(ir, x.position,cc);
  599. IF finalizer THEN
  600. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  601. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  602. ir.Emit(Br(x.position,dest));
  603. ELSE
  604. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  605. END;
  606. ELSE
  607. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  608. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  609. END;
  610. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  611. IF backend.cooperative THEN
  612. IF HasPointers (scope) THEN
  613. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  614. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  615. ir.Emit(Result(x.position, res));
  616. ir.Emit(Push(x.position, res));
  617. implementationVisitor.ResetVariables(scope);
  618. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  619. ir.Emit(Pop(x.position, res));
  620. ir.Emit(Return(x.position, res));
  621. ELSE
  622. implementationVisitor.ResetVariables(scope);
  623. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  624. END;
  625. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  626. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  627. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  628. ir.Emit(Result(x.position, res));
  629. ir.Emit(Push(x.position, res));
  630. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  631. ir.Emit(Pop(x.position, res));
  632. ir.Emit(Return(x.position, res));
  633. ELSE
  634. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  635. END;
  636. END;
  637. implementationVisitor.EmitLeave(ir,x.position,cc);
  638. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  639. ELSE
  640. ir.Emit(Nop(x.position));
  641. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  642. implementationVisitor.EmitLeave(ir,x.position,cc);
  643. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  644. END;
  645. END;
  646. END
  647. END;
  648. ELSE (* force body for procedures *)
  649. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  650. ir.EnterValidPAF;
  651. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  652. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  653. ir.ExitValidPAF;
  654. implementationVisitor.EmitLeave(ir,x.position,cc);
  655. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  656. END;
  657. Scope(scope);
  658. Signature;
  659. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  660. currentScope := prevScope;
  661. END Procedure;
  662. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  663. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  664. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  665. BEGIN
  666. ASSERT (bodyProcedure # NIL);
  667. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  668. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  669. procedure.SetScope(bodyProcedure.scope);
  670. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  671. procedure.SetAccess(SyntaxTree.Hidden);
  672. Global.GetSymbolSegmentedName (procedure,name);
  673. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  674. ir.SetExported(TRUE);
  675. ir.SetPriority(InitPriority);
  676. Global.GetSymbolSegmentedName (bodyProcedure,name);
  677. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  678. implementationVisitor.currentScope := module.module.moduleScope;
  679. implementationVisitor.section := ir;
  680. implementationVisitor.PushSelfPointer();
  681. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  682. ELSIF backend.preregisterStatic THEN
  683. implementationVisitor.currentScope := module.module.moduleScope;
  684. implementationVisitor.section := ir;
  685. implementationVisitor.PushSelfPointer();
  686. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  687. ELSE
  688. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  689. ir.Emit(Call(bodyProcedure.position,op, 0));
  690. END;
  691. END AddBodyCallStub;
  692. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  693. VAR name: Basic.SegmentedName;
  694. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  695. BEGIN
  696. Global.GetSymbolSegmentedName (symbol,name);
  697. Basic.RemoveSuffix(name);
  698. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  699. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  700. ir.SetExported(TRUE);
  701. ir.SetPriority(FirstPriority);
  702. IntermediateCode.InitImmediate(op,addressType,initStack);
  703. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  704. END AddStackAllocation;
  705. (** entry function to visit a complete module *)
  706. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  707. VAR
  708. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  709. hasDynamicOperatorDeclarations: BOOLEAN;
  710. operator: SyntaxTree.Operator;
  711. import: SyntaxTree.Import;
  712. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  713. BEGIN
  714. type := type.resolved;
  715. IF type IS SyntaxTree.RecordType THEN
  716. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  717. ELSIF (type IS SyntaxTree.ArrayType) THEN
  718. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  719. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  720. END;
  721. ELSIF type IS SyntaxTree.MathArrayType THEN
  722. WITH type: SyntaxTree.MathArrayType DO
  723. IF type.form = SyntaxTree.Open THEN
  724. RETURN TRUE
  725. ELSIF type.form = SyntaxTree.Static THEN
  726. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  727. END;
  728. END;
  729. END;
  730. RETURN FALSE
  731. END TypeNeedsInitialization;
  732. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  733. VAR variable: SyntaxTree.Variable;
  734. BEGIN
  735. variable := scope.firstVariable;
  736. WHILE variable # NIL DO
  737. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  738. IF variable.initializer # NIL THEN RETURN TRUE END;
  739. variable := variable.nextVariable;
  740. END;
  741. RETURN FALSE
  742. END ScopeNeedsInitialization;
  743. BEGIN
  744. ASSERT(x # NIL); ASSERT(module # NIL);
  745. SELF.module := module;
  746. (* add import names to the generated Sections.Module *)
  747. import := x.moduleScope.firstImport;
  748. WHILE import # NIL DO
  749. import.module.GetName(idstr);
  750. module.imports.AddName(idstr);
  751. import := import.nextImport
  752. END;
  753. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  754. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  755. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  756. moduleSelf.SetType(system.anyType);
  757. moduleSelf.SetScope(x.moduleScope);
  758. moduleSelf.SetUntraced(TRUE);
  759. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  760. ir.SetExported(TRUE);
  761. IntermediateCode.InitImmediate(op,addressType,0);
  762. ir.Emit(Data(-1,op));
  763. END;
  764. implementationVisitor.module := module;
  765. implementationVisitor.moduleScope := x.moduleScope;
  766. implementationVisitor.moduleSelf := moduleSelf;
  767. implementationVisitor.canBeLoaded := TRUE;
  768. meta.SetModule(module);
  769. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  770. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  771. END;
  772. IF backend.profile THEN
  773. EnsureBodyProcedure(x.moduleScope);
  774. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  775. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  776. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  777. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  778. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  779. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  780. Global.GetModuleName(module.module,idstr);
  781. implementationVisitor.ProfilerAddModule(idstr);
  782. implementationVisitor.numberProcedures := 0;
  783. END;
  784. implementationVisitor.profile := backend.profile;
  785. (* check if there is at least one dynamic operator locally defined *)
  786. hasDynamicOperatorDeclarations := FALSE;
  787. operator := x.moduleScope.firstOperator;
  788. WHILE operator # NIL DO
  789. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  790. operator := operator.nextOperator
  791. END;
  792. (* add operator initialization code section *)
  793. IF hasDynamicOperatorDeclarations THEN
  794. EnsureBodyProcedure(x.moduleScope);
  795. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  796. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  797. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  798. END;
  799. Scope(x.moduleScope);
  800. IF hasDynamicOperatorDeclarations THEN
  801. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  802. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  803. END;
  804. IF backend.profile THEN
  805. implementationVisitor.ProfilerPatchInit;
  806. END;
  807. END Module;
  808. END DeclarationVisitor;
  809. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  810. RegisterUsageCount*=OBJECT
  811. VAR used: UsedArray; count: LONGINT;
  812. PROCEDURE &Init;
  813. VAR i: LONGINT;
  814. BEGIN
  815. count := 0;
  816. IF used = NIL THEN NEW(used,64); END;
  817. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  818. END Init;
  819. PROCEDURE Grow;
  820. VAR new: UsedArray; size,i: LONGINT;
  821. BEGIN
  822. size := LEN(used)*2;
  823. NEW(new,size);
  824. FOR i := 0 TO LEN(used)-1 DO
  825. new[i].count := used[i].count;
  826. new[i].type := used[i].type;
  827. new[i].map := used[i].map
  828. END;
  829. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  830. used := new
  831. END Grow;
  832. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  833. BEGIN
  834. INC(count);
  835. IF count = LEN(used) THEN Grow END;
  836. used[count].type := type;
  837. used[count].class := class;
  838. used[count].map := count;
  839. RETURN count;
  840. END Next;
  841. PROCEDURE IncUse(register: LONGINT);
  842. BEGIN
  843. INC(used[register].count);
  844. (*
  845. IF (register = 1) & (count > 30) THEN
  846. D.TraceBack;
  847. END;
  848. *)
  849. END IncUse;
  850. PROCEDURE DecUse(register: LONGINT);
  851. BEGIN
  852. DEC(used[register].count);
  853. END DecUse;
  854. PROCEDURE Map(register: LONGINT): LONGINT;
  855. VAR map : LONGINT;
  856. BEGIN
  857. IF register > 0 THEN
  858. map := used[register].map;
  859. WHILE register # map DO register := map; map := used[register].map END;
  860. END;
  861. RETURN register
  862. END Map;
  863. PROCEDURE Use(register: LONGINT): LONGINT;
  864. BEGIN
  865. IF register< LEN(used) THEN
  866. RETURN used[register].count
  867. ELSE
  868. RETURN 0
  869. END
  870. END Use;
  871. END RegisterUsageCount;
  872. RegisterEntry = POINTER TO RECORD
  873. prev,next: RegisterEntry;
  874. register: LONGINT;
  875. registerClass: IntermediateCode.RegisterClass;
  876. type: IntermediateCode.Type;
  877. END;
  878. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  879. Variables = OBJECT (Basic.List)
  880. VAR
  881. inUse: VariableUse;
  882. registerIndex: LONGINT;
  883. PROCEDURE & Init;
  884. VAR i: LONGINT;
  885. BEGIN
  886. InitList(16);
  887. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  888. registerIndex := 1024;
  889. END Init;
  890. PROCEDURE GetUsage(VAR use: VariableUse);
  891. BEGIN
  892. use := inUse;
  893. END GetUsage;
  894. PROCEDURE SetUsage(CONST use: VariableUse);
  895. BEGIN
  896. inUse := use;
  897. END SetUsage;
  898. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  899. VAR any: ANY;
  900. BEGIN
  901. any := Get(i);;
  902. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  903. END GetVariable;
  904. PROCEDURE Occupy(pos: LONGINT);
  905. BEGIN
  906. INCL(inUse[pos DIV 32], pos MOD 32);
  907. END Occupy;
  908. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  909. BEGIN
  910. Occupy(Length());
  911. Add(v);
  912. END AddVariable;
  913. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  914. VAR var : SyntaxTree.Variable;
  915. BEGIN
  916. FOR pos := 0 TO Length()-1 DO
  917. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  918. var := GetVariable(pos);
  919. IF type.SameType(var.type) THEN
  920. Occupy(pos); RETURN var
  921. END;
  922. END;
  923. END;
  924. pos := Length();
  925. RETURN NIL
  926. END GetFreeVariable;
  927. END Variables;
  928. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  929. SymbolMapper = OBJECT
  930. VAR
  931. first: SymbolMap;
  932. PROCEDURE & Init;
  933. BEGIN
  934. first := NIL;
  935. END Init;
  936. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  937. VAR new: SymbolMap;
  938. BEGIN
  939. NEW(new); new.this := this; new.to := to; new.tag := tag;
  940. new.next := first; first := new;
  941. END Add;
  942. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  943. VAR s: SymbolMap;
  944. BEGIN
  945. s := first;
  946. WHILE (s # NIL) & (s.this # this) DO
  947. s := s.next
  948. END;
  949. RETURN s
  950. END Get;
  951. END SymbolMapper;
  952. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  953. VAR
  954. system: Global.System;
  955. section: IntermediateCode.Section;
  956. module: Sections.Module;
  957. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  958. awaitProcCounter, labelId, constId, caseId: LONGINT;
  959. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  960. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  961. checker: SemanticChecker.Checker;
  962. backend: IntermediateBackend;
  963. meta: MetaDataGenerator;
  964. position: LONGINT;
  965. moduleSelf: SyntaxTree.Variable;
  966. (* variables for hand over of variables / temporary state *)
  967. currentScope: SyntaxTree.Scope;
  968. constantDeclaration : SyntaxTree.Symbol;
  969. result: Operand; (* result of the most recent expression / statement *)
  970. destination: IntermediateCode.Operand;
  971. arrayDestinationTag: IntermediateCode.Operand;
  972. arrayDestinationDimension:LONGINT;
  973. currentLoop: Label; (* variable to hand over loop exit jump list *)
  974. conditional: BOOLEAN;
  975. trueLabel, falseLabel, exitLabel: Label;
  976. locked: BOOLEAN;
  977. (*
  978. usedRegisters: Registers;
  979. *)
  980. registerUsageCount: RegisterUsageCount;
  981. usedRegisters: RegisterEntry;
  982. (* useful operands and types *)
  983. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  984. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  985. commentPrintout: Printout.Printer;
  986. dump: Streams.Writer;
  987. tagsAvailable : BOOLEAN;
  988. supportedInstruction: SupportedInstructionProcedure;
  989. supportedImmediate: SupportedImmediateProcedure;
  990. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  991. emitLabels: BOOLEAN;
  992. runtimeModuleName : SyntaxTree.IdentifierString;
  993. newObjectFile: BOOLEAN;
  994. indexCounter: LONGINT;
  995. profile: BOOLEAN;
  996. profileId, profileInit: IntermediateCode.Section;
  997. profileInitPatchPosition: LONGINT;
  998. numberProcedures: LONGINT;
  999. procedureResultDesignator : SyntaxTree.Designator;
  1000. operatorInitializationCodeSection: IntermediateCode.Section;
  1001. fingerPrinter: FingerPrinter.FingerPrinter;
  1002. temporaries: Variables;
  1003. canBeLoaded : BOOLEAN;
  1004. currentIsInline: BOOLEAN;
  1005. currentMapper: SymbolMapper;
  1006. currentInlineExit: Label;
  1007. moduleBodySection: IntermediateCode.Section;
  1008. NeedDescriptor : BOOLEAN;
  1009. cooperativeSwitches: BOOLEAN;
  1010. lastSwitchPC: LONGINT;
  1011. isUnchecked: BOOLEAN;
  1012. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1013. newObjectFile: BOOLEAN);
  1014. BEGIN
  1015. SELF.system := system;
  1016. SELF.runtimeModuleName := runtime;
  1017. currentScope := NIL;
  1018. hiddenPointerType := NIL;
  1019. delegatePointerType := NIL;
  1020. awaitProcCounter := 0;
  1021. labelId := 0; constId := 0; labelId := 0;
  1022. SELF.checker := checker;
  1023. SELF.backend := backend;
  1024. position := Diagnostics.Invalid;
  1025. conditional := FALSE;
  1026. locked := FALSE;
  1027. InitOperand(result,ModeUndefined);
  1028. addressType := IntermediateCode.GetType(system,system.addressType);
  1029. setType := IntermediateCode.GetType(system,system.setType);
  1030. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1031. byteType := IntermediateCode.GetType(system, system.byteType);
  1032. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1033. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1034. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1035. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1036. nil := IntermediateCode.Immediate(addressType,0);
  1037. IntermediateCode.InitOperand(destination);
  1038. tagsAvailable := TRUE;
  1039. supportedInstruction := supportedInstructionProcedure;
  1040. supportedImmediate := supportedImmediateProcedure;
  1041. inData := FALSE;
  1042. SELF.emitLabels := emitLabels;
  1043. IntermediateCode.InitOperand(arrayDestinationTag);
  1044. bool := IntermediateCode.GetType(system,system.booleanType);
  1045. IntermediateCode.InitImmediate(false,bool,0);
  1046. IntermediateCode.InitImmediate(true,bool,1);
  1047. SELF.newObjectFile := newObjectFile;
  1048. indexCounter := 0;
  1049. NEW(registerUsageCount);
  1050. usedRegisters := NIL;
  1051. procedureResultDesignator := NIL;
  1052. NEW(fingerPrinter, system);
  1053. NEW(temporaries);
  1054. currentIsInline := FALSE;
  1055. NeedDescriptor := FALSE;
  1056. isUnchecked := backend.noRuntimeChecks;
  1057. END Init;
  1058. TYPE Context = RECORD
  1059. section: IntermediateCode.Section;
  1060. registerUsageCount: RegisterUsageCount;
  1061. usedRegisters: RegisterEntry;
  1062. END;
  1063. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1064. VAR context: Context;
  1065. BEGIN
  1066. context.section := section;
  1067. context.registerUsageCount := registerUsageCount;
  1068. context.usedRegisters := usedRegisters;
  1069. section := new;
  1070. NEW(registerUsageCount);
  1071. usedRegisters := NIL;
  1072. RETURN context;
  1073. END SwitchContext;
  1074. PROCEDURE ReturnToContext(context: Context);
  1075. BEGIN
  1076. section := context.section;
  1077. registerUsageCount := context.registerUsageCount;
  1078. usedRegisters := context.usedRegisters;
  1079. END ReturnToContext;
  1080. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1081. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1082. BEGIN
  1083. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1084. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1085. END;
  1086. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1087. section.SetExported(IsExported(syntaxTreeSymbol));
  1088. RETURN section
  1089. END NewSection;
  1090. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1091. VAR new: LONGINT;
  1092. BEGIN
  1093. new := registerUsageCount.Next(type,class);
  1094. UseRegister(new);
  1095. RETURN new
  1096. END AcquireRegister;
  1097. (** get the name for the code section that represens a certain symbol
  1098. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1099. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1100. VAR
  1101. operatorFingerPrint: SyntaxTree.FingerPrint;
  1102. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1103. BEGIN
  1104. Global.GetSymbolSegmentedName(symbol, name);
  1105. (* if the symbol is an operator, then append the fingerprint to the name *)
  1106. IF symbol IS SyntaxTree.Operator THEN
  1107. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1108. string := "[";
  1109. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1110. Strings.Append(string, operatorFingerPrintString);
  1111. Strings.Append(string, "]");
  1112. Basic.AppendToSegmentedName(name,string);
  1113. END
  1114. END GetCodeSectionNameForSymbol;
  1115. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1116. BEGIN
  1117. IF dump # NIL THEN
  1118. dump.String("enter "); dump.String(s); dump.Ln;
  1119. END;
  1120. END TraceEnter;
  1121. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1122. BEGIN
  1123. IF dump # NIL THEN
  1124. dump.String("exit "); dump.String(s); dump.Ln;
  1125. END;
  1126. END TraceExit;
  1127. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1128. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1129. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1130. VAR i: LONGINT;
  1131. BEGIN
  1132. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1133. IF op.rule # NIL THEN
  1134. FOR i := 0 TO LEN(op.rule)-1 DO
  1135. CheckRegister(op.rule[i])
  1136. END;
  1137. END;
  1138. END CheckRegister;
  1139. BEGIN
  1140. CheckRegister(instruction.op1);
  1141. CheckRegister(instruction.op2);
  1142. CheckRegister(instruction.op3);
  1143. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1144. ELSE section.Emit(instruction);
  1145. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1146. END;
  1147. END Emit;
  1148. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1149. BEGIN
  1150. IF backend.cooperative THEN
  1151. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1152. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1153. ELSE
  1154. Emit(Trap(position,trapNo));
  1155. END;
  1156. END EmitTrap;
  1157. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1158. VAR name: Basic.SegmentedName;
  1159. VAR op1, op2, reg: IntermediateCode.Operand;
  1160. VAR call, nocall: Label;
  1161. VAR parametersSize: LONGINT;
  1162. VAR prevSection: IntermediateCode.Section;
  1163. VAR prevDump: Streams.Writer;
  1164. VAR body: SyntaxTree.Body;
  1165. BEGIN
  1166. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1167. prevSection := SELF.section;
  1168. SELF.section := section;
  1169. prevDump := dump;
  1170. dump := section.comments;
  1171. IF backend.hasLinkRegister THEN
  1172. Emit(Push(-1, lr));
  1173. END;
  1174. Emit(Push(-1,fp));
  1175. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1176. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1177. GetCodeSectionNameForSymbol(procedure, name);
  1178. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1179. ELSE
  1180. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1181. END;
  1182. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1183. Emit(Push(-1,op1));
  1184. Emit(Mov(-1,fp, sp));
  1185. body := procedure.procedureScope.body;
  1186. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1187. NEW(call, section);
  1188. NEW(nocall, section);
  1189. reg := NewRegisterOperand(addressType);
  1190. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1191. Emit(Sub(-1,reg, sp, op1));
  1192. BrltL(call, sp, reg);
  1193. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1194. BrgeL(nocall, sp, op2);
  1195. call.Resolve(section.pc);
  1196. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1197. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1198. Emit(Push(-1, op2));
  1199. Emit(Push(-1, reg));
  1200. ReleaseIntermediateOperand(reg);
  1201. CallThis(position, "Activities","ExpandStack",2);
  1202. Emit(Result(-1, sp));
  1203. nocall.Resolve(section.pc);
  1204. END;
  1205. ELSE
  1206. Emit(Mov(-1, fp, sp));
  1207. END;
  1208. Emit(Enter(-1, callconv, varSize));
  1209. SELF.section := prevSection;
  1210. dump := prevDump;
  1211. END EmitEnter;
  1212. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1213. VAR op1,op2: IntermediateCode.Operand;
  1214. VAR instruction: IntermediateCode.Instruction;
  1215. BEGIN
  1216. IntermediateCode.InitNumber(op1,callconv);
  1217. IntermediateCode.InitNumber(op2,varSize);
  1218. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1219. RETURN instruction
  1220. END Enter;
  1221. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1222. VAR op1: IntermediateCode.Operand;
  1223. VAR instruction: IntermediateCode.Instruction;
  1224. BEGIN
  1225. IntermediateCode.InitNumber(op1,callconv);
  1226. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1227. RETURN instruction
  1228. END Leave;
  1229. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1230. VAR prevSection: IntermediateCode.Section;
  1231. VAR op2: IntermediateCode.Operand;
  1232. BEGIN
  1233. prevSection := SELF.section;
  1234. SELF.section := section;
  1235. Emit(Leave(position, callconv));
  1236. IF backend.cooperative THEN
  1237. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1238. Emit(Add(position, sp, fp, op2));
  1239. ELSE
  1240. Emit(Mov(position, sp, fp));
  1241. END;
  1242. Emit(Pop(position, fp));
  1243. SELF.section := prevSection;
  1244. END EmitLeave;
  1245. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1246. VAR m: SymbolMap;
  1247. BEGIN
  1248. position := x.position;
  1249. IF currentIsInline THEN
  1250. m := currentMapper.Get(x);
  1251. IF m # NIL THEN
  1252. (*
  1253. Printout.Info("mapping from", x);
  1254. Printout.Info("mapping to ", m.to);
  1255. *)
  1256. m.to.Accept(SELF);
  1257. op := result;
  1258. IF m.tag # NIL THEN
  1259. ReleaseIntermediateOperand(result.tag);
  1260. m.tag.Accept(SELF);
  1261. op.tag := result.op;
  1262. ReleaseIntermediateOperand(result.tag);
  1263. END;
  1264. RETURN
  1265. END;
  1266. END;
  1267. x.Accept(SELF);
  1268. op := result;
  1269. END Symbol;
  1270. PROCEDURE Expression(x: SyntaxTree.Expression);
  1271. BEGIN
  1272. position := x.position;
  1273. constantDeclaration := NIL;
  1274. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1275. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1276. END;
  1277. IF x.resolved # NIL THEN
  1278. x.resolved.Accept(SELF)
  1279. ELSE
  1280. x.Accept(SELF)
  1281. END;
  1282. (* check this, was commented out in ActiveCells3 *)
  1283. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1284. Error(x.position, "unsupported modifier");
  1285. END;
  1286. END Expression;
  1287. (*
  1288. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1289. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1290. BEGIN
  1291. temporaries.GetUsage(current);
  1292. FOR i := 0 TO LEN(current)-1 DO
  1293. set := current[i] - previous[i];
  1294. IF set # {} THEN
  1295. FOR j := 0 TO MAX(SET)-1 DO
  1296. IF j IN set THEN
  1297. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1298. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1299. Symbol(variable, op);
  1300. MakeMemory(tmp,op.op,addressType,0);
  1301. ReleaseOperand(op);
  1302. Emit(Mov(position,tmp, nil ) );
  1303. ReleaseIntermediateOperand(tmp);
  1304. END;
  1305. END;
  1306. END;
  1307. END;
  1308. END;
  1309. END ResetUsedTemporaries;
  1310. *)
  1311. PROCEDURE Statement(x: SyntaxTree.Statement);
  1312. VAR use: VariableUse;
  1313. BEGIN
  1314. temporaries.GetUsage(use);
  1315. position := x.position;
  1316. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1317. IF commentPrintout # NIL THEN
  1318. commentPrintout.Statement(x);
  1319. dump.Ln;
  1320. (*dump.Update;*)
  1321. END;
  1322. x.Accept(SELF);
  1323. (*
  1324. CheckRegistersFree();
  1325. *)
  1326. (*ResetUsedTemporaries(use);*)
  1327. temporaries.SetUsage(use);
  1328. END Statement;
  1329. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1330. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1331. *)
  1332. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1333. BEGIN
  1334. IF op.mode = IntermediateCode.ModeMemory THEN
  1335. ReuseCopy(res,op);
  1336. ELSE
  1337. res := op;
  1338. UseIntermediateOperand(res);
  1339. END;
  1340. IntermediateCode.AddOffset(res,offset);
  1341. IntermediateCode.MakeMemory(res,type);
  1342. END MakeMemory;
  1343. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1344. VAR mem: IntermediateCode.Operand;
  1345. BEGIN
  1346. MakeMemory(mem,res,type,offset);
  1347. ReleaseIntermediateOperand(res);
  1348. res := mem;
  1349. END ToMemory;
  1350. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1351. VAR mem: IntermediateCode.Operand;
  1352. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1353. componentType: SyntaxTree.Type;
  1354. BEGIN
  1355. type := type.resolved;
  1356. IF operand.mode = ModeReference THEN
  1357. IF type IS SyntaxTree.RangeType THEN
  1358. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1359. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1360. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1361. ReleaseOperand(operand);
  1362. operand.op := firstOp;
  1363. operand.tag := lastOp;
  1364. operand.extra := stepOp;
  1365. ELSIF type IS SyntaxTree.ComplexType THEN
  1366. componentType := type(SyntaxTree.ComplexType).componentType;
  1367. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1368. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1369. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1370. ReleaseOperand(operand);
  1371. operand.op := firstOp;
  1372. operand.tag := lastOp
  1373. ELSE
  1374. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1375. ReleaseIntermediateOperand(operand.op);
  1376. operand.op := mem;
  1377. END;
  1378. operand.mode := ModeValue;
  1379. END;
  1380. ASSERT(operand.mode = ModeValue);
  1381. END LoadValue;
  1382. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1383. VAR prevConditional: BOOLEAN;
  1384. BEGIN
  1385. prevConditional := conditional;
  1386. conditional := FALSE;
  1387. InitOperand(result, ModeUndefined);
  1388. Expression(x);
  1389. op := result;
  1390. LoadValue(op,x.type.resolved);
  1391. conditional := prevConditional;
  1392. END Evaluate;
  1393. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1394. VAR prevConditional: BOOLEAN;
  1395. BEGIN
  1396. prevConditional := conditional;
  1397. conditional := FALSE;
  1398. InitOperand(result,ModeUndefined);
  1399. Expression(x);
  1400. op := result;
  1401. (*
  1402. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1403. *)
  1404. conditional := prevConditional;
  1405. END Designate;
  1406. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1407. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1408. BEGIN
  1409. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1410. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1411. conditional := TRUE;
  1412. trueLabel := trueL; falseLabel := falseL;
  1413. Expression(x);
  1414. trueL := trueLabel; falseL := falseLabel;
  1415. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1416. END Condition;
  1417. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1418. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1419. BEGIN
  1420. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1421. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1422. RETURN op
  1423. END NewRegisterOperand;
  1424. PROCEDURE UnuseRegister(register: LONGINT);
  1425. BEGIN
  1426. IF (register > 0) THEN
  1427. register := registerUsageCount.Map(register);
  1428. registerUsageCount.DecUse(register);
  1429. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1430. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1431. END;
  1432. IF registerUsageCount.Use(register)=0 THEN
  1433. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1434. Warning(position, "register cannot be removed");
  1435. END;
  1436. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1437. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1438. END;
  1439. ELSIF registerUsageCount.Use(register)<0 THEN
  1440. Warning(position, "register removed too often");
  1441. IF dump # NIL THEN
  1442. dump.String("register removed too often"); dump.Ln; dump.Update;
  1443. END;
  1444. D.TraceBack;
  1445. END;
  1446. END;
  1447. END UnuseRegister;
  1448. PROCEDURE UseRegister(register: LONGINT);
  1449. BEGIN
  1450. IF (register > 0) THEN
  1451. register := registerUsageCount.Map(register);
  1452. registerUsageCount.IncUse(register);
  1453. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1454. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1455. END;
  1456. IF registerUsageCount.Use(register)=1 THEN
  1457. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1458. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1459. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1460. END;
  1461. END;
  1462. END;
  1463. END UseRegister;
  1464. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1465. BEGIN
  1466. UnuseRegister(op.register)
  1467. END ReleaseIntermediateOperand;
  1468. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1469. BEGIN
  1470. UseRegister(op.register)
  1471. END UseIntermediateOperand;
  1472. PROCEDURE ReleaseOperand(CONST op: Operand);
  1473. BEGIN
  1474. UnuseRegister(op.op.register);
  1475. UnuseRegister(op.tag.register);
  1476. UnuseRegister(op.extra.register);
  1477. END ReleaseOperand;
  1478. (* save registers marked in array "markedRegisters" to the stack
  1479. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1480. *)
  1481. PROCEDURE SaveRegisters();
  1482. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1483. BEGIN
  1484. entry := usedRegisters;
  1485. WHILE entry # NIL DO
  1486. type := registerUsageCount.used[entry.register].type;
  1487. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1488. Emit(Push(position,op));
  1489. entry := entry.next;
  1490. END;
  1491. END SaveRegisters;
  1492. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1493. BEGIN
  1494. saved := usedRegisters;
  1495. usedRegisters := NIL;
  1496. END ReleaseUsedRegisters;
  1497. (** remove parameter registers from used queue *)
  1498. PROCEDURE ReleaseParameterRegisters;
  1499. VAR entry,prev,next: RegisterEntry;
  1500. BEGIN
  1501. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1502. WHILE entry # NIL DO
  1503. next := entry.next;
  1504. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1505. registerUsageCount.DecUse(entry.register);
  1506. ASSERT(registerUsageCount.Use(entry.register)=0);
  1507. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1508. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1509. END;
  1510. ELSIF prev = NIL THEN
  1511. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1512. ELSE
  1513. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1514. END;
  1515. entry := next;
  1516. END;
  1517. END ReleaseParameterRegisters;
  1518. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1519. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1520. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1521. BEGIN
  1522. entry := saved;
  1523. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1524. entry := prev;
  1525. WHILE entry # NIL DO
  1526. prev := entry.prev;
  1527. type := entry.type;
  1528. class := entry.registerClass;
  1529. IntermediateCode.InitRegister(op,type,class,entry.register);
  1530. (*
  1531. new := registerUsageCount.Next(type,class);
  1532. registerUsageCount.Remap(entry.register,new);
  1533. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1534. dump.String("remap register "); dump.Int(entry.register,1);
  1535. dump.String("to "); dump.Int(new,1);
  1536. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1537. END;
  1538. entry.register := new;
  1539. *)
  1540. Emit(Pop(position,op));
  1541. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1542. entry := prev;
  1543. END;
  1544. (*
  1545. usedRegisters := saved;
  1546. *)
  1547. END RestoreRegisters;
  1548. PROCEDURE CheckRegistersFree;
  1549. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1550. BEGIN
  1551. IF usedRegisters # NIL THEN
  1552. r := usedRegisters;
  1553. WHILE r # NIL DO
  1554. warning := "register ";
  1555. Strings.AppendInt(warning, r.register);
  1556. Strings.Append(warning, " not released.");
  1557. Warning(position,warning);
  1558. r := r .next;
  1559. END;
  1560. END;
  1561. FOR i := 0 TO registerUsageCount.count-1 DO
  1562. IF registerUsageCount.used[i].count < 0 THEN
  1563. warning := "register ";
  1564. Strings.AppendInt(warning, i);
  1565. Strings.Append(warning, " unused too often.");
  1566. Warning(position,warning);
  1567. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1568. warning := "register ";
  1569. Strings.AppendInt(warning, i);
  1570. Strings.Append(warning, " not unused often enough.");
  1571. Warning(position,warning);
  1572. END;
  1573. END;
  1574. END CheckRegistersFree;
  1575. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1576. Otherwise allocate a new register.
  1577. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1578. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1579. BEGIN
  1580. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1581. UseIntermediateOperand(result);
  1582. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1583. UseIntermediateOperand(result);
  1584. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1585. END;
  1586. END Reuse2;
  1587. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1588. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1589. If not then allocate a new register.
  1590. Does NOT necessarily keep the content of src1 or src2 in result!
  1591. *)
  1592. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1593. BEGIN
  1594. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1595. UseIntermediateOperand(result);
  1596. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1597. UseIntermediateOperand(result);
  1598. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1599. result := alternative; alternative := emptyOperand;
  1600. UseIntermediateOperand(result);
  1601. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1602. END;
  1603. END Reuse2a;
  1604. (* like reuse2 but only one source *)
  1605. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1606. BEGIN
  1607. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1608. UseIntermediateOperand(result);
  1609. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1610. END;
  1611. END Reuse1;
  1612. (* like reuse2a but only one source *)
  1613. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1614. BEGIN
  1615. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1616. UseIntermediateOperand(result);
  1617. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1618. UseIntermediateOperand(result);
  1619. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1620. END;
  1621. END Reuse1a;
  1622. (* like reuse1 but guarantees that content of src1 is in result *)
  1623. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1624. BEGIN
  1625. IF ReusableRegister(src1) THEN
  1626. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1627. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1628. UseIntermediateOperand(result);
  1629. ELSE
  1630. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1631. Emit(Mov(position,result,src1));
  1632. END
  1633. END ReuseCopy;
  1634. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1635. BEGIN
  1636. IF ReusableRegister(src) THEN
  1637. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1638. ELSE
  1639. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1640. Emit(Mov(position,result,src));
  1641. ReleaseIntermediateOperand(src);
  1642. END
  1643. END TransferToRegister;
  1644. (** labels and branches **)
  1645. PROCEDURE NewLabel(): Label;
  1646. VAR label: Label;
  1647. BEGIN
  1648. NEW(label,section); RETURN label;
  1649. END NewLabel;
  1650. PROCEDURE SetLabel(label: Label);
  1651. BEGIN label.Resolve(section.pc);
  1652. END SetLabel;
  1653. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1654. BEGIN
  1655. ASSERT(label # NIL);
  1656. IF label.pc < 0 THEN (* label not yet set *)
  1657. label.AddFixup(section.pc);
  1658. END;
  1659. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1660. END LabelOperand;
  1661. PROCEDURE BrL(label: Label);
  1662. BEGIN
  1663. Emit(Br(position,LabelOperand(label)));
  1664. END BrL;
  1665. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1666. BEGIN
  1667. Emit(Brge(position,LabelOperand(label),left,right));
  1668. END BrgeL;
  1669. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1670. BEGIN
  1671. Emit(Brlt(position,LabelOperand(label),left,right));
  1672. END BrltL;
  1673. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1674. BEGIN
  1675. Emit(Breq(position,LabelOperand(label),left,right));
  1676. END BreqL;
  1677. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1678. BEGIN
  1679. Emit(Brne(position,LabelOperand(label),left,right));
  1680. END BrneL;
  1681. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1682. VAR new: IntermediateCode.Operand;
  1683. BEGIN
  1684. IF Trace THEN TraceEnter("Convert") END;
  1685. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1686. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1687. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1688. & (operand.offset = 0)
  1689. THEN
  1690. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1691. Emit(Conv(position,new,operand));
  1692. ELSE
  1693. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1694. Emit(Conv(position,new,operand));
  1695. ReleaseIntermediateOperand(operand);
  1696. END;
  1697. operand := new;
  1698. 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
  1699. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1700. ELSE
  1701. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1702. Emit(Conv(position,new,operand));
  1703. ReleaseIntermediateOperand(operand);
  1704. operand := new;
  1705. END;
  1706. IF Trace THEN TraceExit("Convert") END;
  1707. END Convert;
  1708. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1709. VAR exit: Label;
  1710. BEGIN
  1711. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1712. exit := NewLabel();
  1713. br(exit,left,right);
  1714. EmitTrap(position,trapNo);
  1715. SetLabel(exit);
  1716. END TrapC;
  1717. (** expressions *)
  1718. (** emit necessary runtime check for set elements **)
  1719. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1720. VAR max: IntermediateCode.Operand;
  1721. BEGIN
  1722. IF isUnchecked THEN RETURN END;
  1723. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1724. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1725. TrapC(BrgeL, max, o, SetElementTrap);
  1726. END;
  1727. END CheckSetElement;
  1728. (** the set that a range represents **)
  1729. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1730. VAR
  1731. operand: Operand;
  1732. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1733. BEGIN
  1734. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1735. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1736. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1737. one := IntermediateCode.Immediate(setType, 1);
  1738. Evaluate(x, operand);
  1739. Convert(operand.op, setType);
  1740. Convert(operand.tag, setType);
  1741. CheckSetElement(operand.op);
  1742. CheckSetElement(operand.tag);
  1743. (* create mask for lower bound
  1744. i.e. shift 11111111 to the left by the value of the lower bound
  1745. *)
  1746. Reuse1(temp, operand.op);
  1747. Emit(Shl(position,temp, allBits, operand.op));
  1748. ReleaseIntermediateOperand(operand.op);
  1749. operand.op := temp;
  1750. (* create mask for upper bound
  1751. i.e. shift 11111111 to the right by the difference between the
  1752. upper bound and the maximum number of set elements
  1753. *)
  1754. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1755. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1756. Reuse1(temp, operand.tag);
  1757. ELSE
  1758. Reuse1(temp, operand.tag);
  1759. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1760. Emit(Sub(position,temp, size, operand.tag));
  1761. END;
  1762. Emit(Shr(position,temp, allBits, operand.tag));
  1763. ReleaseIntermediateOperand(operand.tag);
  1764. operand.tag := temp;
  1765. Reuse2(resultingSet, operand.op, operand.tag);
  1766. (* intersect the two masks *)
  1767. Emit(And(position,resultingSet, operand.op, operand.tag));
  1768. ReleaseOperand(operand);
  1769. RETURN resultingSet
  1770. END SetFromRange;
  1771. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1772. VAR
  1773. res, operand: Operand;
  1774. temp, one, noBits, dest: IntermediateCode.Operand;
  1775. expression: SyntaxTree.Expression;
  1776. i: LONGINT;
  1777. BEGIN
  1778. IF Trace THEN TraceEnter("VisitSet") END;
  1779. dest := destination;
  1780. destination := emptyOperand;
  1781. noBits := IntermediateCode.Immediate(setType, 0);
  1782. one := IntermediateCode.Immediate(setType, 1);
  1783. (* start off with the empty set *)
  1784. InitOperand(res, ModeValue);
  1785. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1786. Emit(Mov(position,res.op, noBits));
  1787. FOR i := 0 TO x.elements.Length() - 1 DO
  1788. expression := x.elements.GetExpression(i);
  1789. IF expression IS SyntaxTree.RangeExpression THEN
  1790. (* range of set elements *)
  1791. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1792. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1793. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1794. ReleaseIntermediateOperand(temp)
  1795. ELSE
  1796. (* singelton element *)
  1797. Evaluate(expression, operand);
  1798. Convert(operand.op, setType);
  1799. CheckSetElement(operand.op);
  1800. (* create subset containing single element *)
  1801. Reuse1(temp, operand.op);
  1802. Emit(Shl(position,temp, one, operand.op));
  1803. ReleaseOperand(operand);
  1804. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1805. ReleaseIntermediateOperand(temp);
  1806. END
  1807. END;
  1808. result := res;
  1809. destination := dest;
  1810. IF Trace THEN TraceExit("VisitSet") END;
  1811. END VisitSet;
  1812. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1813. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1814. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1815. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1816. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1817. element: SyntaxTree.IntegerValue;
  1818. BEGIN
  1819. numberElements := x.elements.Length();
  1820. expression := index.parameters.GetExpression(dim);
  1821. element := expression(SyntaxTree.IntegerValue);
  1822. FOR i := 0 TO numberElements-1 DO
  1823. expression := x.elements.GetExpression(i);
  1824. element.SetValue(i);
  1825. IF expression IS SyntaxTree.MathArrayExpression THEN
  1826. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1827. ELSE
  1828. Assign(index,expression);
  1829. END;
  1830. END;
  1831. END RecursiveAssignment;
  1832. BEGIN
  1833. variable := GetTemporaryVariable(x.type, FALSE);
  1834. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1835. designator.SetType(variable.type);
  1836. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1837. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1838. FOR i := 0 TO dim-1 DO
  1839. element := SyntaxTree.NewIntegerValue(x.position,0);
  1840. element.SetType(system.longintType);
  1841. index.parameters.AddExpression(element);
  1842. END;
  1843. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1844. RecursiveAssignment(x,0);
  1845. Expression(designator);
  1846. END VisitMathArrayExpression;
  1847. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1848. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1849. BEGIN
  1850. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1851. dest := destination; destination := emptyOperand;
  1852. IF x.operator = Scanner.Not THEN
  1853. IF conditional THEN
  1854. Condition(x.left,falseLabel,trueLabel)
  1855. ELSE
  1856. Evaluate(x.left,operand);
  1857. InitOperand(result,ModeValue);
  1858. Reuse1a(result.op,operand.op,dest);
  1859. Emit(Xor(position,result.op,operand.op,true));
  1860. ReleaseOperand(operand);
  1861. END;
  1862. ELSIF x.operator = Scanner.Minus THEN
  1863. Evaluate(x.left,operand);
  1864. InitOperand(result,ModeValue);
  1865. Reuse1a(result.op,operand.op,dest);
  1866. type := x.left.type.resolved;
  1867. IF type IS SyntaxTree.SetType THEN
  1868. Emit(Not(position,result.op,operand.op));
  1869. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1870. Reuse1(result.tag,operand.tag);
  1871. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1872. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1873. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  1874. Emit(Neg(position,result.op,operand.op));
  1875. ELSE HALT(200)
  1876. END;
  1877. ReleaseOperand(operand);
  1878. ELSIF x.operator = Scanner.Address THEN
  1879. Designate(x.left,operand);
  1880. operand.mode := ModeValue;
  1881. t0 := x.left.type.resolved;
  1882. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  1883. ReleaseIntermediateOperand(operand.op);
  1884. operand.op := operand.tag;
  1885. IntermediateCode.InitOperand(operand.tag);
  1886. END;
  1887. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  1888. result := operand;
  1889. ELSE HALT(100)
  1890. END;
  1891. destination := dest;
  1892. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  1893. END VisitUnaryExpression;
  1894. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  1895. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  1896. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  1897. BEGIN
  1898. type := type.resolved;
  1899. originalType := type;
  1900. IF type IS SyntaxTree.PointerType THEN
  1901. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  1902. END;
  1903. IF type IS SyntaxTree.ObjectType THEN
  1904. BrL(trueL);
  1905. ELSE
  1906. ASSERT(type IS SyntaxTree.RecordType);
  1907. (*
  1908. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  1909. *)
  1910. ReuseCopy(left,tag);
  1911. right := TypeDescriptorAdr(type);
  1912. IF ~newObjectFile THEN
  1913. IntermediateCode.MakeMemory(right,addressType);
  1914. END;
  1915. IF backend.cooperative THEN
  1916. repeatL := NewLabel();
  1917. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  1918. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  1919. END;
  1920. SetLabel(repeatL);
  1921. BreqL(trueL,left,right);
  1922. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  1923. BrneL(repeatL,left,nil);
  1924. ELSIF meta.simple THEN
  1925. level := type(SyntaxTree.RecordType).Level();
  1926. (* get type desc tag of level relative to base tag *)
  1927. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  1928. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1929. IntermediateCode.MakeMemory(left,addressType);
  1930. BreqL(trueL,left,right);
  1931. ELSE
  1932. level := type(SyntaxTree.RecordType).Level();
  1933. (* get type desc tag of level relative to base tag *)
  1934. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  1935. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1936. IntermediateCode.MakeMemory(left,addressType);
  1937. BreqL(trueL,left,right);
  1938. END;
  1939. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  1940. BrL(falseL);
  1941. END;
  1942. END TypeTest;
  1943. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  1944. BEGIN
  1945. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  1946. IF dump # NIL THEN
  1947. dump.String(s); dump.Ln;
  1948. END;
  1949. END Error;
  1950. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  1951. BEGIN
  1952. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  1953. IF dump # NIL THEN
  1954. dump.String(s); dump.Ln; dump.Update;
  1955. END;
  1956. END Warning;
  1957. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  1958. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  1959. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  1960. operand:Operand;
  1961. BEGIN
  1962. previousSection := section;
  1963. Global.GetModuleName(mod,name);
  1964. Strings.Append(name,".@Trace");
  1965. Basic.ToSegmentedName(name, pooledName);
  1966. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  1967. IF dump # NIL THEN dump := section.comments END;
  1968. variable := mod.moduleScope.firstVariable;
  1969. WHILE variable # NIL DO
  1970. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  1971. Symbol(variable, operand);
  1972. register := operand.op;
  1973. CallTraceMethod(register, variable.type);
  1974. ReleaseIntermediateOperand(register);
  1975. END;
  1976. variable := variable.nextVariable;
  1977. END;
  1978. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  1979. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  1980. Emit(Br(position,op));
  1981. INC(statCoopTraceModule, section.pc);
  1982. section := previousSection;
  1983. IF dump # NIL THEN dump := section.comments END;
  1984. END CreateTraceModuleMethod;
  1985. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  1986. BEGIN
  1987. Emit (Push(position, dst));
  1988. Emit (Push(position, src));
  1989. CallThis(position,"GarbageCollector","Assign", 2);
  1990. END CallAssignPointer;
  1991. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  1992. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  1993. BEGIN
  1994. IF SemanticChecker.IsPointerType (type) THEN
  1995. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  1996. ELSIF type.IsRecordType() THEN
  1997. Emit (Push(position,dst));
  1998. Emit (Push(position,src));
  1999. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2000. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2001. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2002. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2003. ELSIF IsStaticArray(type) THEN
  2004. size := StaticArrayNumElements(type);
  2005. base := StaticArrayBaseType(type);
  2006. IF base.IsRecordType() THEN
  2007. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2008. Emit (Push(position, dst));
  2009. Emit (Push(position, src));
  2010. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2011. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2012. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2013. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2014. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2015. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2016. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2017. Emit (Push(position, dst));
  2018. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2019. Emit (Push(position, src));
  2020. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2021. ELSE
  2022. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2023. Emit (Push(position, dst));
  2024. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2025. Emit (Push(position, src));
  2026. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2027. ASSERT(StaticArrayBaseType(type).IsPointer());
  2028. END;
  2029. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2030. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2031. Emit (Push(position, dst));
  2032. Emit (Push(position, src));
  2033. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2034. ELSE HALT(100); (* missing ? *)
  2035. END;
  2036. END CallAssignMethod;
  2037. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2038. VAR name: Basic.SegmentedName;
  2039. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2040. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2041. context: Context;
  2042. BEGIN
  2043. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2044. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2045. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2046. GetRecordTypeName (recordType,name);
  2047. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2048. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2049. IF dump # NIL THEN dump := section.comments END;
  2050. variable := recordType.recordScope.firstVariable;
  2051. WHILE variable # NIL DO
  2052. IF variable.NeedsTrace() THEN
  2053. dst := NewRegisterOperand (addressType);
  2054. src := NewRegisterOperand (addressType);
  2055. Emit (Mov(position, dst, parameter1));
  2056. Emit (Mov(position, src, parameter2));
  2057. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2058. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2059. CallAssignMethod(dst, src, variable.type);
  2060. ReleaseIntermediateOperand(src);
  2061. ReleaseIntermediateOperand(dst);
  2062. END;
  2063. variable := variable.nextVariable;
  2064. END;
  2065. recordBase := recordType.GetBaseRecord();
  2066. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2067. GetRecordTypeName (recordBase,name);
  2068. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2069. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2070. Emit(Br(position,op));
  2071. ELSE
  2072. Emit(Exit(position,0,0));
  2073. END;
  2074. IF ~recordType.isObject THEN
  2075. GetRecordTypeName (recordType,name);
  2076. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2077. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2078. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2079. NEW(registerUsageCount);
  2080. usedRegisters := NIL;
  2081. dst := NewRegisterOperand (addressType);
  2082. src := NewRegisterOperand (addressType);
  2083. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2084. Emit(Mov(position, dst, parameter1));
  2085. Emit(Mov(position, src, parameter2));
  2086. label := NewLabel();
  2087. SetLabel(label);
  2088. Emit(Push(position, dst));
  2089. Emit(Push(position, src));
  2090. GetRecordTypeName (recordType,name);
  2091. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2092. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2093. Emit(Call(position, op, 0));
  2094. Emit(Pop(position, src));
  2095. Emit(Pop(position, dst));
  2096. Emit(Add(position, dst, dst, ofs));
  2097. Emit(Add(position, src, src, ofs));
  2098. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2099. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2100. Emit(Exit(position,0,0));
  2101. END;
  2102. INC(statCoopAssignProcedure, section.pc);
  2103. ReturnToContext(context);
  2104. IF dump # NIL THEN dump := section.comments END;
  2105. END CreateAssignProcedure;
  2106. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2107. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2108. BEGIN
  2109. IF IsUnsafePointer (type) THEN
  2110. skip := NewLabel();
  2111. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2112. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2113. BreqL (skip, op, nil);
  2114. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2115. SetLabel (skip);
  2116. ELSIF SemanticChecker.IsPointerType (type) THEN
  2117. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2118. CallThis(position,"GarbageCollector","Mark", 1);
  2119. ELSIF type.IsRecordType() THEN
  2120. Emit (Push(position,register));
  2121. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2122. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2123. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2124. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2125. ELSIF IsStaticArray(type) THEN
  2126. size := StaticArrayNumElements(type);
  2127. base := StaticArrayBaseType(type);
  2128. IF base.IsRecordType() THEN
  2129. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2130. Emit (Push(position, register));
  2131. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2132. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2133. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2134. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2135. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2136. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2137. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2138. Emit (Push(position, register));
  2139. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2140. ELSE
  2141. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2142. Emit (Push(position, register));
  2143. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2144. ASSERT(base.IsPointer());
  2145. END;
  2146. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2147. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2148. CallThis(position,"GarbageCollector","Mark", 1);
  2149. ELSE HALT(100); (* missing ? *)
  2150. END;
  2151. END CallTraceMethod;
  2152. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2153. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2154. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2155. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2156. BEGIN
  2157. previousSection := section;
  2158. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2159. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2160. GetRecordTypeName (recordType,name);
  2161. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2162. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2163. IF dump # NIL THEN dump := section.comments END;
  2164. variable := recordType.recordScope.firstVariable;
  2165. WHILE variable # NIL DO
  2166. IF variable.NeedsTrace() THEN
  2167. register := NewRegisterOperand (addressType);
  2168. Emit (Mov(position,register,parameter1));
  2169. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2170. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2171. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2172. END;
  2173. CallTraceMethod(register, variable.type);
  2174. ReleaseIntermediateOperand(register);
  2175. END;
  2176. variable := variable.nextVariable;
  2177. END;
  2178. recordBase := recordType.GetBaseRecord();
  2179. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2180. recordBase := recordBase.GetBaseRecord();
  2181. END;
  2182. IF recordBase # NIL THEN
  2183. GetRecordTypeName (recordBase,name);
  2184. IF HasExplicitTraceMethod (recordBase) THEN
  2185. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2186. ELSE
  2187. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2188. END;
  2189. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2190. Emit(Br(position,op));
  2191. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2192. Emit(Exit(position,0,0));
  2193. ELSE
  2194. IF recordType.isObject THEN
  2195. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2196. ELSE
  2197. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2198. END;
  2199. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2200. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2201. Emit(Br(position,op));
  2202. END;
  2203. IF ~recordType.isObject THEN
  2204. GetRecordTypeName (recordType,name);
  2205. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2206. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2207. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2208. NEW(registerUsageCount);
  2209. usedRegisters := NIL;
  2210. IF dump # NIL THEN dump := section.comments END;
  2211. register := NewRegisterOperand (addressType);
  2212. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2213. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2214. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2215. END;
  2216. Emit (Push(position,register));
  2217. GetRecordTypeName (recordType,name);
  2218. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2219. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2220. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2221. ReleaseIntermediateOperand(register);
  2222. Emit(Exit(position,0,0));
  2223. GetRecordTypeName (recordType,name);
  2224. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2225. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2226. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2227. NEW(registerUsageCount);
  2228. usedRegisters := NIL;
  2229. register := NewRegisterOperand (addressType);
  2230. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2231. Emit(Mov(position, register, parameter1));
  2232. label := NewLabel();
  2233. SetLabel(label);
  2234. Emit(Push(position, register));
  2235. GetRecordTypeName (recordType,name);
  2236. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2237. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2238. Emit(Call(position, op, 0));
  2239. Emit(Pop(position, register));
  2240. Emit(Add(position, register, register, ofs));
  2241. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2242. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2243. Emit(Exit(position,0,0));
  2244. END;
  2245. INC(statCoopTraceMethod, section.pc);
  2246. ReturnToContext(context);
  2247. IF dump # NIL THEN dump := section.comments END;
  2248. END CreateTraceMethod;
  2249. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2250. VAR name: Basic.SegmentedName;
  2251. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2252. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2253. context: Context;
  2254. BEGIN
  2255. IF recordType.isObject THEN RETURN END;
  2256. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2257. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2258. GetRecordTypeName (recordType,name);
  2259. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2260. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2261. IF dump # NIL THEN dump := section.comments END;
  2262. variable := recordType.recordScope.firstVariable;
  2263. WHILE variable # NIL DO
  2264. IF variable.NeedsTrace() THEN
  2265. dst := NewRegisterOperand (addressType);
  2266. Emit (Mov(position, dst, parameter1));
  2267. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2268. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2269. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2270. END;
  2271. CallResetProcedure(dst, nil, variable.type);
  2272. ReleaseIntermediateOperand(dst);
  2273. END;
  2274. variable := variable.nextVariable;
  2275. END;
  2276. recordBase := recordType.GetBaseRecord();
  2277. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2278. GetRecordTypeName (recordBase,name);
  2279. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2280. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2281. Emit(Br(position,op));
  2282. ELSE
  2283. Emit(Exit(position,0,0));
  2284. END;
  2285. GetRecordTypeName (recordType,name);
  2286. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2287. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2288. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2289. NEW(registerUsageCount);
  2290. usedRegisters := NIL;
  2291. dst := NewRegisterOperand (addressType);
  2292. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2293. Emit(Mov(position, dst, parameter1));
  2294. label := NewLabel();
  2295. SetLabel(label);
  2296. Emit(Push(position, dst));
  2297. GetRecordTypeName (recordType,name);
  2298. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2299. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2300. Emit(Call(position, op, 0));
  2301. Emit(Pop(position, dst));
  2302. Emit(Add(position, dst, dst, ofs));
  2303. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2304. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2305. Emit(Exit(position,0,0));
  2306. INC(statCoopResetProcedure, section.pc);
  2307. ReturnToContext(context);
  2308. IF dump # NIL THEN dump := section.comments END;
  2309. END CreateResetProcedure;
  2310. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2311. VAR name: Basic.SegmentedName; context: Context;
  2312. BEGIN
  2313. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2314. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2315. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2316. IF dump # NIL THEN dump := section.comments END;
  2317. Emit(Push(position,fp));
  2318. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2319. ResetVariables(scope);
  2320. Emit(Pop(position,fp));
  2321. Emit(Exit(position,0,0));
  2322. ReturnToContext(context);
  2323. IF dump # NIL THEN dump := section.comments END;
  2324. END CreateResetMethod;
  2325. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2326. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2327. BEGIN
  2328. IF SemanticChecker.IsPointerType (type) THEN
  2329. Emit (Push(position, dest));
  2330. CallThis(position,"GarbageCollector","Reset", 1);
  2331. ELSIF type.IsRecordType() THEN
  2332. Emit (Push(position, dest));
  2333. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2334. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2335. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2336. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2337. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2338. size := GetArrayLength(type, tag);
  2339. base := ArrayBaseType(type);
  2340. IF base.IsRecordType() THEN
  2341. Emit (Push(position, size));
  2342. Emit (Push(position, dest));
  2343. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2344. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2345. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2346. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2347. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2348. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2349. Emit (Push(position, size));
  2350. Emit (Push(position, dest));
  2351. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2352. ELSE
  2353. Emit (Push(position, size));
  2354. Emit (Push(position, dest));
  2355. CallThis(position,"GarbageCollector","ResetArray", 2);
  2356. ASSERT(ArrayBaseType(type).IsPointer());
  2357. END;
  2358. ReleaseIntermediateOperand(size);
  2359. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2360. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2361. Emit (Push(position, dest));
  2362. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2363. ELSE HALT(100); (* missing ? *)
  2364. END;
  2365. END CallResetProcedure;
  2366. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2367. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2368. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2369. VAR operand: Operand;
  2370. BEGIN
  2371. Symbol (symbol, operand);
  2372. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2373. ReleaseOperand(operand);
  2374. END Reset;
  2375. BEGIN
  2376. previousScope := currentScope;
  2377. currentScope := scope;
  2378. pc := section.pc;
  2379. variable := scope.firstVariable;
  2380. WHILE variable # NIL DO
  2381. IF variable.NeedsTrace() THEN
  2382. Reset (variable);
  2383. END;
  2384. variable := variable.nextVariable;
  2385. END;
  2386. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2387. WHILE parameter # NIL DO
  2388. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2389. Reset (parameter);
  2390. END;
  2391. parameter := parameter.nextParameter;
  2392. END;
  2393. INC(statCoopResetVariables, section.pc - pc);
  2394. currentScope := previousScope;
  2395. END ResetVariables;
  2396. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2397. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2398. VAR op: IntermediateCode.Operand; context: Context;
  2399. BEGIN
  2400. previousSection := section;
  2401. GetCodeSectionNameForSymbol(procedure, name);
  2402. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2403. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2404. IF dump # NIL THEN dump := section.comments END;
  2405. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2406. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2407. Emit(Data(position,op));
  2408. Emit(Data(position,nil));
  2409. IF HasPointers (procedure.procedureScope) THEN
  2410. GetCodeSectionNameForSymbol(procedure, name);
  2411. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2412. ELSE
  2413. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2414. END;
  2415. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2416. Emit(Data(position,op));
  2417. ReturnToContext(context);
  2418. IF dump # NIL THEN dump := section.comments END;
  2419. END CreateProcedureDescriptor;
  2420. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2421. VAR import: SyntaxTree.Import;
  2422. s: Basic.MessageString;
  2423. selfName: SyntaxTree.IdentifierString;
  2424. BEGIN
  2425. moduleScope.ownerModule.GetName(selfName);
  2426. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2427. module := moduleScope.ownerModule
  2428. ELSE
  2429. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2430. IF import = NIL THEN
  2431. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2432. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2433. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2434. s := "Module ";
  2435. Strings.Append(s,moduleName);
  2436. Strings.Append(s," cannot be imported.");
  2437. IF force THEN
  2438. Error(position,s);
  2439. ELSIF canBeLoaded THEN
  2440. Strings.Append(s, "=> no dynamic linking.");
  2441. Warning(position, s);
  2442. canBeLoaded := FALSE;
  2443. END;
  2444. RETURN FALSE
  2445. ELSE
  2446. SELF.module.imports.AddName(moduleName)
  2447. END;
  2448. ELSIF import.module = NIL THEN (* already tried *)
  2449. RETURN FALSE
  2450. END;
  2451. module := import.module;
  2452. END;
  2453. RETURN TRUE
  2454. END AddImport;
  2455. (* needed for old binary object file format*)
  2456. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2457. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2458. BEGIN
  2459. IF AddImport(moduleName,module,TRUE) THEN
  2460. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2461. IF procedure = NIL THEN
  2462. s := "Instruction not supported on target, emulation procedure ";
  2463. Strings.Append(s,moduleName);
  2464. Strings.Append(s,".");
  2465. Strings.Append(s,procedureName);
  2466. Strings.Append(s," not present");
  2467. Error(position,s);
  2468. ELSE
  2469. StaticCallOperand(r,procedure);
  2470. ReleaseOperand(r);
  2471. fp := GetFingerprint(procedure);
  2472. END;
  2473. END;
  2474. END EnsureSymbol;
  2475. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2476. VAR exit: Label; trueL,falseL: Label;
  2477. BEGIN
  2478. trueL := NewLabel();
  2479. falseL := NewLabel();
  2480. exit := NewLabel();
  2481. Condition(x,trueL,falseL);
  2482. InitOperand(result,ModeValue);
  2483. SetLabel(trueL);
  2484. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2485. Emit(Mov(position,result.op,true));
  2486. BrL(exit);
  2487. SetLabel(falseL);
  2488. Emit(MovReplace(position,result.op,false));
  2489. SetLabel(exit);
  2490. END ConditionToValue;
  2491. PROCEDURE ValueToCondition(VAR op: Operand);
  2492. BEGIN
  2493. LoadValue(op,system.booleanType);
  2494. BrneL(trueLabel,op.op, false);
  2495. ReleaseOperand(op);
  2496. BrL(falseLabel);
  2497. END ValueToCondition;
  2498. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2499. VAR size: LONGINT;
  2500. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2501. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2502. BEGIN
  2503. ASSERT(type.form = SyntaxTree.Open);
  2504. baseType := type.arrayBase.resolved;
  2505. IF IsOpenArray(baseType) THEN
  2506. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2507. ELSE
  2508. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2509. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2510. END;
  2511. len := tag;
  2512. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2513. IntermediateCode.MakeMemory(len,addressType);
  2514. UseIntermediateOperand(len);
  2515. Reuse2(res,sizeOperand,len);
  2516. Emit(Mul(position,res,sizeOperand,len));
  2517. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2518. RETURN res
  2519. END GetArraySize;
  2520. BEGIN
  2521. type := type.resolved;
  2522. IF IsOpenArray(type) THEN
  2523. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2524. RETURN tag
  2525. ELSE
  2526. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2527. END;
  2528. ELSE
  2529. size := ToMemoryUnits(system,system.SizeOf(type));
  2530. RETURN IntermediateCode.Immediate(addressType,size)
  2531. END;
  2532. END GetDynamicSize;
  2533. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2534. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2535. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2536. BEGIN
  2537. ASSERT(type.form = SyntaxTree.Open);
  2538. baseType := type.arrayBase.resolved;
  2539. IF IsOpenArray(baseType) THEN
  2540. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2541. ELSE
  2542. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2543. END;
  2544. len := tag;
  2545. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2546. IntermediateCode.MakeMemory(len,addressType);
  2547. UseIntermediateOperand(len);
  2548. Reuse2(res,sizeOperand,len);
  2549. Emit(Mul(position,res,sizeOperand,len));
  2550. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2551. RETURN res
  2552. END GetLength;
  2553. BEGIN
  2554. type := type.resolved;
  2555. IF IsOpenArray(type) THEN
  2556. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2557. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2558. ELSE
  2559. RETURN IntermediateCode.Immediate(addressType,1)
  2560. END;
  2561. END GetArrayLength;
  2562. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2563. VAR result: IntermediateCode.Operand;
  2564. BEGIN
  2565. IF backend.cooperative THEN
  2566. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2567. ELSE
  2568. MakeMemory(result, tag, addressType, 0);
  2569. END;
  2570. RETURN result
  2571. END GetSizeFromTag;
  2572. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2573. VAR parameter: SyntaxTree.Parameter;
  2574. BEGIN
  2575. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2576. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2577. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2578. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2579. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2580. END;
  2581. RETURN GetDynamicSize(e.type, tag);
  2582. END GetArrayOfBytesSize;
  2583. (*
  2584. to find imported symbol. not needed ?
  2585. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2586. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2587. BEGIN
  2588. IF AddImport(moduleName,importedModule,FALSE) THEN
  2589. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2590. RETURN symbol
  2591. ELSE
  2592. RETURN NIL
  2593. END
  2594. END SymbolByName;
  2595. *)
  2596. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2597. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2598. BEGIN
  2599. IF AddImport(moduleName,runtimeModule,force) THEN
  2600. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2601. IF procedure = NIL THEN
  2602. s := "Procedure ";
  2603. Strings.Append(s,moduleName);
  2604. Strings.Append(s,".");
  2605. Strings.Append(s,procedureName);
  2606. Strings.Append(s," not present");
  2607. Error(position,s);
  2608. RETURN FALSE
  2609. ELSE
  2610. RETURN TRUE
  2611. END;
  2612. ELSE RETURN FALSE
  2613. END;
  2614. END GetRuntimeProcedure;
  2615. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2616. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2617. s: Basic.MessageString;
  2618. BEGIN
  2619. Basic.InitSegmentedName(name);
  2620. name[0] := Basic.MakeString(moduleName);
  2621. name[1] := Basic.MakeString(typeName);
  2622. name[2] := -1;
  2623. IF AddImport(moduleName,importedModule, FALSE) THEN
  2624. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2625. IF symbol = NIL THEN
  2626. s := "type ";
  2627. Strings.Append(s,moduleName);
  2628. Strings.Append(s,".");
  2629. Strings.Append(s,typeName);
  2630. Strings.Append(s," not present");
  2631. Error(position,s);
  2632. END;
  2633. ELSE symbol := NIL;
  2634. END;
  2635. IF importedModule = moduleScope.ownerModule THEN
  2636. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2637. ELSE
  2638. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2639. END;
  2640. RETURN symbol
  2641. END GetTypeDescriptor;
  2642. (* 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. *)
  2643. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2644. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2645. pooledName: Basic.SegmentedName; size: LONGINT;
  2646. BEGIN
  2647. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2648. StaticCallOperand(result,procedure);
  2649. IF numberParameters < 0 THEN
  2650. size := ProcedureParametersSize(system,procedure);
  2651. ELSE
  2652. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2653. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2654. Error(position,"runtime call parameter count mismatch");
  2655. END;
  2656. END;
  2657. Emit(Call(position, result.op, size));
  2658. ReleaseOperand(result);
  2659. ELSE (* only static linking possible *)
  2660. ASSERT(numberParameters >= 0);
  2661. Basic.InitSegmentedName(pooledName);
  2662. pooledName[0] := Basic.MakeString(moduleName);
  2663. pooledName[1] := Basic.MakeString(procedureName);
  2664. pooledName[2] := -1;
  2665. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2666. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2667. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2668. END;
  2669. END CallThisChecked;
  2670. (* 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. *)
  2671. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2672. BEGIN
  2673. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2674. END CallThis;
  2675. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2676. VAR
  2677. left,right: Operand;
  2678. leftSize, rightSize: IntermediateCode.Operand;
  2679. saved: RegisterEntry;
  2680. reg: IntermediateCode.Operand;
  2681. procedureName: SyntaxTree.IdentifierString;
  2682. BEGIN
  2683. procedureName := "CompareString";
  2684. SaveRegisters();ReleaseUsedRegisters(saved);
  2685. Designate(leftExpression,left);
  2686. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2687. Emit(Push(position,leftSize));
  2688. ReleaseIntermediateOperand(leftSize);
  2689. Emit(Push(position,left.op));
  2690. ReleaseOperand(left);
  2691. Designate(rightExpression,right);
  2692. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2693. Emit(Push(position,rightSize));
  2694. ReleaseIntermediateOperand(rightSize);
  2695. Emit(Push(position,right.op));
  2696. ReleaseOperand(right);
  2697. IF backend.cooperative THEN
  2698. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2699. ELSE
  2700. CallThis(position,runtimeModuleName,procedureName, 4);
  2701. END;
  2702. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2703. Emit(Result(position,reg));
  2704. (*
  2705. AcquireThisRegister(int8,IntermediateCode.Result);
  2706. *)
  2707. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2708. (*
  2709. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2710. *)
  2711. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2712. ReleaseIntermediateOperand(reg);
  2713. BrL(falseLabel);
  2714. END CompareString;
  2715. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2716. VAR
  2717. left,right: Operand;
  2718. leftSize, rightSize: IntermediateCode.Operand;
  2719. saved: RegisterEntry;
  2720. procedureName: SyntaxTree.IdentifierString;
  2721. BEGIN
  2722. procedureName := "CopyString";
  2723. SaveRegisters();ReleaseUsedRegisters(saved);
  2724. Designate(leftExpression,left);
  2725. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2726. Emit(Push(position,leftSize));
  2727. ReleaseIntermediateOperand(leftSize);
  2728. Emit(Push(position,left.op));
  2729. ReleaseOperand(left);
  2730. Designate(rightExpression,right);
  2731. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2732. Emit(Push(position,rightSize));
  2733. ReleaseIntermediateOperand(rightSize);
  2734. Emit(Push(position,right.op));
  2735. ReleaseOperand(right);
  2736. IF backend.cooperative THEN
  2737. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2738. ELSE
  2739. CallThis(position,runtimeModuleName,procedureName,4);
  2740. END;
  2741. RestoreRegisters(saved);
  2742. END CopyString;
  2743. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2744. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2745. leftType,rightType: SyntaxTree.Type;
  2746. leftExpression,rightExpression : SyntaxTree.Expression;
  2747. componentType: IntermediateCode.Type;
  2748. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2749. size: LONGINT;
  2750. BEGIN
  2751. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2752. dest := destination; destination := emptyOperand;
  2753. leftType := x.left.type.resolved;
  2754. rightType := x.right.type.resolved;
  2755. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2756. CASE x.operator OF
  2757. Scanner.Or:
  2758. (* shortcut evaluation of left OR right *)
  2759. IF ~conditional THEN ConditionToValue(x);
  2760. ELSE
  2761. next := NewLabel();
  2762. Condition(x.left,trueLabel,next);
  2763. SetLabel(next);
  2764. Condition(x.right,trueLabel,falseLabel);
  2765. END;
  2766. |Scanner.And:
  2767. (* shortcut evaluation of left & right *)
  2768. IF ~conditional THEN ConditionToValue(x);
  2769. ELSE
  2770. next := NewLabel();
  2771. Condition(x.left,next,falseLabel);
  2772. SetLabel(next);
  2773. Condition(x.right,trueLabel,falseLabel);
  2774. END;
  2775. |Scanner.Is:
  2776. IF ~conditional THEN ConditionToValue(x);
  2777. ELSE
  2778. (* get type desc tag *)
  2779. IF IsPointerToRecord(leftType,recordType) THEN
  2780. Evaluate(x.left,left);
  2781. Dereference(left,recordType,IsUnsafePointer(leftType))
  2782. ELSE
  2783. Designate(x.left,left);
  2784. END;
  2785. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2786. ReleaseOperand(left);
  2787. END;
  2788. |Scanner.Plus:
  2789. Evaluate(x.left,left);
  2790. Evaluate(x.right,right);
  2791. IF leftType IS SyntaxTree.SetType THEN
  2792. InitOperand(result,ModeValue);
  2793. Reuse2a(result.op,left.op,right.op,dest);
  2794. Emit(Or(position,result.op,left.op,right.op));
  2795. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2796. InitOperand(result,ModeValue);
  2797. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2798. Reuse2(result.tag,left.tag,right.tag);
  2799. Emit(Add(position,result.op,left.op,right.op));
  2800. Emit(Add(position,result.tag,left.tag,right.tag))
  2801. ELSE
  2802. InitOperand(result,ModeValue);
  2803. Reuse2a(result.op,left.op,right.op,dest);
  2804. Emit(Add(position,result.op,left.op,right.op));
  2805. END;
  2806. ReleaseOperand(left); ReleaseOperand(right);
  2807. |Scanner.Minus:
  2808. Evaluate(x.left,left);
  2809. Evaluate(x.right,right);
  2810. IF leftType IS SyntaxTree.SetType THEN
  2811. InitOperand(result,ModeValue);
  2812. Reuse1(result.op,right.op);
  2813. Emit(Not(position,result.op,right.op));
  2814. ReleaseOperand(right);
  2815. Emit(And(position,result.op,result.op,left.op));
  2816. ReleaseOperand(left);
  2817. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2818. InitOperand(result,ModeValue);
  2819. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2820. Reuse2(result.tag,left.tag,right.tag);
  2821. Emit(Sub(position,result.op,left.op,right.op));
  2822. Emit(Sub(position,result.tag,left.tag,right.tag));
  2823. ReleaseOperand(left); ReleaseOperand(right)
  2824. ELSE
  2825. InitOperand(result,ModeValue);
  2826. Reuse2a(result.op,left.op,right.op,dest);
  2827. Emit(Sub(position,result.op,left.op,right.op));
  2828. ReleaseOperand(left); ReleaseOperand(right);
  2829. END;
  2830. |Scanner.Times:
  2831. Evaluate(x.left,left);
  2832. Evaluate(x.right,right);
  2833. IF leftType IS SyntaxTree.SetType THEN
  2834. InitOperand(result,ModeValue);
  2835. Reuse2a(result.op,left.op,right.op,dest);
  2836. Emit(And(position,result.op,left.op,right.op));
  2837. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2838. InitOperand(result,ModeValue);
  2839. Reuse1a(result.op,left.op,dest);
  2840. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2841. Emit(Shl(position,result.op,left.op,right.op));
  2842. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2843. InitOperand(result, ModeValue);
  2844. componentType := left.op.type;
  2845. (* TODO: review this *)
  2846. (*
  2847. result.op = left.op * right.op - left.tag * right.tag
  2848. result.tag = left.tag * right.op + left.op * right.tag
  2849. *)
  2850. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2851. Emit(Mul(position,result.op, left.op, right.op));
  2852. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2853. Emit(Mul(position,tempReg, left.tag, right.tag));
  2854. Emit(Sub(position,result.op, result.op, tempReg));
  2855. Reuse2(result.tag, left.tag, right.op);
  2856. Emit(Mul(position,result.tag, left.tag, right.op));
  2857. Emit(Mul(position,tempReg, left.op, right.tag));
  2858. Emit(Add(position,result.tag, result.tag, tempReg));
  2859. ReleaseIntermediateOperand(tempReg)
  2860. ELSE
  2861. InitOperand(result,ModeValue);
  2862. Reuse2a(result.op,left.op,right.op,dest);
  2863. Emit(Mul(position,result.op,left.op,right.op));
  2864. END;
  2865. ReleaseOperand(left); ReleaseOperand(right);
  2866. |Scanner.Div:
  2867. Evaluate(x.left,left);
  2868. Evaluate(x.right,right);
  2869. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2870. InitOperand(result,ModeValue);
  2871. Reuse1a(result.op,left.op,dest);
  2872. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2873. Emit(Shr(position,result.op,left.op,right.op));
  2874. ELSE
  2875. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2876. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2877. IF ~isUnchecked THEN
  2878. exit := NewLabel();
  2879. BrltL(exit,zero,right.op);
  2880. EmitTrap(position,NegativeDivisorTrap);
  2881. SetLabel(exit);
  2882. END;
  2883. END;
  2884. InitOperand(result,ModeValue);
  2885. Reuse2a(result.op,left.op,right.op,dest);
  2886. Emit(Div(position,result.op,left.op,right.op));
  2887. END;
  2888. ReleaseOperand(left); ReleaseOperand(right);
  2889. |Scanner.Mod:
  2890. Evaluate(x.left,left);
  2891. Evaluate(x.right,right);
  2892. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2893. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  2894. InitOperand(result,ModeValue);
  2895. Reuse1a(result.op,left.op,dest);
  2896. Emit(And(position,result.op,left.op,right.op));
  2897. ELSE
  2898. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2899. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2900. IF ~isUnchecked THEN
  2901. exit := NewLabel();
  2902. BrltL(exit,zero,right.op);
  2903. EmitTrap(position,NegativeDivisorTrap);
  2904. SetLabel(exit);
  2905. END;
  2906. END;
  2907. InitOperand(result,ModeValue);
  2908. Reuse2a(result.op,left.op,right.op,dest);
  2909. Emit(Mod(position,result.op,left.op,right.op));
  2910. END;
  2911. ReleaseOperand(left); ReleaseOperand(right);
  2912. |Scanner.Slash:
  2913. Evaluate(x.left,left);
  2914. Evaluate(x.right,right);
  2915. IF leftType IS SyntaxTree.SetType THEN
  2916. InitOperand(result,ModeValue);
  2917. Reuse2a(result.op,left.op,right.op,dest);
  2918. Emit(Xor(position,result.op,left.op,right.op));
  2919. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2920. InitOperand(result,ModeValue);
  2921. componentType := left.op.type;
  2922. (* review this *)
  2923. (*
  2924. divisor = right.op * right.op + right.tag * right.tag
  2925. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2926. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2927. *)
  2928. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2929. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2930. Emit(Mul(position,tempReg, right.op, right.op));
  2931. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2932. Emit(Add(position,tempReg, tempReg, tempReg2));
  2933. result.op := tempReg2;
  2934. Emit(Mul(position,result.op, left.op, right.op));
  2935. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2936. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2937. Emit(Add(position,result.op, result.op, tempReg2));
  2938. Emit(Div(position,result.op, result.op, tempReg));
  2939. Reuse2(result.tag, left.tag, right.op);
  2940. Emit(Mul(position,result.tag, left.tag, right.op));
  2941. Emit(Mul(position,tempReg2, left.op, right.tag));
  2942. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2943. Emit(Div(position,result.tag, result.tag, tempReg));
  2944. ReleaseIntermediateOperand(tempReg);
  2945. ReleaseIntermediateOperand(tempReg2)
  2946. ELSE
  2947. InitOperand(result,ModeValue);
  2948. Reuse2a(result.op,left.op,right.op,dest);
  2949. Emit(Div(position,result.op,left.op,right.op));
  2950. END;
  2951. ReleaseOperand(left); ReleaseOperand(right);
  2952. |Scanner.Equal:
  2953. IF ~conditional THEN ConditionToValue(x);
  2954. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2955. CompareString(BreqL,x.left,x.right);
  2956. ELSE
  2957. Evaluate(x.left,left);
  2958. Evaluate(x.right,right);
  2959. IF leftType IS SyntaxTree.RangeType THEN
  2960. ASSERT(rightType IS SyntaxTree.RangeType);
  2961. BrneL(falseLabel, left.op, right.op); (* first *)
  2962. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2963. BrneL(falseLabel, left.extra, right.extra); (* step *)
  2964. ReleaseOperand(left); ReleaseOperand(right);
  2965. BrL(trueLabel)
  2966. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  2967. BrneL(falseLabel, left.op, right.op); (* first *)
  2968. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2969. ReleaseOperand(left); ReleaseOperand(right);
  2970. BrL(trueLabel)
  2971. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2972. (* TODO: review this *)
  2973. BrneL(falseLabel, left.op, right.op); (* real part *)
  2974. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  2975. ReleaseOperand(left); ReleaseOperand(right);
  2976. BrL(trueLabel)
  2977. ELSE
  2978. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  2979. ReleaseOperand(left); ReleaseOperand(right);
  2980. BrL(trueLabel);
  2981. END;
  2982. END;
  2983. |Scanner.LessEqual:
  2984. IF ~conditional THEN ConditionToValue(x);
  2985. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2986. CompareString(BrgeL,x.right,x.left);
  2987. ELSE
  2988. Evaluate(x.left,left);
  2989. Evaluate(x.right,right);
  2990. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  2991. Reuse1(temp.op,right.op);
  2992. Emit(And(position,temp.op,left.op,right.op));
  2993. ReleaseOperand(right);
  2994. BreqL(trueLabel,temp.op,left.op);
  2995. BrL(falseLabel);
  2996. ReleaseOperand(temp);ReleaseOperand(left);
  2997. ELSE
  2998. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  2999. ReleaseOperand(left); ReleaseOperand(right);
  3000. BrL(trueLabel);
  3001. END;
  3002. END;
  3003. |Scanner.Less:
  3004. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3005. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3006. leftExpression.SetType(system.booleanType);
  3007. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3008. rightExpression.SetType(system.booleanType);
  3009. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3010. leftExpression.SetType(system.booleanType);
  3011. Expression(leftExpression);
  3012. ELSIF ~conditional THEN ConditionToValue(x);
  3013. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3014. CompareString(BrltL,x.left,x.right);
  3015. ELSE
  3016. Evaluate(x.left,left);
  3017. Evaluate(x.right,right);
  3018. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3019. ReleaseOperand(left); ReleaseOperand(right);
  3020. BrL(trueLabel);
  3021. END;
  3022. |Scanner.Greater:
  3023. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3024. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3025. leftExpression.SetType(system.booleanType);
  3026. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3027. rightExpression.SetType(system.booleanType);
  3028. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3029. leftExpression.SetType(system.booleanType);
  3030. Expression(leftExpression);
  3031. ELSIF ~conditional THEN ConditionToValue(x);
  3032. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3033. CompareString(BrltL,x.right,x.left);
  3034. ELSE
  3035. Evaluate(x.left,left);
  3036. Evaluate(x.right,right);
  3037. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3038. ReleaseOperand(left); ReleaseOperand(right);
  3039. BrL(trueLabel);
  3040. END;
  3041. |Scanner.GreaterEqual:
  3042. IF ~conditional THEN ConditionToValue(x);
  3043. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3044. CompareString(BrgeL,x.left,x.right);
  3045. ELSE
  3046. Evaluate(x.left,left);
  3047. Evaluate(x.right,right);
  3048. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3049. Reuse1(temp.op,left.op);
  3050. Emit(And(position,temp.op,left.op,right.op));
  3051. ReleaseOperand(left);
  3052. BreqL(trueLabel, temp.op,right.op);
  3053. ReleaseOperand(temp); ReleaseOperand(right);
  3054. BrL(falseLabel);
  3055. ELSE
  3056. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3057. ReleaseOperand(left); ReleaseOperand(right);
  3058. BrL(trueLabel);
  3059. END;
  3060. END;
  3061. |Scanner.Unequal:
  3062. IF ~conditional THEN ConditionToValue(x);
  3063. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3064. CompareString(BrneL,x.left,x.right);
  3065. ELSE
  3066. Evaluate(x.left,left);
  3067. Evaluate(x.right,right);
  3068. IF leftType IS SyntaxTree.RangeType THEN
  3069. ASSERT(rightType IS SyntaxTree.RangeType);
  3070. BrneL(trueLabel, left.op, right.op); (* first *)
  3071. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3072. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3073. ReleaseOperand(left); ReleaseOperand(right);
  3074. BrL(falseLabel)
  3075. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3076. BrneL(trueLabel, left.op, right.op); (* first *)
  3077. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3078. ReleaseOperand(left); ReleaseOperand(right);
  3079. BrL(falseLabel)
  3080. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3081. (* TODO: review this *)
  3082. BrneL(trueLabel, left.op, right.op); (* real part *)
  3083. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3084. ReleaseOperand(left); ReleaseOperand(right);
  3085. BrL(falseLabel)
  3086. ELSE
  3087. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3088. ReleaseOperand(left); ReleaseOperand(right);
  3089. BrL(trueLabel);
  3090. END;
  3091. END;
  3092. |Scanner.In:
  3093. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3094. Evaluate(x.left,left);
  3095. Evaluate(x.right,right);
  3096. Convert(left.op,setType);
  3097. ReuseCopy(temp.op,right.op);
  3098. Emit(Shr(position,temp.op,temp.op,left.op));
  3099. ReleaseOperand(right); ReleaseOperand(left);
  3100. IntermediateCode.InitImmediate(one,setType,1);
  3101. Emit(And(position,temp.op,temp.op,one));
  3102. IF conditional THEN
  3103. IntermediateCode.InitImmediate(zero,setType,0);
  3104. BrneL(trueLabel,temp.op,zero);
  3105. ReleaseOperand(temp);
  3106. BrL(falseLabel);
  3107. ELSE
  3108. Convert(temp.op,bool);
  3109. result.mode := ModeValue;
  3110. result.op := temp.op;
  3111. result.tag := nil; (* may be left over from calls to evaluate *)
  3112. END;
  3113. ELSE
  3114. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3115. IF x.operator = Scanner.Questionmarks THEN
  3116. leftExpression := x.left;
  3117. rightExpression := x.right;
  3118. ELSE
  3119. leftExpression := x.right;
  3120. rightExpression := x.left;
  3121. END;
  3122. Evaluate(leftExpression, left);
  3123. Emit(Push(position,left.op));
  3124. ReleaseOperand(left);
  3125. Designate(rightExpression, right);
  3126. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3127. IF ~backend.cellsAreObjects THEN
  3128. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3129. END;
  3130. Emit(Push(position,right.op));
  3131. ReleaseOperand(right);
  3132. IF backend.cellsAreObjects THEN
  3133. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3134. ELSE
  3135. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3136. END;
  3137. InitOperand(result, ModeValue);
  3138. result.op := NewRegisterOperand(bool);
  3139. Emit(Result(position,result.op));
  3140. IF conditional THEN
  3141. IntermediateCode.InitImmediate(zero,setType,0);
  3142. BrneL(trueLabel,result.op,zero);
  3143. ReleaseOperand(result);
  3144. BrL(falseLabel);
  3145. END;
  3146. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3147. leftExpression := x.left;
  3148. rightExpression := x.right;
  3149. Evaluate(leftExpression, left);
  3150. Emit(Push(position,left.op));
  3151. ReleaseOperand(left);
  3152. Evaluate(rightExpression, right);
  3153. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3154. IF ~backend.cellsAreObjects THEN
  3155. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3156. END;
  3157. Emit(Push(position,right.op));
  3158. ReleaseOperand(right);
  3159. IF backend.cellsAreObjects THEN
  3160. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3161. ELSE
  3162. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3163. END;
  3164. InitOperand(result, ModeValue);
  3165. result.op := NewRegisterOperand(bool);
  3166. Emit(Result(position,result.op));
  3167. IF conditional THEN
  3168. IntermediateCode.InitImmediate(zero,setType,0);
  3169. BrneL(trueLabel,result.op,zero);
  3170. ReleaseOperand(result);
  3171. BrL(falseLabel);
  3172. END;
  3173. ELSE
  3174. HALT(100);
  3175. END;
  3176. END;
  3177. destination := dest;
  3178. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3179. END VisitBinaryExpression;
  3180. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3181. VAR localResult, operand: Operand;
  3182. BEGIN
  3183. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3184. InitOperand(localResult, ModeValue);
  3185. ASSERT(x.first # NIL);
  3186. Evaluate(x.first, operand);
  3187. localResult.op := operand.op;
  3188. ReleaseOperand(operand);
  3189. UseIntermediateOperand(localResult.op);
  3190. ASSERT(x.last # NIL);
  3191. Evaluate(x.last, operand);
  3192. localResult.tag := operand.op;
  3193. ReleaseOperand(operand);
  3194. UseIntermediateOperand(localResult.tag);
  3195. IF x.step # NIL THEN
  3196. Evaluate(x.step, operand);
  3197. localResult.extra := operand.op;
  3198. ReleaseOperand(operand);
  3199. UseIntermediateOperand(localResult.extra);
  3200. END;
  3201. result := localResult;
  3202. IF Trace THEN TraceExit("VisitRangeExpression") END
  3203. END VisitRangeExpression;
  3204. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3205. BEGIN
  3206. HALT(100); (* should never be evaluated *)
  3207. END VisitTensorRangeExpression;
  3208. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3209. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3210. BEGIN
  3211. IF Trace THEN TraceEnter("VisitConversion") END;
  3212. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3213. dest := destination; destination := emptyOperand;
  3214. Evaluate(x.expression,old);
  3215. InitOperand(result,ModeValue);
  3216. result.op := old.op;
  3217. ASSERT(result.op.mode # 0);
  3218. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3219. (* convert TO a complex number *)
  3220. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3221. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3222. ASSERT(result.op.mode # 0);
  3223. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3224. (* convert FROM a complex number TO a complex number*)
  3225. result.tag := old.tag;
  3226. ASSERT(result.tag.mode # 0);
  3227. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3228. ASSERT(result.tag.mode # 0)
  3229. ELSE
  3230. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3231. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3232. END
  3233. ELSE
  3234. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3235. ASSERT(result.op.mode # 0);
  3236. result.tag := old.tag; (*! probably never used *)
  3237. END;
  3238. destination := dest;
  3239. IF Trace THEN TraceExit("VisitConversion") END;
  3240. END VisitConversion;
  3241. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3242. BEGIN
  3243. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3244. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3245. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3246. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3247. END VisitTypeDeclaration;
  3248. (** designators (expressions) *)
  3249. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3250. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3251. BEGIN
  3252. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3253. IF x.left # NIL THEN Expression(x.left) END;
  3254. Symbol(x.symbol,result);
  3255. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3256. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3257. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3258. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3259. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3260. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3261. END;
  3262. END;
  3263. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3264. END VisitSymbolDesignator;
  3265. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3266. BEGIN
  3267. IF isUnchecked THEN RETURN END;
  3268. IF tagsAvailable THEN
  3269. TrapC(BrltL,index,length,IndexCheckTrap);
  3270. END;
  3271. END BoundCheck;
  3272. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3273. VAR d: IntermediateCode.Operand;
  3274. BEGIN
  3275. IF isUnchecked THEN RETURN END;
  3276. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3277. TrapC(op,dim,d,ArraySizeTrap);
  3278. ReleaseIntermediateOperand(d);
  3279. END DimensionCheck;
  3280. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3281. VAR
  3282. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3283. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3284. expression: SyntaxTree.Expression;
  3285. resultingType, leftType, baseType: SyntaxTree.Type;
  3286. skipLabel1: Label;
  3287. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3288. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3289. variableOp: Operand;
  3290. variable: SyntaxTree.Variable;
  3291. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3292. VAR expression: SyntaxTree.Expression;
  3293. BEGIN
  3294. (* count the number of indices, ranges and tensorRanges in the index list *)
  3295. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3296. FOR i := 0 TO parameters.Length() - 1 DO
  3297. expression := parameters.GetExpression(i);
  3298. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3299. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3300. ELSE INC(indexCount)
  3301. END
  3302. END;
  3303. END CountIndices;
  3304. BEGIN
  3305. ASSERT(tagsAvailable);
  3306. resultingType := x.type.resolved; (* resulting type *)
  3307. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3308. InitOperand(localResult, ModeReference);
  3309. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3310. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3311. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3312. (* a globally defined array destination tag is available -> use and invalidate it*)
  3313. localResult.tag := arrayDestinationTag;
  3314. IntermediateCode.InitOperand(arrayDestinationTag)
  3315. ELSE
  3316. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3317. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3318. Symbol(variable, variableOp);
  3319. ReuseCopy(localResult.tag, variableOp.op);
  3320. ReleaseOperand(variableOp);
  3321. END
  3322. END;
  3323. indexListSize := x.parameters.Length();
  3324. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3325. ASSERT(tensorRangeCount <= 1);
  3326. (* designate the array to be indexed over, perform tensor range check if known *)
  3327. Designate(x.left, array);
  3328. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3329. Dereference(array, leftType,FALSE);
  3330. IF tensorRangeCount=0 THEN
  3331. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3332. END
  3333. END;
  3334. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3335. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3336. srcDimOffset := -indexListSize;
  3337. destDimOffset := -rangeCount
  3338. ELSE
  3339. srcDimOffset := 0;
  3340. destDimOffset := 0
  3341. END;
  3342. indexDim := 0;
  3343. (* use address of source array as basis *)
  3344. (*
  3345. ReuseCopy(localResult.op, array.op);
  3346. *)
  3347. localResult.op := array.op;
  3348. UseIntermediateOperand(localResult.op);
  3349. (* go through the index list *)
  3350. FOR i := 0 TO indexListSize - 1 DO
  3351. expression := x.parameters.GetExpression(i);
  3352. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3353. (* nothing to do *)
  3354. ELSE
  3355. (* determine which dimension of source array is currently looked at *)
  3356. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3357. (* get the memory operand pointing to array descriptor dimension *)
  3358. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3359. (* make a reusable register from it *)
  3360. ReuseCopy(srcDim, tmp);
  3361. ReleaseIntermediateOperand(tmp);
  3362. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3363. ELSE
  3364. srcDim := IntermediateCode.Immediate(int32, i)
  3365. END;
  3366. (* get length and increment of source array for current dimension *)
  3367. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3368. Convert(sourceLength.op, sizeType);
  3369. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3370. Convert(sourceIncrement.op, sizeType);
  3371. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3372. ReleaseIntermediateOperand(srcDim);
  3373. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3374. (* SINGLE INDEX *)
  3375. Evaluate(expression, index);
  3376. ReleaseIntermediateOperand(index.tag);
  3377. index.tag := emptyOperand;
  3378. Convert(index.op, sizeType);
  3379. (* lower bound check *)
  3380. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3381. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3382. ELSIF isUnchecked THEN (* do nothing *)
  3383. ELSE
  3384. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3385. END;
  3386. (* upper bound check *)
  3387. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3388. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3389. ELSIF isUnchecked THEN (* do nothing *)
  3390. ELSE
  3391. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3392. END;
  3393. ReleaseOperand(sourceLength);
  3394. Convert(index.op, addressType);
  3395. summand := index.op;
  3396. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3397. (* RANGE OF INDICES *)
  3398. Evaluate(expression, range);
  3399. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3400. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3401. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3402. ReleaseOperand(range);
  3403. Convert(firstIndex, sizeType);
  3404. Convert(lastIndex, sizeType);
  3405. Convert(stepSize, sizeType);
  3406. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3407. if it is 'MAX(LONGINT)' *)
  3408. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3409. TransferToRegister(lastIndex, lastIndex);
  3410. skipLabel1 := NewLabel();
  3411. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3412. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3413. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3414. SetLabel(skipLabel1)
  3415. END;
  3416. (* check if step size is valid *)
  3417. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3418. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3419. ELSIF isUnchecked THEN (* do nothing *)
  3420. ELSE
  3421. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3422. END;
  3423. (* check lower bound check *)
  3424. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3425. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3426. ELSIF isUnchecked THEN (* do nothing *)
  3427. ELSE
  3428. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3429. END;
  3430. (* check upper bound check *)
  3431. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3432. (* statically open range: nothing to do *)
  3433. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3434. ASSERT(staticLastIndex < staticSourceLength)
  3435. ELSIF isUnchecked THEN (* do nothing *)
  3436. ELSE
  3437. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3438. END;
  3439. (* determine length of target array for current dimension *)
  3440. (* 1. incorporate last index: *)
  3441. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3442. (* last index is static *)
  3443. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3444. targetLength := sourceLength.op
  3445. ELSE
  3446. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3447. END;
  3448. UseIntermediateOperand(targetLength);
  3449. ELSE
  3450. (* targetLength := lastIndex + 1
  3451. Reuse1(targetLength, lastIndex);
  3452. *)
  3453. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3454. END;
  3455. ReleaseOperand(sourceLength);
  3456. ReleaseIntermediateOperand(lastIndex);
  3457. (* 2. incorporate first index: *)
  3458. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3459. (* first index and current target length are static *)
  3460. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3461. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3462. (* first index = 0: nothing to do *)
  3463. ELSE
  3464. (* targetLength := targetLength - firstIndex *)
  3465. TransferToRegister(targetLength, targetLength);
  3466. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3467. END;
  3468. (* clip negative lengths to 0 *)
  3469. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3470. IF staticTargetLength < 0 THEN
  3471. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3472. END
  3473. ELSE
  3474. skipLabel1 := NewLabel();
  3475. TransferToRegister(targetLength, targetLength);
  3476. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3477. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3478. SetLabel(skipLabel1)
  3479. END;
  3480. (* 3. incorporate index step size: *)
  3481. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3482. (*step size and current target length are static *)
  3483. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3484. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3485. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3486. (* step size = 1: nothing to do *)
  3487. ELSE
  3488. (* emit code for this:
  3489. targetLength := (targetLength-1) DIV stepSize +1;
  3490. *)
  3491. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3492. DivInt(targetLength, targetLength, stepSize);
  3493. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3494. END;
  3495. (* determine increment of target array for current dimension *)
  3496. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3497. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3498. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3499. (* step size = 1 *)
  3500. targetIncrement := sourceIncrement.op;
  3501. UseIntermediateOperand(targetIncrement)
  3502. ELSE
  3503. (* targetIncrement := sourceIncrement * stepSize *)
  3504. Reuse1(targetIncrement, stepSize);
  3505. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3506. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3507. END;
  3508. ReleaseIntermediateOperand(stepSize);
  3509. (* write length and increment of target array to descriptor *)
  3510. IF destDimOffset < 0 THEN
  3511. (* determine which dimension of target array is currently looked at *)
  3512. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3513. TransferToRegister(destDim, tmp);
  3514. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3515. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3516. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3517. ReleaseIntermediateOperand(destDim)
  3518. ELSE
  3519. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3520. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3521. END;
  3522. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3523. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3524. INC(indexDim);
  3525. Convert(firstIndex, addressType);
  3526. TransferToRegister(summand, firstIndex);
  3527. ELSE HALT(100);
  3528. END;
  3529. (*
  3530. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3531. *)
  3532. Convert(sourceIncrement.op, addressType);
  3533. Convert(summand, addressType);
  3534. MulInt(summand, summand, sourceIncrement.op);
  3535. ReleaseIntermediateOperand(sourceIncrement.op);
  3536. AddInt(localResult.op, localResult.op, summand);
  3537. ReleaseIntermediateOperand(summand);
  3538. END
  3539. END;
  3540. result := localResult;
  3541. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3542. ReleaseIntermediateOperand(result.tag);
  3543. result.tag := TypeDescriptorAdr(resultingType);
  3544. IF ~newObjectFile THEN
  3545. IntermediateCode.MakeMemory(result.tag,addressType);
  3546. END;
  3547. ELSIF IsDelegate(resultingType) THEN
  3548. ReleaseIntermediateOperand(result.tag);
  3549. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3550. UseIntermediateOperand(result.tag);
  3551. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3552. ReleaseIntermediateOperand(result.tag);
  3553. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3554. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3555. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3556. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3557. (* finalize target array descriptor *)
  3558. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3559. (* write lengths and increments of target array for remaining dimensions *)
  3560. i := indexListSize;
  3561. WHILE indexDim < targetArrayDimensionality DO
  3562. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3563. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3564. ReleaseOperand(sourceLength);
  3565. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3566. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3567. ReleaseOperand(sourceIncrement);
  3568. INC(i); INC(indexDim);
  3569. END;
  3570. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3571. tmp := nil;
  3572. ELSE
  3573. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3574. END;
  3575. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3576. ReleaseIntermediateOperand(tmp);
  3577. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3578. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3579. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3580. ELSE
  3581. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3582. END;
  3583. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3584. ReleaseIntermediateOperand(tmp);
  3585. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3586. (* write dimensionality *)
  3587. IF targetArrayDimensionality # 0 THEN
  3588. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3589. END;
  3590. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3591. END;
  3592. ReleaseOperand(array);
  3593. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3594. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3595. END;
  3596. END MathIndexDesignator;
  3597. (* TENTATIVE *)
  3598. PROCEDURE DumpOperand(operand: Operand);
  3599. BEGIN
  3600. D.Log.String(" op = ");
  3601. IntermediateCode.DumpOperand(D.Log, operand.op );
  3602. D.Log.Ln;
  3603. D.Log.String(" tag = ");
  3604. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3605. D.Log.Ln;
  3606. D.Log.String(" extra = ");
  3607. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3608. D.Log.Ln;
  3609. D.Log.Update
  3610. END DumpOperand;
  3611. (* get the length of an array , trying to make use of static information *)
  3612. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3613. VAR res: IntermediateCode.Operand; size: LONGINT;
  3614. BEGIN
  3615. type := type.resolved;
  3616. IF type IS SyntaxTree.ArrayType THEN
  3617. WITH type: SyntaxTree.ArrayType DO
  3618. IF type.form = SyntaxTree.Static THEN
  3619. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3620. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3621. Evaluate(type.length, op);
  3622. ReleaseIntermediateOperand(op.tag);
  3623. RETURN op.op;*)
  3624. ELSE
  3625. res := tag;
  3626. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3627. IntermediateCode.MakeMemory(res,addressType);
  3628. UseIntermediateOperand(res);
  3629. RETURN res
  3630. END
  3631. END;
  3632. ELSE
  3633. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3634. RETURN IntermediateCode.Immediate(addressType,size);
  3635. END;
  3636. END ArrayLength;
  3637. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3638. BEGIN
  3639. ReleaseIntermediateOperand(res);
  3640. IF IsImmediate(x) & IsImmediate(y) THEN
  3641. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3642. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3643. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3644. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3645. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3646. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3647. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3648. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3649. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3650. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3651. UseIntermediateOperand(res);
  3652. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3653. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3654. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3655. UseIntermediateOperand(res);
  3656. ELSE
  3657. IF ~ReusableRegister(res) THEN
  3658. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3659. ELSE
  3660. UseIntermediateOperand(res);
  3661. END;
  3662. IF IsImmediate(x) & (x.intValue = 0) THEN
  3663. Emit(Mov(position,res,y))
  3664. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3665. Emit(Mov(position,res,x))
  3666. ELSE
  3667. Emit(Add(position,res, x, y));
  3668. END;
  3669. END;
  3670. END AddInt;
  3671. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3672. BEGIN
  3673. ReleaseIntermediateOperand(res);
  3674. IF IsImmediate(x) & IsImmediate(y) THEN
  3675. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3676. ELSE
  3677. IF ~ReusableRegister(res) THEN
  3678. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3679. ELSE UseIntermediateOperand(res);
  3680. END;
  3681. IF IsImmediate(x) & (x.intValue = 1) THEN
  3682. Emit(Mov(position,res,y))
  3683. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3684. Emit(Mov(position,res,x))
  3685. ELSE
  3686. Emit(Mul(position,res, x, y));
  3687. END;
  3688. END;
  3689. END MulInt;
  3690. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3691. BEGIN
  3692. ReleaseIntermediateOperand(res);
  3693. IF IsImmediate(x) & IsImmediate(y) THEN
  3694. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3695. ELSE
  3696. IF ~ReusableRegister(res) THEN
  3697. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3698. ELSE UseIntermediateOperand(res);
  3699. END;
  3700. IF IsImmediate(x) & (x.intValue = 1) THEN
  3701. Emit(Mov(position,res,y))
  3702. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3703. Emit(Mov(position,res,x))
  3704. ELSE
  3705. Emit(Div(position,res, x, y));
  3706. END;
  3707. END;
  3708. END DivInt;
  3709. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3710. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3711. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3712. BEGIN
  3713. type := x.left.type.resolved;
  3714. IF type IS SyntaxTree.StringType THEN
  3715. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3716. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3717. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3718. type := atype;
  3719. x.left.SetType(type);
  3720. END;
  3721. IntermediateCode.InitImmediate(res,addressType,0);
  3722. maxDim := x.parameters.Length()-1;
  3723. FOR i := 0 TO maxDim DO
  3724. e := x.parameters.GetExpression(i);
  3725. Evaluate(e,index);
  3726. Convert(index.op,addressType);
  3727. AddInt(res, res, index.op);
  3728. IF i = 0 THEN
  3729. (*
  3730. ReuseCopy(res, index.op);
  3731. *)
  3732. Designate(x.left,array);
  3733. type := x.left.type.resolved;
  3734. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3735. Dereference(array, type, FALSE);
  3736. END;
  3737. (*
  3738. ELSE AddInt(res, res, index.op);
  3739. *)
  3740. END;
  3741. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3742. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3743. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3744. BoundCheck(index.op, length);
  3745. END;
  3746. ReleaseIntermediateOperand(length);
  3747. END;
  3748. ReleaseOperand(index);
  3749. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3750. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3751. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3752. MulInt(res,res,length);
  3753. END;
  3754. ReleaseIntermediateOperand(length);
  3755. END;
  3756. IF (type IS SyntaxTree.ArrayType) THEN
  3757. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3758. size := StaticSize(system, type);
  3759. IF size # 1 THEN
  3760. length := IntermediateCode.Immediate(addressType,size);
  3761. MulInt(res,res,length);
  3762. END;
  3763. ELSE
  3764. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3765. IF size # 1 THEN
  3766. length := IntermediateCode.Immediate(addressType,size);
  3767. MulInt(res,res,length);
  3768. END;
  3769. END;
  3770. END;
  3771. AddInt(res,res,array.op);
  3772. InitOperand(result,ModeReference);
  3773. result.op := res;
  3774. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3775. ReleaseIntermediateOperand(result.tag);
  3776. result.tag := TypeDescriptorAdr(type);
  3777. IF ~newObjectFile THEN
  3778. IntermediateCode.MakeMemory(result.tag,addressType);
  3779. END
  3780. ELSIF IsDelegate(type) THEN
  3781. ReleaseIntermediateOperand(result.tag);
  3782. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3783. UseIntermediateOperand(result.tag);
  3784. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3785. ReleaseIntermediateOperand(result.tag);
  3786. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3787. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3788. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3789. END;
  3790. ReleaseOperand(array);
  3791. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3792. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3793. END;
  3794. END IndexDesignator;
  3795. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3796. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3797. BEGIN
  3798. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3799. dest := destination; destination := emptyOperand;
  3800. type := x.left.type.resolved;
  3801. IF type IS SyntaxTree.MathArrayType THEN
  3802. MathIndexDesignator(x);
  3803. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3804. IndexDesignator(x);
  3805. END;
  3806. destination := dest;
  3807. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3808. END VisitIndexDesignator;
  3809. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3810. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3811. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3812. procedure: SyntaxTree.Procedure;
  3813. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3814. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3815. BEGIN
  3816. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3817. parameters := expression.parameters;
  3818. moduleName := "FoxArrayBase";
  3819. procedureName := "CopyDescriptor";
  3820. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3821. SaveRegisters();ReleaseUsedRegisters(saved);
  3822. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3823. IF procedure = NIL THEN
  3824. s := "procedure ";
  3825. Strings.Append(s,moduleName);
  3826. Strings.Append(s,".");
  3827. Strings.Append(s,procedureName);
  3828. Strings.Append(s," not present");
  3829. Error(position,s);
  3830. ELSE
  3831. (* push address of temporary variable *)
  3832. Symbol(variable,destOperand);
  3833. Emit(Push(position,destOperand.op));
  3834. ReleaseOperand(destOperand);
  3835. (* push src *)
  3836. Evaluate(expression.left,srcOperand);
  3837. (*
  3838. Dereference(srcOperand,expression.type.resolved);
  3839. Emit(Push(position,srcOperand.tag));
  3840. *)
  3841. Emit(Push(position,srcOperand.op));
  3842. ReleaseOperand(srcOperand);
  3843. tensorFound := FALSE;
  3844. FOR i := 0 TO parameters.Length()-1 DO
  3845. e := parameters.GetExpression(i);
  3846. IF e IS SyntaxTree.TensorRangeExpression THEN
  3847. tensorFound := TRUE;
  3848. ELSIF e IS SyntaxTree.RangeExpression THEN
  3849. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3850. ELSE
  3851. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3852. END;
  3853. END;
  3854. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  3855. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  3856. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  3857. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  3858. StaticCallOperand(procOp,procedure);
  3859. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  3860. ReleaseOperand(procOp);
  3861. END;
  3862. RestoreRegisters(saved);
  3863. END;
  3864. RETURN variable
  3865. END PrepareTensorDescriptor;
  3866. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  3867. VAR
  3868. type, descriptorType, baseType: SyntaxTree.Type;
  3869. operand, tmpOperand, variableOp, variable2Op: Operand;
  3870. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  3871. variable, variable2: SyntaxTree.Variable;
  3872. dim, i, size: LONGINT;
  3873. (* TODO: needed? *)
  3874. oldArrayDestinationTag: IntermediateCode.Operand;
  3875. oldArrayDestinationDimension: LONGINT;
  3876. position: LONGINT;
  3877. saved: RegisterEntry;
  3878. arrayFlags: SET;
  3879. m, n: LONGINT;
  3880. PROCEDURE Pass(op: IntermediateCode.Operand);
  3881. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  3882. BEGIN
  3883. IF numberRegister >= 0 THEN
  3884. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  3885. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  3886. Emit(Mov(position,parameterRegister, op));
  3887. ELSE
  3888. Emit(Push(position,op))
  3889. END
  3890. END Pass;
  3891. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  3892. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  3893. BEGIN
  3894. formalType := formalType.resolved; actualType := actualType.resolved;
  3895. IF IsOpenArray(formalType)THEN
  3896. IF actualType IS SyntaxTree.StringType THEN
  3897. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  3898. RETURN;
  3899. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  3900. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  3901. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  3902. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  3903. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  3904. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3905. ELSE
  3906. tmp := baseReg;
  3907. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  3908. IntermediateCode.MakeMemory(tmp,addressType);
  3909. Pass((tmp));
  3910. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3911. END;
  3912. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  3913. END;
  3914. END PushArrayLens;
  3915. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  3916. BEGIN
  3917. CASE size OF
  3918. |2: INCL(flags,Size2Flag);
  3919. |3: INCL(flags,Size3Flag);
  3920. |4: INCL(flags,Size4Flag);
  3921. |5: INCL(flags,Size5Flag);
  3922. |6: INCL(flags,Size6Flag);
  3923. |7: INCL(flags,Size7Flag);
  3924. |8: INCL(flags,Size8Flag);
  3925. END;
  3926. END SetSmallArraySizeFlag;
  3927. BEGIN
  3928. IF Trace THEN TraceEnter("PushParameter") END;
  3929. position := expression.position;
  3930. IF expression.resolved # NIL THEN expression := expression.resolved END;
  3931. type := expression.type.resolved;
  3932. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  3933. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  3934. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  3935. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  3936. );
  3937. (* TODO: needed? *)
  3938. oldArrayDestinationTag := arrayDestinationTag;
  3939. oldArrayDestinationDimension := arrayDestinationDimension;
  3940. IF IsArrayOfSystemByte(parameter.type) THEN
  3941. Designate(expression,operand);
  3942. tmp := GetArrayOfBytesSize(expression,operand.tag);
  3943. ReleaseIntermediateOperand(operand.tag);
  3944. operand.tag := tmp;
  3945. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3946. Pass((operand.tag));
  3947. END;
  3948. Pass((operand.op));
  3949. ELSIF IsOpenArray(parameter.type) THEN
  3950. Designate(expression,operand);
  3951. baseReg := operand.tag;
  3952. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3953. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  3954. END;
  3955. Pass((operand.op)); (* address of the array *)
  3956. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  3957. (* case 1 *)
  3958. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  3959. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  3960. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3961. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  3962. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  3963. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3964. arrayDestinationTag := sp;
  3965. (* case 1b *)
  3966. IF expression IS SyntaxTree.IndexDesignator THEN
  3967. (*
  3968. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3969. descriptorType := GetMathArrayDescriptorType(dim);
  3970. variable := GetTemporaryVariable(descriptorType,expression.position);
  3971. Symbol(variable,variableOp);
  3972. arrayDestinationTag := variableOp.op;
  3973. *)
  3974. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  3975. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3976. arrayDestinationDimension := dim;
  3977. Designate(expression,operand);
  3978. (* case 1a *)
  3979. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  3980. Designate(expression,operand);
  3981. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  3982. i := 0;
  3983. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  3984. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  3985. INC(i);
  3986. END;
  3987. type := expression.type.resolved;
  3988. WHILE (i<dim) DO (* remaining static dimensions *)
  3989. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3990. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  3991. ReleaseOperand(tmpOperand);
  3992. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3993. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  3994. ReleaseOperand(tmpOperand);
  3995. INC(i);
  3996. END;
  3997. dimOp := IntermediateCode.Immediate(addressType,dim);
  3998. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  3999. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4000. (* case 1d *)
  4001. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4002. Designate(expression,operand);
  4003. Dereference(operand,type.resolved,FALSE);
  4004. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4005. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4006. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4007. (* case 1f *)
  4008. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4009. Designate(expression,operand);
  4010. FOR i := 0 TO dim-1 DO
  4011. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4012. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4013. ReleaseOperand(tmpOperand);
  4014. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4015. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4016. ReleaseOperand(tmpOperand);
  4017. END;
  4018. (*******
  4019. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4020. *)
  4021. arrayFlags := {StaticFlag};
  4022. IF dim = 1 THEN
  4023. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4024. ReleaseOperand(tmpOperand);
  4025. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4026. m := LONGINT(tmpOperand.op.intValue);
  4027. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4028. ELSIF dim = 2 THEN
  4029. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4030. ReleaseOperand(tmpOperand);
  4031. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4032. m := LONGINT(tmpOperand.op.intValue);
  4033. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4034. ReleaseOperand(tmpOperand);
  4035. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4036. n := LONGINT(tmpOperand.op.intValue);
  4037. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4038. INCL(arrayFlags,SmallMatrixFlag);
  4039. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4040. END;
  4041. END;
  4042. (*******)
  4043. dimOp := IntermediateCode.Immediate(addressType,dim);
  4044. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4045. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4046. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4047. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4048. baseType := SemanticChecker.ArrayBase(type,dim);
  4049. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4050. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4051. ELSE HALT(100);
  4052. END;
  4053. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4054. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4055. (* case 2b *)
  4056. IF expression IS SyntaxTree.IndexDesignator THEN
  4057. descriptorType := GetMathArrayDescriptorType(dim);
  4058. variable := GetTemporaryVariable(descriptorType, FALSE);
  4059. Symbol(variable,variableOp);
  4060. arrayDestinationTag := variableOp.op;
  4061. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4062. arrayDestinationDimension := dim;
  4063. NeedDescriptor := TRUE;
  4064. Designate(expression,operand);
  4065. Pass((operand.tag));
  4066. NeedDescriptor := FALSE;
  4067. (* case 2a *)
  4068. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4069. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4070. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4071. INC(i);
  4072. END;
  4073. IF i = dim THEN
  4074. Designate(expression,operand);
  4075. Pass((operand.tag));
  4076. ELSE (* open-static *)
  4077. type := expression.type.resolved;
  4078. descriptorType := GetMathArrayDescriptorType(dim);
  4079. variable := GetTemporaryVariable(descriptorType, FALSE);
  4080. Symbol(variable,variableOp);
  4081. arrayDestinationTag := variableOp.op;
  4082. Designate(expression,operand);
  4083. FOR i := 0 TO dim-1 DO
  4084. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4085. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4086. ReleaseOperand(tmpOperand);
  4087. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4088. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4089. ReleaseOperand(tmpOperand);
  4090. END;
  4091. dimOp := IntermediateCode.Immediate(addressType,dim);
  4092. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4093. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4094. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4095. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4096. baseType := SemanticChecker.ArrayBase(type,dim);
  4097. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4098. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4099. Pass((arrayDestinationTag));
  4100. END;
  4101. (* case 2d *)
  4102. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4103. Designate(expression,operand);
  4104. Dereference(operand,type.resolved,FALSE);
  4105. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4106. Pass((operand.tag));
  4107. (* case 2f *)
  4108. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4109. descriptorType := GetMathArrayDescriptorType(dim);
  4110. variable := GetTemporaryVariable(descriptorType, FALSE);
  4111. Symbol(variable,variableOp);
  4112. arrayDestinationTag := variableOp.op;
  4113. Designate(expression,operand);
  4114. FOR i := 0 TO dim-1 DO
  4115. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4116. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4117. ReleaseOperand(tmpOperand);
  4118. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4119. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4120. ReleaseOperand(tmpOperand);
  4121. END;
  4122. (*
  4123. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4124. *)
  4125. arrayFlags := {StaticFlag};
  4126. IF dim = 1 THEN
  4127. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4128. ReleaseOperand(tmpOperand);
  4129. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4130. m := LONGINT(tmpOperand.op.intValue);
  4131. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4132. ELSIF dim = 2 THEN
  4133. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4134. ReleaseOperand(tmpOperand);
  4135. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4136. m := LONGINT(tmpOperand.op.intValue);
  4137. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4138. ReleaseOperand(tmpOperand);
  4139. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4140. n := LONGINT(tmpOperand.op.intValue);
  4141. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4142. INCL(arrayFlags,SmallMatrixFlag);
  4143. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4144. END;
  4145. END;
  4146. (*******)
  4147. dimOp := IntermediateCode.Immediate(addressType,dim);
  4148. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4149. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4150. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4151. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4152. baseType := SemanticChecker.ArrayBase(type,dim);
  4153. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4154. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4155. Pass((arrayDestinationTag));
  4156. ELSE HALT(100);
  4157. END;
  4158. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4159. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4160. (* case 3b *)
  4161. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4162. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4163. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4164. Symbol(variable,variableOp);
  4165. LoadValue(variableOp,system.addressType);
  4166. ELSE
  4167. descriptorType := GetMathArrayDescriptorType(dim);
  4168. variable := GetTemporaryVariable(descriptorType, FALSE);
  4169. Symbol(variable,variableOp);
  4170. END;
  4171. arrayDestinationTag := variableOp.op;
  4172. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4173. arrayDestinationDimension := 0;
  4174. Designate(expression,operand);
  4175. Pass((operand.tag));
  4176. (* case 3a *)
  4177. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4178. i := 0;
  4179. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4180. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4181. INC(i);
  4182. END;
  4183. IF i = dim THEN
  4184. Designate(expression,operand);
  4185. Pass((operand.tag));
  4186. ELSE (* open-static *)
  4187. type := expression.type.resolved;
  4188. descriptorType := GetMathArrayDescriptorType(dim);
  4189. variable := GetTemporaryVariable(descriptorType, FALSE);
  4190. Symbol(variable,variableOp);
  4191. arrayDestinationTag := variableOp.op;
  4192. Designate(expression,operand);
  4193. FOR i := 0 TO dim-1 DO
  4194. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4195. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4196. ReleaseOperand(tmpOperand);
  4197. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4198. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4199. ReleaseOperand(tmpOperand);
  4200. END;
  4201. dimOp := IntermediateCode.Immediate(addressType,dim);
  4202. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4203. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4204. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4205. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4206. baseType := SemanticChecker.ArrayBase(type,dim);
  4207. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4208. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4209. Pass((arrayDestinationTag));
  4210. END;
  4211. (* case 3d *)
  4212. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4213. Designate(expression,operand);
  4214. Dereference(operand,type.resolved,FALSE);
  4215. (*
  4216. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4217. *)
  4218. Pass((operand.tag));
  4219. (* case 3f *)
  4220. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4221. descriptorType := GetMathArrayDescriptorType(dim);
  4222. variable := GetTemporaryVariable(descriptorType, FALSE);
  4223. Symbol(variable,variableOp);
  4224. arrayDestinationTag := variableOp.op;
  4225. Designate(expression,operand);
  4226. IF operand.op.type.length >1 THEN (* vector register *)
  4227. variable2 := GetTemporaryVariable(type, FALSE);
  4228. Symbol(variable2, variable2Op);
  4229. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4230. Emit(Mov(position,tmp, operand.op));
  4231. ReleaseOperand(operand);
  4232. Symbol(variable2, operand);
  4233. END;
  4234. FOR i := 0 TO dim-1 DO
  4235. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4236. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4237. ReleaseOperand(tmpOperand);
  4238. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4239. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4240. ReleaseOperand(tmpOperand);
  4241. END;
  4242. dimOp := IntermediateCode.Immediate(addressType,dim);
  4243. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4244. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4245. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4246. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4247. baseType := SemanticChecker.ArrayBase(type,dim);
  4248. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4249. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4250. Pass((arrayDestinationTag));
  4251. ELSE HALT(100);
  4252. END;
  4253. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4254. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4255. (* case 4b *)
  4256. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4257. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4258. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4259. Symbol(variable,variableOp);
  4260. LoadValue(variableOp,system.addressType);
  4261. ELSE
  4262. descriptorType := GetMathArrayDescriptorType(dim);
  4263. variable := GetTemporaryVariable(descriptorType, FALSE);
  4264. Symbol(variable,variableOp);
  4265. END;
  4266. arrayDestinationTag := variableOp.op;
  4267. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4268. arrayDestinationDimension := 0;
  4269. Designate(expression,operand);
  4270. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4271. Symbol(variable,variableOp);
  4272. ELSE
  4273. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4274. Symbol(variable,variableOp);
  4275. MakeMemory(tmp,variableOp.op,addressType,0);
  4276. Emit(Mov(position,tmp,operand.tag));
  4277. ReleaseIntermediateOperand(tmp);
  4278. END;
  4279. Pass((variableOp.op));
  4280. ReleaseOperand(variableOp);
  4281. (* case 4a *)
  4282. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4283. i := 0;
  4284. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4285. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4286. INC(i);
  4287. END;
  4288. IF i = dim THEN
  4289. Designate(expression,operand);
  4290. arrayDestinationTag := operand.tag;
  4291. ELSE (* open-static *)
  4292. type := expression.type.resolved;
  4293. descriptorType := GetMathArrayDescriptorType(dim);
  4294. variable := GetTemporaryVariable(descriptorType, FALSE);
  4295. Symbol(variable,variableOp);
  4296. arrayDestinationTag := variableOp.op;
  4297. Designate(expression,operand);
  4298. FOR i := 0 TO dim-1 DO
  4299. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4300. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4301. ReleaseOperand(tmpOperand);
  4302. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4303. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4304. ReleaseOperand(tmpOperand);
  4305. END;
  4306. dimOp := IntermediateCode.Immediate(addressType,dim);
  4307. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4308. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4309. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4310. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4311. baseType := SemanticChecker.ArrayBase(type,dim);
  4312. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4313. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4314. END;
  4315. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4316. Symbol(variable,variableOp);
  4317. MakeMemory(tmp,variableOp.op,addressType,0);
  4318. Emit(Mov(position,tmp,arrayDestinationTag));
  4319. ReleaseIntermediateOperand(tmp);
  4320. Pass((variableOp.op));
  4321. ReleaseOperand(variableOp);
  4322. (* case 4d *)
  4323. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4324. Designate(expression,operand);
  4325. (*
  4326. Dereference(operand,type.resolved,FALSE);
  4327. *)
  4328. (*
  4329. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4330. *)
  4331. Pass((operand.op));
  4332. (* case 4f *)
  4333. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4334. descriptorType := GetMathArrayDescriptorType(dim);
  4335. variable := GetTemporaryVariable(descriptorType, FALSE);
  4336. Symbol(variable,variableOp);
  4337. arrayDestinationTag := variableOp.op;
  4338. Designate(expression,operand);
  4339. FOR i := 0 TO dim-1 DO
  4340. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4341. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4342. ReleaseOperand(tmpOperand);
  4343. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4344. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4345. ReleaseOperand(tmpOperand);
  4346. END;
  4347. dimOp := IntermediateCode.Immediate(addressType,dim);
  4348. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4349. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4350. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4351. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4352. baseType := SemanticChecker.ArrayBase(type,dim);
  4353. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4354. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4355. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4356. Symbol(variable,variableOp);
  4357. MakeMemory(tmp,variableOp.op,addressType,0);
  4358. Emit(Mov(position,tmp,arrayDestinationTag));
  4359. ReleaseIntermediateOperand(tmp);
  4360. Pass((variableOp.op));
  4361. ReleaseOperand(variableOp);
  4362. ELSE HALT(100);
  4363. END;
  4364. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4365. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4366. Designate(expression,operand);
  4367. IF operand.op.type.length > 1 THEN
  4368. Emit(Push(position, operand.op));
  4369. ReleaseOperand(operand);
  4370. ELSE
  4371. size := system.SizeOf(type);
  4372. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4373. size := ToMemoryUnits(system,size);
  4374. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4375. arrayDestinationTag := sp;
  4376. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4377. END;
  4378. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4379. Designate(expression,operand);
  4380. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4381. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4382. Symbol(variable,variableOp);
  4383. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4384. Emit(Mov(position,tmp,operand.op));
  4385. Emit(Push(position,variableOp.op));
  4386. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4387. Pass((operand.op));
  4388. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4389. END;
  4390. ELSE HALT(200)
  4391. END;
  4392. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4393. IF parameter.kind = SyntaxTree.VarParameter THEN
  4394. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4395. Designate(expression, operand);
  4396. Pass((operand.op));
  4397. ELSE
  4398. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4399. Evaluate(expression, operand);
  4400. Pass((operand.extra)); (* step *)
  4401. Pass((operand.tag)); (* last *)
  4402. Pass((operand.op)) (* first *)
  4403. END
  4404. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4405. IF parameter.kind = SyntaxTree.VarParameter THEN
  4406. Designate(expression, operand);
  4407. Pass((operand.op));
  4408. ELSE
  4409. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4410. Evaluate(expression, operand);
  4411. Pass((operand.tag)); (* real part *)
  4412. Pass((operand.op)) (* imaginary part *)
  4413. END
  4414. ELSE
  4415. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4416. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4417. Designate(expression,operand);
  4418. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4419. (* stack allocation *)
  4420. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4421. (*! parameter alignment to be discussed ... *)
  4422. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4423. size := type(SyntaxTree.StringType).length;
  4424. END;
  4425. IF backend.cooperative & parameter.NeedsTrace() THEN
  4426. dst := NewRegisterOperand (addressType);
  4427. Emit(Mov(position,dst, sp));
  4428. IntermediateCode.InitImmediate(null, byteType, 0);
  4429. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4430. ReleaseIntermediateOperand(dst);
  4431. SaveRegisters();ReleaseUsedRegisters(saved);
  4432. (* register dst has been freed before SaveRegisters already *)
  4433. CallAssignMethod(dst, operand.op, parameter.type);
  4434. RestoreRegisters(saved);
  4435. END;
  4436. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4437. ELSIF IsOpenArray(parameter.type) THEN
  4438. Designate(expression,operand);
  4439. baseReg := operand.tag;
  4440. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4441. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4442. END;
  4443. Pass((operand.op)); (* address of the array *)
  4444. ELSIF IsDelegate(parameter.type) THEN
  4445. Evaluate(expression,operand);
  4446. IF backend.cooperative & parameter.NeedsTrace() THEN
  4447. Emit(Push(position, nil));
  4448. dst := NewRegisterOperand (addressType);
  4449. Emit(Mov(position,dst, sp));
  4450. ReleaseIntermediateOperand(dst);
  4451. SaveRegisters();ReleaseUsedRegisters(saved);
  4452. Emit(Push(position, dst));
  4453. (* register dst has been freed before SaveRegisters already *)
  4454. Emit(Push(position, operand.tag));
  4455. CallThis(position,"GarbageCollector","Assign",2);
  4456. RestoreRegisters(saved);
  4457. ELSE
  4458. Pass((operand.tag));
  4459. END;
  4460. Pass((operand.op));
  4461. ELSE
  4462. Evaluate(expression,operand);
  4463. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4464. Emit(Push(position, nil));
  4465. dst := NewRegisterOperand (addressType);
  4466. Emit(Mov(position,dst, sp));
  4467. ReleaseIntermediateOperand(dst);
  4468. SaveRegisters();ReleaseUsedRegisters(saved);
  4469. Emit(Push(position, dst));
  4470. (* register dst has been freed before SaveRegisters already *)
  4471. Emit(Push(position, operand.op));
  4472. CallThis(position,"GarbageCollector","Assign",2);
  4473. RestoreRegisters(saved);
  4474. ELSE
  4475. Pass((operand.op));
  4476. END;
  4477. END;
  4478. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4479. Evaluate(expression,operand);
  4480. Pass((operand.op));
  4481. ELSE (* var parameter *)
  4482. Designate(expression,operand);
  4483. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4484. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4485. Pass((operand.tag));
  4486. END;
  4487. END;
  4488. Pass((operand.op));
  4489. END;
  4490. END;
  4491. (* TODO: needed? *)
  4492. arrayDestinationTag := oldArrayDestinationTag;
  4493. arrayDestinationDimension := oldArrayDestinationDimension;
  4494. IF needsParameterBackup THEN
  4495. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4496. ReuseCopy(parameterBackup, operand.op)
  4497. END;
  4498. ReleaseOperand(operand);
  4499. IF Trace THEN TraceExit("PushParameter") END;
  4500. END PushParameter;
  4501. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4502. VAR prevConditional: BOOLEAN;
  4503. BEGIN
  4504. prevConditional := conditional;
  4505. conditional := FALSE;
  4506. 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
  4507. Expression(x.result); (* use register *)
  4508. END;
  4509. Statement(x.statement);
  4510. conditional := prevConditional;
  4511. IF x.result # NIL THEN Expression(x.result) END;
  4512. 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
  4513. ReleaseIntermediateOperand(result.op);
  4514. END;
  4515. END VisitStatementDesignator;
  4516. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4517. VAR
  4518. procedure: SyntaxTree.Procedure;
  4519. procedureType: SyntaxTree.ProcedureType;
  4520. wasInline: BOOLEAN;
  4521. actualParameters: SyntaxTree.ExpressionList;
  4522. formalParameter: SyntaxTree.Parameter;
  4523. actualParameter: SyntaxTree.Expression;
  4524. i: LONGINT;
  4525. localVariable: SyntaxTree.Variable;
  4526. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4527. src, dest: Operand;
  4528. prevInlineExit : Label;
  4529. prevMapper: SymbolMapper;
  4530. tooComplex: BOOLEAN;
  4531. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4532. BEGIN
  4533. IF e = NIL THEN RETURN TRUE
  4534. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4535. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4536. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4537. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4538. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4539. ELSE RETURN FALSE
  4540. END;
  4541. END SimpleExpression;
  4542. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4543. BEGIN
  4544. RETURN checker.CanPassInRegister(type)
  4545. END FitsInRegister;
  4546. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4547. VAR
  4548. variable: SyntaxTree.Variable;
  4549. variableDesignator: SyntaxTree.Designator;
  4550. BEGIN
  4551. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4552. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4553. variableDesignator.SetType(type);
  4554. RETURN variableDesignator
  4555. END GetTemp;
  4556. BEGIN
  4557. wasInline := currentIsInline;
  4558. prevInlineExit := currentInlineExit;
  4559. prevMapper := currentMapper;
  4560. currentInlineExit := NewLabel();
  4561. tooComplex := FALSE;
  4562. NEW(currentMapper);
  4563. currentIsInline := TRUE;
  4564. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4565. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4566. formalParameter := procedureType.firstParameter;
  4567. actualParameters := x.parameters;
  4568. i := 0;
  4569. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4570. actualParameter := actualParameters.GetExpression(i);
  4571. IF actualParameter.resolved # NIL THEN
  4572. actualParameter := actualParameter.resolved
  4573. END;
  4574. (*
  4575. if expression is simple and can be passed immediately
  4576. or if type fits in register then we can proceed
  4577. otherwise we escape to ordinary procedure call.
  4578. *)
  4579. (* cases where the expression can be mapped identically *)
  4580. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4581. currentMapper.Add(formalParameter, actualParameter, NIL);
  4582. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4583. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4584. (*
  4585. Assign(variableDesignator, actualParameter);
  4586. *)
  4587. Evaluate(actualParameter, src);
  4588. Designate(variableDesignator, dest);
  4589. Emit(Mov(x.position, dest.op, src.op));
  4590. ReleaseOperand(dest);
  4591. ReleaseOperand(src);
  4592. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4593. ELSE tooComplex := TRUE
  4594. END;
  4595. (*
  4596. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4597. currentMapper.Add(formalParameter, actualParameter, NIL);
  4598. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4599. variableDesignator := GetTemp(system.addressType, FALSE);
  4600. Designate(actualParameter, src);
  4601. Designate(variableDesignator, dest);
  4602. IntermediateCode.MakeMemory(dest.op,addressType);
  4603. Emit(Mov(x.position, dest.op, src.op));
  4604. ReleaseOperand(dest);
  4605. IF src.tag.mode # IntermediateCode.Undefined THEN
  4606. tagDesignator := GetTemp(system.addressType, FALSE);
  4607. Designate(tagDesignator, dest);
  4608. IntermediateCode.MakeMemory(dest.op,addressType);
  4609. Emit(Mov(x.position, dest.op, src.op));
  4610. END;
  4611. ReleaseOperand(dest); ReleaseOperand(src);
  4612. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4613. END;
  4614. *)
  4615. formalParameter := formalParameter.nextParameter;
  4616. INC(i);
  4617. END;
  4618. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4619. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4620. currentMapper.Add(NIL, returnDesignator, NIL);
  4621. END;
  4622. localVariable := procedure.procedureScope.firstVariable;
  4623. WHILE ~tooComplex & (localVariable # NIL) DO
  4624. variableDesignator := GetTemp(localVariable.type, FALSE);
  4625. currentMapper.Add(localVariable, variableDesignator, NIL);
  4626. localVariable := localVariable.nextVariable;
  4627. END;
  4628. IF ~tooComplex THEN
  4629. VisitStatementBlock(procedure.procedureScope.body);
  4630. SetLabel(currentInlineExit);
  4631. IF procedureType.returnType # NIL THEN
  4632. Designate(returnDesignator, result);
  4633. IF conditional THEN
  4634. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4635. ValueToCondition(result)
  4636. END;
  4637. END;
  4638. END;
  4639. currentMapper := prevMapper;
  4640. currentInlineExit := prevInlineExit;
  4641. currentIsInline := wasInline;
  4642. RETURN ~tooComplex
  4643. END InlineProcedureCall;
  4644. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4645. VAR
  4646. parameters: SyntaxTree.ExpressionList;
  4647. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4648. designator: SyntaxTree.Designator;
  4649. procedureType: SyntaxTree.ProcedureType;
  4650. formalParameter: SyntaxTree.Parameter;
  4651. operand, returnValue: Operand;
  4652. reg, size, mask, dest: IntermediateCode.Operand;
  4653. saved: RegisterEntry;
  4654. symbol: SyntaxTree.Symbol;
  4655. variable: SyntaxTree.Variable;
  4656. i, parametersSize, returnTypeSize : LONGINT;
  4657. structuredReturnType: BOOLEAN;
  4658. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4659. tempVariableDesignator: SyntaxTree.Designator;
  4660. gap, alignment: LONGINT; (*fld*)
  4661. (* TODO: remove unnecessary backup variables *)
  4662. oldResult: Operand;
  4663. oldCurrentScope: SyntaxTree.Scope;
  4664. oldArrayDestinationTag: IntermediateCode.Operand;
  4665. oldArrayDestinationDimension: LONGINT;
  4666. oldConstantDeclaration: SyntaxTree.Symbol;
  4667. oldDestination: IntermediateCode.Operand;
  4668. oldCurrentLoop: Label;
  4669. oldConditional: BOOLEAN;
  4670. oldTrueLabel, oldFalseLabel: Label;
  4671. oldLocked: BOOLEAN;
  4672. usedRegisters,oldUsedRegisters: RegisterEntry;
  4673. return: IntermediateCode.Operand;
  4674. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4675. arg: IntermediateCode.Operand;
  4676. dummy: IntermediateCode.Operand;
  4677. recordType: SyntaxTree.RecordType;
  4678. operatorSelectionProcedureOperand: Operand;
  4679. operatorSelectionProcedure: SyntaxTree.Procedure;
  4680. fingerPrint: SyntaxTree.FingerPrint;
  4681. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4682. identifierNumber: LONGINT;
  4683. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4684. procedure: SyntaxTree.Procedure;
  4685. PROCEDURE BackupGlobalState;
  4686. BEGIN
  4687. oldResult := result;
  4688. oldCurrentScope := currentScope;
  4689. oldArrayDestinationTag := arrayDestinationTag;
  4690. oldArrayDestinationDimension := arrayDestinationDimension;
  4691. oldConstantDeclaration := constantDeclaration;
  4692. oldDestination := destination;
  4693. oldCurrentLoop := currentLoop;
  4694. oldConditional := conditional;
  4695. oldTrueLabel := trueLabel;
  4696. oldFalseLabel := falseLabel;
  4697. oldLocked := locked;
  4698. oldUsedRegisters := usedRegisters
  4699. END BackupGlobalState;
  4700. PROCEDURE RestoreGlobalState;
  4701. BEGIN
  4702. result := oldResult;
  4703. currentScope := oldCurrentScope;
  4704. arrayDestinationTag := oldArrayDestinationTag;
  4705. arrayDestinationDimension := oldArrayDestinationDimension;
  4706. constantDeclaration := oldConstantDeclaration;
  4707. destination := oldDestination;
  4708. currentLoop := oldCurrentLoop;
  4709. conditional := oldConditional;
  4710. trueLabel := oldTrueLabel;
  4711. falseLabel := oldFalseLabel;
  4712. locked := oldLocked;
  4713. usedRegisters := oldUsedRegisters
  4714. END RestoreGlobalState;
  4715. (** do preparations before parameter push for array-structured object types (ASOTs):
  4716. if ASOT is passed as VAR parameter:
  4717. - allocate temporary variable of math array type
  4718. - copy contents of ASOT to be passed to temporary variable
  4719. - use temporary variable as the actual parameter instead
  4720. - 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)
  4721. **)
  4722. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4723. VAR
  4724. expression: SyntaxTree.Expression;
  4725. BEGIN
  4726. IF actualParameter IS SyntaxTree.Designator THEN
  4727. designator := actualParameter(SyntaxTree.Designator);
  4728. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4729. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4730. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4731. ASSERT(checker # NIL);
  4732. checker.SetCurrentScope(currentScope);
  4733. (* allocate temporary variable *)
  4734. ASSERT(actualParameter.type # NIL);
  4735. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4736. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4737. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4738. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4739. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4740. ASSERT(tempVariableDesignator.type # NIL);
  4741. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4742. (* copy math array stored in actual parameter to temporary variable *)
  4743. BackupGlobalState;
  4744. AssignMathArray(tempVariableDesignator, actualParameter);
  4745. RestoreGlobalState;
  4746. (* use temporary variable as actual parameter instead of the original one *)
  4747. actualParameter := tempVariableDesignator;
  4748. (* create write-back call and store it in linked list *)
  4749. (* create new list entry *)
  4750. IF firstWriteBackCall = NIL THEN
  4751. NEW(firstWriteBackCall);
  4752. currentWriteBackCall := firstWriteBackCall
  4753. ELSE
  4754. ASSERT(currentWriteBackCall # NIL);
  4755. NEW(currentWriteBackCall.next);
  4756. currentWriteBackCall := currentWriteBackCall.next
  4757. END;
  4758. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4759. ASSERT(expression.type = NIL);
  4760. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4761. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4762. (* prepare writeback for any other "normal" indexer *)
  4763. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4764. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4765. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4766. Assign(tempVariableDesignator, actualParameter);
  4767. actualParameter := tempVariableDesignator;
  4768. IF firstWriteBackCall = NIL THEN
  4769. NEW(firstWriteBackCall);
  4770. currentWriteBackCall := firstWriteBackCall
  4771. ELSE
  4772. ASSERT(currentWriteBackCall # NIL);
  4773. NEW(currentWriteBackCall.next);
  4774. currentWriteBackCall := currentWriteBackCall.next
  4775. END;
  4776. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4777. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4778. END
  4779. END
  4780. END PrepareParameter;
  4781. BEGIN
  4782. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4783. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4784. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4785. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4786. IF InlineProcedureCall(x) THEN
  4787. RETURN
  4788. ELSE
  4789. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4790. END
  4791. END;
  4792. END;
  4793. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4794. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4795. dest := destination; destination := emptyOperand;
  4796. SaveRegisters();ReleaseUsedRegisters(saved);
  4797. parameters := x.parameters;
  4798. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4799. (* an operator is called *)
  4800. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4801. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4802. (* check if a dynamic operator call should be performed *)
  4803. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4804. ELSE
  4805. isCallOfDynamicOperator := FALSE
  4806. END;
  4807. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4808. Emit(Push(position, ap));
  4809. END;
  4810. alignment := procedureType.stackAlignment;
  4811. IF alignment > 1 THEN
  4812. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4813. Emit(Mov(position,reg, sp));
  4814. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4815. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4816. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4817. Emit(And(position,sp, sp, mask));
  4818. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4819. Emit(Push(position,reg));
  4820. (*
  4821. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4822. Emit(Mov(position,mem,reg));
  4823. *)
  4824. ReleaseIntermediateOperand(reg);
  4825. END;
  4826. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4827. IntermediateCode.InitImmediate(mask,addressType,-16);
  4828. Emit(And(position,sp, sp, mask));
  4829. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4830. IF gap # 0 THEN
  4831. IntermediateCode.InitImmediate(size,addressType,gap);
  4832. Emit(Sub(position,sp,sp,size))
  4833. END;
  4834. END;
  4835. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4836. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4837. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4838. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4839. ELSE
  4840. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4841. END;
  4842. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4843. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  4844. (* push ID *)
  4845. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4846. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  4847. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  4848. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  4849. formalParameter := procedureType.firstParameter;
  4850. FOR i := 0 TO parameters.Length() - 1 DO
  4851. IF formalParameter.access # SyntaxTree.Hidden THEN
  4852. ASSERT(i < 2);
  4853. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  4854. (* push pointer *)
  4855. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4856. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  4857. (* add dereference *)
  4858. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4859. ReleaseIntermediateOperand(parameterBackups[i]);
  4860. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  4861. END;
  4862. Emit(Push(position,parameterBackups[i]));
  4863. ReleaseIntermediateOperand(parameterBackups[i]);
  4864. (* push typetag *)
  4865. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4866. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  4867. arg := TypeDescriptorAdr(recordType);
  4868. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  4869. Emit(Push(position,arg));
  4870. ELSE
  4871. (* push 'NonPointer' *)
  4872. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4873. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4874. (* push fingerprint *)
  4875. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4876. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  4877. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  4878. END
  4879. END;
  4880. formalParameter := formalParameter.nextParameter
  4881. END;
  4882. (* for unary operators: complete the information for the second parameter *)
  4883. IF procedureType.numberParameters < 2 THEN
  4884. (* push 'NonPointer' *)
  4885. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4886. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4887. (* push 'NoType' *)
  4888. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4889. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  4890. END;
  4891. (* call operator selection procedure *)
  4892. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  4893. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  4894. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  4895. ReleaseOperand(operatorSelectionProcedureOperand);
  4896. (* use the address that the operator selection procedure returned as the target address of the call *)
  4897. InitOperand(operand, ModeValue);
  4898. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4899. Emit(Result(position,operand.op))
  4900. END
  4901. ELSE
  4902. Evaluate(x.left, operand)
  4903. END;
  4904. IF symbol IS SyntaxTree.Procedure THEN
  4905. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4906. Emit(Push(position,operand.tag));
  4907. ELSIF (procedureType.isDelegate) THEN
  4908. Emit(Push(position,operand.tag));
  4909. END;
  4910. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4911. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  4912. Emit(Push(position,operand.tag));
  4913. END;
  4914. ELSE HALT(200);
  4915. END;
  4916. ReleaseIntermediateOperand(operand.tag);
  4917. operand.tag := emptyOperand;
  4918. (* determine if a structured return type is needed *)
  4919. structuredReturnType := StructuredReturnType(procedureType);
  4920. IF structuredReturnType THEN
  4921. IF resultDesignator # NIL THEN
  4922. d := resultDesignator;
  4923. ELSE
  4924. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  4925. variable.SetUntraced(procedureType.hasUntracedReturn);
  4926. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  4927. d.SetType(variable.type);
  4928. END;
  4929. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  4930. Designate(d,returnValue);
  4931. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  4932. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  4933. Emit(Push(position,size));
  4934. Emit(Push(position,returnValue.op));
  4935. ReleaseOperand(returnValue);
  4936. ELSE
  4937. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  4938. END;
  4939. END;
  4940. firstWriteBackCall := NIL; (* reset write-back call list *)
  4941. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  4942. passByRegister := system.registerParameters > 0;
  4943. registerNumber := 0;
  4944. formalParameter := procedureType.lastParameter;
  4945. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  4946. actualParameter := parameters.GetExpression(i);
  4947. PrepareParameter(actualParameter, formalParameter);
  4948. IF passByRegister & (i < system.registerParameters) THEN
  4949. IF ~PassInRegister(formalParameter) THEN
  4950. Error(actualParameter.position,"cannot be passed by register")
  4951. ELSE
  4952. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  4953. END;
  4954. INC(registerNumber);
  4955. ELSE
  4956. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4957. END;
  4958. formalParameter := formalParameter.prevParameter;
  4959. END;
  4960. IF passByRegister & (registerNumber > 0) THEN
  4961. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  4962. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4963. END;
  4964. ELSE
  4965. hasDynamicOperands := FALSE;
  4966. formalParameter := procedureType.firstParameter;
  4967. FOR i := 0 TO parameters.Length() - 1 DO
  4968. actualParameter := parameters.GetExpression(i);
  4969. IF formalParameter # NIL THEN (* TENTATIVE *)
  4970. PrepareParameter(actualParameter, formalParameter);
  4971. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  4972. ASSERT(i < 2);
  4973. hasDynamicOperands := TRUE;
  4974. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  4975. ELSE
  4976. IF passByRegister & (registerNumber > 0) THEN
  4977. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  4978. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4979. END;
  4980. passByRegister := FALSE;
  4981. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4982. END;
  4983. formalParameter := formalParameter.nextParameter;
  4984. END;
  4985. END;
  4986. END;
  4987. IF symbol IS SyntaxTree.Procedure THEN
  4988. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  4989. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  4990. Emit(Push(position,reg));
  4991. ReleaseIntermediateOperand(reg);
  4992. END;
  4993. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  4994. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4995. parametersSize := ParametersSize(system,procedureType,FALSE);
  4996. END;
  4997. ReleaseParameterRegisters();
  4998. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  4999. Emit(Call(position,operand.op,0));
  5000. ELSE
  5001. Emit(Call(position,operand.op,parametersSize));
  5002. END;
  5003. ReleaseOperand(operand);
  5004. IF procedureType.noReturn THEN
  5005. EmitTrap(position,NoReturnTrap);
  5006. END;
  5007. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5008. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5009. Emit(Result(position,return));
  5010. END;
  5011. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  5012. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  5013. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5014. END;
  5015. size := IntermediateCode.Immediate(addressType,parametersSize);
  5016. Emit(Add(position,sp,sp,size));
  5017. END;
  5018. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5019. IF structuredReturnType THEN
  5020. (* stack pointer rewinding done by callee
  5021. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5022. Emit(Add(position,sp,sp,size));
  5023. *)
  5024. RestoreRegisters(saved);
  5025. InitOperand(result,ModeReference);
  5026. Symbol(variable,result);
  5027. ELSE
  5028. RestoreRegisters(saved);
  5029. InitOperand(result,ModeValue);
  5030. result.op := return;
  5031. END;
  5032. END;
  5033. IF alignment > 1 THEN
  5034. Emit(Pop(position,sp));
  5035. END;
  5036. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5037. Emit(Pop(position, ap));
  5038. END;
  5039. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5040. ValueToCondition(result);
  5041. END;
  5042. destination := dest;
  5043. (* perform all write-back calls in the list *)
  5044. BackupGlobalState;
  5045. currentWriteBackCall := firstWriteBackCall;
  5046. WHILE currentWriteBackCall # NIL DO
  5047. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5048. currentWriteBackCall := currentWriteBackCall.next
  5049. END;
  5050. RestoreGlobalState;
  5051. (* TENATIVE *)
  5052. (*
  5053. IF isOperatorCall THEN
  5054. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5055. END;
  5056. *)
  5057. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5058. END VisitProcedureCallDesignator;
  5059. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5060. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5061. td: SyntaxTree.Symbol;
  5062. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5063. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5064. BEGIN
  5065. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5066. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5067. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5068. variable.SetType(system.anyType);
  5069. scope.AddVariable(variable);
  5070. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5071. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5072. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5073. typeDeclaration.SetScope(module.module.moduleScope);
  5074. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5075. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5076. END;
  5077. RETURN hiddenPointerType;
  5078. END GetHiddenPointerType;
  5079. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5080. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5081. BEGIN
  5082. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5083. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5084. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5085. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5086. scope.AddVariable(variable);
  5087. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5088. variable.SetType(system.anyType);
  5089. scope.AddVariable(variable);
  5090. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5091. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5092. typeDeclaration.SetDeclaredType(delegatePointerType);
  5093. typeDeclaration.SetScope(module.module.moduleScope);
  5094. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5095. delegatePointerType.SetState(SyntaxTree.Resolved);
  5096. END;
  5097. RETURN delegatePointerType
  5098. END GetDelegateType;
  5099. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5100. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5101. such as in VAR a: RECORD ... END;
  5102. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5103. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5104. *)
  5105. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5106. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5107. BEGIN (* no code emission *)
  5108. source := NIL;
  5109. x := x.resolved;
  5110. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5111. x := GetHiddenPointerType();
  5112. ELSIF IsDelegate(x) THEN
  5113. x := GetDelegateType();
  5114. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5115. ELSE HALT(200);
  5116. END;
  5117. td := x.typeDeclaration;
  5118. IF td = NIL THEN
  5119. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5120. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5121. ASSERT(td # NIL);
  5122. END;
  5123. IF newObjectFile THEN
  5124. GetCodeSectionNameForSymbol(td,name);
  5125. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5126. meta.CheckTypeDeclaration(x);
  5127. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5128. ELSE
  5129. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5130. END;
  5131. IF backend.cooperative OR meta.simple THEN
  5132. offset := 0;
  5133. ELSE
  5134. IF x IS SyntaxTree.CellType THEN
  5135. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5136. IF baseRecord = NIL THEN
  5137. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5138. ELSE
  5139. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5140. END;
  5141. ELSE
  5142. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5143. END;
  5144. END;
  5145. ELSE
  5146. offset := 0;
  5147. source := module.allSections.FindBySymbol(td); (*TODO*)
  5148. IF source = NIL THEN
  5149. null := 0;
  5150. GetCodeSectionNameForSymbol(td,name);
  5151. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5152. IntermediateCode.InitImmediate(op,addressType,0);
  5153. source(IntermediateCode.Section).Emit(Data(position,op));
  5154. source.SetReferenced(FALSE)
  5155. ELSE
  5156. name := source.name;
  5157. END;
  5158. END;
  5159. RETURN td
  5160. END GetBackendType;
  5161. BEGIN
  5162. (*td := t.typeDeclaration;*)
  5163. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5164. (*
  5165. IF t IS SyntaxTree.PointerType THEN
  5166. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5167. ELSE
  5168. source := GetBackendType(t);
  5169. END;
  5170. *)
  5171. IF newObjectFile THEN
  5172. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5173. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5174. IntermediateCode.SetOffset(res,offset);
  5175. ELSE
  5176. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5177. END;
  5178. (*
  5179. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5180. make memory should be used when tag is used, not earlier
  5181. *)
  5182. RETURN res
  5183. END TypeDescriptorAdr;
  5184. (*
  5185. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5186. VAR result: IntermediateCode.Operand;
  5187. BEGIN
  5188. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5189. operand.tag := TypeDescriptorAdr(operand.type);
  5190. IntermediateCode.MakeMemory(operand.tag,addressType);
  5191. UseIntermediateOperand(operand.tag);
  5192. END;
  5193. END MakeTypeTag;
  5194. *)
  5195. PROCEDURE ProfilerInit;
  5196. VAR reg: IntermediateCode.Operand;
  5197. BEGIN
  5198. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5199. Emit(Call(position,reg,0));
  5200. END ProfilerInit;
  5201. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5202. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5203. BEGIN
  5204. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5205. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5206. THEN
  5207. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5208. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5209. Emit(Push(position,reg));
  5210. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5211. Emit(Push(position,reg));
  5212. StaticCallOperand(result,procedure);
  5213. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5214. ReleaseOperand(result);
  5215. END;
  5216. END ProfilerEnterExit;
  5217. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5218. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5219. BEGIN
  5220. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5221. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5222. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5223. profileInit.Emit(Push(position,reg));
  5224. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5225. profileInit.Emit(Push(position,reg));
  5226. NEW(string, LEN(name)); COPY(name, string^);
  5227. sv := SyntaxTree.NewStringValue(-1,string);
  5228. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5229. sv.SetType(type);
  5230. Designate(sv,result);
  5231. profileInit.Emit(Push(position,result.tag));
  5232. profileInit.Emit(Push(position,result.op));
  5233. StaticCallOperand(result,procedure);
  5234. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5235. ReleaseOperand(result);
  5236. END;
  5237. END ProfilerAddProcedure;
  5238. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5239. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5240. BEGIN
  5241. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5242. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5243. profileInit.Emit(Push(position,reg));
  5244. profileInitPatchPosition := profileInit.pc;
  5245. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5246. NEW(string, LEN(name)); COPY(name, string^);
  5247. sv := SyntaxTree.NewStringValue(-1,string);
  5248. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5249. sv.SetType(type);
  5250. Designate(sv,result);
  5251. profileInit.Emit(Push(position,result.tag));
  5252. profileInit.Emit(Push(position,result.op));
  5253. StaticCallOperand(result,procedure);
  5254. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5255. ReleaseOperand(result);
  5256. END;
  5257. END ProfilerAddModule;
  5258. PROCEDURE ProfilerPatchInit;
  5259. VAR reg: IntermediateCode.Operand;
  5260. BEGIN
  5261. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5262. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5263. EmitLeave(profileInit,position,0);
  5264. profileInit.Emit(Exit(position,0,0));
  5265. END ProfilerPatchInit;
  5266. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5267. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5268. VAR
  5269. id: LONGINT;
  5270. leftType, rightType: SyntaxTree.Type;
  5271. procedureType: SyntaxTree.ProcedureType;
  5272. runtimeProcedure: SyntaxTree.Procedure;
  5273. runtimeProcedureOperand, operatorOperand: Operand;
  5274. kind: SET;
  5275. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5276. VAR
  5277. arg: IntermediateCode.Operand;
  5278. recordType: SyntaxTree.RecordType;
  5279. fingerPrint: SyntaxTree.FingerPrint;
  5280. BEGIN
  5281. IF type = NIL THEN
  5282. (* no type: push 'NoType' *)
  5283. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5284. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5285. ELSIF IsStrictlyPointerToRecord(type) THEN
  5286. (* pointer to record type: push typetag *)
  5287. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5288. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5289. arg := TypeDescriptorAdr(recordType);
  5290. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5291. ELSE
  5292. (* non-pointer to record type: push fingerprint *)
  5293. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5294. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5295. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5296. END;
  5297. operatorInitializationCodeSection.Emit(Push(position,arg))
  5298. END PushTypeInfo;
  5299. BEGIN
  5300. ASSERT(operatorInitializationCodeSection # NIL);
  5301. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5302. procedureType := operator.type(SyntaxTree.ProcedureType);
  5303. (* determine types *)
  5304. leftType := procedureType.firstParameter.type;
  5305. IF procedureType.numberParameters = 2 THEN
  5306. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5307. rightType := procedureType.firstParameter.nextParameter.type;
  5308. ELSE
  5309. rightType := NIL
  5310. END;
  5311. (* determine operator kind *)
  5312. IF IsStrictlyPointerToRecord(leftType) THEN
  5313. kind := {LhsIsPointer}
  5314. ELSE
  5315. kind := {}
  5316. END;
  5317. IF IsStrictlyPointerToRecord(rightType) THEN
  5318. kind := kind + {RhsIsPointer}
  5319. END;
  5320. IF kind # {} THEN (* TODO: to be removed later on *)
  5321. (* at least one of the types is a pointer to record *)
  5322. (* emit a code that registers this specific operator in the runtime *)
  5323. dump := operatorInitializationCodeSection.comments;
  5324. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5325. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5326. (* push ID *)
  5327. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5328. id := Global.GetSymbol(module.module.case, operator.name);
  5329. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5330. (* push kind *)
  5331. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5332. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5333. (* push type infos *)
  5334. PushTypeInfo(leftType);
  5335. PushTypeInfo(rightType);
  5336. (* push operator address *)
  5337. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5338. StaticCallOperand(operatorOperand, operator);
  5339. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5340. ReleaseOperand(operatorOperand);
  5341. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5342. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5343. ReleaseOperand(runtimeProcedureOperand)
  5344. END
  5345. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5346. END
  5347. END RegisterDynamicOperator;
  5348. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5349. VAR
  5350. traceModule: SyntaxTree.Module;
  5351. procedure: SyntaxTree.Procedure;
  5352. procedureVariable: SyntaxTree.Variable;
  5353. s,msg: Basic.MessageString;
  5354. res: Operand;
  5355. i: LONGINT;
  5356. sv: SyntaxTree.StringValue;
  5357. type: SyntaxTree.Type;
  5358. recordType: SyntaxTree.RecordType;
  5359. printout: Printout.Printer;
  5360. stringWriter: Streams.StringWriter;
  5361. expression: SyntaxTree.Expression;
  5362. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5363. BEGIN
  5364. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5365. IF procedure = NIL THEN
  5366. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5367. END;
  5368. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5369. s := "procedure ";
  5370. Strings.Append(s,backend.traceModuleName);
  5371. Strings.Append(s,".");
  5372. Strings.Append(s,procedureName);
  5373. Strings.Append(s," not present");
  5374. Error(position,s);
  5375. RETURN FALSE
  5376. ELSE
  5377. RETURN TRUE
  5378. END;
  5379. END GetProcedure;
  5380. PROCEDURE CallProcedure;
  5381. VAR size: LONGINT;
  5382. BEGIN
  5383. IF procedure # NIL THEN
  5384. StaticCallOperand(result,procedure);
  5385. size := ProcedureParametersSize(system,procedure);
  5386. ELSE
  5387. Symbol(procedureVariable, result);
  5388. LoadValue(result, procedureVariable.type.resolved);
  5389. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5390. END;
  5391. Emit(Call(position,result.op,size));
  5392. END CallProcedure;
  5393. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5394. VAR res: Operand; string: SyntaxTree.String;
  5395. BEGIN
  5396. IF GetProcedure("String") THEN
  5397. NEW(string, LEN(s)); COPY(s, string^);
  5398. sv := SyntaxTree.NewStringValue(-1,string);
  5399. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5400. sv.SetType(type);
  5401. Designate(sv,res);
  5402. Emit(Push(position,res.tag));
  5403. Emit(Push(position,res.op));
  5404. ReleaseOperand(res);
  5405. CallProcedure;
  5406. END;
  5407. END String;
  5408. PROCEDURE Integer(op: IntermediateCode.Operand);
  5409. BEGIN
  5410. IF GetProcedure("Int") THEN
  5411. Emit(Push(position,op));
  5412. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5413. CallProcedure;
  5414. END;
  5415. END Integer;
  5416. PROCEDURE Float(op: IntermediateCode.Operand);
  5417. BEGIN
  5418. IF GetProcedure("HIntHex") THEN
  5419. Emit(Push(position,op));
  5420. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5421. CallProcedure;
  5422. END;
  5423. END Float;
  5424. PROCEDURE Set(op: IntermediateCode.Operand);
  5425. BEGIN
  5426. IF GetProcedure("Set") THEN
  5427. Emit(Push(position,op));
  5428. (*
  5429. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5430. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5431. *)
  5432. CallProcedure;
  5433. END;
  5434. END Set;
  5435. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5436. BEGIN
  5437. IF GetProcedure("Boolean") THEN
  5438. Emit(Push(position,op));
  5439. CallProcedure;
  5440. END;
  5441. END Boolean;
  5442. PROCEDURE Char(op: IntermediateCode.Operand);
  5443. BEGIN
  5444. IF GetProcedure("Char") THEN
  5445. Emit(Push(position,op));
  5446. CallProcedure;
  5447. END;
  5448. END Char;
  5449. PROCEDURE Address(op: IntermediateCode.Operand);
  5450. BEGIN
  5451. IF GetProcedure("Address") THEN
  5452. Emit(Push(position,op));
  5453. CallProcedure;
  5454. END;
  5455. END Address;
  5456. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5457. BEGIN
  5458. IF GetProcedure("String") THEN
  5459. Emit(Push(position,tag));
  5460. Emit(Push(position,op));
  5461. CallProcedure;
  5462. END;
  5463. END StringOperand;
  5464. PROCEDURE Ln;
  5465. BEGIN
  5466. IF GetProcedure("Ln") THEN
  5467. CallProcedure;
  5468. END;
  5469. END Ln;
  5470. BEGIN
  5471. IF backend.traceModuleName = "" THEN RETURN END;
  5472. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5473. IF GetProcedure("Enter") THEN
  5474. CallProcedure
  5475. END;
  5476. NEW(stringWriter,LEN(s));
  5477. FOR i := 0 TO x.Length()-1 DO
  5478. msg := "";
  5479. expression := x.GetExpression(i);
  5480. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5481. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5482. ELSE
  5483. Global.GetModuleName(module.module, s);
  5484. END;
  5485. IF i = 0 THEN
  5486. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5487. stringWriter.String(":");
  5488. END;
  5489. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5490. IF ~(expression IS SyntaxTree.StringValue) THEN
  5491. printout.Expression(expression);
  5492. stringWriter.Get(s);
  5493. Strings.Append(msg,s);
  5494. Strings.Append(msg,"= ");
  5495. ELSE stringWriter.Get(s); (* remove from string writer *)
  5496. Strings.Append(msg, s);
  5497. END;
  5498. String(msg);
  5499. IF SemanticChecker.IsStringType(expression.type) THEN
  5500. Designate(expression,res);
  5501. StringOperand(res.op,res.tag);
  5502. ELSE
  5503. Evaluate(expression,res);
  5504. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5505. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5506. Convert(res.op,int64);
  5507. END;
  5508. Integer(res.op);
  5509. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5510. Boolean(res.op);
  5511. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5512. Set(res.op);
  5513. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5514. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5515. Convert(res.op,float64);
  5516. END;
  5517. Float(res.op);
  5518. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5519. Char(res.op);
  5520. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5521. Address(res.op);String("H");
  5522. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5523. Address(res.op);String("H");
  5524. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5525. Address(res.op);String("H");
  5526. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5527. Address(res.op);String("H");
  5528. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5529. String("NIL");
  5530. ELSE HALT(200);
  5531. END;
  5532. END;
  5533. ReleaseOperand(res);
  5534. String("; ");
  5535. END;
  5536. IF GetProcedure("Exit") THEN
  5537. CallProcedure
  5538. ELSE
  5539. Ln;
  5540. END;
  5541. END;
  5542. END SystemTrace;
  5543. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5544. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5545. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5546. BEGIN
  5547. type := type.resolved;
  5548. IF type IS SyntaxTree.RecordType THEN
  5549. WITH type: SyntaxTree.RecordType DO
  5550. baseType := type.baseType;
  5551. IF baseType # NIL THEN
  5552. baseType := baseType.resolved;
  5553. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5554. InitFields(baseType,adr,offset);
  5555. END;
  5556. variable := type.recordScope.firstVariable;
  5557. WHILE variable # NIL DO
  5558. IF variable.initializer # NIL THEN
  5559. Evaluate(variable.initializer,initializerOp);
  5560. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5561. Emit(Mov(position,mem,initializerOp.op));
  5562. ReleaseOperand(initializerOp);
  5563. ReleaseIntermediateOperand(mem);
  5564. END;
  5565. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5566. variable := variable.nextVariable
  5567. END;
  5568. END;
  5569. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5570. WITH type: SyntaxTree.ArrayType DO
  5571. IF type.form = SyntaxTree.Static THEN
  5572. baseType := type.arrayBase;
  5573. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5574. FOR i := 0 TO type.staticLength-1 DO
  5575. InitFields(baseType,adr,offset+i*size);
  5576. END;
  5577. END;
  5578. END;
  5579. ELSIF type IS SyntaxTree.MathArrayType THEN
  5580. WITH type: SyntaxTree.MathArrayType DO
  5581. IF type.form = SyntaxTree.Open THEN
  5582. dim := DynamicDim(type);
  5583. imm := IntermediateCode.Immediate(addressType,dim);
  5584. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5585. baseType := SemanticChecker.ArrayBase(type,dim);
  5586. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5587. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5588. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5589. ReleaseIntermediateOperand(imm);
  5590. (* flags remain empty (=0) for open array *)
  5591. ELSIF type.form = SyntaxTree.Static THEN
  5592. baseType := type.arrayBase;
  5593. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5594. ASSERT(type.staticLength < 1024*1024*1024);
  5595. FOR i := 0 TO type.staticLength-1 DO
  5596. InitFields(baseType,adr,offset+i*size);
  5597. END;
  5598. END;
  5599. END;
  5600. END;
  5601. END InitFields;
  5602. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5603. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5604. BEGIN
  5605. type := variable.type.resolved;
  5606. IF (type IS SyntaxTree.MathArrayType) THEN
  5607. WITH type: SyntaxTree.MathArrayType DO
  5608. IF type.form = SyntaxTree.Open THEN
  5609. Symbol(variable,operand);
  5610. InitFields(type, operand.tag,0);
  5611. ELSIF type.form = SyntaxTree.Tensor THEN
  5612. Symbol(variable, operand);
  5613. MakeMemory(tmp,operand.op,addressType,0);
  5614. ReleaseOperand(operand);
  5615. Emit(Mov(position,tmp, nil ) );
  5616. ReleaseIntermediateOperand(tmp);
  5617. END;
  5618. END;
  5619. ELSE
  5620. Symbol(variable,operand);
  5621. IF variable.initializer # NIL THEN
  5622. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5623. reference.SetType(variable.type.resolved);
  5624. reference.SetAssignable(TRUE);
  5625. Assign(reference,variable.initializer);
  5626. END;
  5627. InitFields(type, operand.op,0);
  5628. ReleaseOperand(operand);
  5629. END;
  5630. END InitVariable;
  5631. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5632. VAR end: Label;
  5633. BEGIN
  5634. IF type.form = SyntaxTree.Tensor THEN
  5635. InitOperand(result,ModeValue);
  5636. ReuseCopy(result.op,base);
  5637. end := NewLabel();
  5638. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5639. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5640. SetLabel(end);
  5641. Convert(result.op,int32);
  5642. ELSE
  5643. InitOperand(result,ModeValue);
  5644. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5645. END
  5646. END MathArrayDim;
  5647. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5648. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5649. BEGIN
  5650. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5651. MakeMemory(mem,base,addressType,offset);
  5652. Emit(Mov(position,mem,value));
  5653. ReleaseIntermediateOperand(mem);
  5654. END PutMathArrayField;
  5655. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5656. VAR mem: IntermediateCode.Operand;
  5657. BEGIN
  5658. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5659. MakeMemory(mem,base,addressType,offset);
  5660. Emit(Mov(position,mem,value));
  5661. ReleaseIntermediateOperand(mem);
  5662. END PutMathArrayFieldOffset;
  5663. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5664. BEGIN
  5665. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5666. MakeMemory(value,base,addressType,offset);
  5667. END GetMathArrayField;
  5668. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5669. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5670. BEGIN
  5671. IF incr THEN
  5672. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5673. ELSE
  5674. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5675. END;
  5676. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5677. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5678. ELSE
  5679. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5680. Emit(Mov(position,reg,dim));
  5681. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5682. Emit(Add(position,reg,reg,base));
  5683. MakeMemory(mem, reg, addressType, offset);
  5684. ReleaseIntermediateOperand(reg);
  5685. Emit(Mov(position,mem,value));
  5686. ReleaseIntermediateOperand(mem);
  5687. END;
  5688. END PutMathArrayLenOrIncr;
  5689. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5690. BEGIN
  5691. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5692. END PutMathArrayLength;
  5693. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5694. BEGIN
  5695. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5696. END PutMathArrayIncrement;
  5697. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5698. BEGIN
  5699. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5700. END GetMathArrayIncrement;
  5701. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5702. BEGIN
  5703. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5704. END GetMathArrayLength;
  5705. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5706. VAR dimOp: IntermediateCode.Operand;
  5707. BEGIN
  5708. dimOp := IntermediateCode.Immediate(int32, dim);
  5709. GetMathArrayLength(type, operand, dimOp, check, result);
  5710. END GetMathArrayLengthAt;
  5711. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5712. VAR dimOp: IntermediateCode.Operand;
  5713. BEGIN
  5714. dimOp := IntermediateCode.Immediate(int32, dim);
  5715. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5716. END GetMathArrayIncrementAt;
  5717. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5718. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5719. offset: LONGINT;
  5720. BEGIN
  5721. IF increment THEN
  5722. offset := MathIncrOffset;
  5723. ELSE
  5724. offset := MathLenOffset;
  5725. END;
  5726. INC(offset,operand.dimOffset*2);
  5727. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5728. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5729. END;
  5730. (* static dimension *)
  5731. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5732. IF check & (type.form = SyntaxTree.Tensor) THEN
  5733. DimensionCheck(operand.tag,dim,BrltL);
  5734. END;
  5735. val := SHORT(dim.intValue);
  5736. IF type.form # SyntaxTree.Tensor THEN
  5737. t := SemanticChecker.ArrayBase(type,val);
  5738. type := t.resolved(SyntaxTree.MathArrayType);
  5739. IF type.form = SyntaxTree.Static THEN
  5740. IF increment THEN
  5741. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5742. ELSE
  5743. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5744. END;
  5745. InitOperand(result,ModeValue);
  5746. result.op := res;
  5747. RETURN;
  5748. END;
  5749. END;
  5750. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5751. MakeMemory(res,operand.tag,addressType,offset);
  5752. (*
  5753. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5754. *)
  5755. InitOperand(result,ModeValue);
  5756. result.op := res;
  5757. ELSE
  5758. Convert(dim,addressType);
  5759. IF check THEN
  5760. IF type.form = SyntaxTree.Tensor THEN
  5761. DimensionCheck(operand.tag,dim,BrltL);
  5762. ELSIF isUnchecked THEN (* do nothing *)
  5763. ELSE
  5764. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5765. END;
  5766. END;
  5767. end := NewLabel(); next := NIL;
  5768. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5769. Emit(Mov(position,res,dim));
  5770. Convert(res,int32);
  5771. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5772. WHILE t IS SyntaxTree.MathArrayType DO
  5773. type := t(SyntaxTree.MathArrayType);
  5774. IF type.form = SyntaxTree.Static THEN
  5775. imm := IntermediateCode.Immediate(int32,val);
  5776. next := NewLabel();
  5777. BrneL(next,imm,res);
  5778. IF increment THEN
  5779. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5780. ELSE
  5781. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5782. END;
  5783. Emit(MovReplace(position,res,imm));
  5784. BrL(end);
  5785. ELSE hasDynamicPart := TRUE;
  5786. END;
  5787. t := type.arrayBase.resolved;
  5788. val := val + 1;
  5789. IF next # NIL THEN SetLabel(next) END;
  5790. END;
  5791. IF hasDynamicPart THEN
  5792. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5793. Emit(Mov(position,res2,dim));
  5794. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5795. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5796. Emit(Add(position,res2,res2,imm));
  5797. Emit(Add(position,res2,res2,operand.tag));
  5798. IntermediateCode.MakeMemory(res2,int32);
  5799. Emit(MovReplace(position,res,res2));
  5800. ReleaseIntermediateOperand(res2);
  5801. END;
  5802. SetLabel(end);
  5803. Convert(res,int32);
  5804. InitOperand(result,ModeValue);
  5805. result.op := res;
  5806. END;
  5807. END MathArrayLenOrIncr;
  5808. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5809. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5810. offset: LONGINT;
  5811. BEGIN
  5812. offset := operand.dimOffset+DynamicDim(type)-1;
  5813. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5814. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5815. val := SHORT(dim.intValue);
  5816. t := SemanticChecker.ArrayBase(type,val);
  5817. type := t.resolved(SyntaxTree.ArrayType);
  5818. IF type.form = SyntaxTree.Static THEN
  5819. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5820. ELSE
  5821. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5822. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5823. END;
  5824. UseIntermediateOperand(res);
  5825. InitOperand(result,ModeValue);
  5826. result.op := res;
  5827. ELSE
  5828. Convert(dim,addressType);
  5829. IF ~isUnchecked THEN
  5830. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5831. END;
  5832. end := NewLabel(); next := NIL;
  5833. (* ReuseCopy(dim,res); *)
  5834. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5835. Emit(Mov(position,res,dim));
  5836. Convert(res,int32);
  5837. Convert(res,int32);
  5838. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5839. WHILE t IS SyntaxTree.ArrayType DO
  5840. type := t(SyntaxTree.ArrayType);
  5841. IF type.form = SyntaxTree.Static THEN
  5842. imm := IntermediateCode.Immediate(int32,val);
  5843. next := NewLabel();
  5844. BrneL(next,imm,res);
  5845. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5846. Emit(MovReplace(position,res,imm));
  5847. BrL(end);
  5848. ELSE hasDynamicPart := TRUE;
  5849. END;
  5850. t := type.arrayBase.resolved;
  5851. val := val + 1;
  5852. IF next # NIL THEN SetLabel(next) END;
  5853. END;
  5854. IF hasDynamicPart THEN
  5855. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  5856. Convert(res2,addressType);
  5857. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  5858. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5859. Emit(Sub(position,res2,imm,res2));
  5860. Emit(Add(position,res2,res2,operand.tag));
  5861. IntermediateCode.MakeMemory(res2,int32);
  5862. Emit(MovReplace(position,res,res2));
  5863. ReleaseIntermediateOperand(res2);
  5864. END;
  5865. SetLabel(end);
  5866. Convert(res,int32);
  5867. InitOperand(result,ModeValue);
  5868. result.op := res;
  5869. END;
  5870. END ArrayLen;
  5871. (**
  5872. create a temporary variable in current scope
  5873. **)
  5874. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  5875. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  5876. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  5877. BEGIN
  5878. IF ~register THEN
  5879. variable := temporaries.GetFreeVariable(type, index);
  5880. ELSE
  5881. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  5882. END;
  5883. scope := currentScope;
  5884. IF variable = NIL THEN
  5885. COPY("@hiddenIRVar",string);
  5886. Basic.AppendNumber(string,index);
  5887. name := SyntaxTree.NewIdentifier(string);
  5888. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  5889. variable.SetType(type);
  5890. variable.SetAccess(SyntaxTree.Hidden);
  5891. IF ~register THEN
  5892. temporaries.AddVariable(variable);
  5893. IF scope.lastVariable # NIL THEN
  5894. offset := scope.lastVariable.offsetInBits;
  5895. ELSE
  5896. offset := 0;
  5897. END;
  5898. DEC(offset,system.SizeOf(variable.type));
  5899. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  5900. variable(SyntaxTree.Variable).SetOffset(offset);
  5901. scope.AddVariable(variable(SyntaxTree.Variable));
  5902. scope.EnterSymbol(variable, duplicate);
  5903. ASSERT(~duplicate);
  5904. InitVariable(variable(SyntaxTree.Variable));
  5905. ELSE
  5906. variable.SetUseRegister(TRUE);
  5907. variable(SyntaxTree.Variable).SetOffset(0);
  5908. END;
  5909. ELSE
  5910. InitVariable(variable(SyntaxTree.Variable));
  5911. (*
  5912. ASSERT(variable.type.resolved = type.resolved)
  5913. *)
  5914. END;
  5915. RETURN variable(SyntaxTree.Variable)
  5916. END GetTemporaryVariable;
  5917. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  5918. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  5919. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  5920. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  5921. i: LONGINT; duplicate: BOOLEAN;
  5922. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  5923. VAR variable: SyntaxTree.Variable;
  5924. BEGIN
  5925. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  5926. variable.SetType(type);
  5927. recordScope.AddVariable(variable);
  5928. END AddVariable;
  5929. BEGIN
  5930. name := "@ArrayDescriptor";
  5931. Basic.AppendNumber(name,dimensions);
  5932. identifier := SyntaxTree.NewIdentifier(name);
  5933. parentScope := module.module.moduleScope;
  5934. symbol := parentScope.FindSymbol(identifier);
  5935. IF symbol # NIL THEN
  5936. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  5937. type := typeDeclaration.declaredType;
  5938. ELSE
  5939. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  5940. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  5941. recordScope := SyntaxTree.NewRecordScope(parentScope);
  5942. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  5943. recordType.SetTypeDeclaration(typeDeclaration);
  5944. recordType.SetState(SyntaxTree.Resolved);
  5945. typeDeclaration.SetDeclaredType(recordType);
  5946. AddVariable("@ptr",system.anyType);
  5947. AddVariable("@adr",system.addressType);
  5948. AddVariable("@flags",system.addressType);
  5949. AddVariable("@dim",system.addressType);
  5950. AddVariable("@elementSize",system.addressType);
  5951. FOR i := 0 TO dimensions-1 DO
  5952. name := "@len";
  5953. Basic.AppendNumber(name,i);
  5954. AddVariable(name,system.addressType);
  5955. name := "@incr";
  5956. Basic.AppendNumber(name,i);
  5957. AddVariable(name,system.addressType);
  5958. END;
  5959. parentScope.AddTypeDeclaration(typeDeclaration);
  5960. parentScope.EnterSymbol(typeDeclaration,duplicate);
  5961. ASSERT(~duplicate);
  5962. type := recordType;
  5963. END;
  5964. RETURN type
  5965. END GetMathArrayDescriptorType;
  5966. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  5967. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  5968. BEGIN
  5969. type := GetMathArrayDescriptorType(dimensions);
  5970. Emit(Push(position,op.op));
  5971. (* push type descriptor *)
  5972. reg := TypeDescriptorAdr(type);
  5973. IF ~newObjectFile THEN
  5974. IntermediateCode.MakeMemory(reg,addressType);
  5975. END;
  5976. Emit(Push(position,reg));
  5977. ReleaseIntermediateOperand(reg);
  5978. (* push realtime flag: false by default *)
  5979. Emit(Push(position,false));
  5980. CallThis(position,"Heaps","NewRec",3);
  5981. END NewMathArrayDescriptor;
  5982. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  5983. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  5984. BEGIN
  5985. NEW(string, LEN(s)); COPY(s, string^);
  5986. sv := SyntaxTree.NewStringValue(-1,string);
  5987. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5988. sv.SetType(type);
  5989. Designate(sv,res);
  5990. Emit(Push(position,res.tag));
  5991. Emit(Push(position,res.op));
  5992. ReleaseOperand(res);
  5993. END PushConstString;
  5994. PROCEDURE PushConstBoolean(b: BOOLEAN);
  5995. BEGIN
  5996. IF b THEN
  5997. Emit(Push(-1, true));
  5998. ELSE
  5999. Emit(Push(-1, false));
  6000. END;
  6001. END PushConstBoolean;
  6002. PROCEDURE PushConstSet(v: SET);
  6003. VAR value: SyntaxTree.Value; op: Operand;
  6004. BEGIN
  6005. value := SyntaxTree.NewSetValue(-1, v);
  6006. value.SetType(system.setType);
  6007. Evaluate(value, op);
  6008. Emit(Push(-1, op.op));
  6009. ReleaseOperand(op);
  6010. END PushConstSet;
  6011. PROCEDURE PushConstInteger(v: LONGINT);
  6012. VAR value: SyntaxTree.Value; op: Operand;
  6013. BEGIN
  6014. value := SyntaxTree.NewIntegerValue(-1, v);
  6015. value.SetType(system.longintType);
  6016. Evaluate(value, op);
  6017. Emit(Push(-1, op.op));
  6018. ReleaseOperand(op);
  6019. END PushConstInteger;
  6020. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6021. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6022. section: IntermediateCode.Section;
  6023. BEGIN
  6024. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6025. Global.GetSymbolSegmentedName(symbol, name);
  6026. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6027. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6028. procedure.SetScope(moduleScope);
  6029. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6030. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6031. procedure.SetAccess(SyntaxTree.Hidden);
  6032. currentScope := procedureScope;
  6033. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6034. EmitEnter(section, -1,NIL,0,0,0);
  6035. RETURN section;
  6036. END OpenInitializer;
  6037. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6038. BEGIN
  6039. EmitLeave(section, 0, 0 );
  6040. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6041. section := prev;
  6042. END CloseInitializer;
  6043. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6044. VAR name: SyntaxTree.IdentifierString;
  6045. variable: SyntaxTree.Variable;
  6046. type: SyntaxTree.Type;
  6047. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6048. BEGIN
  6049. InitOperand(op,ModeReference);
  6050. op.op := fp;
  6051. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6052. Dereference(op, x, FALSE);
  6053. result := op;
  6054. Symbol(symbol, op);
  6055. END Field;
  6056. PROCEDURE Direction(direction: LONGINT): SET;
  6057. BEGIN
  6058. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6059. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6060. ELSE HALT(100);
  6061. END;
  6062. END Direction;
  6063. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6064. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6065. BEGIN
  6066. Field(port, op);
  6067. ToMemory(op.op,addressType,0);
  6068. Emit(Push(-1, op.op));
  6069. ReleaseOperand(op);
  6070. Basic.GetString(modifier.identifier, name);
  6071. PushConstString(name);
  6072. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6073. ASSERT(SemanticChecker.IsStringType(value.type));
  6074. Designate(value, op);
  6075. Emit(Push(modifier.position, op.tag));
  6076. Emit(Push(modifier.position, op.op));
  6077. ReleaseOperand(op);
  6078. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6079. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6080. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6081. Evaluate(value, op);
  6082. Emit(Push(modifier.position, op.op));
  6083. ReleaseOperand(op);
  6084. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6085. ELSE
  6086. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6087. END;
  6088. END AddPortProperty;
  6089. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6090. VAR modifier: SyntaxTree.Modifier;
  6091. BEGIN
  6092. modifier := variable.modifiers;
  6093. WHILE modifier # NIL DO
  6094. AddPortProperty(variable,modifier, modifier.expression);
  6095. modifier := modifier.nextModifier;
  6096. END;
  6097. END AddPortProperties;
  6098. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6099. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6100. size, reg: IntermediateCode.Operand; dim: LONGINT;
  6101. PROCEDURE PushLens(type: SyntaxTree.Type);
  6102. BEGIN
  6103. IF type IS SyntaxTree.ArrayType THEN
  6104. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6105. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6106. Emit(Push(-1, op.op));
  6107. ReleaseOperand(op);
  6108. INC(dim);
  6109. ELSE
  6110. baseType := type;
  6111. END;
  6112. END PushLens;
  6113. BEGIN
  6114. (* cell *)
  6115. IF variable.type IS SyntaxTree.ArrayType THEN
  6116. type := variable.type;
  6117. dim := 0;
  6118. PushLens(type);
  6119. portType := baseType.resolved(SyntaxTree.PortType);
  6120. ELSE
  6121. portType := variable.type(SyntaxTree.PortType);
  6122. END;
  6123. PushSelfPointer();
  6124. (* port *)
  6125. Field(variable, op);
  6126. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6127. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6128. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6129. Designate(d, op);*)
  6130. Emit(Push(-1, op.op));
  6131. ReleaseOperand(op);
  6132. (* name *)
  6133. PushConstString(name);
  6134. (* inout *)
  6135. PushConstSet(Direction(portType.direction));
  6136. (* width *)
  6137. PushConstInteger(portType.sizeInBits);
  6138. IF variable.type IS SyntaxTree.PortType THEN
  6139. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6140. AddPortProperties(variable);
  6141. ELSIF variable.type IS SyntaxTree.ArrayType THEN
  6142. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6143. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6144. Emit(Add(position,reg, sp, size));
  6145. (* dim *)
  6146. PushConstInteger(dim);
  6147. (* len array *)
  6148. Emit(Push(position, reg));
  6149. ReleaseIntermediateOperand(reg);
  6150. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6151. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6152. Emit(Add(position, sp,sp, size));
  6153. END;
  6154. END Variable;
  6155. BEGIN
  6156. IF backend.cellsAreObjects THEN
  6157. variable := x.cellScope.firstVariable;
  6158. WHILE (variable # NIL) DO
  6159. type := variable.type.resolved;
  6160. WHILE (type IS SyntaxTree.ArrayType) DO
  6161. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6162. END;
  6163. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6164. (*!!! check port arrays !! *)
  6165. Global.GetSymbolName(variable,name);
  6166. Variable(name,variable);
  6167. END;
  6168. variable := variable.nextVariable;
  6169. END;
  6170. ELSE HALT(200)
  6171. END;
  6172. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6173. (*
  6174. x.typeDeclaration.GetName(componentName);
  6175. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6176. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6177. instanceType.SetDataMemorySize(dataMemorySize);
  6178. END;
  6179. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6180. instanceType.SetInstructionMemorySize(codeMemorySize)
  6181. END;
  6182. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6183. instanceType.AddCapability(ActiveCells.VectorCapability)
  6184. END;
  6185. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6186. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6187. END;
  6188. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6189. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6190. END;
  6191. AddDevices(instanceType, x);
  6192. *)
  6193. (*
  6194. IF x.isCellNet THEN
  6195. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6196. END;
  6197. *)
  6198. (*currentActiveCellsScope := instanceType;*)
  6199. (*
  6200. parameter := x.firstParameter;
  6201. portIndex := 0;
  6202. WHILE parameter # NIL DO
  6203. parameter.GetName(parameterName);
  6204. parameterType := parameter.type.resolved;
  6205. Parameter(parameterName, parameterType);
  6206. (*
  6207. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6208. ParameterArray(parameterType);
  6209. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6210. FOR i := 0 TO len-1 DO
  6211. COPY(parameterName,name);
  6212. AppendIndex(name,i);
  6213. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6214. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6215. INC(portIndex);
  6216. END;
  6217. ELSE
  6218. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6219. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6220. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6221. INC(portIndex);
  6222. END;
  6223. *)
  6224. parameter := parameter.nextParameter;
  6225. END;
  6226. *)
  6227. (*
  6228. Scope(x.cellScope);
  6229. currentActiveCellsScope := prevActiveCellsScope;
  6230. AddModules(instanceType,x.cellScope);
  6231. *)
  6232. END AddPorts;
  6233. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6234. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6235. BEGIN
  6236. Symbol(cell,op);
  6237. ToMemory(op.op,addressType,0);
  6238. Emit(Push(position,op.op));
  6239. ReleaseOperand(op);
  6240. Basic.GetString(property.name, name);
  6241. PushConstString(name);
  6242. IF SemanticChecker.IsStringType(property.type) OR (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6243. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6244. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6245. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6246. Designate(d, op);
  6247. IF SemanticChecker.IsStringType(property.type) THEN
  6248. Emit(Push(-1, op.tag))
  6249. END;
  6250. Emit(Push(-1, op.op));
  6251. ReleaseOperand(op);
  6252. END;
  6253. IF SemanticChecker.IsStringType(property.type) THEN
  6254. ASSERT(SemanticChecker.IsStringType(value.type));
  6255. Designate(value, op);
  6256. Emit(Push(property.position, op.tag));
  6257. Emit(Push(property.position, op.op));
  6258. ReleaseOperand(op);
  6259. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6260. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6261. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6262. Evaluate(value, op);
  6263. Emit(Push(property.position, op.op));
  6264. ReleaseOperand(op);
  6265. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6266. ELSE
  6267. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6268. END;
  6269. END AddProperty;
  6270. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6271. VAR symbol: SyntaxTree.Symbol;
  6272. BEGIN
  6273. WHILE modifier # NIL DO
  6274. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6275. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6276. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6277. ELSE
  6278. (*! move this check to checker *)
  6279. Error(modifier.position, "undefined property");
  6280. END;
  6281. modifier := modifier.nextModifier;
  6282. END;
  6283. END AddModifiers;
  6284. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6285. VAR last: SyntaxTree.Modifier;
  6286. BEGIN
  6287. IF to = NIL THEN
  6288. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6289. ELSE
  6290. last := to;
  6291. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6292. last := last.nextModifier;
  6293. END;
  6294. IF last.identifier # this.identifier THEN
  6295. ASSERT(last.nextModifier = NIL);
  6296. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6297. END;
  6298. END;
  6299. END AppendModifier;
  6300. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6301. BEGIN
  6302. WHILE this # NIL DO
  6303. AppendModifier(to, this);
  6304. this := this.nextModifier;
  6305. END;
  6306. END AppendModifiers;
  6307. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6308. VAR op: Operand;
  6309. BEGIN
  6310. Evaluate(p, op);
  6311. Emit(Push(p.position, op.op));
  6312. ReleaseOperand(op);
  6313. (*
  6314. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6315. p := p(SyntaxTree.Designator).left;
  6316. END;
  6317. IF p # NIL THEN
  6318. Evaluate(p, op);
  6319. Emit(Push(p.position, op.op));
  6320. ReleaseOperand(op);
  6321. ELSE
  6322. Emit(Push(-1, nil));
  6323. END;
  6324. *)
  6325. END PushPort;
  6326. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6327. VAR
  6328. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6329. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6330. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6331. tmp:IntermediateCode.Operand;
  6332. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6333. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6334. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6335. dest: IntermediateCode.Operand;
  6336. staticLength: LONGINT; itype: IntermediateCode.Type;
  6337. convert,isTensor: BOOLEAN;
  6338. recordType: SyntaxTree.RecordType;
  6339. baseType: SyntaxTree.Type;
  6340. flags: SET;
  6341. left: SyntaxTree.Expression;
  6342. call: SyntaxTree.Designator;
  6343. procedure: SyntaxTree.Procedure;
  6344. temporaryVariable: SyntaxTree.Variable;
  6345. dummy: IntermediateCode.Operand;
  6346. customBuiltin: SyntaxTree.CustomBuiltin;
  6347. isVarPar: ARRAY 3 OF BOOLEAN;
  6348. callsection: Sections.Section;
  6349. segmentedName: Basic.SegmentedName;
  6350. needsTrace: BOOLEAN;
  6351. n: ARRAY 256 OF CHAR;
  6352. modifier: SyntaxTree.Modifier;
  6353. previous, init: IntermediateCode.Section;
  6354. prevScope: SyntaxTree.Scope;
  6355. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6356. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6357. priority: IntermediateCode.Operand;
  6358. op,callop: Operand;
  6359. BEGIN
  6360. IF type = NIL THEN RETURN END;
  6361. type := type.resolved;
  6362. IF type IS SyntaxTree.PointerType THEN
  6363. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6364. END;
  6365. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6366. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6367. recordScope := type(SyntaxTree.RecordType).recordScope;
  6368. IF recordScope.bodyProcedure # NIL THEN
  6369. procedure := recordScope.bodyProcedure;
  6370. body := procedure.procedureScope.body;
  6371. Emit(Push(position,self));
  6372. IF body.isActive THEN
  6373. StaticCallOperand(callop,procedure);
  6374. Emit(Push(position,callop.op));
  6375. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6376. Convert(priority,sizeType);
  6377. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6378. END;
  6379. Emit(Push(position,priority));
  6380. ReleaseIntermediateOperand(priority);
  6381. IF backend.cooperative THEN
  6382. Emit(Push(position,self));
  6383. CallThis(position,"Activities","Create",3)
  6384. ELSE
  6385. flags := 0;
  6386. IF body.isSafe THEN
  6387. flags := 1;
  6388. END;
  6389. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6390. Emit(Push(position,self));
  6391. CallThis(position,"Objects","CreateProcess",4)
  6392. END;
  6393. ELSE
  6394. Emit(Push(position,self));
  6395. StaticCallOperand(callop,procedure);
  6396. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6397. END;
  6398. Emit(Pop(position,self));
  6399. END;
  6400. END CallBodies;
  6401. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6402. BEGIN
  6403. actualType := actualType.resolved;
  6404. IF actualType IS SyntaxTree.StringType THEN
  6405. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6406. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6407. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6408. ELSE
  6409. tmp := op.tag;
  6410. IntermediateCode.MakeMemory(tmp,addressType);
  6411. Emit(Push(position,tmp));
  6412. END;
  6413. Emit(Push(position,op.op))
  6414. END PushString;
  6415. PROCEDURE PushTD(type: SyntaxTree.Type);
  6416. VAR op: IntermediateCode.Operand;
  6417. BEGIN
  6418. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6419. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6420. ELSE
  6421. IF type.resolved IS SyntaxTree.PointerType THEN
  6422. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6423. END;
  6424. op := TypeDescriptorAdr(type.resolved);
  6425. IF ~newObjectFile THEN
  6426. IntermediateCode.MakeMemory(op,addressType);
  6427. END;
  6428. Emit(Push(position,op));
  6429. END
  6430. END PushTD;
  6431. BEGIN
  6432. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6433. dest := destination; destination := emptyOperand;
  6434. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6435. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6436. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6437. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6438. CASE x.id OF
  6439. (* ---- COPY ----- *)
  6440. |Global.Copy:
  6441. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6442. (* ---- EXCL, INCL----- *)
  6443. |Global.Excl,Global.Incl:
  6444. Evaluate(p0,s0);
  6445. Evaluate(p1,s1);
  6446. Convert(s1.op,setType);
  6447. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6448. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6449. END;
  6450. ReuseCopy(res,s0.op);
  6451. ReleaseOperand(s0);
  6452. Reuse1(tmp,s1.op);
  6453. ReleaseOperand(s1);
  6454. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6455. IF x.id = Global.Excl THEN
  6456. Emit(Not(position,tmp,tmp));
  6457. Emit(And(position,res,res,tmp));
  6458. ELSE
  6459. Emit(Or(position,res,res,tmp));
  6460. END;
  6461. ReleaseIntermediateOperand(tmp);
  6462. Designate(p0,s0);
  6463. ToMemory(s0.op,setType,0);
  6464. Emit(Mov(position,s0.op,res));
  6465. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6466. (* ---- DISPOSE ----- *)
  6467. |Global.Dispose:
  6468. Designate(p0,s0);
  6469. Emit(Push(position,s0.op));
  6470. ReleaseOperand(s0);
  6471. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6472. (* ---- GETPROCEDURE ----- *)
  6473. |Global.GetProcedure:
  6474. Designate(p0,s0);
  6475. PushString(s0,p0.type);
  6476. Designate(p1,s1);
  6477. PushString(s1,p1.type);
  6478. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6479. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6480. ELSE PushTD(procedureType.firstParameter.type)
  6481. END;
  6482. PushTD(procedureType.returnType);
  6483. Designate(p2,s2);
  6484. Emit(Push(position,s2.op));
  6485. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6486. CallThis(position,"Modules","GetProcedure", 7);
  6487. (* ---- ASH, LSH, ROT ----- *)
  6488. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6489. Evaluate(p0,s0);
  6490. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6491. (* make unsigned arguments in order to produced a logical shift *)
  6492. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6493. convert:= TRUE;
  6494. itype := s0.op.type;
  6495. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6496. Convert(s0.op,itype);
  6497. ELSE
  6498. convert := FALSE;
  6499. END;
  6500. END;
  6501. Evaluate(p1,s1);
  6502. IF IsIntegerConstant(p1,hint) THEN
  6503. ReuseCopy(reg,s0.op);
  6504. IF hint > 0 THEN
  6505. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6506. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6507. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6508. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6509. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6510. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6511. END;
  6512. ELSIF hint < 0 THEN
  6513. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6514. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6515. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6516. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6517. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6518. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6519. END;
  6520. END;
  6521. ReleaseOperand(s0); ReleaseOperand(s1);
  6522. ELSE
  6523. exit := NewLabel();
  6524. end := NewLabel();
  6525. ReuseCopy(reg,s0.op);
  6526. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6527. Reuse1(tmp,s1.op);
  6528. Emit(Neg(position,tmp,s1.op));
  6529. Convert(tmp,s1.op.type);
  6530. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6531. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6532. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6533. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6534. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6535. END;
  6536. ReleaseIntermediateOperand(tmp);
  6537. BrL(end);
  6538. SetLabel(exit);
  6539. ReuseCopy(tmp,s1.op);
  6540. Convert(tmp,s1.op.type);
  6541. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6542. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6543. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6544. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6545. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6546. END;
  6547. ReleaseIntermediateOperand(tmp);
  6548. SetLabel(end);
  6549. ReleaseOperand(s0); ReleaseOperand(s1);
  6550. END;
  6551. InitOperand(result,ModeValue);
  6552. IF convert THEN
  6553. itype := reg.type;
  6554. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6555. Convert(reg,itype);
  6556. END;
  6557. result.op := reg;
  6558. (* ---- CAP ----- *)
  6559. |Global.Cap:
  6560. Evaluate(p0,result);
  6561. ReuseCopy(reg,result.op);
  6562. ReleaseIntermediateOperand(result.op);
  6563. ignore := NewLabel();
  6564. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6565. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6566. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6567. SetLabel(ignore);
  6568. result.op := reg;
  6569. (* ---- CHR ----- *)
  6570. |Global.Chr, Global.Chr32:
  6571. Evaluate(p0,result);
  6572. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6573. |Global.Entier, Global.EntierH:
  6574. Evaluate(p0,result);
  6575. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6576. (* ---- MIN and MAX ----- *)
  6577. |Global.Max,Global.Min:
  6578. Evaluate(p0,s0);
  6579. Evaluate(p1,s1);
  6580. Reuse2(res,s0.op,s1.op);
  6581. else := NewLabel();
  6582. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6583. ELSE BrltL(else,s1.op,s0.op) END;
  6584. Emit(Mov(position,res,s0.op));
  6585. ReleaseOperand(s0);
  6586. end := NewLabel();
  6587. BrL(end);
  6588. SetLabel(else);
  6589. Emit(MovReplace(position,res,s1.op));
  6590. SetLabel(end);
  6591. ReleaseOperand(s1);
  6592. InitOperand(result,ModeValue);
  6593. result.op := res;
  6594. (* ---- ODD ----- *)
  6595. |Global.Odd:
  6596. IF ~conditional THEN
  6597. ConditionToValue(x)
  6598. ELSE
  6599. Evaluate(p0,result);
  6600. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6601. Reuse1(res,result.op);
  6602. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6603. ReleaseIntermediateOperand(result.op);
  6604. result.op := res;
  6605. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6606. ReleaseOperand(result);
  6607. BrL(falseLabel);
  6608. END;
  6609. (* ---- ORD ----- *)
  6610. |Global.Ord, Global.Ord32:
  6611. Evaluate(p0,result);
  6612. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6613. (* ---- SHORT, LONG ----- *)
  6614. |Global.Short, Global.Long:
  6615. Evaluate(p0,result);
  6616. IF x.type IS SyntaxTree.ComplexType THEN
  6617. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6618. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6619. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6620. ELSE
  6621. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6622. END
  6623. (* ---- HALT, SYSTEM.HALT----- *)
  6624. |Global.Halt, Global.systemHalt:
  6625. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6626. EmitTrap (position, val);
  6627. (* ---- ASSERT ----- *)
  6628. |Global.Assert:
  6629. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6630. trueL := NewLabel();
  6631. falseL := NewLabel();
  6632. Condition(p0,trueL,falseL);
  6633. IF p1 = NIL THEN val := AssertTrap
  6634. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6635. END;
  6636. SetLabel(falseL);
  6637. EmitTrap(position,val);
  6638. SetLabel(trueL);
  6639. END;
  6640. (*
  6641. Emit(TrapC(result.op,val);
  6642. *)
  6643. (* ---- INC, DEC----- *)
  6644. |Global.Inc,Global.Dec:
  6645. Expression(p0); adr := result.op;
  6646. LoadValue(result,p0.type); l := result;
  6647. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6648. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6649. END;
  6650. IF x.id = Global.Inc THEN
  6651. Emit(Add(position,l.op,l.op,r.op));
  6652. ELSE
  6653. Emit(Sub(position,l.op,l.op,r.op));
  6654. END;
  6655. ReleaseOperand(l); ReleaseOperand(r);
  6656. (* ---- LEN ----- *)
  6657. |Global.Len: (* dynamic length, static length done by checker *)
  6658. Designate(p0,operand);
  6659. IF p1 = NIL THEN
  6660. InitOperand(l,ModeValue);
  6661. l.op := IntermediateCode.Immediate(int32,0);
  6662. ELSE
  6663. Evaluate(p1,l);
  6664. END;
  6665. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6666. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6667. Dereference(operand, p0.type.resolved, FALSE);
  6668. END;
  6669. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6670. ReleaseOperand(operand); ReleaseOperand(l);
  6671. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6672. ASSERT(p1 # NIL);
  6673. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6674. Dereference(operand,p0.type.resolved,FALSE);
  6675. END;
  6676. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6677. ReleaseOperand(operand); ReleaseOperand(l);
  6678. ELSE HALT(100);
  6679. END;
  6680. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6681. (* ---- FIRST ---- *)
  6682. |Global.First:
  6683. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6684. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6685. ELSE
  6686. Designate(p0, result)
  6687. END
  6688. (* ---- LAST ---- *)
  6689. |Global.Last:
  6690. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6691. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6692. ELSE
  6693. Designate(p0, result);
  6694. (* make sure result.op is a register *)
  6695. tmp := result.op;
  6696. ReuseCopy(result.op, result.op);
  6697. ReleaseIntermediateOperand(tmp);
  6698. (* add offset to result.op *)
  6699. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6700. END
  6701. (* ---- STEP ---- *)
  6702. |Global.Step:
  6703. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6704. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6705. ELSE
  6706. Designate(p0, result);
  6707. (* make sure result.op is a register *)
  6708. tmp := result.op;
  6709. ReuseCopy(result.op, result.op);
  6710. ReleaseIntermediateOperand(tmp);
  6711. (* add offset to result.op *)
  6712. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6713. END
  6714. (* ---- RE ---- *)
  6715. |Global.Re:
  6716. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6717. Designate(p0, result)
  6718. ELSE
  6719. Evaluate(p0, result)
  6720. END
  6721. (* ---- IM ---- *)
  6722. |Global.Im:
  6723. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6724. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6725. Designate(p0, result);
  6726. (* make sure result.op is a register *)
  6727. tmp := result.op;
  6728. ReuseCopy(result.op, result.op);
  6729. ReleaseIntermediateOperand(tmp);
  6730. (* add offset to result.op *)
  6731. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6732. (* ---- ABS ----- *)
  6733. |Global.Abs:
  6734. Evaluate(p0,operand);
  6735. type := p0.type.resolved;
  6736. InitOperand(result,ModeValue);
  6737. Reuse1a(result.op,operand.op,dest);
  6738. Emit(Abs(position,result.op,operand.op));
  6739. ReleaseOperand(operand);
  6740. (* ---- WAIT ----- *)
  6741. |Global.Wait:
  6742. Evaluate(p0,operand);
  6743. Emit(Push(position,operand.op));
  6744. ReleaseOperand(operand);
  6745. CallThis(position,"Activities","Wait", 1);
  6746. (* ---- NEW ----- *)
  6747. |Global.New:
  6748. (*! the following code is only correct for "standard" Oberon calling convention *)
  6749. type := p0.type.resolved;
  6750. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6751. THEN
  6752. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6753. IF backend.cooperative THEN
  6754. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6755. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6756. IF recordType.isObject THEN
  6757. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6758. IF recordType.IsActive() THEN
  6759. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6760. END;
  6761. IF recordType.IsProtected() THEN
  6762. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6763. END;
  6764. ELSE
  6765. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6766. END;
  6767. END;
  6768. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6769. CallThis(position,"Runtime","New", 1);
  6770. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6771. Emit(Result(position, pointer));
  6772. exit := NewLabel();
  6773. BreqL(exit,pointer,nil);
  6774. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6775. GetRecordTypeName (recordType,name);
  6776. IF ~recordType.isObject THEN
  6777. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6778. END;
  6779. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6780. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6781. IF recordType.isObject THEN
  6782. IF recordType.IsProtected() THEN
  6783. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6784. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6785. END;
  6786. IF recordType.IsActive() THEN
  6787. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6788. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6789. END;
  6790. END;
  6791. END;
  6792. (* initialize fields *)
  6793. IF type(SyntaxTree.PointerType).isPlain THEN
  6794. size := 0;
  6795. ELSIF recordType.isObject THEN
  6796. size := BaseObjectTypeSize;
  6797. ELSE
  6798. size := BaseRecordTypeSize;
  6799. END;
  6800. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  6801. (* call initializer *)
  6802. constructor := GetConstructor(recordType);
  6803. IF constructor # NIL THEN
  6804. (*! should be unified with ProcedureCallDesignator *)
  6805. Emit(Push(position,pointer));
  6806. ReleaseIntermediateOperand(pointer);
  6807. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6808. FOR i := 1 TO x.parameters.Length()-1 DO
  6809. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6810. formalParameter := formalParameter.nextParameter;
  6811. END;
  6812. (* static call of the constructor *)
  6813. GetCodeSectionNameForSymbol(constructor,name);
  6814. ASSERT(~constructor.isInline);
  6815. IF constructor.scope.ownerModule # module.module THEN
  6816. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6817. ELSE
  6818. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6819. END;
  6820. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  6821. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6822. Emit(Pop(position,pointer));
  6823. END;
  6824. (* call bodies *)
  6825. CallBodies(pointer,p0.type);
  6826. SetLabel(exit);
  6827. needsTrace := p0.NeedsTrace();
  6828. IF needsTrace THEN ModifyAssignments(true) END;
  6829. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  6830. Emit(Push(position, pointer));
  6831. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  6832. Emit(Pop(position, pointer));
  6833. END;
  6834. Designate(p0,l);
  6835. IF needsTrace THEN
  6836. CallAssignPointer(l.op, pointer);
  6837. ELSE
  6838. ToMemory(l.op,addressType,0);
  6839. Emit(Mov(position,l.op,pointer));
  6840. END;
  6841. ReleaseIntermediateOperand(pointer);
  6842. ReleaseOperand(l);
  6843. IF needsTrace THEN ModifyAssignments(false) END;
  6844. ELSE
  6845. temporaryVariable := GetTemporaryVariable(type, FALSE);
  6846. IF temporaryVariable # NIL THEN
  6847. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  6848. ELSE
  6849. Designate(p0,l);
  6850. END;
  6851. (* l.op contains address of pointer to record *)
  6852. Emit(Push(position,l.op)); (* address for use after syscall *)
  6853. Emit(Push(position,l.op));
  6854. ReleaseOperand(l);
  6855. (* push type descriptor *)
  6856. reg := TypeDescriptorAdr(recordType);
  6857. IF ~newObjectFile THEN
  6858. IntermediateCode.MakeMemory(reg,addressType);
  6859. END;
  6860. Emit(Push(position,reg));
  6861. ReleaseIntermediateOperand(reg);
  6862. (* push realtime flag *)
  6863. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6864. ELSE Emit(Push(position,false));
  6865. END;
  6866. CallThis(position,"Heaps","NewRec", 3);
  6867. (* check allocation success, if not successful then do not call initializers and bodies *)
  6868. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6869. Emit(Pop(position,pointer));
  6870. MakeMemory(reg,pointer,addressType,0);
  6871. ReleaseIntermediateOperand(pointer);
  6872. pointer := reg;
  6873. exit := NewLabel();
  6874. BreqL(exit,pointer,nil);
  6875. Emit(Push(position,pointer));
  6876. (* initialize fields *)
  6877. InitFields(recordType, pointer,0);
  6878. (* call initializer *)
  6879. constructor := GetConstructor(recordType);
  6880. IF constructor # NIL THEN
  6881. (*! should be unified with ProcedureCallDesignator *)
  6882. Emit(Push(position,pointer));
  6883. ReleaseIntermediateOperand(pointer);
  6884. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6885. FOR i := 1 TO x.parameters.Length()-1 DO
  6886. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6887. formalParameter := formalParameter.nextParameter;
  6888. END;
  6889. (* static call of the constructor *)
  6890. GetCodeSectionNameForSymbol(constructor,name);
  6891. ASSERT(~constructor.isInline);
  6892. IF constructor.scope.ownerModule # module.module THEN
  6893. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6894. ELSE
  6895. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6896. END;
  6897. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  6898. ELSE
  6899. ReleaseIntermediateOperand(pointer);
  6900. END;
  6901. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6902. Emit(Pop(position,pointer));
  6903. IF temporaryVariable # NIL THEN
  6904. Designate(p0,l);
  6905. ToMemory(l.op,addressType,0);
  6906. Emit(Mov(position,l.op,pointer));
  6907. ReleaseOperand(l);
  6908. result.tag := emptyOperand;
  6909. END;
  6910. (* call bodies *)
  6911. CallBodies(pointer,p0.type);
  6912. ReleaseIntermediateOperand(pointer);
  6913. IF temporaryVariable # NIL THEN
  6914. end := NewLabel();
  6915. BrL(end);
  6916. SetLabel(exit);
  6917. Designate(p0,l);
  6918. ToMemory(l.op,addressType,0);
  6919. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  6920. ReleaseOperand(l);
  6921. SetLabel(end);
  6922. ELSE
  6923. SetLabel(exit);
  6924. END;
  6925. END;
  6926. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  6927. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  6928. dim := 0;
  6929. IF p1 # NIL THEN
  6930. FOR i := 1 TO x.parameters.Length()-1 DO
  6931. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6932. parameter := x.parameters.GetExpression(i);
  6933. Evaluate(parameter,r);
  6934. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6935. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  6936. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  6937. END;
  6938. Emit(Push(position,r.op));
  6939. IF i=1 THEN
  6940. ReuseCopy(reg,r.op);
  6941. ELSE
  6942. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  6943. END;
  6944. ReleaseOperand(r);
  6945. INC(dim);
  6946. END;
  6947. Convert(reg,addressType);
  6948. ELSE
  6949. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6950. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  6951. END;
  6952. openDim := dim;
  6953. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  6954. IF backend.cooperative THEN
  6955. size := ToMemoryUnits(system,system.SizeOf(type));
  6956. WHILE type IS SyntaxTree.ArrayType DO
  6957. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6958. END;
  6959. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  6960. IF (size # 1) THEN
  6961. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6962. END;
  6963. Emit(Push(position,reg));
  6964. size := ToMemoryUnits(system,system.SizeOf(type));
  6965. IF (size # 1) THEN
  6966. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6967. END;
  6968. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  6969. Emit(Push(position,reg));
  6970. ReleaseIntermediateOperand(reg);
  6971. CallThis(position,"Runtime","New", 1);
  6972. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6973. Emit(Result(position, pointer));
  6974. exit := NewLabel();
  6975. else := NewLabel();
  6976. BreqL(else,pointer,nil);
  6977. IF ~type.hasPointers THEN
  6978. Basic.ToSegmentedName ("BaseTypes.Array",name);
  6979. ELSIF type IS SyntaxTree.RecordType THEN
  6980. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  6981. ELSIF type IS SyntaxTree.ProcedureType THEN
  6982. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  6983. ELSE
  6984. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  6985. END;
  6986. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  6987. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  6988. 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))));
  6989. IF type IS SyntaxTree.RecordType THEN
  6990. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  6991. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  6992. ELSE
  6993. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  6994. END;
  6995. i := openDim;
  6996. WHILE i > 0 DO
  6997. DEC (i);
  6998. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  6999. END;
  7000. needsTrace := p0.NeedsTrace();
  7001. IF needsTrace THEN ModifyAssignments(true) END;
  7002. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7003. Emit(Push(position, pointer));
  7004. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7005. Emit(Pop(position, pointer));
  7006. END;
  7007. Designate(p0,l);
  7008. IF needsTrace THEN
  7009. CallAssignPointer(l.op, pointer);
  7010. ModifyAssignments(false);
  7011. ELSE
  7012. ToMemory(l.op,addressType,0);
  7013. Emit(Mov(position,l.op,pointer));
  7014. END;
  7015. ReleaseIntermediateOperand(pointer);
  7016. ReleaseOperand(l);
  7017. BrL(exit);
  7018. SetLabel(else);
  7019. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7020. Designate(p0,l);
  7021. IF needsTrace THEN
  7022. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7023. ELSE
  7024. ToMemory(l.op,addressType,0);
  7025. Emit(Mov(position,l.op,pointer));
  7026. END;
  7027. ReleaseOperand(l);
  7028. SetLabel(exit);
  7029. ELSE
  7030. (*! the following code is only correct for "standard" Oberon calling convention *)
  7031. IF SemanticChecker.ContainsPointer(type) THEN
  7032. IF type IS SyntaxTree.ArrayType THEN
  7033. staticLength := 1;
  7034. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7035. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7036. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7037. END;
  7038. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7039. Emit(Mul(position,reg,reg,tmp));
  7040. END;
  7041. Designate(p0,l);
  7042. IF openDim > 0 THEN
  7043. Emit(Push(position,l.op)); (* address for use after syscall *)
  7044. END;
  7045. Emit(Push(position,l.op)); (* address *)
  7046. ReleaseOperand(l);
  7047. tmp := TypeDescriptorAdr(type);
  7048. IF ~newObjectFile THEN
  7049. IntermediateCode.MakeMemory(tmp,addressType);
  7050. END;
  7051. Emit(Push(position,tmp)); (* type descriptor *)
  7052. ReleaseIntermediateOperand(tmp);
  7053. Emit(Push(position,reg)); (* number Elements *)
  7054. ReleaseIntermediateOperand(reg);
  7055. tmp := IntermediateCode.Immediate(addressType,dim);
  7056. Emit(Push(position,tmp)); (* dimensions *)
  7057. (* push realtime flag *)
  7058. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7059. ELSE Emit(Push(position,false));
  7060. END;
  7061. CallThis(position,"Heaps","NewArr",5)
  7062. ELSE
  7063. size := ToMemoryUnits(system,system.SizeOf(type));
  7064. IF (size # 1) THEN
  7065. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7066. END;
  7067. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7068. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7069. Emit(Add(position,reg,reg,tmp));
  7070. Designate(p0,l);
  7071. IF openDim >0 THEN
  7072. Emit(Push(position,l.op)); (* address for use after syscall *)
  7073. END;
  7074. Emit(Push(position,l.op)); (* address for syscall *)
  7075. ReleaseOperand(l); (* pointer address *)
  7076. Emit(Push(position,reg)); (* size *)
  7077. ReleaseIntermediateOperand(reg);
  7078. (* push realtime flag *)
  7079. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7080. ELSE Emit(Push(position,false));
  7081. END;
  7082. CallThis(position,"Heaps","NewSys", 3)
  7083. END;
  7084. IF openDim > 0 THEN
  7085. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7086. Emit(Pop(position,adr));
  7087. ToMemory(adr,addressType,0);
  7088. ReuseCopy(tmp,adr);
  7089. ReleaseIntermediateOperand(adr);
  7090. adr := tmp;
  7091. else := NewLabel();
  7092. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7093. i := openDim-1;
  7094. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7095. WHILE (i >= 0) DO
  7096. Emit(Pop(position,reg));
  7097. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7098. Emit(Mov(position,res,reg));
  7099. DEC(i);
  7100. END;
  7101. ReleaseIntermediateOperand(adr);
  7102. ReleaseIntermediateOperand(reg);
  7103. exit := NewLabel();
  7104. BrL(exit);
  7105. SetLabel(else);
  7106. (* else part: array could not be allocated *)
  7107. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7108. Emit(Add(position,sp,sp,tmp));
  7109. SetLabel(exit);
  7110. END;
  7111. END;
  7112. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7113. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7114. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7115. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7116. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7117. left.SetType(procedure.type);
  7118. formalParameter := procedureType.firstParameter;
  7119. (* push array to allocate *)
  7120. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7121. formalParameter :=formalParameter.nextParameter;
  7122. (* push length array *)
  7123. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7124. (* push size *)
  7125. type := t0;
  7126. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7127. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7128. END;
  7129. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7130. Emit(Push(position,tmp));
  7131. (* *)
  7132. IF SemanticChecker.ContainsPointer(type) THEN
  7133. tmp := TypeDescriptorAdr(type);
  7134. IF ~newObjectFile THEN
  7135. IntermediateCode.MakeMemory(tmp,addressType);
  7136. END;
  7137. ELSE
  7138. tmp := IntermediateCode.Immediate(addressType, 0);
  7139. END;
  7140. Emit(Push(position,tmp)); (* type descriptor *)
  7141. StaticCallOperand(result,procedure);
  7142. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7143. ReleaseOperand(result);
  7144. END;
  7145. (*
  7146. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7147. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7148. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7149. *)
  7150. ELSE
  7151. dim := 0;
  7152. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7153. (* generate geometry descriptor *)
  7154. Designate(p0,l);
  7155. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7156. ReleaseOperand(l);
  7157. isTensor := TRUE;
  7158. ELSE
  7159. isTensor := FALSE;
  7160. END;
  7161. FOR i := 1 TO x.parameters.Length()-1 DO
  7162. IF ~isTensor THEN
  7163. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7164. END;
  7165. parameter := x.parameters.GetExpression(i);
  7166. Evaluate(parameter,r);
  7167. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7168. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7169. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7170. END;
  7171. Emit(Push(position,r.op));
  7172. IF i=1 THEN
  7173. ReuseCopy(reg,r.op);
  7174. ELSE
  7175. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7176. END;
  7177. ReleaseOperand(r);
  7178. INC(dim);
  7179. END;
  7180. Convert(reg,addressType);
  7181. openDim := dim;
  7182. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7183. (*! the following code is only correct for "standard" Oberon calling convention *)
  7184. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7185. t := type;
  7186. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7187. staticLength := 1;
  7188. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7189. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7190. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7191. END;
  7192. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7193. Emit(Mul(position,reg,reg,tmp));
  7194. END;
  7195. Designate(p0,l);
  7196. IF isTensor THEN
  7197. Dereference(l,type,FALSE);
  7198. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7199. END;
  7200. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7201. Emit(Push(position,l.tag)); (* address *)
  7202. ReleaseOperand(l);
  7203. tmp := TypeDescriptorAdr(t);
  7204. IF ~newObjectFile THEN
  7205. IntermediateCode.MakeMemory(tmp,addressType);
  7206. END;
  7207. Emit(Push(position,tmp)); (* type descriptor *)
  7208. ReleaseIntermediateOperand(tmp);
  7209. Emit(Push(position,reg)); (* number Elements *)
  7210. ReleaseIntermediateOperand(reg);
  7211. tmp := IntermediateCode.Immediate(addressType,0);
  7212. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7213. (* push realtime flag: false by default *)
  7214. Emit(Push(position,false));
  7215. CallThis(position,"Heaps","NewArr",5);
  7216. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7217. Emit(Pop(position,adr));
  7218. GetMathArrayField(tmp,adr,MathPtrOffset);
  7219. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7220. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7221. PutMathArrayField(adr,reg,MathAdrOffset);
  7222. ReleaseIntermediateOperand(tmp);
  7223. ReleaseIntermediateOperand(reg);
  7224. ELSE
  7225. IF isTensor THEN
  7226. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7227. ELSE
  7228. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7229. END;
  7230. IF (size # 1) THEN
  7231. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7232. END;
  7233. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7234. Emit(Add(position,reg,reg,tmp));
  7235. Designate(p0,l);
  7236. IF isTensor THEN
  7237. Dereference(l,type,FALSE);
  7238. END;
  7239. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7240. Emit(Push(position,l.tag)); (* address for syscall *)
  7241. ReleaseOperand(l); (* pointer address *)
  7242. Emit(Push(position,reg)); (* size *)
  7243. ReleaseIntermediateOperand(reg);
  7244. (* push realtime flag: false by default *)
  7245. Emit(Push(position,false));
  7246. CallThis(position,"Heaps","NewSys",3);
  7247. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7248. Emit(Pop(position,adr));
  7249. GetMathArrayField(tmp,adr,MathPtrOffset);
  7250. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7251. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7252. PutMathArrayField(adr,reg,MathAdrOffset);
  7253. ReleaseIntermediateOperand(tmp);
  7254. ReleaseIntermediateOperand(reg);
  7255. END;
  7256. flags := {};
  7257. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7258. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7259. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7260. PutMathArrayField(adr,tmp,MathDimOffset);
  7261. else := NewLabel();
  7262. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7263. i := openDim-1;
  7264. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7265. IF isTensor THEN
  7266. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7267. ELSE
  7268. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7269. END;
  7270. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7271. WHILE (i >= 0) DO
  7272. Emit(Pop(position,reg));
  7273. PutMathArrayLength(adr,reg,i);
  7274. PutMathArrayIncrement(adr,tmp,i);
  7275. IF i > 0 THEN
  7276. IF i=openDim-1 THEN
  7277. ReuseCopy(tmp,tmp);
  7278. END;
  7279. Emit(Mul(position,tmp,tmp,reg));
  7280. END;
  7281. DEC(i);
  7282. END;
  7283. ReleaseIntermediateOperand(adr);
  7284. ReleaseIntermediateOperand(reg);
  7285. ReleaseIntermediateOperand(tmp);
  7286. exit := NewLabel();
  7287. BrL(exit);
  7288. SetLabel(else);
  7289. (* else part: array could not be allocated *)
  7290. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7291. Emit(Add(position,sp,sp,tmp));
  7292. SetLabel(exit);
  7293. END;
  7294. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7295. THEN
  7296. IF ~backend.cellsAreObjects THEN RETURN END;
  7297. IF InCellScope(currentScope) THEN
  7298. PushSelfPointer()
  7299. ELSE
  7300. Emit(Push(position, nil));
  7301. END;
  7302. (* push temp address *)
  7303. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7304. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7305. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7306. (* l.op contains address of pointer to record *)
  7307. Emit(Push(position,l.op)); (* address for use after syscall *)
  7308. ReleaseOperand(l);
  7309. (* push type descriptor *)
  7310. reg := TypeDescriptorAdr(baseType);
  7311. IF ~newObjectFile THEN
  7312. IntermediateCode.MakeMemory(reg,addressType);
  7313. END;
  7314. Emit(Push(position,reg));
  7315. ReleaseIntermediateOperand(reg);
  7316. (* push name *)
  7317. (*Global.GetSymbolName(p0, n);*)
  7318. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7319. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7320. ELSE
  7321. Global.GetModuleName(module.module, n);
  7322. END;
  7323. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7324. (*type.typeDeclaration.GetName(n);*)
  7325. PushConstString(n);
  7326. (* push cellnet boolean *)
  7327. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7328. (* push engine boolean *)
  7329. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7330. (* allocate *)
  7331. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7332. (* add capabilities *)
  7333. modifier := p0(SyntaxTree.Designator).modifiers;
  7334. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7335. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7336. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7337. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7338. END;
  7339. AppendModifiers(modifier, baseType(SyntaxTree.CellType).modifiers);
  7340. (*
  7341. modifier := baseType(SyntaxTree.CellType).modifiers;
  7342. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7343. modifier := p0(SyntaxTree.Designator).modifiers;
  7344. *)
  7345. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7346. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7347. (* l.op contains address of pointer to record *)
  7348. ToMemory(l.op,addressType,0);
  7349. (* l.op contains value of pointer to record *)
  7350. Emit(Push(position,l.op)); (* address for use after syscall *)
  7351. ReleaseOperand(l);
  7352. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7353. prevScope := currentScope;
  7354. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7355. previous := section;
  7356. section := init;
  7357. (* add ports *)
  7358. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7359. CloseInitializer(previous);
  7360. currentScope := prevScope;
  7361. Symbol(temporaryVariable,l);
  7362. ToMemory(l.op,addressType,0);
  7363. Emit(Push(position,l.op));
  7364. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7365. (*
  7366. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7367. IF constructor # NIL THEN
  7368. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7369. FOR i := 1 TO x.parameters.Length()-1 DO
  7370. p := x.parameters.GetExpression(i);
  7371. Global.GetSymbolName(parameter,name);
  7372. Evaluate(p, value);
  7373. ASSERT(value.type # NIL);
  7374. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7375. par := instance.AddParameter(name);
  7376. par.SetInteger(value.integer);
  7377. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7378. par := instance.AddParameter(name);
  7379. par.SetBoolean(value.boolean);
  7380. ELSE Error(x.position,NotYetImplemented)
  7381. END;
  7382. parameter := parameter.nextParameter
  7383. END;
  7384. END;
  7385. *)
  7386. (* call initializer *)
  7387. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7388. IF constructor # NIL THEN
  7389. (*! should be unified with ProcedureCallDesignator *)
  7390. IF backend.cellsAreObjects THEN
  7391. Symbol(temporaryVariable,l);
  7392. ToMemory(l.op,addressType,0);
  7393. Emit(Push(position,l.op));
  7394. ReleaseOperand(l);
  7395. END;
  7396. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7397. FOR i := 1 TO x.parameters.Length()-1 DO
  7398. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7399. formalParameter := formalParameter.nextParameter;
  7400. END;
  7401. (* static call of the constructor *)
  7402. Global.GetSymbolSegmentedName(constructor,name);
  7403. ASSERT(~constructor.isInline);
  7404. IF constructor.scope.ownerModule # module.module THEN
  7405. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7406. ELSE
  7407. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7408. END;
  7409. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7410. (*ELSE
  7411. ReleaseIntermediateOperand(pointer);*)
  7412. END;
  7413. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7414. ToMemory(l.op, addressType, 0);
  7415. Designate(p0,s0);
  7416. ToMemory(s0.op,addressType,0);
  7417. Emit(Mov(position,s0.op,l.op));
  7418. ReleaseOperand(l);
  7419. ReleaseOperand(s0);
  7420. result.tag := emptyOperand;
  7421. (* start *)
  7422. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7423. (* push cell *)
  7424. Symbol(temporaryVariable, l);
  7425. ToMemory(l.op,addressType,0);
  7426. Emit(Push(-1,l.op));
  7427. (* push delegate *)
  7428. Emit(Push(-1,l.op));
  7429. ReleaseOperand(l);
  7430. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7431. Emit(Push(position, s1.op));
  7432. ReleaseOperand(s1);
  7433. CallThis(position,"ActiveCellsRuntime","Start",3);
  7434. END;
  7435. (*IF temporaryVariable # NIL THEN
  7436. end := NewLabel();
  7437. BrL(end);
  7438. SetLabel(exit);
  7439. Designate(p0,l);
  7440. ToMemory(l.op,addressType,0);
  7441. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7442. ReleaseOperand(l);
  7443. SetLabel(end);
  7444. ELSE
  7445. SetLabel(exit);
  7446. END;
  7447. *)
  7448. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7449. ELSE (* no pointer to record, no pointer to array *)
  7450. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7451. (* ignore new statement *)
  7452. Warning(p0.position, "cannot run on final hardware");
  7453. ELSE
  7454. HALT(200);
  7455. END;
  7456. END;
  7457. (* ---- ADDRESSOF----- *)
  7458. |Global.systemAdr:
  7459. Designate(p0,s0);
  7460. s0.mode := ModeValue;
  7461. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7462. ReleaseIntermediateOperand(s0.op);
  7463. s0.op := s0.tag;
  7464. IntermediateCode.InitOperand(s0.tag);
  7465. END;
  7466. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7467. result := s0;
  7468. (* ---- BIT ----- *)
  7469. |Global.systemBit:
  7470. Evaluate(p0,s0);
  7471. ToMemory(s0.op,addressType,0);
  7472. ReuseCopy(res,s0.op);
  7473. ReleaseOperand(s0);
  7474. Evaluate(p1,s1);
  7475. Emit(Ror(position,res,res,s1.op));
  7476. ReleaseOperand(s1);
  7477. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7478. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7479. IF ~conditional THEN
  7480. InitOperand(result,ModeValue); result.op := res;
  7481. ELSE
  7482. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7483. BrL(falseLabel);
  7484. ReleaseIntermediateOperand(res);
  7485. END;
  7486. (* --- MSK ----*)
  7487. |Global.systemMsk:
  7488. Evaluate(p0,s0);
  7489. Evaluate(p1,s1);
  7490. ReuseCopy(res,s0.op);
  7491. ReleaseOperand(s0);
  7492. Emit(And(position,res,res,s1.op));
  7493. ReleaseOperand(s1);
  7494. InitOperand(result,ModeValue);
  7495. result.op := res;
  7496. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7497. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7498. Evaluate(p0,s0);
  7499. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7500. ReleaseOperand(s0);
  7501. InitOperand(result,ModeValue);
  7502. result.op := res;
  7503. (* ---- SYSTEM.GetStackPointer ----- *)
  7504. |Global.systemGetStackPointer:
  7505. InitOperand(result,ModeValue);
  7506. result.op := sp;
  7507. (* ---- SYSTEM.GetFramePointer ----- *)
  7508. |Global.systemGetFramePointer:
  7509. InitOperand(result,ModeValue);
  7510. result.op := fp;
  7511. (* ---- SYSTEM.GetActivity ----- *)
  7512. |Global.systemGetActivity:
  7513. ASSERT(backend.cooperative);
  7514. InitOperand(result,ModeValue);
  7515. result.op := ap;
  7516. (* ---- SYSTEM.SetStackPointer ----- *)
  7517. |Global.systemSetStackPointer:
  7518. Evaluate(p0,s0); (* *)
  7519. Emit(Mov(position,sp,s0.op));
  7520. ReleaseOperand(s0);
  7521. (* ---- SYSTEM.SetFramePointer ----- *)
  7522. |Global.systemSetFramePointer:
  7523. Evaluate(p0,s0); (* *)
  7524. Emit(Mov(position,fp,s0.op));
  7525. ReleaseOperand(s0);
  7526. (* ---- SYSTEM.Activity ----- *)
  7527. |Global.systemSetActivity:
  7528. ASSERT(backend.cooperative);
  7529. Evaluate(p0,s0); (* *)
  7530. Emit(Mov(position,ap,s0.op));
  7531. ReleaseOperand(s0);
  7532. (* ---- SYSTEM.VAL ----- *)
  7533. |Global.systemVal:
  7534. Expression(p1);
  7535. s1 := result;
  7536. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7537. IF s1.mode = ModeReference THEN
  7538. (* nothing to be done if not record type, just take over new type *)
  7539. IF (type IS SyntaxTree.RecordType) THEN
  7540. ReleaseIntermediateOperand(s1.tag);
  7541. s1.tag := TypeDescriptorAdr(type);
  7542. IF ~newObjectFile THEN
  7543. IntermediateCode.MakeMemory(s1.tag,addressType);
  7544. END;
  7545. UseIntermediateOperand(s1.tag);
  7546. END;
  7547. result := s1;
  7548. ELSE (* copy over result to different type, may not use convert *)
  7549. itype := IntermediateCode.GetType(system,type);
  7550. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7551. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7552. Emit(Mov(position,s0.op,s1.op));
  7553. ReleaseOperand(s1);
  7554. InitOperand(result,ModeValue);
  7555. result.op := s0.op;
  7556. ELSE (* different size, must convert *)
  7557. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7558. Convert(s1.op, IntermediateCode.GetType(system,type));
  7559. result := s1;
  7560. END;
  7561. END;
  7562. (* ---- SYSTEM.GET ----- *)
  7563. |Global.systemGet:
  7564. Evaluate(p0,s0); (* adr *)
  7565. Designate(p1,s1); (* variable *)
  7566. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7567. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7568. Emit(Mov(position,s1.op,s0.op));
  7569. ReleaseOperand(s1);
  7570. ReleaseOperand(s0);
  7571. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7572. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7573. Evaluate(p0,s0); (* *)
  7574. Evaluate(p1,s1); (* variable *)
  7575. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7576. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7577. (* real part *)
  7578. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7579. Emit(Mov(position,res, s1.op));
  7580. ReleaseIntermediateOperand(res);
  7581. (* imaginary part *)
  7582. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7583. Emit(Mov(position,res, s1.tag));
  7584. ReleaseIntermediateOperand(res);
  7585. ReleaseOperand(s1);
  7586. ReleaseOperand(s0);
  7587. ELSE
  7588. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7589. ReleaseOperand(s0);
  7590. Emit(Mov(position,res,s1.op));
  7591. ReleaseIntermediateOperand(res);
  7592. ReleaseOperand(s1);
  7593. END;
  7594. (* ---- SYSTEM.MOVE ----- *)
  7595. |Global.systemMove:
  7596. Evaluate(p0,s0);
  7597. Evaluate(p1,s1);
  7598. Evaluate(p2,s2);
  7599. Emit(Copy(position,s1.op,s0.op,s2.op));
  7600. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7601. (* ---- SYSTEM.NEW ----- *)
  7602. |Global.systemNew:
  7603. Designate(p0,s0);
  7604. Emit(Push(position,s0.op));
  7605. ReleaseOperand(s0);
  7606. Evaluate(p1,s1);
  7607. Emit(Push(position,s1.op));
  7608. ReleaseOperand(s1);
  7609. (* push realtime flag: false by default *)
  7610. Emit(Push(position,false));
  7611. CallThis(position,"Heaps","NewSys",3);
  7612. (* ---- SYSTEM.CALL ----- *)
  7613. |Global.systemRef:
  7614. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7615. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7616. s0.mode := ModeValue;
  7617. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7618. result := s0
  7619. (* ---- INCR ----- *)
  7620. |Global.Incr:
  7621. Designate(p0,operand);
  7622. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7623. Dereference(operand,p0.type.resolved,FALSE);
  7624. END;
  7625. ASSERT(p1 # NIL);
  7626. Evaluate(p1,l);
  7627. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7628. ReleaseOperand(operand); ReleaseOperand(l);
  7629. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7630. (* ---- SUM ----- *)
  7631. |Global.Sum: HALT(200);
  7632. (* ---- ALL ----- *)
  7633. |Global.All: HALT(200);
  7634. (* ---- CAS ----- *)
  7635. |Global.Cas:
  7636. needsTrace := p0.NeedsTrace();
  7637. IF needsTrace THEN ModifyAssignments(true) END;
  7638. Designate(p0,s0);
  7639. Evaluate(p1,s1);
  7640. Evaluate(p2,s2);
  7641. IF needsTrace THEN
  7642. Emit(Push(position, s0.op));
  7643. Emit(Push(position, s1.op));
  7644. Emit(Push(position, s2.op));
  7645. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7646. ELSE
  7647. Emit(Cas(position,s0.op,s1.op,s2.op));
  7648. END;
  7649. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7650. IF needsTrace THEN ModifyAssignments(false) END;
  7651. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7652. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7653. IF conditional THEN
  7654. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7655. BrL(falseLabel);
  7656. ReleaseIntermediateOperand(res);
  7657. END;
  7658. (* ---- DIM ----- *)
  7659. |Global.Dim:
  7660. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7661. Designate(p0,s0);
  7662. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7663. Dereference(s0,p0.type.resolved,FALSE);
  7664. END;
  7665. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7666. ReleaseOperand(s0);
  7667. (* ---- RESHAPE ----- *)
  7668. |Global.Reshape:
  7669. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7670. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7671. left.SetType(procedure.type);
  7672. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7673. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7674. END;
  7675. (* ---- SYSTEM.TYPECODE ----- *)
  7676. |Global.systemTypeCode:
  7677. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7678. IF type.resolved IS SyntaxTree.PointerType THEN
  7679. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7680. END;
  7681. result.op := TypeDescriptorAdr(type);
  7682. IF ~newObjectFile THEN
  7683. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7684. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7685. END;
  7686. result.mode := ModeValue;
  7687. (* ---- SYSTEM.TRACE ----- *)
  7688. |Global.systemTrace:
  7689. SystemTrace(x.parameters, x.position);
  7690. (* ----- CONNECT ------*)
  7691. |Global.Connect:
  7692. IF backend.cellsAreObjects THEN
  7693. PushPort(p0);
  7694. PushPort(p1);
  7695. IF p2 # NIL THEN
  7696. Evaluate(p2, s2);
  7697. Emit(Push(p2.position, s2.op));
  7698. ReleaseOperand(s2);
  7699. ELSE
  7700. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7701. END;
  7702. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7703. ELSE
  7704. Warning(x.position, "cannot run on final hardware");
  7705. END;
  7706. (* ----- DELEGATE ------*)
  7707. |Global.Delegate:
  7708. IF backend.cellsAreObjects THEN
  7709. PushPort(p0);
  7710. PushPort(p1);
  7711. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7712. ELSE
  7713. Warning(x.position, "cannot run on final hardware");
  7714. END;
  7715. (* ----- SEND ------*)
  7716. |Global.Send:
  7717. Evaluate(p0,s0);
  7718. Evaluate(p1,s1);
  7719. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7720. Emit(Push(position,s0.op));
  7721. Emit(Push(position,s1.op));
  7722. (*
  7723. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7724. *)
  7725. IF ~backend.cellsAreObjects THEN
  7726. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7727. END;
  7728. ReleaseOperand(s0);
  7729. ReleaseOperand(s1);
  7730. IF backend.cellsAreObjects THEN
  7731. CallThis(position,"ActiveCellsRuntime","Send",2);
  7732. ELSE
  7733. CallThis(position,ChannelModuleName,"Send",2);
  7734. END;
  7735. (* ----- RECEIVE ------*)
  7736. |Global.Receive:
  7737. Evaluate(p0,s0);
  7738. Emit(Push(position,s0.op));
  7739. Designate(p1,s1);
  7740. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7741. Emit(Push(position,s1.op));
  7742. IF p2 # NIL THEN
  7743. Designate(p2,s2);
  7744. Emit(Push(position,s2.op));
  7745. END;
  7746. (*
  7747. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7748. *)
  7749. IF ~backend.cellsAreObjects THEN
  7750. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7751. END;
  7752. ReleaseOperand(s0);
  7753. ReleaseOperand(s1);
  7754. ReleaseOperand(s2);
  7755. IF backend.cellsAreObjects THEN
  7756. IF p2 = NIL THEN
  7757. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7758. ELSE
  7759. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7760. END;
  7761. ELSE
  7762. IF p2 = NIL THEN
  7763. CallThis(position,ChannelModuleName,"Receive",2)
  7764. ELSE
  7765. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7766. END;
  7767. END;
  7768. | Global.systemSpecial:
  7769. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7770. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7771. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7772. (* determine if parameters are of the VAR kind *)
  7773. ASSERT(x.parameters.Length() <= 3);
  7774. formalParameter := procedureType.firstParameter;
  7775. FOR i := 0 TO x.parameters.Length() - 1 DO
  7776. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7777. formalParameter := formalParameter.nextParameter
  7778. END;
  7779. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7780. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7781. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7782. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7783. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7784. IF procedureType.returnType # NIL THEN
  7785. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7786. Emit(Result(position, res));
  7787. (*InitOperand(result,ModeValue);
  7788. result.op := res;
  7789. *)
  7790. IF ~conditional THEN
  7791. InitOperand(result,ModeValue); result.op := res;
  7792. ELSE
  7793. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7794. BrL(falseLabel);
  7795. ReleaseIntermediateOperand(res);
  7796. END;
  7797. END
  7798. ELSE (* function not yet implemented *)
  7799. Error(position,"not yet implemented");
  7800. END;
  7801. destination := dest;
  7802. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  7803. END VisitBuiltinCallDesignator;
  7804. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  7805. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  7806. BEGIN
  7807. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  7808. dest := destination; destination := emptyOperand;
  7809. Expression(x.left);
  7810. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  7811. ELSIF isUnchecked THEN (* no check *)
  7812. ELSE
  7813. trueL := NewLabel();
  7814. falseL := NewLabel();
  7815. IF IsPointerToRecord(x.left.type,recordType) THEN
  7816. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7817. Emit(Mov(position,tag, result.op));
  7818. IF result.mode # ModeValue THEN
  7819. ptr := tag;
  7820. IntermediateCode.MakeMemory(ptr,addressType);
  7821. Emit(Mov(position,tag, ptr));
  7822. END;
  7823. IF ~backend.cooperative THEN
  7824. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7825. END;
  7826. IntermediateCode.MakeMemory(tag,addressType);
  7827. ELSE
  7828. tag := result.tag;
  7829. END;
  7830. TypeTest(tag,x.type,trueL,falseL);
  7831. ReleaseIntermediateOperand(tag);
  7832. SetLabel(falseL);
  7833. EmitTrap(position,TypeCheckTrap);
  7834. SetLabel(trueL);
  7835. END;
  7836. destination := dest;
  7837. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  7838. END VisitTypeGuardDesignator;
  7839. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  7840. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  7841. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  7842. VAR label: Label; pc: LONGINT;
  7843. BEGIN
  7844. IF backend.cooperative & ~isUnchecked THEN
  7845. pc := section.pc;
  7846. label := NewLabel();
  7847. BrneL(label, operand.op, nil);
  7848. EmitTrap(position, NilPointerTrap);
  7849. SetLabel(label);
  7850. INC(statCoopNilCheck, section.pc - pc);
  7851. END;
  7852. END NilCheck;
  7853. BEGIN
  7854. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  7855. ReuseCopy(dereferenced,operand.op);
  7856. ReleaseOperand(operand);
  7857. operand.mode := ModeReference;
  7858. operand.op := dereferenced;
  7859. operand.tag := dereferenced;
  7860. UseIntermediateOperand(operand.tag);
  7861. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  7862. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  7863. ReleaseIntermediateOperand(operand.tag);
  7864. operand.tag := TypeDescriptorAdr(type);
  7865. IF ~newObjectFile THEN
  7866. IntermediateCode.MakeMemory(operand.tag,addressType);
  7867. END;
  7868. ELSE
  7869. IF ~backend.cooperative THEN
  7870. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7871. END;
  7872. IntermediateCode.MakeMemory(operand.tag,addressType);
  7873. END;
  7874. NilCheck(operand.op);
  7875. ELSIF type IS SyntaxTree.ArrayType THEN
  7876. IF isUnsafe THEN
  7877. NilCheck(operand.op);
  7878. ReleaseIntermediateOperand(operand.tag);
  7879. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7880. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  7881. ELSE
  7882. operand.tag := emptyOperand;
  7883. END;
  7884. ELSE
  7885. NilCheck(operand.op);
  7886. IF backend.cooperative THEN
  7887. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  7888. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7889. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  7890. ELSE
  7891. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  7892. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  7893. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7894. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  7895. END;
  7896. END;
  7897. ELSIF type IS SyntaxTree.MathArrayType THEN
  7898. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  7899. IntermediateCode.MakeMemory(operand.op,addressType);
  7900. ELSE HALT(100);
  7901. END;
  7902. END Dereference;
  7903. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  7904. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  7905. BEGIN
  7906. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  7907. dest := destination; destination := emptyOperand;
  7908. Evaluate(x.left,d);
  7909. type := x.type.resolved;
  7910. prevIsUnchecked := isUnchecked;
  7911. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  7912. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  7913. END;
  7914. Dereference(d,type,IsUnsafePointer(x.left.type));
  7915. isUnchecked := prevIsUnchecked;
  7916. result := d;
  7917. 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
  7918. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  7919. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7920. END;
  7921. END;
  7922. destination := dest;
  7923. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  7924. END VisitDereferenceDesignator;
  7925. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  7926. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  7927. BEGIN
  7928. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  7929. dest := destination; destination := emptyOperand;
  7930. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  7931. tag := result.op;
  7932. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  7933. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  7934. StaticCallOperand(result,procedure.super);
  7935. ReleaseIntermediateOperand(result.tag);
  7936. UseIntermediateOperand(tag); (* necessary ? *)
  7937. result.tag := tag;
  7938. destination := dest;
  7939. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  7940. END VisitSupercallDesignator;
  7941. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  7942. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  7943. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  7944. name: Basic.SegmentedName;
  7945. BEGIN
  7946. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  7947. dest := destination; destination := emptyOperand;
  7948. scope := currentScope;
  7949. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  7950. scope := scope.outerScope;
  7951. END;
  7952. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  7953. IF newObjectFile THEN
  7954. moduleSection := meta.ModuleSection();
  7955. IF backend.cooperative THEN
  7956. moduleOffset := 0;
  7957. ELSE
  7958. moduleOffset := moduleSection.pc;
  7959. END;
  7960. result.mode := ModeValue;
  7961. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  7962. ELSE
  7963. Symbol(moduleSelf,result);
  7964. IntermediateCode.MakeMemory(result.op,addressType);
  7965. END
  7966. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  7967. result.mode := ModeValue;
  7968. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  7969. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  7970. ELSE
  7971. GetBaseRegister(basereg,currentScope,scope);
  7972. InitOperand(result,ModeReference);
  7973. result.op := basereg;
  7974. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  7975. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  7976. IF backend.cooperative THEN
  7977. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  7978. END;
  7979. (* tag must be loaded when dereferencing SELF pointer *)
  7980. END;
  7981. destination := dest;
  7982. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  7983. END VisitSelfDesignator;
  7984. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  7985. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  7986. BEGIN
  7987. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  7988. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  7989. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7990. parameter := procedureType.returnParameter;
  7991. VisitParameter(parameter);
  7992. IF Trace THEN TraceExit("VisitResultDesignator") END;
  7993. END VisitResultDesignator;
  7994. (** values *)
  7995. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  7996. BEGIN
  7997. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  7998. IF conditional THEN
  7999. IF x.value THEN BrL(trueLabel)
  8000. ELSE BrL(falseLabel)
  8001. END;
  8002. ELSE
  8003. InitOperand(result,ModeValue);
  8004. IF x.value THEN result.op := true ELSE result.op := false END;
  8005. END;
  8006. END VisitBooleanValue;
  8007. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8008. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8009. BEGIN
  8010. Global.GetModuleSegmentedName(module.module, name);
  8011. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8012. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8013. RETURN section
  8014. END GetDataSection;
  8015. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8016. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8017. BEGIN
  8018. type := vop.type;
  8019. data := GetDataSection();
  8020. pc := EnterImmediate(data,vop);
  8021. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8022. IntermediateCode.MakeMemory(vop, type);
  8023. END GetImmediateMem;
  8024. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8025. BEGIN
  8026. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8027. InitOperand(result,ModeValue);
  8028. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8029. IF ~supportedImmediate(result.op) &~inData THEN
  8030. GetImmediateMem(result.op)
  8031. END;
  8032. END VisitIntegerValue;
  8033. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8034. BEGIN
  8035. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8036. InitOperand(result,ModeValue);
  8037. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8038. END VisitCharacterValue;
  8039. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8040. BEGIN
  8041. IF Trace THEN TraceEnter("VisitSetValue") END;
  8042. InitOperand(result,ModeValue);
  8043. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8044. END VisitSetValue;
  8045. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8046. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8047. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8048. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8049. BEGIN
  8050. numberElements := x.elements.Length();
  8051. FOR i := 0 TO numberElements-1 DO
  8052. expression := x.elements.GetExpression(i);
  8053. IF expression IS SyntaxTree.MathArrayExpression THEN
  8054. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8055. ELSE
  8056. inData := TRUE;
  8057. Evaluate(expression,op);
  8058. irv.Emit(Data(position,op.op));
  8059. inData := FALSE;
  8060. ReleaseOperand(op);
  8061. END;
  8062. END;
  8063. END RecursiveData;
  8064. BEGIN
  8065. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8066. IF ~TryConstantDeclaration() THEN
  8067. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8068. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8069. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8070. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8071. ELSE
  8072. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8073. END;
  8074. RecursiveData(x.array);
  8075. InitOperand(result,ModeReference);
  8076. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8077. END
  8078. END VisitMathArrayValue;
  8079. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8080. VAR constant: Sections.Section;
  8081. BEGIN
  8082. IF constantDeclaration = NIL THEN
  8083. RETURN FALSE
  8084. ELSE
  8085. (* Is a constant in this module: did we generate it already? *)
  8086. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8087. IF constant # NIL THEN
  8088. InitOperand(result,ModeReference);
  8089. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8090. RETURN TRUE;
  8091. END;
  8092. END;
  8093. RETURN FALSE
  8094. END TryConstantDeclaration;
  8095. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8096. BEGIN
  8097. constantDeclaration := x;
  8098. x.value.resolved.Accept(SELF);
  8099. END VisitConstant;
  8100. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8101. BEGIN
  8102. IF Trace THEN TraceEnter("VisitRealValue") END;
  8103. InitOperand(result,ModeValue);
  8104. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8105. END VisitRealValue;
  8106. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8107. VAR
  8108. componentType: SyntaxTree.Type;
  8109. BEGIN
  8110. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8111. ASSERT(x.type IS SyntaxTree.ComplexType);
  8112. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8113. InitOperand(result,ModeValue);
  8114. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8115. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8116. END VisitComplexValue;
  8117. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8118. VAR i: LONGINT; name: Basic.SegmentedName;
  8119. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8120. BEGIN
  8121. IF Trace THEN TraceEnter("VisitStringValue") END;
  8122. IF ~TryConstantDeclaration() THEN
  8123. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8124. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8125. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8126. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8127. ELSE
  8128. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8129. END;
  8130. FOR i := 0 TO x.length-1 DO
  8131. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8132. irv.Emit(Data(position,op));
  8133. END;
  8134. InitOperand(result,ModeReference);
  8135. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8136. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8137. END
  8138. END VisitStringValue;
  8139. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8140. BEGIN
  8141. IF Trace THEN TraceEnter("VisitNilValue") END;
  8142. InitOperand(result,ModeValue);
  8143. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8144. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8145. END VisitNilValue;
  8146. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8147. BEGIN
  8148. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8149. InitOperand(result,ModeValue);
  8150. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8151. END VisitEnumerationValue;
  8152. (** symbols *)
  8153. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8154. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8155. END VisitImport;
  8156. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8157. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8158. BEGIN
  8159. IF scope # baseScope THEN
  8160. (* left := [fp+8] *)
  8161. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8162. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8163. ReuseCopy(left,right);
  8164. ReleaseIntermediateOperand(right);
  8165. scope := scope.outerScope; DEC(level);
  8166. (* { left := [left+8] } *)
  8167. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8168. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8169. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8170. Emit(Mov(position,left,right));
  8171. scope := scope.outerScope; DEC(level);
  8172. END;
  8173. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8174. result := left;
  8175. ELSE
  8176. result := fp;
  8177. END;
  8178. END GetBaseRegister;
  8179. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8180. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8181. BEGIN
  8182. IF Trace THEN TraceEnter("VisitVariable"); END;
  8183. type := x.type.resolved;
  8184. IF (x.useRegister) THEN
  8185. InitOperand(result, ModeValue);
  8186. IF x.registerNumber < 0 THEN
  8187. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8188. reg := x.registerNumber;
  8189. ELSE
  8190. reg := registerUsageCount.Map(x.registerNumber);
  8191. UseRegister(reg);
  8192. END;
  8193. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8194. ELSIF x.externalName # NIL THEN
  8195. InitOperand(result,ModeReference);
  8196. Basic.ToSegmentedName(x.externalName^, name);
  8197. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8198. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8199. InitOperand(result,ModeReference);
  8200. GetBaseRegister(result.op,currentScope,x.scope);
  8201. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8202. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8203. InitOperand(result,ModeReference);
  8204. GetCodeSectionNameForSymbol(x,name);
  8205. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8206. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8207. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8208. InitOperand(result,ModeReference);
  8209. GetCodeSectionNameForSymbol(x,name);
  8210. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8211. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8212. ELSE (* field, left designator must have been emitted *)
  8213. ASSERT(result.mode = ModeReference);
  8214. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8215. ReuseCopy(temp,result.op);
  8216. ReleaseIntermediateOperand(result.op);
  8217. result.op := temp;
  8218. END;
  8219. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8220. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8221. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8222. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8223. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8224. END;
  8225. END;
  8226. END;
  8227. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8228. ValueToCondition(result);
  8229. ELSIF type IS SyntaxTree.ProcedureType THEN
  8230. ReleaseIntermediateOperand(result.tag);
  8231. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8232. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8233. UseIntermediateOperand(result.tag);
  8234. ELSE
  8235. result.tag := nil; (* nil *)
  8236. END;
  8237. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8238. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8239. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8240. ReleaseIntermediateOperand(result.tag);
  8241. Global.GetSymbolSegmentedName(x,name);
  8242. Basic.AppendToSegmentedName(name,"@len");
  8243. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8244. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8245. ELSE
  8246. END;
  8247. ELSE
  8248. ReleaseIntermediateOperand(result.tag);
  8249. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8250. END;
  8251. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8252. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8253. ReleaseIntermediateOperand(result.tag);
  8254. result.tag := result.op;
  8255. UseIntermediateOperand(result.tag);
  8256. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8257. IntermediateCode.MakeMemory(result.op,addressType);
  8258. END;
  8259. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8260. ReleaseIntermediateOperand(result.tag);
  8261. result.tag := TypeDescriptorAdr(type);
  8262. IF ~newObjectFile THEN
  8263. IntermediateCode.MakeMemory(result.tag,addressType);
  8264. END;
  8265. UseIntermediateOperand(result.tag);
  8266. (* tag for pointer type computed not here but during dereferencing *)
  8267. END;
  8268. IF Trace THEN TraceExit("VisitVariable") END;
  8269. END VisitVariable;
  8270. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8271. BEGIN
  8272. VisitVariable(property);
  8273. END VisitProperty;
  8274. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8275. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8276. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8277. BEGIN
  8278. type := x.type.resolved;
  8279. IF Trace THEN TraceEnter("VisitParameter") END;
  8280. IF x.ownerType IS SyntaxTree.CellType THEN
  8281. ptype := x.type.resolved;
  8282. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8283. IF ~(ptype IS SyntaxTree.PortType) THEN
  8284. InitOperand(result,ModeReference);
  8285. GetCodeSectionNameForSymbol(x,name);
  8286. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8287. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8288. RETURN
  8289. ELSE
  8290. InitOperand(result, ModeValue);
  8291. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8292. adr := 0;
  8293. WHILE parameter # x DO
  8294. parameterType := parameter.type;
  8295. inc := 1;
  8296. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8297. INC(adr, inc);
  8298. parameter := parameter.nextParameter
  8299. END;
  8300. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8301. RETURN
  8302. END;
  8303. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8304. InitOperand(result,ModeReference);
  8305. GetCodeSectionNameForSymbol(x,name);
  8306. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8307. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8308. RETURN
  8309. ELSE
  8310. GetBaseRegister(basereg,currentScope,x.scope);
  8311. InitOperand(result,ModeReference);
  8312. result.op := basereg;
  8313. END;
  8314. IF IsOpenArray(type) THEN
  8315. result.tag := basereg;
  8316. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8317. IntermediateCode.MakeMemory(result.op,addressType);
  8318. IF Global.IsOberonProcedure(x.ownerType) THEN
  8319. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8320. UseIntermediateOperand(result.tag);
  8321. ELSE
  8322. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8323. END;
  8324. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8325. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8326. ELSIF IsStaticArray(type) THEN
  8327. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8328. IntermediateCode.MakeMemory(result.op,addressType);
  8329. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8330. ELSIF type IS SyntaxTree.MathArrayType THEN
  8331. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8332. WITH type: SyntaxTree.MathArrayType DO
  8333. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8334. IF type.form = SyntaxTree.Tensor THEN
  8335. ELSIF type.form = SyntaxTree.Open THEN
  8336. result.tag := result.op;
  8337. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8338. IntermediateCode.MakeMemory(result.op,addressType);
  8339. UseIntermediateOperand(result.tag);
  8340. ELSIF type.form = SyntaxTree.Static THEN
  8341. IF x.kind = SyntaxTree.ConstParameter THEN
  8342. IntermediateCode.MakeMemory(result.op,addressType);
  8343. END;
  8344. ELSE HALT(100)
  8345. END;
  8346. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8347. IF type.form = SyntaxTree.Tensor THEN
  8348. ToMemory(result.op,addressType,0);
  8349. ELSIF type.form = SyntaxTree.Open THEN
  8350. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8351. ReuseCopy(result.tag, mem);
  8352. ReleaseIntermediateOperand(mem);
  8353. ReleaseIntermediateOperand(result.op);
  8354. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8355. ELSIF type.form = SyntaxTree.Static THEN
  8356. IntermediateCode.MakeMemory(result.op,addressType);
  8357. ELSE HALT(100)
  8358. END;
  8359. ELSE HALT(100)
  8360. END;
  8361. END;
  8362. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8363. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8364. IntermediateCode.MakeMemory(result.op,addressType);
  8365. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8366. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8367. END;
  8368. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8369. ValueToCondition(result);
  8370. ELSIF type IS SyntaxTree.ProcedureType THEN
  8371. ReleaseIntermediateOperand(result.tag);
  8372. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8373. IF x.kind = SyntaxTree.VarParameter THEN
  8374. ReuseCopy(result.tag,result.op);
  8375. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8376. IntermediateCode.MakeMemory(result.tag,addressType);
  8377. ELSE
  8378. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8379. UseIntermediateOperand(result.tag);
  8380. END;
  8381. ELSE
  8382. result.tag := nil;
  8383. END;
  8384. (* tag for pointer type computed not here but during dereferencing *)
  8385. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8386. ReleaseIntermediateOperand(result.tag);
  8387. result.tag := basereg;
  8388. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8389. IntermediateCode.MakeMemory(result.tag,addressType);
  8390. UseIntermediateOperand(result.tag);
  8391. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) 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. END;
  8399. IF Trace THEN TraceExit("VisitParameter") END;
  8400. END VisitParameter;
  8401. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8402. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8403. BEGIN
  8404. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8405. (* left.p: left already emitted *)
  8406. tag := result.op; (* value of pointer to left *)
  8407. (* get type desc *)
  8408. tmp := result.tag;
  8409. IntermediateCode.MakeMemory(tmp,addressType);
  8410. (* get method adr *)
  8411. Reuse1(reg,tmp);
  8412. ReleaseIntermediateOperand(tmp);
  8413. IF backend.cooperative THEN
  8414. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8415. WHILE recordType.baseType # NIL DO
  8416. recordType := recordType.GetBaseRecord ();
  8417. END;
  8418. GetRecordTypeName (recordType,name);
  8419. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8420. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8421. offset := 0;
  8422. ELSE
  8423. offset := 2;
  8424. END;
  8425. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8426. ELSE
  8427. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8428. END;
  8429. InitOperand(operand,ModeReference);
  8430. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8431. operand.op := reg;
  8432. operand.tag := tag;
  8433. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8434. END DynamicCallOperand;
  8435. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8436. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8437. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8438. BEGIN
  8439. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8440. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8441. tag := operand.op;
  8442. ReleaseIntermediateOperand(operand.tag);
  8443. ELSE tag := nil
  8444. END;
  8445. IF x.isInline THEN
  8446. sectionType := Sections.InlineCodeSection;
  8447. ELSE
  8448. sectionType := Sections.CodeSection;
  8449. END;
  8450. IF x.externalName # NIL THEN
  8451. Basic.ToSegmentedName(x.externalName^, name);
  8452. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8453. ELSE
  8454. GetCodeSectionNameForSymbol(x, name);
  8455. IF (x.scope.ownerModule = module.module) THEN
  8456. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8457. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8458. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8459. IF source.pc = 0 THEN (* no code yet *)
  8460. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8461. END;
  8462. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8463. bits := x.procedureScope.body.code.inlineCode;
  8464. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8465. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8466. binary.CopyBits(bits, 0, bits.GetSize());
  8467. source.SetResolved(binary);
  8468. ELSE
  8469. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8470. END;
  8471. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8472. END;
  8473. InitOperand(operand,ModeValue);
  8474. operand.op := reg;
  8475. operand.tag := tag;
  8476. IF Trace THEN TraceExit("StaticCallOperand") END;
  8477. END StaticCallOperand;
  8478. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8479. (* handle expressions of the form designator.procedure or procedure *)
  8480. BEGIN
  8481. IF Trace THEN TraceEnter("VisitProcedure") END;
  8482. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8483. DynamicCallOperand(result,x);
  8484. ELSIF x.isInline THEN
  8485. StaticCallOperand(result,x);
  8486. ELSE
  8487. StaticCallOperand(result,x);
  8488. END;
  8489. IF Trace THEN TraceExit("VisitProcedure") END;
  8490. END VisitProcedure;
  8491. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8492. BEGIN
  8493. VisitProcedure(x);
  8494. END VisitOperator;
  8495. (** statements *)
  8496. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8497. BEGIN
  8498. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8499. Expression(x.call);
  8500. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8501. ReleaseOperand(result)
  8502. END;
  8503. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8504. END VisitProcedureCallStatement;
  8505. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8506. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8507. leftBase, rightBase: SyntaxTree.Type;
  8508. procedureName,s: SyntaxTree.IdentifierString;
  8509. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8510. size: LONGINT; rightKind: LONGINT;
  8511. dummy: IntermediateCode.Operand;
  8512. CONST moduleName = "FoxArrayBase";
  8513. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8514. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8515. BEGIN
  8516. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8517. IF base IS SyntaxTree.MathArrayType THEN
  8518. base := OpenArray(base(SyntaxTree.MathArrayType));
  8519. END;
  8520. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8521. result.SetArrayBase(base);
  8522. RETURN result
  8523. END OpenArray;
  8524. BEGIN
  8525. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8526. SaveRegisters();ReleaseUsedRegisters(saved);
  8527. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8528. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8529. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8530. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8531. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8532. IF leftType.form = SyntaxTree.Tensor THEN
  8533. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8534. ELSIF leftType.form = SyntaxTree.Open THEN
  8535. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8536. ELSIF leftType.form = SyntaxTree.Static THEN
  8537. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8538. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8539. END;
  8540. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8541. IF procedure = NIL THEN
  8542. s := "Instruction not supported on target, emulation procedure ";
  8543. Strings.Append(s,moduleName);
  8544. Strings.Append(s,".");
  8545. Strings.Append(s,procedureName);
  8546. Strings.Append(s," not present");
  8547. Error(position,s);
  8548. ELSE
  8549. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8550. parameter.SetType(leftType);
  8551. parameter.SetAccess(SyntaxTree.Internal);
  8552. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8553. parameter.SetKind(rightKind);
  8554. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8555. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8556. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8557. StaticCallOperand(result,procedure);
  8558. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8559. ReleaseOperand(result);
  8560. END;
  8561. RestoreRegisters(saved);
  8562. END;
  8563. END AssignMathArray;
  8564. VAR modifyAssignmentCounter := 0: LONGINT;
  8565. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8566. VAR processor,mem,dst: IntermediateCode.Operand;
  8567. BEGIN
  8568. IF value.intValue = true.intValue THEN
  8569. INC(modifyAssignmentCounter);
  8570. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8571. modifyAssignmentsPC := section.pc;
  8572. ELSE
  8573. DEC(modifyAssignmentCounter);
  8574. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8575. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8576. END;
  8577. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8578. dst := NewRegisterOperand (addressType);
  8579. Emit(Mov(position,dst, processor));
  8580. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8581. Emit(Mov(position,mem, value));
  8582. ReleaseIntermediateOperand(dst);
  8583. END ModifyAssignments;
  8584. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8585. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8586. BEGIN
  8587. type := left.type.resolved;
  8588. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8589. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8590. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8591. IF procedureType.returnParameter = parameter THEN
  8592. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8593. END;
  8594. END;
  8595. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8596. END CopySize;
  8597. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8598. VAR
  8599. leftO, rightO: Operand;
  8600. mem, sizeOp: IntermediateCode.Operand;
  8601. leftType, rightType, componentType: SyntaxTree.Type;
  8602. size: LONGINT;
  8603. parameters: SyntaxTree.ExpressionList;
  8604. procedure: SyntaxTree.Procedure;
  8605. call: SyntaxTree.ProcedureCallDesignator;
  8606. designator: SyntaxTree.Designator;
  8607. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8608. VAR procedureType: SyntaxTree.ProcedureType;
  8609. BEGIN
  8610. IF ReturnedAsParameter(right.type) THEN
  8611. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8612. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8613. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8614. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8615. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8616. IF right.id = Global.Reshape THEN RETURN TRUE
  8617. END;
  8618. END;
  8619. END;
  8620. END;
  8621. RETURN FALSE
  8622. END CanPassAsResultParameter;
  8623. BEGIN
  8624. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8625. leftType := left.type.resolved; rightType:= right.type.resolved;
  8626. IF backend.cooperative & left.NeedsTrace() THEN
  8627. ModifyAssignments(true);
  8628. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8629. Designate(right, rightO);
  8630. Designate(left, leftO);
  8631. ASSERT(leftO.mode = ModeReference);
  8632. TransferToRegister(leftO.op, leftO.op);
  8633. TransferToRegister(rightO.op, rightO.op);
  8634. Emit(Push(position, leftO.op));
  8635. Emit(Push(position, rightO.op));
  8636. CallAssignMethod(leftO.op, rightO.op, left.type);
  8637. Emit(Pop(position, rightO.op));
  8638. Emit(Pop(position, leftO.op));
  8639. sizeOp := CopySize(left);
  8640. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8641. ReleaseOperand(leftO);
  8642. ReleaseOperand(rightO);
  8643. ELSE
  8644. Evaluate(right,rightO);
  8645. Designate(left,leftO);
  8646. ASSERT(leftO.mode = ModeReference);
  8647. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8648. (* copy procedure address first *)
  8649. MakeMemory(mem,leftO.op,addressType,0);
  8650. Emit(Mov(position,mem,rightO.op));
  8651. ReleaseIntermediateOperand(mem);
  8652. (* copy pointer address *)
  8653. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8654. CallAssignPointer(leftO.tag, rightO.tag);
  8655. ELSE
  8656. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8657. CallAssignPointer(leftO.op, rightO.op);
  8658. END;
  8659. ReleaseOperand(leftO);
  8660. ReleaseOperand(rightO);
  8661. END;
  8662. ModifyAssignments(false);
  8663. RETURN;
  8664. END;
  8665. IF CanPassAsResultParameter(right) THEN
  8666. procedureResultDesignator := left(SyntaxTree.Designator);
  8667. Expression(right);
  8668. procedureResultDesignator := NIL;
  8669. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8670. (* left <-- ALIAS OF right: zerocopy *)
  8671. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8672. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8673. designator.SetType(procedure.type);
  8674. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8675. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8676. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8677. END;
  8678. ELSIF leftType IS SyntaxTree.RangeType THEN
  8679. (* LHS is of array range type *)
  8680. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8681. Evaluate(right, rightO);
  8682. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8683. (* first *)
  8684. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8685. Emit(Mov(position,mem, rightO.op));
  8686. ReleaseIntermediateOperand(mem);
  8687. (* last *)
  8688. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8689. Emit(Mov(position,mem, rightO.tag));
  8690. ReleaseIntermediateOperand(mem);
  8691. (* step *)
  8692. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8693. Emit(Mov(position,mem, rightO.extra));
  8694. ReleaseIntermediateOperand(mem);
  8695. ReleaseOperand(rightO);
  8696. ReleaseOperand(leftO)
  8697. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8698. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8699. Evaluate(right, rightO);
  8700. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8701. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8702. (* real part *)
  8703. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8704. Emit(Mov(position,mem, rightO.op));
  8705. ReleaseIntermediateOperand(mem);
  8706. (* imaginary part *)
  8707. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8708. Emit(Mov(position,mem, rightO.tag));
  8709. ReleaseIntermediateOperand(mem);
  8710. ReleaseOperand(rightO);
  8711. ReleaseOperand(leftO)
  8712. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8713. OR (leftType IS SyntaxTree.PortType) THEN
  8714. (* rightO := leftO;*)
  8715. Evaluate(right,rightO);
  8716. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8717. Designate(left,leftO);
  8718. IF leftO.mode = ModeReference THEN
  8719. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8720. destination := mem;
  8721. ELSE
  8722. destination := leftO.op;
  8723. END;
  8724. ReleaseOperand(leftO);
  8725. IF destination.mode # IntermediateCode.Undefined THEN
  8726. Emit(Mov(position,destination,rightO.op));
  8727. END;
  8728. ReleaseOperand(rightO);
  8729. ReleaseIntermediateOperand(mem);
  8730. IntermediateCode.InitOperand(destination);
  8731. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8732. Evaluate(right,rightO);
  8733. Designate(left,leftO);
  8734. MakeMemory(mem,leftO.op,addressType,0);
  8735. Emit(Mov(position,mem,rightO.op));
  8736. ReleaseIntermediateOperand(mem);
  8737. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8738. (* delegate *)
  8739. (*
  8740. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8741. *)
  8742. Emit(Mov(position,leftO.tag,rightO.tag));
  8743. END;
  8744. ReleaseOperand(leftO);
  8745. ReleaseOperand(rightO);
  8746. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8747. Designate(right,rightO);
  8748. Designate(left,leftO);
  8749. sizeOp := CopySize(left);
  8750. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8751. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8752. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8753. IF (rightType IS SyntaxTree.StringType) THEN
  8754. CopyString(left,right);
  8755. 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
  8756. Designate(right,rightO);
  8757. Designate(left,leftO);
  8758. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8759. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8760. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8761. ELSE
  8762. HALT(201)
  8763. END;
  8764. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8765. AssignMathArray(left,right);
  8766. ELSE
  8767. HALT(200);
  8768. END;
  8769. END Assign;
  8770. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8771. BEGIN
  8772. IF Trace THEN TraceEnter("VisitAssignment") END;
  8773. Assign(x.left,x.right);
  8774. IF Trace THEN TraceExit("VisitAssignment") END;
  8775. END VisitAssignment;
  8776. PROCEDURE EmitCooperativeSwitch;
  8777. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8778. BEGIN
  8779. ASSERT (cooperativeSwitches);
  8780. pc := section.pc;
  8781. IF lastSwitchPC = section.pc THEN RETURN END;
  8782. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8783. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8784. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8785. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  8786. INC(statCoopSwitch, section.pc - pc);
  8787. END EmitCooperativeSwitch;
  8788. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8789. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  8790. BEGIN
  8791. p0 := communication.left; p1 := communication.right;
  8792. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  8793. Evaluate(p0,s0);
  8794. Evaluate(p1,s1);
  8795. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8796. Emit(Push(position,s0.op));
  8797. Emit(Push(position,s1.op));
  8798. (*
  8799. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8800. *)
  8801. IF ~backend.cellsAreObjects THEN
  8802. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  8803. END;
  8804. ReleaseOperand(s0);
  8805. ReleaseOperand(s1);
  8806. IF backend.cellsAreObjects THEN
  8807. CallThis(position,"ActiveCellsRuntime","Send",2);
  8808. ELSE
  8809. CallThis(position,ChannelModuleName,"Send",2);
  8810. END;
  8811. (* ----- RECEIVE ------*)
  8812. ELSE
  8813. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  8814. tmp := p0; p0 := p1; p1 := tmp;
  8815. END;
  8816. Evaluate(p0,s0);
  8817. Emit(Push(position,s0.op));
  8818. Designate(p1,s1);
  8819. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8820. Emit(Push(position,s1.op));
  8821. (*
  8822. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8823. *)
  8824. IF ~backend.cellsAreObjects THEN
  8825. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  8826. END;
  8827. ReleaseOperand(s0);
  8828. ReleaseOperand(s1);
  8829. IF backend.cellsAreObjects THEN
  8830. CallThis(position,"ActiveCellsRuntime","Receive",2);
  8831. ELSE
  8832. CallThis(position,ChannelModuleName,"Receive",2)
  8833. END;
  8834. END;
  8835. END VisitCommunicationStatement;
  8836. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  8837. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  8838. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  8839. VAR true, false: Label; condition, value: BOOLEAN;
  8840. BEGIN
  8841. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  8842. IF condition THEN
  8843. true := NewLabel();
  8844. false := NewLabel();
  8845. Condition(if.condition,true,false);
  8846. SetLabel(true);
  8847. StatementSequence(if.statements);
  8848. BrL(end);
  8849. SetLabel(false);
  8850. ELSE
  8851. IF value THEN (* always true *)
  8852. escape := TRUE;
  8853. StatementSequence(if.statements);
  8854. (* no branch necessary -- rest skipped *)
  8855. END;
  8856. END;
  8857. END IfPart;
  8858. BEGIN
  8859. IF Trace THEN TraceEnter("VisitIfStatement") END;
  8860. end := NewLabel();
  8861. elsifs := x.ElsifParts();
  8862. IfPart(x.ifPart);
  8863. FOR i := 0 TO elsifs-1 DO
  8864. IF ~escape THEN
  8865. elsif := x.GetElsifPart(i);
  8866. IfPart(elsif);
  8867. END;
  8868. END;
  8869. IF (x.elsePart # NIL) & ~escape THEN
  8870. StatementSequence(x.elsePart);
  8871. END;
  8872. SetLabel(end);
  8873. IF Trace THEN TraceExit("VisitIfStatement") END;
  8874. END VisitIfStatement;
  8875. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  8876. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  8877. BEGIN
  8878. (*IF x.variable.type.resolved = x.type.resolved THEN
  8879. (* always true, do nothing *)
  8880. ELSE*)
  8881. Designate(x.variable,res);
  8882. IF IsPointerToRecord(x.variable.type,recordType) THEN
  8883. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  8884. END;
  8885. trueL := NewLabel();
  8886. TypeTest(res.tag,x.type,trueL,falseL);
  8887. ReleaseOperand(res);
  8888. SetLabel(trueL);
  8889. StatementSequence(x.statements);
  8890. BrL(endL);
  8891. END WithPart;
  8892. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  8893. VAR endL,falseL: Label;i: LONGINT;
  8894. BEGIN
  8895. IF Trace THEN TraceEnter("VisitWithStatement") END;
  8896. endL := NewLabel();
  8897. FOR i := 0 TO x.WithParts()-1 DO
  8898. falseL := NewLabel();
  8899. WithPart(x.GetWithPart(i),falseL,endL);
  8900. SetLabel(falseL);
  8901. END;
  8902. IF x.elsePart = NIL THEN
  8903. IF ~isUnchecked THEN
  8904. EmitTrap(position,WithTrap);
  8905. END;
  8906. ELSE
  8907. StatementSequence(x.elsePart)
  8908. END;
  8909. SetLabel(endL);
  8910. IF Trace THEN TraceExit("VisitWithStatement") END;
  8911. END VisitWithStatement;
  8912. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  8913. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  8914. out,else: Label; label: Label;
  8915. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  8916. symbol: SyntaxTree.Symbol;
  8917. BEGIN
  8918. (*! split case statement into if-elsif statements for large case label lists *)
  8919. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  8920. size := x.max-x.min+1;
  8921. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  8922. END;
  8923. Evaluate(x.variable,var);
  8924. ReuseCopy(tmp,var.op);
  8925. ReleaseIntermediateOperand(var.op);
  8926. var.op := tmp;
  8927. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  8928. Convert(var.op,addressType);
  8929. size := x.max-x.min+1;
  8930. else := NewLabel();
  8931. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  8932. (*
  8933. UniqueId(name,module.module,"case",caseId);
  8934. *)
  8935. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  8936. Global.GetModuleSegmentedName(module.module, name);
  8937. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  8938. symbol := SyntaxTree.NewSymbol(name[1]);
  8939. symbol.SetScope(moduleScope);
  8940. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  8941. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  8942. section.isCaseTable := TRUE;
  8943. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  8944. ReuseCopy(res,var.op);
  8945. ReleaseOperand(var);
  8946. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  8947. Emit(Add(position,res,res,jmp));
  8948. IntermediateCode.MakeMemory(res,addressType);
  8949. Emit(Br(position,res));
  8950. ReleaseIntermediateOperand(res);
  8951. out := NewLabel();
  8952. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  8953. part := x.GetCasePart(i);
  8954. constant := part.firstConstant;
  8955. label := NewLabel();
  8956. SetLabel(label);
  8957. WHILE(constant # NIL) DO (* case labels for this case part *)
  8958. FOR j := constant.min TO constant.max DO
  8959. fixups[j-x.min] := label;
  8960. END;
  8961. constant := constant.next;
  8962. END;
  8963. StatementSequence(part.statements);
  8964. BrL(out);
  8965. END;
  8966. SetLabel(else);
  8967. FOR i := 0 TO size-1 DO
  8968. IF fixups[i] = NIL THEN
  8969. fixups[i] := else;
  8970. END;
  8971. END;
  8972. IF x.elsePart # NIL THEN
  8973. StatementSequence(x.elsePart);
  8974. ELSIF ~isUnchecked THEN
  8975. EmitTrap(position,CaseTrap);
  8976. END;
  8977. SetLabel(out);
  8978. FOR i := 0 TO size-1 DO
  8979. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  8980. section.Emit(Data(position,op));
  8981. END;
  8982. IF Trace THEN TraceExit("VisitCaseStatement") END;
  8983. END VisitCaseStatement;
  8984. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  8985. VAR start: Label; true,false: Label;
  8986. BEGIN
  8987. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  8988. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8989. start := NewLabel();
  8990. true := NewLabel();
  8991. false := NewLabel();
  8992. SetLabel(start);
  8993. Condition(x.condition,true,false);
  8994. SetLabel(true);
  8995. StatementSequence(x.statements);
  8996. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8997. BrL(start);
  8998. SetLabel(false);
  8999. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9000. END VisitWhileStatement;
  9001. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9002. VAR false,true: Label;
  9003. BEGIN
  9004. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9005. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9006. true := NewLabel();
  9007. false := NewLabel();
  9008. SetLabel(false);
  9009. StatementSequence(x.statements);
  9010. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9011. Condition(x.condition,true,false);
  9012. SetLabel(true);
  9013. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9014. END VisitRepeatStatement;
  9015. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9016. VAR
  9017. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9018. temporaryVariable: SyntaxTree.Variable;
  9019. temporaryVariableDesignator : SyntaxTree.Designator;
  9020. BEGIN
  9021. IF Trace THEN TraceEnter("VisitForStatement") END;
  9022. true := NewLabel();
  9023. false := NewLabel();
  9024. start := NewLabel();
  9025. Assign(x.variable,x.from);
  9026. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9027. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9028. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9029. Assign(temporaryVariableDesignator,x.to);
  9030. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9031. IF by > 0 THEN
  9032. cmp := Scanner.LessEqual
  9033. ELSE
  9034. cmp := Scanner.GreaterEqual
  9035. END;
  9036. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9037. binary.SetType(system.booleanType);
  9038. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9039. SetLabel(start);
  9040. Condition(binary,true,false);
  9041. SetLabel(true);
  9042. StatementSequence(x.statements);
  9043. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9044. binary.SetType(x.variable.type);
  9045. Assign(x.variable,binary);
  9046. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9047. BrL(start);
  9048. SetLabel(false);
  9049. IF Trace THEN TraceExit("VisitForStatement") END;
  9050. END VisitForStatement;
  9051. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9052. VAR prevLoop: Label;
  9053. BEGIN
  9054. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9055. prevLoop := currentLoop;
  9056. currentLoop := NewLabel();
  9057. StatementSequence(x.statements);
  9058. SetLabel(currentLoop);
  9059. currentLoop := prevLoop;
  9060. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9061. END VisitExitableBlock;
  9062. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9063. VAR prevLoop,start: Label;
  9064. BEGIN
  9065. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9066. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9067. start := NewLabel();
  9068. prevLoop := currentLoop;
  9069. SetLabel(start);
  9070. currentLoop := NewLabel();
  9071. StatementSequence(x.statements);
  9072. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9073. BrL(start);
  9074. SetLabel(currentLoop);
  9075. currentLoop := prevLoop;
  9076. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9077. END VisitLoopStatement;
  9078. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9079. VAR outer: SyntaxTree.Statement;
  9080. BEGIN
  9081. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9082. IF locked THEN (* r if we jump out of an exclusive block *)
  9083. outer := x.outer;
  9084. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9085. outer := outer.outer;
  9086. END;
  9087. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9088. Lock(FALSE);
  9089. END;
  9090. END;
  9091. BrL(currentLoop);
  9092. IF Trace THEN TraceExit("VisitExitStatement") END;
  9093. END VisitExitStatement;
  9094. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9095. VAR
  9096. expression, parameterDesignator: SyntaxTree.Expression;
  9097. type, componentType: SyntaxTree.Type;
  9098. res, right: Operand;
  9099. left, mem, reg: IntermediateCode.Operand;
  9100. parameter: SyntaxTree.Parameter;
  9101. procedure: SyntaxTree.Procedure;
  9102. procedureType: SyntaxTree.ProcedureType;
  9103. returnTypeOffset: LONGINT;
  9104. delegate: BOOLEAN;
  9105. map: SymbolMap;
  9106. BEGIN
  9107. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9108. expression := x.returnValue;
  9109. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9110. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9111. IF currentIsInline THEN
  9112. IF expression # NIL THEN
  9113. map := currentMapper.Get(NIL);
  9114. IF map # NIL THEN
  9115. Assign(map.to, expression);
  9116. END;
  9117. END;
  9118. BrL(currentInlineExit);
  9119. RETURN;
  9120. END;
  9121. IF expression # NIL THEN
  9122. type := expression.type.resolved;
  9123. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9124. IF locked THEN Lock(FALSE) END;
  9125. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9126. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9127. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9128. (* return without structured return parameter *)
  9129. Evaluate(expression,res);
  9130. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9131. IF locked OR profile THEN
  9132. Emit(Push(position,res.op));
  9133. IF delegate THEN HALT(200) END;
  9134. ReleaseOperand(res);
  9135. IF locked THEN Lock(FALSE) END;
  9136. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9137. reg := NewRegisterOperand(res.op.type);
  9138. Emit(Pop(position,reg));
  9139. Emit(Return(position,reg));
  9140. ReleaseIntermediateOperand(reg);
  9141. ELSE
  9142. Emit(Return(position,res.op));
  9143. ReleaseOperand(res);
  9144. END;
  9145. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9146. THEN
  9147. (* return using structured return parameter *)
  9148. 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)
  9149. OR SemanticChecker.IsPointerType(type));
  9150. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9151. parameter :=procedureType.returnParameter;
  9152. ASSERT(parameter # NIL);
  9153. returnTypeOffset := parameter.offsetInBits;
  9154. (*
  9155. IF parameter# NIL THEN
  9156. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9157. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9158. ELSE
  9159. returnTypeOffset := system.offsetFirstParameter
  9160. END;
  9161. *)
  9162. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9163. IF type IS SyntaxTree.RangeType THEN
  9164. (* array range type *)
  9165. Evaluate(expression, right);
  9166. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9167. Emit(Mov(position,mem, right.op)); (* first *)
  9168. ReleaseIntermediateOperand(mem);
  9169. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9170. Emit(Mov(position,mem, right.tag)); (* last *)
  9171. ReleaseIntermediateOperand(mem);
  9172. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9173. Emit(Mov(position,mem, right.extra)); (* step *)
  9174. ReleaseIntermediateOperand(mem);
  9175. ReleaseOperand(right);
  9176. ELSIF type IS SyntaxTree.ComplexType THEN
  9177. Evaluate(expression, right);
  9178. componentType := type(SyntaxTree.ComplexType).componentType;
  9179. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9180. Emit(Mov(position,mem, right.op)); (* real part *)
  9181. ReleaseIntermediateOperand(mem);
  9182. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9183. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9184. ReleaseIntermediateOperand(mem);
  9185. ReleaseOperand(right);
  9186. ELSE (* covers cases: pointer / record / array *)
  9187. parameter := procedureType.returnParameter;
  9188. checker.SetCurrentScope(currentScope);
  9189. ASSERT(parameter # NIL);
  9190. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9191. Assign(parameterDesignator,expression);
  9192. END;
  9193. ReleaseIntermediateOperand(left);
  9194. IF locked THEN Lock(FALSE) END;
  9195. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9196. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9197. parameter := procedureType.returnParameter;
  9198. checker.SetCurrentScope(currentScope);
  9199. IF parameter = NIL THEN
  9200. Error(procedure.position, "structured return of parameter of procedure not found");
  9201. ELSE
  9202. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9203. Assign(parameterDesignator,expression);
  9204. END;
  9205. IF locked THEN Lock(FALSE) END;
  9206. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9207. ELSE
  9208. HALT(200);
  9209. END;
  9210. ELSE
  9211. IF locked THEN Lock(FALSE) END;
  9212. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9213. END;
  9214. IF backend.cooperative THEN
  9215. BrL(exitLabel);
  9216. ELSE
  9217. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9218. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9219. END;
  9220. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9221. END VisitReturnStatement;
  9222. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9223. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9224. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9225. statements: SyntaxTree.StatementSequence;
  9226. name, suffix: SyntaxTree.IdentifierString;
  9227. BEGIN
  9228. Strings.IntToStr(awaitProcCounter,suffix);
  9229. Strings.Concat("@AwaitProcedure",suffix,name);
  9230. identifier := SyntaxTree.NewIdentifier(name);
  9231. INC(awaitProcCounter);
  9232. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9233. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9234. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9235. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9236. procedure.SetAccess(SyntaxTree.Hidden);
  9237. procedure.SetScope(currentScope);
  9238. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9239. procedureType.SetReturnType(system.booleanType);
  9240. procedure.SetType(procedureType);
  9241. body := SyntaxTree.NewBody(x.position,procedureScope);
  9242. procedureScope.SetBody(body);
  9243. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9244. returnStatement.SetReturnValue(x.condition);
  9245. statements := SyntaxTree.NewStatementSequence();
  9246. statements.AddStatement(returnStatement);
  9247. body.SetStatementSequence(statements);
  9248. currentScope.AddProcedure(procedure);
  9249. RETURN procedure
  9250. END MakeAwaitProcedure;
  9251. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9252. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9253. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9254. BEGIN
  9255. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9256. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9257. IF backend.cooperative THEN
  9258. start := NewLabel();
  9259. true := NewLabel();
  9260. false := NewLabel();
  9261. SetLabel(start);
  9262. Condition(x.condition,true,false);
  9263. SetLabel(false);
  9264. PushSelfPointer();
  9265. CallThis(position,"ExclusiveBlocks","Await",1);
  9266. BrL(start);
  9267. SetLabel(true);
  9268. PushSelfPointer();
  9269. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9270. ELSE
  9271. proc := MakeAwaitProcedure(x);
  9272. Emit(Push(position,fp));
  9273. GetCodeSectionNameForSymbol(proc,name);
  9274. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9275. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9276. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9277. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9278. Emit(Result(position,res));
  9279. (*
  9280. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9281. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9282. *)
  9283. InitOperand(result,ModeValue);
  9284. result.op := res;
  9285. label := NewLabel();
  9286. BreqL(label, result.op, SELF.true);
  9287. ReleaseOperand(result);
  9288. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9289. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9290. Emit(Push(position,res));
  9291. Emit(Push(position,fp));
  9292. PushSelfPointer();
  9293. Emit(Push(position,nil));
  9294. CallThis(position,"Objects","Await",4);
  9295. SetLabel(label);
  9296. END;
  9297. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9298. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9299. END VisitAwaitStatement;
  9300. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9301. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9302. BEGIN
  9303. FOR i := 0 TO x.Length() - 1 DO
  9304. statement := x.GetStatement( i );
  9305. Statement(statement);
  9306. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9307. END;
  9308. END StatementSequence;
  9309. PROCEDURE PushSelfPointer;
  9310. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9311. BEGIN
  9312. scope := currentScope;
  9313. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9314. scope := scope.outerScope;
  9315. END;
  9316. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9317. IF ~newObjectFile THEN
  9318. Symbol(moduleSelf,op);
  9319. IntermediateCode.MakeMemory(op.op,addressType);
  9320. ELSE
  9321. moduleSection := meta.ModuleSection();
  9322. IF backend.cooperative THEN
  9323. moduleOffset := 0;
  9324. ELSE
  9325. moduleOffset := moduleSection.pc;
  9326. END;
  9327. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9328. END;
  9329. ELSE
  9330. GetBaseRegister(op.op,currentScope,scope);
  9331. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9332. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9333. IF backend.cooperative THEN
  9334. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9335. END;
  9336. IntermediateCode.MakeMemory(op.op,addressType);
  9337. END;
  9338. Emit(Push(position,op.op));
  9339. ReleaseOperand(op);
  9340. END PushSelfPointer;
  9341. PROCEDURE Lock(lock: BOOLEAN);
  9342. BEGIN
  9343. IF Trace THEN TraceEnter("Lock") END;
  9344. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9345. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9346. ASSERT(modifyAssignmentCounter = 0);
  9347. IF dump # NIL THEN
  9348. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9349. dump.Ln;dump.Update;
  9350. END;
  9351. PushSelfPointer;
  9352. IF backend.cooperative THEN
  9353. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9354. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9355. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9356. END;
  9357. ELSE
  9358. Emit(Push(position,true));
  9359. IF lock THEN CallThis(position,"Objects","Lock",2)
  9360. ELSE CallThis(position,"Objects","Unlock",2);
  9361. END;
  9362. END;
  9363. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9364. IF Trace THEN TraceExit("Lock") END;
  9365. END Lock;
  9366. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9367. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9368. BEGIN
  9369. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9370. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9371. previouslyUnchecked := isUnchecked;
  9372. isUnchecked := isUnchecked OR x.isUnchecked;
  9373. previouslyCooperativeSwitches := cooperativeSwitches;
  9374. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9375. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9376. IF x.statements # NIL THEN
  9377. StatementSequence(x.statements);
  9378. END;
  9379. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9380. isUnchecked := previouslyUnchecked;
  9381. cooperativeSwitches := previouslyCooperativeSwitches;
  9382. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9383. END VisitStatementBlock;
  9384. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9385. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9386. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9387. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9388. procedure: SyntaxTree.Procedure;
  9389. map: SymbolMap;
  9390. BEGIN
  9391. scope := currentScope;
  9392. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9393. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9394. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9395. return := emptyOperand;
  9396. IF Trace THEN TraceEnter("VisitCode") END;
  9397. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9398. NEW(in, x.inRules.Length());
  9399. FOR i := 0 TO LEN(in)-1 DO
  9400. statement := x.inRules.GetStatement(i);
  9401. WITH statement: SyntaxTree.Assignment DO
  9402. Evaluate(statement.right, operand);
  9403. result := operand.op;
  9404. NEW(str, 64);
  9405. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9406. in[i] := result; IntermediateCode.SetString(in[i], str);
  9407. ReleaseIntermediateOperand(operand.tag);
  9408. END;
  9409. END;
  9410. ELSE in := NIL
  9411. END;
  9412. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9413. NEW(out, x.outRules.Length());
  9414. FOR i := 0 TO LEN(out)-1 DO
  9415. statement := x.outRules.GetStatement(i);
  9416. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9417. WITH statement: SyntaxTree.Assignment DO
  9418. Evaluate(statement.left, operand); (*?? or designate *)
  9419. result := operand.op;
  9420. NEW(str, 64);
  9421. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9422. out[i] := result; IntermediateCode.SetString(out[i], str);
  9423. ReleaseIntermediateOperand(operand.tag);
  9424. |statement: SyntaxTree.ReturnStatement DO
  9425. NEW(str, 64);
  9426. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9427. IF currentIsInline THEN
  9428. map := currentMapper.Get(NIL);
  9429. Evaluate(map.to, operand);
  9430. out[i] := operand.op;
  9431. ELSE
  9432. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9433. END;
  9434. IntermediateCode.SetString(out[i], str);
  9435. ReleaseIntermediateOperand(operand.tag);
  9436. return := out[i];
  9437. ELSE
  9438. END;
  9439. END;
  9440. ELSE out := NIL
  9441. END;
  9442. Emit(Asm(x.position,x.sourceCode, in, out));
  9443. IF in # NIL THEN
  9444. FOR i := 0 TO LEN(in)-1 DO
  9445. ReleaseIntermediateOperand(in[i]);
  9446. END;
  9447. END;
  9448. IF out # NIL THEN
  9449. FOR i := 0 TO LEN(out)-1 DO
  9450. WITH statement: SyntaxTree.Assignment DO
  9451. ReleaseIntermediateOperand(out[i]);
  9452. ELSE
  9453. IF currentIsInline THEN
  9454. ReleaseIntermediateOperand(out[i]);
  9455. END;
  9456. END;
  9457. statement := x.outRules.GetStatement(i);
  9458. END;
  9459. END;
  9460. IF return.mode # IntermediateCode.Undefined THEN
  9461. IF currentIsInline THEN
  9462. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9463. Symbol(procedureType.returnParameter, par);
  9464. MakeMemory(mem, par.op, return.type, 0);
  9465. ReleaseOperand(par);
  9466. Emit(Mov(position, mem, return));
  9467. ReleaseIntermediateOperand(mem);
  9468. ELSE
  9469. Emit(Return(position,return));
  9470. END;
  9471. IF currentIsInline THEN RETURN END;
  9472. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9473. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9474. ReleaseIntermediateOperand(return);
  9475. END;
  9476. IF Trace THEN TraceExit("VisitCode") END;
  9477. END VisitCode;
  9478. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9479. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9480. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9481. const, call: IntermediateCode.Operand;
  9482. parameterDesignator: SyntaxTree.Expression;
  9483. saved: RegisterEntry;
  9484. name: Basic.SegmentedName;
  9485. BEGIN
  9486. IF Trace THEN TraceEnter("ParameterCopies") END;
  9487. parameter := x.firstParameter;
  9488. WHILE parameter # NIL DO
  9489. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9490. type := parameter.type.resolved;
  9491. IF IsOpenArray(type) THEN
  9492. VisitParameter(parameter);
  9493. op := result;
  9494. IF backend.cooperative & parameter.NeedsTrace() THEN
  9495. length := GetArrayLength(type, op.tag);
  9496. size := NewRegisterOperand(addressType);
  9497. base := ArrayBaseType(type);
  9498. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9499. Emit(Mul(position, size, length, const));
  9500. dst := NewRegisterOperand (addressType);
  9501. Emit(Mov(position, dst, size));
  9502. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9503. Emit(Sub(position,dst,sp,dst));
  9504. Emit(And(position,dst,dst,const));
  9505. Emit(Mov(position,sp,dst));
  9506. par := fp;
  9507. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9508. IntermediateCode.InitImmediate(null, byteType, 0);
  9509. Emit(Fill(position, dst, size, null));
  9510. ReleaseIntermediateOperand(dst);
  9511. ReleaseIntermediateOperand(length);
  9512. SaveRegisters();ReleaseUsedRegisters(saved);
  9513. (* register dst has been freed before SaveRegisters already *)
  9514. base := ArrayBaseType(type);
  9515. (* assign method of open array *)
  9516. IF base.IsRecordType() THEN
  9517. Emit (Push(position, length));
  9518. Emit (Push(position, dst));
  9519. Emit (Push(position, op.op));
  9520. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9521. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9522. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9523. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9524. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9525. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9526. Emit (Push(position,length));
  9527. Emit (Push(position, dst));
  9528. Emit (Push(position, length));
  9529. Emit (Push(position, op.op));
  9530. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9531. ELSE
  9532. Emit (Push(position, length));
  9533. Emit (Push(position, dst));
  9534. Emit (Push(position, length));
  9535. Emit (Push(position, op.op));
  9536. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9537. ASSERT(ArrayBaseType(type).IsPointer());
  9538. END;
  9539. RestoreRegisters(saved);
  9540. ELSE
  9541. temp := GetDynamicSize(type,op.tag);
  9542. ReuseCopy(size,temp);
  9543. ReleaseIntermediateOperand(temp);
  9544. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9545. Emit(Sub(position,size,sp,size));
  9546. Emit(And(position,size,size,const));
  9547. Emit(Mov(position,sp,size));
  9548. par := fp;
  9549. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9550. ReleaseIntermediateOperand(size);
  9551. size := GetDynamicSize(type,op.tag);
  9552. END;
  9553. Emit(Copy(position,sp,op.op,size));
  9554. ReleaseIntermediateOperand(size);
  9555. ReleaseOperand(op);
  9556. IntermediateCode.MakeMemory(par,addressType);
  9557. Emit(Mov(position,par,sp));
  9558. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9559. checker.SetCurrentScope(currentScope);
  9560. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9561. Assign(parameterDesignator,parameterDesignator);
  9562. END;
  9563. END;
  9564. parameter := parameter.nextParameter;
  9565. END;
  9566. IF Trace THEN TraceExit("ParameterCopies") END;
  9567. END ParameterCopies;
  9568. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9569. VAR x: SyntaxTree.Variable;
  9570. BEGIN
  9571. x := scope.firstVariable;
  9572. WHILE x # NIL DO
  9573. InitVariable(x);
  9574. x := x.nextVariable;
  9575. END;
  9576. END InitVariables;
  9577. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9578. BEGIN
  9579. IF (symbol # NIL) THEN
  9580. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9581. ELSE
  9582. RETURN 0
  9583. END;
  9584. END GetFingerprint;
  9585. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9586. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9587. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9588. saved: RegisterEntry;
  9589. BEGIN
  9590. IF Trace THEN TraceEnter("Body") END;
  9591. ReleaseUsedRegisters(saved); (* just in case ... *)
  9592. section := ir;
  9593. exitLabel := NewLabel ();
  9594. IF moduleBody THEN moduleBodySection := section END;
  9595. IF ir.comments # NIL THEN
  9596. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9597. commentPrintout.SingleStatement(TRUE);
  9598. dump := ir.comments;
  9599. ELSE
  9600. commentPrintout := NIL;
  9601. dump := NIL;
  9602. END;
  9603. prevScope := currentScope;
  9604. currentScope := scope;
  9605. lastSwitchPC := 0;
  9606. cooperativeSwitches := backend.cooperative;
  9607. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9608. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9609. IF x # NIL THEN
  9610. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9611. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9612. IF moduleBody THEN
  9613. ProfilerInit();
  9614. ELSE
  9615. Basic.SegmentedNameToString(ir.name, string);
  9616. ProfilerAddProcedure(numberProcedures,string);
  9617. ProfilerEnterExit(numberProcedures,TRUE);
  9618. END;
  9619. END;
  9620. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9621. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9622. END;
  9623. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9624. IF moduleBody THEN
  9625. InitVariables(moduleScope)
  9626. END;
  9627. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9628. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9629. IF procedure = cellScope.bodyProcedure THEN
  9630. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9631. StaticCallOperand(op, cellScope.constructor);
  9632. Emit(Call(position,op.op,0));
  9633. END;
  9634. END;
  9635. END;
  9636. ParameterCopies(procedureType);
  9637. InitVariables(scope);
  9638. IF x.code = NIL THEN
  9639. VisitStatementBlock(x);
  9640. ELSE
  9641. VisitCode(x.code)
  9642. END;
  9643. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9644. ir.SetFinally(ir.pc);
  9645. StatementSequence(x.finally)
  9646. END;
  9647. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9648. IF ~backend.cooperative THEN
  9649. ProfilerEnterExit(numberProcedures,FALSE);
  9650. END;
  9651. INC(numberProcedures);
  9652. END;
  9653. END;
  9654. IF backend.cooperative THEN
  9655. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9656. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9657. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9658. (*! not required any more? check and delete!
  9659. PushSelfPointer();
  9660. CallThis(position,"Modules","SetInitialized",1);
  9661. *)
  9662. (*
  9663. SetLabel(end);
  9664. *)
  9665. END;
  9666. IF x # NIL THEN
  9667. SELF.position := x.position;
  9668. END;
  9669. CheckRegistersFree();
  9670. ASSERT(modifyAssignmentCounter = 0);
  9671. currentScope := prevScope;
  9672. IF Trace THEN TraceExit("Body") END;
  9673. END Body;
  9674. END ImplementationVisitor;
  9675. MetaDataGenerator=OBJECT
  9676. VAR
  9677. implementationVisitor: ImplementationVisitor;
  9678. declarationVisitor: DeclarationVisitor;
  9679. module: Sections.Module;
  9680. moduleName: ARRAY 128 OF CHAR;
  9681. moduleNamePool: Basic.HashTableInt;
  9682. moduleNamePoolSection: IntermediateCode.Section;
  9683. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9684. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9685. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9686. TypeTags: LONGINT; (* type extension level support *)
  9687. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9688. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9689. BEGIN
  9690. IF implementationVisitor.backend.cooperative THEN
  9691. TypeTags := MAX(LONGINT);
  9692. BaseTypesTableOffset := 0;
  9693. MethodTableOffset := 2;
  9694. TypeRecordBaseOffset := 0;
  9695. ELSIF simple THEN
  9696. TypeTags := 3; (* only 3 extensions allowed *)
  9697. BaseTypesTableOffset := 1;
  9698. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9699. TypeRecordBaseOffset := 0;
  9700. ELSE
  9701. TypeTags := 16;
  9702. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9703. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9704. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9705. END;
  9706. SELF.simple := simple;
  9707. SELF.implementationVisitor := implementationVisitor;
  9708. SELF.declarationVisitor := declarationVisitor;
  9709. implementationVisitor.meta := SELF;
  9710. declarationVisitor.meta := SELF;
  9711. END InitMetaDataGenerator;
  9712. PROCEDURE SetModule(module: Sections.Module);
  9713. VAR namePoolOffset: LONGINT;
  9714. BEGIN
  9715. SELF.module := module;
  9716. Global.GetModuleName(module.module,moduleName);
  9717. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9718. NEW(moduleNamePool, 32);
  9719. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9720. END;
  9721. END SetModule;
  9722. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9723. BEGIN
  9724. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9725. END GetTypeRecordBaseOffset;
  9726. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9727. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9728. BEGIN
  9729. INC(dataAdrOffset,6);
  9730. Info(section,"headerAdr");
  9731. Address(section,0);
  9732. Info(section,"typeDesc");
  9733. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9734. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9735. NamedSymbol(section, name, symbol, 0, offset);
  9736. Info(section,"mark: LONGINT;");
  9737. Longint(section,-1);
  9738. Info(section,"dataAdr-: ADDRESS");
  9739. Symbol(section,section, dataAdrOffset,0);
  9740. Info(section,"size-: SIZE");
  9741. Address(section,0);
  9742. Info(section,"nextRealtime: HeapBlock;");
  9743. Address(section,0);
  9744. END HeapBlock;
  9745. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9746. VAR i: LONGINT;
  9747. BEGIN
  9748. INC(dataAdrOffset,14);
  9749. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9750. Info(section,"count*: LONGINT");
  9751. Longint(section,0);
  9752. Info(section,"locked*: BOOLEAN");
  9753. Longint(section,0);
  9754. Info(section,"awaitingLock*: ProcessQueue");
  9755. Address(section,0);
  9756. Address(section,0);
  9757. Info(section,"awaitingCond*: ProcessQueue");
  9758. Address(section,0);
  9759. Address(section,0);
  9760. Info(section,"lockedBy*: ANY");
  9761. Address(section,0);
  9762. Info(section,"lock*: ANY");
  9763. Address(section,0);
  9764. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9765. Longint(section,1);
  9766. FOR i := 2 TO 6 DO
  9767. Longint(section,0);
  9768. END;
  9769. END ProtectedHeapBlock;
  9770. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9771. BEGIN
  9772. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9773. END Info;
  9774. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9775. VAR op: IntermediateCode.Operand;
  9776. BEGIN
  9777. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9778. section.Emit(Data(-11,op));
  9779. END Address;
  9780. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9781. VAR op: IntermediateCode.Operand;
  9782. BEGIN
  9783. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9784. section.Emit(Data(-12,op));
  9785. END Size;
  9786. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9787. VAR op: IntermediateCode.Operand;
  9788. BEGIN
  9789. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9790. section.Emit(Data(-1,op));
  9791. END Set;
  9792. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9793. VAR op: IntermediateCode.Operand;
  9794. BEGIN
  9795. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9796. section.Emit(Data(-1,op));
  9797. END Longint;
  9798. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  9799. VAR op,noOperand: IntermediateCode.Operand;
  9800. BEGIN
  9801. IntermediateCode.InitOperand(noOperand);
  9802. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9803. section.PatchOperands(pc,op,noOperand,noOperand);
  9804. END PatchLongint;
  9805. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9806. VAR op, noOperand: IntermediateCode.Operand;
  9807. BEGIN
  9808. IntermediateCode.InitOperand(noOperand);
  9809. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9810. section.PatchOperands(pc,op,noOperand,noOperand);
  9811. END PatchSymbol;
  9812. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  9813. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  9814. BEGIN
  9815. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  9816. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  9817. section.Emit(Data(-1,op));
  9818. END Boolean;
  9819. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  9820. VAR op: IntermediateCode.Operand;
  9821. BEGIN
  9822. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  9823. section.Emit(Data(-1,op));
  9824. END Char;
  9825. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  9826. VAR i: LONGINT;
  9827. BEGIN
  9828. Info(section,str);
  9829. i := 0;
  9830. WHILE(str[i] # 0X) DO
  9831. Char(section,str[i]);
  9832. INC(i);
  9833. END;
  9834. Char(section,0X);
  9835. END String;
  9836. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9837. VAR op: IntermediateCode.Operand;
  9838. BEGIN
  9839. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9840. IntermediateCode.SetOffset(op,realOffset);
  9841. section.Emit(Data(-1,op));
  9842. END NamedSymbol;
  9843. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  9844. BEGIN
  9845. IF symbol= NIL THEN
  9846. Address( section, realOffset);
  9847. ASSERT(virtualOffset = 0);
  9848. ELSE
  9849. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  9850. END;
  9851. END Symbol;
  9852. (* OutPointers delivers
  9853. {pointerOffset}
  9854. *)
  9855. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  9856. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  9857. BEGIN
  9858. type := type.resolved;
  9859. IF type IS SyntaxTree.AnyType THEN
  9860. Symbol(section, symbol, 0, (offset ));
  9861. INC(numberPointers);
  9862. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9863. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  9864. Symbol(section, symbol, 0, offset); INC(numberPointers);
  9865. ELSIF type IS SyntaxTree.PointerType THEN
  9866. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  9867. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  9868. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  9869. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  9870. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  9871. ELSIF (type IS SyntaxTree.RecordType) THEN
  9872. (* never treat a record like a pointer, even if the pointer field is set! *)
  9873. WITH type: SyntaxTree.RecordType DO
  9874. base := type.GetBaseRecord();
  9875. IF base # NIL THEN
  9876. Pointers(offset,symbol,section, base,numberPointers);
  9877. END;
  9878. variable := type.recordScope.firstVariable;
  9879. WHILE(variable # NIL) DO
  9880. IF ~(variable.untraced) THEN
  9881. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9882. END;
  9883. variable := variable.nextVariable;
  9884. END;
  9885. END;
  9886. ELSIF (type IS SyntaxTree.CellType) THEN
  9887. WITH type: SyntaxTree.CellType DO
  9888. base := type.GetBaseRecord();
  9889. IF base # NIL THEN
  9890. Pointers(offset,symbol,section, base,numberPointers);
  9891. END;
  9892. variable := type.cellScope.firstVariable;
  9893. WHILE(variable # NIL) DO
  9894. IF ~(variable.untraced) THEN
  9895. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9896. END;
  9897. variable := variable.nextVariable;
  9898. END;
  9899. END;
  9900. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9901. WITH type: SyntaxTree.ArrayType DO
  9902. IF type.form= SyntaxTree.Static THEN
  9903. n := type.staticLength;
  9904. base := type.arrayBase.resolved;
  9905. WHILE(base IS SyntaxTree.ArrayType) DO
  9906. type := base(SyntaxTree.ArrayType);
  9907. n := n* type.staticLength;
  9908. base := type.arrayBase.resolved;
  9909. END;
  9910. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9911. IF SemanticChecker.ContainsPointer(base) THEN
  9912. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9913. FOR i := 0 TO n-1 DO
  9914. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9915. END;
  9916. END;
  9917. ELSE
  9918. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  9919. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9920. END;
  9921. END;
  9922. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9923. WITH type: SyntaxTree.MathArrayType DO
  9924. IF type.form = SyntaxTree.Static THEN
  9925. n := type.staticLength;
  9926. base := type.arrayBase.resolved;
  9927. WHILE(base IS SyntaxTree.MathArrayType) DO
  9928. type := base(SyntaxTree.MathArrayType);
  9929. n := n* type.staticLength;
  9930. base := type.arrayBase.resolved;
  9931. END;
  9932. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9933. IF SemanticChecker.ContainsPointer(base) THEN
  9934. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9935. FOR i := 0 TO n-1 DO
  9936. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9937. END;
  9938. END;
  9939. ELSE
  9940. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  9941. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9942. END
  9943. END;
  9944. (* ELSE no pointers in type *)
  9945. END;
  9946. END Pointers;
  9947. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  9948. VAR position,i: LONGINT; ch: CHAR;
  9949. BEGIN
  9950. IF pool.Has(index) THEN
  9951. RETURN pool.GetInt(index)
  9952. ELSE
  9953. position := source.pc;
  9954. pool.PutInt(index, position);
  9955. Info(source, name);
  9956. i := 0;
  9957. REPEAT
  9958. ch := name[i]; INC(i);
  9959. Char( source, ch);
  9960. UNTIL ch = 0X;
  9961. END;
  9962. RETURN position;
  9963. END EnterDynamicName;
  9964. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  9965. VAR name: Basic.SectionName; position: LONGINT;
  9966. BEGIN
  9967. IF pool.Has(index) THEN
  9968. RETURN pool.GetInt(index)
  9969. ELSE
  9970. StringPool.GetString(index, name);
  9971. position := EnterDynamicName(source,name,index, pool);
  9972. END;
  9973. RETURN position;
  9974. END DynamicName;
  9975. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  9976. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  9977. BEGIN
  9978. COPY(moduleName,name);
  9979. Strings.Append(name,suffix);
  9980. Basic.ToSegmentedName(name, pooledName);
  9981. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  9982. IF implementationVisitor.backend.cooperative THEN
  9983. Info(section, "TypeDescriptor");
  9984. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  9985. NamedSymbol(section, pooledName,NIL, 0, 0);
  9986. BasePointer(section);
  9987. offset := 0;
  9988. ELSE
  9989. HeapBlock(mName,typeName,section,2);
  9990. Info(section, "HeapBlock");
  9991. (*
  9992. Symbol(section,section,2,0);
  9993. *)
  9994. Address(section,0); (* empty such that GC does not go on traversing *)
  9995. Info(section, "TypeDescriptor");
  9996. Address(section,0);
  9997. offset := section.pc;
  9998. END;
  9999. RETURN section
  10000. END Block;
  10001. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10002. VAR name: Basic.SegmentedName;
  10003. BEGIN
  10004. Info(source,"ArrayHeader");
  10005. IF implementationVisitor.backend.cooperative THEN
  10006. sizePC := source.pc;
  10007. Address(source,0);
  10008. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10009. IF baseType # "" THEN
  10010. Basic.ToSegmentedName(baseType, name);
  10011. NamedSymbol(source, name,NIL, 0, 0);
  10012. ELSE
  10013. Address(source,0);
  10014. END;
  10015. Address(source,0);
  10016. ELSE
  10017. Address(source,0);
  10018. Address(source,0);
  10019. Address(source,0);
  10020. sizePC := source.pc;
  10021. Address(source,0);
  10022. Info(source,"array data");
  10023. END;
  10024. END Array;
  10025. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10026. BEGIN
  10027. IF implementationVisitor.backend.cooperative THEN
  10028. PatchLongint(section, pc, size);
  10029. PatchLongint(section, pc + 3, size);
  10030. ELSE
  10031. PatchLongint(section, pc, size);
  10032. END;
  10033. END PatchArray;
  10034. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10035. VAR
  10036. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10037. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10038. poolMap: Basic.HashTableInt;
  10039. namePool: IntermediateCode.Section;
  10040. namePoolOffset: LONGINT;
  10041. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10042. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10043. BEGIN
  10044. Basic.SegmentedNameToString(s1.name,n1);
  10045. Basic.SegmentedNameToString(s2.name,n2);
  10046. index := 0;
  10047. ch1 := n1[index];
  10048. ch2 := n2[index];
  10049. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10050. INC(index);
  10051. ch1 := n1[index];
  10052. ch2 := n2[index];
  10053. END;
  10054. RETURN ch1 < ch2;
  10055. END Compare;
  10056. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10057. VAR
  10058. i, j: LONGINT;
  10059. x, t: Sections.Section;
  10060. BEGIN
  10061. IF lo < hi THEN
  10062. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10063. WHILE i <= j DO
  10064. WHILE Compare(list[i], x) DO INC(i) END;
  10065. WHILE Compare(x, list[j]) DO DEC(j) END;
  10066. IF i <= j THEN
  10067. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10068. INC(i); DEC(j)
  10069. END
  10070. END;
  10071. IF lo < j THEN QuickSort(list, lo, j) END;
  10072. IF i < hi THEN QuickSort(list, i, hi) END
  10073. END;
  10074. END QuickSort;
  10075. (*
  10076. ExportDesc* = RECORD
  10077. fp*: ADDRESS;
  10078. name* {UNTRACED}: DynamicName;
  10079. adr*: ADDRESS;
  10080. exports*: LONGINT;
  10081. dsc* {UNTRACED}: ExportArray
  10082. END;
  10083. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10084. *)
  10085. PROCEDURE ExportDesc2(
  10086. source: IntermediateCode.Section;
  10087. namePool: IntermediateCode.Section;
  10088. fingerPrinter: FingerPrinter.FingerPrinter;
  10089. symbol: Sections.Section;
  10090. name: StringPool.Index;
  10091. VAR patchAdr: LONGINT
  10092. ): BOOLEAN;
  10093. VAR fingerPrint: SyntaxTree.FingerPrint;
  10094. BEGIN
  10095. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10096. & (symbol.type # Sections.InlineCodeSection)
  10097. THEN
  10098. *)
  10099. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10100. & (symbol.type # Sections.InlineCodeSection))
  10101. THEN
  10102. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10103. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10104. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10105. Longint(source,fingerPrint.shallow);
  10106. ELSE
  10107. Longint(source, 0);
  10108. END;
  10109. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10110. Symbol(source, symbol,0,0);
  10111. patchAdr := source.pc;
  10112. Address(source,0);
  10113. Address(source,0);
  10114. END;
  10115. RETURN TRUE
  10116. ELSE
  10117. RETURN FALSE
  10118. END;
  10119. END ExportDesc2;
  10120. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10121. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10122. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10123. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10124. TYPE
  10125. Scope = RECORD
  10126. elements: LONGINT;
  10127. gelements: LONGINT;
  10128. section: IntermediateCode.Section;
  10129. patchAdr: LONGINT;
  10130. arraySizePC: LONGINT;
  10131. beginPC: LONGINT; (* current scope start pc *)
  10132. END;
  10133. BEGIN
  10134. Basic.InitSegmentedName(prev);
  10135. olevel := -1;
  10136. scopes[0].section := source;
  10137. FOR s := 0 TO LEN(sections)-1 DO
  10138. symbol := sections[s];
  10139. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10140. this := sections[s].name;
  10141. level := 0;
  10142. WHILE (this[level] > 0) DO
  10143. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10144. INC(level);
  10145. END;
  10146. WHILE level < olevel DO
  10147. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10148. IF olevel > 0 THEN
  10149. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10150. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10151. END;
  10152. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10153. DEC(olevel);
  10154. END;
  10155. IF (this[level] > 0) THEN
  10156. IF level > olevel THEN
  10157. (*TRACE("opening",level); *)
  10158. IF scopes[level].section = NIL THEN
  10159. arrayName := ".@ExportArray";
  10160. Strings.AppendInt(arrayName, level);
  10161. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10162. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10163. END;
  10164. scopes[level].beginPC := scopes[level].section.pc;
  10165. olevel := level;
  10166. scopes[olevel].elements := 0;
  10167. END;
  10168. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10169. sym := sections[s];
  10170. ELSE
  10171. sym := NIL;
  10172. END;
  10173. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10174. THEN
  10175. INC(scopes[olevel].elements);
  10176. END;
  10177. (*StringPool.GetString(this[level], name);*)
  10178. (*TRACE(level, name);*)
  10179. (* enter string in scope *)
  10180. INC(level);
  10181. END;
  10182. END;
  10183. Basic.SegmentedNameToString(this, name);
  10184. (*TRACE(level, "enter", name);*)
  10185. prev := this;
  10186. END;
  10187. END;
  10188. WHILE 0 <= olevel DO
  10189. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10190. IF olevel > 0 THEN
  10191. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10192. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10193. END;
  10194. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10195. DEC(olevel);
  10196. END;
  10197. level := 0;
  10198. WHILE (level < LEN(scopes)) DO
  10199. IF scopes[level].section # NIL THEN
  10200. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10201. END;
  10202. INC(level);
  10203. END;
  10204. END Export;
  10205. BEGIN
  10206. NEW(fingerPrinter, module.system);
  10207. NEW(poolMap, 64);
  10208. (* 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 *)
  10209. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10210. NEW(sectionArray, module.allSections.Length());
  10211. FOR i := 0 TO module.allSections.Length() - 1 DO
  10212. section := module.allSections.GetSection(i);
  10213. sectionArray[i] := section;
  10214. END;
  10215. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10216. Export(sectionArray^);
  10217. END ExportDesc;
  10218. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10219. VAR
  10220. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10221. BEGIN
  10222. Info(source, "exception table offsets array descriptor");
  10223. size := 0;
  10224. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10225. Info(source, "exception table content");
  10226. FOR i := 0 TO module.allSections.Length() - 1 DO
  10227. p := module.allSections.GetSection(i);
  10228. IF p.type = Sections.CodeSection THEN
  10229. finallyPC := p(IntermediateCode.Section).finally;
  10230. IF finallyPC>=0 THEN
  10231. Symbol( source, p, 0,0);
  10232. Symbol( source, p, finallyPC, 0);
  10233. Symbol( source, p, finallyPC,0);
  10234. INC(size);
  10235. END;
  10236. END
  10237. END;
  10238. PatchArray(source,sizePC,size);
  10239. END ExceptionArray;
  10240. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10241. VAR i: LONGINT; ch: CHAR;
  10242. BEGIN
  10243. i := 0;
  10244. REPEAT
  10245. ch := name[i]; INC(i);
  10246. Char( section, ch);
  10247. UNTIL ch = 0X;
  10248. WHILE i < 32 DO
  10249. Char( section, 0X); INC(i);
  10250. END;
  10251. END Name;
  10252. PROCEDURE References(section: IntermediateCode.Section);
  10253. CONST
  10254. rfDirect = 1X; rfIndirect = 3X;
  10255. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10256. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10257. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10258. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10259. rfRecordPointer=1DX;
  10260. rfArrayFlag = 80X;
  10261. VAR
  10262. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10263. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10264. VAR char: CHAR;
  10265. BEGIN
  10266. IF type = NIL THEN char := rfLongint
  10267. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10268. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10269. ELSIF type IS SyntaxTree.CharacterType THEN
  10270. IF type.sizeInBits = 8 THEN char := rfChar8
  10271. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10272. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10273. END;
  10274. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10275. IF type.sizeInBits = 8 THEN char := rfShortint
  10276. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10277. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10278. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10279. END;
  10280. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10281. ELSIF type IS SyntaxTree.FloatType THEN
  10282. IF type.sizeInBits = 32 THEN char := rfReal
  10283. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10284. END;
  10285. ELSIF type IS SyntaxTree.ComplexType THEN
  10286. IF type.sizeInBits = 64 THEN char := rfComplex
  10287. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10288. END;
  10289. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10290. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10291. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10292. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10293. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10294. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10295. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10296. END;
  10297. RETURN char
  10298. END BaseType;
  10299. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10300. VAR destination: Sections.Section;
  10301. BEGIN
  10302. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10303. IF type.pointerType # NIL THEN
  10304. Char(section,rfRecordPointer)
  10305. ELSE
  10306. Char(section,rfRecord);
  10307. END;
  10308. IF destination = NIL THEN
  10309. Longint(section,0);
  10310. ELSE
  10311. Longint(section,destination.offset); (* used for ? *)
  10312. END;
  10313. END RecordType;
  10314. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10315. BEGIN
  10316. baseType := type.arrayBase.resolved;
  10317. IF type.form = SyntaxTree.Static THEN
  10318. IF baseType IS SyntaxTree.ArrayType THEN
  10319. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10320. ELSE
  10321. RETURN type.staticLength
  10322. END
  10323. ELSE
  10324. RETURN 0
  10325. END;
  10326. END StaticArrayLength;
  10327. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10328. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10329. BEGIN
  10330. length := StaticArrayLength(type, baseType);
  10331. char := BaseType(baseType);
  10332. IF type.form # SyntaxTree.Open THEN
  10333. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10334. Longint(section, length)
  10335. ELSE
  10336. length :=0;
  10337. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10338. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10339. Longint(section, length)
  10340. END;
  10341. END ArrayType;
  10342. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10343. BEGIN
  10344. baseType := type.arrayBase;
  10345. IF baseType # NIL THEN
  10346. baseType := baseType.resolved;
  10347. END;
  10348. IF type.form = SyntaxTree.Static THEN
  10349. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10350. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10351. ELSE
  10352. RETURN type.staticLength
  10353. END
  10354. ELSE
  10355. RETURN 0
  10356. END;
  10357. END StaticMathArrayLength;
  10358. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10359. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10360. BEGIN
  10361. length := StaticMathArrayLength(type, baseType);
  10362. char := BaseType(baseType);
  10363. IF type.form = SyntaxTree.Open THEN
  10364. char := BaseType(module.system.addressType);
  10365. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10366. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10367. Longint(section, length)
  10368. ELSIF type.form=SyntaxTree.Tensor THEN
  10369. char := BaseType(module.system.addressType);
  10370. Char(section, CHR(ORD(char)));
  10371. ELSE
  10372. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10373. Longint(section, length)
  10374. END;
  10375. END MathArrayType;
  10376. PROCEDURE Type(type: SyntaxTree.Type);
  10377. BEGIN
  10378. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10379. IF type IS SyntaxTree.BasicType THEN
  10380. Char(section, BaseType(type));
  10381. ELSIF type IS SyntaxTree.RecordType THEN
  10382. RecordType(type(SyntaxTree.RecordType));
  10383. ELSIF type IS SyntaxTree.ArrayType THEN
  10384. ArrayType(type(SyntaxTree.ArrayType))
  10385. ELSIF type IS SyntaxTree.EnumerationType THEN
  10386. Char(section, BaseType(module.system.longintType))
  10387. ELSIF type IS SyntaxTree.PointerType THEN
  10388. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10389. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10390. ELSE
  10391. Char(section, BaseType(type))
  10392. END;
  10393. ELSIF type IS SyntaxTree.ProcedureType THEN
  10394. Char(section, BaseType(type));
  10395. ELSIF type IS SyntaxTree.MathArrayType THEN
  10396. MathArrayType(type(SyntaxTree.MathArrayType));
  10397. ELSIF type IS SyntaxTree.CellType THEN
  10398. Char(section, BaseType(module.system.anyType));
  10399. ELSE HALT(200)
  10400. END;
  10401. END Type;
  10402. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10403. VAR name: ARRAY 256 OF CHAR;
  10404. BEGIN
  10405. IF variable.externalName # NIL THEN RETURN END;
  10406. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10407. variable.GetName(name);
  10408. Type(variable.type);
  10409. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10410. String(section,name);
  10411. END WriteVariable;
  10412. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10413. VAR name: ARRAY 256 OF CHAR;
  10414. BEGIN
  10415. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10416. variable.GetName(name);
  10417. Type(variable.type);
  10418. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10419. variable.GetName(name);
  10420. String(section,name);
  10421. END WriteParameter;
  10422. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10423. BEGIN
  10424. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10425. IF type IS SyntaxTree.ArrayType THEN
  10426. WITH type: SyntaxTree.ArrayType DO
  10427. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10428. ELSE Char(section,rfOpenArray)
  10429. END;
  10430. END
  10431. ELSIF type IS SyntaxTree.MathArrayType THEN
  10432. WITH type: SyntaxTree.MathArrayType DO
  10433. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10434. ELSE Char(section,rfOpenArray)
  10435. END;
  10436. END
  10437. ELSIF type IS SyntaxTree.RecordType THEN
  10438. Char(section,rfRecord);
  10439. ELSE
  10440. Char(section, BaseType(type));
  10441. END;
  10442. END ReturnType;
  10443. PROCEDURE Procedure(s: Sections.Section);
  10444. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10445. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10446. name: ARRAY 256 OF CHAR;
  10447. BEGIN
  10448. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10449. (*procedure.name,name);*)
  10450. Global.GetSymbolNameInScope(procedure,module.module.moduleScope,name);
  10451. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10452. Char(section,0F9X);
  10453. Symbol(section,s,0,0);
  10454. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10455. Longint(section,procedureType.numberParameters);
  10456. ReturnType(procedureType.returnType);
  10457. Longint(section,0); (*! level *)
  10458. Longint(section,0);
  10459. (*
  10460. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10461. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10462. recordName := "";
  10463. IF record.pointerType # NIL THEN
  10464. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10465. ELSE
  10466. DeclarationName(record.typeDeclaration,recordName);
  10467. END;
  10468. i := 0;
  10469. Info(section,recordName);
  10470. WHILE recordName[i] # 0X DO
  10471. Char(section,recordName[i]); INC(i);
  10472. INC(size);
  10473. END;
  10474. Char(section,".");
  10475. INC(size);
  10476. END;
  10477. *)
  10478. String(section,name);
  10479. parameter := procedureType.firstParameter;
  10480. WHILE(parameter # NIL) DO
  10481. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10482. parameter := parameter.nextParameter;
  10483. END;
  10484. variable := procedure.procedureScope.firstVariable;
  10485. WHILE(variable # NIL) DO
  10486. WriteVariable(variable,FALSE);
  10487. variable := variable.nextVariable;
  10488. END;
  10489. END Procedure;
  10490. PROCEDURE Scope(s: Sections.Section);
  10491. BEGIN
  10492. Char(section,0F8X);
  10493. Symbol(section,s,0,0); (* start *)
  10494. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10495. String(section,"$$");
  10496. (* removed variables -- wrongly interpreted by Reflection
  10497. variable := module.module.moduleScope.firstVariable;
  10498. WHILE(variable # NIL) DO
  10499. WriteVariable(variable,FALSE);
  10500. variable := variable.nextVariable;
  10501. END;
  10502. *)
  10503. END Scope;
  10504. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10505. VAR result, i: LONGINT;
  10506. BEGIN
  10507. FOR i := startPC TO endPC -1 DO
  10508. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10509. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10510. END;
  10511. RETURN result;
  10512. END ComputeSize;
  10513. BEGIN
  10514. Array(section,sizePC,"");
  10515. startPC := section.pc;
  10516. Char(section,0FFX); (* sign for trap writer *)
  10517. FOR i := 0 TO module.allSections.Length() - 1 DO
  10518. s := module.allSections.GetSection(i);
  10519. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10520. Scope(s) (*! must be first procedure in ref section *)
  10521. END
  10522. END;
  10523. FOR i := 0 TO module.allSections.Length() - 1 DO
  10524. s := module.allSections.GetSection(i);
  10525. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10526. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10527. Procedure(s)
  10528. END
  10529. END;
  10530. endPC := section.pc;
  10531. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10532. END References;
  10533. (*
  10534. Command* = RECORD
  10535. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10536. name*: Name; (* name of the procedure *)
  10537. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10538. entryAdr* : ADDRESS; (* entry address of procedure *)
  10539. END;
  10540. *)
  10541. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10542. VAR
  10543. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10544. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10545. name: ARRAY 32 OF CHAR; numberParameters, i: LONGINT;
  10546. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10547. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10548. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10549. BEGIN
  10550. RETURN
  10551. (type = NIL) OR
  10552. (type.resolved IS SyntaxTree.RecordType) OR
  10553. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10554. (type.resolved IS SyntaxTree.AnyType);
  10555. END TypeAllowed;
  10556. BEGIN
  10557. numberParameters := procedureType.numberParameters;
  10558. RETURN
  10559. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10560. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10561. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10562. END GetProcedureAllowed;
  10563. PROCEDURE WriteType(type : SyntaxTree.Type);
  10564. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10565. name: Basic.SegmentedName; offset: LONGINT;
  10566. BEGIN
  10567. IF type = NIL THEN
  10568. Address(source,0);
  10569. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10570. Address(source,1);
  10571. ELSE
  10572. type := type.resolved;
  10573. IF type IS SyntaxTree.PointerType THEN
  10574. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10575. END;
  10576. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10577. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10578. name[0] := typeDeclaration.name; name[1] := -1;
  10579. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10580. ASSERT(section # NIL);
  10581. ELSE
  10582. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10583. (* TODO *)
  10584. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10585. END;
  10586. IF implementationVisitor.backend.cooperative THEN
  10587. offset := 0;
  10588. ELSE
  10589. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10590. END;
  10591. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10592. END;
  10593. END WriteType;
  10594. BEGIN
  10595. Info(source, "command array descriptor");
  10596. Array(source,sizePC,"Modules.Command");
  10597. numberCommands := 0;
  10598. Info(source, "command array content");
  10599. FOR i := 0 TO module.allSections.Length() - 1 DO
  10600. p := module.allSections.GetSection(i);
  10601. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10602. procedure := p.symbol(SyntaxTree.Procedure);
  10603. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10604. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10605. procedure.GetName(name);
  10606. Name(source,name);
  10607. numberParameters := procedureType.numberParameters;
  10608. (* offset of type of first parameter *)
  10609. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10610. ELSE WriteType(procedureType.firstParameter.type)
  10611. END;
  10612. (* offset of type of return parameter *)
  10613. WriteType(procedureType.returnType);
  10614. (* command name *)
  10615. (* command code offset *)
  10616. Symbol(source,p,0,0);
  10617. INC(numberCommands);
  10618. IF Trace THEN
  10619. D.Ln;
  10620. END;
  10621. END;
  10622. END
  10623. END;
  10624. PatchArray(source,sizePC,numberCommands);
  10625. END CommandArray;
  10626. (* to prevent from double import of different module aliases *)
  10627. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10628. VAR i: SyntaxTree.Import;
  10629. BEGIN
  10630. i := module.module.moduleScope.firstImport;
  10631. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10632. i := i.nextImport;
  10633. END;
  10634. RETURN i = import
  10635. END IsFirstDirectOccurence;
  10636. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10637. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10638. BEGIN
  10639. Array(source,pc,"");
  10640. Info(source, "import module array data");
  10641. IF implementationVisitor.backend.cooperative THEN
  10642. offset := 0;
  10643. ELSE
  10644. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10645. END;
  10646. import := module.module.moduleScope.firstImport;
  10647. numberImports := 0;
  10648. WHILE import # NIL DO
  10649. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10650. Global.GetModuleSegmentedName(import.module,name);
  10651. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10652. NamedSymbol(source, name, NIL, 0, offset);
  10653. INC(numberImports);
  10654. END;
  10655. import := import.nextImport
  10656. END;
  10657. PatchArray(source,pc,numberImports);
  10658. END ImportsArray;
  10659. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10660. VAR
  10661. p: Sections.Section; sizePC, size, i: LONGINT;
  10662. BEGIN
  10663. Info(source, "Type info section");
  10664. size := 0;
  10665. Array(source,sizePC,"Modules.TypeDesc");
  10666. FOR i := 0 TO module.allSections.Length() - 1 DO
  10667. p := module.allSections.GetSection(i);
  10668. WITH p: IntermediateCode.Section DO
  10669. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10670. Symbol(source,p,0,0);
  10671. INC(size);
  10672. END;
  10673. END
  10674. END;
  10675. PatchArray(source,sizePC,size);
  10676. END TypeInfoSection;
  10677. (*
  10678. ProcTableEntry* = RECORD
  10679. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10680. noPtr*: LONGINT;
  10681. END;
  10682. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10683. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10684. *)
  10685. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10686. VAR
  10687. destination: Sections.Section;
  10688. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10689. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10690. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10691. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10692. BEGIN
  10693. Info(procArray,"pcFrom");
  10694. Symbol(procArray,destination,0,0);
  10695. Info(procArray,"pcTo");
  10696. Symbol(procArray,destination,destination.pc,0);
  10697. Info(procArray,"pcStatementBegin");
  10698. Symbol(procArray,destination,destination.validPAFEnter,0);
  10699. Info(procArray,"pcStatementEnd");
  10700. Symbol(procArray,destination,destination.validPAFExit,0);
  10701. IF ~implementationVisitor.backend.cooperative THEN
  10702. Basic.SegmentedNameToString(destination.name, string);
  10703. Info(pointerArray,string);
  10704. procedure := destination.symbol(SyntaxTree.Procedure);
  10705. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10706. variable := procedure.procedureScope.firstVariable;
  10707. WHILE(variable # NIL) DO
  10708. IF ~(variable.untraced) THEN
  10709. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10710. END;
  10711. variable := variable.nextVariable
  10712. END;
  10713. parameter := procedureType.firstParameter;
  10714. WHILE(parameter # NIL) DO
  10715. IF ~(parameter.untraced) THEN
  10716. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10717. END;
  10718. parameter := parameter.nextParameter;
  10719. END;
  10720. END;
  10721. Info(procArray,"numberPointers");
  10722. Longint(procArray,numberPointers);
  10723. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10724. INC(pointerArraySize, numberPointers);
  10725. END PointerOffsets;
  10726. BEGIN
  10727. maxPointers := 0;
  10728. Info(procArray, "proc array descriptor");
  10729. Address(procArray,0);
  10730. Address(procArray,0);
  10731. Address(procArray,0);
  10732. procArraySizePC := procArray.pc;
  10733. Address(procArray,0);
  10734. procArraySize := 0;
  10735. IF ~implementationVisitor.backend.cooperative THEN
  10736. Info(pointerArray, "pointer array descriptor");
  10737. Address(pointerArray,0);
  10738. Address(pointerArray,0);
  10739. Address(pointerArray,0);
  10740. pointerArraySizePC := pointerArray.pc;
  10741. Address(pointerArray,0);
  10742. pointerArraySize := 0;
  10743. END;
  10744. procArraySize := 0;
  10745. FOR i := 0 TO module.allSections.Length() - 1 DO
  10746. destination := module.allSections.GetSection(i);
  10747. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10748. PointerOffsets(destination(IntermediateCode.Section));
  10749. INC(procArraySize);
  10750. END
  10751. END;
  10752. PatchLongint(procArray,procArraySizePC,procArraySize);
  10753. IF ~implementationVisitor.backend.cooperative THEN
  10754. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10755. END;
  10756. END PointersInProcTables;
  10757. (*
  10758. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10759. VAR
  10760. next*: Module; (** once a module is published, all fields are read-only *)
  10761. name*: Name;
  10762. init, published: BOOLEAN;
  10763. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10764. sb*: ADDRESS; <- set to beginning of data section by loader
  10765. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10766. command*: POINTER TO ARRAY OF Command;
  10767. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10768. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10769. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10770. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10771. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10772. data*, code*: Bytes;
  10773. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10774. export*: ExportDesc;
  10775. term*: TerminationHandler;
  10776. exTable*: ExceptionTable;
  10777. noProcs*: LONGINT;
  10778. firstProc*: ADDRESS; <- done by loader
  10779. maxPtrs*: LONGINT;
  10780. crc*: LONGINT;
  10781. *)
  10782. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10783. BEGIN
  10784. Info(section, "cycle");
  10785. Size(section,0);
  10786. Info(section, "references");
  10787. Size(section,0);
  10788. Info(section, "nextMarked");
  10789. Address(section,0);
  10790. Info(section, "nextWatched");
  10791. Address(section,0);
  10792. END BasePointer;
  10793. PROCEDURE BaseObject (section: IntermediateCode.Section);
  10794. BEGIN
  10795. BasePointer(section);
  10796. Info(section, "action");
  10797. Address(section,0);
  10798. Info(section, "monitor");
  10799. Address(section,0);
  10800. END BaseObject;
  10801. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  10802. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  10803. pooledName: Basic.SegmentedName;
  10804. symbol: SyntaxTree.Symbol;
  10805. BEGIN
  10806. Global.GetModuleName(module.module,name);
  10807. Strings.Append(name,".@Module.@Descriptor");
  10808. Basic.ToSegmentedName(name, pooledName);
  10809. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10810. Symbol(section,descriptorSection,0,0);
  10811. Info(descriptorSection, "descriptor");
  10812. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10813. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  10814. Address(descriptorSection,0);
  10815. Global.GetModuleName(module.module,name);
  10816. Strings.Append(name,".@Trace");
  10817. Basic.ToSegmentedName(name, pooledName);
  10818. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10819. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  10820. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10821. END ModuleDescriptor;
  10822. PROCEDURE ModuleSection(): IntermediateCode.Section;
  10823. VAR name: ARRAY 128 OF CHAR;
  10824. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  10825. symbol: SyntaxTree.Symbol;
  10826. BEGIN
  10827. Global.GetModuleName(module.module,name);
  10828. Strings.Append(name,".@Module");
  10829. Basic.ToSegmentedName(name, pooledName);
  10830. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10831. moduleSection.SetExported(TRUE);
  10832. IF moduleSection.pc = 0 THEN
  10833. IF implementationVisitor.backend.cooperative THEN
  10834. Info(moduleSection, "descriptor");
  10835. ModuleDescriptor(moduleSection);
  10836. BaseObject(moduleSection);
  10837. implementationVisitor.CreateTraceModuleMethod(module.module);
  10838. ELSE
  10839. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  10840. Info(moduleSection, "HeapBlock");
  10841. Symbol(moduleSection,moduleSection,2,0);
  10842. Info(moduleSection, "TypeDescriptor");
  10843. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10844. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  10845. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  10846. END;
  10847. END;
  10848. RETURN moduleSection;
  10849. END ModuleSection;
  10850. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  10851. VAR
  10852. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  10853. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  10854. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  10855. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  10856. referenceSectionOffset : LONGINT;
  10857. BEGIN
  10858. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  10859. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  10860. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  10861. ImportsArray(importSection);
  10862. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  10863. CommandArray(commandsSection);
  10864. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  10865. ExceptionArray(exceptionSection);
  10866. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  10867. TypeInfoSection(typeInfoSection);
  10868. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  10869. References(referenceSection);
  10870. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  10871. IF ~implementationVisitor.backend.cooperative THEN
  10872. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  10873. ELSE
  10874. ptrTableSection := NIL;
  10875. END;
  10876. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  10877. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  10878. Array(emptyArraySection,temp,"");
  10879. moduleSection := ModuleSection();
  10880. Info(moduleSection, "nextRoot*: RootObject");
  10881. Address(moduleSection,0);
  10882. Info(moduleSection, "next*: Module");
  10883. Address(moduleSection,0);
  10884. Info(moduleSection, "name*: Name");
  10885. Name(moduleSection,moduleName);
  10886. Info(moduleSection, "init, published: BOOLEAN");
  10887. Boolean(moduleSection,FALSE);
  10888. Boolean(moduleSection,FALSE);
  10889. Info(moduleSection,"filler"); (*! introduce alignment! *)
  10890. Boolean(moduleSection,FALSE);
  10891. Boolean(moduleSection,FALSE);
  10892. Info(moduleSection, "refcnt*: LONGINT");
  10893. Longint(moduleSection,0);
  10894. Info(moduleSection, "sb*: ADDRESS");
  10895. Address(moduleSection,0);
  10896. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  10897. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10898. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  10899. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  10900. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  10901. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  10902. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  10903. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  10904. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  10905. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  10906. Info(moduleSection, "procTable*: ProcTable");
  10907. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  10908. Info(moduleSection, "ptrTable*: PtrTable");
  10909. IF ~implementationVisitor.backend.cooperative THEN
  10910. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  10911. ELSE
  10912. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10913. END;
  10914. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  10915. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10916. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10917. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10918. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  10919. Info(moduleSection, "export*: ExportDesc");
  10920. ExportDesc(moduleSection);
  10921. Info(moduleSection, "term*: TerminationHandler");
  10922. Address(moduleSection,0);
  10923. Info(moduleSection, "exTable*: ExceptionTable");
  10924. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  10925. Info(moduleSection, "noProcs*: LONGINT");
  10926. Longint(moduleSection,numberProcs);
  10927. Info(moduleSection, "firstProc*: ADDRESS");
  10928. Address(moduleSection,0);
  10929. Info(moduleSection, "maxPtrs*: LONGINT");
  10930. Longint(moduleSection,maxPointers);
  10931. Info(moduleSection, "crc*: LONGINT");
  10932. Longint(moduleSection, 0); (*! must be implemented *)
  10933. Info(moduleSection, "body*: ADDRESS");
  10934. Symbol(moduleSection, bodyProc, 0,0);
  10935. IF implementationVisitor.backend.cooperative THEN
  10936. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  10937. Info(moduleSection, "monitor.owner");
  10938. Address(moduleSection,0);
  10939. Info(moduleSection, "monitor.nestingLevel");
  10940. Address(moduleSection,0);
  10941. Info(moduleSection, "monitor.blockedQueue");
  10942. Address(moduleSection,0); Address(moduleSection,0);
  10943. Info(moduleSection, "monitor.waitingQueue");
  10944. Address(moduleSection,0); Address(moduleSection,0);
  10945. Info(moduleSection, "monitor.waitingSentinel");
  10946. Address(moduleSection,0);
  10947. END;
  10948. END Module;
  10949. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  10950. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  10951. BEGIN
  10952. Array(source,pc,"");
  10953. Info(source, "pointer offsets array data");
  10954. IF scope IS SyntaxTree.RecordScope THEN
  10955. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  10956. ELSIF scope IS SyntaxTree.CellScope THEN
  10957. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  10958. ELSIF scope IS SyntaxTree.ModuleScope THEN
  10959. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  10960. WHILE variable # NIL DO
  10961. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  10962. symbol := module.allSections.FindBySymbol(variable);
  10963. ASSERT(symbol # NIL);
  10964. Pointers(0,symbol, source,variable.type,numberPointers);
  10965. END;
  10966. variable := variable.nextVariable;
  10967. END;
  10968. END;
  10969. PatchArray(source,pc,numberPointers);
  10970. END PointerArray;
  10971. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  10972. VAR
  10973. name: Basic.SegmentedName;
  10974. section: IntermediateCode.Section;
  10975. BEGIN
  10976. ASSERT(implementationVisitor.newObjectFile);
  10977. Global.GetSymbolSegmentedName(symbol,name);
  10978. Basic.AppendToSegmentedName(name,suffix);
  10979. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  10980. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  10981. Info(section, "HeapBlock");
  10982. Address(section,0); (* empty such that GC does not go on traversing *)
  10983. Info(section, suffix);
  10984. Address(section,0);
  10985. pc := section.pc;
  10986. RETURN section;
  10987. END SymbolSection;
  10988. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  10989. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  10990. BEGIN
  10991. ASSERT(implementationVisitor.newObjectFile);
  10992. IF ~ReflectionSupport OR simple THEN variable := NIL
  10993. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  10994. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  10995. IF type IS SyntaxTree.PointerType THEN
  10996. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10997. END;
  10998. IF type IS SyntaxTree.RecordType THEN
  10999. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11000. ELSIF type IS SyntaxTree.CellType THEN
  11001. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11002. END;
  11003. ELSIF symbol IS SyntaxTree.Procedure THEN
  11004. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11005. END;
  11006. Info(in, "variables");
  11007. IF variable # NIL THEN
  11008. section := SymbolSection(symbol, "@Variables",pc);
  11009. VariableArray(section, variable);
  11010. Symbol(in, section, pc, 0);
  11011. ELSE
  11012. Address(in, 0);
  11013. END;
  11014. END ReflectVariables;
  11015. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11016. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11017. BEGIN
  11018. ASSERT(implementationVisitor.newObjectFile);
  11019. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11020. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11021. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11022. IF type IS SyntaxTree.PointerType THEN
  11023. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11024. END;
  11025. IF type IS SyntaxTree.RecordType THEN
  11026. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11027. ELSIF type IS SyntaxTree.CellType THEN
  11028. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11029. END;
  11030. ELSIF symbol IS SyntaxTree.Procedure THEN
  11031. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11032. END;
  11033. Info(in, "procedures");
  11034. IF procedure # NIL THEN
  11035. section := SymbolSection(symbol, "@Procedures",pc);
  11036. ProcedureArray(section, procedure);
  11037. Symbol(in, section, pc, 0);
  11038. ELSE
  11039. Address(in, 0);
  11040. END;
  11041. END ReflectProcedures;
  11042. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11043. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11044. segmentedName: Basic.SegmentedName;
  11045. td: SyntaxTree.TypeDeclaration;
  11046. type: SyntaxTree.Type;
  11047. BEGIN
  11048. Array(source,pc,"Modules.FieldEntry");
  11049. Info(source, "FieldArray");
  11050. size :=0;
  11051. WHILE variable # NIL DO
  11052. Info(source,"name");
  11053. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11054. type := variable.type.resolved;
  11055. Info(source,"offset");
  11056. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11057. Info(source,"type class");
  11058. IF type IS SyntaxTree.PointerType THEN
  11059. Size(source, 1);
  11060. ELSIF type IS SyntaxTree.RecordType THEN
  11061. Size(source, 2);
  11062. ELSIF type IS SyntaxTree.NumberType THEN
  11063. Size(source, 3);
  11064. ELSE
  11065. Size(source, 0);
  11066. END;
  11067. Info(source, "type desc");
  11068. IF type IS SyntaxTree.RecordType THEN
  11069. td := type(SyntaxTree.RecordType).typeDeclaration;
  11070. Global.GetSymbolSegmentedName(td,segmentedName);
  11071. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11072. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11073. ELSE
  11074. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11075. END;
  11076. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11077. Symbol(source, tir, 0, offset);
  11078. ELSE
  11079. Address(source, 0);
  11080. END;
  11081. Info(source,"flags");
  11082. Set(source, {});
  11083. variable := variable.nextVariable;
  11084. INC(size);
  11085. END;
  11086. PatchArray(source,pc,size);
  11087. END VariableArray;
  11088. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11089. VAR pc: LONGINT; size: LONGINT;
  11090. segmentedName: Basic.SegmentedName;
  11091. BEGIN
  11092. Array(source,pc,"Modules.ProcedureEntry");
  11093. Info(source, "ProcedureArray");
  11094. size :=0;
  11095. WHILE procedure # NIL DO
  11096. Info(source,"name");
  11097. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11098. Global.GetSymbolSegmentedName(procedure, segmentedName);
  11099. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11100. (* size *)
  11101. Size(source, 0);
  11102. (* parameters *)
  11103. Address(source, 0);
  11104. (* variables *)
  11105. ReflectVariables(source, procedure);
  11106. ReflectProcedures(source, procedure);
  11107. (* return type entry *)
  11108. Address(source, 0);
  11109. Address(source, 0);
  11110. procedure := procedure.nextProcedure;
  11111. INC(size);
  11112. END;
  11113. PatchArray(source,pc,size);
  11114. END ProcedureArray;
  11115. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11116. VAR recordType: SyntaxTree.RecordType;
  11117. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11118. section: Sections.Section; cellType: SyntaxTree.CellType;
  11119. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11120. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11121. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11122. sectionName: Basic.SectionName;
  11123. CONST MPO=-40000000H;
  11124. BEGIN
  11125. (*
  11126. TypeDesc* = POINTER TO RECORD
  11127. descSize: LONGINT;
  11128. sentinel: LONGINT; (* = MPO-4 *)
  11129. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11130. flags*: SET;
  11131. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11132. name*: Name;
  11133. END;
  11134. *)
  11135. (* source := module.sections.FindByName(...) *)
  11136. Global.GetSymbolSegmentedName(td,name);
  11137. Basic.AppendToSegmentedName(name,"@Info");
  11138. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11139. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11140. Address(source,MPO-4);
  11141. Info(source, "type tag pointer");
  11142. Symbol( source, tag, offset, 0);
  11143. Info(source, "type flags");
  11144. flags := {};
  11145. IF isProtected THEN INCL(flags,31) END;
  11146. Set( source, flags);
  11147. Info(source, "pointer to module");
  11148. moduleSection := ModuleSection();
  11149. Symbol( source, moduleSection, moduleSection.pc,0);
  11150. Info(source, "type name");
  11151. i := 0;
  11152. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11153. (*
  11154. Global.GetSymbolSegmentedName(td,name);
  11155. Basic.SegmentedNameToString(name, sectionName);
  11156. *)
  11157. Name(source,sectionName);
  11158. source.SetReferenced(FALSE);
  11159. Global.GetSymbolSegmentedName(td,name);
  11160. Basic.AppendToSegmentedName(name,"@Fields");
  11161. ReflectVariables(source, td);
  11162. ReflectProcedures(source, td);
  11163. (*
  11164. fieldSection := VariableArray(
  11165. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11166. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11167. Info(fieldSection, "HeapBlock");
  11168. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11169. Info(fieldSection, "TypeDescriptor");
  11170. Address(fieldSection,0);
  11171. Info(source, "FieldArray ref");
  11172. Symbol(source, fieldSection, fieldSection.pc, 0);
  11173. FieldArray(fieldSection);
  11174. Global.GetSymbolSegmentedName(td,name);
  11175. Basic.AppendToSegmentedName(name,"@Procedures");
  11176. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11177. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11178. Info(fieldSection, "HeapBlock");
  11179. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11180. Info(fieldSection, "TypeDescriptor");
  11181. Address(fieldSection,0);
  11182. Info(source, "Procedure Array ref");
  11183. Symbol(source, fieldSection, fieldSection.pc, 0);
  11184. ProcedureArray(fieldSection);
  11185. *)
  11186. RETURN source;
  11187. END NewTypeDescriptorInfo;
  11188. PROCEDURE NewTypeDescriptor;
  11189. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11190. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11191. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11192. numberPointers: LONGINT; padding, i: LONGINT;
  11193. CONST MPO=-40000000H;
  11194. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11195. VAR i: LONGINT;
  11196. PROCEDURE Td(record: SyntaxTree.RecordType);
  11197. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11198. BEGIN
  11199. IF record # NIL THEN
  11200. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11201. baseTD := record.typeDeclaration;
  11202. Global.GetSymbolSegmentedName(baseTD,name);
  11203. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11204. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11205. ELSE
  11206. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11207. END;
  11208. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11209. Symbol(source, tir, 0, offset);
  11210. IF reverse THEN Td(record.GetBaseRecord()) END;
  11211. END;
  11212. END Td;
  11213. BEGIN
  11214. Info(source, "tag table");
  11215. baseRecord := recordType;
  11216. i := 0;
  11217. WHILE baseRecord # NIL DO
  11218. INC(i);
  11219. baseRecord := baseRecord.GetBaseRecord();
  11220. END;
  11221. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11222. IF ~reverse THEN Td(recordType) END;
  11223. WHILE i < size DO
  11224. Address(source,0);
  11225. INC(i);
  11226. END;
  11227. IF reverse THEN Td(recordType) END;
  11228. END TdTable;
  11229. PROCEDURE MethodTable(reverse: BOOLEAN);
  11230. VAR i,methods: LONGINT;
  11231. BEGIN
  11232. Info(source, "method table");
  11233. IF recordType # NIL THEN
  11234. methods := recordType.recordScope.numberMethods;
  11235. IF reverse THEN
  11236. FOR i := methods-1 TO 0 BY -1 DO
  11237. procedure := recordType.recordScope.FindMethod(i);
  11238. Global.GetSymbolSegmentedName(procedure, name);
  11239. NamedSymbol(source, name,procedure, 0,0);
  11240. END;
  11241. ELSE
  11242. FOR i := 0 TO methods-1 DO
  11243. procedure := recordType.recordScope.FindMethod(i);
  11244. Global.GetSymbolSegmentedName(procedure, name);
  11245. NamedSymbol(source, name,procedure, 0,0);
  11246. END;
  11247. END;
  11248. END;
  11249. END MethodTable;
  11250. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11251. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11252. BEGIN
  11253. Info(source, "method table");
  11254. baseRecord := recordType;
  11255. WHILE baseRecord.baseType # NIL DO
  11256. baseRecord := baseRecord.GetBaseRecord ();
  11257. END;
  11258. GetRecordTypeName (baseRecord, name);
  11259. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11260. IF name = stackFrame THEN
  11261. start := 0;
  11262. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11263. baseRecord := recordType;
  11264. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11265. baseRecord := baseRecord.GetBaseRecord ();
  11266. END;
  11267. IF baseRecord # NIL THEN
  11268. GetRecordTypeName (baseRecord, name);
  11269. IF pointer & ~baseRecord.isObject THEN
  11270. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11271. END;
  11272. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11273. ELSIF recordType.isObject THEN
  11274. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11275. ELSIF pointer THEN
  11276. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11277. ELSE
  11278. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11279. END;
  11280. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11281. Symbol(source, tir, 0, 0);
  11282. start := 0;
  11283. baseRecord := recordType;
  11284. WHILE (baseRecord # NIL) DO
  11285. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11286. baseRecord := baseRecord.GetBaseRecord ();
  11287. END;
  11288. ELSE
  11289. (* explicit trace method: *)
  11290. procedure := recordType.recordScope.FindMethod(0);
  11291. IF ~procedure.isFinalizer THEN
  11292. Global.GetSymbolSegmentedName(procedure, name);
  11293. NamedSymbol(source, name,procedure, 0,0);
  11294. END;
  11295. start := 1;
  11296. END;
  11297. IF (name # stackFrame) & recordType.isObject THEN
  11298. baseRecord := recordType;
  11299. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11300. baseRecord := baseRecord.GetBaseRecord ();
  11301. END;
  11302. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11303. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11304. ELSE
  11305. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11306. END;
  11307. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11308. Symbol(source, tir, 0, 0);
  11309. END;
  11310. methods := recordType.recordScope.numberMethods;
  11311. FOR i := start TO methods-1 DO
  11312. procedure := recordType.recordScope.FindMethod(i);
  11313. IF ~procedure.isFinalizer THEN
  11314. Global.GetSymbolSegmentedName(procedure, name);
  11315. NamedSymbol(source, name,procedure, 0,0);
  11316. END;
  11317. END;
  11318. END CooperativeMethodTable;
  11319. BEGIN
  11320. Global.GetSymbolSegmentedName(td,name);
  11321. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11322. source.SetExported(IsExported(td));
  11323. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11324. IF implementationVisitor.backend.cooperative THEN
  11325. base := NIL;
  11326. baseRecord := recordType.GetBaseRecord();
  11327. IF baseRecord # NIL THEN
  11328. baseTD := baseRecord.typeDeclaration;
  11329. END;
  11330. IF ~recordType.isObject THEN
  11331. Info(source, "parent");
  11332. IF baseRecord # NIL THEN
  11333. Global.GetSymbolSegmentedName(baseTD,name);
  11334. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11335. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11336. ELSE
  11337. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11338. END;
  11339. Symbol(source, tir, 0, 0);
  11340. ELSE
  11341. Address(source,0);
  11342. END;
  11343. Info(source, "record size");
  11344. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11345. source.SetReferenced(FALSE);
  11346. CooperativeMethodTable(FALSE);
  11347. base := source;
  11348. Global.GetSymbolSegmentedName(td,name);
  11349. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11350. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11351. source.SetExported(IsExported(td));
  11352. source.SetReferenced(FALSE);
  11353. END;
  11354. Info(source, "parent");
  11355. IF baseRecord # NIL THEN
  11356. Global.GetSymbolSegmentedName(baseTD,name);
  11357. sym := baseTD;
  11358. IF ~recordType.isObject THEN
  11359. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11360. sym := NIL;
  11361. END;
  11362. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11363. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11364. ELSE
  11365. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11366. END;
  11367. Symbol(source, tir, 0, 0);
  11368. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11369. Address(source,0);
  11370. ELSE
  11371. IF recordType.isObject THEN
  11372. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11373. ELSE
  11374. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11375. END;
  11376. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11377. Symbol(source, tir, 0, 0);
  11378. END;
  11379. Info(source, "base record descriptor");
  11380. Symbol(source, base, 0, 0);
  11381. CooperativeMethodTable(TRUE);
  11382. source.SetReferenced(FALSE);
  11383. IF recordType.hasPointers THEN
  11384. IF ~HasExplicitTraceMethod (recordType) THEN
  11385. implementationVisitor.CreateTraceMethod(recordType);
  11386. END;
  11387. implementationVisitor.CreateResetProcedure(recordType);
  11388. implementationVisitor.CreateAssignProcedure(recordType);
  11389. END;
  11390. ELSIF ~simple THEN
  11391. (*
  11392. MethodEnd = MPO
  11393. ---
  11394. methods (# methods)
  11395. ---
  11396. tags (16)
  11397. ---
  11398. TypeDesc = TypeInfoAdr
  11399. ---
  11400. td adr ---> rec size
  11401. ----
  11402. pointer offsets
  11403. ----
  11404. (padding)
  11405. -----
  11406. empty [2 addresses aligned]
  11407. empty
  11408. empty
  11409. numPtrs
  11410. ---
  11411. pointer offsets
  11412. ---
  11413. *)
  11414. Info(source, "MethodEnd = MPO");
  11415. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11416. source(IntermediateCode.Section).Emit(Data(-1,op));
  11417. MethodTable(TRUE);
  11418. TdTable(TypeTags, TRUE);
  11419. Info(source, "type descriptor info pointer");
  11420. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11421. IF (cellType # NIL) THEN
  11422. IF cellType.sizeInBits < 0 THEN
  11423. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11424. END;
  11425. Info(source, "cell size");
  11426. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11427. ELSE
  11428. Info(source, "record size");
  11429. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11430. END;
  11431. Info(source, "pointer offsets pointer");
  11432. padding := 1- source.pc MOD 2;
  11433. Symbol(source, source, source.pc+1+padding,0);
  11434. IF padding >0 THEN
  11435. Info(source, "padding");
  11436. FOR i := 1 TO padding DO Address(source,0) END;
  11437. END;
  11438. IF cellType # NIL THEN
  11439. PointerArray(source, cellType.cellScope, numberPointers);
  11440. ELSE
  11441. PointerArray(source, recordType.recordScope, numberPointers);
  11442. END;
  11443. ELSE
  11444. (*
  11445. simple:
  11446. td adr --> size
  11447. tag(1)
  11448. tag(2)
  11449. tag(3)
  11450. methods ->
  11451. *)
  11452. Info(source, "record size");
  11453. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11454. TdTable(TypeTags, FALSE);
  11455. MethodTable(FALSE);
  11456. source.SetReferenced(FALSE);
  11457. END;
  11458. END NewTypeDescriptor;
  11459. BEGIN
  11460. x := x.resolved;
  11461. IF (x IS SyntaxTree.PointerType) THEN
  11462. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11463. END;
  11464. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11465. recordType := x(SyntaxTree.RecordType);
  11466. td := x.typeDeclaration;
  11467. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11468. ASSERT(td # NIL);
  11469. section := module.allSections.FindBySymbol(td); (* TODO *)
  11470. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11471. IF implementationVisitor.newObjectFile THEN
  11472. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11473. NewTypeDescriptor
  11474. END;
  11475. ELSE
  11476. (* data section in intermediate code *)
  11477. Global.GetSymbolSegmentedName(td,name);
  11478. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11479. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11480. tir.Emit(Data(-1,op));
  11481. END;
  11482. END;
  11483. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11484. cellType := x(SyntaxTree.CellType);
  11485. td := x.typeDeclaration;
  11486. section := module.allSections.FindBySymbol(td); (* TODO *)
  11487. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11488. IF implementationVisitor.newObjectFile THEN
  11489. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11490. NewTypeDescriptor
  11491. END;
  11492. END;
  11493. END;
  11494. END
  11495. END CheckTypeDeclaration
  11496. END MetaDataGenerator;
  11497. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11498. VAR
  11499. trace-: BOOLEAN;
  11500. traceString-: SyntaxTree.IdentifierString;
  11501. traceModuleName-: SyntaxTree.IdentifierString;
  11502. newObjectFile-: BOOLEAN;
  11503. profile-: BOOLEAN;
  11504. noRuntimeChecks: BOOLEAN;
  11505. simpleMetaData-: BOOLEAN;
  11506. noAsserts: BOOLEAN;
  11507. optimize-: BOOLEAN;
  11508. cooperative-: BOOLEAN;
  11509. preregisterStatic-: BOOLEAN;
  11510. dump-: Basic.Writer;
  11511. cellsAreObjects: BOOLEAN;
  11512. PROCEDURE &InitIntermediateBackend*;
  11513. BEGIN
  11514. simpleMetaData := FALSE;
  11515. newObjectFile := FALSE;
  11516. InitBackend;
  11517. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11518. SetTraceModuleName(DefaultTraceModuleName);
  11519. END InitIntermediateBackend;
  11520. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11521. VAR
  11522. declarationVisitor: DeclarationVisitor;
  11523. implementationVisitor: ImplementationVisitor;
  11524. module: Sections.Module;
  11525. name, platformName: SyntaxTree.IdentifierString;
  11526. meta: MetaDataGenerator;
  11527. BEGIN
  11528. ResetError;
  11529. Global.GetSymbolName(x,name);
  11530. NEW(module,x,system); (* backend structures *)
  11531. Global.GetModuleName(x, name);
  11532. module.SetModuleName(name);
  11533. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11534. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11535. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11536. declarationVisitor.Module(x,module);
  11537. IF newObjectFile & ~meta.simple THEN
  11538. meta.Module(implementationVisitor.moduleBodySection);
  11539. END;
  11540. GetDescription(platformName);
  11541. module.SetPlatformName(platformName);
  11542. RETURN module
  11543. END GenerateIntermediate;
  11544. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11545. BEGIN RETURN TRUE
  11546. END SupportedImmediate;
  11547. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11548. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11549. END ProcessSyntaxTreeModule;
  11550. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11551. VAR
  11552. result: Sections.Module;
  11553. traceName: Basic.MessageString;
  11554. BEGIN
  11555. ASSERT(intermediateCodeModule IS Sections.Module);
  11556. result := intermediateCodeModule(Sections.Module);
  11557. IF trace THEN
  11558. traceName := "intermediate code trace: ";
  11559. Strings.Append(traceName,traceString);
  11560. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11561. IF (traceString="") OR (traceString="*") THEN
  11562. result.Dump(dump);
  11563. dump.Update
  11564. ELSE
  11565. Sections.DumpFiltered(dump, result, traceString);
  11566. END
  11567. END;
  11568. RETURN result
  11569. END ProcessIntermediateCodeModule;
  11570. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11571. BEGIN instructionSet := "Intermediate";
  11572. END GetDescription;
  11573. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11574. BEGIN
  11575. SELF.newObjectFile := newObjectFile;
  11576. SELF.simpleMetaData := simpleMetaData;
  11577. END SetNewObjectFile;
  11578. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11579. BEGIN COPY(name, traceModuleName)
  11580. END SetTraceModuleName;
  11581. PROCEDURE DefineOptions(options: Options.Options);
  11582. BEGIN
  11583. DefineOptions^(options);
  11584. options.Add(0X,"trace",Options.String);
  11585. options.Add(0X,"runtime",Options.String);
  11586. options.Add(0X,"newObjectFile",Options.Flag);
  11587. options.Add(0X,"traceModule",Options.String);
  11588. options.Add(0X,"profile",Options.Flag);
  11589. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11590. options.Add(0X,"noAsserts",Options.Flag);
  11591. options.Add(0X,"metaData",Options.String);
  11592. options.Add('o',"optimize", Options.Flag);
  11593. options.Add(0X,"preregisterStatic", Options.Flag);
  11594. options.Add(0X,"cellsAreObjects", Options.Flag);
  11595. END DefineOptions;
  11596. PROCEDURE GetOptions(options: Options.Options);
  11597. VAR name,string: SyntaxTree.IdentifierString;
  11598. BEGIN
  11599. GetOptions^(options);
  11600. trace := options.GetString("trace",traceString);
  11601. profile := options.GetFlag("profile");
  11602. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11603. noAsserts := options.GetFlag("noAsserts");
  11604. cooperative := options.GetFlag("cooperative");
  11605. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11606. IF cooperative THEN
  11607. SetRuntimeModuleName("CPU") END
  11608. END;
  11609. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11610. simpleMetaData := TRUE
  11611. END;
  11612. IF options.GetString("metaData",string) THEN
  11613. IF string = "simple" THEN simpleMetaData := TRUE
  11614. ELSIF string ="full" THEN simpleMetaData := FALSE
  11615. END;
  11616. END;
  11617. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11618. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11619. optimize := options.GetFlag("optimize");
  11620. preregisterStatic := options.GetFlag("preregisterStatic");
  11621. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11622. END GetOptions;
  11623. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11624. BEGIN RETURN SymbolFileFormat.Get()
  11625. END DefaultSymbolFileFormat;
  11626. END IntermediateBackend;
  11627. (* ----------------------------------- register allocation ------------------------------------- *)
  11628. (* register mapping scheme
  11629. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11630. spill offset
  11631. part(n) --> ticket <--> physical register
  11632. spill offset
  11633. *)
  11634. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11635. emptyOperand: IntermediateCode.Operand;
  11636. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11637. statCoopResetVariables: LONGINT;
  11638. statCoopModifyAssignments: LONGINT;
  11639. modifyAssignmentsPC : LONGINT;
  11640. statCoopNilCheck: LONGINT;
  11641. statCoopSwitch: LONGINT;
  11642. statCoopAssignProcedure: LONGINT;
  11643. statCoopTraceMethod: LONGINT;
  11644. statCoopResetProcedure: LONGINT;
  11645. statCoopTraceModule: LONGINT;
  11646. PROCEDURE ResetStatistics*;
  11647. BEGIN
  11648. statCoopResetVariables := 0;
  11649. statCoopModifyAssignments := 0;
  11650. statCoopNilCheck:= 0;
  11651. statCoopSwitch:= 0;
  11652. statCoopAssignProcedure:= 0;
  11653. statCoopTraceMethod:= 0;
  11654. statCoopResetProcedure:= 0;
  11655. statCoopTraceModule:= 0;
  11656. END ResetStatistics;
  11657. PROCEDURE Statistics*;
  11658. BEGIN
  11659. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11660. TRACE(statCoopNilCheck, statCoopSwitch);
  11661. TRACE(statCoopAssignProcedure,
  11662. statCoopTraceMethod,
  11663. statCoopResetProcedure,
  11664. statCoopTraceModule)
  11665. END Statistics;
  11666. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11667. VAR h: LONGINT;
  11668. BEGIN
  11669. WHILE b # 0 DO
  11670. h := a MOD b;
  11671. a := b;
  11672. b := h;
  11673. END;
  11674. RETURN a
  11675. END GCD;
  11676. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11677. BEGIN
  11678. RETURN a*b DIV GCD(a,b)
  11679. END SCM;
  11680. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11681. BEGIN
  11682. (*TRACE(a,b);*)
  11683. IF a = 0 THEN RETURN b
  11684. ELSIF b = 0 THEN RETURN a
  11685. ELSE RETURN SCM(a,b)
  11686. END;
  11687. END CommonAlignment;
  11688. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11689. BEGIN
  11690. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11691. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11692. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11693. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11694. 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)
  11695. END
  11696. END PassBySingleReference;
  11697. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11698. BEGIN
  11699. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11700. END PassInRegister;
  11701. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11702. VAR new: RegisterEntry;
  11703. BEGIN
  11704. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11705. IF queue = NIL THEN
  11706. queue := new
  11707. ELSE
  11708. new.next := queue;
  11709. IF queue#NIL THEN queue.prev := new END;
  11710. queue := new
  11711. END;
  11712. END AddRegisterEntry;
  11713. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11714. VAR this: RegisterEntry;
  11715. BEGIN
  11716. this := queue;
  11717. WHILE (this # NIL) & (this.register # register) DO
  11718. this := this.next;
  11719. END;
  11720. IF this = NIL THEN
  11721. RETURN FALSE
  11722. END;
  11723. ASSERT(this # NIL);
  11724. IF this = queue THEN queue := queue.next END;
  11725. IF this.prev # NIL THEN this.prev.next := this.next END;
  11726. IF this.next # NIL THEN this.next.prev := this.prev END;
  11727. RETURN TRUE
  11728. END RemoveRegisterEntry;
  11729. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11730. BEGIN ASSERT(cond);
  11731. END Assert;
  11732. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11733. BEGIN
  11734. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11735. END ReusableRegister;
  11736. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11737. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11738. BEGIN
  11739. procedure := moduleScope.bodyProcedure;
  11740. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11741. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11742. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11743. procedure.SetScope(moduleScope);
  11744. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11745. procedure.SetAccess(SyntaxTree.Hidden);
  11746. moduleScope.SetBodyProcedure(procedure);
  11747. moduleScope.AddProcedure(procedure);
  11748. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11749. END;
  11750. END EnsureBodyProcedure;
  11751. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11752. VAR import: SyntaxTree.Import;
  11753. selfName: SyntaxTree.IdentifierString;
  11754. module: SyntaxTree.Module;
  11755. BEGIN
  11756. scope.ownerModule.GetName(selfName);
  11757. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11758. module := scope.ownerModule
  11759. ELSE
  11760. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11761. IF import = NIL THEN
  11762. RETURN NIL
  11763. ELSIF import.module = NIL THEN
  11764. RETURN NIL
  11765. ELSE module := import.module
  11766. END;
  11767. END;
  11768. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11769. END GetSymbol;
  11770. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11771. BEGIN
  11772. op.mode := mode;
  11773. IntermediateCode.InitOperand(op.op);
  11774. IntermediateCode.InitOperand(op.tag);
  11775. IntermediateCode.InitOperand(op.extra);
  11776. op.dimOffset := 0;
  11777. END InitOperand;
  11778. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11779. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11780. BEGIN RETURN IntermediateCode.GetType(system, type)
  11781. END GetType;
  11782. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11783. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11784. BEGIN
  11785. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  11786. (*
  11787. UniqueId(name,module,name,adr);
  11788. *)
  11789. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  11790. constant.SetValue(value);
  11791. module.moduleScope.AddConstant(constant);
  11792. constant.SetScope(module.moduleScope);
  11793. RETURN constant
  11794. END BuildConstant;
  11795. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11796. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  11797. BEGIN
  11798. variable := scope.firstVariable;
  11799. WHILE variable # NIL DO
  11800. IF variable.NeedsTrace() THEN
  11801. RETURN TRUE;
  11802. END;
  11803. variable := variable.nextVariable;
  11804. END;
  11805. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11806. WHILE parameter # NIL DO
  11807. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11808. RETURN TRUE;
  11809. END;
  11810. parameter := parameter.nextParameter;
  11811. END;
  11812. RETURN FALSE;
  11813. END HasPointers;
  11814. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  11815. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  11816. END IsVariableParameter;
  11817. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11818. VAR parameter: SyntaxTree.Parameter;
  11819. BEGIN
  11820. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11821. WHILE parameter # NIL DO
  11822. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  11823. IF parameter.movable THEN RETURN TRUE END;
  11824. parameter := parameter.nextParameter;
  11825. END;
  11826. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  11827. END HasVariableParameters;
  11828. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  11829. BEGIN
  11830. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  11831. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  11832. END HasExplicitTraceMethod;
  11833. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  11834. BEGIN
  11835. IF expression.resolved # NIL THEN expression := expression.resolved END;
  11836. IF (expression IS SyntaxTree.IntegerValue) THEN
  11837. val := expression(SyntaxTree.IntegerValue).value;
  11838. RETURN TRUE
  11839. ELSE
  11840. RETURN FALSE
  11841. END;
  11842. END IsIntegerConstant;
  11843. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  11844. BEGIN
  11845. IF val <= 0 THEN RETURN FALSE END;
  11846. exp := 0;
  11847. WHILE ~ODD(val) DO
  11848. val := val DIV 2;
  11849. INC(exp)
  11850. END;
  11851. RETURN val = 1
  11852. END PowerOf2;
  11853. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  11854. VAR procedure: SyntaxTree.Procedure;
  11855. BEGIN
  11856. procedure := record.recordScope.constructor;
  11857. IF procedure = NIL THEN
  11858. record := record.GetBaseRecord();
  11859. IF record # NIL THEN
  11860. procedure := GetConstructor(record)
  11861. END;
  11862. END;
  11863. RETURN procedure;
  11864. END GetConstructor;
  11865. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  11866. BEGIN
  11867. value := SHORT(op.intValue);
  11868. RETURN op.mode = IntermediateCode.ModeImmediate;
  11869. END IsIntegerImmediate;
  11870. (** whether a type strictily is a pointer to record or object type
  11871. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  11872. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  11873. BEGIN
  11874. IF type = NIL THEN
  11875. RETURN FALSE
  11876. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  11877. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  11878. ELSE
  11879. RETURN FALSE
  11880. END
  11881. END IsStrictlyPointerToRecord;
  11882. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  11883. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  11884. END IsUnsafePointer;
  11885. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  11886. BEGIN type := type.resolved;
  11887. IF type IS SyntaxTree.PointerType THEN
  11888. type := type(SyntaxTree.PointerType).pointerBase;
  11889. type := type.resolved;
  11890. IF type IS SyntaxTree.RecordType THEN
  11891. recordType := type(SyntaxTree.RecordType);
  11892. RETURN TRUE
  11893. ELSE
  11894. RETURN FALSE
  11895. END
  11896. ELSIF type IS SyntaxTree.RecordType THEN
  11897. recordType := type(SyntaxTree.RecordType);
  11898. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  11899. ELSIF type IS SyntaxTree.ObjectType THEN
  11900. RETURN TRUE
  11901. ELSIF type IS SyntaxTree.AnyType THEN
  11902. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  11903. ELSE
  11904. RETURN FALSE
  11905. END;
  11906. END IsPointerToRecord;
  11907. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  11908. BEGIN
  11909. type := type.resolved;
  11910. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  11911. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  11912. END IsArrayOfSystemByte;
  11913. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  11914. BEGIN
  11915. IF type = NIL THEN RETURN FALSE END;
  11916. type := type.resolved;
  11917. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  11918. END IsOpenArray;
  11919. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  11920. BEGIN
  11921. IF type = NIL THEN RETURN FALSE END;
  11922. type := type.resolved;
  11923. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  11924. END IsSemiDynamicArray;
  11925. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  11926. BEGIN
  11927. IF type = NIL THEN RETURN FALSE END;
  11928. type := type.resolved;
  11929. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  11930. END IsStaticArray;
  11931. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  11932. VAR size: LONGINT;
  11933. BEGIN
  11934. size := 1;
  11935. WHILE (IsStaticArray(type)) DO
  11936. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  11937. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11938. END;
  11939. RETURN size;
  11940. END StaticArrayNumElements;
  11941. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11942. BEGIN
  11943. WHILE (IsStaticArray(type)) DO
  11944. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11945. END;
  11946. RETURN type;
  11947. END StaticArrayBaseType;
  11948. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11949. BEGIN
  11950. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  11951. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11952. END;
  11953. RETURN type;
  11954. END ArrayBaseType;
  11955. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  11956. BEGIN
  11957. IF type = NIL THEN RETURN FALSE END;
  11958. type := type.resolved;
  11959. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  11960. END IsDelegate;
  11961. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  11962. VAR i: LONGINT;
  11963. BEGIN
  11964. i := 0; type := type.resolved;
  11965. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  11966. INC(i);
  11967. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  11968. END;
  11969. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  11970. INC(i);
  11971. type := type(SyntaxTree.MathArrayType).arrayBase;
  11972. IF type # NIL THEN type := type.resolved END;
  11973. END;
  11974. RETURN i
  11975. END DynamicDim;
  11976. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  11977. BEGIN
  11978. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  11979. type := type(SyntaxTree.ArrayType).arrayBase;
  11980. END;
  11981. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  11982. type := type(SyntaxTree.MathArrayType).arrayBase;
  11983. END;
  11984. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  11985. END StaticSize;
  11986. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  11987. BEGIN
  11988. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  11989. END IsImmediate;
  11990. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  11991. BEGIN
  11992. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  11993. END IsAddress;
  11994. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  11995. BEGIN
  11996. RETURN (x.mode = IntermediateCode.ModeRegister);
  11997. END IsRegister;
  11998. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  11999. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12000. BEGIN
  12001. typeDeclaration := recordType.typeDeclaration;
  12002. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12003. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12004. END GetRecordTypeName;
  12005. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12006. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12007. BEGIN
  12008. parSize := 0;
  12009. IF StructuredReturnType(procedureType) THEN
  12010. parameter := procedureType.returnParameter;
  12011. INC(parSize,system.SizeOfParameter(parameter));
  12012. parSize := parSize + (-parSize) MOD system.addressSize;
  12013. END;
  12014. parameter :=procedureType.lastParameter;
  12015. WHILE (parameter # NIL) DO
  12016. INC(parSize,system.SizeOfParameter(parameter));
  12017. parSize := parSize + (-parSize) MOD system.addressSize;
  12018. parameter := parameter.prevParameter;
  12019. END;
  12020. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12021. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12022. RETURN ToMemoryUnits(system,parSize)
  12023. END ParametersSize;
  12024. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12025. BEGIN
  12026. IF type = NIL THEN RETURN FALSE
  12027. ELSE
  12028. type := type.resolved;
  12029. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12030. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12031. END
  12032. END ReturnedAsParameter;
  12033. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12034. BEGIN
  12035. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12036. END StructuredReturnType;
  12037. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12038. BEGIN
  12039. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12040. END IsNested;
  12041. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12042. BEGIN
  12043. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12044. scope := scope.outerScope;
  12045. END;
  12046. RETURN scope # NIL;
  12047. END InCellScope;
  12048. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12049. BEGIN
  12050. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12051. RETURN 0
  12052. ELSE
  12053. *)
  12054. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12055. (*END;*)
  12056. END ProcedureParametersSize;
  12057. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12058. VAR dataUnit: LONGINT;
  12059. BEGIN dataUnit := system.dataUnit;
  12060. ASSERT(size MOD system.dataUnit = 0);
  12061. RETURN size DIV system.dataUnit
  12062. END ToMemoryUnits;
  12063. PROCEDURE Get*(): Backend.Backend;
  12064. VAR backend: IntermediateBackend;
  12065. BEGIN NEW(backend); RETURN backend
  12066. END Get;
  12067. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12068. VAR instruction: IntermediateCode.Instruction;
  12069. BEGIN
  12070. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12071. RETURN instruction
  12072. END Nop;
  12073. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12074. VAR instruction: IntermediateCode.Instruction;
  12075. BEGIN
  12076. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12077. RETURN instruction
  12078. END Mov;
  12079. (* like Mov but ensures that no new register will be allocated for dest *)
  12080. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12081. VAR instruction: IntermediateCode.Instruction;
  12082. BEGIN
  12083. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12084. RETURN instruction
  12085. END MovReplace;
  12086. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12087. VAR instruction: IntermediateCode.Instruction;
  12088. BEGIN
  12089. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12090. RETURN instruction
  12091. END Conv;
  12092. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12093. VAR instruction: IntermediateCode.Instruction;
  12094. BEGIN
  12095. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12096. RETURN instruction
  12097. END Call;
  12098. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12099. VAR op1, op2: IntermediateCode.Operand;
  12100. VAR instruction: IntermediateCode.Instruction;
  12101. BEGIN
  12102. IntermediateCode.InitNumber(op1,pcOffset);
  12103. IntermediateCode.InitNumber(op2,callingConvention);
  12104. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12105. RETURN instruction
  12106. END Exit;
  12107. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12108. VAR instruction: IntermediateCode.Instruction;
  12109. BEGIN
  12110. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12111. RETURN instruction
  12112. END Return;
  12113. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12114. VAR instruction: IntermediateCode.Instruction;
  12115. BEGIN
  12116. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12117. RETURN instruction
  12118. END Result;
  12119. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12120. VAR op1: IntermediateCode.Operand;
  12121. VAR instruction: IntermediateCode.Instruction;
  12122. BEGIN
  12123. IntermediateCode.InitNumber(op1,nr);
  12124. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12125. RETURN instruction
  12126. END Trap;
  12127. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12128. VAR instruction: IntermediateCode.Instruction;
  12129. BEGIN
  12130. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12131. RETURN instruction
  12132. END Br;
  12133. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12134. VAR instruction: IntermediateCode.Instruction;
  12135. BEGIN
  12136. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12137. RETURN instruction
  12138. END Breq;
  12139. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12140. VAR instruction: IntermediateCode.Instruction;
  12141. BEGIN
  12142. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12143. RETURN instruction
  12144. END Brne;
  12145. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12146. VAR instruction: IntermediateCode.Instruction;
  12147. BEGIN
  12148. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12149. RETURN instruction
  12150. END Brge;
  12151. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12152. VAR instruction: IntermediateCode.Instruction;
  12153. BEGIN
  12154. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12155. RETURN instruction
  12156. END Brlt;
  12157. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12158. VAR instruction: IntermediateCode.Instruction;
  12159. BEGIN
  12160. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12161. RETURN instruction
  12162. END Pop;
  12163. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12164. VAR instruction: IntermediateCode.Instruction;
  12165. BEGIN
  12166. ASSERT(op.mode # IntermediateCode.Undefined);
  12167. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12168. RETURN instruction
  12169. END Push;
  12170. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12171. VAR instruction: IntermediateCode.Instruction;
  12172. BEGIN
  12173. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12174. RETURN instruction
  12175. END Neg;
  12176. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12177. VAR instruction: IntermediateCode.Instruction;
  12178. BEGIN
  12179. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12180. RETURN instruction
  12181. END Not;
  12182. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12183. VAR instruction: IntermediateCode.Instruction;
  12184. BEGIN
  12185. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12186. RETURN instruction
  12187. END Abs;
  12188. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12189. VAR instruction: IntermediateCode.Instruction;
  12190. BEGIN
  12191. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12192. RETURN instruction
  12193. END Mul;
  12194. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12195. VAR instruction: IntermediateCode.Instruction;
  12196. BEGIN
  12197. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12198. RETURN instruction
  12199. END Div;
  12200. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12201. VAR instruction: IntermediateCode.Instruction;
  12202. BEGIN
  12203. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12204. RETURN instruction
  12205. END Mod;
  12206. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12207. VAR instruction: IntermediateCode.Instruction;
  12208. BEGIN
  12209. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12210. RETURN instruction
  12211. END Sub;
  12212. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12213. VAR instruction: IntermediateCode.Instruction;
  12214. BEGIN
  12215. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12216. RETURN instruction
  12217. END Add;
  12218. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12219. VAR instruction: IntermediateCode.Instruction;
  12220. BEGIN
  12221. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12222. RETURN instruction
  12223. END And;
  12224. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12225. VAR instruction: IntermediateCode.Instruction;
  12226. BEGIN
  12227. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12228. RETURN instruction
  12229. END Or;
  12230. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12231. VAR instruction: IntermediateCode.Instruction;
  12232. BEGIN
  12233. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12234. RETURN instruction
  12235. END Xor;
  12236. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12237. VAR instruction: IntermediateCode.Instruction;
  12238. BEGIN
  12239. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12240. RETURN instruction
  12241. END Shl;
  12242. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12243. VAR instruction: IntermediateCode.Instruction;
  12244. BEGIN
  12245. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12246. RETURN instruction
  12247. END Shr;
  12248. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12249. VAR instruction: IntermediateCode.Instruction;
  12250. BEGIN
  12251. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12252. RETURN instruction
  12253. END Rol;
  12254. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12255. VAR instruction: IntermediateCode.Instruction;
  12256. BEGIN
  12257. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12258. RETURN instruction
  12259. END Ror;
  12260. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12261. VAR instruction: IntermediateCode.Instruction;
  12262. BEGIN
  12263. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12264. RETURN instruction
  12265. END Cas;
  12266. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12267. VAR instruction: IntermediateCode.Instruction;
  12268. BEGIN
  12269. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12270. RETURN instruction
  12271. END Copy;
  12272. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12273. VAR instruction: IntermediateCode.Instruction;
  12274. BEGIN
  12275. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12276. RETURN instruction
  12277. END Fill;
  12278. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12279. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12280. BEGIN
  12281. string := IntermediateCode.String(s);
  12282. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12283. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12284. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12285. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12286. RETURN instruction
  12287. END Asm;
  12288. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12289. VAR instruction: IntermediateCode.Instruction;
  12290. BEGIN
  12291. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12292. RETURN instruction
  12293. END Data;
  12294. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12295. VAR instruction: IntermediateCode.Instruction;
  12296. BEGIN
  12297. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12298. IntermediateCode.SetSubType(instruction, subtype);
  12299. RETURN instruction
  12300. END SpecialInstruction;
  12301. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12302. VAR op1: IntermediateCode.Operand;
  12303. VAR instruction: IntermediateCode.Instruction;
  12304. BEGIN
  12305. (*! generate a warning if size exceeds a certain limit *)
  12306. (*
  12307. ASSERT(bytes < 1000000); (* sanity check *)
  12308. *)
  12309. ASSERT(0 <= units); (* sanity check *)
  12310. IntermediateCode.InitNumber(op1,units);
  12311. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12312. RETURN instruction
  12313. END Reserve;
  12314. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12315. VAR op1: IntermediateCode.Operand;
  12316. VAR instruction: IntermediateCode.Instruction;
  12317. BEGIN
  12318. IntermediateCode.InitNumber(op1,position);
  12319. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12320. RETURN instruction
  12321. END LabelInstruction;
  12322. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12323. VAR pc: LONGINT;
  12324. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12325. BEGIN
  12326. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12327. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12328. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12329. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12330. IF instr.op1.type.form = IntermediateCode.Float THEN
  12331. RETURN instr.op1.floatValue = op.floatValue
  12332. ELSE
  12333. RETURN instr.op1.intValue = op.intValue
  12334. END;
  12335. END ProvidesValue;
  12336. BEGIN
  12337. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12338. pc := 0;
  12339. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12340. INC(pc);
  12341. END;
  12342. IF pc = data.pc THEN
  12343. data.Emit(Data(-1,vop));
  12344. END;
  12345. RETURN pc
  12346. END EnterImmediate;
  12347. PROCEDURE Init;
  12348. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12349. BEGIN
  12350. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12351. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12352. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12353. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12354. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12355. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12356. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12357. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12358. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12359. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12360. IntermediateCode.InitOperand(emptyOperand);
  12361. FOR i := 0 TO NumberSystemCalls-1 DO
  12362. name := "@SystemCall";
  12363. Basic.AppendNumber(name,i);
  12364. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12365. END;
  12366. END Init;
  12367. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12368. BEGIN
  12369. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12370. END IsExported;
  12371. BEGIN
  12372. Init;
  12373. END FoxIntermediateBackend.
  12374. Compiler.Compile FoxIntermediateBackend.Mod ~