FoxIntermediateBackend.Mod 531 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. suppressModuleRegistration=FALSE;
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. StrictChecks = FALSE;
  63. BasePointerTypeSize = 5;
  64. BaseArrayTypeSize = BasePointerTypeSize + 3;
  65. LengthOffset = BasePointerTypeSize + 0;
  66. DataOffset = BasePointerTypeSize + 1;
  67. DescriptorOffset = BasePointerTypeSize + 2;
  68. BaseRecordTypeSize = BasePointerTypeSize + 2;
  69. ActionOffset = BasePointerTypeSize + 0;
  70. MonitorOffset = BasePointerTypeSize + 1;
  71. BaseObjectTypeSize = BaseRecordTypeSize;
  72. ActionTypeSize = 3;
  73. MonitorTypeSize = 7;
  74. ProcessorOffset = BaseObjectTypeSize + 1;
  75. StackLimitOffset* = BaseObjectTypeSize + 3;
  76. QuantumOffset = BaseObjectTypeSize + 4;
  77. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  78. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  79. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  80. Size2Flag = 4; (* size = 2 *)
  81. Size3Flag = 5; (* size = 3 *)
  82. Size4Flag = 6; (* size = 4 *)
  83. Size5Flag = 7; (* size = 5 *)
  84. Size6Flag = 8; (* size = 6 *)
  85. Size7Flag = 9; (* size = 7 *)
  86. Size8Flag = 10; (* size = 8 *)
  87. ReflectionSupport = TRUE;
  88. TYPE
  89. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  90. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  91. Operand = RECORD
  92. mode: SHORTINT;
  93. op: IntermediateCode.Operand;
  94. tag: IntermediateCode.Operand;
  95. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  96. dimOffset: LONGINT;
  97. END;
  98. Fixup= POINTER TO RECORD
  99. pc: LONGINT;
  100. nextFixup: Fixup;
  101. END;
  102. WriteBackCall = POINTER TO RECORD
  103. call: SyntaxTree.ProcedureCallDesignator;
  104. next: WriteBackCall;
  105. END;
  106. Label= OBJECT
  107. VAR
  108. fixups: Fixup;
  109. section: IntermediateCode.Section;
  110. pc: LONGINT;
  111. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  112. BEGIN
  113. SELF.section := section; pc := -1;
  114. END InitLabel;
  115. PROCEDURE Resolve(pc: LONGINT);
  116. VAR at: LONGINT;
  117. BEGIN
  118. SELF.pc := pc;
  119. WHILE(fixups # NIL) DO
  120. at := fixups.pc;
  121. section.PatchAddress(at,pc);
  122. fixups := fixups.nextFixup;
  123. END;
  124. END Resolve;
  125. PROCEDURE AddFixup(at: LONGINT);
  126. VAR fixup: Fixup;
  127. BEGIN
  128. ASSERT(pc=-1);
  129. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  130. END AddFixup;
  131. END Label;
  132. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  133. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  134. VAR
  135. backend: IntermediateBackend;
  136. implementationVisitor: ImplementationVisitor;
  137. meta: MetaDataGenerator;
  138. system: Global.System;
  139. currentScope: SyntaxTree.Scope;
  140. module: Sections.Module;
  141. moduleSelf: SyntaxTree.Variable;
  142. dump: BOOLEAN;
  143. forceModuleBody: BOOLEAN;
  144. addressType: IntermediateCode.Type;
  145. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  146. BEGIN
  147. currentScope := NIL; module := NIL; moduleSelf := NIL;
  148. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  149. SELF.dump := dump;
  150. SELF.backend := backend;
  151. SELF.forceModuleBody := forceModuleBody;
  152. addressType := IntermediateCode.GetType(system,system.addressType)
  153. END Init;
  154. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  155. BEGIN
  156. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  157. END Error;
  158. PROCEDURE Type(x: SyntaxTree.Type);
  159. BEGIN
  160. x.Accept(SELF);
  161. END Type;
  162. (** types **)
  163. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  164. BEGIN (* no code emission *) END VisitBasicType;
  165. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  166. BEGIN (* no code emission *) END VisitCharacterType;
  167. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  168. BEGIN (* no code emission *) END VisitIntegerType;
  169. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  170. BEGIN (* no code emission *) END VisitFloatType;
  171. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  172. BEGIN (* no code emission *) END VisitComplexType;
  173. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  174. VAR type: SyntaxTree.Type;
  175. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  176. type := x.resolved;
  177. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  178. meta.CheckTypeDeclaration(type);
  179. END;
  180. END VisitQualifiedType;
  181. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  182. BEGIN (* no code emission *) END VisitStringType;
  183. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  184. BEGIN (* no code emission *)
  185. END VisitArrayRangeType;
  186. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  187. BEGIN (* no code emission *) END VisitArrayType;
  188. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  189. BEGIN
  190. meta.CheckTypeDeclaration(x);
  191. END VisitMathArrayType;
  192. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  193. BEGIN
  194. meta.CheckTypeDeclaration(x);
  195. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  196. END VisitPointerType;
  197. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  198. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  199. BEGIN (* no code emission *)
  200. meta.CheckTypeDeclaration(x);
  201. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  202. IF x.pointerType.typeDeclaration # NIL THEN
  203. td := x.pointerType.typeDeclaration
  204. ELSE
  205. td := x.typeDeclaration
  206. END;
  207. Global.GetSymbolName(td,name);
  208. (* code section for object *)
  209. END;
  210. Scope(x.recordScope);
  211. END VisitRecordType;
  212. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  213. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  214. BEGIN
  215. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  216. WHILE (this # NIL) & (this.identifier# id) DO
  217. this := this.nextModifier;
  218. END;
  219. RETURN this # NIL
  220. END HasFlag;
  221. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  222. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  223. (*
  224. PROCEDURE CreatePorts(type: SyntaxTree.Type; len: LONGINT);
  225. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  226. BEGIN
  227. FOR i := 0 TO len-1 DO
  228. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  229. CreatePorts(baseType, len*len2);
  230. ELSIF IsSemiDynamicArray(type) THEN
  231. port := MIN(LONGINT); (* unknown port address from here on *)
  232. ELSE
  233. IntermediateCode.InitImmediate(op,addressType,adr);
  234. symbol.Emit(Data(-1,op));
  235. INC(port);
  236. END;
  237. END;
  238. END CreatePorts;
  239. *)
  240. BEGIN
  241. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  242. (*
  243. IF (x.cellScope.ownerModule = module.module) THEN
  244. td := x.typeDeclaration;
  245. Global.GetSymbolSegmentedName(td,name);
  246. (* code section for object *)
  247. END;
  248. *)
  249. (* unnecessary to generate space for ports: already represented as hidden variables *)
  250. (*
  251. port := 0;
  252. parameter := x.firstParameter;
  253. WHILE parameter # NIL DO
  254. type := parameter.type.resolved;
  255. Global.GetSymbolSegmentedName(parameter,name);
  256. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection,name,parameter,dump);
  257. IF port >= 0 THEN
  258. (*! could be used for optimization: query value here ???
  259. parameter.SetResolved(SyntaxTree.NewIntegerValue(-1, port));
  260. *)
  261. END;
  262. CreatePorts(type, 1);
  263. IF backend.cellsAreObjects THEN
  264. IF IsStaticArray(parameter.type.resolved) THEN
  265. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  266. END;
  267. END;
  268. parameter := parameter.nextParameter;
  269. END;
  270. *)
  271. capabilities := {};
  272. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  273. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  274. backend.SetCapabilities(capabilities);
  275. Scope(x.cellScope);
  276. END VisitCellType;
  277. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  278. BEGIN (* no code emission *) END VisitProcedureType;
  279. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  280. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  281. END VisitEnumerationType;
  282. (* symbols *)
  283. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  284. BEGIN
  285. Procedure(x);
  286. END VisitProcedure;
  287. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  288. BEGIN
  289. Procedure(x);
  290. END VisitOperator;
  291. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  292. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i: LONGINT;
  293. BEGIN
  294. IF x.externalName # NIL THEN RETURN END;
  295. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  296. (* code section for variable *)
  297. Global.GetSymbolSegmentedName(x,name);
  298. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  299. irv.SetExported(IsExported(x));
  300. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  301. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  302. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  303. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  304. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  305. FOR i := 0 TO DynamicDim(x.type)-1 DO
  306. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  307. END;
  308. ELSE
  309. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))));
  310. IF ~x.fixed THEN
  311. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  312. ELSE
  313. align := x.alignment;
  314. END;
  315. irv.SetPositionOrAlignment(x.fixed, align);
  316. meta.CheckTypeDeclaration(x.type);
  317. END;
  318. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  319. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  320. END;
  321. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  322. END VisitVariable;
  323. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  324. VAR name: Basic.SegmentedName; irv, irl: IntermediateCode.Section; op: Operand; dim: LONGINT;
  325. BEGIN
  326. HALT(100);
  327. (*
  328. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  329. (* code section for variable *)
  330. Global.GetSymbolSegmentedName(x,name);
  331. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  332. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  333. (*
  334. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  335. *)
  336. IF IsSemiDynamicArray(x.type) & ~backend.cellsAreObjects THEN
  337. HALT(100);
  338. irv.Emit(Reserve(x.position, system.addressSize));
  339. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  340. irl := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  341. irl.Emit(Reserve(x.position, DynamicDim(x.type) * system.addressSize));
  342. ELSIF x.defaultValue = NIL THEN
  343. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  344. ELSE
  345. implementationVisitor.inData := TRUE;
  346. implementationVisitor.Evaluate(x.defaultValue, op);
  347. irv.Emit(Data(x.position,op.op));
  348. implementationVisitor.inData := FALSE;
  349. END;
  350. meta.CheckTypeDeclaration(x.type);
  351. *)
  352. END VisitParameter;
  353. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  354. BEGIN
  355. Type(x.declaredType); (* => code in objects *)
  356. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  357. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  358. END;
  359. END VisitTypeDeclaration;
  360. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  361. BEGIN
  362. IF (SyntaxTree.Public * x.access # {}) THEN
  363. implementationVisitor.VisitConstant(x);
  364. END;
  365. END VisitConstant;
  366. PROCEDURE Scope(x: SyntaxTree.Scope);
  367. VAR procedure: SyntaxTree.Procedure;
  368. constant: SyntaxTree.Constant;
  369. variable: SyntaxTree.Variable;
  370. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  371. BEGIN
  372. prevScope := currentScope;
  373. currentScope := x;
  374. (* constants treated in implementation visitor *)
  375. typeDeclaration := x.firstTypeDeclaration;
  376. WHILE typeDeclaration # NIL DO
  377. VisitTypeDeclaration(typeDeclaration);
  378. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  379. END;
  380. variable := x.firstVariable;
  381. WHILE variable # NIL DO
  382. VisitVariable(variable);
  383. variable := variable.nextVariable;
  384. END;
  385. procedure := x.firstProcedure;
  386. WHILE procedure # NIL DO
  387. VisitProcedure(procedure);
  388. procedure := procedure.nextProcedure;
  389. END;
  390. constant := x.firstConstant;
  391. WHILE constant # NIL DO
  392. VisitConstant(constant);
  393. constant := constant.nextConstant;
  394. END;
  395. currentScope := prevScope;
  396. END Scope;
  397. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  398. VAR parameter: SyntaxTree.Parameter;
  399. BEGIN
  400. parameter := first;
  401. WHILE parameter # NIL DO
  402. VisitParameter(parameter);
  403. parameter := parameter.nextParameter;
  404. END;
  405. END Parameters;
  406. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  407. VAR scope: SyntaxTree.ProcedureScope;
  408. prevScope: SyntaxTree.Scope;
  409. inline, finalizer: BOOLEAN;
  410. procedureType: SyntaxTree.ProcedureType;
  411. pc: LONGINT;
  412. stackSize: LONGINT;
  413. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  414. null,size,src,dest,fp,res: IntermediateCode.Operand;
  415. cc: LONGINT;
  416. cellType: SyntaxTree.CellType;
  417. registerNumber: LONGINT;
  418. registerClass: IntermediateCode.RegisterClass;
  419. type: IntermediateCode.Type;
  420. formalParameter: SyntaxTree.Parameter;
  421. recordType: SyntaxTree.RecordType;
  422. isModuleBody: BOOLEAN;
  423. PROCEDURE Signature;
  424. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  425. BEGIN
  426. procedureType := x.type(SyntaxTree.ProcedureType);
  427. returnType := procedureType.returnType;
  428. IF returnType # NIL THEN
  429. meta.CheckTypeDeclaration(returnType)
  430. END;
  431. parameter := procedureType.firstParameter;
  432. WHILE parameter # NIL DO
  433. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  434. parameter := parameter.nextParameter;
  435. END;
  436. END Signature;
  437. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  438. VAR result: BOOLEAN;
  439. BEGIN
  440. result := FALSE;
  441. IF x = SyntaxTree.invalidExpression THEN
  442. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  443. result := TRUE;
  444. value := x.resolved(SyntaxTree.IntegerValue).value;
  445. ELSE
  446. Error(x.position,"expression is not an integer constant");
  447. END;
  448. RETURN result;
  449. END CheckIntegerValue;
  450. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  451. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  452. BEGIN
  453. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  454. WHILE (this # NIL) & (this.identifier # id) DO
  455. this := this.nextModifier;
  456. END;
  457. IF this # NIL THEN
  458. IF this.expression = NIL THEN
  459. Error(this.position,"expected expression value");
  460. ELSIF CheckIntegerValue(this.expression,value) THEN
  461. END;
  462. RETURN TRUE
  463. ELSE RETURN FALSE
  464. END;
  465. END HasValue;
  466. CONST DefaultDataMemorySize=512;
  467. BEGIN
  468. IF x.externalName # NIL THEN RETURN END;
  469. (*
  470. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  471. *)
  472. (* code section for this procedure *)
  473. scope := x.procedureScope;
  474. prevScope := currentScope;
  475. currentScope := scope;
  476. procedureType := x.type(SyntaxTree.ProcedureType);
  477. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  478. implementationVisitor.temporaries.Init;
  479. implementationVisitor.usedRegisters := NIL;
  480. implementationVisitor.registerUsageCount.Init;
  481. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  482. IF (scope.body # NIL) & (x.isInline) THEN
  483. inline := TRUE;
  484. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  485. ir.SetExported(IsExported(x));
  486. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  487. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  488. IF backend.cellsAreObjects THEN
  489. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  490. ir.SetExported(IsExported(x));
  491. ELSE
  492. RETURN; (* cellnet cannot be compiled for final static hardware *)
  493. END;
  494. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  495. inline := FALSE;
  496. AddBodyCallStub(x);
  497. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  498. ir.SetExported(IsExported(x));
  499. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  500. inline := FALSE;
  501. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  502. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  503. AddBodyCallStub(x);
  504. AddStackAllocation(x,stackSize);
  505. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  506. ir.SetExported(IsExported(x));
  507. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  508. inline := FALSE;
  509. Parameters(procedureType.firstParameter);
  510. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  511. ir.SetExported(IsExported(x));
  512. ELSE
  513. inline := FALSE;
  514. IF x.isEntry OR x.isExit THEN
  515. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  516. ir.SetExported(TRUE);
  517. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  518. ELSE
  519. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  520. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  521. END;
  522. END;
  523. cc := procedureType.callingConvention;
  524. IF scope.body # NIL THEN
  525. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  526. registerNumber := 0;
  527. IF ~inline THEN
  528. IF scope.lastVariable = NIL THEN
  529. stackSize := 0
  530. ELSE
  531. stackSize := scope.lastVariable.offsetInBits;
  532. IF stackSize <0 THEN stackSize := -stackSize END;
  533. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  534. END;
  535. (*
  536. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  537. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  538. *)
  539. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  540. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  541. END;
  542. pc := ir.pc-1;
  543. (*
  544. ir.Emit(Nop(position)); (* placeholder for fill *)
  545. *)
  546. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  547. formalParameter := procedureType.lastParameter;
  548. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  549. IF ~PassInRegister(formalParameter) THEN
  550. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  551. ELSE
  552. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  553. type := GetType(system, formalParameter.type);
  554. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  555. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  556. ir.Emit(Mov(-1,dest, src));
  557. implementationVisitor.ReleaseIntermediateOperand(src);
  558. INC(registerNumber);
  559. formalParameter := formalParameter.prevParameter;
  560. END;
  561. END;
  562. END;
  563. ir.EnterValidPAF;
  564. END;
  565. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  566. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  567. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  568. IF scope.lastVariable # NIL THEN
  569. stackSize := scope.lastVariable.offsetInBits;
  570. IF stackSize <0 THEN stackSize := -stackSize END;
  571. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  572. END;
  573. END;
  574. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  575. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  576. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  577. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  578. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  579. ir.EmitAt(pc,Push(size));
  580. implementationVisitor.StaticCallOperand(result,procedure);
  581. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  582. END;
  583. *)
  584. END;
  585. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  586. IF stackSize > 0 THEN
  587. IF (stackSize MOD system.addressSize = 0) THEN
  588. null := IntermediateCode.Immediate(addressType,0);
  589. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  590. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  591. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  592. ELSE
  593. null := IntermediateCode.Immediate(int8,0);
  594. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  595. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  596. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  597. END;
  598. (*! should potentially be called by backend -- enter might initialize
  599. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  600. *)
  601. END;
  602. ir.ExitValidPAF;
  603. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  604. finalizer := FALSE;
  605. IF backend.cooperative & x.isFinalizer THEN
  606. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  607. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  608. GetRecordTypeName(recordType,name);
  609. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  610. END;
  611. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  612. IF backend.cooperative THEN
  613. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  614. IF implementationVisitor.profile & ~isModuleBody THEN
  615. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  616. END;
  617. END;
  618. implementationVisitor.EmitLeave(ir, x.position,cc);
  619. IF finalizer THEN
  620. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  621. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  622. ir.Emit(Br(x.position,dest));
  623. ELSE
  624. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  625. END;
  626. ELSE
  627. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  628. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  629. END;
  630. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  631. IF backend.cooperative THEN
  632. IF HasPointers (scope) THEN
  633. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  634. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  635. ir.Emit(Result(x.position, res));
  636. ir.Emit(Push(x.position, res));
  637. implementationVisitor.ResetVariables(scope);
  638. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  639. ir.Emit(Pop(x.position, res));
  640. ir.Emit(Return(x.position, res));
  641. ELSE
  642. implementationVisitor.ResetVariables(scope);
  643. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  644. END;
  645. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  646. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  647. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  648. ir.Emit(Result(x.position, res));
  649. ir.Emit(Push(x.position, res));
  650. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  651. ir.Emit(Pop(x.position, res));
  652. ir.Emit(Return(x.position, res));
  653. ELSE
  654. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  655. END;
  656. END;
  657. implementationVisitor.EmitLeave(ir,x.position,cc);
  658. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  659. ELSE
  660. ir.Emit(Nop(x.position));
  661. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  662. implementationVisitor.EmitLeave(ir,x.position,cc);
  663. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  664. END;
  665. END;
  666. END
  667. END;
  668. ELSE (* force body for procedures *)
  669. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  670. ir.EnterValidPAF;
  671. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  672. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  673. ir.ExitValidPAF;
  674. implementationVisitor.EmitLeave(ir,x.position,cc);
  675. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  676. END;
  677. Scope(scope);
  678. Signature;
  679. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  680. currentScope := prevScope;
  681. END Procedure;
  682. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  683. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  684. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  685. BEGIN
  686. ASSERT (bodyProcedure # NIL);
  687. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  688. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  689. procedure.SetScope(bodyProcedure.scope);
  690. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  691. procedure.SetAccess(SyntaxTree.Hidden);
  692. Global.GetSymbolSegmentedName (procedure,name);
  693. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  694. ir.SetExported(TRUE);
  695. ir.SetPriority(InitPriority);
  696. Global.GetSymbolSegmentedName (bodyProcedure,name);
  697. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  698. implementationVisitor.currentScope := module.module.moduleScope;
  699. implementationVisitor.section := ir;
  700. implementationVisitor.PushSelfPointer();
  701. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  702. ELSIF backend.preregisterStatic THEN
  703. implementationVisitor.currentScope := module.module.moduleScope;
  704. implementationVisitor.section := ir;
  705. implementationVisitor.PushSelfPointer();
  706. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  707. ELSE
  708. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  709. ir.Emit(Call(bodyProcedure.position,op, 0));
  710. END;
  711. END AddBodyCallStub;
  712. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  713. VAR name: Basic.SegmentedName;
  714. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  715. BEGIN
  716. Global.GetSymbolSegmentedName (symbol,name);
  717. Basic.RemoveSuffix(name);
  718. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  719. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  720. ir.SetExported(TRUE);
  721. ir.SetPriority(FirstPriority);
  722. IntermediateCode.InitImmediate(op,addressType,initStack);
  723. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  724. END AddStackAllocation;
  725. (** entry function to visit a complete module *)
  726. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  727. VAR
  728. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  729. hasDynamicOperatorDeclarations: BOOLEAN;
  730. operator: SyntaxTree.Operator;
  731. import: SyntaxTree.Import;
  732. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  733. BEGIN
  734. type := type.resolved;
  735. IF type IS SyntaxTree.RecordType THEN
  736. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  737. ELSIF (type IS SyntaxTree.ArrayType) THEN
  738. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  739. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  740. END;
  741. ELSIF type IS SyntaxTree.MathArrayType THEN
  742. WITH type: SyntaxTree.MathArrayType DO
  743. IF type.form = SyntaxTree.Open THEN
  744. RETURN TRUE
  745. ELSIF type.form = SyntaxTree.Static THEN
  746. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  747. END;
  748. END;
  749. END;
  750. RETURN FALSE
  751. END TypeNeedsInitialization;
  752. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  753. VAR variable: SyntaxTree.Variable;
  754. BEGIN
  755. variable := scope.firstVariable;
  756. WHILE variable # NIL DO
  757. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  758. IF variable.initializer # NIL THEN RETURN TRUE END;
  759. variable := variable.nextVariable;
  760. END;
  761. RETURN FALSE
  762. END ScopeNeedsInitialization;
  763. BEGIN
  764. ASSERT(x # NIL); ASSERT(module # NIL);
  765. SELF.module := module;
  766. (* add import names to the generated Sections.Module *)
  767. import := x.moduleScope.firstImport;
  768. WHILE import # NIL DO
  769. import.module.GetName(idstr);
  770. module.imports.AddName(idstr);
  771. import := import.nextImport
  772. END;
  773. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  774. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  775. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  776. moduleSelf.SetType(system.anyType);
  777. moduleSelf.SetScope(x.moduleScope);
  778. moduleSelf.SetUntraced(TRUE);
  779. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  780. ir.SetExported(TRUE);
  781. IntermediateCode.InitImmediate(op,addressType,0);
  782. ir.Emit(Data(-1,op));
  783. END;
  784. implementationVisitor.module := module;
  785. implementationVisitor.moduleScope := x.moduleScope;
  786. implementationVisitor.moduleSelf := moduleSelf;
  787. implementationVisitor.canBeLoaded := TRUE;
  788. meta.SetModule(module);
  789. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  790. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  791. END;
  792. IF backend.profile THEN
  793. EnsureBodyProcedure(x.moduleScope);
  794. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  795. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  796. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  797. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  798. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  799. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  800. Global.GetModuleName(module.module,idstr);
  801. implementationVisitor.ProfilerAddModule(idstr);
  802. implementationVisitor.numberProcedures := 0;
  803. END;
  804. implementationVisitor.profile := backend.profile;
  805. (* check if there is at least one dynamic operator locally defined *)
  806. hasDynamicOperatorDeclarations := FALSE;
  807. operator := x.moduleScope.firstOperator;
  808. WHILE operator # NIL DO
  809. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  810. operator := operator.nextOperator
  811. END;
  812. (* add operator initialization code section *)
  813. IF hasDynamicOperatorDeclarations THEN
  814. EnsureBodyProcedure(x.moduleScope);
  815. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  816. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  817. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  818. END;
  819. Scope(x.moduleScope);
  820. IF hasDynamicOperatorDeclarations THEN
  821. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  822. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  823. END;
  824. IF backend.profile THEN
  825. implementationVisitor.ProfilerPatchInit;
  826. END;
  827. END Module;
  828. END DeclarationVisitor;
  829. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  830. RegisterUsageCount*=OBJECT
  831. VAR used: UsedArray; count: LONGINT;
  832. PROCEDURE &Init;
  833. VAR i: LONGINT;
  834. BEGIN
  835. count := 0;
  836. IF used = NIL THEN NEW(used,64); END;
  837. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  838. END Init;
  839. PROCEDURE Grow;
  840. VAR new: UsedArray; size,i: LONGINT;
  841. BEGIN
  842. size := LEN(used)*2;
  843. NEW(new,size);
  844. FOR i := 0 TO LEN(used)-1 DO
  845. new[i].count := used[i].count;
  846. new[i].type := used[i].type;
  847. new[i].map := used[i].map
  848. END;
  849. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  850. used := new
  851. END Grow;
  852. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  853. BEGIN
  854. INC(count);
  855. IF count = LEN(used) THEN Grow END;
  856. used[count].type := type;
  857. used[count].class := class;
  858. used[count].map := count;
  859. RETURN count;
  860. END Next;
  861. PROCEDURE IncUse(register: LONGINT);
  862. BEGIN
  863. INC(used[register].count);
  864. (*
  865. IF (register = 1) & (count > 30) THEN
  866. D.TraceBack;
  867. END;
  868. *)
  869. END IncUse;
  870. PROCEDURE DecUse(register: LONGINT);
  871. BEGIN
  872. DEC(used[register].count);
  873. END DecUse;
  874. PROCEDURE Map(register: LONGINT): LONGINT;
  875. VAR map : LONGINT;
  876. BEGIN
  877. IF register > 0 THEN
  878. map := used[register].map;
  879. WHILE register # map DO register := map; map := used[register].map END;
  880. END;
  881. RETURN register
  882. END Map;
  883. PROCEDURE Use(register: LONGINT): LONGINT;
  884. BEGIN
  885. IF register< LEN(used) THEN
  886. RETURN used[register].count
  887. ELSE
  888. RETURN 0
  889. END
  890. END Use;
  891. END RegisterUsageCount;
  892. RegisterEntry = POINTER TO RECORD
  893. prev,next: RegisterEntry;
  894. register: LONGINT;
  895. registerClass: IntermediateCode.RegisterClass;
  896. type: IntermediateCode.Type;
  897. END;
  898. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  899. Variables = OBJECT (Basic.List)
  900. VAR
  901. inUse: VariableUse;
  902. registerIndex: LONGINT;
  903. PROCEDURE & Init;
  904. VAR i: LONGINT;
  905. BEGIN
  906. InitList(16);
  907. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  908. registerIndex := 1024;
  909. END Init;
  910. PROCEDURE GetUsage(VAR use: VariableUse);
  911. BEGIN
  912. use := inUse;
  913. END GetUsage;
  914. PROCEDURE SetUsage(CONST use: VariableUse);
  915. BEGIN
  916. inUse := use;
  917. END SetUsage;
  918. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  919. VAR any: ANY;
  920. BEGIN
  921. any := Get(i);;
  922. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  923. END GetVariable;
  924. PROCEDURE Occupy(pos: LONGINT);
  925. BEGIN
  926. INCL(inUse[pos DIV 32], pos MOD 32);
  927. END Occupy;
  928. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  929. BEGIN
  930. Occupy(Length());
  931. Add(v);
  932. END AddVariable;
  933. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  934. VAR var : SyntaxTree.Variable;
  935. BEGIN
  936. FOR pos := 0 TO Length()-1 DO
  937. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  938. var := GetVariable(pos);
  939. IF type.SameType(var.type) THEN
  940. Occupy(pos); RETURN var
  941. END;
  942. END;
  943. END;
  944. pos := Length();
  945. RETURN NIL
  946. END GetFreeVariable;
  947. END Variables;
  948. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  949. SymbolMapper = OBJECT
  950. VAR
  951. first: SymbolMap;
  952. PROCEDURE & Init;
  953. BEGIN
  954. first := NIL;
  955. END Init;
  956. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  957. VAR new: SymbolMap;
  958. BEGIN
  959. NEW(new); new.this := this; new.to := to; new.tag := tag;
  960. new.next := first; first := new;
  961. END Add;
  962. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  963. VAR s: SymbolMap;
  964. BEGIN
  965. s := first;
  966. WHILE (s # NIL) & (s.this # this) DO
  967. s := s.next
  968. END;
  969. RETURN s
  970. END Get;
  971. END SymbolMapper;
  972. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  973. VAR
  974. system: Global.System;
  975. section: IntermediateCode.Section;
  976. module: Sections.Module;
  977. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  978. awaitProcCounter, labelId, constId, caseId: LONGINT;
  979. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  980. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  981. checker: SemanticChecker.Checker;
  982. backend: IntermediateBackend;
  983. meta: MetaDataGenerator;
  984. position: LONGINT;
  985. moduleSelf: SyntaxTree.Variable;
  986. (* variables for hand over of variables / temporary state *)
  987. currentScope: SyntaxTree.Scope;
  988. constantDeclaration : SyntaxTree.Symbol;
  989. result: Operand; (* result of the most recent expression / statement *)
  990. destination: IntermediateCode.Operand;
  991. arrayDestinationTag: IntermediateCode.Operand;
  992. arrayDestinationDimension:LONGINT;
  993. currentLoop: Label; (* variable to hand over loop exit jump list *)
  994. conditional: BOOLEAN;
  995. trueLabel, falseLabel, exitLabel: Label;
  996. locked: BOOLEAN;
  997. (*
  998. usedRegisters: Registers;
  999. *)
  1000. registerUsageCount: RegisterUsageCount;
  1001. usedRegisters: RegisterEntry;
  1002. (* useful operands and types *)
  1003. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1004. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1005. commentPrintout: Printout.Printer;
  1006. dump: Streams.Writer;
  1007. tagsAvailable : BOOLEAN;
  1008. supportedInstruction: SupportedInstructionProcedure;
  1009. supportedImmediate: SupportedImmediateProcedure;
  1010. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1011. emitLabels: BOOLEAN;
  1012. runtimeModuleName : SyntaxTree.IdentifierString;
  1013. newObjectFile: BOOLEAN;
  1014. indexCounter: LONGINT;
  1015. profile: BOOLEAN;
  1016. profileId, profileInit: IntermediateCode.Section;
  1017. profileInitPatchPosition: LONGINT;
  1018. numberProcedures: LONGINT;
  1019. procedureResultDesignator : SyntaxTree.Designator;
  1020. operatorInitializationCodeSection: IntermediateCode.Section;
  1021. fingerPrinter: FingerPrinter.FingerPrinter;
  1022. temporaries: Variables;
  1023. canBeLoaded : BOOLEAN;
  1024. currentIsInline: BOOLEAN;
  1025. currentMapper: SymbolMapper;
  1026. currentInlineExit: Label;
  1027. moduleBodySection: IntermediateCode.Section;
  1028. NeedDescriptor : BOOLEAN;
  1029. cooperativeSwitches: BOOLEAN;
  1030. lastSwitchPC: LONGINT;
  1031. isUnchecked: BOOLEAN;
  1032. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1033. newObjectFile: BOOLEAN);
  1034. BEGIN
  1035. SELF.system := system;
  1036. SELF.runtimeModuleName := runtime;
  1037. currentScope := NIL;
  1038. hiddenPointerType := NIL;
  1039. delegatePointerType := NIL;
  1040. awaitProcCounter := 0;
  1041. labelId := 0; constId := 0; labelId := 0;
  1042. SELF.checker := checker;
  1043. SELF.backend := backend;
  1044. position := Diagnostics.Invalid;
  1045. conditional := FALSE;
  1046. locked := FALSE;
  1047. InitOperand(result,ModeUndefined);
  1048. addressType := IntermediateCode.GetType(system,system.addressType);
  1049. setType := IntermediateCode.GetType(system,system.setType);
  1050. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1051. byteType := IntermediateCode.GetType(system, system.byteType);
  1052. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1053. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1054. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1055. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1056. nil := IntermediateCode.Immediate(addressType,0);
  1057. IntermediateCode.InitOperand(destination);
  1058. tagsAvailable := TRUE;
  1059. supportedInstruction := supportedInstructionProcedure;
  1060. supportedImmediate := supportedImmediateProcedure;
  1061. inData := FALSE;
  1062. SELF.emitLabels := emitLabels;
  1063. IntermediateCode.InitOperand(arrayDestinationTag);
  1064. bool := IntermediateCode.GetType(system,system.booleanType);
  1065. IntermediateCode.InitImmediate(false,bool,0);
  1066. IntermediateCode.InitImmediate(true,bool,1);
  1067. SELF.newObjectFile := newObjectFile;
  1068. indexCounter := 0;
  1069. NEW(registerUsageCount);
  1070. usedRegisters := NIL;
  1071. procedureResultDesignator := NIL;
  1072. NEW(fingerPrinter, system);
  1073. NEW(temporaries);
  1074. currentIsInline := FALSE;
  1075. NeedDescriptor := FALSE;
  1076. isUnchecked := backend.noRuntimeChecks;
  1077. END Init;
  1078. TYPE Context = RECORD
  1079. section: IntermediateCode.Section;
  1080. registerUsageCount: RegisterUsageCount;
  1081. usedRegisters: RegisterEntry;
  1082. END;
  1083. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1084. VAR context: Context;
  1085. BEGIN
  1086. context.section := section;
  1087. context.registerUsageCount := registerUsageCount;
  1088. context.usedRegisters := usedRegisters;
  1089. section := new;
  1090. NEW(registerUsageCount);
  1091. usedRegisters := NIL;
  1092. RETURN context;
  1093. END SwitchContext;
  1094. PROCEDURE ReturnToContext(context: Context);
  1095. BEGIN
  1096. section := context.section;
  1097. registerUsageCount := context.registerUsageCount;
  1098. usedRegisters := context.usedRegisters;
  1099. END ReturnToContext;
  1100. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1101. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1102. BEGIN
  1103. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1104. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1105. END;
  1106. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1107. section.SetExported(IsExported(syntaxTreeSymbol));
  1108. RETURN section
  1109. END NewSection;
  1110. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1111. VAR new: LONGINT;
  1112. BEGIN
  1113. new := registerUsageCount.Next(type,class);
  1114. UseRegister(new);
  1115. RETURN new
  1116. END AcquireRegister;
  1117. (** get the name for the code section that represens a certain symbol
  1118. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1119. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1120. VAR
  1121. operatorFingerPrint: SyntaxTree.FingerPrint;
  1122. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1123. BEGIN
  1124. Global.GetSymbolSegmentedName(symbol, name);
  1125. (* if the symbol is an operator, then append the fingerprint to the name *)
  1126. IF symbol IS SyntaxTree.Operator THEN
  1127. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1128. string := "[";
  1129. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1130. Strings.Append(string, operatorFingerPrintString);
  1131. Strings.Append(string, "]");
  1132. Basic.AppendToSegmentedName(name,string);
  1133. END
  1134. END GetCodeSectionNameForSymbol;
  1135. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1136. BEGIN
  1137. IF dump # NIL THEN
  1138. dump.String("enter "); dump.String(s); dump.Ln;
  1139. END;
  1140. END TraceEnter;
  1141. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1142. BEGIN
  1143. IF dump # NIL THEN
  1144. dump.String("exit "); dump.String(s); dump.Ln;
  1145. END;
  1146. END TraceExit;
  1147. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1148. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1149. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1150. VAR i: LONGINT;
  1151. BEGIN
  1152. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1153. IF op.rule # NIL THEN
  1154. FOR i := 0 TO LEN(op.rule)-1 DO
  1155. CheckRegister(op.rule[i])
  1156. END;
  1157. END;
  1158. END CheckRegister;
  1159. BEGIN
  1160. CheckRegister(instruction.op1);
  1161. CheckRegister(instruction.op2);
  1162. CheckRegister(instruction.op3);
  1163. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1164. ELSE section.Emit(instruction);
  1165. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1166. END;
  1167. END Emit;
  1168. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1169. BEGIN
  1170. IF backend.cooperative THEN
  1171. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1172. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1173. ELSE
  1174. Emit(Trap(position,trapNo));
  1175. END;
  1176. END EmitTrap;
  1177. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1178. VAR name: Basic.SegmentedName;
  1179. VAR op1, op2, reg: IntermediateCode.Operand;
  1180. VAR call, nocall: Label;
  1181. VAR parametersSize: LONGINT;
  1182. VAR prevSection: IntermediateCode.Section;
  1183. VAR prevDump: Streams.Writer;
  1184. VAR body: SyntaxTree.Body;
  1185. BEGIN
  1186. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1187. prevSection := SELF.section;
  1188. SELF.section := section;
  1189. prevDump := dump;
  1190. dump := section.comments;
  1191. IF backend.hasLinkRegister THEN
  1192. Emit(Push(-1, lr));
  1193. END;
  1194. Emit(Push(-1,fp));
  1195. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1196. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1197. GetCodeSectionNameForSymbol(procedure, name);
  1198. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1199. ELSE
  1200. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1201. END;
  1202. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1203. Emit(Push(-1,op1));
  1204. Emit(Mov(-1,fp, sp));
  1205. body := procedure.procedureScope.body;
  1206. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1207. NEW(call, section);
  1208. NEW(nocall, section);
  1209. reg := NewRegisterOperand(addressType);
  1210. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1211. Emit(Sub(-1,reg, sp, op1));
  1212. BrltL(call, sp, reg);
  1213. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1214. BrgeL(nocall, sp, op2);
  1215. call.Resolve(section.pc);
  1216. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1217. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1218. Emit(Push(-1, op2));
  1219. Emit(Push(-1, reg));
  1220. ReleaseIntermediateOperand(reg);
  1221. CallThis(position, "Activities","ExpandStack",2);
  1222. Emit(Result(-1, sp));
  1223. nocall.Resolve(section.pc);
  1224. END;
  1225. ELSE
  1226. Emit(Mov(-1, fp, sp));
  1227. END;
  1228. Emit(Enter(-1, callconv, varSize));
  1229. SELF.section := prevSection;
  1230. dump := prevDump;
  1231. END EmitEnter;
  1232. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1233. VAR op1,op2: IntermediateCode.Operand;
  1234. VAR instruction: IntermediateCode.Instruction;
  1235. BEGIN
  1236. IntermediateCode.InitNumber(op1,callconv);
  1237. IntermediateCode.InitNumber(op2,varSize);
  1238. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1239. RETURN instruction
  1240. END Enter;
  1241. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1242. VAR op1: IntermediateCode.Operand;
  1243. VAR instruction: IntermediateCode.Instruction;
  1244. BEGIN
  1245. IntermediateCode.InitNumber(op1,callconv);
  1246. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1247. RETURN instruction
  1248. END Leave;
  1249. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1250. VAR prevSection: IntermediateCode.Section;
  1251. VAR op2: IntermediateCode.Operand;
  1252. BEGIN
  1253. prevSection := SELF.section;
  1254. SELF.section := section;
  1255. Emit(Leave(position, callconv));
  1256. IF backend.cooperative THEN
  1257. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1258. Emit(Add(position, sp, fp, op2));
  1259. ELSE
  1260. Emit(Mov(position, sp, fp));
  1261. END;
  1262. Emit(Pop(position, fp));
  1263. SELF.section := prevSection;
  1264. END EmitLeave;
  1265. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1266. VAR m: SymbolMap;
  1267. BEGIN
  1268. position := x.position;
  1269. IF currentIsInline THEN
  1270. m := currentMapper.Get(x);
  1271. IF m # NIL THEN
  1272. (*
  1273. Printout.Info("mapping from", x);
  1274. Printout.Info("mapping to ", m.to);
  1275. *)
  1276. m.to.Accept(SELF);
  1277. op := result;
  1278. IF m.tag # NIL THEN
  1279. ReleaseIntermediateOperand(result.tag);
  1280. m.tag.Accept(SELF);
  1281. op.tag := result.op;
  1282. ReleaseIntermediateOperand(result.tag);
  1283. END;
  1284. RETURN
  1285. END;
  1286. END;
  1287. x.Accept(SELF);
  1288. op := result;
  1289. END Symbol;
  1290. PROCEDURE Expression(x: SyntaxTree.Expression);
  1291. BEGIN
  1292. position := x.position;
  1293. constantDeclaration := NIL;
  1294. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1295. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1296. END;
  1297. IF x.resolved # NIL THEN
  1298. x.resolved.Accept(SELF)
  1299. ELSE
  1300. x.Accept(SELF)
  1301. END;
  1302. (* check this, was commented out in ActiveCells3 *)
  1303. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1304. Error(x.position, "unsupported modifier");
  1305. END;
  1306. END Expression;
  1307. (*
  1308. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1309. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1310. BEGIN
  1311. temporaries.GetUsage(current);
  1312. FOR i := 0 TO LEN(current)-1 DO
  1313. set := current[i] - previous[i];
  1314. IF set # {} THEN
  1315. FOR j := 0 TO MAX(SET)-1 DO
  1316. IF j IN set THEN
  1317. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1318. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1319. Symbol(variable, op);
  1320. MakeMemory(tmp,op.op,addressType,0);
  1321. ReleaseOperand(op);
  1322. Emit(Mov(position,tmp, nil ) );
  1323. ReleaseIntermediateOperand(tmp);
  1324. END;
  1325. END;
  1326. END;
  1327. END;
  1328. END;
  1329. END ResetUsedTemporaries;
  1330. *)
  1331. PROCEDURE Statement(x: SyntaxTree.Statement);
  1332. VAR use: VariableUse;
  1333. BEGIN
  1334. temporaries.GetUsage(use);
  1335. position := x.position;
  1336. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1337. IF commentPrintout # NIL THEN
  1338. commentPrintout.Statement(x);
  1339. dump.Ln;
  1340. (*dump.Update;*)
  1341. END;
  1342. x.Accept(SELF);
  1343. (*
  1344. CheckRegistersFree();
  1345. *)
  1346. (*ResetUsedTemporaries(use);*)
  1347. temporaries.SetUsage(use);
  1348. END Statement;
  1349. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1350. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1351. *)
  1352. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1353. BEGIN
  1354. IF op.mode = IntermediateCode.ModeMemory THEN
  1355. ReuseCopy(res,op);
  1356. ELSE
  1357. res := op;
  1358. UseIntermediateOperand(res);
  1359. END;
  1360. IntermediateCode.AddOffset(res,offset);
  1361. IntermediateCode.MakeMemory(res,type);
  1362. END MakeMemory;
  1363. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1364. VAR mem: IntermediateCode.Operand;
  1365. BEGIN
  1366. MakeMemory(mem,res,type,offset);
  1367. ReleaseIntermediateOperand(res);
  1368. res := mem;
  1369. END ToMemory;
  1370. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1371. VAR mem: IntermediateCode.Operand;
  1372. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1373. componentType: SyntaxTree.Type;
  1374. BEGIN
  1375. type := type.resolved;
  1376. IF operand.mode = ModeReference THEN
  1377. IF type IS SyntaxTree.RangeType THEN
  1378. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1379. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1380. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1381. ReleaseOperand(operand);
  1382. operand.op := firstOp;
  1383. operand.tag := lastOp;
  1384. operand.extra := stepOp;
  1385. ELSIF type IS SyntaxTree.ComplexType THEN
  1386. componentType := type(SyntaxTree.ComplexType).componentType;
  1387. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1388. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1389. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1390. ReleaseOperand(operand);
  1391. operand.op := firstOp;
  1392. operand.tag := lastOp
  1393. ELSE
  1394. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1395. ReleaseIntermediateOperand(operand.op);
  1396. operand.op := mem;
  1397. END;
  1398. operand.mode := ModeValue;
  1399. END;
  1400. ASSERT(operand.mode = ModeValue);
  1401. END LoadValue;
  1402. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1403. VAR prevConditional: BOOLEAN;
  1404. BEGIN
  1405. prevConditional := conditional;
  1406. conditional := FALSE;
  1407. InitOperand(result, ModeUndefined);
  1408. Expression(x);
  1409. op := result;
  1410. LoadValue(op,x.type.resolved);
  1411. conditional := prevConditional;
  1412. END Evaluate;
  1413. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1414. VAR prevConditional: BOOLEAN;
  1415. BEGIN
  1416. prevConditional := conditional;
  1417. conditional := FALSE;
  1418. InitOperand(result,ModeUndefined);
  1419. Expression(x);
  1420. op := result;
  1421. (*
  1422. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1423. *)
  1424. conditional := prevConditional;
  1425. END Designate;
  1426. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1427. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1428. BEGIN
  1429. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1430. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1431. conditional := TRUE;
  1432. trueLabel := trueL; falseLabel := falseL;
  1433. Expression(x);
  1434. trueL := trueLabel; falseL := falseLabel;
  1435. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1436. END Condition;
  1437. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1438. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1439. BEGIN
  1440. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1441. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1442. RETURN op
  1443. END NewRegisterOperand;
  1444. PROCEDURE UnuseRegister(register: LONGINT);
  1445. BEGIN
  1446. IF (register > 0) THEN
  1447. register := registerUsageCount.Map(register);
  1448. registerUsageCount.DecUse(register);
  1449. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1450. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1451. END;
  1452. IF registerUsageCount.Use(register)=0 THEN
  1453. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1454. Warning(position, "register cannot be removed");
  1455. END;
  1456. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1457. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1458. END;
  1459. ELSIF registerUsageCount.Use(register)<0 THEN
  1460. Warning(position, "register removed too often");
  1461. IF dump # NIL THEN
  1462. dump.String("register removed too often"); dump.Ln; dump.Update;
  1463. END;
  1464. D.TraceBack;
  1465. END;
  1466. END;
  1467. END UnuseRegister;
  1468. PROCEDURE UseRegister(register: LONGINT);
  1469. BEGIN
  1470. IF (register > 0) THEN
  1471. register := registerUsageCount.Map(register);
  1472. registerUsageCount.IncUse(register);
  1473. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1474. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1475. END;
  1476. IF registerUsageCount.Use(register)=1 THEN
  1477. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1478. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1479. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1480. END;
  1481. END;
  1482. END;
  1483. END UseRegister;
  1484. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1485. BEGIN
  1486. UnuseRegister(op.register)
  1487. END ReleaseIntermediateOperand;
  1488. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1489. BEGIN
  1490. UseRegister(op.register)
  1491. END UseIntermediateOperand;
  1492. PROCEDURE ReleaseOperand(CONST op: Operand);
  1493. BEGIN
  1494. UnuseRegister(op.op.register);
  1495. UnuseRegister(op.tag.register);
  1496. UnuseRegister(op.extra.register);
  1497. END ReleaseOperand;
  1498. (* save registers marked in array "markedRegisters" to the stack
  1499. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1500. *)
  1501. PROCEDURE SaveRegisters();
  1502. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1503. BEGIN
  1504. entry := usedRegisters;
  1505. WHILE entry # NIL DO
  1506. type := registerUsageCount.used[entry.register].type;
  1507. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1508. Emit(Push(position,op));
  1509. entry := entry.next;
  1510. END;
  1511. END SaveRegisters;
  1512. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1513. BEGIN
  1514. saved := usedRegisters;
  1515. usedRegisters := NIL;
  1516. END ReleaseUsedRegisters;
  1517. (** remove parameter registers from used queue *)
  1518. PROCEDURE ReleaseParameterRegisters;
  1519. VAR entry,prev,next: RegisterEntry;
  1520. BEGIN
  1521. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1522. WHILE entry # NIL DO
  1523. next := entry.next;
  1524. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1525. registerUsageCount.DecUse(entry.register);
  1526. ASSERT(registerUsageCount.Use(entry.register)=0);
  1527. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1528. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1529. END;
  1530. ELSIF prev = NIL THEN
  1531. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1532. ELSE
  1533. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1534. END;
  1535. entry := next;
  1536. END;
  1537. END ReleaseParameterRegisters;
  1538. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1539. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1540. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1541. BEGIN
  1542. entry := saved;
  1543. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1544. entry := prev;
  1545. WHILE entry # NIL DO
  1546. prev := entry.prev;
  1547. type := entry.type;
  1548. class := entry.registerClass;
  1549. IntermediateCode.InitRegister(op,type,class,entry.register);
  1550. (*
  1551. new := registerUsageCount.Next(type,class);
  1552. registerUsageCount.Remap(entry.register,new);
  1553. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1554. dump.String("remap register "); dump.Int(entry.register,1);
  1555. dump.String("to "); dump.Int(new,1);
  1556. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1557. END;
  1558. entry.register := new;
  1559. *)
  1560. Emit(Pop(position,op));
  1561. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1562. entry := prev;
  1563. END;
  1564. (*
  1565. usedRegisters := saved;
  1566. *)
  1567. END RestoreRegisters;
  1568. PROCEDURE CheckRegistersFree;
  1569. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1570. BEGIN
  1571. IF usedRegisters # NIL THEN
  1572. r := usedRegisters;
  1573. WHILE r # NIL DO
  1574. warning := "register ";
  1575. Strings.AppendInt(warning, r.register);
  1576. Strings.Append(warning, " not released.");
  1577. Warning(position,warning);
  1578. r := r .next;
  1579. END;
  1580. END;
  1581. FOR i := 0 TO registerUsageCount.count-1 DO
  1582. IF registerUsageCount.used[i].count < 0 THEN
  1583. warning := "register ";
  1584. Strings.AppendInt(warning, i);
  1585. Strings.Append(warning, " unused too often.");
  1586. Warning(position,warning);
  1587. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1588. warning := "register ";
  1589. Strings.AppendInt(warning, i);
  1590. Strings.Append(warning, " not unused often enough.");
  1591. Warning(position,warning);
  1592. END;
  1593. END;
  1594. END CheckRegistersFree;
  1595. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1596. Otherwise allocate a new register.
  1597. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1598. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1599. BEGIN
  1600. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1601. UseIntermediateOperand(result);
  1602. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1603. UseIntermediateOperand(result);
  1604. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1605. END;
  1606. END Reuse2;
  1607. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1608. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1609. If not then allocate a new register.
  1610. Does NOT necessarily keep the content of src1 or src2 in result!
  1611. *)
  1612. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1613. BEGIN
  1614. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1615. UseIntermediateOperand(result);
  1616. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1617. UseIntermediateOperand(result);
  1618. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1619. result := alternative; alternative := emptyOperand;
  1620. UseIntermediateOperand(result);
  1621. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1622. END;
  1623. END Reuse2a;
  1624. (* like reuse2 but only one source *)
  1625. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1626. BEGIN
  1627. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1628. UseIntermediateOperand(result);
  1629. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1630. END;
  1631. END Reuse1;
  1632. (* like reuse2a but only one source *)
  1633. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1634. BEGIN
  1635. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1636. UseIntermediateOperand(result);
  1637. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1638. UseIntermediateOperand(result);
  1639. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1640. END;
  1641. END Reuse1a;
  1642. (* like reuse1 but guarantees that content of src1 is in result *)
  1643. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1644. BEGIN
  1645. IF ReusableRegister(src1) THEN
  1646. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1647. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1648. UseIntermediateOperand(result);
  1649. ELSE
  1650. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1651. Emit(Mov(position,result,src1));
  1652. END
  1653. END ReuseCopy;
  1654. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1655. BEGIN
  1656. IF ReusableRegister(src) THEN
  1657. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1658. ELSE
  1659. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1660. Emit(Mov(position,result,src));
  1661. ReleaseIntermediateOperand(src);
  1662. END
  1663. END TransferToRegister;
  1664. (** labels and branches **)
  1665. PROCEDURE NewLabel(): Label;
  1666. VAR label: Label;
  1667. BEGIN
  1668. NEW(label,section); RETURN label;
  1669. END NewLabel;
  1670. PROCEDURE SetLabel(label: Label);
  1671. BEGIN label.Resolve(section.pc);
  1672. END SetLabel;
  1673. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1674. BEGIN
  1675. ASSERT(label # NIL);
  1676. IF label.pc < 0 THEN (* label not yet set *)
  1677. label.AddFixup(section.pc);
  1678. END;
  1679. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1680. END LabelOperand;
  1681. PROCEDURE BrL(label: Label);
  1682. BEGIN
  1683. Emit(Br(position,LabelOperand(label)));
  1684. END BrL;
  1685. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1686. BEGIN
  1687. Emit(Brge(position,LabelOperand(label),left,right));
  1688. END BrgeL;
  1689. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1690. BEGIN
  1691. Emit(Brlt(position,LabelOperand(label),left,right));
  1692. END BrltL;
  1693. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1694. BEGIN
  1695. Emit(Breq(position,LabelOperand(label),left,right));
  1696. END BreqL;
  1697. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1698. BEGIN
  1699. Emit(Brne(position,LabelOperand(label),left,right));
  1700. END BrneL;
  1701. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1702. VAR new: IntermediateCode.Operand;
  1703. BEGIN
  1704. IF Trace THEN TraceEnter("Convert") END;
  1705. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1706. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1707. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1708. & (operand.offset = 0)
  1709. THEN
  1710. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1711. Emit(Conv(position,new,operand));
  1712. ELSE
  1713. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1714. Emit(Conv(position,new,operand));
  1715. ReleaseIntermediateOperand(operand);
  1716. END;
  1717. operand := new;
  1718. ELSIF (operand.mode = IntermediateCode.ModeImmediate) & (operand.symbol.name = "") & (operand.type.sizeInBits <= type.sizeInBits) & (operand.type.form IN IntermediateCode.Integer) & (type.form IN IntermediateCode.Integer) THEN
  1719. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1720. ELSE
  1721. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1722. Emit(Conv(position,new,operand));
  1723. ReleaseIntermediateOperand(operand);
  1724. operand := new;
  1725. END;
  1726. IF Trace THEN TraceExit("Convert") END;
  1727. END Convert;
  1728. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1729. VAR exit: Label;
  1730. BEGIN
  1731. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1732. exit := NewLabel();
  1733. br(exit,left,right);
  1734. EmitTrap(position,trapNo);
  1735. SetLabel(exit);
  1736. END TrapC;
  1737. (** expressions *)
  1738. (** emit necessary runtime check for set elements **)
  1739. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1740. VAR max: IntermediateCode.Operand;
  1741. BEGIN
  1742. IF isUnchecked THEN RETURN END;
  1743. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1744. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1745. TrapC(BrgeL, max, o, SetElementTrap);
  1746. END;
  1747. END CheckSetElement;
  1748. (** the set that a range represents **)
  1749. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1750. VAR
  1751. operand: Operand;
  1752. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1753. BEGIN
  1754. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1755. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1756. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1757. one := IntermediateCode.Immediate(setType, 1);
  1758. Evaluate(x, operand);
  1759. Convert(operand.op, setType);
  1760. Convert(operand.tag, setType);
  1761. CheckSetElement(operand.op);
  1762. CheckSetElement(operand.tag);
  1763. (* create mask for lower bound
  1764. i.e. shift 11111111 to the left by the value of the lower bound
  1765. *)
  1766. Reuse1(temp, operand.op);
  1767. Emit(Shl(position,temp, allBits, operand.op));
  1768. ReleaseIntermediateOperand(operand.op);
  1769. operand.op := temp;
  1770. (* create mask for upper bound
  1771. i.e. shift 11111111 to the right by the difference between the
  1772. upper bound and the maximum number of set elements
  1773. *)
  1774. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1775. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1776. Reuse1(temp, operand.tag);
  1777. ELSE
  1778. Reuse1(temp, operand.tag);
  1779. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1780. Emit(Sub(position,temp, size, operand.tag));
  1781. END;
  1782. Emit(Shr(position,temp, allBits, operand.tag));
  1783. ReleaseIntermediateOperand(operand.tag);
  1784. operand.tag := temp;
  1785. Reuse2(resultingSet, operand.op, operand.tag);
  1786. (* intersect the two masks *)
  1787. Emit(And(position,resultingSet, operand.op, operand.tag));
  1788. ReleaseOperand(operand);
  1789. RETURN resultingSet
  1790. END SetFromRange;
  1791. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1792. VAR
  1793. res, operand: Operand;
  1794. temp, one, noBits, dest: IntermediateCode.Operand;
  1795. expression: SyntaxTree.Expression;
  1796. i: LONGINT;
  1797. BEGIN
  1798. IF Trace THEN TraceEnter("VisitSet") END;
  1799. dest := destination;
  1800. destination := emptyOperand;
  1801. noBits := IntermediateCode.Immediate(setType, 0);
  1802. one := IntermediateCode.Immediate(setType, 1);
  1803. (* start off with the empty set *)
  1804. InitOperand(res, ModeValue);
  1805. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1806. Emit(Mov(position,res.op, noBits));
  1807. FOR i := 0 TO x.elements.Length() - 1 DO
  1808. expression := x.elements.GetExpression(i);
  1809. IF expression IS SyntaxTree.RangeExpression THEN
  1810. (* range of set elements *)
  1811. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1812. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1813. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1814. ReleaseIntermediateOperand(temp)
  1815. ELSE
  1816. (* singelton element *)
  1817. Evaluate(expression, operand);
  1818. Convert(operand.op, setType);
  1819. CheckSetElement(operand.op);
  1820. (* create subset containing single element *)
  1821. Reuse1(temp, operand.op);
  1822. Emit(Shl(position,temp, one, operand.op));
  1823. ReleaseOperand(operand);
  1824. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1825. ReleaseIntermediateOperand(temp);
  1826. END
  1827. END;
  1828. result := res;
  1829. destination := dest;
  1830. IF Trace THEN TraceExit("VisitSet") END;
  1831. END VisitSet;
  1832. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1833. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1834. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1835. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1836. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1837. element: SyntaxTree.IntegerValue;
  1838. BEGIN
  1839. numberElements := x.elements.Length();
  1840. expression := index.parameters.GetExpression(dim);
  1841. element := expression(SyntaxTree.IntegerValue);
  1842. FOR i := 0 TO numberElements-1 DO
  1843. expression := x.elements.GetExpression(i);
  1844. element.SetValue(i);
  1845. IF expression IS SyntaxTree.MathArrayExpression THEN
  1846. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1847. ELSE
  1848. Assign(index,expression);
  1849. END;
  1850. END;
  1851. END RecursiveAssignment;
  1852. BEGIN
  1853. variable := GetTemporaryVariable(x.type, FALSE);
  1854. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1855. designator.SetType(variable.type);
  1856. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1857. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1858. FOR i := 0 TO dim-1 DO
  1859. element := SyntaxTree.NewIntegerValue(x.position,0);
  1860. element.SetType(system.longintType);
  1861. index.parameters.AddExpression(element);
  1862. END;
  1863. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1864. RecursiveAssignment(x,0);
  1865. Expression(designator);
  1866. END VisitMathArrayExpression;
  1867. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1868. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1869. BEGIN
  1870. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1871. dest := destination; destination := emptyOperand;
  1872. IF x.operator = Scanner.Not THEN
  1873. IF conditional THEN
  1874. Condition(x.left,falseLabel,trueLabel)
  1875. ELSE
  1876. Evaluate(x.left,operand);
  1877. InitOperand(result,ModeValue);
  1878. Reuse1a(result.op,operand.op,dest);
  1879. Emit(Xor(position,result.op,operand.op,true));
  1880. ReleaseOperand(operand);
  1881. END;
  1882. ELSIF x.operator = Scanner.Minus THEN
  1883. Evaluate(x.left,operand);
  1884. InitOperand(result,ModeValue);
  1885. Reuse1a(result.op,operand.op,dest);
  1886. type := x.left.type.resolved;
  1887. IF type IS SyntaxTree.SetType THEN
  1888. Emit(Not(position,result.op,operand.op));
  1889. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1890. Reuse1(result.tag,operand.tag);
  1891. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1892. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1893. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  1894. Emit(Neg(position,result.op,operand.op));
  1895. ELSE HALT(200)
  1896. END;
  1897. ReleaseOperand(operand);
  1898. ELSIF x.operator = Scanner.Address THEN
  1899. Designate(x.left,operand);
  1900. operand.mode := ModeValue;
  1901. t0 := x.left.type.resolved;
  1902. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  1903. ReleaseIntermediateOperand(operand.op);
  1904. operand.op := operand.tag;
  1905. IntermediateCode.InitOperand(operand.tag);
  1906. END;
  1907. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  1908. result := operand;
  1909. ELSE HALT(100)
  1910. END;
  1911. destination := dest;
  1912. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  1913. END VisitUnaryExpression;
  1914. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  1915. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  1916. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  1917. BEGIN
  1918. type := type.resolved;
  1919. originalType := type;
  1920. IF type IS SyntaxTree.PointerType THEN
  1921. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  1922. END;
  1923. IF type IS SyntaxTree.ObjectType THEN
  1924. BrL(trueL);
  1925. ELSE
  1926. ASSERT(type IS SyntaxTree.RecordType);
  1927. (*
  1928. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  1929. *)
  1930. ReuseCopy(left,tag);
  1931. right := TypeDescriptorAdr(type);
  1932. IF ~newObjectFile THEN
  1933. IntermediateCode.MakeMemory(right,addressType);
  1934. END;
  1935. IF backend.cooperative THEN
  1936. repeatL := NewLabel();
  1937. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  1938. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  1939. END;
  1940. SetLabel(repeatL);
  1941. BreqL(trueL,left,right);
  1942. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  1943. BrneL(repeatL,left,nil);
  1944. ELSIF meta.simple THEN
  1945. level := type(SyntaxTree.RecordType).Level();
  1946. (* get type desc tag of level relative to base tag *)
  1947. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  1948. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1949. IntermediateCode.MakeMemory(left,addressType);
  1950. BreqL(trueL,left,right);
  1951. ELSE
  1952. level := type(SyntaxTree.RecordType).Level();
  1953. (* get type desc tag of level relative to base tag *)
  1954. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  1955. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1956. IntermediateCode.MakeMemory(left,addressType);
  1957. BreqL(trueL,left,right);
  1958. END;
  1959. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  1960. BrL(falseL);
  1961. END;
  1962. END TypeTest;
  1963. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  1964. BEGIN
  1965. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  1966. IF dump # NIL THEN
  1967. dump.String(s); dump.Ln;
  1968. END;
  1969. END Error;
  1970. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  1971. BEGIN
  1972. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  1973. IF dump # NIL THEN
  1974. dump.String(s); dump.Ln; dump.Update;
  1975. END;
  1976. END Warning;
  1977. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  1978. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  1979. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  1980. operand:Operand;
  1981. BEGIN
  1982. previousSection := section;
  1983. Global.GetModuleName(mod,name);
  1984. Strings.Append(name,".@Trace");
  1985. Basic.ToSegmentedName(name, pooledName);
  1986. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  1987. IF dump # NIL THEN dump := section.comments END;
  1988. variable := mod.moduleScope.firstVariable;
  1989. WHILE variable # NIL DO
  1990. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  1991. Symbol(variable, operand);
  1992. register := operand.op;
  1993. CallTraceMethod(register, variable.type);
  1994. ReleaseIntermediateOperand(register);
  1995. END;
  1996. variable := variable.nextVariable;
  1997. END;
  1998. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  1999. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2000. Emit(Br(position,op));
  2001. INC(statCoopTraceModule, section.pc);
  2002. section := previousSection;
  2003. IF dump # NIL THEN dump := section.comments END;
  2004. END CreateTraceModuleMethod;
  2005. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2006. BEGIN
  2007. Emit (Push(position, dst));
  2008. Emit (Push(position, src));
  2009. CallThis(position,"GarbageCollector","Assign", 2);
  2010. END CallAssignPointer;
  2011. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2012. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2013. BEGIN
  2014. IF SemanticChecker.IsPointerType (type) THEN
  2015. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2016. ELSIF type.IsRecordType() THEN
  2017. Emit (Push(position,dst));
  2018. Emit (Push(position,src));
  2019. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2020. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2021. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2022. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2023. ELSIF IsStaticArray(type) THEN
  2024. size := StaticArrayNumElements(type);
  2025. base := StaticArrayBaseType(type);
  2026. IF base.IsRecordType() THEN
  2027. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2028. Emit (Push(position, dst));
  2029. Emit (Push(position, src));
  2030. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2031. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2032. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2033. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2034. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2035. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2036. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2037. Emit (Push(position, dst));
  2038. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2039. Emit (Push(position, src));
  2040. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2041. ELSE
  2042. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2043. Emit (Push(position, dst));
  2044. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2045. Emit (Push(position, src));
  2046. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2047. ASSERT(StaticArrayBaseType(type).IsPointer());
  2048. END;
  2049. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2050. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2051. Emit (Push(position, dst));
  2052. Emit (Push(position, src));
  2053. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2054. ELSE HALT(100); (* missing ? *)
  2055. END;
  2056. END CallAssignMethod;
  2057. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2058. VAR name: Basic.SegmentedName;
  2059. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2060. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2061. context: Context;
  2062. BEGIN
  2063. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2064. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2065. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2066. GetRecordTypeName (recordType,name);
  2067. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2068. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2069. IF dump # NIL THEN dump := section.comments END;
  2070. variable := recordType.recordScope.firstVariable;
  2071. WHILE variable # NIL DO
  2072. IF variable.NeedsTrace() THEN
  2073. dst := NewRegisterOperand (addressType);
  2074. src := NewRegisterOperand (addressType);
  2075. Emit (Mov(position, dst, parameter1));
  2076. Emit (Mov(position, src, parameter2));
  2077. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2078. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2079. CallAssignMethod(dst, src, variable.type);
  2080. ReleaseIntermediateOperand(src);
  2081. ReleaseIntermediateOperand(dst);
  2082. END;
  2083. variable := variable.nextVariable;
  2084. END;
  2085. recordBase := recordType.GetBaseRecord();
  2086. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2087. GetRecordTypeName (recordBase,name);
  2088. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2089. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2090. Emit(Br(position,op));
  2091. ELSE
  2092. Emit(Exit(position,0,0));
  2093. END;
  2094. IF ~recordType.isObject THEN
  2095. GetRecordTypeName (recordType,name);
  2096. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2097. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2098. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2099. NEW(registerUsageCount);
  2100. usedRegisters := NIL;
  2101. dst := NewRegisterOperand (addressType);
  2102. src := NewRegisterOperand (addressType);
  2103. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2104. Emit(Mov(position, dst, parameter1));
  2105. Emit(Mov(position, src, parameter2));
  2106. label := NewLabel();
  2107. SetLabel(label);
  2108. Emit(Push(position, dst));
  2109. Emit(Push(position, src));
  2110. GetRecordTypeName (recordType,name);
  2111. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2112. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2113. Emit(Call(position, op, 0));
  2114. Emit(Pop(position, src));
  2115. Emit(Pop(position, dst));
  2116. Emit(Add(position, dst, dst, ofs));
  2117. Emit(Add(position, src, src, ofs));
  2118. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2119. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2120. Emit(Exit(position,0,0));
  2121. END;
  2122. INC(statCoopAssignProcedure, section.pc);
  2123. ReturnToContext(context);
  2124. IF dump # NIL THEN dump := section.comments END;
  2125. END CreateAssignProcedure;
  2126. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2127. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2128. BEGIN
  2129. IF IsUnsafePointer (type) THEN
  2130. skip := NewLabel();
  2131. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2132. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2133. BreqL (skip, op, nil);
  2134. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2135. SetLabel (skip);
  2136. ELSIF SemanticChecker.IsPointerType (type) THEN
  2137. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2138. CallThis(position,"GarbageCollector","Mark", 1);
  2139. ELSIF type.IsRecordType() THEN
  2140. Emit (Push(position,register));
  2141. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2142. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2143. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2144. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2145. ELSIF IsStaticArray(type) THEN
  2146. size := StaticArrayNumElements(type);
  2147. base := StaticArrayBaseType(type);
  2148. IF base.IsRecordType() THEN
  2149. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2150. Emit (Push(position, register));
  2151. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2152. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2153. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2154. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2155. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2156. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2157. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2158. Emit (Push(position, register));
  2159. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2160. ELSE
  2161. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2162. Emit (Push(position, register));
  2163. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2164. ASSERT(base.IsPointer());
  2165. END;
  2166. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2167. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2168. CallThis(position,"GarbageCollector","Mark", 1);
  2169. ELSE HALT(100); (* missing ? *)
  2170. END;
  2171. END CallTraceMethod;
  2172. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2173. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2174. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2175. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2176. BEGIN
  2177. previousSection := section;
  2178. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2179. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2180. GetRecordTypeName (recordType,name);
  2181. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2182. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2183. IF dump # NIL THEN dump := section.comments END;
  2184. variable := recordType.recordScope.firstVariable;
  2185. WHILE variable # NIL DO
  2186. IF variable.NeedsTrace() THEN
  2187. register := NewRegisterOperand (addressType);
  2188. Emit (Mov(position,register,parameter1));
  2189. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2190. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2191. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2192. END;
  2193. CallTraceMethod(register, variable.type);
  2194. ReleaseIntermediateOperand(register);
  2195. END;
  2196. variable := variable.nextVariable;
  2197. END;
  2198. recordBase := recordType.GetBaseRecord();
  2199. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2200. recordBase := recordBase.GetBaseRecord();
  2201. END;
  2202. IF recordBase # NIL THEN
  2203. GetRecordTypeName (recordBase,name);
  2204. IF HasExplicitTraceMethod (recordBase) THEN
  2205. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2206. ELSE
  2207. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2208. END;
  2209. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2210. Emit(Br(position,op));
  2211. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2212. Emit(Exit(position,0,0));
  2213. ELSE
  2214. IF recordType.isObject THEN
  2215. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2216. ELSE
  2217. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2218. END;
  2219. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2220. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2221. Emit(Br(position,op));
  2222. END;
  2223. IF ~recordType.isObject THEN
  2224. GetRecordTypeName (recordType,name);
  2225. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2226. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2227. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2228. NEW(registerUsageCount);
  2229. usedRegisters := NIL;
  2230. IF dump # NIL THEN dump := section.comments END;
  2231. register := NewRegisterOperand (addressType);
  2232. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2233. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2234. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2235. END;
  2236. Emit (Push(position,register));
  2237. GetRecordTypeName (recordType,name);
  2238. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2239. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2240. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2241. ReleaseIntermediateOperand(register);
  2242. Emit(Exit(position,0,0));
  2243. GetRecordTypeName (recordType,name);
  2244. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2245. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2246. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2247. NEW(registerUsageCount);
  2248. usedRegisters := NIL;
  2249. register := NewRegisterOperand (addressType);
  2250. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2251. Emit(Mov(position, register, parameter1));
  2252. label := NewLabel();
  2253. SetLabel(label);
  2254. Emit(Push(position, register));
  2255. GetRecordTypeName (recordType,name);
  2256. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2257. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2258. Emit(Call(position, op, 0));
  2259. Emit(Pop(position, register));
  2260. Emit(Add(position, register, register, ofs));
  2261. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2262. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2263. Emit(Exit(position,0,0));
  2264. END;
  2265. INC(statCoopTraceMethod, section.pc);
  2266. ReturnToContext(context);
  2267. IF dump # NIL THEN dump := section.comments END;
  2268. END CreateTraceMethod;
  2269. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2270. VAR name: Basic.SegmentedName;
  2271. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2272. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2273. context: Context;
  2274. BEGIN
  2275. IF recordType.isObject THEN RETURN END;
  2276. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2277. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2278. GetRecordTypeName (recordType,name);
  2279. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2280. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2281. IF dump # NIL THEN dump := section.comments END;
  2282. variable := recordType.recordScope.firstVariable;
  2283. WHILE variable # NIL DO
  2284. IF variable.NeedsTrace() THEN
  2285. dst := NewRegisterOperand (addressType);
  2286. Emit (Mov(position, dst, parameter1));
  2287. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2288. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2289. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2290. END;
  2291. CallResetProcedure(dst, nil, variable.type);
  2292. ReleaseIntermediateOperand(dst);
  2293. END;
  2294. variable := variable.nextVariable;
  2295. END;
  2296. recordBase := recordType.GetBaseRecord();
  2297. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2298. GetRecordTypeName (recordBase,name);
  2299. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2300. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2301. Emit(Br(position,op));
  2302. ELSE
  2303. Emit(Exit(position,0,0));
  2304. END;
  2305. GetRecordTypeName (recordType,name);
  2306. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2307. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2308. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2309. NEW(registerUsageCount);
  2310. usedRegisters := NIL;
  2311. dst := NewRegisterOperand (addressType);
  2312. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2313. Emit(Mov(position, dst, parameter1));
  2314. label := NewLabel();
  2315. SetLabel(label);
  2316. Emit(Push(position, dst));
  2317. GetRecordTypeName (recordType,name);
  2318. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2319. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2320. Emit(Call(position, op, 0));
  2321. Emit(Pop(position, dst));
  2322. Emit(Add(position, dst, dst, ofs));
  2323. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2324. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2325. Emit(Exit(position,0,0));
  2326. INC(statCoopResetProcedure, section.pc);
  2327. ReturnToContext(context);
  2328. IF dump # NIL THEN dump := section.comments END;
  2329. END CreateResetProcedure;
  2330. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2331. VAR name: Basic.SegmentedName; context: Context;
  2332. BEGIN
  2333. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2334. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2335. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2336. IF dump # NIL THEN dump := section.comments END;
  2337. Emit(Push(position,fp));
  2338. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2339. ResetVariables(scope);
  2340. Emit(Pop(position,fp));
  2341. Emit(Exit(position,0,0));
  2342. ReturnToContext(context);
  2343. IF dump # NIL THEN dump := section.comments END;
  2344. END CreateResetMethod;
  2345. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2346. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2347. BEGIN
  2348. IF SemanticChecker.IsPointerType (type) THEN
  2349. Emit (Push(position, dest));
  2350. CallThis(position,"GarbageCollector","Reset", 1);
  2351. ELSIF type.IsRecordType() THEN
  2352. Emit (Push(position, dest));
  2353. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2354. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2355. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2356. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2357. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2358. size := GetArrayLength(type, tag);
  2359. base := ArrayBaseType(type);
  2360. IF base.IsRecordType() THEN
  2361. Emit (Push(position, size));
  2362. Emit (Push(position, dest));
  2363. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2364. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2365. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2366. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2367. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2368. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2369. Emit (Push(position, size));
  2370. Emit (Push(position, dest));
  2371. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2372. ELSE
  2373. Emit (Push(position, size));
  2374. Emit (Push(position, dest));
  2375. CallThis(position,"GarbageCollector","ResetArray", 2);
  2376. ASSERT(ArrayBaseType(type).IsPointer());
  2377. END;
  2378. ReleaseIntermediateOperand(size);
  2379. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2380. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2381. Emit (Push(position, dest));
  2382. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2383. ELSE HALT(100); (* missing ? *)
  2384. END;
  2385. END CallResetProcedure;
  2386. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2387. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2388. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2389. VAR operand: Operand;
  2390. BEGIN
  2391. Symbol (symbol, operand);
  2392. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2393. ReleaseOperand(operand);
  2394. END Reset;
  2395. BEGIN
  2396. previousScope := currentScope;
  2397. currentScope := scope;
  2398. pc := section.pc;
  2399. variable := scope.firstVariable;
  2400. WHILE variable # NIL DO
  2401. IF variable.NeedsTrace() THEN
  2402. Reset (variable);
  2403. END;
  2404. variable := variable.nextVariable;
  2405. END;
  2406. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2407. WHILE parameter # NIL DO
  2408. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2409. Reset (parameter);
  2410. END;
  2411. parameter := parameter.nextParameter;
  2412. END;
  2413. INC(statCoopResetVariables, section.pc - pc);
  2414. currentScope := previousScope;
  2415. END ResetVariables;
  2416. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2417. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2418. VAR op: IntermediateCode.Operand; context: Context;
  2419. BEGIN
  2420. previousSection := section;
  2421. GetCodeSectionNameForSymbol(procedure, name);
  2422. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2423. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2424. IF dump # NIL THEN dump := section.comments END;
  2425. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2426. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2427. Emit(Data(position,op));
  2428. Emit(Data(position,nil));
  2429. IF HasPointers (procedure.procedureScope) THEN
  2430. GetCodeSectionNameForSymbol(procedure, name);
  2431. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2432. ELSE
  2433. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2434. END;
  2435. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2436. Emit(Data(position,op));
  2437. ReturnToContext(context);
  2438. IF dump # NIL THEN dump := section.comments END;
  2439. END CreateProcedureDescriptor;
  2440. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2441. VAR import: SyntaxTree.Import;
  2442. s: Basic.MessageString;
  2443. selfName: SyntaxTree.IdentifierString;
  2444. BEGIN
  2445. moduleScope.ownerModule.GetName(selfName);
  2446. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2447. module := moduleScope.ownerModule
  2448. ELSE
  2449. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2450. IF import = NIL THEN
  2451. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2452. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2453. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2454. s := "Module ";
  2455. Strings.Append(s,moduleName);
  2456. Strings.Append(s," cannot be imported.");
  2457. IF force THEN
  2458. Error(position,s);
  2459. ELSIF canBeLoaded THEN
  2460. Strings.Append(s, "=> no dynamic linking.");
  2461. Warning(position, s);
  2462. canBeLoaded := FALSE;
  2463. END;
  2464. RETURN FALSE
  2465. ELSE
  2466. SELF.module.imports.AddName(moduleName)
  2467. END;
  2468. ELSIF import.module = NIL THEN (* already tried *)
  2469. RETURN FALSE
  2470. END;
  2471. module := import.module;
  2472. END;
  2473. RETURN TRUE
  2474. END AddImport;
  2475. (* needed for old binary object file format*)
  2476. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2477. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2478. BEGIN
  2479. IF AddImport(moduleName,module,TRUE) THEN
  2480. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2481. IF procedure = NIL THEN
  2482. s := "Instruction not supported on target, emulation procedure ";
  2483. Strings.Append(s,moduleName);
  2484. Strings.Append(s,".");
  2485. Strings.Append(s,procedureName);
  2486. Strings.Append(s," not present");
  2487. Error(position,s);
  2488. ELSE
  2489. StaticCallOperand(r,procedure);
  2490. ReleaseOperand(r);
  2491. fp := GetFingerprint(procedure);
  2492. END;
  2493. END;
  2494. END EnsureSymbol;
  2495. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2496. VAR exit: Label; trueL,falseL: Label;
  2497. BEGIN
  2498. trueL := NewLabel();
  2499. falseL := NewLabel();
  2500. exit := NewLabel();
  2501. Condition(x,trueL,falseL);
  2502. InitOperand(result,ModeValue);
  2503. SetLabel(trueL);
  2504. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2505. Emit(Mov(position,result.op,true));
  2506. BrL(exit);
  2507. SetLabel(falseL);
  2508. Emit(MovReplace(position,result.op,false));
  2509. SetLabel(exit);
  2510. END ConditionToValue;
  2511. PROCEDURE ValueToCondition(VAR op: Operand);
  2512. BEGIN
  2513. LoadValue(op,system.booleanType);
  2514. BrneL(trueLabel,op.op, false);
  2515. ReleaseOperand(op);
  2516. BrL(falseLabel);
  2517. END ValueToCondition;
  2518. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2519. VAR size: LONGINT;
  2520. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2521. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2522. BEGIN
  2523. ASSERT(type.form = SyntaxTree.Open);
  2524. baseType := type.arrayBase.resolved;
  2525. IF IsOpenArray(baseType) THEN
  2526. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2527. ELSE
  2528. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2529. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2530. END;
  2531. len := tag;
  2532. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2533. IntermediateCode.MakeMemory(len,addressType);
  2534. UseIntermediateOperand(len);
  2535. Reuse2(res,sizeOperand,len);
  2536. Emit(Mul(position,res,sizeOperand,len));
  2537. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2538. RETURN res
  2539. END GetArraySize;
  2540. BEGIN
  2541. type := type.resolved;
  2542. IF IsOpenArray(type) THEN
  2543. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2544. RETURN tag
  2545. ELSE
  2546. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2547. END;
  2548. ELSE
  2549. size := ToMemoryUnits(system,system.SizeOf(type));
  2550. RETURN IntermediateCode.Immediate(addressType,size)
  2551. END;
  2552. END GetDynamicSize;
  2553. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2554. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2555. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2556. BEGIN
  2557. ASSERT(type.form = SyntaxTree.Open);
  2558. baseType := type.arrayBase.resolved;
  2559. IF IsOpenArray(baseType) THEN
  2560. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2561. ELSE
  2562. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2563. END;
  2564. len := tag;
  2565. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2566. IntermediateCode.MakeMemory(len,addressType);
  2567. UseIntermediateOperand(len);
  2568. Reuse2(res,sizeOperand,len);
  2569. Emit(Mul(position,res,sizeOperand,len));
  2570. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2571. RETURN res
  2572. END GetLength;
  2573. BEGIN
  2574. type := type.resolved;
  2575. IF IsOpenArray(type) THEN
  2576. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2577. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2578. ELSE
  2579. RETURN IntermediateCode.Immediate(addressType,1)
  2580. END;
  2581. END GetArrayLength;
  2582. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2583. VAR result: IntermediateCode.Operand;
  2584. BEGIN
  2585. IF backend.cooperative THEN
  2586. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2587. ELSE
  2588. MakeMemory(result, tag, addressType, 0);
  2589. END;
  2590. RETURN result
  2591. END GetSizeFromTag;
  2592. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2593. VAR parameter: SyntaxTree.Parameter;
  2594. BEGIN
  2595. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2596. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2597. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2598. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2599. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2600. END;
  2601. RETURN GetDynamicSize(e.type, tag);
  2602. END GetArrayOfBytesSize;
  2603. (*
  2604. to find imported symbol. not needed ?
  2605. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2606. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2607. BEGIN
  2608. IF AddImport(moduleName,importedModule,FALSE) THEN
  2609. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2610. RETURN symbol
  2611. ELSE
  2612. RETURN NIL
  2613. END
  2614. END SymbolByName;
  2615. *)
  2616. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2617. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2618. BEGIN
  2619. IF AddImport(moduleName,runtimeModule,force) THEN
  2620. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2621. IF procedure = NIL THEN
  2622. s := "Procedure ";
  2623. Strings.Append(s,moduleName);
  2624. Strings.Append(s,".");
  2625. Strings.Append(s,procedureName);
  2626. Strings.Append(s," not present");
  2627. Error(position,s);
  2628. RETURN FALSE
  2629. ELSE
  2630. RETURN TRUE
  2631. END;
  2632. ELSE RETURN FALSE
  2633. END;
  2634. END GetRuntimeProcedure;
  2635. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2636. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2637. s: Basic.MessageString;
  2638. BEGIN
  2639. Basic.InitSegmentedName(name);
  2640. name[0] := Basic.MakeString(moduleName);
  2641. name[1] := Basic.MakeString(typeName);
  2642. name[2] := -1;
  2643. IF AddImport(moduleName,importedModule, FALSE) THEN
  2644. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2645. IF symbol = NIL THEN
  2646. s := "type ";
  2647. Strings.Append(s,moduleName);
  2648. Strings.Append(s,".");
  2649. Strings.Append(s,typeName);
  2650. Strings.Append(s," not present");
  2651. Error(position,s);
  2652. END;
  2653. ELSE symbol := NIL;
  2654. END;
  2655. IF importedModule = moduleScope.ownerModule THEN
  2656. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2657. ELSE
  2658. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2659. END;
  2660. RETURN symbol
  2661. END GetTypeDescriptor;
  2662. (* 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. *)
  2663. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2664. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2665. pooledName: Basic.SegmentedName; size: LONGINT;
  2666. BEGIN
  2667. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2668. StaticCallOperand(result,procedure);
  2669. IF numberParameters < 0 THEN
  2670. size := ProcedureParametersSize(system,procedure);
  2671. ELSE
  2672. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2673. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2674. Error(position,"runtime call parameter count mismatch");
  2675. END;
  2676. END;
  2677. Emit(Call(position, result.op, size));
  2678. ReleaseOperand(result);
  2679. ELSE (* only static linking possible *)
  2680. ASSERT(numberParameters >= 0);
  2681. Basic.InitSegmentedName(pooledName);
  2682. pooledName[0] := Basic.MakeString(moduleName);
  2683. pooledName[1] := Basic.MakeString(procedureName);
  2684. pooledName[2] := -1;
  2685. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2686. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2687. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2688. END;
  2689. END CallThisChecked;
  2690. (* 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. *)
  2691. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2692. BEGIN
  2693. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2694. END CallThis;
  2695. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2696. VAR
  2697. left,right: Operand;
  2698. leftSize, rightSize: IntermediateCode.Operand;
  2699. saved: RegisterEntry;
  2700. reg: IntermediateCode.Operand;
  2701. procedureName: SyntaxTree.IdentifierString;
  2702. BEGIN
  2703. procedureName := "CompareString";
  2704. SaveRegisters();ReleaseUsedRegisters(saved);
  2705. Designate(leftExpression,left);
  2706. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2707. Emit(Push(position,leftSize));
  2708. ReleaseIntermediateOperand(leftSize);
  2709. Emit(Push(position,left.op));
  2710. ReleaseOperand(left);
  2711. Designate(rightExpression,right);
  2712. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2713. Emit(Push(position,rightSize));
  2714. ReleaseIntermediateOperand(rightSize);
  2715. Emit(Push(position,right.op));
  2716. ReleaseOperand(right);
  2717. IF backend.cooperative THEN
  2718. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2719. ELSE
  2720. CallThis(position,runtimeModuleName,procedureName, 4);
  2721. END;
  2722. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2723. Emit(Result(position,reg));
  2724. (*
  2725. AcquireThisRegister(int8,IntermediateCode.Result);
  2726. *)
  2727. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2728. (*
  2729. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2730. *)
  2731. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2732. ReleaseIntermediateOperand(reg);
  2733. BrL(falseLabel);
  2734. END CompareString;
  2735. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2736. VAR
  2737. left,right: Operand;
  2738. leftSize, rightSize: IntermediateCode.Operand;
  2739. saved: RegisterEntry;
  2740. procedureName: SyntaxTree.IdentifierString;
  2741. BEGIN
  2742. procedureName := "CopyString";
  2743. SaveRegisters();ReleaseUsedRegisters(saved);
  2744. Designate(leftExpression,left);
  2745. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2746. Emit(Push(position,leftSize));
  2747. ReleaseIntermediateOperand(leftSize);
  2748. Emit(Push(position,left.op));
  2749. ReleaseOperand(left);
  2750. Designate(rightExpression,right);
  2751. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2752. Emit(Push(position,rightSize));
  2753. ReleaseIntermediateOperand(rightSize);
  2754. Emit(Push(position,right.op));
  2755. ReleaseOperand(right);
  2756. IF backend.cooperative THEN
  2757. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2758. ELSE
  2759. CallThis(position,runtimeModuleName,procedureName,4);
  2760. END;
  2761. RestoreRegisters(saved);
  2762. END CopyString;
  2763. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2764. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2765. leftType,rightType: SyntaxTree.Type;
  2766. leftExpression,rightExpression : SyntaxTree.Expression;
  2767. componentType: IntermediateCode.Type;
  2768. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2769. size: LONGINT;
  2770. BEGIN
  2771. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2772. dest := destination; destination := emptyOperand;
  2773. leftType := x.left.type.resolved;
  2774. rightType := x.right.type.resolved;
  2775. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2776. CASE x.operator OF
  2777. Scanner.Or:
  2778. (* shortcut evaluation of left OR right *)
  2779. IF ~conditional THEN ConditionToValue(x);
  2780. ELSE
  2781. next := NewLabel();
  2782. Condition(x.left,trueLabel,next);
  2783. SetLabel(next);
  2784. Condition(x.right,trueLabel,falseLabel);
  2785. END;
  2786. |Scanner.And:
  2787. (* shortcut evaluation of left & right *)
  2788. IF ~conditional THEN ConditionToValue(x);
  2789. ELSE
  2790. next := NewLabel();
  2791. Condition(x.left,next,falseLabel);
  2792. SetLabel(next);
  2793. Condition(x.right,trueLabel,falseLabel);
  2794. END;
  2795. |Scanner.Is:
  2796. IF ~conditional THEN ConditionToValue(x);
  2797. ELSE
  2798. (* get type desc tag *)
  2799. IF IsPointerToRecord(leftType,recordType) THEN
  2800. Evaluate(x.left,left);
  2801. Dereference(left,recordType,IsUnsafePointer(leftType))
  2802. ELSE
  2803. Designate(x.left,left);
  2804. END;
  2805. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2806. ReleaseOperand(left);
  2807. END;
  2808. |Scanner.Plus:
  2809. Evaluate(x.left,left);
  2810. Evaluate(x.right,right);
  2811. IF leftType IS SyntaxTree.SetType THEN
  2812. InitOperand(result,ModeValue);
  2813. Reuse2a(result.op,left.op,right.op,dest);
  2814. Emit(Or(position,result.op,left.op,right.op));
  2815. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2816. InitOperand(result,ModeValue);
  2817. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2818. Reuse2(result.tag,left.tag,right.tag);
  2819. Emit(Add(position,result.op,left.op,right.op));
  2820. Emit(Add(position,result.tag,left.tag,right.tag))
  2821. ELSE
  2822. InitOperand(result,ModeValue);
  2823. Reuse2a(result.op,left.op,right.op,dest);
  2824. Emit(Add(position,result.op,left.op,right.op));
  2825. END;
  2826. ReleaseOperand(left); ReleaseOperand(right);
  2827. |Scanner.Minus:
  2828. Evaluate(x.left,left);
  2829. Evaluate(x.right,right);
  2830. IF leftType IS SyntaxTree.SetType THEN
  2831. InitOperand(result,ModeValue);
  2832. Reuse1(result.op,right.op);
  2833. Emit(Not(position,result.op,right.op));
  2834. ReleaseOperand(right);
  2835. Emit(And(position,result.op,result.op,left.op));
  2836. ReleaseOperand(left);
  2837. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2838. InitOperand(result,ModeValue);
  2839. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2840. Reuse2(result.tag,left.tag,right.tag);
  2841. Emit(Sub(position,result.op,left.op,right.op));
  2842. Emit(Sub(position,result.tag,left.tag,right.tag));
  2843. ReleaseOperand(left); ReleaseOperand(right)
  2844. ELSE
  2845. InitOperand(result,ModeValue);
  2846. Reuse2a(result.op,left.op,right.op,dest);
  2847. Emit(Sub(position,result.op,left.op,right.op));
  2848. ReleaseOperand(left); ReleaseOperand(right);
  2849. END;
  2850. |Scanner.Times:
  2851. Evaluate(x.left,left);
  2852. Evaluate(x.right,right);
  2853. IF leftType IS SyntaxTree.SetType THEN
  2854. InitOperand(result,ModeValue);
  2855. Reuse2a(result.op,left.op,right.op,dest);
  2856. Emit(And(position,result.op,left.op,right.op));
  2857. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2858. InitOperand(result,ModeValue);
  2859. Reuse1a(result.op,left.op,dest);
  2860. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2861. Emit(Shl(position,result.op,left.op,right.op));
  2862. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2863. InitOperand(result, ModeValue);
  2864. componentType := left.op.type;
  2865. (* TODO: review this *)
  2866. (*
  2867. result.op = left.op * right.op - left.tag * right.tag
  2868. result.tag = left.tag * right.op + left.op * right.tag
  2869. *)
  2870. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2871. Emit(Mul(position,result.op, left.op, right.op));
  2872. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2873. Emit(Mul(position,tempReg, left.tag, right.tag));
  2874. Emit(Sub(position,result.op, result.op, tempReg));
  2875. Reuse2(result.tag, left.tag, right.op);
  2876. Emit(Mul(position,result.tag, left.tag, right.op));
  2877. Emit(Mul(position,tempReg, left.op, right.tag));
  2878. Emit(Add(position,result.tag, result.tag, tempReg));
  2879. ReleaseIntermediateOperand(tempReg)
  2880. ELSE
  2881. InitOperand(result,ModeValue);
  2882. Reuse2a(result.op,left.op,right.op,dest);
  2883. Emit(Mul(position,result.op,left.op,right.op));
  2884. END;
  2885. ReleaseOperand(left); ReleaseOperand(right);
  2886. |Scanner.Div:
  2887. Evaluate(x.left,left);
  2888. Evaluate(x.right,right);
  2889. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2890. InitOperand(result,ModeValue);
  2891. Reuse1a(result.op,left.op,dest);
  2892. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2893. Emit(Shr(position,result.op,left.op,right.op));
  2894. ELSE
  2895. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2896. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2897. IF ~isUnchecked THEN
  2898. exit := NewLabel();
  2899. BrltL(exit,zero,right.op);
  2900. EmitTrap(position,NegativeDivisorTrap);
  2901. SetLabel(exit);
  2902. END;
  2903. END;
  2904. InitOperand(result,ModeValue);
  2905. Reuse2a(result.op,left.op,right.op,dest);
  2906. Emit(Div(position,result.op,left.op,right.op));
  2907. END;
  2908. ReleaseOperand(left); ReleaseOperand(right);
  2909. |Scanner.Mod:
  2910. Evaluate(x.left,left);
  2911. Evaluate(x.right,right);
  2912. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2913. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  2914. InitOperand(result,ModeValue);
  2915. Reuse1a(result.op,left.op,dest);
  2916. Emit(And(position,result.op,left.op,right.op));
  2917. ELSE
  2918. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2919. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2920. IF ~isUnchecked THEN
  2921. exit := NewLabel();
  2922. BrltL(exit,zero,right.op);
  2923. EmitTrap(position,NegativeDivisorTrap);
  2924. SetLabel(exit);
  2925. END;
  2926. END;
  2927. InitOperand(result,ModeValue);
  2928. Reuse2a(result.op,left.op,right.op,dest);
  2929. Emit(Mod(position,result.op,left.op,right.op));
  2930. END;
  2931. ReleaseOperand(left); ReleaseOperand(right);
  2932. |Scanner.Slash:
  2933. Evaluate(x.left,left);
  2934. Evaluate(x.right,right);
  2935. IF leftType IS SyntaxTree.SetType THEN
  2936. InitOperand(result,ModeValue);
  2937. Reuse2a(result.op,left.op,right.op,dest);
  2938. Emit(Xor(position,result.op,left.op,right.op));
  2939. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2940. InitOperand(result,ModeValue);
  2941. componentType := left.op.type;
  2942. (* review this *)
  2943. (*
  2944. divisor = right.op * right.op + right.tag * right.tag
  2945. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2946. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2947. *)
  2948. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2949. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2950. Emit(Mul(position,tempReg, right.op, right.op));
  2951. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2952. Emit(Add(position,tempReg, tempReg, tempReg2));
  2953. result.op := tempReg2;
  2954. Emit(Mul(position,result.op, left.op, right.op));
  2955. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2956. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2957. Emit(Add(position,result.op, result.op, tempReg2));
  2958. Emit(Div(position,result.op, result.op, tempReg));
  2959. Reuse2(result.tag, left.tag, right.op);
  2960. Emit(Mul(position,result.tag, left.tag, right.op));
  2961. Emit(Mul(position,tempReg2, left.op, right.tag));
  2962. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2963. Emit(Div(position,result.tag, result.tag, tempReg));
  2964. ReleaseIntermediateOperand(tempReg);
  2965. ReleaseIntermediateOperand(tempReg2)
  2966. ELSE
  2967. InitOperand(result,ModeValue);
  2968. Reuse2a(result.op,left.op,right.op,dest);
  2969. Emit(Div(position,result.op,left.op,right.op));
  2970. END;
  2971. ReleaseOperand(left); ReleaseOperand(right);
  2972. |Scanner.Equal:
  2973. IF ~conditional THEN ConditionToValue(x);
  2974. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2975. CompareString(BreqL,x.left,x.right);
  2976. ELSE
  2977. Evaluate(x.left,left);
  2978. Evaluate(x.right,right);
  2979. IF leftType IS SyntaxTree.RangeType THEN
  2980. ASSERT(rightType IS SyntaxTree.RangeType);
  2981. BrneL(falseLabel, left.op, right.op); (* first *)
  2982. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2983. BrneL(falseLabel, left.extra, right.extra); (* step *)
  2984. ReleaseOperand(left); ReleaseOperand(right);
  2985. BrL(trueLabel)
  2986. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  2987. BrneL(falseLabel, left.op, right.op); (* first *)
  2988. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2989. ReleaseOperand(left); ReleaseOperand(right);
  2990. BrL(trueLabel)
  2991. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2992. (* TODO: review this *)
  2993. BrneL(falseLabel, left.op, right.op); (* real part *)
  2994. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  2995. ReleaseOperand(left); ReleaseOperand(right);
  2996. BrL(trueLabel)
  2997. ELSE
  2998. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  2999. ReleaseOperand(left); ReleaseOperand(right);
  3000. BrL(trueLabel);
  3001. END;
  3002. END;
  3003. |Scanner.LessEqual:
  3004. IF ~conditional THEN ConditionToValue(x);
  3005. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3006. CompareString(BrgeL,x.right,x.left);
  3007. ELSE
  3008. Evaluate(x.left,left);
  3009. Evaluate(x.right,right);
  3010. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3011. Reuse1(temp.op,right.op);
  3012. Emit(And(position,temp.op,left.op,right.op));
  3013. ReleaseOperand(right);
  3014. BreqL(trueLabel,temp.op,left.op);
  3015. BrL(falseLabel);
  3016. ReleaseOperand(temp);ReleaseOperand(left);
  3017. ELSE
  3018. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3019. ReleaseOperand(left); ReleaseOperand(right);
  3020. BrL(trueLabel);
  3021. END;
  3022. END;
  3023. |Scanner.Less:
  3024. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3025. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3026. leftExpression.SetType(system.booleanType);
  3027. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3028. rightExpression.SetType(system.booleanType);
  3029. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3030. leftExpression.SetType(system.booleanType);
  3031. Expression(leftExpression);
  3032. ELSIF ~conditional THEN ConditionToValue(x);
  3033. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3034. CompareString(BrltL,x.left,x.right);
  3035. ELSE
  3036. Evaluate(x.left,left);
  3037. Evaluate(x.right,right);
  3038. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3039. ReleaseOperand(left); ReleaseOperand(right);
  3040. BrL(trueLabel);
  3041. END;
  3042. |Scanner.Greater:
  3043. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3044. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3045. leftExpression.SetType(system.booleanType);
  3046. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3047. rightExpression.SetType(system.booleanType);
  3048. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3049. leftExpression.SetType(system.booleanType);
  3050. Expression(leftExpression);
  3051. ELSIF ~conditional THEN ConditionToValue(x);
  3052. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3053. CompareString(BrltL,x.right,x.left);
  3054. ELSE
  3055. Evaluate(x.left,left);
  3056. Evaluate(x.right,right);
  3057. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3058. ReleaseOperand(left); ReleaseOperand(right);
  3059. BrL(trueLabel);
  3060. END;
  3061. |Scanner.GreaterEqual:
  3062. IF ~conditional THEN ConditionToValue(x);
  3063. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3064. CompareString(BrgeL,x.left,x.right);
  3065. ELSE
  3066. Evaluate(x.left,left);
  3067. Evaluate(x.right,right);
  3068. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3069. Reuse1(temp.op,left.op);
  3070. Emit(And(position,temp.op,left.op,right.op));
  3071. ReleaseOperand(left);
  3072. BreqL(trueLabel, temp.op,right.op);
  3073. ReleaseOperand(temp); ReleaseOperand(right);
  3074. BrL(falseLabel);
  3075. ELSE
  3076. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3077. ReleaseOperand(left); ReleaseOperand(right);
  3078. BrL(trueLabel);
  3079. END;
  3080. END;
  3081. |Scanner.Unequal:
  3082. IF ~conditional THEN ConditionToValue(x);
  3083. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3084. CompareString(BrneL,x.left,x.right);
  3085. ELSE
  3086. Evaluate(x.left,left);
  3087. Evaluate(x.right,right);
  3088. IF leftType IS SyntaxTree.RangeType THEN
  3089. ASSERT(rightType IS SyntaxTree.RangeType);
  3090. BrneL(trueLabel, left.op, right.op); (* first *)
  3091. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3092. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3093. ReleaseOperand(left); ReleaseOperand(right);
  3094. BrL(falseLabel)
  3095. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3096. BrneL(trueLabel, left.op, right.op); (* first *)
  3097. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3098. ReleaseOperand(left); ReleaseOperand(right);
  3099. BrL(falseLabel)
  3100. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3101. (* TODO: review this *)
  3102. BrneL(trueLabel, left.op, right.op); (* real part *)
  3103. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3104. ReleaseOperand(left); ReleaseOperand(right);
  3105. BrL(falseLabel)
  3106. ELSE
  3107. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3108. ReleaseOperand(left); ReleaseOperand(right);
  3109. BrL(trueLabel);
  3110. END;
  3111. END;
  3112. |Scanner.In:
  3113. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3114. Evaluate(x.left,left);
  3115. Evaluate(x.right,right);
  3116. Convert(left.op,setType);
  3117. ReuseCopy(temp.op,right.op);
  3118. Emit(Shr(position,temp.op,temp.op,left.op));
  3119. ReleaseOperand(right); ReleaseOperand(left);
  3120. IntermediateCode.InitImmediate(one,setType,1);
  3121. Emit(And(position,temp.op,temp.op,one));
  3122. IF conditional THEN
  3123. IntermediateCode.InitImmediate(zero,setType,0);
  3124. BrneL(trueLabel,temp.op,zero);
  3125. ReleaseOperand(temp);
  3126. BrL(falseLabel);
  3127. ELSE
  3128. Convert(temp.op,bool);
  3129. result.mode := ModeValue;
  3130. result.op := temp.op;
  3131. result.tag := nil; (* may be left over from calls to evaluate *)
  3132. END;
  3133. ELSE
  3134. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3135. IF x.operator = Scanner.Questionmarks THEN
  3136. leftExpression := x.left;
  3137. rightExpression := x.right;
  3138. ELSE
  3139. leftExpression := x.right;
  3140. rightExpression := x.left;
  3141. END;
  3142. Evaluate(leftExpression, left);
  3143. Emit(Push(position,left.op));
  3144. ReleaseOperand(left);
  3145. Designate(rightExpression, right);
  3146. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3147. IF ~backend.cellsAreObjects THEN
  3148. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3149. END;
  3150. Emit(Push(position,right.op));
  3151. ReleaseOperand(right);
  3152. IF backend.cellsAreObjects THEN
  3153. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3154. ELSE
  3155. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3156. END;
  3157. InitOperand(result, ModeValue);
  3158. result.op := NewRegisterOperand(bool);
  3159. Emit(Result(position,result.op));
  3160. IF conditional THEN
  3161. IntermediateCode.InitImmediate(zero,setType,0);
  3162. BrneL(trueLabel,result.op,zero);
  3163. ReleaseOperand(result);
  3164. BrL(falseLabel);
  3165. END;
  3166. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3167. leftExpression := x.left;
  3168. rightExpression := x.right;
  3169. Evaluate(leftExpression, left);
  3170. Emit(Push(position,left.op));
  3171. ReleaseOperand(left);
  3172. Evaluate(rightExpression, right);
  3173. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3174. IF ~backend.cellsAreObjects THEN
  3175. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3176. END;
  3177. Emit(Push(position,right.op));
  3178. ReleaseOperand(right);
  3179. IF backend.cellsAreObjects THEN
  3180. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3181. ELSE
  3182. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3183. END;
  3184. InitOperand(result, ModeValue);
  3185. result.op := NewRegisterOperand(bool);
  3186. Emit(Result(position,result.op));
  3187. IF conditional THEN
  3188. IntermediateCode.InitImmediate(zero,setType,0);
  3189. BrneL(trueLabel,result.op,zero);
  3190. ReleaseOperand(result);
  3191. BrL(falseLabel);
  3192. END;
  3193. ELSE
  3194. HALT(100);
  3195. END;
  3196. END;
  3197. destination := dest;
  3198. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3199. END VisitBinaryExpression;
  3200. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3201. VAR localResult, operand: Operand;
  3202. BEGIN
  3203. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3204. InitOperand(localResult, ModeValue);
  3205. ASSERT(x.first # NIL);
  3206. Evaluate(x.first, operand);
  3207. localResult.op := operand.op;
  3208. ReleaseOperand(operand);
  3209. UseIntermediateOperand(localResult.op);
  3210. ASSERT(x.last # NIL);
  3211. Evaluate(x.last, operand);
  3212. localResult.tag := operand.op;
  3213. ReleaseOperand(operand);
  3214. UseIntermediateOperand(localResult.tag);
  3215. IF x.step # NIL THEN
  3216. Evaluate(x.step, operand);
  3217. localResult.extra := operand.op;
  3218. ReleaseOperand(operand);
  3219. UseIntermediateOperand(localResult.extra);
  3220. END;
  3221. result := localResult;
  3222. IF Trace THEN TraceExit("VisitRangeExpression") END
  3223. END VisitRangeExpression;
  3224. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3225. BEGIN
  3226. HALT(100); (* should never be evaluated *)
  3227. END VisitTensorRangeExpression;
  3228. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3229. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3230. BEGIN
  3231. IF Trace THEN TraceEnter("VisitConversion") END;
  3232. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3233. dest := destination; destination := emptyOperand;
  3234. Evaluate(x.expression,old);
  3235. InitOperand(result,ModeValue);
  3236. result.op := old.op;
  3237. ASSERT(result.op.mode # 0);
  3238. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3239. (* convert TO a complex number *)
  3240. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3241. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3242. ASSERT(result.op.mode # 0);
  3243. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3244. (* convert FROM a complex number TO a complex number*)
  3245. result.tag := old.tag;
  3246. ASSERT(result.tag.mode # 0);
  3247. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3248. ASSERT(result.tag.mode # 0)
  3249. ELSE
  3250. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3251. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3252. END
  3253. ELSE
  3254. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3255. ASSERT(result.op.mode # 0);
  3256. result.tag := old.tag; (*! probably never used *)
  3257. END;
  3258. destination := dest;
  3259. IF Trace THEN TraceExit("VisitConversion") END;
  3260. END VisitConversion;
  3261. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3262. BEGIN
  3263. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3264. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3265. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3266. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3267. END VisitTypeDeclaration;
  3268. (** designators (expressions) *)
  3269. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3270. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3271. BEGIN
  3272. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3273. IF x.left # NIL THEN Expression(x.left) END;
  3274. Symbol(x.symbol,result);
  3275. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3276. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3277. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3278. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3279. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3280. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3281. END;
  3282. END;
  3283. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3284. END VisitSymbolDesignator;
  3285. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3286. BEGIN
  3287. IF isUnchecked THEN RETURN END;
  3288. IF tagsAvailable THEN
  3289. TrapC(BrltL,index,length,IndexCheckTrap);
  3290. END;
  3291. END BoundCheck;
  3292. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3293. VAR d: IntermediateCode.Operand;
  3294. BEGIN
  3295. IF isUnchecked THEN RETURN END;
  3296. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3297. TrapC(op,dim,d,ArraySizeTrap);
  3298. ReleaseIntermediateOperand(d);
  3299. END DimensionCheck;
  3300. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3301. VAR
  3302. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3303. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3304. expression: SyntaxTree.Expression;
  3305. resultingType, leftType, baseType: SyntaxTree.Type;
  3306. skipLabel1: Label;
  3307. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3308. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3309. variableOp: Operand;
  3310. variable: SyntaxTree.Variable;
  3311. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3312. VAR expression: SyntaxTree.Expression;
  3313. BEGIN
  3314. (* count the number of indices, ranges and tensorRanges in the index list *)
  3315. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3316. FOR i := 0 TO parameters.Length() - 1 DO
  3317. expression := parameters.GetExpression(i);
  3318. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3319. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3320. ELSE INC(indexCount)
  3321. END
  3322. END;
  3323. END CountIndices;
  3324. BEGIN
  3325. ASSERT(tagsAvailable);
  3326. resultingType := x.type.resolved; (* resulting type *)
  3327. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3328. InitOperand(localResult, ModeReference);
  3329. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3330. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3331. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3332. (* a globally defined array destination tag is available -> use and invalidate it*)
  3333. localResult.tag := arrayDestinationTag;
  3334. IntermediateCode.InitOperand(arrayDestinationTag)
  3335. ELSE
  3336. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3337. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3338. Symbol(variable, variableOp);
  3339. ReuseCopy(localResult.tag, variableOp.op);
  3340. ReleaseOperand(variableOp);
  3341. END
  3342. END;
  3343. indexListSize := x.parameters.Length();
  3344. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3345. ASSERT(tensorRangeCount <= 1);
  3346. (* designate the array to be indexed over, perform tensor range check if known *)
  3347. Designate(x.left, array);
  3348. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3349. Dereference(array, leftType,FALSE);
  3350. IF tensorRangeCount=0 THEN
  3351. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3352. END
  3353. END;
  3354. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3355. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3356. srcDimOffset := -indexListSize;
  3357. destDimOffset := -rangeCount
  3358. ELSE
  3359. srcDimOffset := 0;
  3360. destDimOffset := 0
  3361. END;
  3362. indexDim := 0;
  3363. (* use address of source array as basis *)
  3364. (*
  3365. ReuseCopy(localResult.op, array.op);
  3366. *)
  3367. localResult.op := array.op;
  3368. UseIntermediateOperand(localResult.op);
  3369. (* go through the index list *)
  3370. FOR i := 0 TO indexListSize - 1 DO
  3371. expression := x.parameters.GetExpression(i);
  3372. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3373. (* nothing to do *)
  3374. ELSE
  3375. (* determine which dimension of source array is currently looked at *)
  3376. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3377. (* get the memory operand pointing to array descriptor dimension *)
  3378. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3379. (* make a reusable register from it *)
  3380. ReuseCopy(srcDim, tmp);
  3381. ReleaseIntermediateOperand(tmp);
  3382. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3383. ELSE
  3384. srcDim := IntermediateCode.Immediate(int32, i)
  3385. END;
  3386. (* get length and increment of source array for current dimension *)
  3387. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3388. Convert(sourceLength.op, sizeType);
  3389. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3390. Convert(sourceIncrement.op, sizeType);
  3391. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3392. ReleaseIntermediateOperand(srcDim);
  3393. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3394. (* SINGLE INDEX *)
  3395. Evaluate(expression, index);
  3396. ReleaseIntermediateOperand(index.tag);
  3397. index.tag := emptyOperand;
  3398. Convert(index.op, sizeType);
  3399. (* lower bound check *)
  3400. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3401. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3402. ELSIF isUnchecked THEN (* do nothing *)
  3403. ELSE
  3404. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3405. END;
  3406. (* upper bound check *)
  3407. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3408. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3409. ELSIF isUnchecked THEN (* do nothing *)
  3410. ELSE
  3411. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3412. END;
  3413. ReleaseOperand(sourceLength);
  3414. Convert(index.op, addressType);
  3415. summand := index.op;
  3416. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3417. (* RANGE OF INDICES *)
  3418. Evaluate(expression, range);
  3419. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3420. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3421. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3422. ReleaseOperand(range);
  3423. Convert(firstIndex, sizeType);
  3424. Convert(lastIndex, sizeType);
  3425. Convert(stepSize, sizeType);
  3426. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3427. if it is 'MAX(LONGINT)' *)
  3428. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3429. TransferToRegister(lastIndex, lastIndex);
  3430. skipLabel1 := NewLabel();
  3431. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3432. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3433. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3434. SetLabel(skipLabel1)
  3435. END;
  3436. (* check if step size is valid *)
  3437. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3438. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3439. ELSIF isUnchecked THEN (* do nothing *)
  3440. ELSE
  3441. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3442. END;
  3443. (* check lower bound check *)
  3444. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3445. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3446. ELSIF isUnchecked THEN (* do nothing *)
  3447. ELSE
  3448. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3449. END;
  3450. (* check upper bound check *)
  3451. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3452. (* statically open range: nothing to do *)
  3453. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3454. ASSERT(staticLastIndex < staticSourceLength)
  3455. ELSIF isUnchecked THEN (* do nothing *)
  3456. ELSE
  3457. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3458. END;
  3459. (* determine length of target array for current dimension *)
  3460. (* 1. incorporate last index: *)
  3461. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3462. (* last index is static *)
  3463. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3464. targetLength := sourceLength.op
  3465. ELSE
  3466. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3467. END;
  3468. UseIntermediateOperand(targetLength);
  3469. ELSE
  3470. (* targetLength := lastIndex + 1
  3471. Reuse1(targetLength, lastIndex);
  3472. *)
  3473. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3474. END;
  3475. ReleaseOperand(sourceLength);
  3476. ReleaseIntermediateOperand(lastIndex);
  3477. (* 2. incorporate first index: *)
  3478. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3479. (* first index and current target length are static *)
  3480. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3481. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3482. (* first index = 0: nothing to do *)
  3483. ELSE
  3484. (* targetLength := targetLength - firstIndex *)
  3485. TransferToRegister(targetLength, targetLength);
  3486. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3487. END;
  3488. (* clip negative lengths to 0 *)
  3489. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3490. IF staticTargetLength < 0 THEN
  3491. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3492. END
  3493. ELSE
  3494. skipLabel1 := NewLabel();
  3495. TransferToRegister(targetLength, targetLength);
  3496. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3497. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3498. SetLabel(skipLabel1)
  3499. END;
  3500. (* 3. incorporate index step size: *)
  3501. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3502. (*step size and current target length are static *)
  3503. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3504. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3505. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3506. (* step size = 1: nothing to do *)
  3507. ELSE
  3508. (* emit code for this:
  3509. targetLength := (targetLength-1) DIV stepSize +1;
  3510. *)
  3511. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3512. DivInt(targetLength, targetLength, stepSize);
  3513. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3514. END;
  3515. (* determine increment of target array for current dimension *)
  3516. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3517. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3518. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3519. (* step size = 1 *)
  3520. targetIncrement := sourceIncrement.op;
  3521. UseIntermediateOperand(targetIncrement)
  3522. ELSE
  3523. (* targetIncrement := sourceIncrement * stepSize *)
  3524. Reuse1(targetIncrement, stepSize);
  3525. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3526. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3527. END;
  3528. ReleaseIntermediateOperand(stepSize);
  3529. (* write length and increment of target array to descriptor *)
  3530. IF destDimOffset < 0 THEN
  3531. (* determine which dimension of target array is currently looked at *)
  3532. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3533. TransferToRegister(destDim, tmp);
  3534. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3535. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3536. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3537. ReleaseIntermediateOperand(destDim)
  3538. ELSE
  3539. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3540. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3541. END;
  3542. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3543. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3544. INC(indexDim);
  3545. Convert(firstIndex, addressType);
  3546. TransferToRegister(summand, firstIndex);
  3547. ELSE HALT(100);
  3548. END;
  3549. (*
  3550. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3551. *)
  3552. Convert(sourceIncrement.op, addressType);
  3553. Convert(summand, addressType);
  3554. MulInt(summand, summand, sourceIncrement.op);
  3555. ReleaseIntermediateOperand(sourceIncrement.op);
  3556. AddInt(localResult.op, localResult.op, summand);
  3557. ReleaseIntermediateOperand(summand);
  3558. END
  3559. END;
  3560. result := localResult;
  3561. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3562. ReleaseIntermediateOperand(result.tag);
  3563. result.tag := TypeDescriptorAdr(resultingType);
  3564. IF ~newObjectFile THEN
  3565. IntermediateCode.MakeMemory(result.tag,addressType);
  3566. END;
  3567. ELSIF IsDelegate(resultingType) THEN
  3568. ReleaseIntermediateOperand(result.tag);
  3569. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3570. UseIntermediateOperand(result.tag);
  3571. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3572. ReleaseIntermediateOperand(result.tag);
  3573. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3574. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3575. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3576. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3577. (* finalize target array descriptor *)
  3578. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3579. (* write lengths and increments of target array for remaining dimensions *)
  3580. i := indexListSize;
  3581. WHILE indexDim < targetArrayDimensionality DO
  3582. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3583. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3584. ReleaseOperand(sourceLength);
  3585. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3586. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3587. ReleaseOperand(sourceIncrement);
  3588. INC(i); INC(indexDim);
  3589. END;
  3590. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3591. tmp := nil;
  3592. ELSE
  3593. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3594. END;
  3595. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3596. ReleaseIntermediateOperand(tmp);
  3597. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3598. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3599. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3600. ELSE
  3601. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3602. END;
  3603. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3604. ReleaseIntermediateOperand(tmp);
  3605. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3606. (* write dimensionality *)
  3607. IF targetArrayDimensionality # 0 THEN
  3608. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3609. END;
  3610. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3611. END;
  3612. ReleaseOperand(array);
  3613. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3614. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3615. END;
  3616. END MathIndexDesignator;
  3617. (* TENTATIVE *)
  3618. PROCEDURE DumpOperand(operand: Operand);
  3619. BEGIN
  3620. D.Log.String(" op = ");
  3621. IntermediateCode.DumpOperand(D.Log, operand.op );
  3622. D.Log.Ln;
  3623. D.Log.String(" tag = ");
  3624. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3625. D.Log.Ln;
  3626. D.Log.String(" extra = ");
  3627. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3628. D.Log.Ln;
  3629. D.Log.Update
  3630. END DumpOperand;
  3631. (* get the length of an array , trying to make use of static information *)
  3632. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3633. VAR res: IntermediateCode.Operand; size: LONGINT;
  3634. BEGIN
  3635. type := type.resolved;
  3636. IF type IS SyntaxTree.ArrayType THEN
  3637. WITH type: SyntaxTree.ArrayType DO
  3638. IF type.form = SyntaxTree.Static THEN
  3639. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3640. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3641. Evaluate(type.length, op);
  3642. ReleaseIntermediateOperand(op.tag);
  3643. RETURN op.op;*)
  3644. ELSE
  3645. res := tag;
  3646. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3647. IntermediateCode.MakeMemory(res,addressType);
  3648. UseIntermediateOperand(res);
  3649. RETURN res
  3650. END
  3651. END;
  3652. ELSE
  3653. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3654. RETURN IntermediateCode.Immediate(addressType,size);
  3655. END;
  3656. END ArrayLength;
  3657. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3658. BEGIN
  3659. ReleaseIntermediateOperand(res);
  3660. IF IsImmediate(x) & IsImmediate(y) THEN
  3661. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3662. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3663. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3664. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3665. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3666. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3667. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3668. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3669. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3670. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3671. UseIntermediateOperand(res);
  3672. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3673. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3674. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3675. UseIntermediateOperand(res);
  3676. ELSE
  3677. IF ~ReusableRegister(res) THEN
  3678. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3679. ELSE
  3680. UseIntermediateOperand(res);
  3681. END;
  3682. IF IsImmediate(x) & (x.intValue = 0) THEN
  3683. Emit(Mov(position,res,y))
  3684. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3685. Emit(Mov(position,res,x))
  3686. ELSE
  3687. Emit(Add(position,res, x, y));
  3688. END;
  3689. END;
  3690. END AddInt;
  3691. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3692. BEGIN
  3693. ReleaseIntermediateOperand(res);
  3694. IF IsImmediate(x) & IsImmediate(y) THEN
  3695. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3696. ELSE
  3697. IF ~ReusableRegister(res) THEN
  3698. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3699. ELSE UseIntermediateOperand(res);
  3700. END;
  3701. IF IsImmediate(x) & (x.intValue = 1) THEN
  3702. Emit(Mov(position,res,y))
  3703. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3704. Emit(Mov(position,res,x))
  3705. ELSE
  3706. Emit(Mul(position,res, x, y));
  3707. END;
  3708. END;
  3709. END MulInt;
  3710. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3711. BEGIN
  3712. ReleaseIntermediateOperand(res);
  3713. IF IsImmediate(x) & IsImmediate(y) THEN
  3714. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3715. ELSE
  3716. IF ~ReusableRegister(res) THEN
  3717. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3718. ELSE UseIntermediateOperand(res);
  3719. END;
  3720. IF IsImmediate(x) & (x.intValue = 1) THEN
  3721. Emit(Mov(position,res,y))
  3722. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3723. Emit(Mov(position,res,x))
  3724. ELSE
  3725. Emit(Div(position,res, x, y));
  3726. END;
  3727. END;
  3728. END DivInt;
  3729. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3730. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3731. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3732. BEGIN
  3733. type := x.left.type.resolved;
  3734. IF type IS SyntaxTree.StringType THEN
  3735. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3736. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3737. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3738. type := atype;
  3739. x.left.SetType(type);
  3740. END;
  3741. IntermediateCode.InitImmediate(res,addressType,0);
  3742. maxDim := x.parameters.Length()-1;
  3743. FOR i := 0 TO maxDim DO
  3744. e := x.parameters.GetExpression(i);
  3745. Evaluate(e,index);
  3746. Convert(index.op,addressType);
  3747. AddInt(res, res, index.op);
  3748. IF i = 0 THEN
  3749. (*
  3750. ReuseCopy(res, index.op);
  3751. *)
  3752. Designate(x.left,array);
  3753. type := x.left.type.resolved;
  3754. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3755. Dereference(array, type, FALSE);
  3756. END;
  3757. (*
  3758. ELSE AddInt(res, res, index.op);
  3759. *)
  3760. END;
  3761. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3762. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3763. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3764. BoundCheck(index.op, length);
  3765. END;
  3766. ReleaseIntermediateOperand(length);
  3767. END;
  3768. ReleaseOperand(index);
  3769. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3770. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3771. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3772. MulInt(res,res,length);
  3773. END;
  3774. ReleaseIntermediateOperand(length);
  3775. END;
  3776. IF (type IS SyntaxTree.ArrayType) THEN
  3777. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3778. size := StaticSize(system, type);
  3779. IF size # 1 THEN
  3780. length := IntermediateCode.Immediate(addressType,size);
  3781. MulInt(res,res,length);
  3782. END;
  3783. ELSE
  3784. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3785. IF size # 1 THEN
  3786. length := IntermediateCode.Immediate(addressType,size);
  3787. MulInt(res,res,length);
  3788. END;
  3789. END;
  3790. END;
  3791. AddInt(res,res,array.op);
  3792. InitOperand(result,ModeReference);
  3793. result.op := res;
  3794. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3795. ReleaseIntermediateOperand(result.tag);
  3796. result.tag := TypeDescriptorAdr(type);
  3797. IF ~newObjectFile THEN
  3798. IntermediateCode.MakeMemory(result.tag,addressType);
  3799. END
  3800. ELSIF IsDelegate(type) THEN
  3801. ReleaseIntermediateOperand(result.tag);
  3802. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3803. UseIntermediateOperand(result.tag);
  3804. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3805. ReleaseIntermediateOperand(result.tag);
  3806. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3807. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3808. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3809. END;
  3810. ReleaseOperand(array);
  3811. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3812. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3813. END;
  3814. END IndexDesignator;
  3815. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3816. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3817. BEGIN
  3818. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3819. dest := destination; destination := emptyOperand;
  3820. type := x.left.type.resolved;
  3821. IF type IS SyntaxTree.MathArrayType THEN
  3822. MathIndexDesignator(x);
  3823. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3824. IndexDesignator(x);
  3825. END;
  3826. destination := dest;
  3827. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3828. END VisitIndexDesignator;
  3829. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3830. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3831. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3832. procedure: SyntaxTree.Procedure;
  3833. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3834. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3835. BEGIN
  3836. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3837. parameters := expression.parameters;
  3838. moduleName := "FoxArrayBase";
  3839. procedureName := "CopyDescriptor";
  3840. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3841. SaveRegisters();ReleaseUsedRegisters(saved);
  3842. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3843. IF procedure = NIL THEN
  3844. s := "procedure ";
  3845. Strings.Append(s,moduleName);
  3846. Strings.Append(s,".");
  3847. Strings.Append(s,procedureName);
  3848. Strings.Append(s," not present");
  3849. Error(position,s);
  3850. ELSE
  3851. (* push address of temporary variable *)
  3852. Symbol(variable,destOperand);
  3853. Emit(Push(position,destOperand.op));
  3854. ReleaseOperand(destOperand);
  3855. (* push src *)
  3856. Evaluate(expression.left,srcOperand);
  3857. (*
  3858. Dereference(srcOperand,expression.type.resolved);
  3859. Emit(Push(position,srcOperand.tag));
  3860. *)
  3861. Emit(Push(position,srcOperand.op));
  3862. ReleaseOperand(srcOperand);
  3863. tensorFound := FALSE;
  3864. FOR i := 0 TO parameters.Length()-1 DO
  3865. e := parameters.GetExpression(i);
  3866. IF e IS SyntaxTree.TensorRangeExpression THEN
  3867. tensorFound := TRUE;
  3868. ELSIF e IS SyntaxTree.RangeExpression THEN
  3869. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3870. ELSE
  3871. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3872. END;
  3873. END;
  3874. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  3875. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  3876. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  3877. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  3878. StaticCallOperand(procOp,procedure);
  3879. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  3880. ReleaseOperand(procOp);
  3881. END;
  3882. RestoreRegisters(saved);
  3883. END;
  3884. RETURN variable
  3885. END PrepareTensorDescriptor;
  3886. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  3887. VAR
  3888. type, descriptorType, baseType: SyntaxTree.Type;
  3889. operand, tmpOperand, variableOp, variable2Op: Operand;
  3890. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  3891. variable, variable2: SyntaxTree.Variable;
  3892. dim, i, size: LONGINT;
  3893. (* TODO: needed? *)
  3894. oldArrayDestinationTag: IntermediateCode.Operand;
  3895. oldArrayDestinationDimension: LONGINT;
  3896. position: LONGINT;
  3897. saved: RegisterEntry;
  3898. arrayFlags: SET;
  3899. m, n: LONGINT;
  3900. PROCEDURE Pass(op: IntermediateCode.Operand);
  3901. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  3902. BEGIN
  3903. IF numberRegister >= 0 THEN
  3904. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  3905. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  3906. Emit(Mov(position,parameterRegister, op));
  3907. ELSE
  3908. Emit(Push(position,op))
  3909. END
  3910. END Pass;
  3911. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  3912. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  3913. BEGIN
  3914. formalType := formalType.resolved; actualType := actualType.resolved;
  3915. IF IsOpenArray(formalType)THEN
  3916. IF actualType IS SyntaxTree.StringType THEN
  3917. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  3918. RETURN;
  3919. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  3920. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  3921. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  3922. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  3923. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  3924. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3925. ELSE
  3926. tmp := baseReg;
  3927. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  3928. IntermediateCode.MakeMemory(tmp,addressType);
  3929. Pass((tmp));
  3930. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3931. END;
  3932. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  3933. END;
  3934. END PushArrayLens;
  3935. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  3936. BEGIN
  3937. CASE size OF
  3938. |2: INCL(flags,Size2Flag);
  3939. |3: INCL(flags,Size3Flag);
  3940. |4: INCL(flags,Size4Flag);
  3941. |5: INCL(flags,Size5Flag);
  3942. |6: INCL(flags,Size6Flag);
  3943. |7: INCL(flags,Size7Flag);
  3944. |8: INCL(flags,Size8Flag);
  3945. END;
  3946. END SetSmallArraySizeFlag;
  3947. BEGIN
  3948. IF Trace THEN TraceEnter("PushParameter") END;
  3949. position := expression.position;
  3950. IF expression.resolved # NIL THEN expression := expression.resolved END;
  3951. type := expression.type.resolved;
  3952. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  3953. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  3954. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  3955. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  3956. );
  3957. (* TODO: needed? *)
  3958. oldArrayDestinationTag := arrayDestinationTag;
  3959. oldArrayDestinationDimension := arrayDestinationDimension;
  3960. IF IsArrayOfSystemByte(parameter.type) THEN
  3961. Designate(expression,operand);
  3962. tmp := GetArrayOfBytesSize(expression,operand.tag);
  3963. ReleaseIntermediateOperand(operand.tag);
  3964. operand.tag := tmp;
  3965. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3966. Pass((operand.tag));
  3967. END;
  3968. Pass((operand.op));
  3969. ELSIF IsOpenArray(parameter.type) THEN
  3970. Designate(expression,operand);
  3971. baseReg := operand.tag;
  3972. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3973. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  3974. END;
  3975. Pass((operand.op)); (* address of the array *)
  3976. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  3977. (* case 1 *)
  3978. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  3979. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  3980. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3981. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  3982. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  3983. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3984. arrayDestinationTag := sp;
  3985. (* case 1b *)
  3986. IF expression IS SyntaxTree.IndexDesignator THEN
  3987. (*
  3988. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3989. descriptorType := GetMathArrayDescriptorType(dim);
  3990. variable := GetTemporaryVariable(descriptorType,expression.position);
  3991. Symbol(variable,variableOp);
  3992. arrayDestinationTag := variableOp.op;
  3993. *)
  3994. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  3995. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3996. arrayDestinationDimension := dim;
  3997. Designate(expression,operand);
  3998. (* case 1a *)
  3999. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4000. Designate(expression,operand);
  4001. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4002. i := 0;
  4003. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4004. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4005. INC(i);
  4006. END;
  4007. type := expression.type.resolved;
  4008. WHILE (i<dim) DO (* remaining static dimensions *)
  4009. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4010. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4011. ReleaseOperand(tmpOperand);
  4012. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4013. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4014. ReleaseOperand(tmpOperand);
  4015. INC(i);
  4016. END;
  4017. dimOp := IntermediateCode.Immediate(addressType,dim);
  4018. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4019. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4020. (* case 1d *)
  4021. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4022. Designate(expression,operand);
  4023. Dereference(operand,type.resolved,FALSE);
  4024. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4025. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4026. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4027. (* case 1f *)
  4028. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4029. Designate(expression,operand);
  4030. FOR i := 0 TO dim-1 DO
  4031. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4032. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4033. ReleaseOperand(tmpOperand);
  4034. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4035. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4036. ReleaseOperand(tmpOperand);
  4037. END;
  4038. (*******
  4039. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4040. *)
  4041. arrayFlags := {StaticFlag};
  4042. IF dim = 1 THEN
  4043. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4044. ReleaseOperand(tmpOperand);
  4045. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4046. m := LONGINT(tmpOperand.op.intValue);
  4047. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4048. ELSIF dim = 2 THEN
  4049. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4050. ReleaseOperand(tmpOperand);
  4051. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4052. m := LONGINT(tmpOperand.op.intValue);
  4053. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4054. ReleaseOperand(tmpOperand);
  4055. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4056. n := LONGINT(tmpOperand.op.intValue);
  4057. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4058. INCL(arrayFlags,SmallMatrixFlag);
  4059. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4060. END;
  4061. END;
  4062. (*******)
  4063. dimOp := IntermediateCode.Immediate(addressType,dim);
  4064. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4065. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4066. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4067. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4068. baseType := SemanticChecker.ArrayBase(type,dim);
  4069. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4070. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4071. ELSE HALT(100);
  4072. END;
  4073. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4074. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4075. (* case 2b *)
  4076. IF expression IS SyntaxTree.IndexDesignator THEN
  4077. descriptorType := GetMathArrayDescriptorType(dim);
  4078. variable := GetTemporaryVariable(descriptorType, FALSE);
  4079. Symbol(variable,variableOp);
  4080. arrayDestinationTag := variableOp.op;
  4081. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4082. arrayDestinationDimension := dim;
  4083. NeedDescriptor := TRUE;
  4084. Designate(expression,operand);
  4085. Pass((operand.tag));
  4086. NeedDescriptor := FALSE;
  4087. (* case 2a *)
  4088. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4089. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4090. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4091. INC(i);
  4092. END;
  4093. IF i = dim THEN
  4094. Designate(expression,operand);
  4095. Pass((operand.tag));
  4096. ELSE (* open-static *)
  4097. type := expression.type.resolved;
  4098. descriptorType := GetMathArrayDescriptorType(dim);
  4099. variable := GetTemporaryVariable(descriptorType, FALSE);
  4100. Symbol(variable,variableOp);
  4101. arrayDestinationTag := variableOp.op;
  4102. Designate(expression,operand);
  4103. FOR i := 0 TO dim-1 DO
  4104. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4105. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4106. ReleaseOperand(tmpOperand);
  4107. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4108. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4109. ReleaseOperand(tmpOperand);
  4110. END;
  4111. dimOp := IntermediateCode.Immediate(addressType,dim);
  4112. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4113. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4114. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4115. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4116. baseType := SemanticChecker.ArrayBase(type,dim);
  4117. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4118. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4119. Pass((arrayDestinationTag));
  4120. END;
  4121. (* case 2d *)
  4122. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4123. Designate(expression,operand);
  4124. Dereference(operand,type.resolved,FALSE);
  4125. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4126. Pass((operand.tag));
  4127. (* case 2f *)
  4128. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4129. descriptorType := GetMathArrayDescriptorType(dim);
  4130. variable := GetTemporaryVariable(descriptorType, FALSE);
  4131. Symbol(variable,variableOp);
  4132. arrayDestinationTag := variableOp.op;
  4133. Designate(expression,operand);
  4134. FOR i := 0 TO dim-1 DO
  4135. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4136. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4137. ReleaseOperand(tmpOperand);
  4138. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4139. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4140. ReleaseOperand(tmpOperand);
  4141. END;
  4142. (*
  4143. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4144. *)
  4145. arrayFlags := {StaticFlag};
  4146. IF dim = 1 THEN
  4147. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4148. ReleaseOperand(tmpOperand);
  4149. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4150. m := LONGINT(tmpOperand.op.intValue);
  4151. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4152. ELSIF dim = 2 THEN
  4153. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4154. ReleaseOperand(tmpOperand);
  4155. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4156. m := LONGINT(tmpOperand.op.intValue);
  4157. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4158. ReleaseOperand(tmpOperand);
  4159. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4160. n := LONGINT(tmpOperand.op.intValue);
  4161. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4162. INCL(arrayFlags,SmallMatrixFlag);
  4163. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4164. END;
  4165. END;
  4166. (*******)
  4167. dimOp := IntermediateCode.Immediate(addressType,dim);
  4168. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4169. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4170. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4171. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4172. baseType := SemanticChecker.ArrayBase(type,dim);
  4173. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4174. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4175. Pass((arrayDestinationTag));
  4176. ELSE HALT(100);
  4177. END;
  4178. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4179. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4180. (* case 3b *)
  4181. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4182. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4183. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4184. Symbol(variable,variableOp);
  4185. LoadValue(variableOp,system.addressType);
  4186. ELSE
  4187. descriptorType := GetMathArrayDescriptorType(dim);
  4188. variable := GetTemporaryVariable(descriptorType, FALSE);
  4189. Symbol(variable,variableOp);
  4190. END;
  4191. arrayDestinationTag := variableOp.op;
  4192. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4193. arrayDestinationDimension := 0;
  4194. Designate(expression,operand);
  4195. Pass((operand.tag));
  4196. (* case 3a *)
  4197. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4198. i := 0;
  4199. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4200. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4201. INC(i);
  4202. END;
  4203. IF i = dim THEN
  4204. Designate(expression,operand);
  4205. Pass((operand.tag));
  4206. ELSE (* open-static *)
  4207. type := expression.type.resolved;
  4208. descriptorType := GetMathArrayDescriptorType(dim);
  4209. variable := GetTemporaryVariable(descriptorType, FALSE);
  4210. Symbol(variable,variableOp);
  4211. arrayDestinationTag := variableOp.op;
  4212. Designate(expression,operand);
  4213. FOR i := 0 TO dim-1 DO
  4214. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4215. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4216. ReleaseOperand(tmpOperand);
  4217. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4218. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4219. ReleaseOperand(tmpOperand);
  4220. END;
  4221. dimOp := IntermediateCode.Immediate(addressType,dim);
  4222. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4223. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4224. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4225. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4226. baseType := SemanticChecker.ArrayBase(type,dim);
  4227. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4228. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4229. Pass((arrayDestinationTag));
  4230. END;
  4231. (* case 3d *)
  4232. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4233. Designate(expression,operand);
  4234. Dereference(operand,type.resolved,FALSE);
  4235. (*
  4236. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4237. *)
  4238. Pass((operand.tag));
  4239. (* case 3f *)
  4240. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4241. descriptorType := GetMathArrayDescriptorType(dim);
  4242. variable := GetTemporaryVariable(descriptorType, FALSE);
  4243. Symbol(variable,variableOp);
  4244. arrayDestinationTag := variableOp.op;
  4245. Designate(expression,operand);
  4246. IF operand.op.type.length >1 THEN (* vector register *)
  4247. variable2 := GetTemporaryVariable(type, FALSE);
  4248. Symbol(variable2, variable2Op);
  4249. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4250. Emit(Mov(position,tmp, operand.op));
  4251. ReleaseOperand(operand);
  4252. Symbol(variable2, operand);
  4253. END;
  4254. FOR i := 0 TO dim-1 DO
  4255. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4256. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4257. ReleaseOperand(tmpOperand);
  4258. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4259. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4260. ReleaseOperand(tmpOperand);
  4261. END;
  4262. dimOp := IntermediateCode.Immediate(addressType,dim);
  4263. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4264. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4265. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4266. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4267. baseType := SemanticChecker.ArrayBase(type,dim);
  4268. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4269. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4270. Pass((arrayDestinationTag));
  4271. ELSE HALT(100);
  4272. END;
  4273. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4274. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4275. (* case 4b *)
  4276. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4277. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4278. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4279. Symbol(variable,variableOp);
  4280. LoadValue(variableOp,system.addressType);
  4281. ELSE
  4282. descriptorType := GetMathArrayDescriptorType(dim);
  4283. variable := GetTemporaryVariable(descriptorType, FALSE);
  4284. Symbol(variable,variableOp);
  4285. END;
  4286. arrayDestinationTag := variableOp.op;
  4287. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4288. arrayDestinationDimension := 0;
  4289. Designate(expression,operand);
  4290. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4291. Symbol(variable,variableOp);
  4292. ELSE
  4293. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4294. Symbol(variable,variableOp);
  4295. MakeMemory(tmp,variableOp.op,addressType,0);
  4296. Emit(Mov(position,tmp,operand.tag));
  4297. ReleaseIntermediateOperand(tmp);
  4298. END;
  4299. Pass((variableOp.op));
  4300. ReleaseOperand(variableOp);
  4301. (* case 4a *)
  4302. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4303. i := 0;
  4304. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4305. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4306. INC(i);
  4307. END;
  4308. IF i = dim THEN
  4309. Designate(expression,operand);
  4310. arrayDestinationTag := operand.tag;
  4311. ELSE (* open-static *)
  4312. type := expression.type.resolved;
  4313. descriptorType := GetMathArrayDescriptorType(dim);
  4314. variable := GetTemporaryVariable(descriptorType, FALSE);
  4315. Symbol(variable,variableOp);
  4316. arrayDestinationTag := variableOp.op;
  4317. Designate(expression,operand);
  4318. FOR i := 0 TO dim-1 DO
  4319. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4320. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4321. ReleaseOperand(tmpOperand);
  4322. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4323. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4324. ReleaseOperand(tmpOperand);
  4325. END;
  4326. dimOp := IntermediateCode.Immediate(addressType,dim);
  4327. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4328. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4329. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4330. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4331. baseType := SemanticChecker.ArrayBase(type,dim);
  4332. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4333. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4334. END;
  4335. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4336. Symbol(variable,variableOp);
  4337. MakeMemory(tmp,variableOp.op,addressType,0);
  4338. Emit(Mov(position,tmp,arrayDestinationTag));
  4339. ReleaseIntermediateOperand(tmp);
  4340. Pass((variableOp.op));
  4341. ReleaseOperand(variableOp);
  4342. (* case 4d *)
  4343. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4344. Designate(expression,operand);
  4345. (*
  4346. Dereference(operand,type.resolved,FALSE);
  4347. *)
  4348. (*
  4349. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4350. *)
  4351. Pass((operand.op));
  4352. (* case 4f *)
  4353. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4354. descriptorType := GetMathArrayDescriptorType(dim);
  4355. variable := GetTemporaryVariable(descriptorType, FALSE);
  4356. Symbol(variable,variableOp);
  4357. arrayDestinationTag := variableOp.op;
  4358. Designate(expression,operand);
  4359. FOR i := 0 TO dim-1 DO
  4360. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4361. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4362. ReleaseOperand(tmpOperand);
  4363. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4364. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4365. ReleaseOperand(tmpOperand);
  4366. END;
  4367. dimOp := IntermediateCode.Immediate(addressType,dim);
  4368. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4369. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4370. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4371. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4372. baseType := SemanticChecker.ArrayBase(type,dim);
  4373. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4374. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4375. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4376. Symbol(variable,variableOp);
  4377. MakeMemory(tmp,variableOp.op,addressType,0);
  4378. Emit(Mov(position,tmp,arrayDestinationTag));
  4379. ReleaseIntermediateOperand(tmp);
  4380. Pass((variableOp.op));
  4381. ReleaseOperand(variableOp);
  4382. ELSE HALT(100);
  4383. END;
  4384. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4385. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4386. Designate(expression,operand);
  4387. IF operand.op.type.length > 1 THEN
  4388. Emit(Push(position, operand.op));
  4389. ReleaseOperand(operand);
  4390. ELSE
  4391. size := system.SizeOf(type);
  4392. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4393. size := ToMemoryUnits(system,size);
  4394. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4395. arrayDestinationTag := sp;
  4396. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4397. END;
  4398. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4399. Designate(expression,operand);
  4400. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4401. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4402. Symbol(variable,variableOp);
  4403. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4404. Emit(Mov(position,tmp,operand.op));
  4405. Emit(Push(position,variableOp.op));
  4406. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4407. Pass((operand.op));
  4408. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4409. END;
  4410. ELSE HALT(200)
  4411. END;
  4412. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4413. IF parameter.kind = SyntaxTree.VarParameter THEN
  4414. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4415. Designate(expression, operand);
  4416. Pass((operand.op));
  4417. ELSE
  4418. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4419. Evaluate(expression, operand);
  4420. Pass((operand.extra)); (* step *)
  4421. Pass((operand.tag)); (* last *)
  4422. Pass((operand.op)) (* first *)
  4423. END
  4424. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4425. IF parameter.kind = SyntaxTree.VarParameter THEN
  4426. Designate(expression, operand);
  4427. Pass((operand.op));
  4428. ELSE
  4429. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4430. Evaluate(expression, operand);
  4431. Pass((operand.tag)); (* real part *)
  4432. Pass((operand.op)) (* imaginary part *)
  4433. END
  4434. ELSE
  4435. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4436. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4437. Designate(expression,operand);
  4438. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4439. (* stack allocation *)
  4440. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4441. (*! parameter alignment to be discussed ... *)
  4442. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4443. size := type(SyntaxTree.StringType).length;
  4444. END;
  4445. IF backend.cooperative & parameter.NeedsTrace() THEN
  4446. dst := NewRegisterOperand (addressType);
  4447. Emit(Mov(position,dst, sp));
  4448. IntermediateCode.InitImmediate(null, byteType, 0);
  4449. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4450. ReleaseIntermediateOperand(dst);
  4451. SaveRegisters();ReleaseUsedRegisters(saved);
  4452. (* register dst has been freed before SaveRegisters already *)
  4453. CallAssignMethod(dst, operand.op, parameter.type);
  4454. RestoreRegisters(saved);
  4455. END;
  4456. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4457. ELSIF IsOpenArray(parameter.type) THEN
  4458. Designate(expression,operand);
  4459. baseReg := operand.tag;
  4460. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4461. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4462. END;
  4463. Pass((operand.op)); (* address of the array *)
  4464. ELSIF IsDelegate(parameter.type) THEN
  4465. Evaluate(expression,operand);
  4466. IF backend.cooperative & parameter.NeedsTrace() THEN
  4467. Emit(Push(position, nil));
  4468. dst := NewRegisterOperand (addressType);
  4469. Emit(Mov(position,dst, sp));
  4470. ReleaseIntermediateOperand(dst);
  4471. SaveRegisters();ReleaseUsedRegisters(saved);
  4472. Emit(Push(position, dst));
  4473. (* register dst has been freed before SaveRegisters already *)
  4474. Emit(Push(position, operand.tag));
  4475. CallThis(position,"GarbageCollector","Assign",2);
  4476. RestoreRegisters(saved);
  4477. ELSE
  4478. Pass((operand.tag));
  4479. END;
  4480. Pass((operand.op));
  4481. ELSE
  4482. Evaluate(expression,operand);
  4483. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4484. Emit(Push(position, nil));
  4485. dst := NewRegisterOperand (addressType);
  4486. Emit(Mov(position,dst, sp));
  4487. ReleaseIntermediateOperand(dst);
  4488. SaveRegisters();ReleaseUsedRegisters(saved);
  4489. Emit(Push(position, dst));
  4490. (* register dst has been freed before SaveRegisters already *)
  4491. Emit(Push(position, operand.op));
  4492. CallThis(position,"GarbageCollector","Assign",2);
  4493. RestoreRegisters(saved);
  4494. ELSE
  4495. Pass((operand.op));
  4496. END;
  4497. END;
  4498. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4499. Evaluate(expression,operand);
  4500. Pass((operand.op));
  4501. ELSE (* var parameter *)
  4502. Designate(expression,operand);
  4503. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4504. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4505. Pass((operand.tag));
  4506. END;
  4507. END;
  4508. Pass((operand.op));
  4509. END;
  4510. END;
  4511. (* TODO: needed? *)
  4512. arrayDestinationTag := oldArrayDestinationTag;
  4513. arrayDestinationDimension := oldArrayDestinationDimension;
  4514. IF needsParameterBackup THEN
  4515. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4516. ReuseCopy(parameterBackup, operand.op)
  4517. END;
  4518. ReleaseOperand(operand);
  4519. IF Trace THEN TraceExit("PushParameter") END;
  4520. END PushParameter;
  4521. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4522. VAR prevConditional: BOOLEAN;
  4523. BEGIN
  4524. prevConditional := conditional;
  4525. conditional := FALSE;
  4526. 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
  4527. Expression(x.result); (* use register *)
  4528. END;
  4529. Statement(x.statement);
  4530. conditional := prevConditional;
  4531. IF x.result # NIL THEN Expression(x.result) END;
  4532. 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
  4533. ReleaseIntermediateOperand(result.op);
  4534. END;
  4535. END VisitStatementDesignator;
  4536. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4537. VAR
  4538. procedure: SyntaxTree.Procedure;
  4539. procedureType: SyntaxTree.ProcedureType;
  4540. wasInline: BOOLEAN;
  4541. actualParameters: SyntaxTree.ExpressionList;
  4542. formalParameter: SyntaxTree.Parameter;
  4543. actualParameter: SyntaxTree.Expression;
  4544. i: LONGINT;
  4545. localVariable: SyntaxTree.Variable;
  4546. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4547. src, dest: Operand;
  4548. prevInlineExit : Label;
  4549. prevMapper: SymbolMapper;
  4550. tooComplex: BOOLEAN;
  4551. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4552. BEGIN
  4553. IF e = NIL THEN RETURN TRUE
  4554. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4555. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4556. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4557. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4558. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4559. ELSE RETURN FALSE
  4560. END;
  4561. END SimpleExpression;
  4562. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4563. BEGIN
  4564. RETURN checker.CanPassInRegister(type)
  4565. END FitsInRegister;
  4566. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4567. VAR
  4568. variable: SyntaxTree.Variable;
  4569. variableDesignator: SyntaxTree.Designator;
  4570. BEGIN
  4571. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4572. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4573. variableDesignator.SetType(type);
  4574. RETURN variableDesignator
  4575. END GetTemp;
  4576. BEGIN
  4577. wasInline := currentIsInline;
  4578. prevInlineExit := currentInlineExit;
  4579. prevMapper := currentMapper;
  4580. currentInlineExit := NewLabel();
  4581. tooComplex := FALSE;
  4582. NEW(currentMapper);
  4583. currentIsInline := TRUE;
  4584. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4585. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4586. formalParameter := procedureType.firstParameter;
  4587. actualParameters := x.parameters;
  4588. i := 0;
  4589. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4590. actualParameter := actualParameters.GetExpression(i);
  4591. IF actualParameter.resolved # NIL THEN
  4592. actualParameter := actualParameter.resolved
  4593. END;
  4594. (*
  4595. if expression is simple and can be passed immediately
  4596. or if type fits in register then we can proceed
  4597. otherwise we escape to ordinary procedure call.
  4598. *)
  4599. (* cases where the expression can be mapped identically *)
  4600. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4601. currentMapper.Add(formalParameter, actualParameter, NIL);
  4602. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4603. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4604. (*
  4605. Assign(variableDesignator, actualParameter);
  4606. *)
  4607. Evaluate(actualParameter, src);
  4608. Designate(variableDesignator, dest);
  4609. Emit(Mov(x.position, dest.op, src.op));
  4610. ReleaseOperand(dest);
  4611. ReleaseOperand(src);
  4612. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4613. ELSE tooComplex := TRUE
  4614. END;
  4615. (*
  4616. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4617. currentMapper.Add(formalParameter, actualParameter, NIL);
  4618. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4619. variableDesignator := GetTemp(system.addressType, FALSE);
  4620. Designate(actualParameter, src);
  4621. Designate(variableDesignator, dest);
  4622. IntermediateCode.MakeMemory(dest.op,addressType);
  4623. Emit(Mov(x.position, dest.op, src.op));
  4624. ReleaseOperand(dest);
  4625. IF src.tag.mode # IntermediateCode.Undefined THEN
  4626. tagDesignator := GetTemp(system.addressType, FALSE);
  4627. Designate(tagDesignator, dest);
  4628. IntermediateCode.MakeMemory(dest.op,addressType);
  4629. Emit(Mov(x.position, dest.op, src.op));
  4630. END;
  4631. ReleaseOperand(dest); ReleaseOperand(src);
  4632. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4633. END;
  4634. *)
  4635. formalParameter := formalParameter.nextParameter;
  4636. INC(i);
  4637. END;
  4638. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4639. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4640. currentMapper.Add(NIL, returnDesignator, NIL);
  4641. END;
  4642. localVariable := procedure.procedureScope.firstVariable;
  4643. WHILE ~tooComplex & (localVariable # NIL) DO
  4644. variableDesignator := GetTemp(localVariable.type, FALSE);
  4645. currentMapper.Add(localVariable, variableDesignator, NIL);
  4646. localVariable := localVariable.nextVariable;
  4647. END;
  4648. IF ~tooComplex THEN
  4649. VisitStatementBlock(procedure.procedureScope.body);
  4650. SetLabel(currentInlineExit);
  4651. IF procedureType.returnType # NIL THEN
  4652. Designate(returnDesignator, result);
  4653. IF conditional THEN
  4654. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4655. ValueToCondition(result)
  4656. END;
  4657. END;
  4658. END;
  4659. currentMapper := prevMapper;
  4660. currentInlineExit := prevInlineExit;
  4661. currentIsInline := wasInline;
  4662. RETURN ~tooComplex
  4663. END InlineProcedureCall;
  4664. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4665. VAR
  4666. parameters: SyntaxTree.ExpressionList;
  4667. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4668. designator: SyntaxTree.Designator;
  4669. procedureType: SyntaxTree.ProcedureType;
  4670. formalParameter: SyntaxTree.Parameter;
  4671. operand, returnValue: Operand;
  4672. reg, size, mask, dest: IntermediateCode.Operand;
  4673. saved: RegisterEntry;
  4674. symbol: SyntaxTree.Symbol;
  4675. variable: SyntaxTree.Variable;
  4676. i, parametersSize, returnTypeSize : LONGINT;
  4677. structuredReturnType: BOOLEAN;
  4678. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4679. tempVariableDesignator: SyntaxTree.Designator;
  4680. gap, alignment: LONGINT; (*fld*)
  4681. (* TODO: remove unnecessary backup variables *)
  4682. oldResult: Operand;
  4683. oldCurrentScope: SyntaxTree.Scope;
  4684. oldArrayDestinationTag: IntermediateCode.Operand;
  4685. oldArrayDestinationDimension: LONGINT;
  4686. oldConstantDeclaration: SyntaxTree.Symbol;
  4687. oldDestination: IntermediateCode.Operand;
  4688. oldCurrentLoop: Label;
  4689. oldConditional: BOOLEAN;
  4690. oldTrueLabel, oldFalseLabel: Label;
  4691. oldLocked: BOOLEAN;
  4692. usedRegisters,oldUsedRegisters: RegisterEntry;
  4693. return: IntermediateCode.Operand;
  4694. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4695. arg: IntermediateCode.Operand;
  4696. dummy: IntermediateCode.Operand;
  4697. recordType: SyntaxTree.RecordType;
  4698. operatorSelectionProcedureOperand: Operand;
  4699. operatorSelectionProcedure: SyntaxTree.Procedure;
  4700. fingerPrint: SyntaxTree.FingerPrint;
  4701. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4702. identifierNumber: LONGINT;
  4703. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4704. procedure: SyntaxTree.Procedure;
  4705. PROCEDURE BackupGlobalState;
  4706. BEGIN
  4707. oldResult := result;
  4708. oldCurrentScope := currentScope;
  4709. oldArrayDestinationTag := arrayDestinationTag;
  4710. oldArrayDestinationDimension := arrayDestinationDimension;
  4711. oldConstantDeclaration := constantDeclaration;
  4712. oldDestination := destination;
  4713. oldCurrentLoop := currentLoop;
  4714. oldConditional := conditional;
  4715. oldTrueLabel := trueLabel;
  4716. oldFalseLabel := falseLabel;
  4717. oldLocked := locked;
  4718. oldUsedRegisters := usedRegisters
  4719. END BackupGlobalState;
  4720. PROCEDURE RestoreGlobalState;
  4721. BEGIN
  4722. result := oldResult;
  4723. currentScope := oldCurrentScope;
  4724. arrayDestinationTag := oldArrayDestinationTag;
  4725. arrayDestinationDimension := oldArrayDestinationDimension;
  4726. constantDeclaration := oldConstantDeclaration;
  4727. destination := oldDestination;
  4728. currentLoop := oldCurrentLoop;
  4729. conditional := oldConditional;
  4730. trueLabel := oldTrueLabel;
  4731. falseLabel := oldFalseLabel;
  4732. locked := oldLocked;
  4733. usedRegisters := oldUsedRegisters
  4734. END RestoreGlobalState;
  4735. (** do preparations before parameter push for array-structured object types (ASOTs):
  4736. if ASOT is passed as VAR parameter:
  4737. - allocate temporary variable of math array type
  4738. - copy contents of ASOT to be passed to temporary variable
  4739. - use temporary variable as the actual parameter instead
  4740. - 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)
  4741. **)
  4742. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4743. VAR
  4744. expression: SyntaxTree.Expression;
  4745. BEGIN
  4746. IF actualParameter IS SyntaxTree.Designator THEN
  4747. designator := actualParameter(SyntaxTree.Designator);
  4748. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4749. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4750. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4751. ASSERT(checker # NIL);
  4752. checker.SetCurrentScope(currentScope);
  4753. (* allocate temporary variable *)
  4754. ASSERT(actualParameter.type # NIL);
  4755. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4756. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4757. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4758. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4759. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4760. ASSERT(tempVariableDesignator.type # NIL);
  4761. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4762. (* copy math array stored in actual parameter to temporary variable *)
  4763. BackupGlobalState;
  4764. AssignMathArray(tempVariableDesignator, actualParameter);
  4765. RestoreGlobalState;
  4766. (* use temporary variable as actual parameter instead of the original one *)
  4767. actualParameter := tempVariableDesignator;
  4768. (* create write-back call and store it in linked list *)
  4769. (* create new list entry *)
  4770. IF firstWriteBackCall = NIL THEN
  4771. NEW(firstWriteBackCall);
  4772. currentWriteBackCall := firstWriteBackCall
  4773. ELSE
  4774. ASSERT(currentWriteBackCall # NIL);
  4775. NEW(currentWriteBackCall.next);
  4776. currentWriteBackCall := currentWriteBackCall.next
  4777. END;
  4778. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4779. ASSERT(expression.type = NIL);
  4780. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4781. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4782. (* prepare writeback for any other "normal" indexer *)
  4783. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4784. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4785. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4786. Assign(tempVariableDesignator, actualParameter);
  4787. actualParameter := tempVariableDesignator;
  4788. IF firstWriteBackCall = NIL THEN
  4789. NEW(firstWriteBackCall);
  4790. currentWriteBackCall := firstWriteBackCall
  4791. ELSE
  4792. ASSERT(currentWriteBackCall # NIL);
  4793. NEW(currentWriteBackCall.next);
  4794. currentWriteBackCall := currentWriteBackCall.next
  4795. END;
  4796. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4797. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4798. END
  4799. END
  4800. END PrepareParameter;
  4801. BEGIN
  4802. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4803. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4804. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4805. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4806. IF InlineProcedureCall(x) THEN
  4807. RETURN
  4808. ELSE
  4809. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4810. END
  4811. END;
  4812. END;
  4813. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4814. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4815. dest := destination; destination := emptyOperand;
  4816. SaveRegisters();ReleaseUsedRegisters(saved);
  4817. parameters := x.parameters;
  4818. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4819. (* an operator is called *)
  4820. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4821. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4822. (* check if a dynamic operator call should be performed *)
  4823. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4824. ELSE
  4825. isCallOfDynamicOperator := FALSE
  4826. END;
  4827. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4828. Emit(Push(position, ap));
  4829. END;
  4830. alignment := procedureType.stackAlignment;
  4831. IF alignment > 1 THEN
  4832. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4833. Emit(Mov(position,reg, sp));
  4834. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4835. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4836. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4837. Emit(And(position,sp, sp, mask));
  4838. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4839. Emit(Push(position,reg));
  4840. (*
  4841. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4842. Emit(Mov(position,mem,reg));
  4843. *)
  4844. ReleaseIntermediateOperand(reg);
  4845. END;
  4846. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4847. IntermediateCode.InitImmediate(mask,addressType,-16);
  4848. Emit(And(position,sp, sp, mask));
  4849. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4850. IF gap # 0 THEN
  4851. IntermediateCode.InitImmediate(size,addressType,gap);
  4852. Emit(Sub(position,sp,sp,size))
  4853. END;
  4854. END;
  4855. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4856. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4857. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4858. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4859. ELSE
  4860. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4861. END;
  4862. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4863. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  4864. (* push ID *)
  4865. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4866. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  4867. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  4868. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  4869. formalParameter := procedureType.firstParameter;
  4870. FOR i := 0 TO parameters.Length() - 1 DO
  4871. IF formalParameter.access # SyntaxTree.Hidden THEN
  4872. ASSERT(i < 2);
  4873. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  4874. (* push pointer *)
  4875. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4876. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  4877. (* add dereference *)
  4878. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4879. ReleaseIntermediateOperand(parameterBackups[i]);
  4880. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  4881. END;
  4882. Emit(Push(position,parameterBackups[i]));
  4883. ReleaseIntermediateOperand(parameterBackups[i]);
  4884. (* push typetag *)
  4885. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4886. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  4887. arg := TypeDescriptorAdr(recordType);
  4888. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  4889. Emit(Push(position,arg));
  4890. ELSE
  4891. (* push 'NonPointer' *)
  4892. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4893. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4894. (* push fingerprint *)
  4895. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4896. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  4897. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  4898. END
  4899. END;
  4900. formalParameter := formalParameter.nextParameter
  4901. END;
  4902. (* for unary operators: complete the information for the second parameter *)
  4903. IF procedureType.numberParameters < 2 THEN
  4904. (* push 'NonPointer' *)
  4905. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4906. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4907. (* push 'NoType' *)
  4908. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4909. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  4910. END;
  4911. (* call operator selection procedure *)
  4912. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  4913. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  4914. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  4915. ReleaseOperand(operatorSelectionProcedureOperand);
  4916. (* use the address that the operator selection procedure returned as the target address of the call *)
  4917. InitOperand(operand, ModeValue);
  4918. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4919. Emit(Result(position,operand.op))
  4920. END
  4921. ELSE
  4922. Evaluate(x.left, operand)
  4923. END;
  4924. IF symbol IS SyntaxTree.Procedure THEN
  4925. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4926. Emit(Push(position,operand.tag));
  4927. ELSIF (procedureType.isDelegate) THEN
  4928. Emit(Push(position,operand.tag));
  4929. END;
  4930. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4931. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  4932. Emit(Push(position,operand.tag));
  4933. END;
  4934. ELSE HALT(200);
  4935. END;
  4936. ReleaseIntermediateOperand(operand.tag);
  4937. operand.tag := emptyOperand;
  4938. (* determine if a structured return type is needed *)
  4939. structuredReturnType := StructuredReturnType(procedureType);
  4940. IF structuredReturnType THEN
  4941. IF resultDesignator # NIL THEN
  4942. d := resultDesignator;
  4943. ELSE
  4944. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  4945. variable.SetUntraced(procedureType.hasUntracedReturn);
  4946. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  4947. d.SetType(variable.type);
  4948. END;
  4949. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  4950. Designate(d,returnValue);
  4951. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  4952. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  4953. Emit(Push(position,size));
  4954. Emit(Push(position,returnValue.op));
  4955. ReleaseOperand(returnValue);
  4956. ELSE
  4957. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  4958. END;
  4959. END;
  4960. firstWriteBackCall := NIL; (* reset write-back call list *)
  4961. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  4962. passByRegister := system.registerParameters > 0;
  4963. registerNumber := 0;
  4964. formalParameter := procedureType.lastParameter;
  4965. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  4966. actualParameter := parameters.GetExpression(i);
  4967. PrepareParameter(actualParameter, formalParameter);
  4968. IF passByRegister & (i < system.registerParameters) THEN
  4969. IF ~PassInRegister(formalParameter) THEN
  4970. Error(actualParameter.position,"cannot be passed by register")
  4971. ELSE
  4972. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  4973. END;
  4974. INC(registerNumber);
  4975. ELSE
  4976. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4977. END;
  4978. formalParameter := formalParameter.prevParameter;
  4979. END;
  4980. IF passByRegister & (registerNumber > 0) THEN
  4981. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  4982. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4983. END;
  4984. ELSE
  4985. hasDynamicOperands := FALSE;
  4986. formalParameter := procedureType.firstParameter;
  4987. FOR i := 0 TO parameters.Length() - 1 DO
  4988. actualParameter := parameters.GetExpression(i);
  4989. IF formalParameter # NIL THEN (* TENTATIVE *)
  4990. PrepareParameter(actualParameter, formalParameter);
  4991. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  4992. ASSERT(i < 2);
  4993. hasDynamicOperands := TRUE;
  4994. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  4995. ELSE
  4996. IF passByRegister & (registerNumber > 0) THEN
  4997. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  4998. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4999. END;
  5000. passByRegister := FALSE;
  5001. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5002. END;
  5003. formalParameter := formalParameter.nextParameter;
  5004. END;
  5005. END;
  5006. END;
  5007. IF symbol IS SyntaxTree.Procedure THEN
  5008. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5009. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5010. Emit(Push(position,reg));
  5011. ReleaseIntermediateOperand(reg);
  5012. END;
  5013. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5014. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5015. parametersSize := ParametersSize(system,procedureType,FALSE);
  5016. END;
  5017. ReleaseParameterRegisters();
  5018. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  5019. Emit(Call(position,operand.op,0));
  5020. ELSE
  5021. Emit(Call(position,operand.op,parametersSize));
  5022. END;
  5023. ReleaseOperand(operand);
  5024. IF procedureType.noReturn THEN
  5025. EmitTrap(position,NoReturnTrap);
  5026. END;
  5027. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5028. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5029. Emit(Result(position,return));
  5030. END;
  5031. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  5032. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  5033. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5034. END;
  5035. size := IntermediateCode.Immediate(addressType,parametersSize);
  5036. Emit(Add(position,sp,sp,size));
  5037. END;
  5038. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5039. IF structuredReturnType THEN
  5040. (* stack pointer rewinding done by callee
  5041. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5042. Emit(Add(position,sp,sp,size));
  5043. *)
  5044. RestoreRegisters(saved);
  5045. InitOperand(result,ModeReference);
  5046. Symbol(variable,result);
  5047. ELSE
  5048. RestoreRegisters(saved);
  5049. InitOperand(result,ModeValue);
  5050. result.op := return;
  5051. END;
  5052. END;
  5053. IF alignment > 1 THEN
  5054. Emit(Pop(position,sp));
  5055. END;
  5056. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5057. Emit(Pop(position, ap));
  5058. END;
  5059. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5060. ValueToCondition(result);
  5061. END;
  5062. destination := dest;
  5063. (* perform all write-back calls in the list *)
  5064. BackupGlobalState;
  5065. currentWriteBackCall := firstWriteBackCall;
  5066. WHILE currentWriteBackCall # NIL DO
  5067. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5068. currentWriteBackCall := currentWriteBackCall.next
  5069. END;
  5070. RestoreGlobalState;
  5071. (* TENATIVE *)
  5072. (*
  5073. IF isOperatorCall THEN
  5074. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5075. END;
  5076. *)
  5077. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5078. END VisitProcedureCallDesignator;
  5079. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5080. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5081. td: SyntaxTree.Symbol;
  5082. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5083. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5084. BEGIN
  5085. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5086. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5087. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5088. variable.SetType(system.anyType);
  5089. scope.AddVariable(variable);
  5090. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5091. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5092. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5093. typeDeclaration.SetScope(module.module.moduleScope);
  5094. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5095. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5096. END;
  5097. RETURN hiddenPointerType;
  5098. END GetHiddenPointerType;
  5099. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5100. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5101. BEGIN
  5102. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5103. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5104. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5105. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5106. scope.AddVariable(variable);
  5107. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5108. variable.SetType(system.anyType);
  5109. scope.AddVariable(variable);
  5110. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5111. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5112. typeDeclaration.SetDeclaredType(delegatePointerType);
  5113. typeDeclaration.SetScope(module.module.moduleScope);
  5114. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5115. delegatePointerType.SetState(SyntaxTree.Resolved);
  5116. END;
  5117. RETURN delegatePointerType
  5118. END GetDelegateType;
  5119. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5120. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5121. such as in VAR a: RECORD ... END;
  5122. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5123. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5124. *)
  5125. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5126. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5127. BEGIN (* no code emission *)
  5128. source := NIL;
  5129. x := x.resolved;
  5130. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5131. x := GetHiddenPointerType();
  5132. ELSIF IsDelegate(x) THEN
  5133. x := GetDelegateType();
  5134. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5135. ELSE HALT(200);
  5136. END;
  5137. td := x.typeDeclaration;
  5138. IF td = NIL THEN
  5139. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5140. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5141. ASSERT(td # NIL);
  5142. END;
  5143. IF newObjectFile THEN
  5144. GetCodeSectionNameForSymbol(td,name);
  5145. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5146. meta.CheckTypeDeclaration(x);
  5147. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5148. ELSE
  5149. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5150. END;
  5151. IF backend.cooperative OR meta.simple THEN
  5152. offset := 0;
  5153. ELSE
  5154. IF x IS SyntaxTree.CellType THEN
  5155. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5156. IF baseRecord = NIL THEN
  5157. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5158. ELSE
  5159. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5160. END;
  5161. ELSE
  5162. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5163. END;
  5164. END;
  5165. ELSE
  5166. offset := 0;
  5167. source := module.allSections.FindBySymbol(td); (*TODO*)
  5168. IF source = NIL THEN
  5169. null := 0;
  5170. GetCodeSectionNameForSymbol(td,name);
  5171. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5172. IntermediateCode.InitImmediate(op,addressType,0);
  5173. source(IntermediateCode.Section).Emit(Data(position,op));
  5174. source.SetReferenced(FALSE)
  5175. ELSE
  5176. name := source.name;
  5177. END;
  5178. END;
  5179. RETURN td
  5180. END GetBackendType;
  5181. BEGIN
  5182. (*td := t.typeDeclaration;*)
  5183. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5184. (*
  5185. IF t IS SyntaxTree.PointerType THEN
  5186. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5187. ELSE
  5188. source := GetBackendType(t);
  5189. END;
  5190. *)
  5191. IF newObjectFile THEN
  5192. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5193. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5194. IntermediateCode.SetOffset(res,offset);
  5195. ELSE
  5196. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5197. END;
  5198. (*
  5199. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5200. make memory should be used when tag is used, not earlier
  5201. *)
  5202. RETURN res
  5203. END TypeDescriptorAdr;
  5204. (*
  5205. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5206. VAR result: IntermediateCode.Operand;
  5207. BEGIN
  5208. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5209. operand.tag := TypeDescriptorAdr(operand.type);
  5210. IntermediateCode.MakeMemory(operand.tag,addressType);
  5211. UseIntermediateOperand(operand.tag);
  5212. END;
  5213. END MakeTypeTag;
  5214. *)
  5215. PROCEDURE ProfilerInit;
  5216. VAR reg: IntermediateCode.Operand;
  5217. BEGIN
  5218. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5219. Emit(Call(position,reg,0));
  5220. END ProfilerInit;
  5221. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5222. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5223. BEGIN
  5224. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5225. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5226. THEN
  5227. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5228. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5229. Emit(Push(position,reg));
  5230. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5231. Emit(Push(position,reg));
  5232. StaticCallOperand(result,procedure);
  5233. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5234. ReleaseOperand(result);
  5235. END;
  5236. END ProfilerEnterExit;
  5237. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5238. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5239. BEGIN
  5240. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5241. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5242. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5243. profileInit.Emit(Push(position,reg));
  5244. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5245. profileInit.Emit(Push(position,reg));
  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 ProfilerAddProcedure;
  5258. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5259. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5260. BEGIN
  5261. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5262. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5263. profileInit.Emit(Push(position,reg));
  5264. profileInitPatchPosition := profileInit.pc;
  5265. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5266. NEW(string, LEN(name)); COPY(name, string^);
  5267. sv := SyntaxTree.NewStringValue(-1,string);
  5268. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5269. sv.SetType(type);
  5270. Designate(sv,result);
  5271. profileInit.Emit(Push(position,result.tag));
  5272. profileInit.Emit(Push(position,result.op));
  5273. StaticCallOperand(result,procedure);
  5274. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5275. ReleaseOperand(result);
  5276. END;
  5277. END ProfilerAddModule;
  5278. PROCEDURE ProfilerPatchInit;
  5279. VAR reg: IntermediateCode.Operand;
  5280. BEGIN
  5281. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5282. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5283. EmitLeave(profileInit,position,0);
  5284. profileInit.Emit(Exit(position,0,0));
  5285. END ProfilerPatchInit;
  5286. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5287. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5288. VAR
  5289. id: LONGINT;
  5290. leftType, rightType: SyntaxTree.Type;
  5291. procedureType: SyntaxTree.ProcedureType;
  5292. runtimeProcedure: SyntaxTree.Procedure;
  5293. runtimeProcedureOperand, operatorOperand: Operand;
  5294. kind: SET;
  5295. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5296. VAR
  5297. arg: IntermediateCode.Operand;
  5298. recordType: SyntaxTree.RecordType;
  5299. fingerPrint: SyntaxTree.FingerPrint;
  5300. BEGIN
  5301. IF type = NIL THEN
  5302. (* no type: push 'NoType' *)
  5303. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5304. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5305. ELSIF IsStrictlyPointerToRecord(type) THEN
  5306. (* pointer to record type: push typetag *)
  5307. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5308. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5309. arg := TypeDescriptorAdr(recordType);
  5310. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5311. ELSE
  5312. (* non-pointer to record type: push fingerprint *)
  5313. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5314. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5315. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5316. END;
  5317. operatorInitializationCodeSection.Emit(Push(position,arg))
  5318. END PushTypeInfo;
  5319. BEGIN
  5320. ASSERT(operatorInitializationCodeSection # NIL);
  5321. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5322. procedureType := operator.type(SyntaxTree.ProcedureType);
  5323. (* determine types *)
  5324. leftType := procedureType.firstParameter.type;
  5325. IF procedureType.numberParameters = 2 THEN
  5326. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5327. rightType := procedureType.firstParameter.nextParameter.type;
  5328. ELSE
  5329. rightType := NIL
  5330. END;
  5331. (* determine operator kind *)
  5332. IF IsStrictlyPointerToRecord(leftType) THEN
  5333. kind := {LhsIsPointer}
  5334. ELSE
  5335. kind := {}
  5336. END;
  5337. IF IsStrictlyPointerToRecord(rightType) THEN
  5338. kind := kind + {RhsIsPointer}
  5339. END;
  5340. IF kind # {} THEN (* TODO: to be removed later on *)
  5341. (* at least one of the types is a pointer to record *)
  5342. (* emit a code that registers this specific operator in the runtime *)
  5343. dump := operatorInitializationCodeSection.comments;
  5344. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5345. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5346. (* push ID *)
  5347. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5348. id := Global.GetSymbol(module.module.case, operator.name);
  5349. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5350. (* push kind *)
  5351. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5352. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5353. (* push type infos *)
  5354. PushTypeInfo(leftType);
  5355. PushTypeInfo(rightType);
  5356. (* push operator address *)
  5357. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5358. StaticCallOperand(operatorOperand, operator);
  5359. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5360. ReleaseOperand(operatorOperand);
  5361. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5362. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5363. ReleaseOperand(runtimeProcedureOperand)
  5364. END
  5365. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5366. END
  5367. END RegisterDynamicOperator;
  5368. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5369. VAR
  5370. traceModule: SyntaxTree.Module;
  5371. procedure: SyntaxTree.Procedure;
  5372. procedureVariable: SyntaxTree.Variable;
  5373. s,msg: Basic.MessageString;
  5374. res: Operand;
  5375. i: LONGINT;
  5376. sv: SyntaxTree.StringValue;
  5377. type: SyntaxTree.Type;
  5378. recordType: SyntaxTree.RecordType;
  5379. printout: Printout.Printer;
  5380. stringWriter: Streams.StringWriter;
  5381. expression: SyntaxTree.Expression;
  5382. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5383. BEGIN
  5384. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5385. IF procedure = NIL THEN
  5386. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5387. END;
  5388. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5389. s := "procedure ";
  5390. Strings.Append(s,backend.traceModuleName);
  5391. Strings.Append(s,".");
  5392. Strings.Append(s,procedureName);
  5393. Strings.Append(s," not present");
  5394. Error(position,s);
  5395. RETURN FALSE
  5396. ELSE
  5397. RETURN TRUE
  5398. END;
  5399. END GetProcedure;
  5400. PROCEDURE CallProcedure;
  5401. VAR size: LONGINT;
  5402. BEGIN
  5403. IF procedure # NIL THEN
  5404. StaticCallOperand(result,procedure);
  5405. size := ProcedureParametersSize(system,procedure);
  5406. ELSE
  5407. Symbol(procedureVariable, result);
  5408. LoadValue(result, procedureVariable.type.resolved);
  5409. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5410. END;
  5411. Emit(Call(position,result.op,size));
  5412. END CallProcedure;
  5413. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5414. VAR res: Operand; string: SyntaxTree.String;
  5415. BEGIN
  5416. IF GetProcedure("String") THEN
  5417. NEW(string, LEN(s)); COPY(s, string^);
  5418. sv := SyntaxTree.NewStringValue(-1,string);
  5419. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5420. sv.SetType(type);
  5421. Designate(sv,res);
  5422. Emit(Push(position,res.tag));
  5423. Emit(Push(position,res.op));
  5424. ReleaseOperand(res);
  5425. CallProcedure;
  5426. END;
  5427. END String;
  5428. PROCEDURE Integer(op: IntermediateCode.Operand);
  5429. BEGIN
  5430. IF GetProcedure("Int") THEN
  5431. Emit(Push(position,op));
  5432. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5433. CallProcedure;
  5434. END;
  5435. END Integer;
  5436. PROCEDURE Float(op: IntermediateCode.Operand);
  5437. BEGIN
  5438. IF GetProcedure("HIntHex") THEN
  5439. Emit(Push(position,op));
  5440. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5441. CallProcedure;
  5442. END;
  5443. END Float;
  5444. PROCEDURE Set(op: IntermediateCode.Operand);
  5445. BEGIN
  5446. IF GetProcedure("Set") THEN
  5447. Emit(Push(position,op));
  5448. (*
  5449. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5450. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5451. *)
  5452. CallProcedure;
  5453. END;
  5454. END Set;
  5455. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5456. BEGIN
  5457. IF GetProcedure("Boolean") THEN
  5458. Emit(Push(position,op));
  5459. CallProcedure;
  5460. END;
  5461. END Boolean;
  5462. PROCEDURE Char(op: IntermediateCode.Operand);
  5463. BEGIN
  5464. IF GetProcedure("Char") THEN
  5465. Emit(Push(position,op));
  5466. CallProcedure;
  5467. END;
  5468. END Char;
  5469. PROCEDURE Address(op: IntermediateCode.Operand);
  5470. BEGIN
  5471. IF GetProcedure("Address") THEN
  5472. Emit(Push(position,op));
  5473. CallProcedure;
  5474. END;
  5475. END Address;
  5476. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5477. BEGIN
  5478. IF GetProcedure("String") THEN
  5479. Emit(Push(position,tag));
  5480. Emit(Push(position,op));
  5481. CallProcedure;
  5482. END;
  5483. END StringOperand;
  5484. PROCEDURE Ln;
  5485. BEGIN
  5486. IF GetProcedure("Ln") THEN
  5487. CallProcedure;
  5488. END;
  5489. END Ln;
  5490. BEGIN
  5491. IF backend.traceModuleName = "" THEN RETURN END;
  5492. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5493. IF GetProcedure("Enter") THEN
  5494. CallProcedure
  5495. END;
  5496. NEW(stringWriter,LEN(s));
  5497. FOR i := 0 TO x.Length()-1 DO
  5498. msg := "";
  5499. expression := x.GetExpression(i);
  5500. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5501. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5502. ELSE
  5503. Global.GetModuleName(module.module, s);
  5504. END;
  5505. IF i = 0 THEN
  5506. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5507. stringWriter.String(":");
  5508. END;
  5509. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5510. IF ~(expression IS SyntaxTree.StringValue) THEN
  5511. printout.Expression(expression);
  5512. stringWriter.Get(s);
  5513. Strings.Append(msg,s);
  5514. Strings.Append(msg,"= ");
  5515. ELSE stringWriter.Get(s); (* remove from string writer *)
  5516. Strings.Append(msg, s);
  5517. END;
  5518. String(msg);
  5519. IF SemanticChecker.IsStringType(expression.type) THEN
  5520. Designate(expression,res);
  5521. StringOperand(res.op,res.tag);
  5522. ELSE
  5523. Evaluate(expression,res);
  5524. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5525. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5526. Convert(res.op,int64);
  5527. END;
  5528. Integer(res.op);
  5529. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5530. Boolean(res.op);
  5531. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5532. Set(res.op);
  5533. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5534. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5535. Convert(res.op,float64);
  5536. END;
  5537. Float(res.op);
  5538. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5539. Char(res.op);
  5540. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5541. Address(res.op);String("H");
  5542. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5543. Address(res.op);String("H");
  5544. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5545. Address(res.op);String("H");
  5546. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5547. Address(res.op);String("H");
  5548. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5549. String("NIL");
  5550. ELSE HALT(200);
  5551. END;
  5552. END;
  5553. ReleaseOperand(res);
  5554. String("; ");
  5555. END;
  5556. IF GetProcedure("Exit") THEN
  5557. CallProcedure
  5558. ELSE
  5559. Ln;
  5560. END;
  5561. END;
  5562. END SystemTrace;
  5563. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5564. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5565. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5566. BEGIN
  5567. type := type.resolved;
  5568. IF type IS SyntaxTree.RecordType THEN
  5569. WITH type: SyntaxTree.RecordType DO
  5570. baseType := type.baseType;
  5571. IF baseType # NIL THEN
  5572. baseType := baseType.resolved;
  5573. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5574. InitFields(baseType,adr,offset);
  5575. END;
  5576. variable := type.recordScope.firstVariable;
  5577. WHILE variable # NIL DO
  5578. IF variable.initializer # NIL THEN
  5579. Evaluate(variable.initializer,initializerOp);
  5580. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5581. Emit(Mov(position,mem,initializerOp.op));
  5582. ReleaseOperand(initializerOp);
  5583. ReleaseIntermediateOperand(mem);
  5584. END;
  5585. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5586. variable := variable.nextVariable
  5587. END;
  5588. END;
  5589. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5590. WITH type: SyntaxTree.ArrayType DO
  5591. IF type.form = SyntaxTree.Static THEN
  5592. baseType := type.arrayBase;
  5593. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5594. FOR i := 0 TO type.staticLength-1 DO
  5595. InitFields(baseType,adr,offset+i*size);
  5596. END;
  5597. END;
  5598. END;
  5599. ELSIF type IS SyntaxTree.MathArrayType THEN
  5600. WITH type: SyntaxTree.MathArrayType DO
  5601. IF type.form = SyntaxTree.Open THEN
  5602. dim := DynamicDim(type);
  5603. imm := IntermediateCode.Immediate(addressType,dim);
  5604. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5605. baseType := SemanticChecker.ArrayBase(type,dim);
  5606. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5607. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5608. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5609. ReleaseIntermediateOperand(imm);
  5610. (* flags remain empty (=0) for open array *)
  5611. ELSIF type.form = SyntaxTree.Static THEN
  5612. baseType := type.arrayBase;
  5613. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5614. ASSERT(type.staticLength < 1024*1024*1024);
  5615. FOR i := 0 TO type.staticLength-1 DO
  5616. InitFields(baseType,adr,offset+i*size);
  5617. END;
  5618. END;
  5619. END;
  5620. END;
  5621. END InitFields;
  5622. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5623. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5624. BEGIN
  5625. type := variable.type.resolved;
  5626. IF (type IS SyntaxTree.MathArrayType) THEN
  5627. WITH type: SyntaxTree.MathArrayType DO
  5628. IF type.form = SyntaxTree.Open THEN
  5629. Symbol(variable,operand);
  5630. InitFields(type, operand.tag,0);
  5631. ELSIF type.form = SyntaxTree.Tensor THEN
  5632. Symbol(variable, operand);
  5633. MakeMemory(tmp,operand.op,addressType,0);
  5634. ReleaseOperand(operand);
  5635. Emit(Mov(position,tmp, nil ) );
  5636. ReleaseIntermediateOperand(tmp);
  5637. END;
  5638. END;
  5639. ELSE
  5640. Symbol(variable,operand);
  5641. IF variable.initializer # NIL THEN
  5642. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5643. reference.SetType(variable.type.resolved);
  5644. reference.SetAssignable(TRUE);
  5645. Assign(reference,variable.initializer);
  5646. END;
  5647. InitFields(type, operand.op,0);
  5648. ReleaseOperand(operand);
  5649. END;
  5650. END InitVariable;
  5651. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5652. VAR end: Label;
  5653. BEGIN
  5654. IF type.form = SyntaxTree.Tensor THEN
  5655. InitOperand(result,ModeValue);
  5656. ReuseCopy(result.op,base);
  5657. end := NewLabel();
  5658. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5659. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5660. SetLabel(end);
  5661. Convert(result.op,int32);
  5662. ELSE
  5663. InitOperand(result,ModeValue);
  5664. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5665. END
  5666. END MathArrayDim;
  5667. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5668. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5669. BEGIN
  5670. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5671. MakeMemory(mem,base,addressType,offset);
  5672. Emit(Mov(position,mem,value));
  5673. ReleaseIntermediateOperand(mem);
  5674. END PutMathArrayField;
  5675. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5676. VAR mem: IntermediateCode.Operand;
  5677. BEGIN
  5678. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5679. MakeMemory(mem,base,addressType,offset);
  5680. Emit(Mov(position,mem,value));
  5681. ReleaseIntermediateOperand(mem);
  5682. END PutMathArrayFieldOffset;
  5683. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5684. BEGIN
  5685. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5686. MakeMemory(value,base,addressType,offset);
  5687. END GetMathArrayField;
  5688. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5689. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5690. BEGIN
  5691. IF incr THEN
  5692. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5693. ELSE
  5694. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5695. END;
  5696. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5697. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5698. ELSE
  5699. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5700. Emit(Mov(position,reg,dim));
  5701. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5702. Emit(Add(position,reg,reg,base));
  5703. MakeMemory(mem, reg, addressType, offset);
  5704. ReleaseIntermediateOperand(reg);
  5705. Emit(Mov(position,mem,value));
  5706. ReleaseIntermediateOperand(mem);
  5707. END;
  5708. END PutMathArrayLenOrIncr;
  5709. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5710. BEGIN
  5711. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5712. END PutMathArrayLength;
  5713. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5714. BEGIN
  5715. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5716. END PutMathArrayIncrement;
  5717. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5718. BEGIN
  5719. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5720. END GetMathArrayIncrement;
  5721. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5722. BEGIN
  5723. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5724. END GetMathArrayLength;
  5725. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5726. VAR dimOp: IntermediateCode.Operand;
  5727. BEGIN
  5728. dimOp := IntermediateCode.Immediate(int32, dim);
  5729. GetMathArrayLength(type, operand, dimOp, check, result);
  5730. END GetMathArrayLengthAt;
  5731. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5732. VAR dimOp: IntermediateCode.Operand;
  5733. BEGIN
  5734. dimOp := IntermediateCode.Immediate(int32, dim);
  5735. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5736. END GetMathArrayIncrementAt;
  5737. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5738. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5739. offset: LONGINT;
  5740. BEGIN
  5741. IF increment THEN
  5742. offset := MathIncrOffset;
  5743. ELSE
  5744. offset := MathLenOffset;
  5745. END;
  5746. INC(offset,operand.dimOffset*2);
  5747. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5748. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5749. END;
  5750. (* static dimension *)
  5751. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5752. IF check & (type.form = SyntaxTree.Tensor) THEN
  5753. DimensionCheck(operand.tag,dim,BrltL);
  5754. END;
  5755. val := SHORT(dim.intValue);
  5756. IF type.form # SyntaxTree.Tensor THEN
  5757. t := SemanticChecker.ArrayBase(type,val);
  5758. type := t.resolved(SyntaxTree.MathArrayType);
  5759. IF type.form = SyntaxTree.Static THEN
  5760. IF increment THEN
  5761. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5762. ELSE
  5763. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5764. END;
  5765. InitOperand(result,ModeValue);
  5766. result.op := res;
  5767. RETURN;
  5768. END;
  5769. END;
  5770. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5771. MakeMemory(res,operand.tag,addressType,offset);
  5772. (*
  5773. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5774. *)
  5775. InitOperand(result,ModeValue);
  5776. result.op := res;
  5777. ELSE
  5778. Convert(dim,addressType);
  5779. IF check THEN
  5780. IF type.form = SyntaxTree.Tensor THEN
  5781. DimensionCheck(operand.tag,dim,BrltL);
  5782. ELSIF isUnchecked THEN (* do nothing *)
  5783. ELSE
  5784. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5785. END;
  5786. END;
  5787. end := NewLabel(); next := NIL;
  5788. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5789. Emit(Mov(position,res,dim));
  5790. Convert(res,int32);
  5791. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5792. WHILE t IS SyntaxTree.MathArrayType DO
  5793. type := t(SyntaxTree.MathArrayType);
  5794. IF type.form = SyntaxTree.Static THEN
  5795. imm := IntermediateCode.Immediate(int32,val);
  5796. next := NewLabel();
  5797. BrneL(next,imm,res);
  5798. IF increment THEN
  5799. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5800. ELSE
  5801. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5802. END;
  5803. Emit(MovReplace(position,res,imm));
  5804. BrL(end);
  5805. ELSE hasDynamicPart := TRUE;
  5806. END;
  5807. t := type.arrayBase.resolved;
  5808. val := val + 1;
  5809. IF next # NIL THEN SetLabel(next) END;
  5810. END;
  5811. IF hasDynamicPart THEN
  5812. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5813. Emit(Mov(position,res2,dim));
  5814. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5815. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5816. Emit(Add(position,res2,res2,imm));
  5817. Emit(Add(position,res2,res2,operand.tag));
  5818. IntermediateCode.MakeMemory(res2,int32);
  5819. Emit(MovReplace(position,res,res2));
  5820. ReleaseIntermediateOperand(res2);
  5821. END;
  5822. SetLabel(end);
  5823. Convert(res,int32);
  5824. InitOperand(result,ModeValue);
  5825. result.op := res;
  5826. END;
  5827. END MathArrayLenOrIncr;
  5828. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5829. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5830. offset: LONGINT;
  5831. BEGIN
  5832. offset := operand.dimOffset+DynamicDim(type)-1;
  5833. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5834. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5835. val := SHORT(dim.intValue);
  5836. t := SemanticChecker.ArrayBase(type,val);
  5837. type := t.resolved(SyntaxTree.ArrayType);
  5838. IF type.form = SyntaxTree.Static THEN
  5839. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5840. ELSE
  5841. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5842. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5843. END;
  5844. UseIntermediateOperand(res);
  5845. InitOperand(result,ModeValue);
  5846. result.op := res;
  5847. ELSE
  5848. Convert(dim,addressType);
  5849. IF ~isUnchecked THEN
  5850. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5851. END;
  5852. end := NewLabel(); next := NIL;
  5853. (* ReuseCopy(dim,res); *)
  5854. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5855. Emit(Mov(position,res,dim));
  5856. Convert(res,int32);
  5857. Convert(res,int32);
  5858. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5859. WHILE t IS SyntaxTree.ArrayType DO
  5860. type := t(SyntaxTree.ArrayType);
  5861. IF type.form = SyntaxTree.Static THEN
  5862. imm := IntermediateCode.Immediate(int32,val);
  5863. next := NewLabel();
  5864. BrneL(next,imm,res);
  5865. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5866. Emit(MovReplace(position,res,imm));
  5867. BrL(end);
  5868. ELSE hasDynamicPart := TRUE;
  5869. END;
  5870. t := type.arrayBase.resolved;
  5871. val := val + 1;
  5872. IF next # NIL THEN SetLabel(next) END;
  5873. END;
  5874. IF hasDynamicPart THEN
  5875. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  5876. Convert(res2,addressType);
  5877. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  5878. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5879. Emit(Sub(position,res2,imm,res2));
  5880. Emit(Add(position,res2,res2,operand.tag));
  5881. IntermediateCode.MakeMemory(res2,int32);
  5882. Emit(MovReplace(position,res,res2));
  5883. ReleaseIntermediateOperand(res2);
  5884. END;
  5885. SetLabel(end);
  5886. Convert(res,int32);
  5887. InitOperand(result,ModeValue);
  5888. result.op := res;
  5889. END;
  5890. END ArrayLen;
  5891. (**
  5892. create a temporary variable in current scope
  5893. **)
  5894. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  5895. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  5896. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  5897. BEGIN
  5898. IF ~register THEN
  5899. variable := temporaries.GetFreeVariable(type, index);
  5900. ELSE
  5901. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  5902. END;
  5903. scope := currentScope;
  5904. IF variable = NIL THEN
  5905. COPY("@hiddenIRVar",string);
  5906. Basic.AppendNumber(string,index);
  5907. name := SyntaxTree.NewIdentifier(string);
  5908. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  5909. variable.SetType(type);
  5910. variable.SetAccess(SyntaxTree.Hidden);
  5911. IF ~register THEN
  5912. temporaries.AddVariable(variable);
  5913. IF scope.lastVariable # NIL THEN
  5914. offset := scope.lastVariable.offsetInBits;
  5915. ELSE
  5916. offset := 0;
  5917. END;
  5918. DEC(offset,system.SizeOf(variable.type));
  5919. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  5920. variable(SyntaxTree.Variable).SetOffset(offset);
  5921. scope.AddVariable(variable(SyntaxTree.Variable));
  5922. scope.EnterSymbol(variable, duplicate);
  5923. ASSERT(~duplicate);
  5924. InitVariable(variable(SyntaxTree.Variable));
  5925. ELSE
  5926. variable.SetUseRegister(TRUE);
  5927. variable(SyntaxTree.Variable).SetOffset(0);
  5928. END;
  5929. ELSE
  5930. InitVariable(variable(SyntaxTree.Variable));
  5931. (*
  5932. ASSERT(variable.type.resolved = type.resolved)
  5933. *)
  5934. END;
  5935. RETURN variable(SyntaxTree.Variable)
  5936. END GetTemporaryVariable;
  5937. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  5938. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  5939. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  5940. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  5941. i: LONGINT; duplicate: BOOLEAN;
  5942. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  5943. VAR variable: SyntaxTree.Variable;
  5944. BEGIN
  5945. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  5946. variable.SetType(type);
  5947. recordScope.AddVariable(variable);
  5948. END AddVariable;
  5949. BEGIN
  5950. name := "@ArrayDescriptor";
  5951. Basic.AppendNumber(name,dimensions);
  5952. identifier := SyntaxTree.NewIdentifier(name);
  5953. parentScope := module.module.moduleScope;
  5954. symbol := parentScope.FindSymbol(identifier);
  5955. IF symbol # NIL THEN
  5956. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  5957. type := typeDeclaration.declaredType;
  5958. ELSE
  5959. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  5960. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  5961. recordScope := SyntaxTree.NewRecordScope(parentScope);
  5962. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  5963. recordType.SetTypeDeclaration(typeDeclaration);
  5964. recordType.SetState(SyntaxTree.Resolved);
  5965. typeDeclaration.SetDeclaredType(recordType);
  5966. AddVariable("@ptr",system.anyType);
  5967. AddVariable("@adr",system.addressType);
  5968. AddVariable("@flags",system.addressType);
  5969. AddVariable("@dim",system.addressType);
  5970. AddVariable("@elementSize",system.addressType);
  5971. FOR i := 0 TO dimensions-1 DO
  5972. name := "@len";
  5973. Basic.AppendNumber(name,i);
  5974. AddVariable(name,system.addressType);
  5975. name := "@incr";
  5976. Basic.AppendNumber(name,i);
  5977. AddVariable(name,system.addressType);
  5978. END;
  5979. parentScope.AddTypeDeclaration(typeDeclaration);
  5980. parentScope.EnterSymbol(typeDeclaration,duplicate);
  5981. ASSERT(~duplicate);
  5982. type := recordType;
  5983. END;
  5984. RETURN type
  5985. END GetMathArrayDescriptorType;
  5986. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  5987. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  5988. BEGIN
  5989. type := GetMathArrayDescriptorType(dimensions);
  5990. Emit(Push(position,op.op));
  5991. (* push type descriptor *)
  5992. reg := TypeDescriptorAdr(type);
  5993. IF ~newObjectFile THEN
  5994. IntermediateCode.MakeMemory(reg,addressType);
  5995. END;
  5996. Emit(Push(position,reg));
  5997. ReleaseIntermediateOperand(reg);
  5998. (* push realtime flag: false by default *)
  5999. Emit(Push(position,false));
  6000. CallThis(position,"Heaps","NewRec",3);
  6001. END NewMathArrayDescriptor;
  6002. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6003. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6004. BEGIN
  6005. NEW(string, LEN(s)); COPY(s, string^);
  6006. sv := SyntaxTree.NewStringValue(-1,string);
  6007. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6008. sv.SetType(type);
  6009. Designate(sv,res);
  6010. Emit(Push(position,res.tag));
  6011. Emit(Push(position,res.op));
  6012. ReleaseOperand(res);
  6013. END PushConstString;
  6014. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6015. BEGIN
  6016. IF b THEN
  6017. Emit(Push(-1, true));
  6018. ELSE
  6019. Emit(Push(-1, false));
  6020. END;
  6021. END PushConstBoolean;
  6022. PROCEDURE PushConstSet(v: SET);
  6023. VAR value: SyntaxTree.Value; op: Operand;
  6024. BEGIN
  6025. value := SyntaxTree.NewSetValue(-1, v);
  6026. value.SetType(system.setType);
  6027. Evaluate(value, op);
  6028. Emit(Push(-1, op.op));
  6029. ReleaseOperand(op);
  6030. END PushConstSet;
  6031. PROCEDURE PushConstInteger(v: LONGINT);
  6032. VAR value: SyntaxTree.Value; op: Operand;
  6033. BEGIN
  6034. value := SyntaxTree.NewIntegerValue(-1, v);
  6035. value.SetType(system.longintType);
  6036. Evaluate(value, op);
  6037. Emit(Push(-1, op.op));
  6038. ReleaseOperand(op);
  6039. END PushConstInteger;
  6040. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6041. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6042. section: IntermediateCode.Section;
  6043. BEGIN
  6044. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6045. Global.GetSymbolSegmentedName(symbol, name);
  6046. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6047. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6048. procedure.SetScope(moduleScope);
  6049. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6050. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6051. procedure.SetAccess(SyntaxTree.Hidden);
  6052. currentScope := procedureScope;
  6053. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6054. EmitEnter(section, -1,NIL,0,0,0);
  6055. RETURN section;
  6056. END OpenInitializer;
  6057. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6058. BEGIN
  6059. EmitLeave(section, 0, 0 );
  6060. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6061. section := prev;
  6062. END CloseInitializer;
  6063. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6064. VAR name: SyntaxTree.IdentifierString;
  6065. variable: SyntaxTree.Variable;
  6066. type: SyntaxTree.Type;
  6067. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6068. BEGIN
  6069. InitOperand(op,ModeReference);
  6070. op.op := fp;
  6071. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6072. Dereference(op, x, FALSE);
  6073. result := op;
  6074. Symbol(symbol, op);
  6075. END Field;
  6076. PROCEDURE Direction(direction: LONGINT): SET;
  6077. BEGIN
  6078. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6079. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6080. ELSE HALT(100);
  6081. END;
  6082. END Direction;
  6083. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6084. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6085. BEGIN
  6086. Field(port, op);
  6087. ToMemory(op.op,addressType,0);
  6088. Emit(Push(-1, op.op));
  6089. ReleaseOperand(op);
  6090. Basic.GetString(modifier.identifier, name);
  6091. PushConstString(name);
  6092. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6093. ASSERT(SemanticChecker.IsStringType(value.type));
  6094. Designate(value, op);
  6095. Emit(Push(modifier.position, op.tag));
  6096. Emit(Push(modifier.position, op.op));
  6097. ReleaseOperand(op);
  6098. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6099. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6100. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6101. Evaluate(value, op);
  6102. Emit(Push(modifier.position, op.op));
  6103. ReleaseOperand(op);
  6104. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6105. ELSE
  6106. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6107. END;
  6108. END AddPortProperty;
  6109. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6110. VAR modifier: SyntaxTree.Modifier;
  6111. BEGIN
  6112. modifier := variable.modifiers;
  6113. WHILE modifier # NIL DO
  6114. AddPortProperty(variable,modifier, modifier.expression);
  6115. modifier := modifier.nextModifier;
  6116. END;
  6117. END AddPortProperties;
  6118. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6119. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6120. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6121. PROCEDURE PushLens(type: SyntaxTree.Type);
  6122. BEGIN
  6123. IF IsSemiDynamicArray(type) THEN
  6124. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6125. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6126. Emit(Push(-1, op.op));
  6127. ReleaseOperand(op);
  6128. INC(dim);
  6129. ELSIF IsStaticArray(type) THEN
  6130. len := len * type(SyntaxTree.ArrayType).staticLength;
  6131. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6132. INC(dim);
  6133. ELSE
  6134. baseType := type;
  6135. END;
  6136. END PushLens;
  6137. BEGIN
  6138. (* cell *)
  6139. IF variable.type IS SyntaxTree.ArrayType THEN
  6140. type := variable.type;
  6141. dim := 0;
  6142. len := 1;
  6143. PushLens(type);
  6144. portType := baseType.resolved(SyntaxTree.PortType);
  6145. ELSE
  6146. portType := variable.type(SyntaxTree.PortType);
  6147. END;
  6148. PushSelfPointer();
  6149. (* port / array of ports *)
  6150. IF IsStaticArray(type) THEN
  6151. PushConstInteger(len);
  6152. END;
  6153. Field(variable, op);
  6154. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6155. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6156. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6157. Designate(d, op);*)
  6158. Emit(Push(-1, op.op));
  6159. ReleaseOperand(op);
  6160. (* name *)
  6161. PushConstString(name);
  6162. (* inout *)
  6163. PushConstSet(Direction(portType.direction));
  6164. (* width *)
  6165. PushConstInteger(portType.sizeInBits);
  6166. IF variable.type IS SyntaxTree.PortType THEN
  6167. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6168. AddPortProperties(variable);
  6169. ELSIF IsStaticArray(type)THEN
  6170. CallThis(variable.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6171. ELSIF IsSemiDynamicArray(type) THEN
  6172. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6173. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6174. Emit(Add(position,reg, sp, size));
  6175. (* dim *)
  6176. PushConstInteger(dim);
  6177. (* len array *)
  6178. Emit(Push(position, reg));
  6179. ReleaseIntermediateOperand(reg);
  6180. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6181. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6182. Emit(Add(position, sp,sp, size));
  6183. ELSE
  6184. HALT(100);
  6185. END;
  6186. END Variable;
  6187. BEGIN
  6188. IF backend.cellsAreObjects THEN
  6189. variable := x.cellScope.firstVariable;
  6190. WHILE (variable # NIL) DO
  6191. type := variable.type.resolved;
  6192. WHILE (type IS SyntaxTree.ArrayType) DO
  6193. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6194. END;
  6195. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6196. Global.GetSymbolNameInScope(variable,x.cellScope,name);
  6197. Variable(name,variable);
  6198. END;
  6199. variable := variable.nextVariable;
  6200. END;
  6201. ELSE HALT(200)
  6202. END;
  6203. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6204. (*
  6205. x.typeDeclaration.GetName(componentName);
  6206. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6207. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6208. instanceType.SetDataMemorySize(dataMemorySize);
  6209. END;
  6210. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6211. instanceType.SetInstructionMemorySize(codeMemorySize)
  6212. END;
  6213. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6214. instanceType.AddCapability(ActiveCells.VectorCapability)
  6215. END;
  6216. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6217. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6218. END;
  6219. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6220. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6221. END;
  6222. AddDevices(instanceType, x);
  6223. *)
  6224. (*
  6225. IF x.isCellNet THEN
  6226. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6227. END;
  6228. *)
  6229. (*currentActiveCellsScope := instanceType;*)
  6230. (*
  6231. parameter := x.firstParameter;
  6232. portIndex := 0;
  6233. WHILE parameter # NIL DO
  6234. parameter.GetName(parameterName);
  6235. parameterType := parameter.type.resolved;
  6236. Parameter(parameterName, parameterType);
  6237. (*
  6238. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6239. ParameterArray(parameterType);
  6240. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6241. FOR i := 0 TO len-1 DO
  6242. COPY(parameterName,name);
  6243. AppendIndex(name,i);
  6244. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6245. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6246. INC(portIndex);
  6247. END;
  6248. ELSE
  6249. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6250. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6251. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6252. INC(portIndex);
  6253. END;
  6254. *)
  6255. parameter := parameter.nextParameter;
  6256. END;
  6257. *)
  6258. (*
  6259. Scope(x.cellScope);
  6260. currentActiveCellsScope := prevActiveCellsScope;
  6261. AddModules(instanceType,x.cellScope);
  6262. *)
  6263. END AddPorts;
  6264. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6265. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6266. BEGIN
  6267. Symbol(cell,op);
  6268. ToMemory(op.op,addressType,0);
  6269. Emit(Push(position,op.op));
  6270. ReleaseOperand(op);
  6271. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6272. PushConstString(name);
  6273. IF SemanticChecker.IsStringType(property.type) OR (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6274. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6275. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6276. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6277. Designate(d, op);
  6278. IF SemanticChecker.IsStringType(property.type) THEN
  6279. Emit(Push(-1, op.tag))
  6280. END;
  6281. Emit(Push(-1, op.op));
  6282. ReleaseOperand(op);
  6283. END;
  6284. IF SemanticChecker.IsStringType(property.type) THEN
  6285. ASSERT(SemanticChecker.IsStringType(value.type));
  6286. Designate(value, op);
  6287. Emit(Push(property.position, op.tag));
  6288. Emit(Push(property.position, op.op));
  6289. ReleaseOperand(op);
  6290. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6291. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6292. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6293. Evaluate(value, op);
  6294. Emit(Push(property.position, op.op));
  6295. ReleaseOperand(op);
  6296. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6297. ELSE
  6298. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6299. END;
  6300. END AddProperty;
  6301. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6302. VAR symbol: SyntaxTree.Symbol;
  6303. BEGIN
  6304. WHILE modifier # NIL DO
  6305. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6306. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6307. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6308. ELSE
  6309. (*! move this check to checker *)
  6310. Error(modifier.position, "undefined property");
  6311. END;
  6312. modifier := modifier.nextModifier;
  6313. END;
  6314. END AddModifiers;
  6315. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6316. VAR last: SyntaxTree.Modifier;
  6317. BEGIN
  6318. IF to = NIL THEN
  6319. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6320. ELSE
  6321. last := to;
  6322. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6323. last := last.nextModifier;
  6324. END;
  6325. IF last.identifier # this.identifier THEN
  6326. ASSERT(last.nextModifier = NIL);
  6327. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6328. END;
  6329. END;
  6330. END AppendModifier;
  6331. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6332. BEGIN
  6333. WHILE this # NIL DO
  6334. AppendModifier(to, this);
  6335. this := this.nextModifier;
  6336. END;
  6337. END AppendModifiers;
  6338. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6339. VAR op: Operand;
  6340. BEGIN
  6341. Evaluate(p, op);
  6342. Emit(Push(p.position, op.op));
  6343. ReleaseOperand(op);
  6344. (*
  6345. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6346. p := p(SyntaxTree.Designator).left;
  6347. END;
  6348. IF p # NIL THEN
  6349. Evaluate(p, op);
  6350. Emit(Push(p.position, op.op));
  6351. ReleaseOperand(op);
  6352. ELSE
  6353. Emit(Push(-1, nil));
  6354. END;
  6355. *)
  6356. END PushPort;
  6357. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6358. VAR
  6359. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6360. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6361. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6362. tmp:IntermediateCode.Operand;
  6363. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6364. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6365. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6366. dest: IntermediateCode.Operand;
  6367. staticLength: LONGINT; itype: IntermediateCode.Type;
  6368. convert,isTensor: BOOLEAN;
  6369. recordType: SyntaxTree.RecordType;
  6370. baseType: SyntaxTree.Type;
  6371. flags: SET;
  6372. left: SyntaxTree.Expression;
  6373. call: SyntaxTree.Designator;
  6374. procedure: SyntaxTree.Procedure;
  6375. temporaryVariable: SyntaxTree.Variable;
  6376. dummy: IntermediateCode.Operand;
  6377. customBuiltin: SyntaxTree.CustomBuiltin;
  6378. isVarPar: ARRAY 3 OF BOOLEAN;
  6379. callsection: Sections.Section;
  6380. segmentedName: Basic.SegmentedName;
  6381. needsTrace: BOOLEAN;
  6382. n: ARRAY 256 OF CHAR;
  6383. modifier: SyntaxTree.Modifier;
  6384. previous, init: IntermediateCode.Section;
  6385. prevScope: SyntaxTree.Scope;
  6386. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6387. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6388. priority: IntermediateCode.Operand;
  6389. op,callop: Operand;
  6390. BEGIN
  6391. IF type = NIL THEN RETURN END;
  6392. type := type.resolved;
  6393. IF type IS SyntaxTree.PointerType THEN
  6394. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6395. END;
  6396. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6397. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6398. recordScope := type(SyntaxTree.RecordType).recordScope;
  6399. IF recordScope.bodyProcedure # NIL THEN
  6400. procedure := recordScope.bodyProcedure;
  6401. body := procedure.procedureScope.body;
  6402. Emit(Push(position,self));
  6403. IF body.isActive THEN
  6404. StaticCallOperand(callop,procedure);
  6405. Emit(Push(position,callop.op));
  6406. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6407. Convert(priority,sizeType);
  6408. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6409. END;
  6410. Emit(Push(position,priority));
  6411. ReleaseIntermediateOperand(priority);
  6412. IF backend.cooperative THEN
  6413. Emit(Push(position,self));
  6414. CallThis(position,"Activities","Create",3)
  6415. ELSE
  6416. flags := 0;
  6417. IF body.isSafe THEN
  6418. flags := 1;
  6419. END;
  6420. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6421. Emit(Push(position,self));
  6422. CallThis(position,"Objects","CreateProcess",4)
  6423. END;
  6424. ELSE
  6425. Emit(Push(position,self));
  6426. StaticCallOperand(callop,procedure);
  6427. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6428. END;
  6429. Emit(Pop(position,self));
  6430. END;
  6431. END CallBodies;
  6432. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6433. BEGIN
  6434. actualType := actualType.resolved;
  6435. IF actualType IS SyntaxTree.StringType THEN
  6436. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6437. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6438. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6439. ELSE
  6440. tmp := op.tag;
  6441. IntermediateCode.MakeMemory(tmp,addressType);
  6442. Emit(Push(position,tmp));
  6443. END;
  6444. Emit(Push(position,op.op))
  6445. END PushString;
  6446. PROCEDURE PushTD(type: SyntaxTree.Type);
  6447. VAR op: IntermediateCode.Operand;
  6448. BEGIN
  6449. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6450. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6451. ELSE
  6452. IF type.resolved IS SyntaxTree.PointerType THEN
  6453. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6454. END;
  6455. op := TypeDescriptorAdr(type.resolved);
  6456. IF ~newObjectFile THEN
  6457. IntermediateCode.MakeMemory(op,addressType);
  6458. END;
  6459. Emit(Push(position,op));
  6460. END
  6461. END PushTD;
  6462. BEGIN
  6463. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6464. dest := destination; destination := emptyOperand;
  6465. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6466. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6467. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6468. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6469. CASE x.id OF
  6470. (* ---- COPY ----- *)
  6471. |Global.Copy:
  6472. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6473. (* ---- EXCL, INCL----- *)
  6474. |Global.Excl,Global.Incl:
  6475. Evaluate(p0,s0);
  6476. Evaluate(p1,s1);
  6477. Convert(s1.op,setType);
  6478. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6479. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6480. END;
  6481. ReuseCopy(res,s0.op);
  6482. ReleaseOperand(s0);
  6483. Reuse1(tmp,s1.op);
  6484. ReleaseOperand(s1);
  6485. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6486. IF x.id = Global.Excl THEN
  6487. Emit(Not(position,tmp,tmp));
  6488. Emit(And(position,res,res,tmp));
  6489. ELSE
  6490. Emit(Or(position,res,res,tmp));
  6491. END;
  6492. ReleaseIntermediateOperand(tmp);
  6493. Designate(p0,s0);
  6494. ToMemory(s0.op,setType,0);
  6495. Emit(Mov(position,s0.op,res));
  6496. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6497. (* ---- DISPOSE ----- *)
  6498. |Global.Dispose:
  6499. Designate(p0,s0);
  6500. Emit(Push(position,s0.op));
  6501. ReleaseOperand(s0);
  6502. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6503. (* ---- GETPROCEDURE ----- *)
  6504. |Global.GetProcedure:
  6505. Designate(p0,s0);
  6506. PushString(s0,p0.type);
  6507. Designate(p1,s1);
  6508. PushString(s1,p1.type);
  6509. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6510. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6511. ELSE PushTD(procedureType.firstParameter.type)
  6512. END;
  6513. PushTD(procedureType.returnType);
  6514. Designate(p2,s2);
  6515. Emit(Push(position,s2.op));
  6516. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6517. CallThis(position,"Modules","GetProcedure", 7);
  6518. (* ---- ASH, LSH, ROT ----- *)
  6519. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6520. Evaluate(p0,s0);
  6521. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6522. (* make unsigned arguments in order to produced a logical shift *)
  6523. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6524. convert:= TRUE;
  6525. itype := s0.op.type;
  6526. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6527. Convert(s0.op,itype);
  6528. ELSE
  6529. convert := FALSE;
  6530. END;
  6531. END;
  6532. Evaluate(p1,s1);
  6533. IF IsIntegerConstant(p1,hint) THEN
  6534. ReuseCopy(reg,s0.op);
  6535. IF hint > 0 THEN
  6536. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6537. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6538. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6539. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6540. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6541. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6542. END;
  6543. ELSIF hint < 0 THEN
  6544. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6545. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6546. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6547. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6548. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6549. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6550. END;
  6551. END;
  6552. ReleaseOperand(s0); ReleaseOperand(s1);
  6553. ELSE
  6554. exit := NewLabel();
  6555. end := NewLabel();
  6556. ReuseCopy(reg,s0.op);
  6557. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6558. Reuse1(tmp,s1.op);
  6559. Emit(Neg(position,tmp,s1.op));
  6560. Convert(tmp,s1.op.type);
  6561. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6562. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6563. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6564. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6565. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6566. END;
  6567. ReleaseIntermediateOperand(tmp);
  6568. BrL(end);
  6569. SetLabel(exit);
  6570. ReuseCopy(tmp,s1.op);
  6571. Convert(tmp,s1.op.type);
  6572. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6573. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6574. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6575. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6576. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6577. END;
  6578. ReleaseIntermediateOperand(tmp);
  6579. SetLabel(end);
  6580. ReleaseOperand(s0); ReleaseOperand(s1);
  6581. END;
  6582. InitOperand(result,ModeValue);
  6583. IF convert THEN
  6584. itype := reg.type;
  6585. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6586. Convert(reg,itype);
  6587. END;
  6588. result.op := reg;
  6589. (* ---- CAP ----- *)
  6590. |Global.Cap:
  6591. Evaluate(p0,result);
  6592. ReuseCopy(reg,result.op);
  6593. ReleaseIntermediateOperand(result.op);
  6594. ignore := NewLabel();
  6595. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6596. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6597. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6598. SetLabel(ignore);
  6599. result.op := reg;
  6600. (* ---- CHR ----- *)
  6601. |Global.Chr, Global.Chr32:
  6602. Evaluate(p0,result);
  6603. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6604. |Global.Entier, Global.EntierH:
  6605. Evaluate(p0,result);
  6606. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6607. (* ---- MIN and MAX ----- *)
  6608. |Global.Max,Global.Min:
  6609. Evaluate(p0,s0);
  6610. Evaluate(p1,s1);
  6611. Reuse2(res,s0.op,s1.op);
  6612. else := NewLabel();
  6613. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6614. ELSE BrltL(else,s1.op,s0.op) END;
  6615. Emit(Mov(position,res,s0.op));
  6616. ReleaseOperand(s0);
  6617. end := NewLabel();
  6618. BrL(end);
  6619. SetLabel(else);
  6620. Emit(MovReplace(position,res,s1.op));
  6621. SetLabel(end);
  6622. ReleaseOperand(s1);
  6623. InitOperand(result,ModeValue);
  6624. result.op := res;
  6625. (* ---- ODD ----- *)
  6626. |Global.Odd:
  6627. IF ~conditional THEN
  6628. ConditionToValue(x)
  6629. ELSE
  6630. Evaluate(p0,result);
  6631. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6632. Reuse1(res,result.op);
  6633. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6634. ReleaseIntermediateOperand(result.op);
  6635. result.op := res;
  6636. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6637. ReleaseOperand(result);
  6638. BrL(falseLabel);
  6639. END;
  6640. (* ---- ORD ----- *)
  6641. |Global.Ord, Global.Ord32:
  6642. Evaluate(p0,result);
  6643. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6644. (* ---- SHORT, LONG ----- *)
  6645. |Global.Short, Global.Long:
  6646. Evaluate(p0,result);
  6647. IF x.type IS SyntaxTree.ComplexType THEN
  6648. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6649. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6650. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6651. ELSE
  6652. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6653. END
  6654. (* ---- HALT, SYSTEM.HALT----- *)
  6655. |Global.Halt, Global.systemHalt:
  6656. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6657. EmitTrap (position, val);
  6658. (* ---- ASSERT ----- *)
  6659. |Global.Assert:
  6660. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6661. trueL := NewLabel();
  6662. falseL := NewLabel();
  6663. Condition(p0,trueL,falseL);
  6664. IF p1 = NIL THEN val := AssertTrap
  6665. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6666. END;
  6667. SetLabel(falseL);
  6668. EmitTrap(position,val);
  6669. SetLabel(trueL);
  6670. END;
  6671. (*
  6672. Emit(TrapC(result.op,val);
  6673. *)
  6674. (* ---- INC, DEC----- *)
  6675. |Global.Inc,Global.Dec:
  6676. Expression(p0); adr := result.op;
  6677. LoadValue(result,p0.type); l := result;
  6678. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6679. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6680. END;
  6681. IF x.id = Global.Inc THEN
  6682. Emit(Add(position,l.op,l.op,r.op));
  6683. ELSE
  6684. Emit(Sub(position,l.op,l.op,r.op));
  6685. END;
  6686. ReleaseOperand(l); ReleaseOperand(r);
  6687. (* ---- LEN ----- *)
  6688. |Global.Len: (* dynamic length, static length done by checker *)
  6689. Designate(p0,operand);
  6690. IF p1 = NIL THEN
  6691. InitOperand(l,ModeValue);
  6692. l.op := IntermediateCode.Immediate(int32,0);
  6693. ELSE
  6694. Evaluate(p1,l);
  6695. END;
  6696. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6697. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6698. Dereference(operand, p0.type.resolved, FALSE);
  6699. END;
  6700. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6701. ReleaseOperand(operand); ReleaseOperand(l);
  6702. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6703. ASSERT(p1 # NIL);
  6704. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6705. Dereference(operand,p0.type.resolved,FALSE);
  6706. END;
  6707. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6708. ReleaseOperand(operand); ReleaseOperand(l);
  6709. ELSE HALT(100);
  6710. END;
  6711. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6712. (* ---- FIRST ---- *)
  6713. |Global.First:
  6714. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6715. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6716. ELSE
  6717. Designate(p0, result)
  6718. END
  6719. (* ---- LAST ---- *)
  6720. |Global.Last:
  6721. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6722. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6723. ELSE
  6724. Designate(p0, result);
  6725. (* make sure result.op is a register *)
  6726. tmp := result.op;
  6727. ReuseCopy(result.op, result.op);
  6728. ReleaseIntermediateOperand(tmp);
  6729. (* add offset to result.op *)
  6730. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6731. END
  6732. (* ---- STEP ---- *)
  6733. |Global.Step:
  6734. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6735. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6736. ELSE
  6737. Designate(p0, result);
  6738. (* make sure result.op is a register *)
  6739. tmp := result.op;
  6740. ReuseCopy(result.op, result.op);
  6741. ReleaseIntermediateOperand(tmp);
  6742. (* add offset to result.op *)
  6743. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6744. END
  6745. (* ---- RE ---- *)
  6746. |Global.Re:
  6747. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6748. Designate(p0, result)
  6749. ELSE
  6750. Evaluate(p0, result)
  6751. END
  6752. (* ---- IM ---- *)
  6753. |Global.Im:
  6754. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6755. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6756. Designate(p0, result);
  6757. (* make sure result.op is a register *)
  6758. tmp := result.op;
  6759. ReuseCopy(result.op, result.op);
  6760. ReleaseIntermediateOperand(tmp);
  6761. (* add offset to result.op *)
  6762. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6763. (* ---- ABS ----- *)
  6764. |Global.Abs:
  6765. Evaluate(p0,operand);
  6766. type := p0.type.resolved;
  6767. InitOperand(result,ModeValue);
  6768. Reuse1a(result.op,operand.op,dest);
  6769. Emit(Abs(position,result.op,operand.op));
  6770. ReleaseOperand(operand);
  6771. (* ---- WAIT ----- *)
  6772. |Global.Wait:
  6773. Evaluate(p0,operand);
  6774. Emit(Push(position,operand.op));
  6775. ReleaseOperand(operand);
  6776. CallThis(position,"Activities","Wait", 1);
  6777. (* ---- NEW ----- *)
  6778. |Global.New:
  6779. (*! the following code is only correct for "standard" Oberon calling convention *)
  6780. type := p0.type.resolved;
  6781. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6782. THEN
  6783. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6784. IF backend.cooperative THEN
  6785. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6786. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6787. IF recordType.isObject THEN
  6788. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6789. IF recordType.IsActive() THEN
  6790. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6791. END;
  6792. IF recordType.IsProtected() THEN
  6793. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6794. END;
  6795. ELSE
  6796. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6797. END;
  6798. END;
  6799. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6800. CallThis(position,"Runtime","New", 1);
  6801. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6802. Emit(Result(position, pointer));
  6803. exit := NewLabel();
  6804. BreqL(exit,pointer,nil);
  6805. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6806. GetRecordTypeName (recordType,name);
  6807. IF ~recordType.isObject THEN
  6808. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6809. END;
  6810. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6811. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6812. IF recordType.isObject THEN
  6813. IF recordType.IsProtected() THEN
  6814. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6815. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6816. END;
  6817. IF recordType.IsActive() THEN
  6818. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6819. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6820. END;
  6821. END;
  6822. END;
  6823. (* initialize fields *)
  6824. IF type(SyntaxTree.PointerType).isPlain THEN
  6825. size := 0;
  6826. ELSIF recordType.isObject THEN
  6827. size := BaseObjectTypeSize;
  6828. ELSE
  6829. size := BaseRecordTypeSize;
  6830. END;
  6831. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  6832. (* call initializer *)
  6833. constructor := GetConstructor(recordType);
  6834. IF constructor # NIL THEN
  6835. (*! should be unified with ProcedureCallDesignator *)
  6836. Emit(Push(position,pointer));
  6837. ReleaseIntermediateOperand(pointer);
  6838. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6839. FOR i := 1 TO x.parameters.Length()-1 DO
  6840. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6841. formalParameter := formalParameter.nextParameter;
  6842. END;
  6843. (* static call of the constructor *)
  6844. GetCodeSectionNameForSymbol(constructor,name);
  6845. ASSERT(~constructor.isInline);
  6846. IF constructor.scope.ownerModule # module.module THEN
  6847. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6848. ELSE
  6849. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6850. END;
  6851. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  6852. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6853. Emit(Pop(position,pointer));
  6854. END;
  6855. (* call bodies *)
  6856. CallBodies(pointer,p0.type);
  6857. SetLabel(exit);
  6858. needsTrace := p0.NeedsTrace();
  6859. IF needsTrace THEN ModifyAssignments(true) END;
  6860. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  6861. Emit(Push(position, pointer));
  6862. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  6863. Emit(Pop(position, pointer));
  6864. END;
  6865. Designate(p0,l);
  6866. IF needsTrace THEN
  6867. CallAssignPointer(l.op, pointer);
  6868. ELSE
  6869. ToMemory(l.op,addressType,0);
  6870. Emit(Mov(position,l.op,pointer));
  6871. END;
  6872. ReleaseIntermediateOperand(pointer);
  6873. ReleaseOperand(l);
  6874. IF needsTrace THEN ModifyAssignments(false) END;
  6875. ELSE
  6876. temporaryVariable := GetTemporaryVariable(type, FALSE);
  6877. IF temporaryVariable # NIL THEN
  6878. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  6879. ELSE
  6880. Designate(p0,l);
  6881. END;
  6882. (* l.op contains address of pointer to record *)
  6883. Emit(Push(position,l.op)); (* address for use after syscall *)
  6884. Emit(Push(position,l.op));
  6885. ReleaseOperand(l);
  6886. (* push type descriptor *)
  6887. reg := TypeDescriptorAdr(recordType);
  6888. IF ~newObjectFile THEN
  6889. IntermediateCode.MakeMemory(reg,addressType);
  6890. END;
  6891. Emit(Push(position,reg));
  6892. ReleaseIntermediateOperand(reg);
  6893. (* push realtime flag *)
  6894. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6895. ELSE Emit(Push(position,false));
  6896. END;
  6897. CallThis(position,"Heaps","NewRec", 3);
  6898. (* check allocation success, if not successful then do not call initializers and bodies *)
  6899. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6900. Emit(Pop(position,pointer));
  6901. MakeMemory(reg,pointer,addressType,0);
  6902. ReleaseIntermediateOperand(pointer);
  6903. pointer := reg;
  6904. exit := NewLabel();
  6905. BreqL(exit,pointer,nil);
  6906. Emit(Push(position,pointer));
  6907. (* initialize fields *)
  6908. InitFields(recordType, pointer,0);
  6909. (* call initializer *)
  6910. constructor := GetConstructor(recordType);
  6911. IF constructor # NIL THEN
  6912. (*! should be unified with ProcedureCallDesignator *)
  6913. Emit(Push(position,pointer));
  6914. ReleaseIntermediateOperand(pointer);
  6915. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6916. FOR i := 1 TO x.parameters.Length()-1 DO
  6917. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6918. formalParameter := formalParameter.nextParameter;
  6919. END;
  6920. (* static call of the constructor *)
  6921. GetCodeSectionNameForSymbol(constructor,name);
  6922. ASSERT(~constructor.isInline);
  6923. IF constructor.scope.ownerModule # module.module THEN
  6924. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6925. ELSE
  6926. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6927. END;
  6928. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  6929. ELSE
  6930. ReleaseIntermediateOperand(pointer);
  6931. END;
  6932. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6933. Emit(Pop(position,pointer));
  6934. IF temporaryVariable # NIL THEN
  6935. Designate(p0,l);
  6936. ToMemory(l.op,addressType,0);
  6937. Emit(Mov(position,l.op,pointer));
  6938. ReleaseOperand(l);
  6939. result.tag := emptyOperand;
  6940. END;
  6941. (* call bodies *)
  6942. CallBodies(pointer,p0.type);
  6943. ReleaseIntermediateOperand(pointer);
  6944. IF temporaryVariable # NIL THEN
  6945. end := NewLabel();
  6946. BrL(end);
  6947. SetLabel(exit);
  6948. Designate(p0,l);
  6949. ToMemory(l.op,addressType,0);
  6950. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  6951. ReleaseOperand(l);
  6952. SetLabel(end);
  6953. ELSE
  6954. SetLabel(exit);
  6955. END;
  6956. END;
  6957. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  6958. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  6959. dim := 0;
  6960. IF p1 # NIL THEN
  6961. FOR i := 1 TO x.parameters.Length()-1 DO
  6962. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6963. parameter := x.parameters.GetExpression(i);
  6964. Evaluate(parameter,r);
  6965. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6966. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  6967. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  6968. END;
  6969. Emit(Push(position,r.op));
  6970. IF i=1 THEN
  6971. ReuseCopy(reg,r.op);
  6972. ELSE
  6973. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  6974. END;
  6975. ReleaseOperand(r);
  6976. INC(dim);
  6977. END;
  6978. Convert(reg,addressType);
  6979. ELSE
  6980. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6981. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  6982. END;
  6983. openDim := dim;
  6984. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  6985. IF backend.cooperative THEN
  6986. size := ToMemoryUnits(system,system.SizeOf(type));
  6987. WHILE type IS SyntaxTree.ArrayType DO
  6988. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6989. END;
  6990. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  6991. IF (size # 1) THEN
  6992. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6993. END;
  6994. Emit(Push(position,reg));
  6995. size := ToMemoryUnits(system,system.SizeOf(type));
  6996. IF (size # 1) THEN
  6997. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6998. END;
  6999. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7000. Emit(Push(position,reg));
  7001. ReleaseIntermediateOperand(reg);
  7002. CallThis(position,"Runtime","New", 1);
  7003. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7004. Emit(Result(position, pointer));
  7005. exit := NewLabel();
  7006. else := NewLabel();
  7007. BreqL(else,pointer,nil);
  7008. IF ~type.hasPointers THEN
  7009. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7010. ELSIF type IS SyntaxTree.RecordType THEN
  7011. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7012. ELSIF type IS SyntaxTree.ProcedureType THEN
  7013. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7014. ELSE
  7015. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7016. END;
  7017. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7018. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7019. 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))));
  7020. IF type IS SyntaxTree.RecordType THEN
  7021. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7022. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7023. ELSE
  7024. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7025. END;
  7026. i := openDim;
  7027. WHILE i > 0 DO
  7028. DEC (i);
  7029. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7030. END;
  7031. needsTrace := p0.NeedsTrace();
  7032. IF needsTrace THEN ModifyAssignments(true) END;
  7033. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7034. Emit(Push(position, pointer));
  7035. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7036. Emit(Pop(position, pointer));
  7037. END;
  7038. Designate(p0,l);
  7039. IF needsTrace THEN
  7040. CallAssignPointer(l.op, pointer);
  7041. ModifyAssignments(false);
  7042. ELSE
  7043. ToMemory(l.op,addressType,0);
  7044. Emit(Mov(position,l.op,pointer));
  7045. END;
  7046. ReleaseIntermediateOperand(pointer);
  7047. ReleaseOperand(l);
  7048. BrL(exit);
  7049. SetLabel(else);
  7050. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7051. Designate(p0,l);
  7052. IF needsTrace THEN
  7053. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7054. ELSE
  7055. ToMemory(l.op,addressType,0);
  7056. Emit(Mov(position,l.op,pointer));
  7057. END;
  7058. ReleaseOperand(l);
  7059. SetLabel(exit);
  7060. ELSE
  7061. (*! the following code is only correct for "standard" Oberon calling convention *)
  7062. IF SemanticChecker.ContainsPointer(type) THEN
  7063. IF type IS SyntaxTree.ArrayType THEN
  7064. staticLength := 1;
  7065. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7066. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7067. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7068. END;
  7069. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7070. Emit(Mul(position,reg,reg,tmp));
  7071. END;
  7072. Designate(p0,l);
  7073. IF openDim > 0 THEN
  7074. Emit(Push(position,l.op)); (* address for use after syscall *)
  7075. END;
  7076. Emit(Push(position,l.op)); (* address *)
  7077. ReleaseOperand(l);
  7078. tmp := TypeDescriptorAdr(type);
  7079. IF ~newObjectFile THEN
  7080. IntermediateCode.MakeMemory(tmp,addressType);
  7081. END;
  7082. Emit(Push(position,tmp)); (* type descriptor *)
  7083. ReleaseIntermediateOperand(tmp);
  7084. Emit(Push(position,reg)); (* number Elements *)
  7085. ReleaseIntermediateOperand(reg);
  7086. tmp := IntermediateCode.Immediate(addressType,dim);
  7087. Emit(Push(position,tmp)); (* dimensions *)
  7088. (* push realtime flag *)
  7089. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7090. ELSE Emit(Push(position,false));
  7091. END;
  7092. CallThis(position,"Heaps","NewArr",5)
  7093. ELSE
  7094. size := ToMemoryUnits(system,system.SizeOf(type));
  7095. IF (size # 1) THEN
  7096. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7097. END;
  7098. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7099. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7100. Emit(Add(position,reg,reg,tmp));
  7101. Designate(p0,l);
  7102. IF openDim >0 THEN
  7103. Emit(Push(position,l.op)); (* address for use after syscall *)
  7104. END;
  7105. Emit(Push(position,l.op)); (* address for syscall *)
  7106. ReleaseOperand(l); (* pointer address *)
  7107. Emit(Push(position,reg)); (* size *)
  7108. ReleaseIntermediateOperand(reg);
  7109. (* push realtime flag *)
  7110. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7111. ELSE Emit(Push(position,false));
  7112. END;
  7113. CallThis(position,"Heaps","NewSys", 3)
  7114. END;
  7115. IF openDim > 0 THEN
  7116. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7117. Emit(Pop(position,adr));
  7118. ToMemory(adr,addressType,0);
  7119. ReuseCopy(tmp,adr);
  7120. ReleaseIntermediateOperand(adr);
  7121. adr := tmp;
  7122. else := NewLabel();
  7123. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7124. i := openDim-1;
  7125. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7126. WHILE (i >= 0) DO
  7127. Emit(Pop(position,reg));
  7128. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7129. Emit(Mov(position,res,reg));
  7130. DEC(i);
  7131. END;
  7132. ReleaseIntermediateOperand(adr);
  7133. ReleaseIntermediateOperand(reg);
  7134. exit := NewLabel();
  7135. BrL(exit);
  7136. SetLabel(else);
  7137. (* else part: array could not be allocated *)
  7138. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7139. Emit(Add(position,sp,sp,tmp));
  7140. SetLabel(exit);
  7141. END;
  7142. END;
  7143. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7144. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7145. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7146. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7147. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7148. left.SetType(procedure.type);
  7149. formalParameter := procedureType.firstParameter;
  7150. (* push array to allocate *)
  7151. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7152. formalParameter :=formalParameter.nextParameter;
  7153. (* push length array *)
  7154. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7155. (* push size *)
  7156. type := t0;
  7157. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7158. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7159. END;
  7160. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7161. Emit(Push(position,tmp));
  7162. (* *)
  7163. IF SemanticChecker.ContainsPointer(type) THEN
  7164. tmp := TypeDescriptorAdr(type);
  7165. IF ~newObjectFile THEN
  7166. IntermediateCode.MakeMemory(tmp,addressType);
  7167. END;
  7168. ELSE
  7169. tmp := IntermediateCode.Immediate(addressType, 0);
  7170. END;
  7171. Emit(Push(position,tmp)); (* type descriptor *)
  7172. StaticCallOperand(result,procedure);
  7173. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7174. ReleaseOperand(result);
  7175. END;
  7176. (*
  7177. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7178. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7179. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7180. *)
  7181. ELSE
  7182. dim := 0;
  7183. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7184. (* generate geometry descriptor *)
  7185. Designate(p0,l);
  7186. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7187. ReleaseOperand(l);
  7188. isTensor := TRUE;
  7189. ELSE
  7190. isTensor := FALSE;
  7191. END;
  7192. FOR i := 1 TO x.parameters.Length()-1 DO
  7193. IF ~isTensor THEN
  7194. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7195. END;
  7196. parameter := x.parameters.GetExpression(i);
  7197. Evaluate(parameter,r);
  7198. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7199. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7200. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7201. END;
  7202. Emit(Push(position,r.op));
  7203. IF i=1 THEN
  7204. ReuseCopy(reg,r.op);
  7205. ELSE
  7206. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7207. END;
  7208. ReleaseOperand(r);
  7209. INC(dim);
  7210. END;
  7211. Convert(reg,addressType);
  7212. openDim := dim;
  7213. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7214. (*! the following code is only correct for "standard" Oberon calling convention *)
  7215. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7216. t := type;
  7217. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7218. staticLength := 1;
  7219. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7220. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7221. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7222. END;
  7223. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7224. Emit(Mul(position,reg,reg,tmp));
  7225. END;
  7226. Designate(p0,l);
  7227. IF isTensor THEN
  7228. Dereference(l,type,FALSE);
  7229. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7230. END;
  7231. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7232. Emit(Push(position,l.tag)); (* address *)
  7233. ReleaseOperand(l);
  7234. tmp := TypeDescriptorAdr(t);
  7235. IF ~newObjectFile THEN
  7236. IntermediateCode.MakeMemory(tmp,addressType);
  7237. END;
  7238. Emit(Push(position,tmp)); (* type descriptor *)
  7239. ReleaseIntermediateOperand(tmp);
  7240. Emit(Push(position,reg)); (* number Elements *)
  7241. ReleaseIntermediateOperand(reg);
  7242. tmp := IntermediateCode.Immediate(addressType,0);
  7243. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7244. (* push realtime flag: false by default *)
  7245. Emit(Push(position,false));
  7246. CallThis(position,"Heaps","NewArr",5);
  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,ArrDataArrayOffset))));
  7252. PutMathArrayField(adr,reg,MathAdrOffset);
  7253. ReleaseIntermediateOperand(tmp);
  7254. ReleaseIntermediateOperand(reg);
  7255. ELSE
  7256. IF isTensor THEN
  7257. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7258. ELSE
  7259. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7260. END;
  7261. IF (size # 1) THEN
  7262. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7263. END;
  7264. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7265. Emit(Add(position,reg,reg,tmp));
  7266. Designate(p0,l);
  7267. IF isTensor THEN
  7268. Dereference(l,type,FALSE);
  7269. END;
  7270. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7271. Emit(Push(position,l.tag)); (* address for syscall *)
  7272. ReleaseOperand(l); (* pointer address *)
  7273. Emit(Push(position,reg)); (* size *)
  7274. ReleaseIntermediateOperand(reg);
  7275. (* push realtime flag: false by default *)
  7276. Emit(Push(position,false));
  7277. CallThis(position,"Heaps","NewSys",3);
  7278. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7279. Emit(Pop(position,adr));
  7280. GetMathArrayField(tmp,adr,MathPtrOffset);
  7281. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7282. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7283. PutMathArrayField(adr,reg,MathAdrOffset);
  7284. ReleaseIntermediateOperand(tmp);
  7285. ReleaseIntermediateOperand(reg);
  7286. END;
  7287. flags := {};
  7288. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7289. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7290. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7291. PutMathArrayField(adr,tmp,MathDimOffset);
  7292. else := NewLabel();
  7293. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7294. i := openDim-1;
  7295. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7296. IF isTensor THEN
  7297. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7298. ELSE
  7299. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7300. END;
  7301. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7302. WHILE (i >= 0) DO
  7303. Emit(Pop(position,reg));
  7304. PutMathArrayLength(adr,reg,i);
  7305. PutMathArrayIncrement(adr,tmp,i);
  7306. IF i > 0 THEN
  7307. IF i=openDim-1 THEN
  7308. ReuseCopy(tmp,tmp);
  7309. END;
  7310. Emit(Mul(position,tmp,tmp,reg));
  7311. END;
  7312. DEC(i);
  7313. END;
  7314. ReleaseIntermediateOperand(adr);
  7315. ReleaseIntermediateOperand(reg);
  7316. ReleaseIntermediateOperand(tmp);
  7317. exit := NewLabel();
  7318. BrL(exit);
  7319. SetLabel(else);
  7320. (* else part: array could not be allocated *)
  7321. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7322. Emit(Add(position,sp,sp,tmp));
  7323. SetLabel(exit);
  7324. END;
  7325. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7326. THEN
  7327. IF ~backend.cellsAreObjects THEN RETURN END;
  7328. IF InCellScope(currentScope) THEN
  7329. PushSelfPointer()
  7330. ELSE
  7331. Emit(Push(position, nil));
  7332. END;
  7333. (* push temp address *)
  7334. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7335. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7336. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7337. (* l.op contains address of pointer to record *)
  7338. Emit(Push(position,l.op)); (* address for use after syscall *)
  7339. ReleaseOperand(l);
  7340. (* push type descriptor *)
  7341. reg := TypeDescriptorAdr(baseType);
  7342. IF ~newObjectFile THEN
  7343. IntermediateCode.MakeMemory(reg,addressType);
  7344. END;
  7345. Emit(Push(position,reg));
  7346. ReleaseIntermediateOperand(reg);
  7347. (* push name *)
  7348. (*Global.GetSymbolName(p0, n);*)
  7349. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7350. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7351. ELSE
  7352. Global.GetModuleName(module.module, n);
  7353. END;
  7354. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7355. (*type.typeDeclaration.GetName(n);*)
  7356. PushConstString(n);
  7357. (* push cellnet boolean *)
  7358. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7359. (* push engine boolean *)
  7360. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7361. (* allocate *)
  7362. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7363. (* add capabilities *)
  7364. modifier := p0(SyntaxTree.Designator).modifiers;
  7365. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7366. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7367. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7368. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7369. END;
  7370. AppendModifiers(modifier, baseType(SyntaxTree.CellType).modifiers);
  7371. (*
  7372. modifier := baseType(SyntaxTree.CellType).modifiers;
  7373. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7374. modifier := p0(SyntaxTree.Designator).modifiers;
  7375. *)
  7376. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7377. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7378. (* l.op contains address of pointer to record *)
  7379. ToMemory(l.op,addressType,0);
  7380. (* l.op contains value of pointer to record *)
  7381. Emit(Push(position,l.op)); (* address for use after syscall *)
  7382. ReleaseOperand(l);
  7383. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7384. prevScope := currentScope;
  7385. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7386. previous := section;
  7387. section := init;
  7388. (* add ports *)
  7389. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7390. CloseInitializer(previous);
  7391. currentScope := prevScope;
  7392. Symbol(temporaryVariable,l);
  7393. ToMemory(l.op,addressType,0);
  7394. Emit(Push(position,l.op));
  7395. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7396. (*
  7397. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7398. IF constructor # NIL THEN
  7399. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7400. FOR i := 1 TO x.parameters.Length()-1 DO
  7401. p := x.parameters.GetExpression(i);
  7402. Global.GetSymbolName(parameter,name);
  7403. Evaluate(p, value);
  7404. ASSERT(value.type # NIL);
  7405. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7406. par := instance.AddParameter(name);
  7407. par.SetInteger(value.integer);
  7408. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7409. par := instance.AddParameter(name);
  7410. par.SetBoolean(value.boolean);
  7411. ELSE Error(x.position,NotYetImplemented)
  7412. END;
  7413. parameter := parameter.nextParameter
  7414. END;
  7415. END;
  7416. *)
  7417. (* call initializer *)
  7418. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7419. IF constructor # NIL THEN
  7420. (*! should be unified with ProcedureCallDesignator *)
  7421. IF backend.cellsAreObjects THEN
  7422. Symbol(temporaryVariable,l);
  7423. ToMemory(l.op,addressType,0);
  7424. Emit(Push(position,l.op));
  7425. ReleaseOperand(l);
  7426. END;
  7427. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7428. FOR i := 1 TO x.parameters.Length()-1 DO
  7429. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7430. formalParameter := formalParameter.nextParameter;
  7431. END;
  7432. (* static call of the constructor *)
  7433. Global.GetSymbolSegmentedName(constructor,name);
  7434. ASSERT(~constructor.isInline);
  7435. IF constructor.scope.ownerModule # module.module THEN
  7436. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7437. ELSE
  7438. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7439. END;
  7440. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7441. (*ELSE
  7442. ReleaseIntermediateOperand(pointer);*)
  7443. END;
  7444. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7445. ToMemory(l.op, addressType, 0);
  7446. Designate(p0,s0);
  7447. ToMemory(s0.op,addressType,0);
  7448. Emit(Mov(position,s0.op,l.op));
  7449. ReleaseOperand(l);
  7450. ReleaseOperand(s0);
  7451. result.tag := emptyOperand;
  7452. (* start *)
  7453. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7454. (* push cell *)
  7455. Symbol(temporaryVariable, l);
  7456. ToMemory(l.op,addressType,0);
  7457. Emit(Push(-1,l.op));
  7458. (* push delegate *)
  7459. Emit(Push(-1,l.op));
  7460. ReleaseOperand(l);
  7461. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7462. Emit(Push(position, s1.op));
  7463. ReleaseOperand(s1);
  7464. CallThis(position,"ActiveCellsRuntime","Start",3);
  7465. END;
  7466. (*IF temporaryVariable # NIL THEN
  7467. end := NewLabel();
  7468. BrL(end);
  7469. SetLabel(exit);
  7470. Designate(p0,l);
  7471. ToMemory(l.op,addressType,0);
  7472. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7473. ReleaseOperand(l);
  7474. SetLabel(end);
  7475. ELSE
  7476. SetLabel(exit);
  7477. END;
  7478. *)
  7479. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7480. ELSE (* no pointer to record, no pointer to array *)
  7481. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7482. (* ignore new statement *)
  7483. Warning(p0.position, "cannot run on final hardware");
  7484. ELSE
  7485. HALT(200);
  7486. END;
  7487. END;
  7488. (* ---- ADDRESSOF----- *)
  7489. |Global.systemAdr:
  7490. Designate(p0,s0);
  7491. s0.mode := ModeValue;
  7492. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7493. ReleaseIntermediateOperand(s0.op);
  7494. s0.op := s0.tag;
  7495. IntermediateCode.InitOperand(s0.tag);
  7496. END;
  7497. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7498. result := s0;
  7499. (* ---- BIT ----- *)
  7500. |Global.systemBit:
  7501. Evaluate(p0,s0);
  7502. ToMemory(s0.op,addressType,0);
  7503. ReuseCopy(res,s0.op);
  7504. ReleaseOperand(s0);
  7505. Evaluate(p1,s1);
  7506. Emit(Ror(position,res,res,s1.op));
  7507. ReleaseOperand(s1);
  7508. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7509. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7510. IF ~conditional THEN
  7511. InitOperand(result,ModeValue); result.op := res;
  7512. ELSE
  7513. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7514. BrL(falseLabel);
  7515. ReleaseIntermediateOperand(res);
  7516. END;
  7517. (* --- MSK ----*)
  7518. |Global.systemMsk:
  7519. Evaluate(p0,s0);
  7520. Evaluate(p1,s1);
  7521. ReuseCopy(res,s0.op);
  7522. ReleaseOperand(s0);
  7523. Emit(And(position,res,res,s1.op));
  7524. ReleaseOperand(s1);
  7525. InitOperand(result,ModeValue);
  7526. result.op := res;
  7527. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7528. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7529. Evaluate(p0,s0);
  7530. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7531. ReleaseOperand(s0);
  7532. InitOperand(result,ModeValue);
  7533. result.op := res;
  7534. (* ---- SYSTEM.GetStackPointer ----- *)
  7535. |Global.systemGetStackPointer:
  7536. InitOperand(result,ModeValue);
  7537. result.op := sp;
  7538. (* ---- SYSTEM.GetFramePointer ----- *)
  7539. |Global.systemGetFramePointer:
  7540. InitOperand(result,ModeValue);
  7541. result.op := fp;
  7542. (* ---- SYSTEM.GetActivity ----- *)
  7543. |Global.systemGetActivity:
  7544. ASSERT(backend.cooperative);
  7545. InitOperand(result,ModeValue);
  7546. result.op := ap;
  7547. (* ---- SYSTEM.SetStackPointer ----- *)
  7548. |Global.systemSetStackPointer:
  7549. Evaluate(p0,s0); (* *)
  7550. Emit(Mov(position,sp,s0.op));
  7551. ReleaseOperand(s0);
  7552. (* ---- SYSTEM.SetFramePointer ----- *)
  7553. |Global.systemSetFramePointer:
  7554. Evaluate(p0,s0); (* *)
  7555. Emit(Mov(position,fp,s0.op));
  7556. ReleaseOperand(s0);
  7557. (* ---- SYSTEM.Activity ----- *)
  7558. |Global.systemSetActivity:
  7559. ASSERT(backend.cooperative);
  7560. Evaluate(p0,s0); (* *)
  7561. Emit(Mov(position,ap,s0.op));
  7562. ReleaseOperand(s0);
  7563. (* ---- SYSTEM.VAL ----- *)
  7564. |Global.systemVal:
  7565. Expression(p1);
  7566. s1 := result;
  7567. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7568. IF s1.mode = ModeReference THEN
  7569. (* nothing to be done if not record type, just take over new type *)
  7570. IF (type IS SyntaxTree.RecordType) THEN
  7571. ReleaseIntermediateOperand(s1.tag);
  7572. s1.tag := TypeDescriptorAdr(type);
  7573. IF ~newObjectFile THEN
  7574. IntermediateCode.MakeMemory(s1.tag,addressType);
  7575. END;
  7576. UseIntermediateOperand(s1.tag);
  7577. END;
  7578. result := s1;
  7579. ELSE (* copy over result to different type, may not use convert *)
  7580. itype := IntermediateCode.GetType(system,type);
  7581. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7582. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7583. Emit(Mov(position,s0.op,s1.op));
  7584. ReleaseOperand(s1);
  7585. InitOperand(result,ModeValue);
  7586. result.op := s0.op;
  7587. ELSE (* different size, must convert *)
  7588. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7589. Convert(s1.op, IntermediateCode.GetType(system,type));
  7590. result := s1;
  7591. END;
  7592. END;
  7593. (* ---- SYSTEM.GET ----- *)
  7594. |Global.systemGet:
  7595. Evaluate(p0,s0); (* adr *)
  7596. Designate(p1,s1); (* variable *)
  7597. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7598. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7599. Emit(Mov(position,s1.op,s0.op));
  7600. ReleaseOperand(s1);
  7601. ReleaseOperand(s0);
  7602. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7603. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7604. Evaluate(p0,s0); (* *)
  7605. Evaluate(p1,s1); (* variable *)
  7606. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7607. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7608. (* real part *)
  7609. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7610. Emit(Mov(position,res, s1.op));
  7611. ReleaseIntermediateOperand(res);
  7612. (* imaginary part *)
  7613. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7614. Emit(Mov(position,res, s1.tag));
  7615. ReleaseIntermediateOperand(res);
  7616. ReleaseOperand(s1);
  7617. ReleaseOperand(s0);
  7618. ELSE
  7619. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7620. ReleaseOperand(s0);
  7621. Emit(Mov(position,res,s1.op));
  7622. ReleaseIntermediateOperand(res);
  7623. ReleaseOperand(s1);
  7624. END;
  7625. (* ---- SYSTEM.MOVE ----- *)
  7626. |Global.systemMove:
  7627. Evaluate(p0,s0);
  7628. Evaluate(p1,s1);
  7629. Evaluate(p2,s2);
  7630. Emit(Copy(position,s1.op,s0.op,s2.op));
  7631. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7632. (* ---- SYSTEM.NEW ----- *)
  7633. |Global.systemNew:
  7634. Designate(p0,s0);
  7635. Emit(Push(position,s0.op));
  7636. ReleaseOperand(s0);
  7637. Evaluate(p1,s1);
  7638. Emit(Push(position,s1.op));
  7639. ReleaseOperand(s1);
  7640. (* push realtime flag: false by default *)
  7641. Emit(Push(position,false));
  7642. CallThis(position,"Heaps","NewSys",3);
  7643. (* ---- SYSTEM.CALL ----- *)
  7644. |Global.systemRef:
  7645. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7646. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7647. s0.mode := ModeValue;
  7648. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7649. result := s0
  7650. (* ---- INCR ----- *)
  7651. |Global.Incr:
  7652. Designate(p0,operand);
  7653. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7654. Dereference(operand,p0.type.resolved,FALSE);
  7655. END;
  7656. ASSERT(p1 # NIL);
  7657. Evaluate(p1,l);
  7658. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7659. ReleaseOperand(operand); ReleaseOperand(l);
  7660. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7661. (* ---- SUM ----- *)
  7662. |Global.Sum: HALT(200);
  7663. (* ---- ALL ----- *)
  7664. |Global.All: HALT(200);
  7665. (* ---- CAS ----- *)
  7666. |Global.Cas:
  7667. needsTrace := p0.NeedsTrace();
  7668. IF needsTrace THEN ModifyAssignments(true) END;
  7669. Designate(p0,s0);
  7670. Evaluate(p1,s1);
  7671. Evaluate(p2,s2);
  7672. IF needsTrace THEN
  7673. Emit(Push(position, s0.op));
  7674. Emit(Push(position, s1.op));
  7675. Emit(Push(position, s2.op));
  7676. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7677. ELSE
  7678. Emit(Cas(position,s0.op,s1.op,s2.op));
  7679. END;
  7680. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7681. IF needsTrace THEN ModifyAssignments(false) END;
  7682. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7683. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7684. IF conditional THEN
  7685. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7686. BrL(falseLabel);
  7687. ReleaseIntermediateOperand(res);
  7688. END;
  7689. (* ---- DIM ----- *)
  7690. |Global.Dim:
  7691. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7692. Designate(p0,s0);
  7693. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7694. Dereference(s0,p0.type.resolved,FALSE);
  7695. END;
  7696. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7697. ReleaseOperand(s0);
  7698. (* ---- RESHAPE ----- *)
  7699. |Global.Reshape:
  7700. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7701. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7702. left.SetType(procedure.type);
  7703. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7704. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7705. END;
  7706. (* ---- SYSTEM.TYPECODE ----- *)
  7707. |Global.systemTypeCode:
  7708. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7709. IF type.resolved IS SyntaxTree.PointerType THEN
  7710. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7711. END;
  7712. result.op := TypeDescriptorAdr(type);
  7713. IF ~newObjectFile THEN
  7714. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7715. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7716. END;
  7717. result.mode := ModeValue;
  7718. (* ---- SYSTEM.TRACE ----- *)
  7719. |Global.systemTrace:
  7720. SystemTrace(x.parameters, x.position);
  7721. (* ----- CONNECT ------*)
  7722. |Global.Connect:
  7723. IF backend.cellsAreObjects THEN
  7724. PushPort(p0);
  7725. PushPort(p1);
  7726. IF p2 # NIL THEN
  7727. Evaluate(p2, s2);
  7728. Emit(Push(p2.position, s2.op));
  7729. ReleaseOperand(s2);
  7730. ELSE
  7731. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7732. END;
  7733. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7734. ELSE
  7735. Warning(x.position, "cannot run on final hardware");
  7736. END;
  7737. (* ----- DELEGATE ------*)
  7738. |Global.Delegate:
  7739. IF backend.cellsAreObjects THEN
  7740. PushPort(p0);
  7741. PushPort(p1);
  7742. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7743. ELSE
  7744. Warning(x.position, "cannot run on final hardware");
  7745. END;
  7746. (* ----- SEND ------*)
  7747. |Global.Send:
  7748. Evaluate(p0,s0);
  7749. Evaluate(p1,s1);
  7750. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7751. Emit(Push(position,s0.op));
  7752. Emit(Push(position,s1.op));
  7753. (*
  7754. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7755. *)
  7756. IF ~backend.cellsAreObjects THEN
  7757. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7758. END;
  7759. ReleaseOperand(s0);
  7760. ReleaseOperand(s1);
  7761. IF backend.cellsAreObjects THEN
  7762. CallThis(position,"ActiveCellsRuntime","Send",2);
  7763. ELSE
  7764. CallThis(position,ChannelModuleName,"Send",2);
  7765. END;
  7766. (* ----- RECEIVE ------*)
  7767. |Global.Receive:
  7768. Evaluate(p0,s0);
  7769. Emit(Push(position,s0.op));
  7770. Designate(p1,s1);
  7771. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7772. Emit(Push(position,s1.op));
  7773. IF p2 # NIL THEN
  7774. Designate(p2,s2);
  7775. Emit(Push(position,s2.op));
  7776. END;
  7777. (*
  7778. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7779. *)
  7780. IF ~backend.cellsAreObjects THEN
  7781. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7782. END;
  7783. ReleaseOperand(s0);
  7784. ReleaseOperand(s1);
  7785. ReleaseOperand(s2);
  7786. IF backend.cellsAreObjects THEN
  7787. IF p2 = NIL THEN
  7788. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7789. ELSE
  7790. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7791. END;
  7792. ELSE
  7793. IF p2 = NIL THEN
  7794. CallThis(position,ChannelModuleName,"Receive",2)
  7795. ELSE
  7796. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7797. END;
  7798. END;
  7799. | Global.systemSpecial:
  7800. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7801. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7802. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7803. (* determine if parameters are of the VAR kind *)
  7804. ASSERT(x.parameters.Length() <= 3);
  7805. formalParameter := procedureType.firstParameter;
  7806. FOR i := 0 TO x.parameters.Length() - 1 DO
  7807. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7808. formalParameter := formalParameter.nextParameter
  7809. END;
  7810. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7811. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7812. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7813. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7814. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7815. IF procedureType.returnType # NIL THEN
  7816. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7817. Emit(Result(position, res));
  7818. (*InitOperand(result,ModeValue);
  7819. result.op := res;
  7820. *)
  7821. IF ~conditional THEN
  7822. InitOperand(result,ModeValue); result.op := res;
  7823. ELSE
  7824. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7825. BrL(falseLabel);
  7826. ReleaseIntermediateOperand(res);
  7827. END;
  7828. END
  7829. ELSE (* function not yet implemented *)
  7830. Error(position,"not yet implemented");
  7831. END;
  7832. destination := dest;
  7833. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  7834. END VisitBuiltinCallDesignator;
  7835. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  7836. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  7837. BEGIN
  7838. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  7839. dest := destination; destination := emptyOperand;
  7840. Expression(x.left);
  7841. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  7842. ELSIF isUnchecked THEN (* no check *)
  7843. ELSE
  7844. trueL := NewLabel();
  7845. falseL := NewLabel();
  7846. IF IsPointerToRecord(x.left.type,recordType) THEN
  7847. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7848. Emit(Mov(position,tag, result.op));
  7849. IF result.mode # ModeValue THEN
  7850. ptr := tag;
  7851. IntermediateCode.MakeMemory(ptr,addressType);
  7852. Emit(Mov(position,tag, ptr));
  7853. END;
  7854. IF ~backend.cooperative THEN
  7855. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7856. END;
  7857. IntermediateCode.MakeMemory(tag,addressType);
  7858. ELSE
  7859. tag := result.tag;
  7860. END;
  7861. TypeTest(tag,x.type,trueL,falseL);
  7862. ReleaseIntermediateOperand(tag);
  7863. SetLabel(falseL);
  7864. EmitTrap(position,TypeCheckTrap);
  7865. SetLabel(trueL);
  7866. END;
  7867. destination := dest;
  7868. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  7869. END VisitTypeGuardDesignator;
  7870. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  7871. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  7872. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  7873. VAR label: Label; pc: LONGINT;
  7874. BEGIN
  7875. IF backend.cooperative & ~isUnchecked THEN
  7876. pc := section.pc;
  7877. label := NewLabel();
  7878. BrneL(label, operand.op, nil);
  7879. EmitTrap(position, NilPointerTrap);
  7880. SetLabel(label);
  7881. INC(statCoopNilCheck, section.pc - pc);
  7882. END;
  7883. END NilCheck;
  7884. BEGIN
  7885. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  7886. ReuseCopy(dereferenced,operand.op);
  7887. ReleaseOperand(operand);
  7888. operand.mode := ModeReference;
  7889. operand.op := dereferenced;
  7890. operand.tag := dereferenced;
  7891. UseIntermediateOperand(operand.tag);
  7892. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  7893. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  7894. ReleaseIntermediateOperand(operand.tag);
  7895. operand.tag := TypeDescriptorAdr(type);
  7896. IF ~newObjectFile THEN
  7897. IntermediateCode.MakeMemory(operand.tag,addressType);
  7898. END;
  7899. ELSE
  7900. IF ~backend.cooperative THEN
  7901. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7902. END;
  7903. IntermediateCode.MakeMemory(operand.tag,addressType);
  7904. END;
  7905. NilCheck(operand.op);
  7906. ELSIF type IS SyntaxTree.ArrayType THEN
  7907. IF isUnsafe THEN
  7908. NilCheck(operand.op);
  7909. ReleaseIntermediateOperand(operand.tag);
  7910. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7911. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  7912. ELSE
  7913. operand.tag := emptyOperand;
  7914. END;
  7915. ELSE
  7916. NilCheck(operand.op);
  7917. IF backend.cooperative THEN
  7918. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  7919. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7920. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  7921. ELSE
  7922. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  7923. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  7924. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7925. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  7926. END;
  7927. END;
  7928. ELSIF type IS SyntaxTree.MathArrayType THEN
  7929. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  7930. IntermediateCode.MakeMemory(operand.op,addressType);
  7931. ELSE HALT(100);
  7932. END;
  7933. END Dereference;
  7934. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  7935. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  7936. BEGIN
  7937. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  7938. dest := destination; destination := emptyOperand;
  7939. Evaluate(x.left,d);
  7940. type := x.type.resolved;
  7941. prevIsUnchecked := isUnchecked;
  7942. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  7943. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  7944. END;
  7945. Dereference(d,type,IsUnsafePointer(x.left.type));
  7946. isUnchecked := prevIsUnchecked;
  7947. result := d;
  7948. 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
  7949. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  7950. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7951. END;
  7952. END;
  7953. destination := dest;
  7954. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  7955. END VisitDereferenceDesignator;
  7956. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  7957. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  7958. BEGIN
  7959. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  7960. dest := destination; destination := emptyOperand;
  7961. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  7962. tag := result.op;
  7963. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  7964. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  7965. StaticCallOperand(result,procedure.super);
  7966. ReleaseIntermediateOperand(result.tag);
  7967. UseIntermediateOperand(tag); (* necessary ? *)
  7968. result.tag := tag;
  7969. destination := dest;
  7970. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  7971. END VisitSupercallDesignator;
  7972. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  7973. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  7974. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  7975. name: Basic.SegmentedName;
  7976. BEGIN
  7977. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  7978. dest := destination; destination := emptyOperand;
  7979. scope := currentScope;
  7980. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  7981. scope := scope.outerScope;
  7982. END;
  7983. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  7984. IF newObjectFile THEN
  7985. moduleSection := meta.ModuleSection();
  7986. IF backend.cooperative THEN
  7987. moduleOffset := 0;
  7988. ELSE
  7989. moduleOffset := moduleSection.pc;
  7990. END;
  7991. result.mode := ModeValue;
  7992. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  7993. ELSE
  7994. Symbol(moduleSelf,result);
  7995. IntermediateCode.MakeMemory(result.op,addressType);
  7996. END
  7997. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  7998. result.mode := ModeValue;
  7999. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8000. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8001. ELSE
  8002. GetBaseRegister(basereg,currentScope,scope);
  8003. InitOperand(result,ModeReference);
  8004. result.op := basereg;
  8005. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  8006. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  8007. IF backend.cooperative THEN
  8008. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8009. END;
  8010. (* tag must be loaded when dereferencing SELF pointer *)
  8011. END;
  8012. destination := dest;
  8013. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8014. END VisitSelfDesignator;
  8015. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8016. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8017. BEGIN
  8018. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8019. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8020. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8021. parameter := procedureType.returnParameter;
  8022. VisitParameter(parameter);
  8023. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8024. END VisitResultDesignator;
  8025. (** values *)
  8026. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8027. BEGIN
  8028. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8029. IF conditional THEN
  8030. IF x.value THEN BrL(trueLabel)
  8031. ELSE BrL(falseLabel)
  8032. END;
  8033. ELSE
  8034. InitOperand(result,ModeValue);
  8035. IF x.value THEN result.op := true ELSE result.op := false END;
  8036. END;
  8037. END VisitBooleanValue;
  8038. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8039. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8040. BEGIN
  8041. Global.GetModuleSegmentedName(module.module, name);
  8042. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8043. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8044. RETURN section
  8045. END GetDataSection;
  8046. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8047. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8048. BEGIN
  8049. type := vop.type;
  8050. data := GetDataSection();
  8051. pc := EnterImmediate(data,vop);
  8052. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8053. IntermediateCode.MakeMemory(vop, type);
  8054. END GetImmediateMem;
  8055. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8056. BEGIN
  8057. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8058. InitOperand(result,ModeValue);
  8059. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8060. IF ~supportedImmediate(result.op) &~inData THEN
  8061. GetImmediateMem(result.op)
  8062. END;
  8063. END VisitIntegerValue;
  8064. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8065. BEGIN
  8066. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8067. InitOperand(result,ModeValue);
  8068. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8069. END VisitCharacterValue;
  8070. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8071. BEGIN
  8072. IF Trace THEN TraceEnter("VisitSetValue") END;
  8073. InitOperand(result,ModeValue);
  8074. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8075. END VisitSetValue;
  8076. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8077. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8078. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8079. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8080. BEGIN
  8081. numberElements := x.elements.Length();
  8082. FOR i := 0 TO numberElements-1 DO
  8083. expression := x.elements.GetExpression(i);
  8084. IF expression IS SyntaxTree.MathArrayExpression THEN
  8085. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8086. ELSE
  8087. inData := TRUE;
  8088. Evaluate(expression,op);
  8089. irv.Emit(Data(position,op.op));
  8090. inData := FALSE;
  8091. ReleaseOperand(op);
  8092. END;
  8093. END;
  8094. END RecursiveData;
  8095. BEGIN
  8096. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8097. IF ~TryConstantDeclaration() THEN
  8098. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8099. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8100. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8101. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8102. ELSE
  8103. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8104. END;
  8105. RecursiveData(x.array);
  8106. InitOperand(result,ModeReference);
  8107. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8108. END
  8109. END VisitMathArrayValue;
  8110. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8111. VAR constant: Sections.Section;
  8112. BEGIN
  8113. IF constantDeclaration = NIL THEN
  8114. RETURN FALSE
  8115. ELSE
  8116. (* Is a constant in this module: did we generate it already? *)
  8117. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8118. IF constant # NIL THEN
  8119. InitOperand(result,ModeReference);
  8120. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8121. RETURN TRUE;
  8122. END;
  8123. END;
  8124. RETURN FALSE
  8125. END TryConstantDeclaration;
  8126. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8127. BEGIN
  8128. constantDeclaration := x;
  8129. x.value.resolved.Accept(SELF);
  8130. END VisitConstant;
  8131. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8132. BEGIN
  8133. IF Trace THEN TraceEnter("VisitRealValue") END;
  8134. InitOperand(result,ModeValue);
  8135. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8136. END VisitRealValue;
  8137. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8138. VAR
  8139. componentType: SyntaxTree.Type;
  8140. BEGIN
  8141. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8142. ASSERT(x.type IS SyntaxTree.ComplexType);
  8143. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8144. InitOperand(result,ModeValue);
  8145. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8146. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8147. END VisitComplexValue;
  8148. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8149. VAR i: LONGINT; name: Basic.SegmentedName;
  8150. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8151. BEGIN
  8152. IF Trace THEN TraceEnter("VisitStringValue") END;
  8153. IF ~TryConstantDeclaration() THEN
  8154. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8155. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8156. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8157. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8158. ELSE
  8159. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8160. END;
  8161. FOR i := 0 TO x.length-1 DO
  8162. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8163. irv.Emit(Data(position,op));
  8164. END;
  8165. InitOperand(result,ModeReference);
  8166. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8167. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8168. END
  8169. END VisitStringValue;
  8170. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8171. BEGIN
  8172. IF Trace THEN TraceEnter("VisitNilValue") END;
  8173. InitOperand(result,ModeValue);
  8174. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8175. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8176. END VisitNilValue;
  8177. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8178. BEGIN
  8179. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8180. InitOperand(result,ModeValue);
  8181. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8182. END VisitEnumerationValue;
  8183. (** symbols *)
  8184. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8185. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8186. END VisitImport;
  8187. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8188. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8189. BEGIN
  8190. IF scope # baseScope THEN
  8191. (* left := [fp+8] *)
  8192. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8193. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8194. ReuseCopy(left,right);
  8195. ReleaseIntermediateOperand(right);
  8196. scope := scope.outerScope; DEC(level);
  8197. (* { left := [left+8] } *)
  8198. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8199. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8200. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8201. Emit(Mov(position,left,right));
  8202. scope := scope.outerScope; DEC(level);
  8203. END;
  8204. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8205. result := left;
  8206. ELSE
  8207. result := fp;
  8208. END;
  8209. END GetBaseRegister;
  8210. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8211. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8212. BEGIN
  8213. IF Trace THEN TraceEnter("VisitVariable"); END;
  8214. type := x.type.resolved;
  8215. IF (x.useRegister) THEN
  8216. InitOperand(result, ModeValue);
  8217. IF x.registerNumber < 0 THEN
  8218. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8219. reg := x.registerNumber;
  8220. ELSE
  8221. reg := registerUsageCount.Map(x.registerNumber);
  8222. UseRegister(reg);
  8223. END;
  8224. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8225. ELSIF x.externalName # NIL THEN
  8226. InitOperand(result,ModeReference);
  8227. Basic.ToSegmentedName(x.externalName^, name);
  8228. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8229. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8230. InitOperand(result,ModeReference);
  8231. GetBaseRegister(result.op,currentScope,x.scope);
  8232. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8233. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8234. InitOperand(result,ModeReference);
  8235. GetCodeSectionNameForSymbol(x,name);
  8236. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8237. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8238. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8239. InitOperand(result,ModeReference);
  8240. GetCodeSectionNameForSymbol(x,name);
  8241. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8242. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8243. ELSE (* field, left designator must have been emitted *)
  8244. ASSERT(result.mode = ModeReference);
  8245. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8246. ReuseCopy(temp,result.op);
  8247. ReleaseIntermediateOperand(result.op);
  8248. result.op := temp;
  8249. END;
  8250. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8251. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8252. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8253. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8254. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8255. END;
  8256. END;
  8257. END;
  8258. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8259. ValueToCondition(result);
  8260. ELSIF type IS SyntaxTree.ProcedureType THEN
  8261. ReleaseIntermediateOperand(result.tag);
  8262. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8263. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8264. UseIntermediateOperand(result.tag);
  8265. ELSE
  8266. result.tag := nil; (* nil *)
  8267. END;
  8268. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8269. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8270. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8271. ReleaseIntermediateOperand(result.tag);
  8272. Global.GetSymbolSegmentedName(x,name);
  8273. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8274. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8275. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8276. ELSE
  8277. END;
  8278. ELSE
  8279. ReleaseIntermediateOperand(result.tag);
  8280. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8281. END;
  8282. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8283. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8284. ReleaseIntermediateOperand(result.tag);
  8285. result.tag := result.op;
  8286. UseIntermediateOperand(result.tag);
  8287. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8288. IntermediateCode.MakeMemory(result.op,addressType);
  8289. END;
  8290. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8291. ReleaseIntermediateOperand(result.tag);
  8292. result.tag := TypeDescriptorAdr(type);
  8293. IF ~newObjectFile THEN
  8294. IntermediateCode.MakeMemory(result.tag,addressType);
  8295. END;
  8296. UseIntermediateOperand(result.tag);
  8297. (* tag for pointer type computed not here but during dereferencing *)
  8298. END;
  8299. IF Trace THEN TraceExit("VisitVariable") END;
  8300. END VisitVariable;
  8301. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8302. BEGIN
  8303. VisitVariable(property);
  8304. END VisitProperty;
  8305. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8306. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8307. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8308. BEGIN
  8309. type := x.type.resolved;
  8310. IF Trace THEN TraceEnter("VisitParameter") END;
  8311. IF x.ownerType IS SyntaxTree.CellType THEN
  8312. ptype := x.type.resolved;
  8313. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8314. IF ~(ptype IS SyntaxTree.PortType) THEN
  8315. InitOperand(result,ModeReference);
  8316. GetCodeSectionNameForSymbol(x,name);
  8317. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8318. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8319. RETURN
  8320. ELSE
  8321. InitOperand(result, ModeValue);
  8322. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8323. adr := 0;
  8324. WHILE parameter # x DO
  8325. parameterType := parameter.type;
  8326. inc := 1;
  8327. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8328. INC(adr, inc);
  8329. parameter := parameter.nextParameter
  8330. END;
  8331. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8332. RETURN
  8333. END;
  8334. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8335. InitOperand(result,ModeReference);
  8336. GetCodeSectionNameForSymbol(x,name);
  8337. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8338. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8339. RETURN
  8340. ELSE
  8341. GetBaseRegister(basereg,currentScope,x.scope);
  8342. InitOperand(result,ModeReference);
  8343. result.op := basereg;
  8344. END;
  8345. IF IsOpenArray(type) THEN
  8346. result.tag := basereg;
  8347. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8348. IntermediateCode.MakeMemory(result.op,addressType);
  8349. IF Global.IsOberonProcedure(x.ownerType) THEN
  8350. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8351. UseIntermediateOperand(result.tag);
  8352. ELSE
  8353. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8354. END;
  8355. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8356. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8357. ELSIF IsStaticArray(type) THEN
  8358. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8359. IntermediateCode.MakeMemory(result.op,addressType);
  8360. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8361. ELSIF type IS SyntaxTree.MathArrayType THEN
  8362. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8363. WITH type: SyntaxTree.MathArrayType DO
  8364. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8365. IF type.form = SyntaxTree.Tensor THEN
  8366. ELSIF type.form = SyntaxTree.Open THEN
  8367. result.tag := result.op;
  8368. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8369. IntermediateCode.MakeMemory(result.op,addressType);
  8370. UseIntermediateOperand(result.tag);
  8371. ELSIF type.form = SyntaxTree.Static THEN
  8372. IF x.kind = SyntaxTree.ConstParameter THEN
  8373. IntermediateCode.MakeMemory(result.op,addressType);
  8374. END;
  8375. ELSE HALT(100)
  8376. END;
  8377. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8378. IF type.form = SyntaxTree.Tensor THEN
  8379. ToMemory(result.op,addressType,0);
  8380. ELSIF type.form = SyntaxTree.Open THEN
  8381. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8382. ReuseCopy(result.tag, mem);
  8383. ReleaseIntermediateOperand(mem);
  8384. ReleaseIntermediateOperand(result.op);
  8385. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8386. ELSIF type.form = SyntaxTree.Static THEN
  8387. IntermediateCode.MakeMemory(result.op,addressType);
  8388. ELSE HALT(100)
  8389. END;
  8390. ELSE HALT(100)
  8391. END;
  8392. END;
  8393. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8394. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8395. IntermediateCode.MakeMemory(result.op,addressType);
  8396. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8397. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8398. END;
  8399. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8400. ValueToCondition(result);
  8401. ELSIF type IS SyntaxTree.ProcedureType THEN
  8402. ReleaseIntermediateOperand(result.tag);
  8403. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8404. IF x.kind = SyntaxTree.VarParameter THEN
  8405. ReuseCopy(result.tag,result.op);
  8406. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8407. IntermediateCode.MakeMemory(result.tag,addressType);
  8408. ELSE
  8409. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8410. UseIntermediateOperand(result.tag);
  8411. END;
  8412. ELSE
  8413. result.tag := nil;
  8414. END;
  8415. (* tag for pointer type computed not here but during dereferencing *)
  8416. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8417. ReleaseIntermediateOperand(result.tag);
  8418. result.tag := basereg;
  8419. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8420. IntermediateCode.MakeMemory(result.tag,addressType);
  8421. UseIntermediateOperand(result.tag);
  8422. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8423. ReleaseIntermediateOperand(result.tag);
  8424. result.tag := TypeDescriptorAdr(type);
  8425. IF ~newObjectFile THEN
  8426. IntermediateCode.MakeMemory(result.tag,addressType);
  8427. END;
  8428. UseIntermediateOperand(result.tag);
  8429. END;
  8430. IF Trace THEN TraceExit("VisitParameter") END;
  8431. END VisitParameter;
  8432. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8433. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8434. BEGIN
  8435. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8436. (* left.p: left already emitted *)
  8437. tag := result.op; (* value of pointer to left *)
  8438. (* get type desc *)
  8439. tmp := result.tag;
  8440. IntermediateCode.MakeMemory(tmp,addressType);
  8441. (* get method adr *)
  8442. Reuse1(reg,tmp);
  8443. ReleaseIntermediateOperand(tmp);
  8444. IF backend.cooperative THEN
  8445. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8446. WHILE recordType.baseType # NIL DO
  8447. recordType := recordType.GetBaseRecord ();
  8448. END;
  8449. GetRecordTypeName (recordType,name);
  8450. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8451. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8452. offset := 0;
  8453. ELSE
  8454. offset := 2;
  8455. END;
  8456. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8457. ELSE
  8458. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8459. END;
  8460. InitOperand(operand,ModeReference);
  8461. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8462. operand.op := reg;
  8463. operand.tag := tag;
  8464. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8465. END DynamicCallOperand;
  8466. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8467. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8468. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8469. BEGIN
  8470. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8471. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8472. tag := operand.op;
  8473. ReleaseIntermediateOperand(operand.tag);
  8474. ELSE tag := nil
  8475. END;
  8476. IF x.isInline THEN
  8477. sectionType := Sections.InlineCodeSection;
  8478. ELSE
  8479. sectionType := Sections.CodeSection;
  8480. END;
  8481. IF x.externalName # NIL THEN
  8482. Basic.ToSegmentedName(x.externalName^, name);
  8483. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8484. ELSE
  8485. GetCodeSectionNameForSymbol(x, name);
  8486. IF (x.scope.ownerModule = module.module) THEN
  8487. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8488. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8489. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8490. IF source.pc = 0 THEN (* no code yet *)
  8491. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8492. END;
  8493. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8494. bits := x.procedureScope.body.code.inlineCode;
  8495. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8496. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8497. binary.CopyBits(bits, 0, bits.GetSize());
  8498. source.SetResolved(binary);
  8499. ELSE
  8500. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8501. END;
  8502. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8503. END;
  8504. InitOperand(operand,ModeValue);
  8505. operand.op := reg;
  8506. operand.tag := tag;
  8507. IF Trace THEN TraceExit("StaticCallOperand") END;
  8508. END StaticCallOperand;
  8509. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8510. (* handle expressions of the form designator.procedure or procedure *)
  8511. BEGIN
  8512. IF Trace THEN TraceEnter("VisitProcedure") END;
  8513. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8514. DynamicCallOperand(result,x);
  8515. ELSIF x.isInline THEN
  8516. StaticCallOperand(result,x);
  8517. ELSE
  8518. StaticCallOperand(result,x);
  8519. END;
  8520. IF Trace THEN TraceExit("VisitProcedure") END;
  8521. END VisitProcedure;
  8522. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8523. BEGIN
  8524. VisitProcedure(x);
  8525. END VisitOperator;
  8526. (** statements *)
  8527. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8528. BEGIN
  8529. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8530. Expression(x.call);
  8531. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8532. ReleaseOperand(result)
  8533. END;
  8534. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8535. END VisitProcedureCallStatement;
  8536. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8537. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8538. leftBase, rightBase: SyntaxTree.Type;
  8539. procedureName,s: SyntaxTree.IdentifierString;
  8540. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8541. size: LONGINT; rightKind: LONGINT;
  8542. dummy: IntermediateCode.Operand;
  8543. CONST moduleName = "FoxArrayBase";
  8544. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8545. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8546. BEGIN
  8547. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8548. IF base IS SyntaxTree.MathArrayType THEN
  8549. base := OpenArray(base(SyntaxTree.MathArrayType));
  8550. END;
  8551. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8552. result.SetArrayBase(base);
  8553. RETURN result
  8554. END OpenArray;
  8555. BEGIN
  8556. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8557. SaveRegisters();ReleaseUsedRegisters(saved);
  8558. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8559. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8560. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8561. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8562. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8563. IF leftType.form = SyntaxTree.Tensor THEN
  8564. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8565. ELSIF leftType.form = SyntaxTree.Open THEN
  8566. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8567. ELSIF leftType.form = SyntaxTree.Static THEN
  8568. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8569. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8570. END;
  8571. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8572. IF procedure = NIL THEN
  8573. s := "Instruction not supported on target, emulation procedure ";
  8574. Strings.Append(s,moduleName);
  8575. Strings.Append(s,".");
  8576. Strings.Append(s,procedureName);
  8577. Strings.Append(s," not present");
  8578. Error(position,s);
  8579. ELSE
  8580. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8581. parameter.SetType(leftType);
  8582. parameter.SetAccess(SyntaxTree.Internal);
  8583. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8584. parameter.SetKind(rightKind);
  8585. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8586. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8587. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8588. StaticCallOperand(result,procedure);
  8589. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8590. ReleaseOperand(result);
  8591. END;
  8592. RestoreRegisters(saved);
  8593. END;
  8594. END AssignMathArray;
  8595. VAR modifyAssignmentCounter := 0: LONGINT;
  8596. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8597. VAR processor,mem,dst: IntermediateCode.Operand;
  8598. BEGIN
  8599. IF value.intValue = true.intValue THEN
  8600. INC(modifyAssignmentCounter);
  8601. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8602. modifyAssignmentsPC := section.pc;
  8603. ELSE
  8604. DEC(modifyAssignmentCounter);
  8605. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8606. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8607. END;
  8608. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8609. dst := NewRegisterOperand (addressType);
  8610. Emit(Mov(position,dst, processor));
  8611. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8612. Emit(Mov(position,mem, value));
  8613. ReleaseIntermediateOperand(dst);
  8614. END ModifyAssignments;
  8615. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8616. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8617. BEGIN
  8618. type := left.type.resolved;
  8619. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8620. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8621. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8622. IF procedureType.returnParameter = parameter THEN
  8623. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8624. END;
  8625. END;
  8626. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8627. END CopySize;
  8628. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8629. VAR
  8630. leftO, rightO: Operand;
  8631. mem, sizeOp: IntermediateCode.Operand;
  8632. leftType, rightType, componentType: SyntaxTree.Type;
  8633. size: LONGINT;
  8634. parameters: SyntaxTree.ExpressionList;
  8635. procedure: SyntaxTree.Procedure;
  8636. call: SyntaxTree.ProcedureCallDesignator;
  8637. designator: SyntaxTree.Designator;
  8638. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8639. VAR procedureType: SyntaxTree.ProcedureType;
  8640. BEGIN
  8641. IF ReturnedAsParameter(right.type) THEN
  8642. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8643. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8644. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8645. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8646. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8647. IF right.id = Global.Reshape THEN RETURN TRUE
  8648. END;
  8649. END;
  8650. END;
  8651. END;
  8652. RETURN FALSE
  8653. END CanPassAsResultParameter;
  8654. BEGIN
  8655. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8656. leftType := left.type.resolved; rightType:= right.type.resolved;
  8657. IF backend.cooperative & left.NeedsTrace() THEN
  8658. ModifyAssignments(true);
  8659. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8660. Designate(right, rightO);
  8661. Designate(left, leftO);
  8662. ASSERT(leftO.mode = ModeReference);
  8663. TransferToRegister(leftO.op, leftO.op);
  8664. TransferToRegister(rightO.op, rightO.op);
  8665. Emit(Push(position, leftO.op));
  8666. Emit(Push(position, rightO.op));
  8667. CallAssignMethod(leftO.op, rightO.op, left.type);
  8668. Emit(Pop(position, rightO.op));
  8669. Emit(Pop(position, leftO.op));
  8670. sizeOp := CopySize(left);
  8671. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8672. ReleaseOperand(leftO);
  8673. ReleaseOperand(rightO);
  8674. ELSE
  8675. Evaluate(right,rightO);
  8676. Designate(left,leftO);
  8677. ASSERT(leftO.mode = ModeReference);
  8678. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8679. (* copy procedure address first *)
  8680. MakeMemory(mem,leftO.op,addressType,0);
  8681. Emit(Mov(position,mem,rightO.op));
  8682. ReleaseIntermediateOperand(mem);
  8683. (* copy pointer address *)
  8684. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8685. CallAssignPointer(leftO.tag, rightO.tag);
  8686. ELSE
  8687. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8688. CallAssignPointer(leftO.op, rightO.op);
  8689. END;
  8690. ReleaseOperand(leftO);
  8691. ReleaseOperand(rightO);
  8692. END;
  8693. ModifyAssignments(false);
  8694. RETURN;
  8695. END;
  8696. IF CanPassAsResultParameter(right) THEN
  8697. procedureResultDesignator := left(SyntaxTree.Designator);
  8698. Expression(right);
  8699. procedureResultDesignator := NIL;
  8700. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8701. (* left <-- ALIAS OF right: zerocopy *)
  8702. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8703. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8704. designator.SetType(procedure.type);
  8705. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8706. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8707. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8708. END;
  8709. ELSIF leftType IS SyntaxTree.RangeType THEN
  8710. (* LHS is of array range type *)
  8711. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8712. Evaluate(right, rightO);
  8713. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8714. (* first *)
  8715. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8716. Emit(Mov(position,mem, rightO.op));
  8717. ReleaseIntermediateOperand(mem);
  8718. (* last *)
  8719. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8720. Emit(Mov(position,mem, rightO.tag));
  8721. ReleaseIntermediateOperand(mem);
  8722. (* step *)
  8723. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8724. Emit(Mov(position,mem, rightO.extra));
  8725. ReleaseIntermediateOperand(mem);
  8726. ReleaseOperand(rightO);
  8727. ReleaseOperand(leftO)
  8728. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8729. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8730. Evaluate(right, rightO);
  8731. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8732. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8733. (* real part *)
  8734. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8735. Emit(Mov(position,mem, rightO.op));
  8736. ReleaseIntermediateOperand(mem);
  8737. (* imaginary part *)
  8738. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8739. Emit(Mov(position,mem, rightO.tag));
  8740. ReleaseIntermediateOperand(mem);
  8741. ReleaseOperand(rightO);
  8742. ReleaseOperand(leftO)
  8743. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8744. OR (leftType IS SyntaxTree.PortType) THEN
  8745. (* rightO := leftO;*)
  8746. Evaluate(right,rightO);
  8747. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8748. Designate(left,leftO);
  8749. IF leftO.mode = ModeReference THEN
  8750. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8751. destination := mem;
  8752. ELSE
  8753. destination := leftO.op;
  8754. END;
  8755. ReleaseOperand(leftO);
  8756. IF destination.mode # IntermediateCode.Undefined THEN
  8757. Emit(Mov(position,destination,rightO.op));
  8758. END;
  8759. ReleaseOperand(rightO);
  8760. ReleaseIntermediateOperand(mem);
  8761. IntermediateCode.InitOperand(destination);
  8762. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8763. Evaluate(right,rightO);
  8764. Designate(left,leftO);
  8765. MakeMemory(mem,leftO.op,addressType,0);
  8766. Emit(Mov(position,mem,rightO.op));
  8767. ReleaseIntermediateOperand(mem);
  8768. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8769. (* delegate *)
  8770. (*
  8771. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8772. *)
  8773. Emit(Mov(position,leftO.tag,rightO.tag));
  8774. END;
  8775. ReleaseOperand(leftO);
  8776. ReleaseOperand(rightO);
  8777. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8778. Designate(right,rightO);
  8779. Designate(left,leftO);
  8780. sizeOp := CopySize(left);
  8781. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8782. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8783. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8784. IF (rightType IS SyntaxTree.StringType) THEN
  8785. CopyString(left,right);
  8786. 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
  8787. Designate(right,rightO);
  8788. Designate(left,leftO);
  8789. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8790. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8791. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8792. ELSE
  8793. HALT(201)
  8794. END;
  8795. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8796. AssignMathArray(left,right);
  8797. ELSE
  8798. HALT(200);
  8799. END;
  8800. END Assign;
  8801. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8802. BEGIN
  8803. IF Trace THEN TraceEnter("VisitAssignment") END;
  8804. Assign(x.left,x.right);
  8805. IF Trace THEN TraceExit("VisitAssignment") END;
  8806. END VisitAssignment;
  8807. PROCEDURE EmitCooperativeSwitch;
  8808. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8809. BEGIN
  8810. ASSERT (cooperativeSwitches);
  8811. pc := section.pc;
  8812. IF lastSwitchPC = section.pc THEN RETURN END;
  8813. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8814. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8815. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8816. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  8817. INC(statCoopSwitch, section.pc - pc);
  8818. END EmitCooperativeSwitch;
  8819. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8820. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  8821. BEGIN
  8822. p0 := communication.left; p1 := communication.right;
  8823. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  8824. Evaluate(p0,s0);
  8825. Evaluate(p1,s1);
  8826. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8827. Emit(Push(position,s0.op));
  8828. Emit(Push(position,s1.op));
  8829. (*
  8830. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8831. *)
  8832. IF ~backend.cellsAreObjects THEN
  8833. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  8834. END;
  8835. ReleaseOperand(s0);
  8836. ReleaseOperand(s1);
  8837. IF backend.cellsAreObjects THEN
  8838. CallThis(position,"ActiveCellsRuntime","Send",2);
  8839. ELSE
  8840. CallThis(position,ChannelModuleName,"Send",2);
  8841. END;
  8842. (* ----- RECEIVE ------*)
  8843. ELSE
  8844. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  8845. tmp := p0; p0 := p1; p1 := tmp;
  8846. END;
  8847. Evaluate(p0,s0);
  8848. Emit(Push(position,s0.op));
  8849. Designate(p1,s1);
  8850. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8851. Emit(Push(position,s1.op));
  8852. (*
  8853. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8854. *)
  8855. IF ~backend.cellsAreObjects THEN
  8856. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  8857. END;
  8858. ReleaseOperand(s0);
  8859. ReleaseOperand(s1);
  8860. IF backend.cellsAreObjects THEN
  8861. CallThis(position,"ActiveCellsRuntime","Receive",2);
  8862. ELSE
  8863. CallThis(position,ChannelModuleName,"Receive",2)
  8864. END;
  8865. END;
  8866. END VisitCommunicationStatement;
  8867. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  8868. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  8869. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  8870. VAR true, false: Label; condition, value: BOOLEAN;
  8871. BEGIN
  8872. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  8873. IF condition THEN
  8874. true := NewLabel();
  8875. false := NewLabel();
  8876. Condition(if.condition,true,false);
  8877. SetLabel(true);
  8878. StatementSequence(if.statements);
  8879. BrL(end);
  8880. SetLabel(false);
  8881. ELSE
  8882. IF value THEN (* always true *)
  8883. escape := TRUE;
  8884. StatementSequence(if.statements);
  8885. (* no branch necessary -- rest skipped *)
  8886. END;
  8887. END;
  8888. END IfPart;
  8889. BEGIN
  8890. IF Trace THEN TraceEnter("VisitIfStatement") END;
  8891. end := NewLabel();
  8892. elsifs := x.ElsifParts();
  8893. IfPart(x.ifPart);
  8894. FOR i := 0 TO elsifs-1 DO
  8895. IF ~escape THEN
  8896. elsif := x.GetElsifPart(i);
  8897. IfPart(elsif);
  8898. END;
  8899. END;
  8900. IF (x.elsePart # NIL) & ~escape THEN
  8901. StatementSequence(x.elsePart);
  8902. END;
  8903. SetLabel(end);
  8904. IF Trace THEN TraceExit("VisitIfStatement") END;
  8905. END VisitIfStatement;
  8906. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  8907. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  8908. BEGIN
  8909. (*IF x.variable.type.resolved = x.type.resolved THEN
  8910. (* always true, do nothing *)
  8911. ELSE*)
  8912. Designate(x.variable,res);
  8913. IF IsPointerToRecord(x.variable.type,recordType) THEN
  8914. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  8915. END;
  8916. trueL := NewLabel();
  8917. TypeTest(res.tag,x.type,trueL,falseL);
  8918. ReleaseOperand(res);
  8919. SetLabel(trueL);
  8920. StatementSequence(x.statements);
  8921. BrL(endL);
  8922. END WithPart;
  8923. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  8924. VAR endL,falseL: Label;i: LONGINT;
  8925. BEGIN
  8926. IF Trace THEN TraceEnter("VisitWithStatement") END;
  8927. endL := NewLabel();
  8928. FOR i := 0 TO x.WithParts()-1 DO
  8929. falseL := NewLabel();
  8930. WithPart(x.GetWithPart(i),falseL,endL);
  8931. SetLabel(falseL);
  8932. END;
  8933. IF x.elsePart = NIL THEN
  8934. IF ~isUnchecked THEN
  8935. EmitTrap(position,WithTrap);
  8936. END;
  8937. ELSE
  8938. StatementSequence(x.elsePart)
  8939. END;
  8940. SetLabel(endL);
  8941. IF Trace THEN TraceExit("VisitWithStatement") END;
  8942. END VisitWithStatement;
  8943. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  8944. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  8945. out,else: Label; label: Label;
  8946. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  8947. symbol: SyntaxTree.Symbol;
  8948. BEGIN
  8949. (*! split case statement into if-elsif statements for large case label lists *)
  8950. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  8951. size := x.max-x.min+1;
  8952. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  8953. END;
  8954. Evaluate(x.variable,var);
  8955. ReuseCopy(tmp,var.op);
  8956. ReleaseIntermediateOperand(var.op);
  8957. var.op := tmp;
  8958. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  8959. Convert(var.op,addressType);
  8960. size := x.max-x.min+1;
  8961. else := NewLabel();
  8962. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  8963. (*
  8964. UniqueId(name,module.module,"case",caseId);
  8965. *)
  8966. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  8967. Global.GetModuleSegmentedName(module.module, name);
  8968. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  8969. symbol := SyntaxTree.NewSymbol(name[1]);
  8970. symbol.SetScope(moduleScope);
  8971. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  8972. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  8973. section.isCaseTable := TRUE;
  8974. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  8975. ReuseCopy(res,var.op);
  8976. ReleaseOperand(var);
  8977. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  8978. Emit(Add(position,res,res,jmp));
  8979. IntermediateCode.MakeMemory(res,addressType);
  8980. Emit(Br(position,res));
  8981. ReleaseIntermediateOperand(res);
  8982. out := NewLabel();
  8983. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  8984. part := x.GetCasePart(i);
  8985. constant := part.firstConstant;
  8986. label := NewLabel();
  8987. SetLabel(label);
  8988. WHILE(constant # NIL) DO (* case labels for this case part *)
  8989. FOR j := constant.min TO constant.max DO
  8990. fixups[j-x.min] := label;
  8991. END;
  8992. constant := constant.next;
  8993. END;
  8994. StatementSequence(part.statements);
  8995. BrL(out);
  8996. END;
  8997. SetLabel(else);
  8998. FOR i := 0 TO size-1 DO
  8999. IF fixups[i] = NIL THEN
  9000. fixups[i] := else;
  9001. END;
  9002. END;
  9003. IF x.elsePart # NIL THEN
  9004. StatementSequence(x.elsePart);
  9005. ELSIF ~isUnchecked THEN
  9006. EmitTrap(position,CaseTrap);
  9007. END;
  9008. SetLabel(out);
  9009. FOR i := 0 TO size-1 DO
  9010. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9011. section.Emit(Data(position,op));
  9012. END;
  9013. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9014. END VisitCaseStatement;
  9015. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9016. VAR start: Label; true,false: Label;
  9017. BEGIN
  9018. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9019. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9020. start := NewLabel();
  9021. true := NewLabel();
  9022. false := NewLabel();
  9023. SetLabel(start);
  9024. Condition(x.condition,true,false);
  9025. SetLabel(true);
  9026. StatementSequence(x.statements);
  9027. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9028. BrL(start);
  9029. SetLabel(false);
  9030. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9031. END VisitWhileStatement;
  9032. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9033. VAR false,true: Label;
  9034. BEGIN
  9035. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9036. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9037. true := NewLabel();
  9038. false := NewLabel();
  9039. SetLabel(false);
  9040. StatementSequence(x.statements);
  9041. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9042. Condition(x.condition,true,false);
  9043. SetLabel(true);
  9044. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9045. END VisitRepeatStatement;
  9046. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9047. VAR
  9048. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9049. temporaryVariable: SyntaxTree.Variable;
  9050. temporaryVariableDesignator : SyntaxTree.Designator;
  9051. BEGIN
  9052. IF Trace THEN TraceEnter("VisitForStatement") END;
  9053. true := NewLabel();
  9054. false := NewLabel();
  9055. start := NewLabel();
  9056. Assign(x.variable,x.from);
  9057. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9058. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9059. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9060. Assign(temporaryVariableDesignator,x.to);
  9061. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9062. IF by > 0 THEN
  9063. cmp := Scanner.LessEqual
  9064. ELSE
  9065. cmp := Scanner.GreaterEqual
  9066. END;
  9067. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9068. binary.SetType(system.booleanType);
  9069. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9070. SetLabel(start);
  9071. Condition(binary,true,false);
  9072. SetLabel(true);
  9073. StatementSequence(x.statements);
  9074. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9075. binary.SetType(x.variable.type);
  9076. Assign(x.variable,binary);
  9077. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9078. BrL(start);
  9079. SetLabel(false);
  9080. IF Trace THEN TraceExit("VisitForStatement") END;
  9081. END VisitForStatement;
  9082. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9083. VAR prevLoop: Label;
  9084. BEGIN
  9085. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9086. prevLoop := currentLoop;
  9087. currentLoop := NewLabel();
  9088. StatementSequence(x.statements);
  9089. SetLabel(currentLoop);
  9090. currentLoop := prevLoop;
  9091. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9092. END VisitExitableBlock;
  9093. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9094. VAR prevLoop,start: Label;
  9095. BEGIN
  9096. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9097. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9098. start := NewLabel();
  9099. prevLoop := currentLoop;
  9100. SetLabel(start);
  9101. currentLoop := NewLabel();
  9102. StatementSequence(x.statements);
  9103. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9104. BrL(start);
  9105. SetLabel(currentLoop);
  9106. currentLoop := prevLoop;
  9107. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9108. END VisitLoopStatement;
  9109. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9110. VAR outer: SyntaxTree.Statement;
  9111. BEGIN
  9112. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9113. IF locked THEN (* r if we jump out of an exclusive block *)
  9114. outer := x.outer;
  9115. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9116. outer := outer.outer;
  9117. END;
  9118. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9119. Lock(FALSE);
  9120. END;
  9121. END;
  9122. BrL(currentLoop);
  9123. IF Trace THEN TraceExit("VisitExitStatement") END;
  9124. END VisitExitStatement;
  9125. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9126. VAR
  9127. expression, parameterDesignator: SyntaxTree.Expression;
  9128. type, componentType: SyntaxTree.Type;
  9129. res, right: Operand;
  9130. left, mem, reg: IntermediateCode.Operand;
  9131. parameter: SyntaxTree.Parameter;
  9132. procedure: SyntaxTree.Procedure;
  9133. procedureType: SyntaxTree.ProcedureType;
  9134. returnTypeOffset: LONGINT;
  9135. delegate: BOOLEAN;
  9136. map: SymbolMap;
  9137. BEGIN
  9138. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9139. expression := x.returnValue;
  9140. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9141. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9142. IF currentIsInline THEN
  9143. IF expression # NIL THEN
  9144. map := currentMapper.Get(NIL);
  9145. IF map # NIL THEN
  9146. Assign(map.to, expression);
  9147. END;
  9148. END;
  9149. BrL(currentInlineExit);
  9150. RETURN;
  9151. END;
  9152. IF expression # NIL THEN
  9153. type := expression.type.resolved;
  9154. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9155. IF locked THEN Lock(FALSE) END;
  9156. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9157. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9158. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9159. (* return without structured return parameter *)
  9160. Evaluate(expression,res);
  9161. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9162. IF locked OR profile THEN
  9163. Emit(Push(position,res.op));
  9164. IF delegate THEN HALT(200) END;
  9165. ReleaseOperand(res);
  9166. IF locked THEN Lock(FALSE) END;
  9167. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9168. reg := NewRegisterOperand(res.op.type);
  9169. Emit(Pop(position,reg));
  9170. Emit(Return(position,reg));
  9171. ReleaseIntermediateOperand(reg);
  9172. ELSE
  9173. Emit(Return(position,res.op));
  9174. ReleaseOperand(res);
  9175. END;
  9176. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9177. THEN
  9178. (* return using structured return parameter *)
  9179. 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)
  9180. OR SemanticChecker.IsPointerType(type));
  9181. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9182. parameter :=procedureType.returnParameter;
  9183. ASSERT(parameter # NIL);
  9184. returnTypeOffset := parameter.offsetInBits;
  9185. (*
  9186. IF parameter# NIL THEN
  9187. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9188. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9189. ELSE
  9190. returnTypeOffset := system.offsetFirstParameter
  9191. END;
  9192. *)
  9193. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9194. IF type IS SyntaxTree.RangeType THEN
  9195. (* array range type *)
  9196. Evaluate(expression, right);
  9197. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9198. Emit(Mov(position,mem, right.op)); (* first *)
  9199. ReleaseIntermediateOperand(mem);
  9200. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9201. Emit(Mov(position,mem, right.tag)); (* last *)
  9202. ReleaseIntermediateOperand(mem);
  9203. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9204. Emit(Mov(position,mem, right.extra)); (* step *)
  9205. ReleaseIntermediateOperand(mem);
  9206. ReleaseOperand(right);
  9207. ELSIF type IS SyntaxTree.ComplexType THEN
  9208. Evaluate(expression, right);
  9209. componentType := type(SyntaxTree.ComplexType).componentType;
  9210. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9211. Emit(Mov(position,mem, right.op)); (* real part *)
  9212. ReleaseIntermediateOperand(mem);
  9213. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9214. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9215. ReleaseIntermediateOperand(mem);
  9216. ReleaseOperand(right);
  9217. ELSE (* covers cases: pointer / record / array *)
  9218. parameter := procedureType.returnParameter;
  9219. checker.SetCurrentScope(currentScope);
  9220. ASSERT(parameter # NIL);
  9221. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9222. Assign(parameterDesignator,expression);
  9223. END;
  9224. ReleaseIntermediateOperand(left);
  9225. IF locked THEN Lock(FALSE) END;
  9226. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9227. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9228. parameter := procedureType.returnParameter;
  9229. checker.SetCurrentScope(currentScope);
  9230. IF parameter = NIL THEN
  9231. Error(procedure.position, "structured return of parameter of procedure not found");
  9232. ELSE
  9233. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9234. Assign(parameterDesignator,expression);
  9235. END;
  9236. IF locked THEN Lock(FALSE) END;
  9237. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9238. ELSE
  9239. HALT(200);
  9240. END;
  9241. ELSE
  9242. IF locked THEN Lock(FALSE) END;
  9243. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9244. END;
  9245. IF backend.cooperative THEN
  9246. BrL(exitLabel);
  9247. ELSE
  9248. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9249. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9250. END;
  9251. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9252. END VisitReturnStatement;
  9253. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9254. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9255. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9256. statements: SyntaxTree.StatementSequence;
  9257. name, suffix: SyntaxTree.IdentifierString;
  9258. BEGIN
  9259. Strings.IntToStr(awaitProcCounter,suffix);
  9260. Strings.Concat("@AwaitProcedure",suffix,name);
  9261. identifier := SyntaxTree.NewIdentifier(name);
  9262. INC(awaitProcCounter);
  9263. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9264. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9265. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9266. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9267. procedure.SetAccess(SyntaxTree.Hidden);
  9268. procedure.SetScope(currentScope);
  9269. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9270. procedureType.SetReturnType(system.booleanType);
  9271. procedure.SetType(procedureType);
  9272. body := SyntaxTree.NewBody(x.position,procedureScope);
  9273. procedureScope.SetBody(body);
  9274. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9275. returnStatement.SetReturnValue(x.condition);
  9276. statements := SyntaxTree.NewStatementSequence();
  9277. statements.AddStatement(returnStatement);
  9278. body.SetStatementSequence(statements);
  9279. currentScope.AddProcedure(procedure);
  9280. RETURN procedure
  9281. END MakeAwaitProcedure;
  9282. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9283. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9284. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9285. BEGIN
  9286. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9287. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9288. IF backend.cooperative THEN
  9289. start := NewLabel();
  9290. true := NewLabel();
  9291. false := NewLabel();
  9292. SetLabel(start);
  9293. Condition(x.condition,true,false);
  9294. SetLabel(false);
  9295. PushSelfPointer();
  9296. CallThis(position,"ExclusiveBlocks","Await",1);
  9297. BrL(start);
  9298. SetLabel(true);
  9299. PushSelfPointer();
  9300. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9301. ELSE
  9302. proc := MakeAwaitProcedure(x);
  9303. Emit(Push(position,fp));
  9304. GetCodeSectionNameForSymbol(proc,name);
  9305. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9306. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9307. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9308. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9309. Emit(Result(position,res));
  9310. (*
  9311. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9312. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9313. *)
  9314. InitOperand(result,ModeValue);
  9315. result.op := res;
  9316. label := NewLabel();
  9317. BreqL(label, result.op, SELF.true);
  9318. ReleaseOperand(result);
  9319. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9320. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9321. Emit(Push(position,res));
  9322. Emit(Push(position,fp));
  9323. PushSelfPointer();
  9324. Emit(Push(position,nil));
  9325. CallThis(position,"Objects","Await",4);
  9326. SetLabel(label);
  9327. END;
  9328. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9329. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9330. END VisitAwaitStatement;
  9331. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9332. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9333. BEGIN
  9334. FOR i := 0 TO x.Length() - 1 DO
  9335. statement := x.GetStatement( i );
  9336. Statement(statement);
  9337. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9338. END;
  9339. END StatementSequence;
  9340. PROCEDURE PushSelfPointer;
  9341. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9342. BEGIN
  9343. scope := currentScope;
  9344. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9345. scope := scope.outerScope;
  9346. END;
  9347. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9348. IF ~newObjectFile THEN
  9349. Symbol(moduleSelf,op);
  9350. IntermediateCode.MakeMemory(op.op,addressType);
  9351. ELSE
  9352. moduleSection := meta.ModuleSection();
  9353. IF backend.cooperative THEN
  9354. moduleOffset := 0;
  9355. ELSE
  9356. moduleOffset := moduleSection.pc;
  9357. END;
  9358. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9359. END;
  9360. ELSE
  9361. GetBaseRegister(op.op,currentScope,scope);
  9362. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9363. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9364. IF backend.cooperative THEN
  9365. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9366. END;
  9367. IntermediateCode.MakeMemory(op.op,addressType);
  9368. END;
  9369. Emit(Push(position,op.op));
  9370. ReleaseOperand(op);
  9371. END PushSelfPointer;
  9372. PROCEDURE Lock(lock: BOOLEAN);
  9373. BEGIN
  9374. IF Trace THEN TraceEnter("Lock") END;
  9375. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9376. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9377. ASSERT(modifyAssignmentCounter = 0);
  9378. IF dump # NIL THEN
  9379. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9380. dump.Ln;dump.Update;
  9381. END;
  9382. PushSelfPointer;
  9383. IF backend.cooperative THEN
  9384. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9385. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9386. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9387. END;
  9388. ELSE
  9389. Emit(Push(position,true));
  9390. IF lock THEN CallThis(position,"Objects","Lock",2)
  9391. ELSE CallThis(position,"Objects","Unlock",2);
  9392. END;
  9393. END;
  9394. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9395. IF Trace THEN TraceExit("Lock") END;
  9396. END Lock;
  9397. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9398. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9399. BEGIN
  9400. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9401. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9402. previouslyUnchecked := isUnchecked;
  9403. isUnchecked := isUnchecked OR x.isUnchecked;
  9404. previouslyCooperativeSwitches := cooperativeSwitches;
  9405. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9406. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9407. IF x.statements # NIL THEN
  9408. StatementSequence(x.statements);
  9409. END;
  9410. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9411. isUnchecked := previouslyUnchecked;
  9412. cooperativeSwitches := previouslyCooperativeSwitches;
  9413. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9414. END VisitStatementBlock;
  9415. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9416. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9417. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9418. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9419. procedure: SyntaxTree.Procedure;
  9420. map: SymbolMap;
  9421. BEGIN
  9422. scope := currentScope;
  9423. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9424. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9425. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9426. return := emptyOperand;
  9427. IF Trace THEN TraceEnter("VisitCode") END;
  9428. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9429. NEW(in, x.inRules.Length());
  9430. FOR i := 0 TO LEN(in)-1 DO
  9431. statement := x.inRules.GetStatement(i);
  9432. WITH statement: SyntaxTree.Assignment DO
  9433. Evaluate(statement.right, operand);
  9434. result := operand.op;
  9435. NEW(str, 64);
  9436. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9437. in[i] := result; IntermediateCode.SetString(in[i], str);
  9438. ReleaseIntermediateOperand(operand.tag);
  9439. END;
  9440. END;
  9441. ELSE in := NIL
  9442. END;
  9443. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9444. NEW(out, x.outRules.Length());
  9445. FOR i := 0 TO LEN(out)-1 DO
  9446. statement := x.outRules.GetStatement(i);
  9447. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9448. WITH statement: SyntaxTree.Assignment DO
  9449. Evaluate(statement.left, operand); (*?? or designate *)
  9450. result := operand.op;
  9451. NEW(str, 64);
  9452. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9453. out[i] := result; IntermediateCode.SetString(out[i], str);
  9454. ReleaseIntermediateOperand(operand.tag);
  9455. |statement: SyntaxTree.ReturnStatement DO
  9456. NEW(str, 64);
  9457. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9458. IF currentIsInline THEN
  9459. map := currentMapper.Get(NIL);
  9460. Evaluate(map.to, operand);
  9461. out[i] := operand.op;
  9462. ELSE
  9463. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9464. END;
  9465. IntermediateCode.SetString(out[i], str);
  9466. ReleaseIntermediateOperand(operand.tag);
  9467. return := out[i];
  9468. ELSE
  9469. END;
  9470. END;
  9471. ELSE out := NIL
  9472. END;
  9473. Emit(Asm(x.position,x.sourceCode, in, out));
  9474. IF in # NIL THEN
  9475. FOR i := 0 TO LEN(in)-1 DO
  9476. ReleaseIntermediateOperand(in[i]);
  9477. END;
  9478. END;
  9479. IF out # NIL THEN
  9480. FOR i := 0 TO LEN(out)-1 DO
  9481. WITH statement: SyntaxTree.Assignment DO
  9482. ReleaseIntermediateOperand(out[i]);
  9483. ELSE
  9484. IF currentIsInline THEN
  9485. ReleaseIntermediateOperand(out[i]);
  9486. END;
  9487. END;
  9488. statement := x.outRules.GetStatement(i);
  9489. END;
  9490. END;
  9491. IF return.mode # IntermediateCode.Undefined THEN
  9492. IF currentIsInline THEN
  9493. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9494. Symbol(procedureType.returnParameter, par);
  9495. MakeMemory(mem, par.op, return.type, 0);
  9496. ReleaseOperand(par);
  9497. Emit(Mov(position, mem, return));
  9498. ReleaseIntermediateOperand(mem);
  9499. ELSE
  9500. Emit(Return(position,return));
  9501. END;
  9502. IF currentIsInline THEN RETURN END;
  9503. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9504. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9505. ReleaseIntermediateOperand(return);
  9506. END;
  9507. IF Trace THEN TraceExit("VisitCode") END;
  9508. END VisitCode;
  9509. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9510. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9511. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9512. const, call: IntermediateCode.Operand;
  9513. parameterDesignator: SyntaxTree.Expression;
  9514. saved: RegisterEntry;
  9515. name: Basic.SegmentedName;
  9516. BEGIN
  9517. IF Trace THEN TraceEnter("ParameterCopies") END;
  9518. parameter := x.firstParameter;
  9519. WHILE parameter # NIL DO
  9520. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9521. type := parameter.type.resolved;
  9522. IF IsOpenArray(type) THEN
  9523. VisitParameter(parameter);
  9524. op := result;
  9525. IF backend.cooperative & parameter.NeedsTrace() THEN
  9526. length := GetArrayLength(type, op.tag);
  9527. size := NewRegisterOperand(addressType);
  9528. base := ArrayBaseType(type);
  9529. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9530. Emit(Mul(position, size, length, const));
  9531. dst := NewRegisterOperand (addressType);
  9532. Emit(Mov(position, dst, size));
  9533. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9534. Emit(Sub(position,dst,sp,dst));
  9535. Emit(And(position,dst,dst,const));
  9536. Emit(Mov(position,sp,dst));
  9537. par := fp;
  9538. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9539. IntermediateCode.InitImmediate(null, byteType, 0);
  9540. Emit(Fill(position, dst, size, null));
  9541. ReleaseIntermediateOperand(dst);
  9542. ReleaseIntermediateOperand(length);
  9543. SaveRegisters();ReleaseUsedRegisters(saved);
  9544. (* register dst has been freed before SaveRegisters already *)
  9545. base := ArrayBaseType(type);
  9546. (* assign method of open array *)
  9547. IF base.IsRecordType() THEN
  9548. Emit (Push(position, length));
  9549. Emit (Push(position, dst));
  9550. Emit (Push(position, op.op));
  9551. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9552. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9553. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9554. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9555. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9556. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9557. Emit (Push(position,length));
  9558. Emit (Push(position, dst));
  9559. Emit (Push(position, length));
  9560. Emit (Push(position, op.op));
  9561. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9562. ELSE
  9563. Emit (Push(position, length));
  9564. Emit (Push(position, dst));
  9565. Emit (Push(position, length));
  9566. Emit (Push(position, op.op));
  9567. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9568. ASSERT(ArrayBaseType(type).IsPointer());
  9569. END;
  9570. RestoreRegisters(saved);
  9571. ELSE
  9572. temp := GetDynamicSize(type,op.tag);
  9573. ReuseCopy(size,temp);
  9574. ReleaseIntermediateOperand(temp);
  9575. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9576. Emit(Sub(position,size,sp,size));
  9577. Emit(And(position,size,size,const));
  9578. Emit(Mov(position,sp,size));
  9579. par := fp;
  9580. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9581. ReleaseIntermediateOperand(size);
  9582. size := GetDynamicSize(type,op.tag);
  9583. END;
  9584. Emit(Copy(position,sp,op.op,size));
  9585. ReleaseIntermediateOperand(size);
  9586. ReleaseOperand(op);
  9587. IntermediateCode.MakeMemory(par,addressType);
  9588. Emit(Mov(position,par,sp));
  9589. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9590. checker.SetCurrentScope(currentScope);
  9591. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9592. Assign(parameterDesignator,parameterDesignator);
  9593. END;
  9594. END;
  9595. parameter := parameter.nextParameter;
  9596. END;
  9597. IF Trace THEN TraceExit("ParameterCopies") END;
  9598. END ParameterCopies;
  9599. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9600. VAR x: SyntaxTree.Variable;
  9601. BEGIN
  9602. x := scope.firstVariable;
  9603. WHILE x # NIL DO
  9604. InitVariable(x);
  9605. x := x.nextVariable;
  9606. END;
  9607. END InitVariables;
  9608. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9609. BEGIN
  9610. IF (symbol # NIL) THEN
  9611. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9612. ELSE
  9613. RETURN 0
  9614. END;
  9615. END GetFingerprint;
  9616. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9617. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9618. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9619. saved: RegisterEntry;
  9620. BEGIN
  9621. IF Trace THEN TraceEnter("Body") END;
  9622. ReleaseUsedRegisters(saved); (* just in case ... *)
  9623. section := ir;
  9624. exitLabel := NewLabel ();
  9625. IF moduleBody THEN moduleBodySection := section END;
  9626. IF ir.comments # NIL THEN
  9627. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9628. commentPrintout.SingleStatement(TRUE);
  9629. dump := ir.comments;
  9630. ELSE
  9631. commentPrintout := NIL;
  9632. dump := NIL;
  9633. END;
  9634. prevScope := currentScope;
  9635. currentScope := scope;
  9636. lastSwitchPC := 0;
  9637. cooperativeSwitches := backend.cooperative;
  9638. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9639. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9640. IF x # NIL THEN
  9641. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9642. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9643. IF moduleBody THEN
  9644. ProfilerInit();
  9645. ELSE
  9646. Basic.SegmentedNameToString(ir.name, string);
  9647. ProfilerAddProcedure(numberProcedures,string);
  9648. ProfilerEnterExit(numberProcedures,TRUE);
  9649. END;
  9650. END;
  9651. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9652. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9653. END;
  9654. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9655. IF moduleBody THEN
  9656. InitVariables(moduleScope)
  9657. END;
  9658. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9659. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9660. IF procedure = cellScope.bodyProcedure THEN
  9661. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9662. StaticCallOperand(op, cellScope.constructor);
  9663. Emit(Call(position,op.op,0));
  9664. END;
  9665. END;
  9666. END;
  9667. ParameterCopies(procedureType);
  9668. InitVariables(scope);
  9669. IF x.code = NIL THEN
  9670. VisitStatementBlock(x);
  9671. ELSE
  9672. VisitCode(x.code)
  9673. END;
  9674. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9675. ir.SetFinally(ir.pc);
  9676. StatementSequence(x.finally)
  9677. END;
  9678. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9679. IF ~backend.cooperative THEN
  9680. ProfilerEnterExit(numberProcedures,FALSE);
  9681. END;
  9682. INC(numberProcedures);
  9683. END;
  9684. END;
  9685. IF backend.cooperative THEN
  9686. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9687. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9688. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9689. (*! not required any more? check and delete!
  9690. PushSelfPointer();
  9691. CallThis(position,"Modules","SetInitialized",1);
  9692. *)
  9693. (*
  9694. SetLabel(end);
  9695. *)
  9696. END;
  9697. IF x # NIL THEN
  9698. SELF.position := x.position;
  9699. END;
  9700. CheckRegistersFree();
  9701. ASSERT(modifyAssignmentCounter = 0);
  9702. currentScope := prevScope;
  9703. IF Trace THEN TraceExit("Body") END;
  9704. END Body;
  9705. END ImplementationVisitor;
  9706. MetaDataGenerator=OBJECT
  9707. VAR
  9708. implementationVisitor: ImplementationVisitor;
  9709. declarationVisitor: DeclarationVisitor;
  9710. module: Sections.Module;
  9711. moduleName: ARRAY 128 OF CHAR;
  9712. moduleNamePool: Basic.HashTableInt;
  9713. moduleNamePoolSection: IntermediateCode.Section;
  9714. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9715. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9716. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9717. TypeTags: LONGINT; (* type extension level support *)
  9718. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9719. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9720. BEGIN
  9721. IF implementationVisitor.backend.cooperative THEN
  9722. TypeTags := MAX(LONGINT);
  9723. BaseTypesTableOffset := 0;
  9724. MethodTableOffset := 2;
  9725. TypeRecordBaseOffset := 0;
  9726. ELSIF simple THEN
  9727. TypeTags := 3; (* only 3 extensions allowed *)
  9728. BaseTypesTableOffset := 1;
  9729. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9730. TypeRecordBaseOffset := 0;
  9731. ELSE
  9732. TypeTags := 16;
  9733. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9734. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9735. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9736. END;
  9737. SELF.simple := simple;
  9738. SELF.implementationVisitor := implementationVisitor;
  9739. SELF.declarationVisitor := declarationVisitor;
  9740. implementationVisitor.meta := SELF;
  9741. declarationVisitor.meta := SELF;
  9742. END InitMetaDataGenerator;
  9743. PROCEDURE SetModule(module: Sections.Module);
  9744. VAR namePoolOffset: LONGINT;
  9745. BEGIN
  9746. SELF.module := module;
  9747. Global.GetModuleName(module.module,moduleName);
  9748. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9749. NEW(moduleNamePool, 32);
  9750. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9751. END;
  9752. END SetModule;
  9753. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9754. BEGIN
  9755. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9756. END GetTypeRecordBaseOffset;
  9757. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9758. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9759. BEGIN
  9760. INC(dataAdrOffset,6);
  9761. Info(section,"headerAdr");
  9762. Address(section,0);
  9763. Info(section,"typeDesc");
  9764. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9765. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9766. NamedSymbol(section, name, symbol, 0, offset);
  9767. Info(section,"mark: LONGINT;");
  9768. Longint(section,-1);
  9769. Info(section,"dataAdr-: ADDRESS");
  9770. Symbol(section,section, dataAdrOffset,0);
  9771. Info(section,"size-: SIZE");
  9772. Address(section,0);
  9773. Info(section,"nextRealtime: HeapBlock;");
  9774. Address(section,0);
  9775. END HeapBlock;
  9776. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9777. VAR i: LONGINT;
  9778. BEGIN
  9779. INC(dataAdrOffset,14);
  9780. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9781. Info(section,"count*: LONGINT");
  9782. Longint(section,0);
  9783. Info(section,"locked*: BOOLEAN");
  9784. Longint(section,0);
  9785. Info(section,"awaitingLock*: ProcessQueue");
  9786. Address(section,0);
  9787. Address(section,0);
  9788. Info(section,"awaitingCond*: ProcessQueue");
  9789. Address(section,0);
  9790. Address(section,0);
  9791. Info(section,"lockedBy*: ANY");
  9792. Address(section,0);
  9793. Info(section,"lock*: ANY");
  9794. Address(section,0);
  9795. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9796. Longint(section,1);
  9797. FOR i := 2 TO 6 DO
  9798. Longint(section,0);
  9799. END;
  9800. END ProtectedHeapBlock;
  9801. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9802. BEGIN
  9803. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9804. END Info;
  9805. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9806. VAR op: IntermediateCode.Operand;
  9807. BEGIN
  9808. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9809. section.Emit(Data(-11,op));
  9810. END Address;
  9811. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9812. VAR op: IntermediateCode.Operand;
  9813. BEGIN
  9814. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9815. section.Emit(Data(-12,op));
  9816. END Size;
  9817. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9818. VAR op: IntermediateCode.Operand;
  9819. BEGIN
  9820. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9821. section.Emit(Data(-1,op));
  9822. END Set;
  9823. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9824. VAR op: IntermediateCode.Operand;
  9825. BEGIN
  9826. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9827. section.Emit(Data(-1,op));
  9828. END Longint;
  9829. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  9830. VAR op,noOperand: IntermediateCode.Operand;
  9831. BEGIN
  9832. IntermediateCode.InitOperand(noOperand);
  9833. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9834. section.PatchOperands(pc,op,noOperand,noOperand);
  9835. END PatchLongint;
  9836. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9837. VAR op, noOperand: IntermediateCode.Operand;
  9838. BEGIN
  9839. IntermediateCode.InitOperand(noOperand);
  9840. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9841. section.PatchOperands(pc,op,noOperand,noOperand);
  9842. END PatchSymbol;
  9843. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  9844. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  9845. BEGIN
  9846. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  9847. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  9848. section.Emit(Data(-1,op));
  9849. END Boolean;
  9850. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  9851. VAR op: IntermediateCode.Operand;
  9852. BEGIN
  9853. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  9854. section.Emit(Data(-1,op));
  9855. END Char;
  9856. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  9857. VAR i: LONGINT;
  9858. BEGIN
  9859. Info(section,str);
  9860. i := 0;
  9861. WHILE(str[i] # 0X) DO
  9862. Char(section,str[i]);
  9863. INC(i);
  9864. END;
  9865. Char(section,0X);
  9866. END String;
  9867. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9868. VAR op: IntermediateCode.Operand;
  9869. BEGIN
  9870. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9871. IntermediateCode.SetOffset(op,realOffset);
  9872. section.Emit(Data(-1,op));
  9873. END NamedSymbol;
  9874. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  9875. BEGIN
  9876. IF symbol= NIL THEN
  9877. Address( section, realOffset);
  9878. ASSERT(virtualOffset = 0);
  9879. ELSE
  9880. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  9881. END;
  9882. END Symbol;
  9883. (* OutPointers delivers
  9884. {pointerOffset}
  9885. *)
  9886. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  9887. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  9888. BEGIN
  9889. type := type.resolved;
  9890. IF type IS SyntaxTree.AnyType THEN
  9891. Symbol(section, symbol, 0, (offset ));
  9892. INC(numberPointers);
  9893. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9894. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  9895. Symbol(section, symbol, 0, offset); INC(numberPointers);
  9896. ELSIF type IS SyntaxTree.PointerType THEN
  9897. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  9898. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  9899. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  9900. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  9901. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  9902. ELSIF (type IS SyntaxTree.RecordType) THEN
  9903. (* never treat a record like a pointer, even if the pointer field is set! *)
  9904. WITH type: SyntaxTree.RecordType DO
  9905. base := type.GetBaseRecord();
  9906. IF base # NIL THEN
  9907. Pointers(offset,symbol,section, base,numberPointers);
  9908. END;
  9909. variable := type.recordScope.firstVariable;
  9910. WHILE(variable # NIL) DO
  9911. IF ~(variable.untraced) THEN
  9912. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9913. END;
  9914. variable := variable.nextVariable;
  9915. END;
  9916. END;
  9917. ELSIF (type IS SyntaxTree.CellType) THEN
  9918. WITH type: SyntaxTree.CellType DO
  9919. base := type.GetBaseRecord();
  9920. IF base # NIL THEN
  9921. Pointers(offset,symbol,section, base,numberPointers);
  9922. END;
  9923. variable := type.cellScope.firstVariable;
  9924. WHILE(variable # NIL) DO
  9925. IF ~(variable.untraced) THEN
  9926. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9927. END;
  9928. variable := variable.nextVariable;
  9929. END;
  9930. END;
  9931. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9932. WITH type: SyntaxTree.ArrayType DO
  9933. IF type.form= SyntaxTree.Static THEN
  9934. n := type.staticLength;
  9935. base := type.arrayBase.resolved;
  9936. WHILE(base IS SyntaxTree.ArrayType) DO
  9937. type := base(SyntaxTree.ArrayType);
  9938. n := n* type.staticLength;
  9939. base := type.arrayBase.resolved;
  9940. END;
  9941. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9942. IF SemanticChecker.ContainsPointer(base) THEN
  9943. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9944. FOR i := 0 TO n-1 DO
  9945. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9946. END;
  9947. END;
  9948. ELSE
  9949. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  9950. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9951. END;
  9952. END;
  9953. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9954. WITH type: SyntaxTree.MathArrayType DO
  9955. IF type.form = SyntaxTree.Static THEN
  9956. n := type.staticLength;
  9957. base := type.arrayBase.resolved;
  9958. WHILE(base IS SyntaxTree.MathArrayType) DO
  9959. type := base(SyntaxTree.MathArrayType);
  9960. n := n* type.staticLength;
  9961. base := type.arrayBase.resolved;
  9962. END;
  9963. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9964. IF SemanticChecker.ContainsPointer(base) THEN
  9965. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9966. FOR i := 0 TO n-1 DO
  9967. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9968. END;
  9969. END;
  9970. ELSE
  9971. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  9972. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9973. END
  9974. END;
  9975. (* ELSE no pointers in type *)
  9976. END;
  9977. END Pointers;
  9978. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  9979. VAR position,i: LONGINT; ch: CHAR;
  9980. BEGIN
  9981. IF pool.Has(index) THEN
  9982. RETURN pool.GetInt(index)
  9983. ELSE
  9984. position := source.pc;
  9985. pool.PutInt(index, position);
  9986. Info(source, name);
  9987. i := 0;
  9988. REPEAT
  9989. ch := name[i]; INC(i);
  9990. Char( source, ch);
  9991. UNTIL ch = 0X;
  9992. END;
  9993. RETURN position;
  9994. END EnterDynamicName;
  9995. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  9996. VAR name: Basic.SectionName; position: LONGINT;
  9997. BEGIN
  9998. IF pool.Has(index) THEN
  9999. RETURN pool.GetInt(index)
  10000. ELSE
  10001. StringPool.GetString(index, name);
  10002. position := EnterDynamicName(source,name,index, pool);
  10003. END;
  10004. RETURN position;
  10005. END DynamicName;
  10006. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10007. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10008. BEGIN
  10009. COPY(moduleName,name);
  10010. Strings.Append(name,suffix);
  10011. Basic.ToSegmentedName(name, pooledName);
  10012. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10013. IF implementationVisitor.backend.cooperative THEN
  10014. Info(section, "TypeDescriptor");
  10015. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10016. NamedSymbol(section, pooledName,NIL, 0, 0);
  10017. BasePointer(section);
  10018. offset := 0;
  10019. ELSE
  10020. HeapBlock(mName,typeName,section,2);
  10021. Info(section, "HeapBlock");
  10022. (*
  10023. Symbol(section,section,2,0);
  10024. *)
  10025. Address(section,0); (* empty such that GC does not go on traversing *)
  10026. Info(section, "TypeDescriptor");
  10027. Address(section,0);
  10028. offset := section.pc;
  10029. END;
  10030. RETURN section
  10031. END Block;
  10032. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10033. VAR name: Basic.SegmentedName;
  10034. BEGIN
  10035. Info(source,"ArrayHeader");
  10036. IF implementationVisitor.backend.cooperative THEN
  10037. sizePC := source.pc;
  10038. Address(source,0);
  10039. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10040. IF baseType # "" THEN
  10041. Basic.ToSegmentedName(baseType, name);
  10042. NamedSymbol(source, name,NIL, 0, 0);
  10043. ELSE
  10044. Address(source,0);
  10045. END;
  10046. Address(source,0);
  10047. ELSE
  10048. Address(source,0);
  10049. Address(source,0);
  10050. Address(source,0);
  10051. sizePC := source.pc;
  10052. Address(source,0);
  10053. Info(source,"array data");
  10054. END;
  10055. END Array;
  10056. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10057. BEGIN
  10058. IF implementationVisitor.backend.cooperative THEN
  10059. PatchLongint(section, pc, size);
  10060. PatchLongint(section, pc + 3, size);
  10061. ELSE
  10062. PatchLongint(section, pc, size);
  10063. END;
  10064. END PatchArray;
  10065. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10066. VAR
  10067. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10068. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10069. poolMap: Basic.HashTableInt;
  10070. namePool: IntermediateCode.Section;
  10071. namePoolOffset: LONGINT;
  10072. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10073. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10074. BEGIN
  10075. Basic.SegmentedNameToString(s1.name,n1);
  10076. Basic.SegmentedNameToString(s2.name,n2);
  10077. index := 0;
  10078. ch1 := n1[index];
  10079. ch2 := n2[index];
  10080. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10081. INC(index);
  10082. ch1 := n1[index];
  10083. ch2 := n2[index];
  10084. END;
  10085. RETURN ch1 < ch2;
  10086. END Compare;
  10087. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10088. VAR
  10089. i, j: LONGINT;
  10090. x, t: Sections.Section;
  10091. BEGIN
  10092. IF lo < hi THEN
  10093. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10094. WHILE i <= j DO
  10095. WHILE Compare(list[i], x) DO INC(i) END;
  10096. WHILE Compare(x, list[j]) DO DEC(j) END;
  10097. IF i <= j THEN
  10098. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10099. INC(i); DEC(j)
  10100. END
  10101. END;
  10102. IF lo < j THEN QuickSort(list, lo, j) END;
  10103. IF i < hi THEN QuickSort(list, i, hi) END
  10104. END;
  10105. END QuickSort;
  10106. (*
  10107. ExportDesc* = RECORD
  10108. fp*: ADDRESS;
  10109. name* {UNTRACED}: DynamicName;
  10110. adr*: ADDRESS;
  10111. exports*: LONGINT;
  10112. dsc* {UNTRACED}: ExportArray
  10113. END;
  10114. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10115. *)
  10116. PROCEDURE ExportDesc2(
  10117. source: IntermediateCode.Section;
  10118. namePool: IntermediateCode.Section;
  10119. fingerPrinter: FingerPrinter.FingerPrinter;
  10120. symbol: Sections.Section;
  10121. name: StringPool.Index;
  10122. VAR patchAdr: LONGINT
  10123. ): BOOLEAN;
  10124. VAR fingerPrint: SyntaxTree.FingerPrint;
  10125. BEGIN
  10126. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10127. & (symbol.type # Sections.InlineCodeSection)
  10128. THEN
  10129. *)
  10130. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10131. & (symbol.type # Sections.InlineCodeSection))
  10132. THEN
  10133. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10134. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10135. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10136. Longint(source,fingerPrint.shallow);
  10137. ELSE
  10138. Longint(source, 0);
  10139. END;
  10140. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10141. Symbol(source, symbol,0,0);
  10142. patchAdr := source.pc;
  10143. Address(source,0);
  10144. Address(source,0);
  10145. END;
  10146. RETURN TRUE
  10147. ELSE
  10148. RETURN FALSE
  10149. END;
  10150. END ExportDesc2;
  10151. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10152. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10153. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10154. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10155. TYPE
  10156. Scope = RECORD
  10157. elements: LONGINT;
  10158. gelements: LONGINT;
  10159. section: IntermediateCode.Section;
  10160. patchAdr: LONGINT;
  10161. arraySizePC: LONGINT;
  10162. beginPC: LONGINT; (* current scope start pc *)
  10163. END;
  10164. BEGIN
  10165. Basic.InitSegmentedName(prev);
  10166. olevel := -1;
  10167. scopes[0].section := source;
  10168. FOR s := 0 TO LEN(sections)-1 DO
  10169. symbol := sections[s];
  10170. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10171. this := sections[s].name;
  10172. level := 0;
  10173. WHILE (this[level] > 0) DO
  10174. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10175. INC(level);
  10176. END;
  10177. WHILE level < olevel DO
  10178. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10179. IF olevel > 0 THEN
  10180. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10181. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10182. END;
  10183. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10184. DEC(olevel);
  10185. END;
  10186. IF (this[level] > 0) THEN
  10187. IF level > olevel THEN
  10188. (*TRACE("opening",level); *)
  10189. IF scopes[level].section = NIL THEN
  10190. arrayName := ".@ExportArray";
  10191. Strings.AppendInt(arrayName, level);
  10192. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10193. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10194. END;
  10195. scopes[level].beginPC := scopes[level].section.pc;
  10196. olevel := level;
  10197. scopes[olevel].elements := 0;
  10198. END;
  10199. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10200. sym := sections[s];
  10201. ELSE
  10202. sym := NIL;
  10203. END;
  10204. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10205. THEN
  10206. INC(scopes[olevel].elements);
  10207. END;
  10208. (*StringPool.GetString(this[level], name);*)
  10209. (*TRACE(level, name);*)
  10210. (* enter string in scope *)
  10211. INC(level);
  10212. END;
  10213. END;
  10214. Basic.SegmentedNameToString(this, name);
  10215. (*TRACE(level, "enter", name);*)
  10216. prev := this;
  10217. END;
  10218. END;
  10219. WHILE 0 <= olevel DO
  10220. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10221. IF olevel > 0 THEN
  10222. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10223. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10224. END;
  10225. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10226. DEC(olevel);
  10227. END;
  10228. level := 0;
  10229. WHILE (level < LEN(scopes)) DO
  10230. IF scopes[level].section # NIL THEN
  10231. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10232. END;
  10233. INC(level);
  10234. END;
  10235. END Export;
  10236. BEGIN
  10237. NEW(fingerPrinter, module.system);
  10238. NEW(poolMap, 64);
  10239. (* 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 *)
  10240. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10241. NEW(sectionArray, module.allSections.Length());
  10242. FOR i := 0 TO module.allSections.Length() - 1 DO
  10243. section := module.allSections.GetSection(i);
  10244. sectionArray[i] := section;
  10245. END;
  10246. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10247. Export(sectionArray^);
  10248. END ExportDesc;
  10249. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10250. VAR
  10251. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10252. BEGIN
  10253. Info(source, "exception table offsets array descriptor");
  10254. size := 0;
  10255. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10256. Info(source, "exception table content");
  10257. FOR i := 0 TO module.allSections.Length() - 1 DO
  10258. p := module.allSections.GetSection(i);
  10259. IF p.type = Sections.CodeSection THEN
  10260. finallyPC := p(IntermediateCode.Section).finally;
  10261. IF finallyPC>=0 THEN
  10262. Symbol( source, p, 0,0);
  10263. Symbol( source, p, finallyPC, 0);
  10264. Symbol( source, p, finallyPC,0);
  10265. INC(size);
  10266. END;
  10267. END
  10268. END;
  10269. PatchArray(source,sizePC,size);
  10270. END ExceptionArray;
  10271. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10272. VAR i: LONGINT; ch: CHAR;
  10273. BEGIN
  10274. i := 0;
  10275. REPEAT
  10276. ch := name[i]; INC(i);
  10277. Char( section, ch);
  10278. UNTIL ch = 0X;
  10279. WHILE i < 32 DO
  10280. Char( section, 0X); INC(i);
  10281. END;
  10282. END Name;
  10283. PROCEDURE References(section: IntermediateCode.Section);
  10284. CONST
  10285. rfDirect = 1X; rfIndirect = 3X;
  10286. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10287. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10288. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10289. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10290. rfRecordPointer=1DX;
  10291. rfArrayFlag = 80X;
  10292. VAR
  10293. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10294. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10295. VAR char: CHAR;
  10296. BEGIN
  10297. IF type = NIL THEN char := rfLongint
  10298. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10299. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10300. ELSIF type IS SyntaxTree.CharacterType THEN
  10301. IF type.sizeInBits = 8 THEN char := rfChar8
  10302. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10303. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10304. END;
  10305. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10306. IF type.sizeInBits = 8 THEN char := rfShortint
  10307. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10308. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10309. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10310. END;
  10311. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10312. ELSIF type IS SyntaxTree.FloatType THEN
  10313. IF type.sizeInBits = 32 THEN char := rfReal
  10314. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10315. END;
  10316. ELSIF type IS SyntaxTree.ComplexType THEN
  10317. IF type.sizeInBits = 64 THEN char := rfComplex
  10318. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10319. END;
  10320. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10321. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10322. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10323. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10324. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10325. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10326. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10327. END;
  10328. RETURN char
  10329. END BaseType;
  10330. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10331. VAR destination: Sections.Section;
  10332. BEGIN
  10333. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10334. IF type.pointerType # NIL THEN
  10335. Char(section,rfRecordPointer)
  10336. ELSE
  10337. Char(section,rfRecord);
  10338. END;
  10339. IF destination = NIL THEN
  10340. Longint(section,0);
  10341. ELSE
  10342. Longint(section,destination.offset); (* used for ? *)
  10343. END;
  10344. END RecordType;
  10345. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10346. BEGIN
  10347. baseType := type.arrayBase.resolved;
  10348. IF type.form = SyntaxTree.Static THEN
  10349. IF baseType IS SyntaxTree.ArrayType THEN
  10350. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10351. ELSE
  10352. RETURN type.staticLength
  10353. END
  10354. ELSE
  10355. RETURN 0
  10356. END;
  10357. END StaticArrayLength;
  10358. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10359. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10360. BEGIN
  10361. length := StaticArrayLength(type, baseType);
  10362. char := BaseType(baseType);
  10363. IF type.form # SyntaxTree.Open THEN
  10364. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10365. Longint(section, length)
  10366. ELSE
  10367. length :=0;
  10368. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10369. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10370. Longint(section, length)
  10371. END;
  10372. END ArrayType;
  10373. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10374. BEGIN
  10375. baseType := type.arrayBase;
  10376. IF baseType # NIL THEN
  10377. baseType := baseType.resolved;
  10378. END;
  10379. IF type.form = SyntaxTree.Static THEN
  10380. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10381. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10382. ELSE
  10383. RETURN type.staticLength
  10384. END
  10385. ELSE
  10386. RETURN 0
  10387. END;
  10388. END StaticMathArrayLength;
  10389. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10390. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10391. BEGIN
  10392. length := StaticMathArrayLength(type, baseType);
  10393. char := BaseType(baseType);
  10394. IF type.form = SyntaxTree.Open THEN
  10395. char := BaseType(module.system.addressType);
  10396. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10397. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10398. Longint(section, length)
  10399. ELSIF type.form=SyntaxTree.Tensor THEN
  10400. char := BaseType(module.system.addressType);
  10401. Char(section, CHR(ORD(char)));
  10402. ELSE
  10403. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10404. Longint(section, length)
  10405. END;
  10406. END MathArrayType;
  10407. PROCEDURE Type(type: SyntaxTree.Type);
  10408. BEGIN
  10409. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10410. IF type IS SyntaxTree.BasicType THEN
  10411. Char(section, BaseType(type));
  10412. ELSIF type IS SyntaxTree.RecordType THEN
  10413. RecordType(type(SyntaxTree.RecordType));
  10414. ELSIF type IS SyntaxTree.ArrayType THEN
  10415. ArrayType(type(SyntaxTree.ArrayType))
  10416. ELSIF type IS SyntaxTree.EnumerationType THEN
  10417. Char(section, BaseType(module.system.longintType))
  10418. ELSIF type IS SyntaxTree.PointerType THEN
  10419. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10420. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10421. ELSE
  10422. Char(section, BaseType(type))
  10423. END;
  10424. ELSIF type IS SyntaxTree.ProcedureType THEN
  10425. Char(section, BaseType(type));
  10426. ELSIF type IS SyntaxTree.MathArrayType THEN
  10427. MathArrayType(type(SyntaxTree.MathArrayType));
  10428. ELSIF type IS SyntaxTree.CellType THEN
  10429. Char(section, BaseType(module.system.anyType));
  10430. ELSE HALT(200)
  10431. END;
  10432. END Type;
  10433. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10434. VAR name: ARRAY 256 OF CHAR;
  10435. BEGIN
  10436. IF variable.externalName # NIL THEN RETURN END;
  10437. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10438. variable.GetName(name);
  10439. Type(variable.type);
  10440. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10441. String(section,name);
  10442. END WriteVariable;
  10443. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10444. VAR name: ARRAY 256 OF CHAR;
  10445. BEGIN
  10446. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10447. variable.GetName(name);
  10448. Type(variable.type);
  10449. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10450. variable.GetName(name);
  10451. String(section,name);
  10452. END WriteParameter;
  10453. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10454. BEGIN
  10455. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10456. IF type IS SyntaxTree.ArrayType THEN
  10457. WITH type: SyntaxTree.ArrayType DO
  10458. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10459. ELSE Char(section,rfOpenArray)
  10460. END;
  10461. END
  10462. ELSIF type IS SyntaxTree.MathArrayType THEN
  10463. WITH type: SyntaxTree.MathArrayType DO
  10464. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10465. ELSE Char(section,rfOpenArray)
  10466. END;
  10467. END
  10468. ELSIF type IS SyntaxTree.RecordType THEN
  10469. Char(section,rfRecord);
  10470. ELSE
  10471. Char(section, BaseType(type));
  10472. END;
  10473. END ReturnType;
  10474. PROCEDURE Procedure(s: Sections.Section);
  10475. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10476. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10477. name: ARRAY 256 OF CHAR;
  10478. BEGIN
  10479. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10480. (*procedure.name,name);*)
  10481. Global.GetSymbolNameInScope(procedure,module.module.moduleScope,name);
  10482. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10483. Char(section,0F9X);
  10484. Symbol(section,s,0,0);
  10485. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10486. Longint(section,procedureType.numberParameters);
  10487. ReturnType(procedureType.returnType);
  10488. Longint(section,0); (*! level *)
  10489. Longint(section,0);
  10490. (*
  10491. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10492. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10493. recordName := "";
  10494. IF record.pointerType # NIL THEN
  10495. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10496. ELSE
  10497. DeclarationName(record.typeDeclaration,recordName);
  10498. END;
  10499. i := 0;
  10500. Info(section,recordName);
  10501. WHILE recordName[i] # 0X DO
  10502. Char(section,recordName[i]); INC(i);
  10503. INC(size);
  10504. END;
  10505. Char(section,".");
  10506. INC(size);
  10507. END;
  10508. *)
  10509. String(section,name);
  10510. parameter := procedureType.firstParameter;
  10511. WHILE(parameter # NIL) DO
  10512. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10513. parameter := parameter.nextParameter;
  10514. END;
  10515. variable := procedure.procedureScope.firstVariable;
  10516. WHILE(variable # NIL) DO
  10517. WriteVariable(variable,FALSE);
  10518. variable := variable.nextVariable;
  10519. END;
  10520. END Procedure;
  10521. PROCEDURE Scope(s: Sections.Section);
  10522. BEGIN
  10523. Char(section,0F8X);
  10524. Symbol(section,s,0,0); (* start *)
  10525. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10526. String(section,"$$");
  10527. (* removed variables -- wrongly interpreted by Reflection
  10528. variable := module.module.moduleScope.firstVariable;
  10529. WHILE(variable # NIL) DO
  10530. WriteVariable(variable,FALSE);
  10531. variable := variable.nextVariable;
  10532. END;
  10533. *)
  10534. END Scope;
  10535. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10536. VAR result, i: LONGINT;
  10537. BEGIN
  10538. FOR i := startPC TO endPC -1 DO
  10539. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10540. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10541. END;
  10542. RETURN result;
  10543. END ComputeSize;
  10544. BEGIN
  10545. Array(section,sizePC,"");
  10546. startPC := section.pc;
  10547. Char(section,0FFX); (* sign for trap writer *)
  10548. FOR i := 0 TO module.allSections.Length() - 1 DO
  10549. s := module.allSections.GetSection(i);
  10550. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10551. Scope(s) (*! must be first procedure in ref section *)
  10552. END
  10553. END;
  10554. FOR i := 0 TO module.allSections.Length() - 1 DO
  10555. s := module.allSections.GetSection(i);
  10556. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10557. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10558. Procedure(s)
  10559. END
  10560. END;
  10561. endPC := section.pc;
  10562. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10563. END References;
  10564. (*
  10565. Command* = RECORD
  10566. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10567. name*: Name; (* name of the procedure *)
  10568. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10569. entryAdr* : ADDRESS; (* entry address of procedure *)
  10570. END;
  10571. *)
  10572. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10573. VAR
  10574. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10575. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10576. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  10577. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10578. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10579. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10580. BEGIN
  10581. RETURN
  10582. (type = NIL) OR
  10583. (type.resolved IS SyntaxTree.RecordType) OR
  10584. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10585. (type.resolved IS SyntaxTree.AnyType);
  10586. END TypeAllowed;
  10587. BEGIN
  10588. numberParameters := procedureType.numberParameters;
  10589. RETURN
  10590. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10591. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10592. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10593. END GetProcedureAllowed;
  10594. PROCEDURE WriteType(type : SyntaxTree.Type);
  10595. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10596. name: Basic.SegmentedName; offset: LONGINT;
  10597. BEGIN
  10598. IF type = NIL THEN
  10599. Address(source,0);
  10600. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10601. Address(source,1);
  10602. ELSE
  10603. type := type.resolved;
  10604. IF type IS SyntaxTree.PointerType THEN
  10605. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10606. END;
  10607. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10608. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10609. name[0] := typeDeclaration.name; name[1] := -1;
  10610. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10611. ASSERT(section # NIL);
  10612. ELSE
  10613. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10614. (* TODO *)
  10615. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10616. END;
  10617. IF implementationVisitor.backend.cooperative THEN
  10618. offset := 0;
  10619. ELSE
  10620. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10621. END;
  10622. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10623. END;
  10624. END WriteType;
  10625. BEGIN
  10626. Info(source, "command array descriptor");
  10627. Array(source,sizePC,"Modules.Command");
  10628. numberCommands := 0;
  10629. Info(source, "command array content");
  10630. FOR i := 0 TO module.allSections.Length() - 1 DO
  10631. p := module.allSections.GetSection(i);
  10632. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10633. procedure := p.symbol(SyntaxTree.Procedure);
  10634. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10635. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10636. procedure.GetName(name);
  10637. Name(source,name);
  10638. numberParameters := procedureType.numberParameters;
  10639. (* offset of type of first parameter *)
  10640. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10641. ELSE WriteType(procedureType.firstParameter.type)
  10642. END;
  10643. (* offset of type of return parameter *)
  10644. WriteType(procedureType.returnType);
  10645. (* command name *)
  10646. (* command code offset *)
  10647. Symbol(source,p,0,0);
  10648. INC(numberCommands);
  10649. IF Trace THEN
  10650. D.Ln;
  10651. END;
  10652. END;
  10653. END
  10654. END;
  10655. PatchArray(source,sizePC,numberCommands);
  10656. END CommandArray;
  10657. (* to prevent from double import of different module aliases *)
  10658. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10659. VAR i: SyntaxTree.Import;
  10660. BEGIN
  10661. i := module.module.moduleScope.firstImport;
  10662. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10663. i := i.nextImport;
  10664. END;
  10665. RETURN i = import
  10666. END IsFirstDirectOccurence;
  10667. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10668. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10669. BEGIN
  10670. Array(source,pc,"");
  10671. Info(source, "import module array data");
  10672. IF implementationVisitor.backend.cooperative THEN
  10673. offset := 0;
  10674. ELSE
  10675. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10676. END;
  10677. import := module.module.moduleScope.firstImport;
  10678. numberImports := 0;
  10679. WHILE import # NIL DO
  10680. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10681. Global.GetModuleSegmentedName(import.module,name);
  10682. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10683. NamedSymbol(source, name, NIL, 0, offset);
  10684. INC(numberImports);
  10685. END;
  10686. import := import.nextImport
  10687. END;
  10688. PatchArray(source,pc,numberImports);
  10689. END ImportsArray;
  10690. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10691. VAR
  10692. p: Sections.Section; sizePC, size, i: LONGINT;
  10693. BEGIN
  10694. Info(source, "Type info section");
  10695. size := 0;
  10696. Array(source,sizePC,"Modules.TypeDesc");
  10697. FOR i := 0 TO module.allSections.Length() - 1 DO
  10698. p := module.allSections.GetSection(i);
  10699. WITH p: IntermediateCode.Section DO
  10700. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10701. Symbol(source,p,0,0);
  10702. INC(size);
  10703. END;
  10704. END
  10705. END;
  10706. PatchArray(source,sizePC,size);
  10707. END TypeInfoSection;
  10708. (*
  10709. ProcTableEntry* = RECORD
  10710. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10711. noPtr*: LONGINT;
  10712. END;
  10713. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10714. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10715. *)
  10716. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10717. VAR
  10718. destination: Sections.Section;
  10719. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10720. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10721. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10722. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10723. BEGIN
  10724. Info(procArray,"pcFrom");
  10725. Symbol(procArray,destination,0,0);
  10726. Info(procArray,"pcTo");
  10727. Symbol(procArray,destination,destination.pc,0);
  10728. Info(procArray,"pcStatementBegin");
  10729. Symbol(procArray,destination,destination.validPAFEnter,0);
  10730. Info(procArray,"pcStatementEnd");
  10731. Symbol(procArray,destination,destination.validPAFExit,0);
  10732. IF ~implementationVisitor.backend.cooperative THEN
  10733. Basic.SegmentedNameToString(destination.name, string);
  10734. Info(pointerArray,string);
  10735. procedure := destination.symbol(SyntaxTree.Procedure);
  10736. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10737. variable := procedure.procedureScope.firstVariable;
  10738. WHILE(variable # NIL) DO
  10739. IF ~(variable.untraced) THEN
  10740. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10741. END;
  10742. variable := variable.nextVariable
  10743. END;
  10744. parameter := procedureType.firstParameter;
  10745. WHILE(parameter # NIL) DO
  10746. IF ~(parameter.untraced) THEN
  10747. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10748. END;
  10749. parameter := parameter.nextParameter;
  10750. END;
  10751. END;
  10752. Info(procArray,"numberPointers");
  10753. Longint(procArray,numberPointers);
  10754. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10755. INC(pointerArraySize, numberPointers);
  10756. END PointerOffsets;
  10757. BEGIN
  10758. maxPointers := 0;
  10759. Info(procArray, "proc array descriptor");
  10760. Address(procArray,0);
  10761. Address(procArray,0);
  10762. Address(procArray,0);
  10763. procArraySizePC := procArray.pc;
  10764. Address(procArray,0);
  10765. procArraySize := 0;
  10766. IF ~implementationVisitor.backend.cooperative THEN
  10767. Info(pointerArray, "pointer array descriptor");
  10768. Address(pointerArray,0);
  10769. Address(pointerArray,0);
  10770. Address(pointerArray,0);
  10771. pointerArraySizePC := pointerArray.pc;
  10772. Address(pointerArray,0);
  10773. pointerArraySize := 0;
  10774. END;
  10775. procArraySize := 0;
  10776. FOR i := 0 TO module.allSections.Length() - 1 DO
  10777. destination := module.allSections.GetSection(i);
  10778. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10779. PointerOffsets(destination(IntermediateCode.Section));
  10780. INC(procArraySize);
  10781. END
  10782. END;
  10783. PatchLongint(procArray,procArraySizePC,procArraySize);
  10784. IF ~implementationVisitor.backend.cooperative THEN
  10785. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10786. END;
  10787. END PointersInProcTables;
  10788. (*
  10789. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10790. VAR
  10791. next*: Module; (** once a module is published, all fields are read-only *)
  10792. name*: Name;
  10793. init, published: BOOLEAN;
  10794. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10795. sb*: ADDRESS; <- set to beginning of data section by loader
  10796. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10797. command*: POINTER TO ARRAY OF Command;
  10798. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10799. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10800. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10801. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10802. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10803. data*, code*: Bytes;
  10804. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10805. export*: ExportDesc;
  10806. term*: TerminationHandler;
  10807. exTable*: ExceptionTable;
  10808. noProcs*: LONGINT;
  10809. firstProc*: ADDRESS; <- done by loader
  10810. maxPtrs*: LONGINT;
  10811. crc*: LONGINT;
  10812. *)
  10813. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10814. BEGIN
  10815. Info(section, "cycle");
  10816. Size(section,0);
  10817. Info(section, "references");
  10818. Size(section,0);
  10819. Info(section, "nextMarked");
  10820. Address(section,0);
  10821. Info(section, "nextWatched");
  10822. Address(section,0);
  10823. END BasePointer;
  10824. PROCEDURE BaseObject (section: IntermediateCode.Section);
  10825. BEGIN
  10826. BasePointer(section);
  10827. Info(section, "action");
  10828. Address(section,0);
  10829. Info(section, "monitor");
  10830. Address(section,0);
  10831. END BaseObject;
  10832. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  10833. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  10834. pooledName: Basic.SegmentedName;
  10835. symbol: SyntaxTree.Symbol;
  10836. BEGIN
  10837. Global.GetModuleName(module.module,name);
  10838. Strings.Append(name,".@Module.@Descriptor");
  10839. Basic.ToSegmentedName(name, pooledName);
  10840. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10841. Symbol(section,descriptorSection,0,0);
  10842. Info(descriptorSection, "descriptor");
  10843. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10844. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  10845. Address(descriptorSection,0);
  10846. Global.GetModuleName(module.module,name);
  10847. Strings.Append(name,".@Trace");
  10848. Basic.ToSegmentedName(name, pooledName);
  10849. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10850. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  10851. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10852. END ModuleDescriptor;
  10853. PROCEDURE ModuleSection(): IntermediateCode.Section;
  10854. VAR name: ARRAY 128 OF CHAR;
  10855. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  10856. symbol: SyntaxTree.Symbol;
  10857. BEGIN
  10858. Global.GetModuleName(module.module,name);
  10859. Strings.Append(name,".@Module");
  10860. Basic.ToSegmentedName(name, pooledName);
  10861. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10862. moduleSection.SetExported(TRUE);
  10863. IF moduleSection.pc = 0 THEN
  10864. IF implementationVisitor.backend.cooperative THEN
  10865. Info(moduleSection, "descriptor");
  10866. ModuleDescriptor(moduleSection);
  10867. BaseObject(moduleSection);
  10868. implementationVisitor.CreateTraceModuleMethod(module.module);
  10869. ELSE
  10870. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  10871. Info(moduleSection, "HeapBlock");
  10872. Symbol(moduleSection,moduleSection,2,0);
  10873. Info(moduleSection, "TypeDescriptor");
  10874. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10875. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  10876. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  10877. END;
  10878. END;
  10879. RETURN moduleSection;
  10880. END ModuleSection;
  10881. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  10882. VAR
  10883. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  10884. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  10885. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  10886. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  10887. referenceSectionOffset : LONGINT;
  10888. BEGIN
  10889. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  10890. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  10891. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  10892. ImportsArray(importSection);
  10893. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  10894. CommandArray(commandsSection);
  10895. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  10896. ExceptionArray(exceptionSection);
  10897. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  10898. TypeInfoSection(typeInfoSection);
  10899. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  10900. References(referenceSection);
  10901. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  10902. IF ~implementationVisitor.backend.cooperative THEN
  10903. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  10904. ELSE
  10905. ptrTableSection := NIL;
  10906. END;
  10907. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  10908. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  10909. Array(emptyArraySection,temp,"");
  10910. moduleSection := ModuleSection();
  10911. Info(moduleSection, "nextRoot*: RootObject");
  10912. Address(moduleSection,0);
  10913. Info(moduleSection, "next*: Module");
  10914. Address(moduleSection,0);
  10915. Info(moduleSection, "name*: Name");
  10916. Name(moduleSection,moduleName);
  10917. Info(moduleSection, "init, published: BOOLEAN");
  10918. Boolean(moduleSection,FALSE);
  10919. Boolean(moduleSection,FALSE);
  10920. Info(moduleSection,"filler"); (*! introduce alignment! *)
  10921. Boolean(moduleSection,FALSE);
  10922. Boolean(moduleSection,FALSE);
  10923. Info(moduleSection, "refcnt*: LONGINT");
  10924. Longint(moduleSection,0);
  10925. Info(moduleSection, "sb*: ADDRESS");
  10926. Address(moduleSection,0);
  10927. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  10928. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10929. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  10930. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  10931. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  10932. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  10933. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  10934. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  10935. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  10936. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  10937. Info(moduleSection, "procTable*: ProcTable");
  10938. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  10939. Info(moduleSection, "ptrTable*: PtrTable");
  10940. IF ~implementationVisitor.backend.cooperative THEN
  10941. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  10942. ELSE
  10943. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10944. END;
  10945. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  10946. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10947. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10948. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10949. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  10950. Info(moduleSection, "export*: ExportDesc");
  10951. ExportDesc(moduleSection);
  10952. Info(moduleSection, "term*: TerminationHandler");
  10953. Address(moduleSection,0);
  10954. Info(moduleSection, "exTable*: ExceptionTable");
  10955. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  10956. Info(moduleSection, "noProcs*: LONGINT");
  10957. Longint(moduleSection,numberProcs);
  10958. Info(moduleSection, "firstProc*: ADDRESS");
  10959. Address(moduleSection,0);
  10960. Info(moduleSection, "maxPtrs*: LONGINT");
  10961. Longint(moduleSection,maxPointers);
  10962. Info(moduleSection, "crc*: LONGINT");
  10963. Longint(moduleSection, 0); (*! must be implemented *)
  10964. Info(moduleSection, "body*: ADDRESS");
  10965. Symbol(moduleSection, bodyProc, 0,0);
  10966. IF implementationVisitor.backend.cooperative THEN
  10967. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  10968. Info(moduleSection, "monitor.owner");
  10969. Address(moduleSection,0);
  10970. Info(moduleSection, "monitor.nestingLevel");
  10971. Address(moduleSection,0);
  10972. Info(moduleSection, "monitor.blockedQueue");
  10973. Address(moduleSection,0); Address(moduleSection,0);
  10974. Info(moduleSection, "monitor.waitingQueue");
  10975. Address(moduleSection,0); Address(moduleSection,0);
  10976. Info(moduleSection, "monitor.waitingSentinel");
  10977. Address(moduleSection,0);
  10978. END;
  10979. END Module;
  10980. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  10981. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  10982. BEGIN
  10983. Array(source,pc,"");
  10984. Info(source, "pointer offsets array data");
  10985. IF scope IS SyntaxTree.RecordScope THEN
  10986. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  10987. ELSIF scope IS SyntaxTree.CellScope THEN
  10988. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  10989. ELSIF scope IS SyntaxTree.ModuleScope THEN
  10990. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  10991. WHILE variable # NIL DO
  10992. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  10993. symbol := module.allSections.FindBySymbol(variable);
  10994. ASSERT(symbol # NIL);
  10995. Pointers(0,symbol, source,variable.type,numberPointers);
  10996. END;
  10997. variable := variable.nextVariable;
  10998. END;
  10999. END;
  11000. PatchArray(source,pc,numberPointers);
  11001. END PointerArray;
  11002. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11003. VAR
  11004. name: Basic.SegmentedName;
  11005. section: IntermediateCode.Section;
  11006. BEGIN
  11007. ASSERT(implementationVisitor.newObjectFile);
  11008. Global.GetSymbolSegmentedName(symbol,name);
  11009. Basic.AppendToSegmentedName(name,suffix);
  11010. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11011. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11012. Info(section, "HeapBlock");
  11013. Address(section,0); (* empty such that GC does not go on traversing *)
  11014. Info(section, suffix);
  11015. Address(section,0);
  11016. pc := section.pc;
  11017. RETURN section;
  11018. END SymbolSection;
  11019. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11020. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11021. BEGIN
  11022. ASSERT(implementationVisitor.newObjectFile);
  11023. IF ~ReflectionSupport OR simple THEN variable := NIL
  11024. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11025. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11026. IF type IS SyntaxTree.PointerType THEN
  11027. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11028. END;
  11029. IF type IS SyntaxTree.RecordType THEN
  11030. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11031. ELSIF type IS SyntaxTree.CellType THEN
  11032. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11033. END;
  11034. ELSIF symbol IS SyntaxTree.Procedure THEN
  11035. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11036. END;
  11037. Info(in, "variables");
  11038. IF variable # NIL THEN
  11039. section := SymbolSection(symbol, "@Variables",pc);
  11040. VariableArray(section, variable);
  11041. Symbol(in, section, pc, 0);
  11042. ELSE
  11043. Address(in, 0);
  11044. END;
  11045. END ReflectVariables;
  11046. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11047. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11048. BEGIN
  11049. ASSERT(implementationVisitor.newObjectFile);
  11050. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11051. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11052. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11053. IF type IS SyntaxTree.PointerType THEN
  11054. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11055. END;
  11056. IF type IS SyntaxTree.RecordType THEN
  11057. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11058. ELSIF type IS SyntaxTree.CellType THEN
  11059. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11060. END;
  11061. ELSIF symbol IS SyntaxTree.Procedure THEN
  11062. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11063. END;
  11064. Info(in, "procedures");
  11065. IF procedure # NIL THEN
  11066. section := SymbolSection(symbol, "@Procedures",pc);
  11067. ProcedureArray(section, procedure);
  11068. Symbol(in, section, pc, 0);
  11069. ELSE
  11070. Address(in, 0);
  11071. END;
  11072. END ReflectProcedures;
  11073. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11074. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11075. segmentedName: Basic.SegmentedName;
  11076. td: SyntaxTree.TypeDeclaration;
  11077. type: SyntaxTree.Type;
  11078. BEGIN
  11079. Array(source,pc,"Modules.FieldEntry");
  11080. Info(source, "FieldArray");
  11081. size :=0;
  11082. WHILE variable # NIL DO
  11083. Info(source,"name");
  11084. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11085. type := variable.type.resolved;
  11086. Info(source,"offset");
  11087. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11088. Info(source,"type class");
  11089. IF type IS SyntaxTree.PointerType THEN
  11090. Size(source, 1);
  11091. ELSIF type IS SyntaxTree.RecordType THEN
  11092. Size(source, 2);
  11093. ELSIF type IS SyntaxTree.NumberType THEN
  11094. Size(source, 3);
  11095. ELSE
  11096. Size(source, 0);
  11097. END;
  11098. Info(source, "type desc");
  11099. IF type IS SyntaxTree.RecordType THEN
  11100. td := type(SyntaxTree.RecordType).typeDeclaration;
  11101. Global.GetSymbolSegmentedName(td,segmentedName);
  11102. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11103. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11104. ELSE
  11105. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11106. END;
  11107. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11108. Symbol(source, tir, 0, offset);
  11109. ELSE
  11110. Address(source, 0);
  11111. END;
  11112. Info(source,"flags");
  11113. Set(source, {});
  11114. variable := variable.nextVariable;
  11115. INC(size);
  11116. END;
  11117. PatchArray(source,pc,size);
  11118. END VariableArray;
  11119. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11120. VAR pc: LONGINT; size: LONGINT;
  11121. segmentedName: Basic.SegmentedName;
  11122. BEGIN
  11123. Array(source,pc,"Modules.ProcedureEntry");
  11124. Info(source, "ProcedureArray");
  11125. size :=0;
  11126. WHILE procedure # NIL DO
  11127. Info(source,"name");
  11128. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11129. Global.GetSymbolSegmentedName(procedure, segmentedName);
  11130. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11131. (* size *)
  11132. Size(source, 0);
  11133. (* parameters *)
  11134. Address(source, 0);
  11135. (* variables *)
  11136. ReflectVariables(source, procedure);
  11137. ReflectProcedures(source, procedure);
  11138. (* return type entry *)
  11139. Address(source, 0);
  11140. Address(source, 0);
  11141. procedure := procedure.nextProcedure;
  11142. INC(size);
  11143. END;
  11144. PatchArray(source,pc,size);
  11145. END ProcedureArray;
  11146. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11147. VAR recordType: SyntaxTree.RecordType;
  11148. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11149. section: Sections.Section; cellType: SyntaxTree.CellType;
  11150. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11151. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11152. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11153. sectionName: Basic.SectionName;
  11154. CONST MPO=-40000000H;
  11155. BEGIN
  11156. (*
  11157. TypeDesc* = POINTER TO RECORD
  11158. descSize: LONGINT;
  11159. sentinel: LONGINT; (* = MPO-4 *)
  11160. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11161. flags*: SET;
  11162. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11163. name*: Name;
  11164. END;
  11165. *)
  11166. (* source := module.sections.FindByName(...) *)
  11167. Global.GetSymbolSegmentedName(td,name);
  11168. Basic.AppendToSegmentedName(name,"@Info");
  11169. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11170. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11171. Address(source,MPO-4);
  11172. Info(source, "type tag pointer");
  11173. Symbol( source, tag, offset, 0);
  11174. Info(source, "type flags");
  11175. flags := {};
  11176. IF isProtected THEN INCL(flags,31) END;
  11177. Set( source, flags);
  11178. Info(source, "pointer to module");
  11179. moduleSection := ModuleSection();
  11180. Symbol( source, moduleSection, moduleSection.pc,0);
  11181. Info(source, "type name");
  11182. i := 0;
  11183. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11184. (*
  11185. Global.GetSymbolSegmentedName(td,name);
  11186. Basic.SegmentedNameToString(name, sectionName);
  11187. *)
  11188. Name(source,sectionName);
  11189. source.SetReferenced(FALSE);
  11190. Global.GetSymbolSegmentedName(td,name);
  11191. Basic.AppendToSegmentedName(name,"@Fields");
  11192. ReflectVariables(source, td);
  11193. ReflectProcedures(source, td);
  11194. (*
  11195. fieldSection := VariableArray(
  11196. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11197. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11198. Info(fieldSection, "HeapBlock");
  11199. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11200. Info(fieldSection, "TypeDescriptor");
  11201. Address(fieldSection,0);
  11202. Info(source, "FieldArray ref");
  11203. Symbol(source, fieldSection, fieldSection.pc, 0);
  11204. FieldArray(fieldSection);
  11205. Global.GetSymbolSegmentedName(td,name);
  11206. Basic.AppendToSegmentedName(name,"@Procedures");
  11207. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11208. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11209. Info(fieldSection, "HeapBlock");
  11210. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11211. Info(fieldSection, "TypeDescriptor");
  11212. Address(fieldSection,0);
  11213. Info(source, "Procedure Array ref");
  11214. Symbol(source, fieldSection, fieldSection.pc, 0);
  11215. ProcedureArray(fieldSection);
  11216. *)
  11217. RETURN source;
  11218. END NewTypeDescriptorInfo;
  11219. PROCEDURE NewTypeDescriptor;
  11220. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11221. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11222. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11223. numberPointers: LONGINT; padding, i: LONGINT;
  11224. CONST MPO=-40000000H;
  11225. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11226. VAR i: LONGINT;
  11227. PROCEDURE Td(record: SyntaxTree.RecordType);
  11228. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11229. BEGIN
  11230. IF record # NIL THEN
  11231. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11232. baseTD := record.typeDeclaration;
  11233. Global.GetSymbolSegmentedName(baseTD,name);
  11234. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11235. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11236. ELSE
  11237. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11238. END;
  11239. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11240. Symbol(source, tir, 0, offset);
  11241. IF reverse THEN Td(record.GetBaseRecord()) END;
  11242. END;
  11243. END Td;
  11244. BEGIN
  11245. Info(source, "tag table");
  11246. baseRecord := recordType;
  11247. i := 0;
  11248. WHILE baseRecord # NIL DO
  11249. INC(i);
  11250. baseRecord := baseRecord.GetBaseRecord();
  11251. END;
  11252. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11253. IF ~reverse THEN Td(recordType) END;
  11254. WHILE i < size DO
  11255. Address(source,0);
  11256. INC(i);
  11257. END;
  11258. IF reverse THEN Td(recordType) END;
  11259. END TdTable;
  11260. PROCEDURE MethodTable(reverse: BOOLEAN);
  11261. VAR i,methods: LONGINT;
  11262. BEGIN
  11263. Info(source, "method table");
  11264. IF recordType # NIL THEN
  11265. methods := recordType.recordScope.numberMethods;
  11266. IF reverse THEN
  11267. FOR i := methods-1 TO 0 BY -1 DO
  11268. procedure := recordType.recordScope.FindMethod(i);
  11269. Global.GetSymbolSegmentedName(procedure, name);
  11270. NamedSymbol(source, name,procedure, 0,0);
  11271. END;
  11272. ELSE
  11273. FOR i := 0 TO methods-1 DO
  11274. procedure := recordType.recordScope.FindMethod(i);
  11275. Global.GetSymbolSegmentedName(procedure, name);
  11276. NamedSymbol(source, name,procedure, 0,0);
  11277. END;
  11278. END;
  11279. END;
  11280. END MethodTable;
  11281. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11282. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11283. BEGIN
  11284. Info(source, "method table");
  11285. baseRecord := recordType;
  11286. WHILE baseRecord.baseType # NIL DO
  11287. baseRecord := baseRecord.GetBaseRecord ();
  11288. END;
  11289. GetRecordTypeName (baseRecord, name);
  11290. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11291. IF name = stackFrame THEN
  11292. start := 0;
  11293. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11294. baseRecord := recordType;
  11295. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11296. baseRecord := baseRecord.GetBaseRecord ();
  11297. END;
  11298. IF baseRecord # NIL THEN
  11299. GetRecordTypeName (baseRecord, name);
  11300. IF pointer & ~baseRecord.isObject THEN
  11301. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11302. END;
  11303. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11304. ELSIF recordType.isObject THEN
  11305. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11306. ELSIF pointer THEN
  11307. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11308. ELSE
  11309. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11310. END;
  11311. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11312. Symbol(source, tir, 0, 0);
  11313. start := 0;
  11314. baseRecord := recordType;
  11315. WHILE (baseRecord # NIL) DO
  11316. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11317. baseRecord := baseRecord.GetBaseRecord ();
  11318. END;
  11319. ELSE
  11320. (* explicit trace method: *)
  11321. procedure := recordType.recordScope.FindMethod(0);
  11322. IF ~procedure.isFinalizer THEN
  11323. Global.GetSymbolSegmentedName(procedure, name);
  11324. NamedSymbol(source, name,procedure, 0,0);
  11325. END;
  11326. start := 1;
  11327. END;
  11328. IF (name # stackFrame) & recordType.isObject THEN
  11329. baseRecord := recordType;
  11330. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11331. baseRecord := baseRecord.GetBaseRecord ();
  11332. END;
  11333. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11334. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11335. ELSE
  11336. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11337. END;
  11338. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11339. Symbol(source, tir, 0, 0);
  11340. END;
  11341. methods := recordType.recordScope.numberMethods;
  11342. FOR i := start TO methods-1 DO
  11343. procedure := recordType.recordScope.FindMethod(i);
  11344. IF ~procedure.isFinalizer THEN
  11345. Global.GetSymbolSegmentedName(procedure, name);
  11346. NamedSymbol(source, name,procedure, 0,0);
  11347. END;
  11348. END;
  11349. END CooperativeMethodTable;
  11350. BEGIN
  11351. Global.GetSymbolSegmentedName(td,name);
  11352. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11353. source.SetExported(IsExported(td));
  11354. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11355. IF implementationVisitor.backend.cooperative THEN
  11356. base := NIL;
  11357. baseRecord := recordType.GetBaseRecord();
  11358. IF baseRecord # NIL THEN
  11359. baseTD := baseRecord.typeDeclaration;
  11360. END;
  11361. IF ~recordType.isObject THEN
  11362. Info(source, "parent");
  11363. IF baseRecord # NIL THEN
  11364. Global.GetSymbolSegmentedName(baseTD,name);
  11365. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11366. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11367. ELSE
  11368. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11369. END;
  11370. Symbol(source, tir, 0, 0);
  11371. ELSE
  11372. Address(source,0);
  11373. END;
  11374. Info(source, "record size");
  11375. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11376. source.SetReferenced(FALSE);
  11377. CooperativeMethodTable(FALSE);
  11378. base := source;
  11379. Global.GetSymbolSegmentedName(td,name);
  11380. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11381. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11382. source.SetExported(IsExported(td));
  11383. source.SetReferenced(FALSE);
  11384. END;
  11385. Info(source, "parent");
  11386. IF baseRecord # NIL THEN
  11387. Global.GetSymbolSegmentedName(baseTD,name);
  11388. sym := baseTD;
  11389. IF ~recordType.isObject THEN
  11390. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11391. sym := NIL;
  11392. END;
  11393. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11394. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11395. ELSE
  11396. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11397. END;
  11398. Symbol(source, tir, 0, 0);
  11399. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11400. Address(source,0);
  11401. ELSE
  11402. IF recordType.isObject THEN
  11403. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11404. ELSE
  11405. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11406. END;
  11407. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11408. Symbol(source, tir, 0, 0);
  11409. END;
  11410. Info(source, "base record descriptor");
  11411. Symbol(source, base, 0, 0);
  11412. CooperativeMethodTable(TRUE);
  11413. source.SetReferenced(FALSE);
  11414. IF recordType.hasPointers THEN
  11415. IF ~HasExplicitTraceMethod (recordType) THEN
  11416. implementationVisitor.CreateTraceMethod(recordType);
  11417. END;
  11418. implementationVisitor.CreateResetProcedure(recordType);
  11419. implementationVisitor.CreateAssignProcedure(recordType);
  11420. END;
  11421. ELSIF ~simple THEN
  11422. (*
  11423. MethodEnd = MPO
  11424. ---
  11425. methods (# methods)
  11426. ---
  11427. tags (16)
  11428. ---
  11429. TypeDesc = TypeInfoAdr
  11430. ---
  11431. td adr ---> rec size
  11432. ----
  11433. pointer offsets
  11434. ----
  11435. (padding)
  11436. -----
  11437. empty [2 addresses aligned]
  11438. empty
  11439. empty
  11440. numPtrs
  11441. ---
  11442. pointer offsets
  11443. ---
  11444. *)
  11445. Info(source, "MethodEnd = MPO");
  11446. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11447. source(IntermediateCode.Section).Emit(Data(-1,op));
  11448. MethodTable(TRUE);
  11449. TdTable(TypeTags, TRUE);
  11450. Info(source, "type descriptor info pointer");
  11451. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11452. IF (cellType # NIL) THEN
  11453. IF cellType.sizeInBits < 0 THEN
  11454. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11455. END;
  11456. Info(source, "cell size");
  11457. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11458. ELSE
  11459. Info(source, "record size");
  11460. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11461. END;
  11462. Info(source, "pointer offsets pointer");
  11463. padding := 1- source.pc MOD 2;
  11464. Symbol(source, source, source.pc+1+padding,0);
  11465. IF padding >0 THEN
  11466. Info(source, "padding");
  11467. FOR i := 1 TO padding DO Address(source,0) END;
  11468. END;
  11469. IF cellType # NIL THEN
  11470. PointerArray(source, cellType.cellScope, numberPointers);
  11471. ELSE
  11472. PointerArray(source, recordType.recordScope, numberPointers);
  11473. END;
  11474. ELSE
  11475. (*
  11476. simple:
  11477. td adr --> size
  11478. tag(1)
  11479. tag(2)
  11480. tag(3)
  11481. methods ->
  11482. *)
  11483. Info(source, "record size");
  11484. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11485. TdTable(TypeTags, FALSE);
  11486. MethodTable(FALSE);
  11487. source.SetReferenced(FALSE);
  11488. END;
  11489. END NewTypeDescriptor;
  11490. BEGIN
  11491. x := x.resolved;
  11492. IF (x IS SyntaxTree.PointerType) THEN
  11493. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11494. END;
  11495. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11496. recordType := x(SyntaxTree.RecordType);
  11497. td := x.typeDeclaration;
  11498. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11499. ASSERT(td # NIL);
  11500. section := module.allSections.FindBySymbol(td); (* TODO *)
  11501. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11502. IF implementationVisitor.newObjectFile THEN
  11503. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11504. NewTypeDescriptor
  11505. END;
  11506. ELSE
  11507. (* data section in intermediate code *)
  11508. Global.GetSymbolSegmentedName(td,name);
  11509. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11510. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11511. tir.Emit(Data(-1,op));
  11512. END;
  11513. END;
  11514. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11515. cellType := x(SyntaxTree.CellType);
  11516. td := x.typeDeclaration;
  11517. section := module.allSections.FindBySymbol(td); (* TODO *)
  11518. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11519. IF implementationVisitor.newObjectFile THEN
  11520. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11521. NewTypeDescriptor
  11522. END;
  11523. END;
  11524. END;
  11525. END
  11526. END CheckTypeDeclaration
  11527. END MetaDataGenerator;
  11528. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11529. VAR
  11530. trace-: BOOLEAN;
  11531. traceString-: SyntaxTree.IdentifierString;
  11532. traceModuleName-: SyntaxTree.IdentifierString;
  11533. newObjectFile-: BOOLEAN;
  11534. profile-: BOOLEAN;
  11535. noRuntimeChecks: BOOLEAN;
  11536. simpleMetaData-: BOOLEAN;
  11537. noAsserts: BOOLEAN;
  11538. optimize-: BOOLEAN;
  11539. cooperative-: BOOLEAN;
  11540. preregisterStatic-: BOOLEAN;
  11541. dump-: Basic.Writer;
  11542. cellsAreObjects: BOOLEAN;
  11543. PROCEDURE &InitIntermediateBackend*;
  11544. BEGIN
  11545. simpleMetaData := FALSE;
  11546. newObjectFile := FALSE;
  11547. InitBackend;
  11548. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11549. SetTraceModuleName(DefaultTraceModuleName);
  11550. END InitIntermediateBackend;
  11551. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11552. VAR
  11553. declarationVisitor: DeclarationVisitor;
  11554. implementationVisitor: ImplementationVisitor;
  11555. module: Sections.Module;
  11556. name, platformName: SyntaxTree.IdentifierString;
  11557. meta: MetaDataGenerator;
  11558. BEGIN
  11559. ResetError;
  11560. Global.GetSymbolName(x,name);
  11561. NEW(module,x,system); (* backend structures *)
  11562. Global.GetModuleName(x, name);
  11563. module.SetModuleName(name);
  11564. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11565. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11566. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11567. declarationVisitor.Module(x,module);
  11568. IF newObjectFile & ~meta.simple THEN
  11569. meta.Module(implementationVisitor.moduleBodySection);
  11570. END;
  11571. GetDescription(platformName);
  11572. module.SetPlatformName(platformName);
  11573. RETURN module
  11574. END GenerateIntermediate;
  11575. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11576. BEGIN RETURN TRUE
  11577. END SupportedImmediate;
  11578. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11579. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11580. END ProcessSyntaxTreeModule;
  11581. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11582. VAR
  11583. result: Sections.Module;
  11584. traceName: Basic.MessageString;
  11585. BEGIN
  11586. ASSERT(intermediateCodeModule IS Sections.Module);
  11587. result := intermediateCodeModule(Sections.Module);
  11588. IF trace THEN
  11589. traceName := "intermediate code trace: ";
  11590. Strings.Append(traceName,traceString);
  11591. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11592. IF (traceString="") OR (traceString="*") THEN
  11593. result.Dump(dump);
  11594. dump.Update
  11595. ELSE
  11596. Sections.DumpFiltered(dump, result, traceString);
  11597. END
  11598. END;
  11599. RETURN result
  11600. END ProcessIntermediateCodeModule;
  11601. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11602. BEGIN instructionSet := "Intermediate";
  11603. END GetDescription;
  11604. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11605. BEGIN
  11606. SELF.newObjectFile := newObjectFile;
  11607. SELF.simpleMetaData := simpleMetaData;
  11608. END SetNewObjectFile;
  11609. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11610. BEGIN COPY(name, traceModuleName)
  11611. END SetTraceModuleName;
  11612. PROCEDURE DefineOptions(options: Options.Options);
  11613. BEGIN
  11614. DefineOptions^(options);
  11615. options.Add(0X,"trace",Options.String);
  11616. options.Add(0X,"runtime",Options.String);
  11617. options.Add(0X,"newObjectFile",Options.Flag);
  11618. options.Add(0X,"traceModule",Options.String);
  11619. options.Add(0X,"profile",Options.Flag);
  11620. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11621. options.Add(0X,"noAsserts",Options.Flag);
  11622. options.Add(0X,"metaData",Options.String);
  11623. options.Add('o',"optimize", Options.Flag);
  11624. options.Add(0X,"preregisterStatic", Options.Flag);
  11625. options.Add(0X,"cellsAreObjects", Options.Flag);
  11626. END DefineOptions;
  11627. PROCEDURE GetOptions(options: Options.Options);
  11628. VAR name,string: SyntaxTree.IdentifierString;
  11629. BEGIN
  11630. GetOptions^(options);
  11631. trace := options.GetString("trace",traceString);
  11632. profile := options.GetFlag("profile");
  11633. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11634. noAsserts := options.GetFlag("noAsserts");
  11635. cooperative := options.GetFlag("cooperative");
  11636. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11637. IF cooperative THEN
  11638. SetRuntimeModuleName("CPU") END
  11639. END;
  11640. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11641. simpleMetaData := TRUE
  11642. END;
  11643. IF options.GetString("metaData",string) THEN
  11644. IF string = "simple" THEN simpleMetaData := TRUE
  11645. ELSIF string ="full" THEN simpleMetaData := FALSE
  11646. END;
  11647. END;
  11648. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11649. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11650. optimize := options.GetFlag("optimize");
  11651. preregisterStatic := options.GetFlag("preregisterStatic");
  11652. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11653. END GetOptions;
  11654. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11655. BEGIN RETURN SymbolFileFormat.Get()
  11656. END DefaultSymbolFileFormat;
  11657. END IntermediateBackend;
  11658. (* ----------------------------------- register allocation ------------------------------------- *)
  11659. (* register mapping scheme
  11660. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11661. spill offset
  11662. part(n) --> ticket <--> physical register
  11663. spill offset
  11664. *)
  11665. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11666. emptyOperand: IntermediateCode.Operand;
  11667. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11668. statCoopResetVariables: LONGINT;
  11669. statCoopModifyAssignments: LONGINT;
  11670. modifyAssignmentsPC : LONGINT;
  11671. statCoopNilCheck: LONGINT;
  11672. statCoopSwitch: LONGINT;
  11673. statCoopAssignProcedure: LONGINT;
  11674. statCoopTraceMethod: LONGINT;
  11675. statCoopResetProcedure: LONGINT;
  11676. statCoopTraceModule: LONGINT;
  11677. PROCEDURE ResetStatistics*;
  11678. BEGIN
  11679. statCoopResetVariables := 0;
  11680. statCoopModifyAssignments := 0;
  11681. statCoopNilCheck:= 0;
  11682. statCoopSwitch:= 0;
  11683. statCoopAssignProcedure:= 0;
  11684. statCoopTraceMethod:= 0;
  11685. statCoopResetProcedure:= 0;
  11686. statCoopTraceModule:= 0;
  11687. END ResetStatistics;
  11688. PROCEDURE Statistics*;
  11689. BEGIN
  11690. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11691. TRACE(statCoopNilCheck, statCoopSwitch);
  11692. TRACE(statCoopAssignProcedure,
  11693. statCoopTraceMethod,
  11694. statCoopResetProcedure,
  11695. statCoopTraceModule)
  11696. END Statistics;
  11697. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11698. VAR h: LONGINT;
  11699. BEGIN
  11700. WHILE b # 0 DO
  11701. h := a MOD b;
  11702. a := b;
  11703. b := h;
  11704. END;
  11705. RETURN a
  11706. END GCD;
  11707. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11708. BEGIN
  11709. RETURN a*b DIV GCD(a,b)
  11710. END SCM;
  11711. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11712. BEGIN
  11713. (*TRACE(a,b);*)
  11714. IF a = 0 THEN RETURN b
  11715. ELSIF b = 0 THEN RETURN a
  11716. ELSE RETURN SCM(a,b)
  11717. END;
  11718. END CommonAlignment;
  11719. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11720. BEGIN
  11721. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11722. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11723. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11724. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11725. 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)
  11726. END
  11727. END PassBySingleReference;
  11728. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11729. BEGIN
  11730. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11731. END PassInRegister;
  11732. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11733. VAR new: RegisterEntry;
  11734. BEGIN
  11735. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11736. IF queue = NIL THEN
  11737. queue := new
  11738. ELSE
  11739. new.next := queue;
  11740. IF queue#NIL THEN queue.prev := new END;
  11741. queue := new
  11742. END;
  11743. END AddRegisterEntry;
  11744. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11745. VAR this: RegisterEntry;
  11746. BEGIN
  11747. this := queue;
  11748. WHILE (this # NIL) & (this.register # register) DO
  11749. this := this.next;
  11750. END;
  11751. IF this = NIL THEN
  11752. RETURN FALSE
  11753. END;
  11754. ASSERT(this # NIL);
  11755. IF this = queue THEN queue := queue.next END;
  11756. IF this.prev # NIL THEN this.prev.next := this.next END;
  11757. IF this.next # NIL THEN this.next.prev := this.prev END;
  11758. RETURN TRUE
  11759. END RemoveRegisterEntry;
  11760. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11761. BEGIN ASSERT(cond);
  11762. END Assert;
  11763. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11764. BEGIN
  11765. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11766. END ReusableRegister;
  11767. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11768. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11769. BEGIN
  11770. procedure := moduleScope.bodyProcedure;
  11771. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11772. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11773. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11774. procedure.SetScope(moduleScope);
  11775. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11776. procedure.SetAccess(SyntaxTree.Hidden);
  11777. moduleScope.SetBodyProcedure(procedure);
  11778. moduleScope.AddProcedure(procedure);
  11779. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11780. END;
  11781. END EnsureBodyProcedure;
  11782. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11783. VAR import: SyntaxTree.Import;
  11784. selfName: SyntaxTree.IdentifierString;
  11785. module: SyntaxTree.Module;
  11786. BEGIN
  11787. scope.ownerModule.GetName(selfName);
  11788. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11789. module := scope.ownerModule
  11790. ELSE
  11791. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11792. IF import = NIL THEN
  11793. RETURN NIL
  11794. ELSIF import.module = NIL THEN
  11795. RETURN NIL
  11796. ELSE module := import.module
  11797. END;
  11798. END;
  11799. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11800. END GetSymbol;
  11801. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11802. BEGIN
  11803. op.mode := mode;
  11804. IntermediateCode.InitOperand(op.op);
  11805. IntermediateCode.InitOperand(op.tag);
  11806. IntermediateCode.InitOperand(op.extra);
  11807. op.dimOffset := 0;
  11808. END InitOperand;
  11809. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11810. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11811. BEGIN RETURN IntermediateCode.GetType(system, type)
  11812. END GetType;
  11813. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11814. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11815. BEGIN
  11816. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  11817. (*
  11818. UniqueId(name,module,name,adr);
  11819. *)
  11820. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  11821. constant.SetValue(value);
  11822. module.moduleScope.AddConstant(constant);
  11823. constant.SetScope(module.moduleScope);
  11824. RETURN constant
  11825. END BuildConstant;
  11826. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11827. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  11828. BEGIN
  11829. variable := scope.firstVariable;
  11830. WHILE variable # NIL DO
  11831. IF variable.NeedsTrace() THEN
  11832. RETURN TRUE;
  11833. END;
  11834. variable := variable.nextVariable;
  11835. END;
  11836. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11837. WHILE parameter # NIL DO
  11838. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11839. RETURN TRUE;
  11840. END;
  11841. parameter := parameter.nextParameter;
  11842. END;
  11843. RETURN FALSE;
  11844. END HasPointers;
  11845. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  11846. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  11847. END IsVariableParameter;
  11848. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11849. VAR parameter: SyntaxTree.Parameter;
  11850. BEGIN
  11851. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11852. WHILE parameter # NIL DO
  11853. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  11854. IF parameter.movable THEN RETURN TRUE END;
  11855. parameter := parameter.nextParameter;
  11856. END;
  11857. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  11858. END HasVariableParameters;
  11859. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  11860. BEGIN
  11861. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  11862. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  11863. END HasExplicitTraceMethod;
  11864. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  11865. BEGIN
  11866. IF expression.resolved # NIL THEN expression := expression.resolved END;
  11867. IF (expression IS SyntaxTree.IntegerValue) THEN
  11868. val := expression(SyntaxTree.IntegerValue).value;
  11869. RETURN TRUE
  11870. ELSE
  11871. RETURN FALSE
  11872. END;
  11873. END IsIntegerConstant;
  11874. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  11875. BEGIN
  11876. IF val <= 0 THEN RETURN FALSE END;
  11877. exp := 0;
  11878. WHILE ~ODD(val) DO
  11879. val := val DIV 2;
  11880. INC(exp)
  11881. END;
  11882. RETURN val = 1
  11883. END PowerOf2;
  11884. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  11885. VAR procedure: SyntaxTree.Procedure;
  11886. BEGIN
  11887. procedure := record.recordScope.constructor;
  11888. IF procedure = NIL THEN
  11889. record := record.GetBaseRecord();
  11890. IF record # NIL THEN
  11891. procedure := GetConstructor(record)
  11892. END;
  11893. END;
  11894. RETURN procedure;
  11895. END GetConstructor;
  11896. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  11897. BEGIN
  11898. value := SHORT(op.intValue);
  11899. RETURN op.mode = IntermediateCode.ModeImmediate;
  11900. END IsIntegerImmediate;
  11901. (** whether a type strictily is a pointer to record or object type
  11902. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  11903. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  11904. BEGIN
  11905. IF type = NIL THEN
  11906. RETURN FALSE
  11907. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  11908. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  11909. ELSE
  11910. RETURN FALSE
  11911. END
  11912. END IsStrictlyPointerToRecord;
  11913. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  11914. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  11915. END IsUnsafePointer;
  11916. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  11917. BEGIN type := type.resolved;
  11918. IF type IS SyntaxTree.PointerType THEN
  11919. type := type(SyntaxTree.PointerType).pointerBase;
  11920. type := type.resolved;
  11921. IF type IS SyntaxTree.RecordType THEN
  11922. recordType := type(SyntaxTree.RecordType);
  11923. RETURN TRUE
  11924. ELSE
  11925. RETURN FALSE
  11926. END
  11927. ELSIF type IS SyntaxTree.RecordType THEN
  11928. recordType := type(SyntaxTree.RecordType);
  11929. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  11930. ELSIF type IS SyntaxTree.ObjectType THEN
  11931. RETURN TRUE
  11932. ELSIF type IS SyntaxTree.AnyType THEN
  11933. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  11934. ELSE
  11935. RETURN FALSE
  11936. END;
  11937. END IsPointerToRecord;
  11938. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  11939. BEGIN
  11940. type := type.resolved;
  11941. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  11942. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  11943. END IsArrayOfSystemByte;
  11944. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  11945. BEGIN
  11946. IF type = NIL THEN RETURN FALSE END;
  11947. type := type.resolved;
  11948. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  11949. END IsOpenArray;
  11950. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  11951. BEGIN
  11952. IF type = NIL THEN RETURN FALSE END;
  11953. type := type.resolved;
  11954. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  11955. END IsSemiDynamicArray;
  11956. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  11957. BEGIN
  11958. IF type = NIL THEN RETURN FALSE END;
  11959. type := type.resolved;
  11960. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  11961. END IsStaticArray;
  11962. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  11963. VAR size: LONGINT;
  11964. BEGIN
  11965. size := 1;
  11966. WHILE (IsStaticArray(type)) DO
  11967. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  11968. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11969. END;
  11970. RETURN size;
  11971. END StaticArrayNumElements;
  11972. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11973. BEGIN
  11974. WHILE (IsStaticArray(type)) DO
  11975. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11976. END;
  11977. RETURN type;
  11978. END StaticArrayBaseType;
  11979. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11980. BEGIN
  11981. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  11982. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11983. END;
  11984. RETURN type;
  11985. END ArrayBaseType;
  11986. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  11987. BEGIN
  11988. IF type = NIL THEN RETURN FALSE END;
  11989. type := type.resolved;
  11990. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  11991. END IsDelegate;
  11992. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  11993. VAR i: LONGINT;
  11994. BEGIN
  11995. i := 0; type := type.resolved;
  11996. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  11997. INC(i);
  11998. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  11999. END;
  12000. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12001. INC(i);
  12002. type := type(SyntaxTree.MathArrayType).arrayBase;
  12003. IF type # NIL THEN type := type.resolved END;
  12004. END;
  12005. RETURN i
  12006. END DynamicDim;
  12007. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12008. BEGIN
  12009. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12010. type := type(SyntaxTree.ArrayType).arrayBase;
  12011. END;
  12012. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12013. type := type(SyntaxTree.MathArrayType).arrayBase;
  12014. END;
  12015. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12016. END StaticSize;
  12017. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12018. BEGIN
  12019. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12020. END IsImmediate;
  12021. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12022. BEGIN
  12023. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12024. END IsAddress;
  12025. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12026. BEGIN
  12027. RETURN (x.mode = IntermediateCode.ModeRegister);
  12028. END IsRegister;
  12029. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12030. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12031. BEGIN
  12032. typeDeclaration := recordType.typeDeclaration;
  12033. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12034. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12035. END GetRecordTypeName;
  12036. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12037. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12038. BEGIN
  12039. parSize := 0;
  12040. IF StructuredReturnType(procedureType) THEN
  12041. parameter := procedureType.returnParameter;
  12042. INC(parSize,system.SizeOfParameter(parameter));
  12043. parSize := parSize + (-parSize) MOD system.addressSize;
  12044. END;
  12045. parameter :=procedureType.lastParameter;
  12046. WHILE (parameter # NIL) DO
  12047. INC(parSize,system.SizeOfParameter(parameter));
  12048. parSize := parSize + (-parSize) MOD system.addressSize;
  12049. parameter := parameter.prevParameter;
  12050. END;
  12051. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12052. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12053. RETURN ToMemoryUnits(system,parSize)
  12054. END ParametersSize;
  12055. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12056. BEGIN
  12057. IF type = NIL THEN RETURN FALSE
  12058. ELSE
  12059. type := type.resolved;
  12060. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12061. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12062. END
  12063. END ReturnedAsParameter;
  12064. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12065. BEGIN
  12066. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12067. END StructuredReturnType;
  12068. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12069. BEGIN
  12070. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12071. END IsNested;
  12072. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12073. BEGIN
  12074. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12075. scope := scope.outerScope;
  12076. END;
  12077. RETURN scope # NIL;
  12078. END InCellScope;
  12079. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12080. BEGIN
  12081. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12082. RETURN 0
  12083. ELSE
  12084. *)
  12085. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12086. (*END;*)
  12087. END ProcedureParametersSize;
  12088. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12089. VAR dataUnit: LONGINT;
  12090. BEGIN dataUnit := system.dataUnit;
  12091. ASSERT(size MOD system.dataUnit = 0);
  12092. RETURN size DIV system.dataUnit
  12093. END ToMemoryUnits;
  12094. PROCEDURE Get*(): Backend.Backend;
  12095. VAR backend: IntermediateBackend;
  12096. BEGIN NEW(backend); RETURN backend
  12097. END Get;
  12098. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12099. VAR instruction: IntermediateCode.Instruction;
  12100. BEGIN
  12101. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12102. RETURN instruction
  12103. END Nop;
  12104. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12105. VAR instruction: IntermediateCode.Instruction;
  12106. BEGIN
  12107. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12108. RETURN instruction
  12109. END Mov;
  12110. (* like Mov but ensures that no new register will be allocated for dest *)
  12111. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12112. VAR instruction: IntermediateCode.Instruction;
  12113. BEGIN
  12114. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12115. RETURN instruction
  12116. END MovReplace;
  12117. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12118. VAR instruction: IntermediateCode.Instruction;
  12119. BEGIN
  12120. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12121. RETURN instruction
  12122. END Conv;
  12123. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12124. VAR instruction: IntermediateCode.Instruction;
  12125. BEGIN
  12126. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12127. RETURN instruction
  12128. END Call;
  12129. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12130. VAR op1, op2: IntermediateCode.Operand;
  12131. VAR instruction: IntermediateCode.Instruction;
  12132. BEGIN
  12133. IntermediateCode.InitNumber(op1,pcOffset);
  12134. IntermediateCode.InitNumber(op2,callingConvention);
  12135. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12136. RETURN instruction
  12137. END Exit;
  12138. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12139. VAR instruction: IntermediateCode.Instruction;
  12140. BEGIN
  12141. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12142. RETURN instruction
  12143. END Return;
  12144. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12145. VAR instruction: IntermediateCode.Instruction;
  12146. BEGIN
  12147. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12148. RETURN instruction
  12149. END Result;
  12150. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12151. VAR op1: IntermediateCode.Operand;
  12152. VAR instruction: IntermediateCode.Instruction;
  12153. BEGIN
  12154. IntermediateCode.InitNumber(op1,nr);
  12155. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12156. RETURN instruction
  12157. END Trap;
  12158. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12159. VAR instruction: IntermediateCode.Instruction;
  12160. BEGIN
  12161. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12162. RETURN instruction
  12163. END Br;
  12164. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12165. VAR instruction: IntermediateCode.Instruction;
  12166. BEGIN
  12167. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12168. RETURN instruction
  12169. END Breq;
  12170. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12171. VAR instruction: IntermediateCode.Instruction;
  12172. BEGIN
  12173. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12174. RETURN instruction
  12175. END Brne;
  12176. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12177. VAR instruction: IntermediateCode.Instruction;
  12178. BEGIN
  12179. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12180. RETURN instruction
  12181. END Brge;
  12182. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12183. VAR instruction: IntermediateCode.Instruction;
  12184. BEGIN
  12185. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12186. RETURN instruction
  12187. END Brlt;
  12188. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12189. VAR instruction: IntermediateCode.Instruction;
  12190. BEGIN
  12191. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12192. RETURN instruction
  12193. END Pop;
  12194. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12195. VAR instruction: IntermediateCode.Instruction;
  12196. BEGIN
  12197. ASSERT(op.mode # IntermediateCode.Undefined);
  12198. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12199. RETURN instruction
  12200. END Push;
  12201. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12202. VAR instruction: IntermediateCode.Instruction;
  12203. BEGIN
  12204. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12205. RETURN instruction
  12206. END Neg;
  12207. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12208. VAR instruction: IntermediateCode.Instruction;
  12209. BEGIN
  12210. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12211. RETURN instruction
  12212. END Not;
  12213. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12214. VAR instruction: IntermediateCode.Instruction;
  12215. BEGIN
  12216. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12217. RETURN instruction
  12218. END Abs;
  12219. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12220. VAR instruction: IntermediateCode.Instruction;
  12221. BEGIN
  12222. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12223. RETURN instruction
  12224. END Mul;
  12225. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12226. VAR instruction: IntermediateCode.Instruction;
  12227. BEGIN
  12228. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12229. RETURN instruction
  12230. END Div;
  12231. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12232. VAR instruction: IntermediateCode.Instruction;
  12233. BEGIN
  12234. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12235. RETURN instruction
  12236. END Mod;
  12237. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12238. VAR instruction: IntermediateCode.Instruction;
  12239. BEGIN
  12240. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12241. RETURN instruction
  12242. END Sub;
  12243. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12244. VAR instruction: IntermediateCode.Instruction;
  12245. BEGIN
  12246. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12247. RETURN instruction
  12248. END Add;
  12249. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12250. VAR instruction: IntermediateCode.Instruction;
  12251. BEGIN
  12252. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12253. RETURN instruction
  12254. END And;
  12255. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12256. VAR instruction: IntermediateCode.Instruction;
  12257. BEGIN
  12258. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12259. RETURN instruction
  12260. END Or;
  12261. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12262. VAR instruction: IntermediateCode.Instruction;
  12263. BEGIN
  12264. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12265. RETURN instruction
  12266. END Xor;
  12267. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12268. VAR instruction: IntermediateCode.Instruction;
  12269. BEGIN
  12270. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12271. RETURN instruction
  12272. END Shl;
  12273. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12274. VAR instruction: IntermediateCode.Instruction;
  12275. BEGIN
  12276. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12277. RETURN instruction
  12278. END Shr;
  12279. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12280. VAR instruction: IntermediateCode.Instruction;
  12281. BEGIN
  12282. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12283. RETURN instruction
  12284. END Rol;
  12285. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12286. VAR instruction: IntermediateCode.Instruction;
  12287. BEGIN
  12288. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12289. RETURN instruction
  12290. END Ror;
  12291. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12292. VAR instruction: IntermediateCode.Instruction;
  12293. BEGIN
  12294. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12295. RETURN instruction
  12296. END Cas;
  12297. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12298. VAR instruction: IntermediateCode.Instruction;
  12299. BEGIN
  12300. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12301. RETURN instruction
  12302. END Copy;
  12303. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12304. VAR instruction: IntermediateCode.Instruction;
  12305. BEGIN
  12306. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12307. RETURN instruction
  12308. END Fill;
  12309. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12310. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12311. BEGIN
  12312. string := IntermediateCode.String(s);
  12313. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12314. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12315. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12316. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12317. RETURN instruction
  12318. END Asm;
  12319. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12320. VAR instruction: IntermediateCode.Instruction;
  12321. BEGIN
  12322. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12323. RETURN instruction
  12324. END Data;
  12325. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12326. VAR instruction: IntermediateCode.Instruction;
  12327. BEGIN
  12328. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12329. IntermediateCode.SetSubType(instruction, subtype);
  12330. RETURN instruction
  12331. END SpecialInstruction;
  12332. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12333. VAR op1: IntermediateCode.Operand;
  12334. VAR instruction: IntermediateCode.Instruction;
  12335. BEGIN
  12336. (*! generate a warning if size exceeds a certain limit *)
  12337. (*
  12338. ASSERT(bytes < 1000000); (* sanity check *)
  12339. *)
  12340. ASSERT(0 <= units); (* sanity check *)
  12341. IntermediateCode.InitNumber(op1,units);
  12342. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12343. RETURN instruction
  12344. END Reserve;
  12345. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12346. VAR op1: IntermediateCode.Operand;
  12347. VAR instruction: IntermediateCode.Instruction;
  12348. BEGIN
  12349. IntermediateCode.InitNumber(op1,position);
  12350. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12351. RETURN instruction
  12352. END LabelInstruction;
  12353. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12354. VAR pc: LONGINT;
  12355. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12356. BEGIN
  12357. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12358. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12359. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12360. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12361. IF instr.op1.type.form = IntermediateCode.Float THEN
  12362. RETURN instr.op1.floatValue = op.floatValue
  12363. ELSE
  12364. RETURN instr.op1.intValue = op.intValue
  12365. END;
  12366. END ProvidesValue;
  12367. BEGIN
  12368. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12369. pc := 0;
  12370. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12371. INC(pc);
  12372. END;
  12373. IF pc = data.pc THEN
  12374. data.Emit(Data(-1,vop));
  12375. END;
  12376. RETURN pc
  12377. END EnterImmediate;
  12378. PROCEDURE Init;
  12379. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12380. BEGIN
  12381. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12382. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12383. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12384. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12385. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12386. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12387. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12388. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12389. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12390. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12391. IntermediateCode.InitOperand(emptyOperand);
  12392. FOR i := 0 TO NumberSystemCalls-1 DO
  12393. name := "@SystemCall";
  12394. Basic.AppendNumber(name,i);
  12395. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12396. END;
  12397. END Init;
  12398. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12399. BEGIN
  12400. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12401. END IsExported;
  12402. BEGIN
  12403. Init;
  12404. END FoxIntermediateBackend.
  12405. Compiler.Compile FoxIntermediateBackend.Mod ~