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: 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. irv.Emit(Reserve(x.position, DynamicDim(x.type) * ToMemoryUnits(system, system.addressSize)));
  306. ELSE
  307. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))));
  308. IF ~x.fixed THEN
  309. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  310. ELSE
  311. align := x.alignment;
  312. END;
  313. irv.SetPositionOrAlignment(x.fixed, align);
  314. meta.CheckTypeDeclaration(x.type);
  315. END;
  316. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  317. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  318. END;
  319. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  320. END VisitVariable;
  321. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  322. VAR name: Basic.SegmentedName; irv, irl: IntermediateCode.Section; op: Operand; dim: LONGINT;
  323. BEGIN
  324. HALT(100);
  325. (*
  326. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  327. (* code section for variable *)
  328. Global.GetSymbolSegmentedName(x,name);
  329. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  330. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  331. (*
  332. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  333. *)
  334. IF IsSemiDynamicArray(x.type) & ~backend.cellsAreObjects THEN
  335. HALT(100);
  336. irv.Emit(Reserve(x.position, system.addressSize));
  337. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  338. irl := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  339. irl.Emit(Reserve(x.position, DynamicDim(x.type) * system.addressSize));
  340. ELSIF x.defaultValue = NIL THEN
  341. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  342. ELSE
  343. implementationVisitor.inData := TRUE;
  344. implementationVisitor.Evaluate(x.defaultValue, op);
  345. irv.Emit(Data(x.position,op.op));
  346. implementationVisitor.inData := FALSE;
  347. END;
  348. meta.CheckTypeDeclaration(x.type);
  349. *)
  350. END VisitParameter;
  351. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  352. BEGIN
  353. Type(x.declaredType); (* => code in objects *)
  354. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  355. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  356. END;
  357. END VisitTypeDeclaration;
  358. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  359. BEGIN
  360. IF (SyntaxTree.Public * x.access # {}) THEN
  361. implementationVisitor.VisitConstant(x);
  362. END;
  363. END VisitConstant;
  364. PROCEDURE Scope(x: SyntaxTree.Scope);
  365. VAR procedure: SyntaxTree.Procedure;
  366. constant: SyntaxTree.Constant;
  367. variable: SyntaxTree.Variable;
  368. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  369. BEGIN
  370. prevScope := currentScope;
  371. currentScope := x;
  372. (* constants treated in implementation visitor *)
  373. typeDeclaration := x.firstTypeDeclaration;
  374. WHILE typeDeclaration # NIL DO
  375. VisitTypeDeclaration(typeDeclaration);
  376. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  377. END;
  378. variable := x.firstVariable;
  379. WHILE variable # NIL DO
  380. VisitVariable(variable);
  381. variable := variable.nextVariable;
  382. END;
  383. procedure := x.firstProcedure;
  384. WHILE procedure # NIL DO
  385. VisitProcedure(procedure);
  386. procedure := procedure.nextProcedure;
  387. END;
  388. constant := x.firstConstant;
  389. WHILE constant # NIL DO
  390. VisitConstant(constant);
  391. constant := constant.nextConstant;
  392. END;
  393. currentScope := prevScope;
  394. END Scope;
  395. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  396. VAR parameter: SyntaxTree.Parameter;
  397. BEGIN
  398. parameter := first;
  399. WHILE parameter # NIL DO
  400. VisitParameter(parameter);
  401. parameter := parameter.nextParameter;
  402. END;
  403. END Parameters;
  404. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  405. VAR scope: SyntaxTree.ProcedureScope;
  406. prevScope: SyntaxTree.Scope;
  407. inline, finalizer: BOOLEAN;
  408. procedureType: SyntaxTree.ProcedureType;
  409. pc: LONGINT;
  410. stackSize: LONGINT;
  411. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  412. null,size,src,dest,fp,res: IntermediateCode.Operand;
  413. cc: LONGINT;
  414. cellType: SyntaxTree.CellType;
  415. registerNumber: LONGINT;
  416. registerClass: IntermediateCode.RegisterClass;
  417. type: IntermediateCode.Type;
  418. formalParameter: SyntaxTree.Parameter;
  419. recordType: SyntaxTree.RecordType;
  420. isModuleBody: BOOLEAN;
  421. PROCEDURE Signature;
  422. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  423. BEGIN
  424. procedureType := x.type(SyntaxTree.ProcedureType);
  425. returnType := procedureType.returnType;
  426. IF returnType # NIL THEN
  427. meta.CheckTypeDeclaration(returnType)
  428. END;
  429. parameter := procedureType.firstParameter;
  430. WHILE parameter # NIL DO
  431. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  432. parameter := parameter.nextParameter;
  433. END;
  434. END Signature;
  435. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  436. VAR result: BOOLEAN;
  437. BEGIN
  438. result := FALSE;
  439. IF x = SyntaxTree.invalidExpression THEN
  440. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  441. result := TRUE;
  442. value := x.resolved(SyntaxTree.IntegerValue).value;
  443. ELSE
  444. Error(x.position,"expression is not an integer constant");
  445. END;
  446. RETURN result;
  447. END CheckIntegerValue;
  448. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  449. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  450. BEGIN
  451. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  452. WHILE (this # NIL) & (this.identifier # id) DO
  453. this := this.nextModifier;
  454. END;
  455. IF this # NIL THEN
  456. IF this.expression = NIL THEN
  457. Error(this.position,"expected expression value");
  458. ELSIF CheckIntegerValue(this.expression,value) THEN
  459. END;
  460. RETURN TRUE
  461. ELSE RETURN FALSE
  462. END;
  463. END HasValue;
  464. CONST DefaultDataMemorySize=512;
  465. BEGIN
  466. IF x.externalName # NIL THEN RETURN END;
  467. (*
  468. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  469. *)
  470. (* code section for this procedure *)
  471. scope := x.procedureScope;
  472. prevScope := currentScope;
  473. currentScope := scope;
  474. procedureType := x.type(SyntaxTree.ProcedureType);
  475. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  476. implementationVisitor.temporaries.Init;
  477. implementationVisitor.usedRegisters := NIL;
  478. implementationVisitor.registerUsageCount.Init;
  479. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  480. IF (scope.body # NIL) & (x.isInline) THEN
  481. inline := TRUE;
  482. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  483. ir.SetExported(IsExported(x));
  484. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  485. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  486. IF backend.cellsAreObjects THEN
  487. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  488. ir.SetExported(IsExported(x));
  489. ELSE
  490. RETURN; (* cellnet cannot be compiled for final static hardware *)
  491. END;
  492. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  493. inline := FALSE;
  494. AddBodyCallStub(x);
  495. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  496. ir.SetExported(IsExported(x));
  497. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  498. inline := FALSE;
  499. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  500. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  501. AddBodyCallStub(x);
  502. AddStackAllocation(x,stackSize);
  503. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  504. ir.SetExported(IsExported(x));
  505. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  506. inline := FALSE;
  507. Parameters(procedureType.firstParameter);
  508. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  509. ir.SetExported(IsExported(x));
  510. ELSE
  511. inline := FALSE;
  512. IF x.isEntry OR x.isExit THEN
  513. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  514. ir.SetExported(TRUE);
  515. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  516. ELSE
  517. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  518. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  519. END;
  520. END;
  521. cc := procedureType.callingConvention;
  522. IF scope.body # NIL THEN
  523. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  524. registerNumber := 0;
  525. IF ~inline THEN
  526. IF scope.lastVariable = NIL THEN
  527. stackSize := 0
  528. ELSE
  529. stackSize := scope.lastVariable.offsetInBits;
  530. IF stackSize <0 THEN stackSize := -stackSize END;
  531. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  532. END;
  533. (*
  534. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  535. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  536. *)
  537. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  538. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  539. END;
  540. pc := ir.pc-1;
  541. (*
  542. ir.Emit(Nop(position)); (* placeholder for fill *)
  543. *)
  544. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  545. formalParameter := procedureType.lastParameter;
  546. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  547. IF ~PassInRegister(formalParameter) THEN
  548. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  549. ELSE
  550. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  551. type := GetType(system, formalParameter.type);
  552. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  553. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  554. ir.Emit(Mov(-1,dest, src));
  555. implementationVisitor.ReleaseIntermediateOperand(src);
  556. INC(registerNumber);
  557. formalParameter := formalParameter.prevParameter;
  558. END;
  559. END;
  560. END;
  561. ir.EnterValidPAF;
  562. END;
  563. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  564. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  565. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  566. IF scope.lastVariable # NIL THEN
  567. stackSize := scope.lastVariable.offsetInBits;
  568. IF stackSize <0 THEN stackSize := -stackSize END;
  569. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  570. END;
  571. END;
  572. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  573. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  574. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  575. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  576. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  577. ir.EmitAt(pc,Push(size));
  578. implementationVisitor.StaticCallOperand(result,procedure);
  579. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  580. END;
  581. *)
  582. END;
  583. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  584. IF stackSize > 0 THEN
  585. IF (stackSize MOD system.addressSize = 0) THEN
  586. null := IntermediateCode.Immediate(addressType,0);
  587. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  588. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  589. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  590. ELSE
  591. null := IntermediateCode.Immediate(int8,0);
  592. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  593. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  594. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  595. END;
  596. (*! should potentially be called by backend -- enter might initialize
  597. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  598. *)
  599. END;
  600. ir.ExitValidPAF;
  601. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  602. finalizer := FALSE;
  603. IF backend.cooperative & x.isFinalizer THEN
  604. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  605. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  606. GetRecordTypeName(recordType,name);
  607. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  608. END;
  609. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  610. IF backend.cooperative THEN
  611. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  612. IF implementationVisitor.profile & ~isModuleBody THEN
  613. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  614. END;
  615. END;
  616. implementationVisitor.EmitLeave(ir, x.position,cc);
  617. IF finalizer THEN
  618. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  619. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  620. ir.Emit(Br(x.position,dest));
  621. ELSE
  622. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  623. END;
  624. ELSE
  625. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  626. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  627. END;
  628. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  629. IF backend.cooperative THEN
  630. IF HasPointers (scope) THEN
  631. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  632. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  633. ir.Emit(Result(x.position, res));
  634. ir.Emit(Push(x.position, res));
  635. implementationVisitor.ResetVariables(scope);
  636. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  637. ir.Emit(Pop(x.position, res));
  638. ir.Emit(Return(x.position, res));
  639. ELSE
  640. implementationVisitor.ResetVariables(scope);
  641. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  642. END;
  643. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  644. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  645. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  646. ir.Emit(Result(x.position, res));
  647. ir.Emit(Push(x.position, res));
  648. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  649. ir.Emit(Pop(x.position, res));
  650. ir.Emit(Return(x.position, res));
  651. ELSE
  652. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  653. END;
  654. END;
  655. implementationVisitor.EmitLeave(ir,x.position,cc);
  656. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  657. ELSE
  658. ir.Emit(Nop(x.position));
  659. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  660. implementationVisitor.EmitLeave(ir,x.position,cc);
  661. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  662. END;
  663. END;
  664. END
  665. END;
  666. ELSE (* force body for procedures *)
  667. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  668. ir.EnterValidPAF;
  669. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  670. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  671. ir.ExitValidPAF;
  672. implementationVisitor.EmitLeave(ir,x.position,cc);
  673. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  674. END;
  675. Scope(scope);
  676. Signature;
  677. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  678. currentScope := prevScope;
  679. END Procedure;
  680. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  681. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  682. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  683. BEGIN
  684. ASSERT (bodyProcedure # NIL);
  685. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  686. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  687. procedure.SetScope(bodyProcedure.scope);
  688. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  689. procedure.SetAccess(SyntaxTree.Hidden);
  690. Global.GetSymbolSegmentedName (procedure,name);
  691. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  692. ir.SetExported(TRUE);
  693. ir.SetPriority(InitPriority);
  694. Global.GetSymbolSegmentedName (bodyProcedure,name);
  695. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  696. implementationVisitor.currentScope := module.module.moduleScope;
  697. implementationVisitor.section := ir;
  698. implementationVisitor.PushSelfPointer();
  699. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  700. ELSIF backend.preregisterStatic THEN
  701. implementationVisitor.currentScope := module.module.moduleScope;
  702. implementationVisitor.section := ir;
  703. implementationVisitor.PushSelfPointer();
  704. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  705. ELSE
  706. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  707. ir.Emit(Call(bodyProcedure.position,op, 0));
  708. END;
  709. END AddBodyCallStub;
  710. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  711. VAR name: Basic.SegmentedName;
  712. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  713. BEGIN
  714. Global.GetSymbolSegmentedName (symbol,name);
  715. Basic.RemoveSuffix(name);
  716. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  717. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  718. ir.SetExported(TRUE);
  719. ir.SetPriority(FirstPriority);
  720. IntermediateCode.InitImmediate(op,addressType,initStack);
  721. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  722. END AddStackAllocation;
  723. (** entry function to visit a complete module *)
  724. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  725. VAR
  726. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  727. hasDynamicOperatorDeclarations: BOOLEAN;
  728. operator: SyntaxTree.Operator;
  729. import: SyntaxTree.Import;
  730. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  731. BEGIN
  732. type := type.resolved;
  733. IF type IS SyntaxTree.RecordType THEN
  734. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  735. ELSIF (type IS SyntaxTree.ArrayType) THEN
  736. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  737. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  738. END;
  739. ELSIF type IS SyntaxTree.MathArrayType THEN
  740. WITH type: SyntaxTree.MathArrayType DO
  741. IF type.form = SyntaxTree.Open THEN
  742. RETURN TRUE
  743. ELSIF type.form = SyntaxTree.Static THEN
  744. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  745. END;
  746. END;
  747. END;
  748. RETURN FALSE
  749. END TypeNeedsInitialization;
  750. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  751. VAR variable: SyntaxTree.Variable;
  752. BEGIN
  753. variable := scope.firstVariable;
  754. WHILE variable # NIL DO
  755. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  756. IF variable.initializer # NIL THEN RETURN TRUE END;
  757. variable := variable.nextVariable;
  758. END;
  759. RETURN FALSE
  760. END ScopeNeedsInitialization;
  761. BEGIN
  762. ASSERT(x # NIL); ASSERT(module # NIL);
  763. SELF.module := module;
  764. (* add import names to the generated Sections.Module *)
  765. import := x.moduleScope.firstImport;
  766. WHILE import # NIL DO
  767. import.module.GetName(idstr);
  768. module.imports.AddName(idstr);
  769. import := import.nextImport
  770. END;
  771. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  772. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  773. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  774. moduleSelf.SetType(system.anyType);
  775. moduleSelf.SetScope(x.moduleScope);
  776. moduleSelf.SetUntraced(TRUE);
  777. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  778. ir.SetExported(TRUE);
  779. IntermediateCode.InitImmediate(op,addressType,0);
  780. ir.Emit(Data(-1,op));
  781. END;
  782. implementationVisitor.module := module;
  783. implementationVisitor.moduleScope := x.moduleScope;
  784. implementationVisitor.moduleSelf := moduleSelf;
  785. implementationVisitor.canBeLoaded := TRUE;
  786. meta.SetModule(module);
  787. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  788. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  789. END;
  790. IF backend.profile THEN
  791. EnsureBodyProcedure(x.moduleScope);
  792. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  793. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  794. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  795. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  796. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  797. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  798. Global.GetModuleName(module.module,idstr);
  799. implementationVisitor.ProfilerAddModule(idstr);
  800. implementationVisitor.numberProcedures := 0;
  801. END;
  802. implementationVisitor.profile := backend.profile;
  803. (* check if there is at least one dynamic operator locally defined *)
  804. hasDynamicOperatorDeclarations := FALSE;
  805. operator := x.moduleScope.firstOperator;
  806. WHILE operator # NIL DO
  807. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  808. operator := operator.nextOperator
  809. END;
  810. (* add operator initialization code section *)
  811. IF hasDynamicOperatorDeclarations THEN
  812. EnsureBodyProcedure(x.moduleScope);
  813. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  814. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  815. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  816. END;
  817. Scope(x.moduleScope);
  818. IF hasDynamicOperatorDeclarations THEN
  819. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  820. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  821. END;
  822. IF backend.profile THEN
  823. implementationVisitor.ProfilerPatchInit;
  824. END;
  825. END Module;
  826. END DeclarationVisitor;
  827. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  828. RegisterUsageCount*=OBJECT
  829. VAR used: UsedArray; count: LONGINT;
  830. PROCEDURE &Init;
  831. VAR i: LONGINT;
  832. BEGIN
  833. count := 0;
  834. IF used = NIL THEN NEW(used,64); END;
  835. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  836. END Init;
  837. PROCEDURE Grow;
  838. VAR new: UsedArray; size,i: LONGINT;
  839. BEGIN
  840. size := LEN(used)*2;
  841. NEW(new,size);
  842. FOR i := 0 TO LEN(used)-1 DO
  843. new[i].count := used[i].count;
  844. new[i].type := used[i].type;
  845. new[i].map := used[i].map
  846. END;
  847. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  848. used := new
  849. END Grow;
  850. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  851. BEGIN
  852. INC(count);
  853. IF count = LEN(used) THEN Grow END;
  854. used[count].type := type;
  855. used[count].class := class;
  856. used[count].map := count;
  857. RETURN count;
  858. END Next;
  859. PROCEDURE IncUse(register: LONGINT);
  860. BEGIN
  861. INC(used[register].count);
  862. (*
  863. IF (register = 1) & (count > 30) THEN
  864. D.TraceBack;
  865. END;
  866. *)
  867. END IncUse;
  868. PROCEDURE DecUse(register: LONGINT);
  869. BEGIN
  870. DEC(used[register].count);
  871. END DecUse;
  872. PROCEDURE Map(register: LONGINT): LONGINT;
  873. VAR map : LONGINT;
  874. BEGIN
  875. IF register > 0 THEN
  876. map := used[register].map;
  877. WHILE register # map DO register := map; map := used[register].map END;
  878. END;
  879. RETURN register
  880. END Map;
  881. PROCEDURE Use(register: LONGINT): LONGINT;
  882. BEGIN
  883. IF register< LEN(used) THEN
  884. RETURN used[register].count
  885. ELSE
  886. RETURN 0
  887. END
  888. END Use;
  889. END RegisterUsageCount;
  890. RegisterEntry = POINTER TO RECORD
  891. prev,next: RegisterEntry;
  892. register: LONGINT;
  893. registerClass: IntermediateCode.RegisterClass;
  894. type: IntermediateCode.Type;
  895. END;
  896. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  897. Variables = OBJECT (Basic.List)
  898. VAR
  899. inUse: VariableUse;
  900. registerIndex: LONGINT;
  901. PROCEDURE & Init;
  902. VAR i: LONGINT;
  903. BEGIN
  904. InitList(16);
  905. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  906. registerIndex := 1024;
  907. END Init;
  908. PROCEDURE GetUsage(VAR use: VariableUse);
  909. BEGIN
  910. use := inUse;
  911. END GetUsage;
  912. PROCEDURE SetUsage(CONST use: VariableUse);
  913. BEGIN
  914. inUse := use;
  915. END SetUsage;
  916. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  917. VAR any: ANY;
  918. BEGIN
  919. any := Get(i);;
  920. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  921. END GetVariable;
  922. PROCEDURE Occupy(pos: LONGINT);
  923. BEGIN
  924. INCL(inUse[pos DIV 32], pos MOD 32);
  925. END Occupy;
  926. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  927. BEGIN
  928. Occupy(Length());
  929. Add(v);
  930. END AddVariable;
  931. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  932. VAR var : SyntaxTree.Variable;
  933. BEGIN
  934. FOR pos := 0 TO Length()-1 DO
  935. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  936. var := GetVariable(pos);
  937. IF type.SameType(var.type) THEN
  938. Occupy(pos); RETURN var
  939. END;
  940. END;
  941. END;
  942. pos := Length();
  943. RETURN NIL
  944. END GetFreeVariable;
  945. END Variables;
  946. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  947. SymbolMapper = OBJECT
  948. VAR
  949. first: SymbolMap;
  950. PROCEDURE & Init;
  951. BEGIN
  952. first := NIL;
  953. END Init;
  954. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  955. VAR new: SymbolMap;
  956. BEGIN
  957. NEW(new); new.this := this; new.to := to; new.tag := tag;
  958. new.next := first; first := new;
  959. END Add;
  960. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  961. VAR s: SymbolMap;
  962. BEGIN
  963. s := first;
  964. WHILE (s # NIL) & (s.this # this) DO
  965. s := s.next
  966. END;
  967. RETURN s
  968. END Get;
  969. END SymbolMapper;
  970. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  971. VAR
  972. system: Global.System;
  973. section: IntermediateCode.Section;
  974. module: Sections.Module;
  975. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  976. awaitProcCounter, labelId, constId, caseId: LONGINT;
  977. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  978. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  979. checker: SemanticChecker.Checker;
  980. backend: IntermediateBackend;
  981. meta: MetaDataGenerator;
  982. position: LONGINT;
  983. moduleSelf: SyntaxTree.Variable;
  984. (* variables for hand over of variables / temporary state *)
  985. currentScope: SyntaxTree.Scope;
  986. constantDeclaration : SyntaxTree.Symbol;
  987. result: Operand; (* result of the most recent expression / statement *)
  988. destination: IntermediateCode.Operand;
  989. arrayDestinationTag: IntermediateCode.Operand;
  990. arrayDestinationDimension:LONGINT;
  991. currentLoop: Label; (* variable to hand over loop exit jump list *)
  992. conditional: BOOLEAN;
  993. trueLabel, falseLabel, exitLabel: Label;
  994. locked: BOOLEAN;
  995. (*
  996. usedRegisters: Registers;
  997. *)
  998. registerUsageCount: RegisterUsageCount;
  999. usedRegisters: RegisterEntry;
  1000. (* useful operands and types *)
  1001. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1002. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1003. commentPrintout: Printout.Printer;
  1004. dump: Streams.Writer;
  1005. tagsAvailable : BOOLEAN;
  1006. supportedInstruction: SupportedInstructionProcedure;
  1007. supportedImmediate: SupportedImmediateProcedure;
  1008. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1009. emitLabels: BOOLEAN;
  1010. runtimeModuleName : SyntaxTree.IdentifierString;
  1011. newObjectFile: BOOLEAN;
  1012. indexCounter: LONGINT;
  1013. profile: BOOLEAN;
  1014. profileId, profileInit: IntermediateCode.Section;
  1015. profileInitPatchPosition: LONGINT;
  1016. numberProcedures: LONGINT;
  1017. procedureResultDesignator : SyntaxTree.Designator;
  1018. operatorInitializationCodeSection: IntermediateCode.Section;
  1019. fingerPrinter: FingerPrinter.FingerPrinter;
  1020. temporaries: Variables;
  1021. canBeLoaded : BOOLEAN;
  1022. currentIsInline: BOOLEAN;
  1023. currentMapper: SymbolMapper;
  1024. currentInlineExit: Label;
  1025. moduleBodySection: IntermediateCode.Section;
  1026. NeedDescriptor : BOOLEAN;
  1027. cooperativeSwitches: BOOLEAN;
  1028. lastSwitchPC: LONGINT;
  1029. isUnchecked: BOOLEAN;
  1030. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1031. newObjectFile: BOOLEAN);
  1032. BEGIN
  1033. SELF.system := system;
  1034. SELF.runtimeModuleName := runtime;
  1035. currentScope := NIL;
  1036. hiddenPointerType := NIL;
  1037. delegatePointerType := NIL;
  1038. awaitProcCounter := 0;
  1039. labelId := 0; constId := 0; labelId := 0;
  1040. SELF.checker := checker;
  1041. SELF.backend := backend;
  1042. position := Diagnostics.Invalid;
  1043. conditional := FALSE;
  1044. locked := FALSE;
  1045. InitOperand(result,ModeUndefined);
  1046. addressType := IntermediateCode.GetType(system,system.addressType);
  1047. setType := IntermediateCode.GetType(system,system.setType);
  1048. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1049. byteType := IntermediateCode.GetType(system, system.byteType);
  1050. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1051. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1052. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1053. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1054. nil := IntermediateCode.Immediate(addressType,0);
  1055. IntermediateCode.InitOperand(destination);
  1056. tagsAvailable := TRUE;
  1057. supportedInstruction := supportedInstructionProcedure;
  1058. supportedImmediate := supportedImmediateProcedure;
  1059. inData := FALSE;
  1060. SELF.emitLabels := emitLabels;
  1061. IntermediateCode.InitOperand(arrayDestinationTag);
  1062. bool := IntermediateCode.GetType(system,system.booleanType);
  1063. IntermediateCode.InitImmediate(false,bool,0);
  1064. IntermediateCode.InitImmediate(true,bool,1);
  1065. SELF.newObjectFile := newObjectFile;
  1066. indexCounter := 0;
  1067. NEW(registerUsageCount);
  1068. usedRegisters := NIL;
  1069. procedureResultDesignator := NIL;
  1070. NEW(fingerPrinter, system);
  1071. NEW(temporaries);
  1072. currentIsInline := FALSE;
  1073. NeedDescriptor := FALSE;
  1074. isUnchecked := backend.noRuntimeChecks;
  1075. END Init;
  1076. TYPE Context = RECORD
  1077. section: IntermediateCode.Section;
  1078. registerUsageCount: RegisterUsageCount;
  1079. usedRegisters: RegisterEntry;
  1080. END;
  1081. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1082. VAR context: Context;
  1083. BEGIN
  1084. context.section := section;
  1085. context.registerUsageCount := registerUsageCount;
  1086. context.usedRegisters := usedRegisters;
  1087. section := new;
  1088. NEW(registerUsageCount);
  1089. usedRegisters := NIL;
  1090. RETURN context;
  1091. END SwitchContext;
  1092. PROCEDURE ReturnToContext(context: Context);
  1093. BEGIN
  1094. section := context.section;
  1095. registerUsageCount := context.registerUsageCount;
  1096. usedRegisters := context.usedRegisters;
  1097. END ReturnToContext;
  1098. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1099. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1100. BEGIN
  1101. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1102. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1103. END;
  1104. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1105. section.SetExported(IsExported(syntaxTreeSymbol));
  1106. RETURN section
  1107. END NewSection;
  1108. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1109. VAR new: LONGINT;
  1110. BEGIN
  1111. new := registerUsageCount.Next(type,class);
  1112. UseRegister(new);
  1113. RETURN new
  1114. END AcquireRegister;
  1115. (** get the name for the code section that represens a certain symbol
  1116. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1117. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1118. VAR
  1119. operatorFingerPrint: SyntaxTree.FingerPrint;
  1120. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1121. BEGIN
  1122. Global.GetSymbolSegmentedName(symbol, name);
  1123. (* if the symbol is an operator, then append the fingerprint to the name *)
  1124. IF symbol IS SyntaxTree.Operator THEN
  1125. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1126. string := "[";
  1127. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1128. Strings.Append(string, operatorFingerPrintString);
  1129. Strings.Append(string, "]");
  1130. Basic.AppendToSegmentedName(name,string);
  1131. END
  1132. END GetCodeSectionNameForSymbol;
  1133. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1134. BEGIN
  1135. IF dump # NIL THEN
  1136. dump.String("enter "); dump.String(s); dump.Ln;
  1137. END;
  1138. END TraceEnter;
  1139. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1140. BEGIN
  1141. IF dump # NIL THEN
  1142. dump.String("exit "); dump.String(s); dump.Ln;
  1143. END;
  1144. END TraceExit;
  1145. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1146. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1147. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1148. VAR i: LONGINT;
  1149. BEGIN
  1150. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1151. IF op.rule # NIL THEN
  1152. FOR i := 0 TO LEN(op.rule)-1 DO
  1153. CheckRegister(op.rule[i])
  1154. END;
  1155. END;
  1156. END CheckRegister;
  1157. BEGIN
  1158. CheckRegister(instruction.op1);
  1159. CheckRegister(instruction.op2);
  1160. CheckRegister(instruction.op3);
  1161. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1162. ELSE section.Emit(instruction);
  1163. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1164. END;
  1165. END Emit;
  1166. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1167. BEGIN
  1168. IF backend.cooperative THEN
  1169. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1170. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1171. ELSE
  1172. Emit(Trap(position,trapNo));
  1173. END;
  1174. END EmitTrap;
  1175. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1176. VAR name: Basic.SegmentedName;
  1177. VAR op1, op2, reg: IntermediateCode.Operand;
  1178. VAR call, nocall: Label;
  1179. VAR parametersSize: LONGINT;
  1180. VAR prevSection: IntermediateCode.Section;
  1181. VAR prevDump: Streams.Writer;
  1182. VAR body: SyntaxTree.Body;
  1183. BEGIN
  1184. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1185. prevSection := SELF.section;
  1186. SELF.section := section;
  1187. prevDump := dump;
  1188. dump := section.comments;
  1189. IF backend.hasLinkRegister THEN
  1190. Emit(Push(-1, lr));
  1191. END;
  1192. Emit(Push(-1,fp));
  1193. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1194. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1195. GetCodeSectionNameForSymbol(procedure, name);
  1196. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1197. ELSE
  1198. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1199. END;
  1200. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1201. Emit(Push(-1,op1));
  1202. Emit(Mov(-1,fp, sp));
  1203. body := procedure.procedureScope.body;
  1204. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1205. NEW(call, section);
  1206. NEW(nocall, section);
  1207. reg := NewRegisterOperand(addressType);
  1208. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1209. Emit(Sub(-1,reg, sp, op1));
  1210. BrltL(call, sp, reg);
  1211. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1212. BrgeL(nocall, sp, op2);
  1213. call.Resolve(section.pc);
  1214. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1215. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1216. Emit(Push(-1, op2));
  1217. Emit(Push(-1, reg));
  1218. ReleaseIntermediateOperand(reg);
  1219. CallThis(position, "Activities","ExpandStack",2);
  1220. Emit(Result(-1, sp));
  1221. nocall.Resolve(section.pc);
  1222. END;
  1223. ELSE
  1224. Emit(Mov(-1, fp, sp));
  1225. END;
  1226. Emit(Enter(-1, callconv, varSize));
  1227. SELF.section := prevSection;
  1228. dump := prevDump;
  1229. END EmitEnter;
  1230. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1231. VAR op1,op2: IntermediateCode.Operand;
  1232. VAR instruction: IntermediateCode.Instruction;
  1233. BEGIN
  1234. IntermediateCode.InitNumber(op1,callconv);
  1235. IntermediateCode.InitNumber(op2,varSize);
  1236. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1237. RETURN instruction
  1238. END Enter;
  1239. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1240. VAR op1: IntermediateCode.Operand;
  1241. VAR instruction: IntermediateCode.Instruction;
  1242. BEGIN
  1243. IntermediateCode.InitNumber(op1,callconv);
  1244. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1245. RETURN instruction
  1246. END Leave;
  1247. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1248. VAR prevSection: IntermediateCode.Section;
  1249. VAR op2: IntermediateCode.Operand;
  1250. BEGIN
  1251. prevSection := SELF.section;
  1252. SELF.section := section;
  1253. Emit(Leave(position, callconv));
  1254. IF backend.cooperative THEN
  1255. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1256. Emit(Add(position, sp, fp, op2));
  1257. ELSE
  1258. Emit(Mov(position, sp, fp));
  1259. END;
  1260. Emit(Pop(position, fp));
  1261. SELF.section := prevSection;
  1262. END EmitLeave;
  1263. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1264. VAR m: SymbolMap;
  1265. BEGIN
  1266. position := x.position;
  1267. IF currentIsInline THEN
  1268. m := currentMapper.Get(x);
  1269. IF m # NIL THEN
  1270. (*
  1271. Printout.Info("mapping from", x);
  1272. Printout.Info("mapping to ", m.to);
  1273. *)
  1274. m.to.Accept(SELF);
  1275. op := result;
  1276. IF m.tag # NIL THEN
  1277. ReleaseIntermediateOperand(result.tag);
  1278. m.tag.Accept(SELF);
  1279. op.tag := result.op;
  1280. ReleaseIntermediateOperand(result.tag);
  1281. END;
  1282. RETURN
  1283. END;
  1284. END;
  1285. x.Accept(SELF);
  1286. op := result;
  1287. END Symbol;
  1288. PROCEDURE Expression(x: SyntaxTree.Expression);
  1289. BEGIN
  1290. position := x.position;
  1291. constantDeclaration := NIL;
  1292. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1293. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1294. END;
  1295. IF x.resolved # NIL THEN
  1296. x.resolved.Accept(SELF)
  1297. ELSE
  1298. x.Accept(SELF)
  1299. END;
  1300. (* check this, was commented out in ActiveCells3 *)
  1301. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1302. Error(x.position, "unsupported modifier");
  1303. END;
  1304. END Expression;
  1305. (*
  1306. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1307. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1308. BEGIN
  1309. temporaries.GetUsage(current);
  1310. FOR i := 0 TO LEN(current)-1 DO
  1311. set := current[i] - previous[i];
  1312. IF set # {} THEN
  1313. FOR j := 0 TO MAX(SET)-1 DO
  1314. IF j IN set THEN
  1315. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1316. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1317. Symbol(variable, op);
  1318. MakeMemory(tmp,op.op,addressType,0);
  1319. ReleaseOperand(op);
  1320. Emit(Mov(position,tmp, nil ) );
  1321. ReleaseIntermediateOperand(tmp);
  1322. END;
  1323. END;
  1324. END;
  1325. END;
  1326. END;
  1327. END ResetUsedTemporaries;
  1328. *)
  1329. PROCEDURE Statement(x: SyntaxTree.Statement);
  1330. VAR use: VariableUse;
  1331. BEGIN
  1332. temporaries.GetUsage(use);
  1333. position := x.position;
  1334. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1335. IF commentPrintout # NIL THEN
  1336. commentPrintout.Statement(x);
  1337. dump.Ln;
  1338. (*dump.Update;*)
  1339. END;
  1340. x.Accept(SELF);
  1341. (*
  1342. CheckRegistersFree();
  1343. *)
  1344. (*ResetUsedTemporaries(use);*)
  1345. temporaries.SetUsage(use);
  1346. END Statement;
  1347. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1348. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1349. *)
  1350. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1351. BEGIN
  1352. IF op.mode = IntermediateCode.ModeMemory THEN
  1353. ReuseCopy(res,op);
  1354. ELSE
  1355. res := op;
  1356. UseIntermediateOperand(res);
  1357. END;
  1358. IntermediateCode.AddOffset(res,offset);
  1359. IntermediateCode.MakeMemory(res,type);
  1360. END MakeMemory;
  1361. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1362. VAR mem: IntermediateCode.Operand;
  1363. BEGIN
  1364. MakeMemory(mem,res,type,offset);
  1365. ReleaseIntermediateOperand(res);
  1366. res := mem;
  1367. END ToMemory;
  1368. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1369. VAR mem: IntermediateCode.Operand;
  1370. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1371. componentType: SyntaxTree.Type;
  1372. BEGIN
  1373. type := type.resolved;
  1374. IF operand.mode = ModeReference THEN
  1375. IF type IS SyntaxTree.RangeType THEN
  1376. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1377. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1378. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1379. ReleaseOperand(operand);
  1380. operand.op := firstOp;
  1381. operand.tag := lastOp;
  1382. operand.extra := stepOp;
  1383. ELSIF type IS SyntaxTree.ComplexType THEN
  1384. componentType := type(SyntaxTree.ComplexType).componentType;
  1385. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1386. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1387. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1388. ReleaseOperand(operand);
  1389. operand.op := firstOp;
  1390. operand.tag := lastOp
  1391. ELSE
  1392. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1393. ReleaseIntermediateOperand(operand.op);
  1394. operand.op := mem;
  1395. END;
  1396. operand.mode := ModeValue;
  1397. END;
  1398. ASSERT(operand.mode = ModeValue);
  1399. END LoadValue;
  1400. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1401. VAR prevConditional: BOOLEAN;
  1402. BEGIN
  1403. prevConditional := conditional;
  1404. conditional := FALSE;
  1405. InitOperand(result, ModeUndefined);
  1406. Expression(x);
  1407. op := result;
  1408. LoadValue(op,x.type.resolved);
  1409. conditional := prevConditional;
  1410. END Evaluate;
  1411. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1412. VAR prevConditional: BOOLEAN;
  1413. BEGIN
  1414. prevConditional := conditional;
  1415. conditional := FALSE;
  1416. InitOperand(result,ModeUndefined);
  1417. Expression(x);
  1418. op := result;
  1419. (*
  1420. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1421. *)
  1422. conditional := prevConditional;
  1423. END Designate;
  1424. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1425. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1426. BEGIN
  1427. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1428. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1429. conditional := TRUE;
  1430. trueLabel := trueL; falseLabel := falseL;
  1431. Expression(x);
  1432. trueL := trueLabel; falseL := falseLabel;
  1433. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1434. END Condition;
  1435. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1436. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1437. BEGIN
  1438. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1439. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1440. RETURN op
  1441. END NewRegisterOperand;
  1442. PROCEDURE UnuseRegister(register: LONGINT);
  1443. BEGIN
  1444. IF (register > 0) THEN
  1445. register := registerUsageCount.Map(register);
  1446. registerUsageCount.DecUse(register);
  1447. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1448. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1449. END;
  1450. IF registerUsageCount.Use(register)=0 THEN
  1451. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1452. Warning(position, "register cannot be removed");
  1453. END;
  1454. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1455. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1456. END;
  1457. ELSIF registerUsageCount.Use(register)<0 THEN
  1458. Warning(position, "register removed too often");
  1459. IF dump # NIL THEN
  1460. dump.String("register removed too often"); dump.Ln; dump.Update;
  1461. END;
  1462. D.TraceBack;
  1463. END;
  1464. END;
  1465. END UnuseRegister;
  1466. PROCEDURE UseRegister(register: LONGINT);
  1467. BEGIN
  1468. IF (register > 0) THEN
  1469. register := registerUsageCount.Map(register);
  1470. registerUsageCount.IncUse(register);
  1471. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1472. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1473. END;
  1474. IF registerUsageCount.Use(register)=1 THEN
  1475. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1476. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1477. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1478. END;
  1479. END;
  1480. END;
  1481. END UseRegister;
  1482. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1483. BEGIN
  1484. UnuseRegister(op.register)
  1485. END ReleaseIntermediateOperand;
  1486. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1487. BEGIN
  1488. UseRegister(op.register)
  1489. END UseIntermediateOperand;
  1490. PROCEDURE ReleaseOperand(CONST op: Operand);
  1491. BEGIN
  1492. UnuseRegister(op.op.register);
  1493. UnuseRegister(op.tag.register);
  1494. UnuseRegister(op.extra.register);
  1495. END ReleaseOperand;
  1496. (* save registers marked in array "markedRegisters" to the stack
  1497. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1498. *)
  1499. PROCEDURE SaveRegisters();
  1500. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1501. BEGIN
  1502. entry := usedRegisters;
  1503. WHILE entry # NIL DO
  1504. type := registerUsageCount.used[entry.register].type;
  1505. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1506. Emit(Push(position,op));
  1507. entry := entry.next;
  1508. END;
  1509. END SaveRegisters;
  1510. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1511. BEGIN
  1512. saved := usedRegisters;
  1513. usedRegisters := NIL;
  1514. END ReleaseUsedRegisters;
  1515. (** remove parameter registers from used queue *)
  1516. PROCEDURE ReleaseParameterRegisters;
  1517. VAR entry,prev,next: RegisterEntry;
  1518. BEGIN
  1519. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1520. WHILE entry # NIL DO
  1521. next := entry.next;
  1522. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1523. registerUsageCount.DecUse(entry.register);
  1524. ASSERT(registerUsageCount.Use(entry.register)=0);
  1525. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1526. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1527. END;
  1528. ELSIF prev = NIL THEN
  1529. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1530. ELSE
  1531. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1532. END;
  1533. entry := next;
  1534. END;
  1535. END ReleaseParameterRegisters;
  1536. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1537. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1538. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1539. BEGIN
  1540. entry := saved;
  1541. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1542. entry := prev;
  1543. WHILE entry # NIL DO
  1544. prev := entry.prev;
  1545. type := entry.type;
  1546. class := entry.registerClass;
  1547. IntermediateCode.InitRegister(op,type,class,entry.register);
  1548. (*
  1549. new := registerUsageCount.Next(type,class);
  1550. registerUsageCount.Remap(entry.register,new);
  1551. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1552. dump.String("remap register "); dump.Int(entry.register,1);
  1553. dump.String("to "); dump.Int(new,1);
  1554. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1555. END;
  1556. entry.register := new;
  1557. *)
  1558. Emit(Pop(position,op));
  1559. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1560. entry := prev;
  1561. END;
  1562. (*
  1563. usedRegisters := saved;
  1564. *)
  1565. END RestoreRegisters;
  1566. PROCEDURE CheckRegistersFree;
  1567. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1568. BEGIN
  1569. IF usedRegisters # NIL THEN
  1570. r := usedRegisters;
  1571. WHILE r # NIL DO
  1572. warning := "register ";
  1573. Strings.AppendInt(warning, r.register);
  1574. Strings.Append(warning, " not released.");
  1575. Warning(position,warning);
  1576. r := r .next;
  1577. END;
  1578. END;
  1579. FOR i := 0 TO registerUsageCount.count-1 DO
  1580. IF registerUsageCount.used[i].count < 0 THEN
  1581. warning := "register ";
  1582. Strings.AppendInt(warning, i);
  1583. Strings.Append(warning, " unused too often.");
  1584. Warning(position,warning);
  1585. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1586. warning := "register ";
  1587. Strings.AppendInt(warning, i);
  1588. Strings.Append(warning, " not unused often enough.");
  1589. Warning(position,warning);
  1590. END;
  1591. END;
  1592. END CheckRegistersFree;
  1593. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1594. Otherwise allocate a new register.
  1595. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1596. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1597. BEGIN
  1598. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1599. UseIntermediateOperand(result);
  1600. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1601. UseIntermediateOperand(result);
  1602. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1603. END;
  1604. END Reuse2;
  1605. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1606. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1607. If not then allocate a new register.
  1608. Does NOT necessarily keep the content of src1 or src2 in result!
  1609. *)
  1610. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1611. BEGIN
  1612. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1613. UseIntermediateOperand(result);
  1614. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1615. UseIntermediateOperand(result);
  1616. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1617. result := alternative; alternative := emptyOperand;
  1618. UseIntermediateOperand(result);
  1619. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1620. END;
  1621. END Reuse2a;
  1622. (* like reuse2 but only one source *)
  1623. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1624. BEGIN
  1625. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1626. UseIntermediateOperand(result);
  1627. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1628. END;
  1629. END Reuse1;
  1630. (* like reuse2a but only one source *)
  1631. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1632. BEGIN
  1633. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1634. UseIntermediateOperand(result);
  1635. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1636. UseIntermediateOperand(result);
  1637. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1638. END;
  1639. END Reuse1a;
  1640. (* like reuse1 but guarantees that content of src1 is in result *)
  1641. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1642. BEGIN
  1643. IF ReusableRegister(src1) THEN
  1644. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1645. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1646. UseIntermediateOperand(result);
  1647. ELSE
  1648. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1649. Emit(Mov(position,result,src1));
  1650. END
  1651. END ReuseCopy;
  1652. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1653. BEGIN
  1654. IF ReusableRegister(src) THEN
  1655. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1656. ELSE
  1657. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1658. Emit(Mov(position,result,src));
  1659. ReleaseIntermediateOperand(src);
  1660. END
  1661. END TransferToRegister;
  1662. (** labels and branches **)
  1663. PROCEDURE NewLabel(): Label;
  1664. VAR label: Label;
  1665. BEGIN
  1666. NEW(label,section); RETURN label;
  1667. END NewLabel;
  1668. PROCEDURE SetLabel(label: Label);
  1669. BEGIN label.Resolve(section.pc);
  1670. END SetLabel;
  1671. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1672. BEGIN
  1673. ASSERT(label # NIL);
  1674. IF label.pc < 0 THEN (* label not yet set *)
  1675. label.AddFixup(section.pc);
  1676. END;
  1677. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1678. END LabelOperand;
  1679. PROCEDURE BrL(label: Label);
  1680. BEGIN
  1681. Emit(Br(position,LabelOperand(label)));
  1682. END BrL;
  1683. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1684. BEGIN
  1685. Emit(Brge(position,LabelOperand(label),left,right));
  1686. END BrgeL;
  1687. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1688. BEGIN
  1689. Emit(Brlt(position,LabelOperand(label),left,right));
  1690. END BrltL;
  1691. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1692. BEGIN
  1693. Emit(Breq(position,LabelOperand(label),left,right));
  1694. END BreqL;
  1695. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1696. BEGIN
  1697. Emit(Brne(position,LabelOperand(label),left,right));
  1698. END BrneL;
  1699. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1700. VAR new: IntermediateCode.Operand;
  1701. BEGIN
  1702. IF Trace THEN TraceEnter("Convert") END;
  1703. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1704. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1705. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1706. & (operand.offset = 0)
  1707. THEN
  1708. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1709. Emit(Conv(position,new,operand));
  1710. ELSE
  1711. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1712. Emit(Conv(position,new,operand));
  1713. ReleaseIntermediateOperand(operand);
  1714. END;
  1715. operand := new;
  1716. 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
  1717. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1718. ELSE
  1719. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1720. Emit(Conv(position,new,operand));
  1721. ReleaseIntermediateOperand(operand);
  1722. operand := new;
  1723. END;
  1724. IF Trace THEN TraceExit("Convert") END;
  1725. END Convert;
  1726. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1727. VAR exit: Label;
  1728. BEGIN
  1729. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1730. exit := NewLabel();
  1731. br(exit,left,right);
  1732. EmitTrap(position,trapNo);
  1733. SetLabel(exit);
  1734. END TrapC;
  1735. (** expressions *)
  1736. (** emit necessary runtime check for set elements **)
  1737. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1738. VAR max: IntermediateCode.Operand;
  1739. BEGIN
  1740. IF isUnchecked THEN RETURN END;
  1741. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1742. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1743. TrapC(BrgeL, max, o, SetElementTrap);
  1744. END;
  1745. END CheckSetElement;
  1746. (** the set that a range represents **)
  1747. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1748. VAR
  1749. operand: Operand;
  1750. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1751. BEGIN
  1752. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1753. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1754. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1755. one := IntermediateCode.Immediate(setType, 1);
  1756. Evaluate(x, operand);
  1757. Convert(operand.op, setType);
  1758. Convert(operand.tag, setType);
  1759. CheckSetElement(operand.op);
  1760. CheckSetElement(operand.tag);
  1761. (* create mask for lower bound
  1762. i.e. shift 11111111 to the left by the value of the lower bound
  1763. *)
  1764. Reuse1(temp, operand.op);
  1765. Emit(Shl(position,temp, allBits, operand.op));
  1766. ReleaseIntermediateOperand(operand.op);
  1767. operand.op := temp;
  1768. (* create mask for upper bound
  1769. i.e. shift 11111111 to the right by the difference between the
  1770. upper bound and the maximum number of set elements
  1771. *)
  1772. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1773. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1774. Reuse1(temp, operand.tag);
  1775. ELSE
  1776. Reuse1(temp, operand.tag);
  1777. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1778. Emit(Sub(position,temp, size, operand.tag));
  1779. END;
  1780. Emit(Shr(position,temp, allBits, operand.tag));
  1781. ReleaseIntermediateOperand(operand.tag);
  1782. operand.tag := temp;
  1783. Reuse2(resultingSet, operand.op, operand.tag);
  1784. (* intersect the two masks *)
  1785. Emit(And(position,resultingSet, operand.op, operand.tag));
  1786. ReleaseOperand(operand);
  1787. RETURN resultingSet
  1788. END SetFromRange;
  1789. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1790. VAR
  1791. res, operand: Operand;
  1792. temp, one, noBits, dest: IntermediateCode.Operand;
  1793. expression: SyntaxTree.Expression;
  1794. i: LONGINT;
  1795. BEGIN
  1796. IF Trace THEN TraceEnter("VisitSet") END;
  1797. dest := destination;
  1798. destination := emptyOperand;
  1799. noBits := IntermediateCode.Immediate(setType, 0);
  1800. one := IntermediateCode.Immediate(setType, 1);
  1801. (* start off with the empty set *)
  1802. InitOperand(res, ModeValue);
  1803. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1804. Emit(Mov(position,res.op, noBits));
  1805. FOR i := 0 TO x.elements.Length() - 1 DO
  1806. expression := x.elements.GetExpression(i);
  1807. IF expression IS SyntaxTree.RangeExpression THEN
  1808. (* range of set elements *)
  1809. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1810. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1811. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1812. ReleaseIntermediateOperand(temp)
  1813. ELSE
  1814. (* singelton element *)
  1815. Evaluate(expression, operand);
  1816. Convert(operand.op, setType);
  1817. CheckSetElement(operand.op);
  1818. (* create subset containing single element *)
  1819. Reuse1(temp, operand.op);
  1820. Emit(Shl(position,temp, one, operand.op));
  1821. ReleaseOperand(operand);
  1822. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1823. ReleaseIntermediateOperand(temp);
  1824. END
  1825. END;
  1826. result := res;
  1827. destination := dest;
  1828. IF Trace THEN TraceExit("VisitSet") END;
  1829. END VisitSet;
  1830. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1831. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1832. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1833. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1834. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1835. element: SyntaxTree.IntegerValue;
  1836. BEGIN
  1837. numberElements := x.elements.Length();
  1838. expression := index.parameters.GetExpression(dim);
  1839. element := expression(SyntaxTree.IntegerValue);
  1840. FOR i := 0 TO numberElements-1 DO
  1841. expression := x.elements.GetExpression(i);
  1842. element.SetValue(i);
  1843. IF expression IS SyntaxTree.MathArrayExpression THEN
  1844. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1845. ELSE
  1846. Assign(index,expression);
  1847. END;
  1848. END;
  1849. END RecursiveAssignment;
  1850. BEGIN
  1851. variable := GetTemporaryVariable(x.type, FALSE);
  1852. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1853. designator.SetType(variable.type);
  1854. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1855. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1856. FOR i := 0 TO dim-1 DO
  1857. element := SyntaxTree.NewIntegerValue(x.position,0);
  1858. element.SetType(system.longintType);
  1859. index.parameters.AddExpression(element);
  1860. END;
  1861. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1862. RecursiveAssignment(x,0);
  1863. Expression(designator);
  1864. END VisitMathArrayExpression;
  1865. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1866. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1867. BEGIN
  1868. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1869. dest := destination; destination := emptyOperand;
  1870. IF x.operator = Scanner.Not THEN
  1871. IF conditional THEN
  1872. Condition(x.left,falseLabel,trueLabel)
  1873. ELSE
  1874. Evaluate(x.left,operand);
  1875. InitOperand(result,ModeValue);
  1876. Reuse1a(result.op,operand.op,dest);
  1877. Emit(Xor(position,result.op,operand.op,true));
  1878. ReleaseOperand(operand);
  1879. END;
  1880. ELSIF x.operator = Scanner.Minus THEN
  1881. Evaluate(x.left,operand);
  1882. InitOperand(result,ModeValue);
  1883. Reuse1a(result.op,operand.op,dest);
  1884. type := x.left.type.resolved;
  1885. IF type IS SyntaxTree.SetType THEN
  1886. Emit(Not(position,result.op,operand.op));
  1887. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1888. Reuse1(result.tag,operand.tag);
  1889. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1890. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1891. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  1892. Emit(Neg(position,result.op,operand.op));
  1893. ELSE HALT(200)
  1894. END;
  1895. ReleaseOperand(operand);
  1896. ELSIF x.operator = Scanner.Address THEN
  1897. Designate(x.left,operand);
  1898. operand.mode := ModeValue;
  1899. t0 := x.left.type.resolved;
  1900. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  1901. ReleaseIntermediateOperand(operand.op);
  1902. operand.op := operand.tag;
  1903. IntermediateCode.InitOperand(operand.tag);
  1904. END;
  1905. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  1906. result := operand;
  1907. ELSE HALT(100)
  1908. END;
  1909. destination := dest;
  1910. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  1911. END VisitUnaryExpression;
  1912. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  1913. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  1914. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  1915. BEGIN
  1916. type := type.resolved;
  1917. originalType := type;
  1918. IF type IS SyntaxTree.PointerType THEN
  1919. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  1920. END;
  1921. IF type IS SyntaxTree.ObjectType THEN
  1922. BrL(trueL);
  1923. ELSE
  1924. ASSERT(type IS SyntaxTree.RecordType);
  1925. (*
  1926. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  1927. *)
  1928. ReuseCopy(left,tag);
  1929. right := TypeDescriptorAdr(type);
  1930. IF ~newObjectFile THEN
  1931. IntermediateCode.MakeMemory(right,addressType);
  1932. END;
  1933. IF backend.cooperative THEN
  1934. repeatL := NewLabel();
  1935. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  1936. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  1937. END;
  1938. SetLabel(repeatL);
  1939. BreqL(trueL,left,right);
  1940. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  1941. BrneL(repeatL,left,nil);
  1942. ELSIF meta.simple THEN
  1943. level := type(SyntaxTree.RecordType).Level();
  1944. (* get type desc tag of level relative to base tag *)
  1945. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  1946. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1947. IntermediateCode.MakeMemory(left,addressType);
  1948. BreqL(trueL,left,right);
  1949. ELSE
  1950. level := type(SyntaxTree.RecordType).Level();
  1951. (* get type desc tag of level relative to base tag *)
  1952. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  1953. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1954. IntermediateCode.MakeMemory(left,addressType);
  1955. BreqL(trueL,left,right);
  1956. END;
  1957. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  1958. BrL(falseL);
  1959. END;
  1960. END TypeTest;
  1961. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  1962. BEGIN
  1963. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  1964. IF dump # NIL THEN
  1965. dump.String(s); dump.Ln;
  1966. END;
  1967. END Error;
  1968. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  1969. BEGIN
  1970. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  1971. IF dump # NIL THEN
  1972. dump.String(s); dump.Ln; dump.Update;
  1973. END;
  1974. END Warning;
  1975. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  1976. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  1977. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  1978. operand:Operand;
  1979. BEGIN
  1980. previousSection := section;
  1981. Global.GetModuleName(mod,name);
  1982. Strings.Append(name,".@Trace");
  1983. Basic.ToSegmentedName(name, pooledName);
  1984. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  1985. IF dump # NIL THEN dump := section.comments END;
  1986. variable := mod.moduleScope.firstVariable;
  1987. WHILE variable # NIL DO
  1988. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  1989. Symbol(variable, operand);
  1990. register := operand.op;
  1991. CallTraceMethod(register, variable.type);
  1992. ReleaseIntermediateOperand(register);
  1993. END;
  1994. variable := variable.nextVariable;
  1995. END;
  1996. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  1997. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  1998. Emit(Br(position,op));
  1999. INC(statCoopTraceModule, section.pc);
  2000. section := previousSection;
  2001. IF dump # NIL THEN dump := section.comments END;
  2002. END CreateTraceModuleMethod;
  2003. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2004. BEGIN
  2005. Emit (Push(position, dst));
  2006. Emit (Push(position, src));
  2007. CallThis(position,"GarbageCollector","Assign", 2);
  2008. END CallAssignPointer;
  2009. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2010. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2011. BEGIN
  2012. IF SemanticChecker.IsPointerType (type) THEN
  2013. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2014. ELSIF type.IsRecordType() THEN
  2015. Emit (Push(position,dst));
  2016. Emit (Push(position,src));
  2017. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2018. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2019. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2020. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2021. ELSIF IsStaticArray(type) THEN
  2022. size := StaticArrayNumElements(type);
  2023. base := StaticArrayBaseType(type);
  2024. IF base.IsRecordType() THEN
  2025. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2026. Emit (Push(position, dst));
  2027. Emit (Push(position, src));
  2028. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2029. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2030. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2031. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2032. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2033. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2034. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2035. Emit (Push(position, dst));
  2036. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2037. Emit (Push(position, src));
  2038. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2039. ELSE
  2040. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2041. Emit (Push(position, dst));
  2042. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2043. Emit (Push(position, src));
  2044. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2045. ASSERT(StaticArrayBaseType(type).IsPointer());
  2046. END;
  2047. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2048. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2049. Emit (Push(position, dst));
  2050. Emit (Push(position, src));
  2051. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2052. ELSE HALT(100); (* missing ? *)
  2053. END;
  2054. END CallAssignMethod;
  2055. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2056. VAR name: Basic.SegmentedName;
  2057. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2058. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2059. context: Context;
  2060. BEGIN
  2061. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2062. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2063. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2064. GetRecordTypeName (recordType,name);
  2065. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2066. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2067. IF dump # NIL THEN dump := section.comments END;
  2068. variable := recordType.recordScope.firstVariable;
  2069. WHILE variable # NIL DO
  2070. IF variable.NeedsTrace() THEN
  2071. dst := NewRegisterOperand (addressType);
  2072. src := NewRegisterOperand (addressType);
  2073. Emit (Mov(position, dst, parameter1));
  2074. Emit (Mov(position, src, parameter2));
  2075. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2076. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2077. CallAssignMethod(dst, src, variable.type);
  2078. ReleaseIntermediateOperand(src);
  2079. ReleaseIntermediateOperand(dst);
  2080. END;
  2081. variable := variable.nextVariable;
  2082. END;
  2083. recordBase := recordType.GetBaseRecord();
  2084. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2085. GetRecordTypeName (recordBase,name);
  2086. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2087. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2088. Emit(Br(position,op));
  2089. ELSE
  2090. Emit(Exit(position,0,0));
  2091. END;
  2092. IF ~recordType.isObject THEN
  2093. GetRecordTypeName (recordType,name);
  2094. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2095. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2096. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2097. NEW(registerUsageCount);
  2098. usedRegisters := NIL;
  2099. dst := NewRegisterOperand (addressType);
  2100. src := NewRegisterOperand (addressType);
  2101. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2102. Emit(Mov(position, dst, parameter1));
  2103. Emit(Mov(position, src, parameter2));
  2104. label := NewLabel();
  2105. SetLabel(label);
  2106. Emit(Push(position, dst));
  2107. Emit(Push(position, src));
  2108. GetRecordTypeName (recordType,name);
  2109. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2110. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2111. Emit(Call(position, op, 0));
  2112. Emit(Pop(position, src));
  2113. Emit(Pop(position, dst));
  2114. Emit(Add(position, dst, dst, ofs));
  2115. Emit(Add(position, src, src, ofs));
  2116. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2117. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2118. Emit(Exit(position,0,0));
  2119. END;
  2120. INC(statCoopAssignProcedure, section.pc);
  2121. ReturnToContext(context);
  2122. IF dump # NIL THEN dump := section.comments END;
  2123. END CreateAssignProcedure;
  2124. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2125. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2126. BEGIN
  2127. IF IsUnsafePointer (type) THEN
  2128. skip := NewLabel();
  2129. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2130. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2131. BreqL (skip, op, nil);
  2132. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2133. SetLabel (skip);
  2134. ELSIF SemanticChecker.IsPointerType (type) THEN
  2135. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2136. CallThis(position,"GarbageCollector","Mark", 1);
  2137. ELSIF type.IsRecordType() THEN
  2138. Emit (Push(position,register));
  2139. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2140. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2141. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2142. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2143. ELSIF IsStaticArray(type) THEN
  2144. size := StaticArrayNumElements(type);
  2145. base := StaticArrayBaseType(type);
  2146. IF base.IsRecordType() THEN
  2147. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2148. Emit (Push(position, register));
  2149. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2150. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2151. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2152. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2153. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2154. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2155. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2156. Emit (Push(position, register));
  2157. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2158. ELSE
  2159. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2160. Emit (Push(position, register));
  2161. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2162. ASSERT(base.IsPointer());
  2163. END;
  2164. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2165. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2166. CallThis(position,"GarbageCollector","Mark", 1);
  2167. ELSE HALT(100); (* missing ? *)
  2168. END;
  2169. END CallTraceMethod;
  2170. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2171. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2172. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2173. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2174. BEGIN
  2175. previousSection := section;
  2176. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2177. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2178. GetRecordTypeName (recordType,name);
  2179. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2180. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2181. IF dump # NIL THEN dump := section.comments END;
  2182. variable := recordType.recordScope.firstVariable;
  2183. WHILE variable # NIL DO
  2184. IF variable.NeedsTrace() THEN
  2185. register := NewRegisterOperand (addressType);
  2186. Emit (Mov(position,register,parameter1));
  2187. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2188. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2189. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2190. END;
  2191. CallTraceMethod(register, variable.type);
  2192. ReleaseIntermediateOperand(register);
  2193. END;
  2194. variable := variable.nextVariable;
  2195. END;
  2196. recordBase := recordType.GetBaseRecord();
  2197. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2198. recordBase := recordBase.GetBaseRecord();
  2199. END;
  2200. IF recordBase # NIL THEN
  2201. GetRecordTypeName (recordBase,name);
  2202. IF HasExplicitTraceMethod (recordBase) THEN
  2203. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2204. ELSE
  2205. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2206. END;
  2207. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2208. Emit(Br(position,op));
  2209. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2210. Emit(Exit(position,0,0));
  2211. ELSE
  2212. IF recordType.isObject THEN
  2213. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2214. ELSE
  2215. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2216. END;
  2217. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2218. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2219. Emit(Br(position,op));
  2220. END;
  2221. IF ~recordType.isObject THEN
  2222. GetRecordTypeName (recordType,name);
  2223. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2224. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2225. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2226. NEW(registerUsageCount);
  2227. usedRegisters := NIL;
  2228. IF dump # NIL THEN dump := section.comments END;
  2229. register := NewRegisterOperand (addressType);
  2230. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2231. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2232. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2233. END;
  2234. Emit (Push(position,register));
  2235. GetRecordTypeName (recordType,name);
  2236. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2237. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2238. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2239. ReleaseIntermediateOperand(register);
  2240. Emit(Exit(position,0,0));
  2241. GetRecordTypeName (recordType,name);
  2242. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2243. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2244. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2245. NEW(registerUsageCount);
  2246. usedRegisters := NIL;
  2247. register := NewRegisterOperand (addressType);
  2248. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2249. Emit(Mov(position, register, parameter1));
  2250. label := NewLabel();
  2251. SetLabel(label);
  2252. Emit(Push(position, register));
  2253. GetRecordTypeName (recordType,name);
  2254. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2255. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2256. Emit(Call(position, op, 0));
  2257. Emit(Pop(position, register));
  2258. Emit(Add(position, register, register, ofs));
  2259. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2260. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2261. Emit(Exit(position,0,0));
  2262. END;
  2263. INC(statCoopTraceMethod, section.pc);
  2264. ReturnToContext(context);
  2265. IF dump # NIL THEN dump := section.comments END;
  2266. END CreateTraceMethod;
  2267. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2268. VAR name: Basic.SegmentedName;
  2269. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2270. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2271. context: Context;
  2272. BEGIN
  2273. IF recordType.isObject THEN RETURN END;
  2274. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2275. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2276. GetRecordTypeName (recordType,name);
  2277. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2278. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2279. IF dump # NIL THEN dump := section.comments END;
  2280. variable := recordType.recordScope.firstVariable;
  2281. WHILE variable # NIL DO
  2282. IF variable.NeedsTrace() THEN
  2283. dst := NewRegisterOperand (addressType);
  2284. Emit (Mov(position, dst, parameter1));
  2285. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2286. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2287. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2288. END;
  2289. CallResetProcedure(dst, nil, variable.type);
  2290. ReleaseIntermediateOperand(dst);
  2291. END;
  2292. variable := variable.nextVariable;
  2293. END;
  2294. recordBase := recordType.GetBaseRecord();
  2295. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2296. GetRecordTypeName (recordBase,name);
  2297. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2298. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2299. Emit(Br(position,op));
  2300. ELSE
  2301. Emit(Exit(position,0,0));
  2302. END;
  2303. GetRecordTypeName (recordType,name);
  2304. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2305. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2306. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2307. NEW(registerUsageCount);
  2308. usedRegisters := NIL;
  2309. dst := NewRegisterOperand (addressType);
  2310. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2311. Emit(Mov(position, dst, parameter1));
  2312. label := NewLabel();
  2313. SetLabel(label);
  2314. Emit(Push(position, dst));
  2315. GetRecordTypeName (recordType,name);
  2316. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2317. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2318. Emit(Call(position, op, 0));
  2319. Emit(Pop(position, dst));
  2320. Emit(Add(position, dst, dst, ofs));
  2321. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2322. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2323. Emit(Exit(position,0,0));
  2324. INC(statCoopResetProcedure, section.pc);
  2325. ReturnToContext(context);
  2326. IF dump # NIL THEN dump := section.comments END;
  2327. END CreateResetProcedure;
  2328. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2329. VAR name: Basic.SegmentedName; context: Context;
  2330. BEGIN
  2331. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2332. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2333. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2334. IF dump # NIL THEN dump := section.comments END;
  2335. Emit(Push(position,fp));
  2336. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2337. ResetVariables(scope);
  2338. Emit(Pop(position,fp));
  2339. Emit(Exit(position,0,0));
  2340. ReturnToContext(context);
  2341. IF dump # NIL THEN dump := section.comments END;
  2342. END CreateResetMethod;
  2343. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2344. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2345. BEGIN
  2346. IF SemanticChecker.IsPointerType (type) THEN
  2347. Emit (Push(position, dest));
  2348. CallThis(position,"GarbageCollector","Reset", 1);
  2349. ELSIF type.IsRecordType() THEN
  2350. Emit (Push(position, dest));
  2351. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2352. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2353. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2354. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2355. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2356. size := GetArrayLength(type, tag);
  2357. base := ArrayBaseType(type);
  2358. IF base.IsRecordType() THEN
  2359. Emit (Push(position, size));
  2360. Emit (Push(position, dest));
  2361. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2362. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2363. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2364. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2365. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2366. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2367. Emit (Push(position, size));
  2368. Emit (Push(position, dest));
  2369. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2370. ELSE
  2371. Emit (Push(position, size));
  2372. Emit (Push(position, dest));
  2373. CallThis(position,"GarbageCollector","ResetArray", 2);
  2374. ASSERT(ArrayBaseType(type).IsPointer());
  2375. END;
  2376. ReleaseIntermediateOperand(size);
  2377. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2378. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2379. Emit (Push(position, dest));
  2380. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2381. ELSE HALT(100); (* missing ? *)
  2382. END;
  2383. END CallResetProcedure;
  2384. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2385. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2386. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2387. VAR operand: Operand;
  2388. BEGIN
  2389. Symbol (symbol, operand);
  2390. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2391. ReleaseOperand(operand);
  2392. END Reset;
  2393. BEGIN
  2394. previousScope := currentScope;
  2395. currentScope := scope;
  2396. pc := section.pc;
  2397. variable := scope.firstVariable;
  2398. WHILE variable # NIL DO
  2399. IF variable.NeedsTrace() THEN
  2400. Reset (variable);
  2401. END;
  2402. variable := variable.nextVariable;
  2403. END;
  2404. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2405. WHILE parameter # NIL DO
  2406. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2407. Reset (parameter);
  2408. END;
  2409. parameter := parameter.nextParameter;
  2410. END;
  2411. INC(statCoopResetVariables, section.pc - pc);
  2412. currentScope := previousScope;
  2413. END ResetVariables;
  2414. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2415. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2416. VAR op: IntermediateCode.Operand; context: Context;
  2417. BEGIN
  2418. previousSection := section;
  2419. GetCodeSectionNameForSymbol(procedure, name);
  2420. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2421. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2422. IF dump # NIL THEN dump := section.comments END;
  2423. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2424. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2425. Emit(Data(position,op));
  2426. Emit(Data(position,nil));
  2427. IF HasPointers (procedure.procedureScope) THEN
  2428. GetCodeSectionNameForSymbol(procedure, name);
  2429. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2430. ELSE
  2431. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2432. END;
  2433. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2434. Emit(Data(position,op));
  2435. ReturnToContext(context);
  2436. IF dump # NIL THEN dump := section.comments END;
  2437. END CreateProcedureDescriptor;
  2438. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2439. VAR import: SyntaxTree.Import;
  2440. s: Basic.MessageString;
  2441. selfName: SyntaxTree.IdentifierString;
  2442. BEGIN
  2443. moduleScope.ownerModule.GetName(selfName);
  2444. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2445. module := moduleScope.ownerModule
  2446. ELSE
  2447. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2448. IF import = NIL THEN
  2449. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2450. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2451. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2452. s := "Module ";
  2453. Strings.Append(s,moduleName);
  2454. Strings.Append(s," cannot be imported.");
  2455. IF force THEN
  2456. Error(position,s);
  2457. ELSIF canBeLoaded THEN
  2458. Strings.Append(s, "=> no dynamic linking.");
  2459. Warning(position, s);
  2460. canBeLoaded := FALSE;
  2461. END;
  2462. RETURN FALSE
  2463. ELSE
  2464. SELF.module.imports.AddName(moduleName)
  2465. END;
  2466. ELSIF import.module = NIL THEN (* already tried *)
  2467. RETURN FALSE
  2468. END;
  2469. module := import.module;
  2470. END;
  2471. RETURN TRUE
  2472. END AddImport;
  2473. (* needed for old binary object file format*)
  2474. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2475. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2476. BEGIN
  2477. IF AddImport(moduleName,module,TRUE) THEN
  2478. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2479. IF procedure = NIL THEN
  2480. s := "Instruction not supported on target, emulation procedure ";
  2481. Strings.Append(s,moduleName);
  2482. Strings.Append(s,".");
  2483. Strings.Append(s,procedureName);
  2484. Strings.Append(s," not present");
  2485. Error(position,s);
  2486. ELSE
  2487. StaticCallOperand(r,procedure);
  2488. ReleaseOperand(r);
  2489. fp := GetFingerprint(procedure);
  2490. END;
  2491. END;
  2492. END EnsureSymbol;
  2493. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2494. VAR exit: Label; trueL,falseL: Label;
  2495. BEGIN
  2496. trueL := NewLabel();
  2497. falseL := NewLabel();
  2498. exit := NewLabel();
  2499. Condition(x,trueL,falseL);
  2500. InitOperand(result,ModeValue);
  2501. SetLabel(trueL);
  2502. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2503. Emit(Mov(position,result.op,true));
  2504. BrL(exit);
  2505. SetLabel(falseL);
  2506. Emit(MovReplace(position,result.op,false));
  2507. SetLabel(exit);
  2508. END ConditionToValue;
  2509. PROCEDURE ValueToCondition(VAR op: Operand);
  2510. BEGIN
  2511. LoadValue(op,system.booleanType);
  2512. BrneL(trueLabel,op.op, false);
  2513. ReleaseOperand(op);
  2514. BrL(falseLabel);
  2515. END ValueToCondition;
  2516. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2517. VAR size: LONGINT;
  2518. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2519. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2520. BEGIN
  2521. ASSERT(type.form = SyntaxTree.Open);
  2522. baseType := type.arrayBase.resolved;
  2523. IF IsOpenArray(baseType) THEN
  2524. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2525. ELSE
  2526. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2527. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2528. END;
  2529. len := tag;
  2530. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2531. IntermediateCode.MakeMemory(len,addressType);
  2532. UseIntermediateOperand(len);
  2533. Reuse2(res,sizeOperand,len);
  2534. Emit(Mul(position,res,sizeOperand,len));
  2535. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2536. RETURN res
  2537. END GetArraySize;
  2538. BEGIN
  2539. type := type.resolved;
  2540. IF IsOpenArray(type) THEN
  2541. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2542. RETURN tag
  2543. ELSE
  2544. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2545. END;
  2546. ELSE
  2547. size := ToMemoryUnits(system,system.SizeOf(type));
  2548. RETURN IntermediateCode.Immediate(addressType,size)
  2549. END;
  2550. END GetDynamicSize;
  2551. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2552. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2553. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2554. BEGIN
  2555. ASSERT(type.form = SyntaxTree.Open);
  2556. baseType := type.arrayBase.resolved;
  2557. IF IsOpenArray(baseType) THEN
  2558. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2559. ELSE
  2560. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2561. END;
  2562. len := tag;
  2563. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2564. IntermediateCode.MakeMemory(len,addressType);
  2565. UseIntermediateOperand(len);
  2566. Reuse2(res,sizeOperand,len);
  2567. Emit(Mul(position,res,sizeOperand,len));
  2568. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2569. RETURN res
  2570. END GetLength;
  2571. BEGIN
  2572. type := type.resolved;
  2573. IF IsOpenArray(type) THEN
  2574. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2575. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2576. ELSE
  2577. RETURN IntermediateCode.Immediate(addressType,1)
  2578. END;
  2579. END GetArrayLength;
  2580. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2581. VAR result: IntermediateCode.Operand;
  2582. BEGIN
  2583. IF backend.cooperative THEN
  2584. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2585. ELSE
  2586. MakeMemory(result, tag, addressType, 0);
  2587. END;
  2588. RETURN result
  2589. END GetSizeFromTag;
  2590. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2591. VAR parameter: SyntaxTree.Parameter;
  2592. BEGIN
  2593. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2594. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2595. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2596. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2597. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2598. END;
  2599. RETURN GetDynamicSize(e.type, tag);
  2600. END GetArrayOfBytesSize;
  2601. (*
  2602. to find imported symbol. not needed ?
  2603. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2604. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2605. BEGIN
  2606. IF AddImport(moduleName,importedModule,FALSE) THEN
  2607. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2608. RETURN symbol
  2609. ELSE
  2610. RETURN NIL
  2611. END
  2612. END SymbolByName;
  2613. *)
  2614. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2615. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2616. BEGIN
  2617. IF AddImport(moduleName,runtimeModule,force) THEN
  2618. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2619. IF procedure = NIL THEN
  2620. s := "Procedure ";
  2621. Strings.Append(s,moduleName);
  2622. Strings.Append(s,".");
  2623. Strings.Append(s,procedureName);
  2624. Strings.Append(s," not present");
  2625. Error(position,s);
  2626. RETURN FALSE
  2627. ELSE
  2628. RETURN TRUE
  2629. END;
  2630. ELSE RETURN FALSE
  2631. END;
  2632. END GetRuntimeProcedure;
  2633. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2634. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2635. s: Basic.MessageString;
  2636. BEGIN
  2637. Basic.InitSegmentedName(name);
  2638. name[0] := Basic.MakeString(moduleName);
  2639. name[1] := Basic.MakeString(typeName);
  2640. name[2] := -1;
  2641. IF AddImport(moduleName,importedModule, FALSE) THEN
  2642. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2643. IF symbol = NIL THEN
  2644. s := "type ";
  2645. Strings.Append(s,moduleName);
  2646. Strings.Append(s,".");
  2647. Strings.Append(s,typeName);
  2648. Strings.Append(s," not present");
  2649. Error(position,s);
  2650. END;
  2651. ELSE symbol := NIL;
  2652. END;
  2653. IF importedModule = moduleScope.ownerModule THEN
  2654. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2655. ELSE
  2656. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2657. END;
  2658. RETURN symbol
  2659. END GetTypeDescriptor;
  2660. (* 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. *)
  2661. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2662. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2663. pooledName: Basic.SegmentedName; size: LONGINT;
  2664. BEGIN
  2665. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2666. StaticCallOperand(result,procedure);
  2667. IF numberParameters < 0 THEN
  2668. size := ProcedureParametersSize(system,procedure);
  2669. ELSE
  2670. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2671. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2672. Error(position,"runtime call parameter count mismatch");
  2673. END;
  2674. END;
  2675. Emit(Call(position, result.op, size));
  2676. ReleaseOperand(result);
  2677. ELSE (* only static linking possible *)
  2678. ASSERT(numberParameters >= 0);
  2679. Basic.InitSegmentedName(pooledName);
  2680. pooledName[0] := Basic.MakeString(moduleName);
  2681. pooledName[1] := Basic.MakeString(procedureName);
  2682. pooledName[2] := -1;
  2683. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2684. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2685. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2686. END;
  2687. END CallThisChecked;
  2688. (* 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. *)
  2689. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2690. BEGIN
  2691. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2692. END CallThis;
  2693. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2694. VAR
  2695. left,right: Operand;
  2696. leftSize, rightSize: IntermediateCode.Operand;
  2697. saved: RegisterEntry;
  2698. reg: IntermediateCode.Operand;
  2699. procedureName: SyntaxTree.IdentifierString;
  2700. BEGIN
  2701. procedureName := "CompareString";
  2702. SaveRegisters();ReleaseUsedRegisters(saved);
  2703. Designate(leftExpression,left);
  2704. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2705. Emit(Push(position,leftSize));
  2706. ReleaseIntermediateOperand(leftSize);
  2707. Emit(Push(position,left.op));
  2708. ReleaseOperand(left);
  2709. Designate(rightExpression,right);
  2710. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2711. Emit(Push(position,rightSize));
  2712. ReleaseIntermediateOperand(rightSize);
  2713. Emit(Push(position,right.op));
  2714. ReleaseOperand(right);
  2715. IF backend.cooperative THEN
  2716. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2717. ELSE
  2718. CallThis(position,runtimeModuleName,procedureName, 4);
  2719. END;
  2720. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2721. Emit(Result(position,reg));
  2722. (*
  2723. AcquireThisRegister(int8,IntermediateCode.Result);
  2724. *)
  2725. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2726. (*
  2727. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2728. *)
  2729. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2730. ReleaseIntermediateOperand(reg);
  2731. BrL(falseLabel);
  2732. END CompareString;
  2733. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2734. VAR
  2735. left,right: Operand;
  2736. leftSize, rightSize: IntermediateCode.Operand;
  2737. saved: RegisterEntry;
  2738. procedureName: SyntaxTree.IdentifierString;
  2739. BEGIN
  2740. procedureName := "CopyString";
  2741. SaveRegisters();ReleaseUsedRegisters(saved);
  2742. Designate(leftExpression,left);
  2743. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2744. Emit(Push(position,leftSize));
  2745. ReleaseIntermediateOperand(leftSize);
  2746. Emit(Push(position,left.op));
  2747. ReleaseOperand(left);
  2748. Designate(rightExpression,right);
  2749. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2750. Emit(Push(position,rightSize));
  2751. ReleaseIntermediateOperand(rightSize);
  2752. Emit(Push(position,right.op));
  2753. ReleaseOperand(right);
  2754. IF backend.cooperative THEN
  2755. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2756. ELSE
  2757. CallThis(position,runtimeModuleName,procedureName,4);
  2758. END;
  2759. RestoreRegisters(saved);
  2760. END CopyString;
  2761. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2762. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2763. leftType,rightType: SyntaxTree.Type;
  2764. leftExpression,rightExpression : SyntaxTree.Expression;
  2765. componentType: IntermediateCode.Type;
  2766. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2767. size: LONGINT;
  2768. BEGIN
  2769. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2770. dest := destination; destination := emptyOperand;
  2771. leftType := x.left.type.resolved;
  2772. rightType := x.right.type.resolved;
  2773. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2774. CASE x.operator OF
  2775. Scanner.Or:
  2776. (* shortcut evaluation of left OR right *)
  2777. IF ~conditional THEN ConditionToValue(x);
  2778. ELSE
  2779. next := NewLabel();
  2780. Condition(x.left,trueLabel,next);
  2781. SetLabel(next);
  2782. Condition(x.right,trueLabel,falseLabel);
  2783. END;
  2784. |Scanner.And:
  2785. (* shortcut evaluation of left & right *)
  2786. IF ~conditional THEN ConditionToValue(x);
  2787. ELSE
  2788. next := NewLabel();
  2789. Condition(x.left,next,falseLabel);
  2790. SetLabel(next);
  2791. Condition(x.right,trueLabel,falseLabel);
  2792. END;
  2793. |Scanner.Is:
  2794. IF ~conditional THEN ConditionToValue(x);
  2795. ELSE
  2796. (* get type desc tag *)
  2797. IF IsPointerToRecord(leftType,recordType) THEN
  2798. Evaluate(x.left,left);
  2799. Dereference(left,recordType,IsUnsafePointer(leftType))
  2800. ELSE
  2801. Designate(x.left,left);
  2802. END;
  2803. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2804. ReleaseOperand(left);
  2805. END;
  2806. |Scanner.Plus:
  2807. Evaluate(x.left,left);
  2808. Evaluate(x.right,right);
  2809. IF leftType IS SyntaxTree.SetType THEN
  2810. InitOperand(result,ModeValue);
  2811. Reuse2a(result.op,left.op,right.op,dest);
  2812. Emit(Or(position,result.op,left.op,right.op));
  2813. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2814. InitOperand(result,ModeValue);
  2815. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2816. Reuse2(result.tag,left.tag,right.tag);
  2817. Emit(Add(position,result.op,left.op,right.op));
  2818. Emit(Add(position,result.tag,left.tag,right.tag))
  2819. ELSE
  2820. InitOperand(result,ModeValue);
  2821. Reuse2a(result.op,left.op,right.op,dest);
  2822. Emit(Add(position,result.op,left.op,right.op));
  2823. END;
  2824. ReleaseOperand(left); ReleaseOperand(right);
  2825. |Scanner.Minus:
  2826. Evaluate(x.left,left);
  2827. Evaluate(x.right,right);
  2828. IF leftType IS SyntaxTree.SetType THEN
  2829. InitOperand(result,ModeValue);
  2830. Reuse1(result.op,right.op);
  2831. Emit(Not(position,result.op,right.op));
  2832. ReleaseOperand(right);
  2833. Emit(And(position,result.op,result.op,left.op));
  2834. ReleaseOperand(left);
  2835. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2836. InitOperand(result,ModeValue);
  2837. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2838. Reuse2(result.tag,left.tag,right.tag);
  2839. Emit(Sub(position,result.op,left.op,right.op));
  2840. Emit(Sub(position,result.tag,left.tag,right.tag));
  2841. ReleaseOperand(left); ReleaseOperand(right)
  2842. ELSE
  2843. InitOperand(result,ModeValue);
  2844. Reuse2a(result.op,left.op,right.op,dest);
  2845. Emit(Sub(position,result.op,left.op,right.op));
  2846. ReleaseOperand(left); ReleaseOperand(right);
  2847. END;
  2848. |Scanner.Times:
  2849. Evaluate(x.left,left);
  2850. Evaluate(x.right,right);
  2851. IF leftType IS SyntaxTree.SetType THEN
  2852. InitOperand(result,ModeValue);
  2853. Reuse2a(result.op,left.op,right.op,dest);
  2854. Emit(And(position,result.op,left.op,right.op));
  2855. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2856. InitOperand(result,ModeValue);
  2857. Reuse1a(result.op,left.op,dest);
  2858. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2859. Emit(Shl(position,result.op,left.op,right.op));
  2860. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2861. InitOperand(result, ModeValue);
  2862. componentType := left.op.type;
  2863. (* TODO: review this *)
  2864. (*
  2865. result.op = left.op * right.op - left.tag * right.tag
  2866. result.tag = left.tag * right.op + left.op * right.tag
  2867. *)
  2868. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2869. Emit(Mul(position,result.op, left.op, right.op));
  2870. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2871. Emit(Mul(position,tempReg, left.tag, right.tag));
  2872. Emit(Sub(position,result.op, result.op, tempReg));
  2873. Reuse2(result.tag, left.tag, right.op);
  2874. Emit(Mul(position,result.tag, left.tag, right.op));
  2875. Emit(Mul(position,tempReg, left.op, right.tag));
  2876. Emit(Add(position,result.tag, result.tag, tempReg));
  2877. ReleaseIntermediateOperand(tempReg)
  2878. ELSE
  2879. InitOperand(result,ModeValue);
  2880. Reuse2a(result.op,left.op,right.op,dest);
  2881. Emit(Mul(position,result.op,left.op,right.op));
  2882. END;
  2883. ReleaseOperand(left); ReleaseOperand(right);
  2884. |Scanner.Div:
  2885. Evaluate(x.left,left);
  2886. Evaluate(x.right,right);
  2887. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2888. InitOperand(result,ModeValue);
  2889. Reuse1a(result.op,left.op,dest);
  2890. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2891. Emit(Shr(position,result.op,left.op,right.op));
  2892. ELSE
  2893. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2894. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2895. IF ~isUnchecked THEN
  2896. exit := NewLabel();
  2897. BrltL(exit,zero,right.op);
  2898. EmitTrap(position,NegativeDivisorTrap);
  2899. SetLabel(exit);
  2900. END;
  2901. END;
  2902. InitOperand(result,ModeValue);
  2903. Reuse2a(result.op,left.op,right.op,dest);
  2904. Emit(Div(position,result.op,left.op,right.op));
  2905. END;
  2906. ReleaseOperand(left); ReleaseOperand(right);
  2907. |Scanner.Mod:
  2908. Evaluate(x.left,left);
  2909. Evaluate(x.right,right);
  2910. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2911. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  2912. InitOperand(result,ModeValue);
  2913. Reuse1a(result.op,left.op,dest);
  2914. Emit(And(position,result.op,left.op,right.op));
  2915. ELSE
  2916. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2917. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2918. IF ~isUnchecked THEN
  2919. exit := NewLabel();
  2920. BrltL(exit,zero,right.op);
  2921. EmitTrap(position,NegativeDivisorTrap);
  2922. SetLabel(exit);
  2923. END;
  2924. END;
  2925. InitOperand(result,ModeValue);
  2926. Reuse2a(result.op,left.op,right.op,dest);
  2927. Emit(Mod(position,result.op,left.op,right.op));
  2928. END;
  2929. ReleaseOperand(left); ReleaseOperand(right);
  2930. |Scanner.Slash:
  2931. Evaluate(x.left,left);
  2932. Evaluate(x.right,right);
  2933. IF leftType IS SyntaxTree.SetType THEN
  2934. InitOperand(result,ModeValue);
  2935. Reuse2a(result.op,left.op,right.op,dest);
  2936. Emit(Xor(position,result.op,left.op,right.op));
  2937. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2938. InitOperand(result,ModeValue);
  2939. componentType := left.op.type;
  2940. (* review this *)
  2941. (*
  2942. divisor = right.op * right.op + right.tag * right.tag
  2943. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2944. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2945. *)
  2946. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2947. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2948. Emit(Mul(position,tempReg, right.op, right.op));
  2949. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2950. Emit(Add(position,tempReg, tempReg, tempReg2));
  2951. result.op := tempReg2;
  2952. Emit(Mul(position,result.op, left.op, right.op));
  2953. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2954. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2955. Emit(Add(position,result.op, result.op, tempReg2));
  2956. Emit(Div(position,result.op, result.op, tempReg));
  2957. Reuse2(result.tag, left.tag, right.op);
  2958. Emit(Mul(position,result.tag, left.tag, right.op));
  2959. Emit(Mul(position,tempReg2, left.op, right.tag));
  2960. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2961. Emit(Div(position,result.tag, result.tag, tempReg));
  2962. ReleaseIntermediateOperand(tempReg);
  2963. ReleaseIntermediateOperand(tempReg2)
  2964. ELSE
  2965. InitOperand(result,ModeValue);
  2966. Reuse2a(result.op,left.op,right.op,dest);
  2967. Emit(Div(position,result.op,left.op,right.op));
  2968. END;
  2969. ReleaseOperand(left); ReleaseOperand(right);
  2970. |Scanner.Equal:
  2971. IF ~conditional THEN ConditionToValue(x);
  2972. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2973. CompareString(BreqL,x.left,x.right);
  2974. ELSE
  2975. Evaluate(x.left,left);
  2976. Evaluate(x.right,right);
  2977. IF leftType IS SyntaxTree.RangeType THEN
  2978. ASSERT(rightType IS SyntaxTree.RangeType);
  2979. BrneL(falseLabel, left.op, right.op); (* first *)
  2980. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2981. BrneL(falseLabel, left.extra, right.extra); (* step *)
  2982. ReleaseOperand(left); ReleaseOperand(right);
  2983. BrL(trueLabel)
  2984. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  2985. BrneL(falseLabel, left.op, right.op); (* first *)
  2986. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2987. ReleaseOperand(left); ReleaseOperand(right);
  2988. BrL(trueLabel)
  2989. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2990. (* TODO: review this *)
  2991. BrneL(falseLabel, left.op, right.op); (* real part *)
  2992. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  2993. ReleaseOperand(left); ReleaseOperand(right);
  2994. BrL(trueLabel)
  2995. ELSE
  2996. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  2997. ReleaseOperand(left); ReleaseOperand(right);
  2998. BrL(trueLabel);
  2999. END;
  3000. END;
  3001. |Scanner.LessEqual:
  3002. IF ~conditional THEN ConditionToValue(x);
  3003. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3004. CompareString(BrgeL,x.right,x.left);
  3005. ELSE
  3006. Evaluate(x.left,left);
  3007. Evaluate(x.right,right);
  3008. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3009. Reuse1(temp.op,right.op);
  3010. Emit(And(position,temp.op,left.op,right.op));
  3011. ReleaseOperand(right);
  3012. BreqL(trueLabel,temp.op,left.op);
  3013. BrL(falseLabel);
  3014. ReleaseOperand(temp);ReleaseOperand(left);
  3015. ELSE
  3016. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3017. ReleaseOperand(left); ReleaseOperand(right);
  3018. BrL(trueLabel);
  3019. END;
  3020. END;
  3021. |Scanner.Less:
  3022. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3023. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3024. leftExpression.SetType(system.booleanType);
  3025. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3026. rightExpression.SetType(system.booleanType);
  3027. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3028. leftExpression.SetType(system.booleanType);
  3029. Expression(leftExpression);
  3030. ELSIF ~conditional THEN ConditionToValue(x);
  3031. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3032. CompareString(BrltL,x.left,x.right);
  3033. ELSE
  3034. Evaluate(x.left,left);
  3035. Evaluate(x.right,right);
  3036. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3037. ReleaseOperand(left); ReleaseOperand(right);
  3038. BrL(trueLabel);
  3039. END;
  3040. |Scanner.Greater:
  3041. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3042. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3043. leftExpression.SetType(system.booleanType);
  3044. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3045. rightExpression.SetType(system.booleanType);
  3046. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3047. leftExpression.SetType(system.booleanType);
  3048. Expression(leftExpression);
  3049. ELSIF ~conditional THEN ConditionToValue(x);
  3050. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3051. CompareString(BrltL,x.right,x.left);
  3052. ELSE
  3053. Evaluate(x.left,left);
  3054. Evaluate(x.right,right);
  3055. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3056. ReleaseOperand(left); ReleaseOperand(right);
  3057. BrL(trueLabel);
  3058. END;
  3059. |Scanner.GreaterEqual:
  3060. IF ~conditional THEN ConditionToValue(x);
  3061. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3062. CompareString(BrgeL,x.left,x.right);
  3063. ELSE
  3064. Evaluate(x.left,left);
  3065. Evaluate(x.right,right);
  3066. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3067. Reuse1(temp.op,left.op);
  3068. Emit(And(position,temp.op,left.op,right.op));
  3069. ReleaseOperand(left);
  3070. BreqL(trueLabel, temp.op,right.op);
  3071. ReleaseOperand(temp); ReleaseOperand(right);
  3072. BrL(falseLabel);
  3073. ELSE
  3074. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3075. ReleaseOperand(left); ReleaseOperand(right);
  3076. BrL(trueLabel);
  3077. END;
  3078. END;
  3079. |Scanner.Unequal:
  3080. IF ~conditional THEN ConditionToValue(x);
  3081. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3082. CompareString(BrneL,x.left,x.right);
  3083. ELSE
  3084. Evaluate(x.left,left);
  3085. Evaluate(x.right,right);
  3086. IF leftType IS SyntaxTree.RangeType THEN
  3087. ASSERT(rightType IS SyntaxTree.RangeType);
  3088. BrneL(trueLabel, left.op, right.op); (* first *)
  3089. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3090. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3091. ReleaseOperand(left); ReleaseOperand(right);
  3092. BrL(falseLabel)
  3093. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3094. BrneL(trueLabel, left.op, right.op); (* first *)
  3095. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3096. ReleaseOperand(left); ReleaseOperand(right);
  3097. BrL(falseLabel)
  3098. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3099. (* TODO: review this *)
  3100. BrneL(trueLabel, left.op, right.op); (* real part *)
  3101. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3102. ReleaseOperand(left); ReleaseOperand(right);
  3103. BrL(falseLabel)
  3104. ELSE
  3105. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3106. ReleaseOperand(left); ReleaseOperand(right);
  3107. BrL(trueLabel);
  3108. END;
  3109. END;
  3110. |Scanner.In:
  3111. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3112. Evaluate(x.left,left);
  3113. Evaluate(x.right,right);
  3114. Convert(left.op,setType);
  3115. ReuseCopy(temp.op,right.op);
  3116. Emit(Shr(position,temp.op,temp.op,left.op));
  3117. ReleaseOperand(right); ReleaseOperand(left);
  3118. IntermediateCode.InitImmediate(one,setType,1);
  3119. Emit(And(position,temp.op,temp.op,one));
  3120. IF conditional THEN
  3121. IntermediateCode.InitImmediate(zero,setType,0);
  3122. BrneL(trueLabel,temp.op,zero);
  3123. ReleaseOperand(temp);
  3124. BrL(falseLabel);
  3125. ELSE
  3126. Convert(temp.op,bool);
  3127. result.mode := ModeValue;
  3128. result.op := temp.op;
  3129. result.tag := nil; (* may be left over from calls to evaluate *)
  3130. END;
  3131. ELSE
  3132. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3133. IF x.operator = Scanner.Questionmarks THEN
  3134. leftExpression := x.left;
  3135. rightExpression := x.right;
  3136. ELSE
  3137. leftExpression := x.right;
  3138. rightExpression := x.left;
  3139. END;
  3140. Evaluate(leftExpression, left);
  3141. Emit(Push(position,left.op));
  3142. ReleaseOperand(left);
  3143. Designate(rightExpression, right);
  3144. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3145. IF ~backend.cellsAreObjects THEN
  3146. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3147. END;
  3148. Emit(Push(position,right.op));
  3149. ReleaseOperand(right);
  3150. IF backend.cellsAreObjects THEN
  3151. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3152. ELSE
  3153. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3154. END;
  3155. InitOperand(result, ModeValue);
  3156. result.op := NewRegisterOperand(bool);
  3157. Emit(Result(position,result.op));
  3158. IF conditional THEN
  3159. IntermediateCode.InitImmediate(zero,setType,0);
  3160. BrneL(trueLabel,result.op,zero);
  3161. ReleaseOperand(result);
  3162. BrL(falseLabel);
  3163. END;
  3164. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3165. leftExpression := x.left;
  3166. rightExpression := x.right;
  3167. Evaluate(leftExpression, left);
  3168. Emit(Push(position,left.op));
  3169. ReleaseOperand(left);
  3170. Evaluate(rightExpression, right);
  3171. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3172. IF ~backend.cellsAreObjects THEN
  3173. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3174. END;
  3175. Emit(Push(position,right.op));
  3176. ReleaseOperand(right);
  3177. IF backend.cellsAreObjects THEN
  3178. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3179. ELSE
  3180. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3181. END;
  3182. InitOperand(result, ModeValue);
  3183. result.op := NewRegisterOperand(bool);
  3184. Emit(Result(position,result.op));
  3185. IF conditional THEN
  3186. IntermediateCode.InitImmediate(zero,setType,0);
  3187. BrneL(trueLabel,result.op,zero);
  3188. ReleaseOperand(result);
  3189. BrL(falseLabel);
  3190. END;
  3191. ELSE
  3192. HALT(100);
  3193. END;
  3194. END;
  3195. destination := dest;
  3196. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3197. END VisitBinaryExpression;
  3198. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3199. VAR localResult, operand: Operand;
  3200. BEGIN
  3201. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3202. InitOperand(localResult, ModeValue);
  3203. ASSERT(x.first # NIL);
  3204. Evaluate(x.first, operand);
  3205. localResult.op := operand.op;
  3206. ReleaseOperand(operand);
  3207. UseIntermediateOperand(localResult.op);
  3208. ASSERT(x.last # NIL);
  3209. Evaluate(x.last, operand);
  3210. localResult.tag := operand.op;
  3211. ReleaseOperand(operand);
  3212. UseIntermediateOperand(localResult.tag);
  3213. IF x.step # NIL THEN
  3214. Evaluate(x.step, operand);
  3215. localResult.extra := operand.op;
  3216. ReleaseOperand(operand);
  3217. UseIntermediateOperand(localResult.extra);
  3218. END;
  3219. result := localResult;
  3220. IF Trace THEN TraceExit("VisitRangeExpression") END
  3221. END VisitRangeExpression;
  3222. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3223. BEGIN
  3224. HALT(100); (* should never be evaluated *)
  3225. END VisitTensorRangeExpression;
  3226. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3227. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3228. BEGIN
  3229. IF Trace THEN TraceEnter("VisitConversion") END;
  3230. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3231. dest := destination; destination := emptyOperand;
  3232. Evaluate(x.expression,old);
  3233. InitOperand(result,ModeValue);
  3234. result.op := old.op;
  3235. ASSERT(result.op.mode # 0);
  3236. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3237. (* convert TO a complex number *)
  3238. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3239. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3240. ASSERT(result.op.mode # 0);
  3241. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3242. (* convert FROM a complex number TO a complex number*)
  3243. result.tag := old.tag;
  3244. ASSERT(result.tag.mode # 0);
  3245. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3246. ASSERT(result.tag.mode # 0)
  3247. ELSE
  3248. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3249. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3250. END
  3251. ELSE
  3252. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3253. ASSERT(result.op.mode # 0);
  3254. result.tag := old.tag; (*! probably never used *)
  3255. END;
  3256. destination := dest;
  3257. IF Trace THEN TraceExit("VisitConversion") END;
  3258. END VisitConversion;
  3259. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3260. BEGIN
  3261. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3262. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3263. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3264. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3265. END VisitTypeDeclaration;
  3266. (** designators (expressions) *)
  3267. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3268. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3269. BEGIN
  3270. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3271. IF x.left # NIL THEN Expression(x.left) END;
  3272. Symbol(x.symbol,result);
  3273. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3274. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3275. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3276. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3277. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3278. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3279. END;
  3280. END;
  3281. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3282. END VisitSymbolDesignator;
  3283. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3284. BEGIN
  3285. IF isUnchecked THEN RETURN END;
  3286. IF tagsAvailable THEN
  3287. TrapC(BrltL,index,length,IndexCheckTrap);
  3288. END;
  3289. END BoundCheck;
  3290. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3291. VAR d: IntermediateCode.Operand;
  3292. BEGIN
  3293. IF isUnchecked THEN RETURN END;
  3294. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3295. TrapC(op,dim,d,ArraySizeTrap);
  3296. ReleaseIntermediateOperand(d);
  3297. END DimensionCheck;
  3298. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3299. VAR
  3300. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3301. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3302. expression: SyntaxTree.Expression;
  3303. resultingType, leftType, baseType: SyntaxTree.Type;
  3304. skipLabel1: Label;
  3305. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3306. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3307. variableOp: Operand;
  3308. variable: SyntaxTree.Variable;
  3309. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3310. VAR expression: SyntaxTree.Expression;
  3311. BEGIN
  3312. (* count the number of indices, ranges and tensorRanges in the index list *)
  3313. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3314. FOR i := 0 TO parameters.Length() - 1 DO
  3315. expression := parameters.GetExpression(i);
  3316. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3317. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3318. ELSE INC(indexCount)
  3319. END
  3320. END;
  3321. END CountIndices;
  3322. BEGIN
  3323. ASSERT(tagsAvailable);
  3324. resultingType := x.type.resolved; (* resulting type *)
  3325. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3326. InitOperand(localResult, ModeReference);
  3327. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3328. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3329. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3330. (* a globally defined array destination tag is available -> use and invalidate it*)
  3331. localResult.tag := arrayDestinationTag;
  3332. IntermediateCode.InitOperand(arrayDestinationTag)
  3333. ELSE
  3334. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3335. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3336. Symbol(variable, variableOp);
  3337. ReuseCopy(localResult.tag, variableOp.op);
  3338. ReleaseOperand(variableOp);
  3339. END
  3340. END;
  3341. indexListSize := x.parameters.Length();
  3342. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3343. ASSERT(tensorRangeCount <= 1);
  3344. (* designate the array to be indexed over, perform tensor range check if known *)
  3345. Designate(x.left, array);
  3346. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3347. Dereference(array, leftType,FALSE);
  3348. IF tensorRangeCount=0 THEN
  3349. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3350. END
  3351. END;
  3352. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3353. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3354. srcDimOffset := -indexListSize;
  3355. destDimOffset := -rangeCount
  3356. ELSE
  3357. srcDimOffset := 0;
  3358. destDimOffset := 0
  3359. END;
  3360. indexDim := 0;
  3361. (* use address of source array as basis *)
  3362. (*
  3363. ReuseCopy(localResult.op, array.op);
  3364. *)
  3365. localResult.op := array.op;
  3366. UseIntermediateOperand(localResult.op);
  3367. (* go through the index list *)
  3368. FOR i := 0 TO indexListSize - 1 DO
  3369. expression := x.parameters.GetExpression(i);
  3370. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3371. (* nothing to do *)
  3372. ELSE
  3373. (* determine which dimension of source array is currently looked at *)
  3374. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3375. (* get the memory operand pointing to array descriptor dimension *)
  3376. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3377. (* make a reusable register from it *)
  3378. ReuseCopy(srcDim, tmp);
  3379. ReleaseIntermediateOperand(tmp);
  3380. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3381. ELSE
  3382. srcDim := IntermediateCode.Immediate(int32, i)
  3383. END;
  3384. (* get length and increment of source array for current dimension *)
  3385. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3386. Convert(sourceLength.op, sizeType);
  3387. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3388. Convert(sourceIncrement.op, sizeType);
  3389. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3390. ReleaseIntermediateOperand(srcDim);
  3391. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3392. (* SINGLE INDEX *)
  3393. Evaluate(expression, index);
  3394. ReleaseIntermediateOperand(index.tag);
  3395. index.tag := emptyOperand;
  3396. Convert(index.op, sizeType);
  3397. (* lower bound check *)
  3398. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3399. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3400. ELSIF isUnchecked THEN (* do nothing *)
  3401. ELSE
  3402. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3403. END;
  3404. (* upper bound check *)
  3405. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3406. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3407. ELSIF isUnchecked THEN (* do nothing *)
  3408. ELSE
  3409. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3410. END;
  3411. ReleaseOperand(sourceLength);
  3412. Convert(index.op, addressType);
  3413. summand := index.op;
  3414. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3415. (* RANGE OF INDICES *)
  3416. Evaluate(expression, range);
  3417. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3418. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3419. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3420. ReleaseOperand(range);
  3421. Convert(firstIndex, sizeType);
  3422. Convert(lastIndex, sizeType);
  3423. Convert(stepSize, sizeType);
  3424. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3425. if it is 'MAX(LONGINT)' *)
  3426. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3427. TransferToRegister(lastIndex, lastIndex);
  3428. skipLabel1 := NewLabel();
  3429. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3430. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3431. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3432. SetLabel(skipLabel1)
  3433. END;
  3434. (* check if step size is valid *)
  3435. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3436. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3437. ELSIF isUnchecked THEN (* do nothing *)
  3438. ELSE
  3439. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3440. END;
  3441. (* check lower bound check *)
  3442. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3443. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3444. ELSIF isUnchecked THEN (* do nothing *)
  3445. ELSE
  3446. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3447. END;
  3448. (* check upper bound check *)
  3449. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3450. (* statically open range: nothing to do *)
  3451. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3452. ASSERT(staticLastIndex < staticSourceLength)
  3453. ELSIF isUnchecked THEN (* do nothing *)
  3454. ELSE
  3455. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3456. END;
  3457. (* determine length of target array for current dimension *)
  3458. (* 1. incorporate last index: *)
  3459. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3460. (* last index is static *)
  3461. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3462. targetLength := sourceLength.op
  3463. ELSE
  3464. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3465. END;
  3466. UseIntermediateOperand(targetLength);
  3467. ELSE
  3468. (* targetLength := lastIndex + 1
  3469. Reuse1(targetLength, lastIndex);
  3470. *)
  3471. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3472. END;
  3473. ReleaseOperand(sourceLength);
  3474. ReleaseIntermediateOperand(lastIndex);
  3475. (* 2. incorporate first index: *)
  3476. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3477. (* first index and current target length are static *)
  3478. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3479. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3480. (* first index = 0: nothing to do *)
  3481. ELSE
  3482. (* targetLength := targetLength - firstIndex *)
  3483. TransferToRegister(targetLength, targetLength);
  3484. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3485. END;
  3486. (* clip negative lengths to 0 *)
  3487. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3488. IF staticTargetLength < 0 THEN
  3489. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3490. END
  3491. ELSE
  3492. skipLabel1 := NewLabel();
  3493. TransferToRegister(targetLength, targetLength);
  3494. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3495. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3496. SetLabel(skipLabel1)
  3497. END;
  3498. (* 3. incorporate index step size: *)
  3499. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3500. (*step size and current target length are static *)
  3501. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3502. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3503. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3504. (* step size = 1: nothing to do *)
  3505. ELSE
  3506. (* emit code for this:
  3507. targetLength := (targetLength-1) DIV stepSize +1;
  3508. *)
  3509. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3510. DivInt(targetLength, targetLength, stepSize);
  3511. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3512. END;
  3513. (* determine increment of target array for current dimension *)
  3514. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3515. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3516. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3517. (* step size = 1 *)
  3518. targetIncrement := sourceIncrement.op;
  3519. UseIntermediateOperand(targetIncrement)
  3520. ELSE
  3521. (* targetIncrement := sourceIncrement * stepSize *)
  3522. Reuse1(targetIncrement, stepSize);
  3523. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3524. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3525. END;
  3526. ReleaseIntermediateOperand(stepSize);
  3527. (* write length and increment of target array to descriptor *)
  3528. IF destDimOffset < 0 THEN
  3529. (* determine which dimension of target array is currently looked at *)
  3530. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3531. TransferToRegister(destDim, tmp);
  3532. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3533. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3534. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3535. ReleaseIntermediateOperand(destDim)
  3536. ELSE
  3537. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3538. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3539. END;
  3540. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3541. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3542. INC(indexDim);
  3543. Convert(firstIndex, addressType);
  3544. TransferToRegister(summand, firstIndex);
  3545. ELSE HALT(100);
  3546. END;
  3547. (*
  3548. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3549. *)
  3550. Convert(sourceIncrement.op, addressType);
  3551. Convert(summand, addressType);
  3552. MulInt(summand, summand, sourceIncrement.op);
  3553. ReleaseIntermediateOperand(sourceIncrement.op);
  3554. AddInt(localResult.op, localResult.op, summand);
  3555. ReleaseIntermediateOperand(summand);
  3556. END
  3557. END;
  3558. result := localResult;
  3559. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3560. ReleaseIntermediateOperand(result.tag);
  3561. result.tag := TypeDescriptorAdr(resultingType);
  3562. IF ~newObjectFile THEN
  3563. IntermediateCode.MakeMemory(result.tag,addressType);
  3564. END;
  3565. ELSIF IsDelegate(resultingType) THEN
  3566. ReleaseIntermediateOperand(result.tag);
  3567. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3568. UseIntermediateOperand(result.tag);
  3569. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3570. ReleaseIntermediateOperand(result.tag);
  3571. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3572. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3573. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3574. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3575. (* finalize target array descriptor *)
  3576. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3577. (* write lengths and increments of target array for remaining dimensions *)
  3578. i := indexListSize;
  3579. WHILE indexDim < targetArrayDimensionality DO
  3580. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3581. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3582. ReleaseOperand(sourceLength);
  3583. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3584. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3585. ReleaseOperand(sourceIncrement);
  3586. INC(i); INC(indexDim);
  3587. END;
  3588. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3589. tmp := nil;
  3590. ELSE
  3591. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3592. END;
  3593. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3594. ReleaseIntermediateOperand(tmp);
  3595. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3596. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3597. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3598. ELSE
  3599. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3600. END;
  3601. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3602. ReleaseIntermediateOperand(tmp);
  3603. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3604. (* write dimensionality *)
  3605. IF targetArrayDimensionality # 0 THEN
  3606. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3607. END;
  3608. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3609. END;
  3610. ReleaseOperand(array);
  3611. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3612. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3613. END;
  3614. END MathIndexDesignator;
  3615. (* TENTATIVE *)
  3616. PROCEDURE DumpOperand(operand: Operand);
  3617. BEGIN
  3618. D.Log.String(" op = ");
  3619. IntermediateCode.DumpOperand(D.Log, operand.op );
  3620. D.Log.Ln;
  3621. D.Log.String(" tag = ");
  3622. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3623. D.Log.Ln;
  3624. D.Log.String(" extra = ");
  3625. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3626. D.Log.Ln;
  3627. D.Log.Update
  3628. END DumpOperand;
  3629. (* get the length of an array , trying to make use of static information *)
  3630. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3631. VAR res: IntermediateCode.Operand; size: LONGINT;
  3632. BEGIN
  3633. type := type.resolved;
  3634. IF type IS SyntaxTree.ArrayType THEN
  3635. WITH type: SyntaxTree.ArrayType DO
  3636. IF type.form = SyntaxTree.Static THEN
  3637. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3638. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3639. Evaluate(type.length, op);
  3640. ReleaseIntermediateOperand(op.tag);
  3641. RETURN op.op;*)
  3642. ELSE
  3643. res := tag;
  3644. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3645. IntermediateCode.MakeMemory(res,addressType);
  3646. UseIntermediateOperand(res);
  3647. RETURN res
  3648. END
  3649. END;
  3650. ELSE
  3651. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3652. RETURN IntermediateCode.Immediate(addressType,size);
  3653. END;
  3654. END ArrayLength;
  3655. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3656. BEGIN
  3657. ReleaseIntermediateOperand(res);
  3658. IF IsImmediate(x) & IsImmediate(y) THEN
  3659. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3660. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3661. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3662. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3663. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3664. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3665. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3666. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3667. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3668. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3669. UseIntermediateOperand(res);
  3670. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3671. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3672. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3673. UseIntermediateOperand(res);
  3674. ELSE
  3675. IF ~ReusableRegister(res) THEN
  3676. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3677. ELSE
  3678. UseIntermediateOperand(res);
  3679. END;
  3680. IF IsImmediate(x) & (x.intValue = 0) THEN
  3681. Emit(Mov(position,res,y))
  3682. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3683. Emit(Mov(position,res,x))
  3684. ELSE
  3685. Emit(Add(position,res, x, y));
  3686. END;
  3687. END;
  3688. END AddInt;
  3689. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3690. BEGIN
  3691. ReleaseIntermediateOperand(res);
  3692. IF IsImmediate(x) & IsImmediate(y) THEN
  3693. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3694. ELSE
  3695. IF ~ReusableRegister(res) THEN
  3696. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3697. ELSE UseIntermediateOperand(res);
  3698. END;
  3699. IF IsImmediate(x) & (x.intValue = 1) THEN
  3700. Emit(Mov(position,res,y))
  3701. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3702. Emit(Mov(position,res,x))
  3703. ELSE
  3704. Emit(Mul(position,res, x, y));
  3705. END;
  3706. END;
  3707. END MulInt;
  3708. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3709. BEGIN
  3710. ReleaseIntermediateOperand(res);
  3711. IF IsImmediate(x) & IsImmediate(y) THEN
  3712. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3713. ELSE
  3714. IF ~ReusableRegister(res) THEN
  3715. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3716. ELSE UseIntermediateOperand(res);
  3717. END;
  3718. IF IsImmediate(x) & (x.intValue = 1) THEN
  3719. Emit(Mov(position,res,y))
  3720. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3721. Emit(Mov(position,res,x))
  3722. ELSE
  3723. Emit(Div(position,res, x, y));
  3724. END;
  3725. END;
  3726. END DivInt;
  3727. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3728. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3729. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3730. BEGIN
  3731. type := x.left.type.resolved;
  3732. IF type IS SyntaxTree.StringType THEN
  3733. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3734. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3735. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3736. type := atype;
  3737. x.left.SetType(type);
  3738. END;
  3739. IntermediateCode.InitImmediate(res,addressType,0);
  3740. maxDim := x.parameters.Length()-1;
  3741. FOR i := 0 TO maxDim DO
  3742. e := x.parameters.GetExpression(i);
  3743. Evaluate(e,index);
  3744. Convert(index.op,addressType);
  3745. AddInt(res, res, index.op);
  3746. IF i = 0 THEN
  3747. (*
  3748. ReuseCopy(res, index.op);
  3749. *)
  3750. Designate(x.left,array);
  3751. type := x.left.type.resolved;
  3752. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3753. Dereference(array, type, FALSE);
  3754. END;
  3755. (*
  3756. ELSE AddInt(res, res, index.op);
  3757. *)
  3758. END;
  3759. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3760. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3761. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3762. BoundCheck(index.op, length);
  3763. END;
  3764. ReleaseIntermediateOperand(length);
  3765. END;
  3766. ReleaseOperand(index);
  3767. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3768. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3769. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3770. MulInt(res,res,length);
  3771. END;
  3772. ReleaseIntermediateOperand(length);
  3773. END;
  3774. IF (type IS SyntaxTree.ArrayType) THEN
  3775. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3776. size := StaticSize(system, type);
  3777. IF size # 1 THEN
  3778. length := IntermediateCode.Immediate(addressType,size);
  3779. MulInt(res,res,length);
  3780. END;
  3781. ELSE
  3782. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3783. IF size # 1 THEN
  3784. length := IntermediateCode.Immediate(addressType,size);
  3785. MulInt(res,res,length);
  3786. END;
  3787. END;
  3788. END;
  3789. AddInt(res,res,array.op);
  3790. InitOperand(result,ModeReference);
  3791. result.op := res;
  3792. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3793. ReleaseIntermediateOperand(result.tag);
  3794. result.tag := TypeDescriptorAdr(type);
  3795. IF ~newObjectFile THEN
  3796. IntermediateCode.MakeMemory(result.tag,addressType);
  3797. END
  3798. ELSIF IsDelegate(type) THEN
  3799. ReleaseIntermediateOperand(result.tag);
  3800. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3801. UseIntermediateOperand(result.tag);
  3802. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3803. ReleaseIntermediateOperand(result.tag);
  3804. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3805. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3806. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3807. END;
  3808. ReleaseOperand(array);
  3809. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3810. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3811. END;
  3812. END IndexDesignator;
  3813. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3814. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3815. BEGIN
  3816. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3817. dest := destination; destination := emptyOperand;
  3818. type := x.left.type.resolved;
  3819. IF type IS SyntaxTree.MathArrayType THEN
  3820. MathIndexDesignator(x);
  3821. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3822. IndexDesignator(x);
  3823. END;
  3824. destination := dest;
  3825. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3826. END VisitIndexDesignator;
  3827. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3828. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3829. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3830. procedure: SyntaxTree.Procedure;
  3831. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3832. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3833. BEGIN
  3834. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3835. parameters := expression.parameters;
  3836. moduleName := "FoxArrayBase";
  3837. procedureName := "CopyDescriptor";
  3838. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3839. SaveRegisters();ReleaseUsedRegisters(saved);
  3840. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3841. IF procedure = NIL THEN
  3842. s := "procedure ";
  3843. Strings.Append(s,moduleName);
  3844. Strings.Append(s,".");
  3845. Strings.Append(s,procedureName);
  3846. Strings.Append(s," not present");
  3847. Error(position,s);
  3848. ELSE
  3849. (* push address of temporary variable *)
  3850. Symbol(variable,destOperand);
  3851. Emit(Push(position,destOperand.op));
  3852. ReleaseOperand(destOperand);
  3853. (* push src *)
  3854. Evaluate(expression.left,srcOperand);
  3855. (*
  3856. Dereference(srcOperand,expression.type.resolved);
  3857. Emit(Push(position,srcOperand.tag));
  3858. *)
  3859. Emit(Push(position,srcOperand.op));
  3860. ReleaseOperand(srcOperand);
  3861. tensorFound := FALSE;
  3862. FOR i := 0 TO parameters.Length()-1 DO
  3863. e := parameters.GetExpression(i);
  3864. IF e IS SyntaxTree.TensorRangeExpression THEN
  3865. tensorFound := TRUE;
  3866. ELSIF e IS SyntaxTree.RangeExpression THEN
  3867. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3868. ELSE
  3869. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3870. END;
  3871. END;
  3872. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  3873. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  3874. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  3875. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  3876. StaticCallOperand(procOp,procedure);
  3877. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  3878. ReleaseOperand(procOp);
  3879. END;
  3880. RestoreRegisters(saved);
  3881. END;
  3882. RETURN variable
  3883. END PrepareTensorDescriptor;
  3884. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  3885. VAR
  3886. type, descriptorType, baseType: SyntaxTree.Type;
  3887. operand, tmpOperand, variableOp, variable2Op: Operand;
  3888. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  3889. variable, variable2: SyntaxTree.Variable;
  3890. dim, i, size: LONGINT;
  3891. (* TODO: needed? *)
  3892. oldArrayDestinationTag: IntermediateCode.Operand;
  3893. oldArrayDestinationDimension: LONGINT;
  3894. position: LONGINT;
  3895. saved: RegisterEntry;
  3896. arrayFlags: SET;
  3897. m, n: LONGINT;
  3898. PROCEDURE Pass(op: IntermediateCode.Operand);
  3899. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  3900. BEGIN
  3901. IF numberRegister >= 0 THEN
  3902. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  3903. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  3904. Emit(Mov(position,parameterRegister, op));
  3905. ELSE
  3906. Emit(Push(position,op))
  3907. END
  3908. END Pass;
  3909. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  3910. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  3911. BEGIN
  3912. formalType := formalType.resolved; actualType := actualType.resolved;
  3913. IF IsOpenArray(formalType)THEN
  3914. IF actualType IS SyntaxTree.StringType THEN
  3915. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  3916. RETURN;
  3917. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  3918. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  3919. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  3920. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  3921. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  3922. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3923. ELSE
  3924. tmp := baseReg;
  3925. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  3926. IntermediateCode.MakeMemory(tmp,addressType);
  3927. Pass((tmp));
  3928. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3929. END;
  3930. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  3931. END;
  3932. END PushArrayLens;
  3933. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  3934. BEGIN
  3935. CASE size OF
  3936. |2: INCL(flags,Size2Flag);
  3937. |3: INCL(flags,Size3Flag);
  3938. |4: INCL(flags,Size4Flag);
  3939. |5: INCL(flags,Size5Flag);
  3940. |6: INCL(flags,Size6Flag);
  3941. |7: INCL(flags,Size7Flag);
  3942. |8: INCL(flags,Size8Flag);
  3943. END;
  3944. END SetSmallArraySizeFlag;
  3945. BEGIN
  3946. IF Trace THEN TraceEnter("PushParameter") END;
  3947. position := expression.position;
  3948. IF expression.resolved # NIL THEN expression := expression.resolved END;
  3949. type := expression.type.resolved;
  3950. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  3951. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  3952. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  3953. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  3954. );
  3955. (* TODO: needed? *)
  3956. oldArrayDestinationTag := arrayDestinationTag;
  3957. oldArrayDestinationDimension := arrayDestinationDimension;
  3958. IF IsArrayOfSystemByte(parameter.type) THEN
  3959. Designate(expression,operand);
  3960. tmp := GetArrayOfBytesSize(expression,operand.tag);
  3961. ReleaseIntermediateOperand(operand.tag);
  3962. operand.tag := tmp;
  3963. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3964. Pass((operand.tag));
  3965. END;
  3966. Pass((operand.op));
  3967. ELSIF IsOpenArray(parameter.type) THEN
  3968. Designate(expression,operand);
  3969. baseReg := operand.tag;
  3970. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3971. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  3972. END;
  3973. Pass((operand.op)); (* address of the array *)
  3974. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  3975. (* case 1 *)
  3976. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  3977. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  3978. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3979. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  3980. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  3981. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3982. arrayDestinationTag := sp;
  3983. (* case 1b *)
  3984. IF expression IS SyntaxTree.IndexDesignator THEN
  3985. (*
  3986. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3987. descriptorType := GetMathArrayDescriptorType(dim);
  3988. variable := GetTemporaryVariable(descriptorType,expression.position);
  3989. Symbol(variable,variableOp);
  3990. arrayDestinationTag := variableOp.op;
  3991. *)
  3992. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  3993. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3994. arrayDestinationDimension := dim;
  3995. Designate(expression,operand);
  3996. (* case 1a *)
  3997. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  3998. Designate(expression,operand);
  3999. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4000. i := 0;
  4001. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4002. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4003. INC(i);
  4004. END;
  4005. type := expression.type.resolved;
  4006. WHILE (i<dim) DO (* remaining static dimensions *)
  4007. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4008. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4009. ReleaseOperand(tmpOperand);
  4010. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4011. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4012. ReleaseOperand(tmpOperand);
  4013. INC(i);
  4014. END;
  4015. dimOp := IntermediateCode.Immediate(addressType,dim);
  4016. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4017. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4018. (* case 1d *)
  4019. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4020. Designate(expression,operand);
  4021. Dereference(operand,type.resolved,FALSE);
  4022. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4023. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4024. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4025. (* case 1f *)
  4026. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4027. Designate(expression,operand);
  4028. FOR i := 0 TO dim-1 DO
  4029. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4030. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4031. ReleaseOperand(tmpOperand);
  4032. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4033. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4034. ReleaseOperand(tmpOperand);
  4035. END;
  4036. (*******
  4037. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4038. *)
  4039. arrayFlags := {StaticFlag};
  4040. IF dim = 1 THEN
  4041. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4042. ReleaseOperand(tmpOperand);
  4043. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4044. m := LONGINT(tmpOperand.op.intValue);
  4045. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4046. ELSIF dim = 2 THEN
  4047. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4048. ReleaseOperand(tmpOperand);
  4049. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4050. m := LONGINT(tmpOperand.op.intValue);
  4051. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4052. ReleaseOperand(tmpOperand);
  4053. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4054. n := LONGINT(tmpOperand.op.intValue);
  4055. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4056. INCL(arrayFlags,SmallMatrixFlag);
  4057. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4058. END;
  4059. END;
  4060. (*******)
  4061. dimOp := IntermediateCode.Immediate(addressType,dim);
  4062. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4063. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4064. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4065. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4066. baseType := SemanticChecker.ArrayBase(type,dim);
  4067. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4068. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4069. ELSE HALT(100);
  4070. END;
  4071. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4072. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4073. (* case 2b *)
  4074. IF expression IS SyntaxTree.IndexDesignator THEN
  4075. descriptorType := GetMathArrayDescriptorType(dim);
  4076. variable := GetTemporaryVariable(descriptorType, FALSE);
  4077. Symbol(variable,variableOp);
  4078. arrayDestinationTag := variableOp.op;
  4079. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4080. arrayDestinationDimension := dim;
  4081. NeedDescriptor := TRUE;
  4082. Designate(expression,operand);
  4083. Pass((operand.tag));
  4084. NeedDescriptor := FALSE;
  4085. (* case 2a *)
  4086. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4087. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4088. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4089. INC(i);
  4090. END;
  4091. IF i = dim THEN
  4092. Designate(expression,operand);
  4093. Pass((operand.tag));
  4094. ELSE (* open-static *)
  4095. type := expression.type.resolved;
  4096. descriptorType := GetMathArrayDescriptorType(dim);
  4097. variable := GetTemporaryVariable(descriptorType, FALSE);
  4098. Symbol(variable,variableOp);
  4099. arrayDestinationTag := variableOp.op;
  4100. Designate(expression,operand);
  4101. FOR i := 0 TO dim-1 DO
  4102. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4103. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4104. ReleaseOperand(tmpOperand);
  4105. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4106. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4107. ReleaseOperand(tmpOperand);
  4108. END;
  4109. dimOp := IntermediateCode.Immediate(addressType,dim);
  4110. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4111. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4112. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4113. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4114. baseType := SemanticChecker.ArrayBase(type,dim);
  4115. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4116. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4117. Pass((arrayDestinationTag));
  4118. END;
  4119. (* case 2d *)
  4120. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4121. Designate(expression,operand);
  4122. Dereference(operand,type.resolved,FALSE);
  4123. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4124. Pass((operand.tag));
  4125. (* case 2f *)
  4126. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4127. descriptorType := GetMathArrayDescriptorType(dim);
  4128. variable := GetTemporaryVariable(descriptorType, FALSE);
  4129. Symbol(variable,variableOp);
  4130. arrayDestinationTag := variableOp.op;
  4131. Designate(expression,operand);
  4132. FOR i := 0 TO dim-1 DO
  4133. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4134. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4135. ReleaseOperand(tmpOperand);
  4136. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4137. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4138. ReleaseOperand(tmpOperand);
  4139. END;
  4140. (*
  4141. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4142. *)
  4143. arrayFlags := {StaticFlag};
  4144. IF dim = 1 THEN
  4145. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4146. ReleaseOperand(tmpOperand);
  4147. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4148. m := LONGINT(tmpOperand.op.intValue);
  4149. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4150. ELSIF dim = 2 THEN
  4151. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4152. ReleaseOperand(tmpOperand);
  4153. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4154. m := LONGINT(tmpOperand.op.intValue);
  4155. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4156. ReleaseOperand(tmpOperand);
  4157. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4158. n := LONGINT(tmpOperand.op.intValue);
  4159. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4160. INCL(arrayFlags,SmallMatrixFlag);
  4161. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4162. END;
  4163. END;
  4164. (*******)
  4165. dimOp := IntermediateCode.Immediate(addressType,dim);
  4166. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4167. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4168. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4169. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4170. baseType := SemanticChecker.ArrayBase(type,dim);
  4171. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4172. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4173. Pass((arrayDestinationTag));
  4174. ELSE HALT(100);
  4175. END;
  4176. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4177. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4178. (* case 3b *)
  4179. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4180. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4181. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4182. Symbol(variable,variableOp);
  4183. LoadValue(variableOp,system.addressType);
  4184. ELSE
  4185. descriptorType := GetMathArrayDescriptorType(dim);
  4186. variable := GetTemporaryVariable(descriptorType, FALSE);
  4187. Symbol(variable,variableOp);
  4188. END;
  4189. arrayDestinationTag := variableOp.op;
  4190. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4191. arrayDestinationDimension := 0;
  4192. Designate(expression,operand);
  4193. Pass((operand.tag));
  4194. (* case 3a *)
  4195. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4196. i := 0;
  4197. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4198. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4199. INC(i);
  4200. END;
  4201. IF i = dim THEN
  4202. Designate(expression,operand);
  4203. Pass((operand.tag));
  4204. ELSE (* open-static *)
  4205. type := expression.type.resolved;
  4206. descriptorType := GetMathArrayDescriptorType(dim);
  4207. variable := GetTemporaryVariable(descriptorType, FALSE);
  4208. Symbol(variable,variableOp);
  4209. arrayDestinationTag := variableOp.op;
  4210. Designate(expression,operand);
  4211. FOR i := 0 TO dim-1 DO
  4212. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4213. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4214. ReleaseOperand(tmpOperand);
  4215. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4216. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4217. ReleaseOperand(tmpOperand);
  4218. END;
  4219. dimOp := IntermediateCode.Immediate(addressType,dim);
  4220. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4221. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4222. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4223. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4224. baseType := SemanticChecker.ArrayBase(type,dim);
  4225. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4226. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4227. Pass((arrayDestinationTag));
  4228. END;
  4229. (* case 3d *)
  4230. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4231. Designate(expression,operand);
  4232. Dereference(operand,type.resolved,FALSE);
  4233. (*
  4234. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4235. *)
  4236. Pass((operand.tag));
  4237. (* case 3f *)
  4238. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4239. descriptorType := GetMathArrayDescriptorType(dim);
  4240. variable := GetTemporaryVariable(descriptorType, FALSE);
  4241. Symbol(variable,variableOp);
  4242. arrayDestinationTag := variableOp.op;
  4243. Designate(expression,operand);
  4244. IF operand.op.type.length >1 THEN (* vector register *)
  4245. variable2 := GetTemporaryVariable(type, FALSE);
  4246. Symbol(variable2, variable2Op);
  4247. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4248. Emit(Mov(position,tmp, operand.op));
  4249. ReleaseOperand(operand);
  4250. Symbol(variable2, operand);
  4251. END;
  4252. FOR i := 0 TO dim-1 DO
  4253. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4254. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4255. ReleaseOperand(tmpOperand);
  4256. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4257. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4258. ReleaseOperand(tmpOperand);
  4259. END;
  4260. dimOp := IntermediateCode.Immediate(addressType,dim);
  4261. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4262. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4263. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4264. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4265. baseType := SemanticChecker.ArrayBase(type,dim);
  4266. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4267. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4268. Pass((arrayDestinationTag));
  4269. ELSE HALT(100);
  4270. END;
  4271. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4272. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4273. (* case 4b *)
  4274. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4275. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4276. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4277. Symbol(variable,variableOp);
  4278. LoadValue(variableOp,system.addressType);
  4279. ELSE
  4280. descriptorType := GetMathArrayDescriptorType(dim);
  4281. variable := GetTemporaryVariable(descriptorType, FALSE);
  4282. Symbol(variable,variableOp);
  4283. END;
  4284. arrayDestinationTag := variableOp.op;
  4285. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4286. arrayDestinationDimension := 0;
  4287. Designate(expression,operand);
  4288. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4289. Symbol(variable,variableOp);
  4290. ELSE
  4291. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4292. Symbol(variable,variableOp);
  4293. MakeMemory(tmp,variableOp.op,addressType,0);
  4294. Emit(Mov(position,tmp,operand.tag));
  4295. ReleaseIntermediateOperand(tmp);
  4296. END;
  4297. Pass((variableOp.op));
  4298. ReleaseOperand(variableOp);
  4299. (* case 4a *)
  4300. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4301. i := 0;
  4302. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4303. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4304. INC(i);
  4305. END;
  4306. IF i = dim THEN
  4307. Designate(expression,operand);
  4308. arrayDestinationTag := operand.tag;
  4309. ELSE (* open-static *)
  4310. type := expression.type.resolved;
  4311. descriptorType := GetMathArrayDescriptorType(dim);
  4312. variable := GetTemporaryVariable(descriptorType, FALSE);
  4313. Symbol(variable,variableOp);
  4314. arrayDestinationTag := variableOp.op;
  4315. Designate(expression,operand);
  4316. FOR i := 0 TO dim-1 DO
  4317. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4318. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4319. ReleaseOperand(tmpOperand);
  4320. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4321. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4322. ReleaseOperand(tmpOperand);
  4323. END;
  4324. dimOp := IntermediateCode.Immediate(addressType,dim);
  4325. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4326. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4327. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4328. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4329. baseType := SemanticChecker.ArrayBase(type,dim);
  4330. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4331. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4332. END;
  4333. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4334. Symbol(variable,variableOp);
  4335. MakeMemory(tmp,variableOp.op,addressType,0);
  4336. Emit(Mov(position,tmp,arrayDestinationTag));
  4337. ReleaseIntermediateOperand(tmp);
  4338. Pass((variableOp.op));
  4339. ReleaseOperand(variableOp);
  4340. (* case 4d *)
  4341. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4342. Designate(expression,operand);
  4343. (*
  4344. Dereference(operand,type.resolved,FALSE);
  4345. *)
  4346. (*
  4347. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4348. *)
  4349. Pass((operand.op));
  4350. (* case 4f *)
  4351. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4352. descriptorType := GetMathArrayDescriptorType(dim);
  4353. variable := GetTemporaryVariable(descriptorType, FALSE);
  4354. Symbol(variable,variableOp);
  4355. arrayDestinationTag := variableOp.op;
  4356. Designate(expression,operand);
  4357. FOR i := 0 TO dim-1 DO
  4358. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4359. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4360. ReleaseOperand(tmpOperand);
  4361. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4362. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4363. ReleaseOperand(tmpOperand);
  4364. END;
  4365. dimOp := IntermediateCode.Immediate(addressType,dim);
  4366. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4367. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4368. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4369. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4370. baseType := SemanticChecker.ArrayBase(type,dim);
  4371. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4372. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4373. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4374. Symbol(variable,variableOp);
  4375. MakeMemory(tmp,variableOp.op,addressType,0);
  4376. Emit(Mov(position,tmp,arrayDestinationTag));
  4377. ReleaseIntermediateOperand(tmp);
  4378. Pass((variableOp.op));
  4379. ReleaseOperand(variableOp);
  4380. ELSE HALT(100);
  4381. END;
  4382. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4383. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4384. Designate(expression,operand);
  4385. IF operand.op.type.length > 1 THEN
  4386. Emit(Push(position, operand.op));
  4387. ReleaseOperand(operand);
  4388. ELSE
  4389. size := system.SizeOf(type);
  4390. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4391. size := ToMemoryUnits(system,size);
  4392. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4393. arrayDestinationTag := sp;
  4394. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4395. END;
  4396. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4397. Designate(expression,operand);
  4398. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4399. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4400. Symbol(variable,variableOp);
  4401. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4402. Emit(Mov(position,tmp,operand.op));
  4403. Emit(Push(position,variableOp.op));
  4404. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4405. Pass((operand.op));
  4406. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4407. END;
  4408. ELSE HALT(200)
  4409. END;
  4410. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4411. IF parameter.kind = SyntaxTree.VarParameter THEN
  4412. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4413. Designate(expression, operand);
  4414. Pass((operand.op));
  4415. ELSE
  4416. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4417. Evaluate(expression, operand);
  4418. Pass((operand.extra)); (* step *)
  4419. Pass((operand.tag)); (* last *)
  4420. Pass((operand.op)) (* first *)
  4421. END
  4422. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4423. IF parameter.kind = SyntaxTree.VarParameter THEN
  4424. Designate(expression, operand);
  4425. Pass((operand.op));
  4426. ELSE
  4427. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4428. Evaluate(expression, operand);
  4429. Pass((operand.tag)); (* real part *)
  4430. Pass((operand.op)) (* imaginary part *)
  4431. END
  4432. ELSE
  4433. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4434. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4435. Designate(expression,operand);
  4436. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4437. (* stack allocation *)
  4438. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4439. (*! parameter alignment to be discussed ... *)
  4440. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4441. size := type(SyntaxTree.StringType).length;
  4442. END;
  4443. IF backend.cooperative & parameter.NeedsTrace() THEN
  4444. dst := NewRegisterOperand (addressType);
  4445. Emit(Mov(position,dst, sp));
  4446. IntermediateCode.InitImmediate(null, byteType, 0);
  4447. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4448. ReleaseIntermediateOperand(dst);
  4449. SaveRegisters();ReleaseUsedRegisters(saved);
  4450. (* register dst has been freed before SaveRegisters already *)
  4451. CallAssignMethod(dst, operand.op, parameter.type);
  4452. RestoreRegisters(saved);
  4453. END;
  4454. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4455. ELSIF IsOpenArray(parameter.type) THEN
  4456. Designate(expression,operand);
  4457. baseReg := operand.tag;
  4458. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4459. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4460. END;
  4461. Pass((operand.op)); (* address of the array *)
  4462. ELSIF IsDelegate(parameter.type) THEN
  4463. Evaluate(expression,operand);
  4464. IF backend.cooperative & parameter.NeedsTrace() THEN
  4465. Emit(Push(position, nil));
  4466. dst := NewRegisterOperand (addressType);
  4467. Emit(Mov(position,dst, sp));
  4468. ReleaseIntermediateOperand(dst);
  4469. SaveRegisters();ReleaseUsedRegisters(saved);
  4470. Emit(Push(position, dst));
  4471. (* register dst has been freed before SaveRegisters already *)
  4472. Emit(Push(position, operand.tag));
  4473. CallThis(position,"GarbageCollector","Assign",2);
  4474. RestoreRegisters(saved);
  4475. ELSE
  4476. Pass((operand.tag));
  4477. END;
  4478. Pass((operand.op));
  4479. ELSE
  4480. Evaluate(expression,operand);
  4481. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4482. Emit(Push(position, nil));
  4483. dst := NewRegisterOperand (addressType);
  4484. Emit(Mov(position,dst, sp));
  4485. ReleaseIntermediateOperand(dst);
  4486. SaveRegisters();ReleaseUsedRegisters(saved);
  4487. Emit(Push(position, dst));
  4488. (* register dst has been freed before SaveRegisters already *)
  4489. Emit(Push(position, operand.op));
  4490. CallThis(position,"GarbageCollector","Assign",2);
  4491. RestoreRegisters(saved);
  4492. ELSE
  4493. Pass((operand.op));
  4494. END;
  4495. END;
  4496. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4497. Evaluate(expression,operand);
  4498. Pass((operand.op));
  4499. ELSE (* var parameter *)
  4500. Designate(expression,operand);
  4501. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4502. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4503. Pass((operand.tag));
  4504. END;
  4505. END;
  4506. Pass((operand.op));
  4507. END;
  4508. END;
  4509. (* TODO: needed? *)
  4510. arrayDestinationTag := oldArrayDestinationTag;
  4511. arrayDestinationDimension := oldArrayDestinationDimension;
  4512. IF needsParameterBackup THEN
  4513. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4514. ReuseCopy(parameterBackup, operand.op)
  4515. END;
  4516. ReleaseOperand(operand);
  4517. IF Trace THEN TraceExit("PushParameter") END;
  4518. END PushParameter;
  4519. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4520. VAR prevConditional: BOOLEAN;
  4521. BEGIN
  4522. prevConditional := conditional;
  4523. conditional := FALSE;
  4524. 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
  4525. Expression(x.result); (* use register *)
  4526. END;
  4527. Statement(x.statement);
  4528. conditional := prevConditional;
  4529. IF x.result # NIL THEN Expression(x.result) END;
  4530. 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
  4531. ReleaseIntermediateOperand(result.op);
  4532. END;
  4533. END VisitStatementDesignator;
  4534. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4535. VAR
  4536. procedure: SyntaxTree.Procedure;
  4537. procedureType: SyntaxTree.ProcedureType;
  4538. wasInline: BOOLEAN;
  4539. actualParameters: SyntaxTree.ExpressionList;
  4540. formalParameter: SyntaxTree.Parameter;
  4541. actualParameter: SyntaxTree.Expression;
  4542. i: LONGINT;
  4543. localVariable: SyntaxTree.Variable;
  4544. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4545. src, dest: Operand;
  4546. prevInlineExit : Label;
  4547. prevMapper: SymbolMapper;
  4548. tooComplex: BOOLEAN;
  4549. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4550. BEGIN
  4551. IF e = NIL THEN RETURN TRUE
  4552. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4553. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4554. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4555. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4556. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4557. ELSE RETURN FALSE
  4558. END;
  4559. END SimpleExpression;
  4560. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4561. BEGIN
  4562. RETURN checker.CanPassInRegister(type)
  4563. END FitsInRegister;
  4564. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4565. VAR
  4566. variable: SyntaxTree.Variable;
  4567. variableDesignator: SyntaxTree.Designator;
  4568. BEGIN
  4569. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4570. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4571. variableDesignator.SetType(type);
  4572. RETURN variableDesignator
  4573. END GetTemp;
  4574. BEGIN
  4575. wasInline := currentIsInline;
  4576. prevInlineExit := currentInlineExit;
  4577. prevMapper := currentMapper;
  4578. currentInlineExit := NewLabel();
  4579. tooComplex := FALSE;
  4580. NEW(currentMapper);
  4581. currentIsInline := TRUE;
  4582. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4583. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4584. formalParameter := procedureType.firstParameter;
  4585. actualParameters := x.parameters;
  4586. i := 0;
  4587. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4588. actualParameter := actualParameters.GetExpression(i);
  4589. IF actualParameter.resolved # NIL THEN
  4590. actualParameter := actualParameter.resolved
  4591. END;
  4592. (*
  4593. if expression is simple and can be passed immediately
  4594. or if type fits in register then we can proceed
  4595. otherwise we escape to ordinary procedure call.
  4596. *)
  4597. (* cases where the expression can be mapped identically *)
  4598. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4599. currentMapper.Add(formalParameter, actualParameter, NIL);
  4600. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4601. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4602. (*
  4603. Assign(variableDesignator, actualParameter);
  4604. *)
  4605. Evaluate(actualParameter, src);
  4606. Designate(variableDesignator, dest);
  4607. Emit(Mov(x.position, dest.op, src.op));
  4608. ReleaseOperand(dest);
  4609. ReleaseOperand(src);
  4610. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4611. ELSE tooComplex := TRUE
  4612. END;
  4613. (*
  4614. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4615. currentMapper.Add(formalParameter, actualParameter, NIL);
  4616. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4617. variableDesignator := GetTemp(system.addressType, FALSE);
  4618. Designate(actualParameter, src);
  4619. Designate(variableDesignator, dest);
  4620. IntermediateCode.MakeMemory(dest.op,addressType);
  4621. Emit(Mov(x.position, dest.op, src.op));
  4622. ReleaseOperand(dest);
  4623. IF src.tag.mode # IntermediateCode.Undefined THEN
  4624. tagDesignator := GetTemp(system.addressType, FALSE);
  4625. Designate(tagDesignator, dest);
  4626. IntermediateCode.MakeMemory(dest.op,addressType);
  4627. Emit(Mov(x.position, dest.op, src.op));
  4628. END;
  4629. ReleaseOperand(dest); ReleaseOperand(src);
  4630. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4631. END;
  4632. *)
  4633. formalParameter := formalParameter.nextParameter;
  4634. INC(i);
  4635. END;
  4636. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4637. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4638. currentMapper.Add(NIL, returnDesignator, NIL);
  4639. END;
  4640. localVariable := procedure.procedureScope.firstVariable;
  4641. WHILE ~tooComplex & (localVariable # NIL) DO
  4642. variableDesignator := GetTemp(localVariable.type, FALSE);
  4643. currentMapper.Add(localVariable, variableDesignator, NIL);
  4644. localVariable := localVariable.nextVariable;
  4645. END;
  4646. IF ~tooComplex THEN
  4647. VisitStatementBlock(procedure.procedureScope.body);
  4648. SetLabel(currentInlineExit);
  4649. IF procedureType.returnType # NIL THEN
  4650. Designate(returnDesignator, result);
  4651. IF conditional THEN
  4652. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4653. ValueToCondition(result)
  4654. END;
  4655. END;
  4656. END;
  4657. currentMapper := prevMapper;
  4658. currentInlineExit := prevInlineExit;
  4659. currentIsInline := wasInline;
  4660. RETURN ~tooComplex
  4661. END InlineProcedureCall;
  4662. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4663. VAR
  4664. parameters: SyntaxTree.ExpressionList;
  4665. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4666. designator: SyntaxTree.Designator;
  4667. procedureType: SyntaxTree.ProcedureType;
  4668. formalParameter: SyntaxTree.Parameter;
  4669. operand, returnValue: Operand;
  4670. reg, size, mask, dest: IntermediateCode.Operand;
  4671. saved: RegisterEntry;
  4672. symbol: SyntaxTree.Symbol;
  4673. variable: SyntaxTree.Variable;
  4674. i, parametersSize, returnTypeSize : LONGINT;
  4675. structuredReturnType: BOOLEAN;
  4676. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4677. tempVariableDesignator: SyntaxTree.Designator;
  4678. gap, alignment: LONGINT; (*fld*)
  4679. (* TODO: remove unnecessary backup variables *)
  4680. oldResult: Operand;
  4681. oldCurrentScope: SyntaxTree.Scope;
  4682. oldArrayDestinationTag: IntermediateCode.Operand;
  4683. oldArrayDestinationDimension: LONGINT;
  4684. oldConstantDeclaration: SyntaxTree.Symbol;
  4685. oldDestination: IntermediateCode.Operand;
  4686. oldCurrentLoop: Label;
  4687. oldConditional: BOOLEAN;
  4688. oldTrueLabel, oldFalseLabel: Label;
  4689. oldLocked: BOOLEAN;
  4690. usedRegisters,oldUsedRegisters: RegisterEntry;
  4691. return: IntermediateCode.Operand;
  4692. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4693. arg: IntermediateCode.Operand;
  4694. dummy: IntermediateCode.Operand;
  4695. recordType: SyntaxTree.RecordType;
  4696. operatorSelectionProcedureOperand: Operand;
  4697. operatorSelectionProcedure: SyntaxTree.Procedure;
  4698. fingerPrint: SyntaxTree.FingerPrint;
  4699. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4700. identifierNumber: LONGINT;
  4701. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4702. procedure: SyntaxTree.Procedure;
  4703. PROCEDURE BackupGlobalState;
  4704. BEGIN
  4705. oldResult := result;
  4706. oldCurrentScope := currentScope;
  4707. oldArrayDestinationTag := arrayDestinationTag;
  4708. oldArrayDestinationDimension := arrayDestinationDimension;
  4709. oldConstantDeclaration := constantDeclaration;
  4710. oldDestination := destination;
  4711. oldCurrentLoop := currentLoop;
  4712. oldConditional := conditional;
  4713. oldTrueLabel := trueLabel;
  4714. oldFalseLabel := falseLabel;
  4715. oldLocked := locked;
  4716. oldUsedRegisters := usedRegisters
  4717. END BackupGlobalState;
  4718. PROCEDURE RestoreGlobalState;
  4719. BEGIN
  4720. result := oldResult;
  4721. currentScope := oldCurrentScope;
  4722. arrayDestinationTag := oldArrayDestinationTag;
  4723. arrayDestinationDimension := oldArrayDestinationDimension;
  4724. constantDeclaration := oldConstantDeclaration;
  4725. destination := oldDestination;
  4726. currentLoop := oldCurrentLoop;
  4727. conditional := oldConditional;
  4728. trueLabel := oldTrueLabel;
  4729. falseLabel := oldFalseLabel;
  4730. locked := oldLocked;
  4731. usedRegisters := oldUsedRegisters
  4732. END RestoreGlobalState;
  4733. (** do preparations before parameter push for array-structured object types (ASOTs):
  4734. if ASOT is passed as VAR parameter:
  4735. - allocate temporary variable of math array type
  4736. - copy contents of ASOT to be passed to temporary variable
  4737. - use temporary variable as the actual parameter instead
  4738. - 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)
  4739. **)
  4740. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4741. VAR
  4742. expression: SyntaxTree.Expression;
  4743. BEGIN
  4744. IF actualParameter IS SyntaxTree.Designator THEN
  4745. designator := actualParameter(SyntaxTree.Designator);
  4746. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4747. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4748. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4749. ASSERT(checker # NIL);
  4750. checker.SetCurrentScope(currentScope);
  4751. (* allocate temporary variable *)
  4752. ASSERT(actualParameter.type # NIL);
  4753. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4754. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4755. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4756. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4757. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4758. ASSERT(tempVariableDesignator.type # NIL);
  4759. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4760. (* copy math array stored in actual parameter to temporary variable *)
  4761. BackupGlobalState;
  4762. AssignMathArray(tempVariableDesignator, actualParameter);
  4763. RestoreGlobalState;
  4764. (* use temporary variable as actual parameter instead of the original one *)
  4765. actualParameter := tempVariableDesignator;
  4766. (* create write-back call and store it in linked list *)
  4767. (* create new list entry *)
  4768. IF firstWriteBackCall = NIL THEN
  4769. NEW(firstWriteBackCall);
  4770. currentWriteBackCall := firstWriteBackCall
  4771. ELSE
  4772. ASSERT(currentWriteBackCall # NIL);
  4773. NEW(currentWriteBackCall.next);
  4774. currentWriteBackCall := currentWriteBackCall.next
  4775. END;
  4776. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4777. ASSERT(expression.type = NIL);
  4778. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4779. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4780. (* prepare writeback for any other "normal" indexer *)
  4781. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4782. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4783. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4784. Assign(tempVariableDesignator, actualParameter);
  4785. actualParameter := tempVariableDesignator;
  4786. IF firstWriteBackCall = NIL THEN
  4787. NEW(firstWriteBackCall);
  4788. currentWriteBackCall := firstWriteBackCall
  4789. ELSE
  4790. ASSERT(currentWriteBackCall # NIL);
  4791. NEW(currentWriteBackCall.next);
  4792. currentWriteBackCall := currentWriteBackCall.next
  4793. END;
  4794. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4795. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4796. END
  4797. END
  4798. END PrepareParameter;
  4799. BEGIN
  4800. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4801. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4802. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4803. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4804. IF InlineProcedureCall(x) THEN
  4805. RETURN
  4806. ELSE
  4807. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4808. END
  4809. END;
  4810. END;
  4811. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4812. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4813. dest := destination; destination := emptyOperand;
  4814. SaveRegisters();ReleaseUsedRegisters(saved);
  4815. parameters := x.parameters;
  4816. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4817. (* an operator is called *)
  4818. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4819. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4820. (* check if a dynamic operator call should be performed *)
  4821. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4822. ELSE
  4823. isCallOfDynamicOperator := FALSE
  4824. END;
  4825. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4826. Emit(Push(position, ap));
  4827. END;
  4828. alignment := procedureType.stackAlignment;
  4829. IF alignment > 1 THEN
  4830. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4831. Emit(Mov(position,reg, sp));
  4832. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4833. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4834. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4835. Emit(And(position,sp, sp, mask));
  4836. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4837. Emit(Push(position,reg));
  4838. (*
  4839. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4840. Emit(Mov(position,mem,reg));
  4841. *)
  4842. ReleaseIntermediateOperand(reg);
  4843. END;
  4844. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4845. IntermediateCode.InitImmediate(mask,addressType,-16);
  4846. Emit(And(position,sp, sp, mask));
  4847. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4848. IF gap # 0 THEN
  4849. IntermediateCode.InitImmediate(size,addressType,gap);
  4850. Emit(Sub(position,sp,sp,size))
  4851. END;
  4852. END;
  4853. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4854. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4855. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4856. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4857. ELSE
  4858. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4859. END;
  4860. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4861. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  4862. (* push ID *)
  4863. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4864. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  4865. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  4866. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  4867. formalParameter := procedureType.firstParameter;
  4868. FOR i := 0 TO parameters.Length() - 1 DO
  4869. IF formalParameter.access # SyntaxTree.Hidden THEN
  4870. ASSERT(i < 2);
  4871. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  4872. (* push pointer *)
  4873. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4874. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  4875. (* add dereference *)
  4876. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4877. ReleaseIntermediateOperand(parameterBackups[i]);
  4878. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  4879. END;
  4880. Emit(Push(position,parameterBackups[i]));
  4881. ReleaseIntermediateOperand(parameterBackups[i]);
  4882. (* push typetag *)
  4883. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4884. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  4885. arg := TypeDescriptorAdr(recordType);
  4886. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  4887. Emit(Push(position,arg));
  4888. ELSE
  4889. (* push 'NonPointer' *)
  4890. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4891. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4892. (* push fingerprint *)
  4893. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4894. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  4895. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  4896. END
  4897. END;
  4898. formalParameter := formalParameter.nextParameter
  4899. END;
  4900. (* for unary operators: complete the information for the second parameter *)
  4901. IF procedureType.numberParameters < 2 THEN
  4902. (* push 'NonPointer' *)
  4903. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4904. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4905. (* push 'NoType' *)
  4906. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4907. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  4908. END;
  4909. (* call operator selection procedure *)
  4910. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  4911. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  4912. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  4913. ReleaseOperand(operatorSelectionProcedureOperand);
  4914. (* use the address that the operator selection procedure returned as the target address of the call *)
  4915. InitOperand(operand, ModeValue);
  4916. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4917. Emit(Result(position,operand.op))
  4918. END
  4919. ELSE
  4920. Evaluate(x.left, operand)
  4921. END;
  4922. IF symbol IS SyntaxTree.Procedure THEN
  4923. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4924. Emit(Push(position,operand.tag));
  4925. ELSIF (procedureType.isDelegate) THEN
  4926. Emit(Push(position,operand.tag));
  4927. END;
  4928. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4929. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  4930. Emit(Push(position,operand.tag));
  4931. END;
  4932. ELSE HALT(200);
  4933. END;
  4934. ReleaseIntermediateOperand(operand.tag);
  4935. operand.tag := emptyOperand;
  4936. (* determine if a structured return type is needed *)
  4937. structuredReturnType := StructuredReturnType(procedureType);
  4938. IF structuredReturnType THEN
  4939. IF resultDesignator # NIL THEN
  4940. d := resultDesignator;
  4941. ELSE
  4942. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  4943. variable.SetUntraced(procedureType.hasUntracedReturn);
  4944. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  4945. d.SetType(variable.type);
  4946. END;
  4947. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  4948. Designate(d,returnValue);
  4949. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  4950. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  4951. Emit(Push(position,size));
  4952. Emit(Push(position,returnValue.op));
  4953. ReleaseOperand(returnValue);
  4954. ELSE
  4955. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  4956. END;
  4957. END;
  4958. firstWriteBackCall := NIL; (* reset write-back call list *)
  4959. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  4960. passByRegister := system.registerParameters > 0;
  4961. registerNumber := 0;
  4962. formalParameter := procedureType.lastParameter;
  4963. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  4964. actualParameter := parameters.GetExpression(i);
  4965. PrepareParameter(actualParameter, formalParameter);
  4966. IF passByRegister & (i < system.registerParameters) THEN
  4967. IF ~PassInRegister(formalParameter) THEN
  4968. Error(actualParameter.position,"cannot be passed by register")
  4969. ELSE
  4970. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  4971. END;
  4972. INC(registerNumber);
  4973. ELSE
  4974. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4975. END;
  4976. formalParameter := formalParameter.prevParameter;
  4977. END;
  4978. IF passByRegister & (registerNumber > 0) THEN
  4979. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  4980. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4981. END;
  4982. ELSE
  4983. hasDynamicOperands := FALSE;
  4984. formalParameter := procedureType.firstParameter;
  4985. FOR i := 0 TO parameters.Length() - 1 DO
  4986. actualParameter := parameters.GetExpression(i);
  4987. IF formalParameter # NIL THEN (* TENTATIVE *)
  4988. PrepareParameter(actualParameter, formalParameter);
  4989. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  4990. ASSERT(i < 2);
  4991. hasDynamicOperands := TRUE;
  4992. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  4993. ELSE
  4994. IF passByRegister & (registerNumber > 0) THEN
  4995. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  4996. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4997. END;
  4998. passByRegister := FALSE;
  4999. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5000. END;
  5001. formalParameter := formalParameter.nextParameter;
  5002. END;
  5003. END;
  5004. END;
  5005. IF symbol IS SyntaxTree.Procedure THEN
  5006. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5007. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5008. Emit(Push(position,reg));
  5009. ReleaseIntermediateOperand(reg);
  5010. END;
  5011. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5012. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5013. parametersSize := ParametersSize(system,procedureType,FALSE);
  5014. END;
  5015. ReleaseParameterRegisters();
  5016. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  5017. Emit(Call(position,operand.op,0));
  5018. ELSE
  5019. Emit(Call(position,operand.op,parametersSize));
  5020. END;
  5021. ReleaseOperand(operand);
  5022. IF procedureType.noReturn THEN
  5023. EmitTrap(position,NoReturnTrap);
  5024. END;
  5025. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5026. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5027. Emit(Result(position,return));
  5028. END;
  5029. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  5030. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  5031. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5032. END;
  5033. size := IntermediateCode.Immediate(addressType,parametersSize);
  5034. Emit(Add(position,sp,sp,size));
  5035. END;
  5036. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5037. IF structuredReturnType THEN
  5038. (* stack pointer rewinding done by callee
  5039. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5040. Emit(Add(position,sp,sp,size));
  5041. *)
  5042. RestoreRegisters(saved);
  5043. InitOperand(result,ModeReference);
  5044. Symbol(variable,result);
  5045. ELSE
  5046. RestoreRegisters(saved);
  5047. InitOperand(result,ModeValue);
  5048. result.op := return;
  5049. END;
  5050. END;
  5051. IF alignment > 1 THEN
  5052. Emit(Pop(position,sp));
  5053. END;
  5054. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5055. Emit(Pop(position, ap));
  5056. END;
  5057. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5058. ValueToCondition(result);
  5059. END;
  5060. destination := dest;
  5061. (* perform all write-back calls in the list *)
  5062. BackupGlobalState;
  5063. currentWriteBackCall := firstWriteBackCall;
  5064. WHILE currentWriteBackCall # NIL DO
  5065. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5066. currentWriteBackCall := currentWriteBackCall.next
  5067. END;
  5068. RestoreGlobalState;
  5069. (* TENATIVE *)
  5070. (*
  5071. IF isOperatorCall THEN
  5072. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5073. END;
  5074. *)
  5075. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5076. END VisitProcedureCallDesignator;
  5077. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5078. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5079. td: SyntaxTree.Symbol;
  5080. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5081. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5082. BEGIN
  5083. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5084. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5085. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5086. variable.SetType(system.anyType);
  5087. scope.AddVariable(variable);
  5088. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5089. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5090. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5091. typeDeclaration.SetScope(module.module.moduleScope);
  5092. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5093. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5094. END;
  5095. RETURN hiddenPointerType;
  5096. END GetHiddenPointerType;
  5097. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5098. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5099. BEGIN
  5100. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5101. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5102. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5103. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5104. scope.AddVariable(variable);
  5105. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5106. variable.SetType(system.anyType);
  5107. scope.AddVariable(variable);
  5108. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5109. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5110. typeDeclaration.SetDeclaredType(delegatePointerType);
  5111. typeDeclaration.SetScope(module.module.moduleScope);
  5112. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5113. delegatePointerType.SetState(SyntaxTree.Resolved);
  5114. END;
  5115. RETURN delegatePointerType
  5116. END GetDelegateType;
  5117. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5118. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5119. such as in VAR a: RECORD ... END;
  5120. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5121. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5122. *)
  5123. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5124. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5125. BEGIN (* no code emission *)
  5126. source := NIL;
  5127. x := x.resolved;
  5128. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5129. x := GetHiddenPointerType();
  5130. ELSIF IsDelegate(x) THEN
  5131. x := GetDelegateType();
  5132. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5133. ELSE HALT(200);
  5134. END;
  5135. td := x.typeDeclaration;
  5136. IF td = NIL THEN
  5137. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5138. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5139. ASSERT(td # NIL);
  5140. END;
  5141. IF newObjectFile THEN
  5142. GetCodeSectionNameForSymbol(td,name);
  5143. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5144. meta.CheckTypeDeclaration(x);
  5145. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5146. ELSE
  5147. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5148. END;
  5149. IF backend.cooperative OR meta.simple THEN
  5150. offset := 0;
  5151. ELSE
  5152. IF x IS SyntaxTree.CellType THEN
  5153. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5154. IF baseRecord = NIL THEN
  5155. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5156. ELSE
  5157. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5158. END;
  5159. ELSE
  5160. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5161. END;
  5162. END;
  5163. ELSE
  5164. offset := 0;
  5165. source := module.allSections.FindBySymbol(td); (*TODO*)
  5166. IF source = NIL THEN
  5167. null := 0;
  5168. GetCodeSectionNameForSymbol(td,name);
  5169. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5170. IntermediateCode.InitImmediate(op,addressType,0);
  5171. source(IntermediateCode.Section).Emit(Data(position,op));
  5172. source.SetReferenced(FALSE)
  5173. ELSE
  5174. name := source.name;
  5175. END;
  5176. END;
  5177. RETURN td
  5178. END GetBackendType;
  5179. BEGIN
  5180. (*td := t.typeDeclaration;*)
  5181. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5182. (*
  5183. IF t IS SyntaxTree.PointerType THEN
  5184. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5185. ELSE
  5186. source := GetBackendType(t);
  5187. END;
  5188. *)
  5189. IF newObjectFile THEN
  5190. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5191. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5192. IntermediateCode.SetOffset(res,offset);
  5193. ELSE
  5194. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5195. END;
  5196. (*
  5197. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5198. make memory should be used when tag is used, not earlier
  5199. *)
  5200. RETURN res
  5201. END TypeDescriptorAdr;
  5202. (*
  5203. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5204. VAR result: IntermediateCode.Operand;
  5205. BEGIN
  5206. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5207. operand.tag := TypeDescriptorAdr(operand.type);
  5208. IntermediateCode.MakeMemory(operand.tag,addressType);
  5209. UseIntermediateOperand(operand.tag);
  5210. END;
  5211. END MakeTypeTag;
  5212. *)
  5213. PROCEDURE ProfilerInit;
  5214. VAR reg: IntermediateCode.Operand;
  5215. BEGIN
  5216. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5217. Emit(Call(position,reg,0));
  5218. END ProfilerInit;
  5219. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5220. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5221. BEGIN
  5222. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5223. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5224. THEN
  5225. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5226. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5227. Emit(Push(position,reg));
  5228. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5229. Emit(Push(position,reg));
  5230. StaticCallOperand(result,procedure);
  5231. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5232. ReleaseOperand(result);
  5233. END;
  5234. END ProfilerEnterExit;
  5235. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5236. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5237. BEGIN
  5238. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5239. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5240. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5241. profileInit.Emit(Push(position,reg));
  5242. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5243. profileInit.Emit(Push(position,reg));
  5244. NEW(string, LEN(name)); COPY(name, string^);
  5245. sv := SyntaxTree.NewStringValue(-1,string);
  5246. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5247. sv.SetType(type);
  5248. Designate(sv,result);
  5249. profileInit.Emit(Push(position,result.tag));
  5250. profileInit.Emit(Push(position,result.op));
  5251. StaticCallOperand(result,procedure);
  5252. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5253. ReleaseOperand(result);
  5254. END;
  5255. END ProfilerAddProcedure;
  5256. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5257. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5258. BEGIN
  5259. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5260. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5261. profileInit.Emit(Push(position,reg));
  5262. profileInitPatchPosition := profileInit.pc;
  5263. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5264. NEW(string, LEN(name)); COPY(name, string^);
  5265. sv := SyntaxTree.NewStringValue(-1,string);
  5266. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5267. sv.SetType(type);
  5268. Designate(sv,result);
  5269. profileInit.Emit(Push(position,result.tag));
  5270. profileInit.Emit(Push(position,result.op));
  5271. StaticCallOperand(result,procedure);
  5272. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5273. ReleaseOperand(result);
  5274. END;
  5275. END ProfilerAddModule;
  5276. PROCEDURE ProfilerPatchInit;
  5277. VAR reg: IntermediateCode.Operand;
  5278. BEGIN
  5279. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5280. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5281. EmitLeave(profileInit,position,0);
  5282. profileInit.Emit(Exit(position,0,0));
  5283. END ProfilerPatchInit;
  5284. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5285. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5286. VAR
  5287. id: LONGINT;
  5288. leftType, rightType: SyntaxTree.Type;
  5289. procedureType: SyntaxTree.ProcedureType;
  5290. runtimeProcedure: SyntaxTree.Procedure;
  5291. runtimeProcedureOperand, operatorOperand: Operand;
  5292. kind: SET;
  5293. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5294. VAR
  5295. arg: IntermediateCode.Operand;
  5296. recordType: SyntaxTree.RecordType;
  5297. fingerPrint: SyntaxTree.FingerPrint;
  5298. BEGIN
  5299. IF type = NIL THEN
  5300. (* no type: push 'NoType' *)
  5301. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5302. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5303. ELSIF IsStrictlyPointerToRecord(type) THEN
  5304. (* pointer to record type: push typetag *)
  5305. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5306. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5307. arg := TypeDescriptorAdr(recordType);
  5308. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5309. ELSE
  5310. (* non-pointer to record type: push fingerprint *)
  5311. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5312. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5313. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5314. END;
  5315. operatorInitializationCodeSection.Emit(Push(position,arg))
  5316. END PushTypeInfo;
  5317. BEGIN
  5318. ASSERT(operatorInitializationCodeSection # NIL);
  5319. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5320. procedureType := operator.type(SyntaxTree.ProcedureType);
  5321. (* determine types *)
  5322. leftType := procedureType.firstParameter.type;
  5323. IF procedureType.numberParameters = 2 THEN
  5324. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5325. rightType := procedureType.firstParameter.nextParameter.type;
  5326. ELSE
  5327. rightType := NIL
  5328. END;
  5329. (* determine operator kind *)
  5330. IF IsStrictlyPointerToRecord(leftType) THEN
  5331. kind := {LhsIsPointer}
  5332. ELSE
  5333. kind := {}
  5334. END;
  5335. IF IsStrictlyPointerToRecord(rightType) THEN
  5336. kind := kind + {RhsIsPointer}
  5337. END;
  5338. IF kind # {} THEN (* TODO: to be removed later on *)
  5339. (* at least one of the types is a pointer to record *)
  5340. (* emit a code that registers this specific operator in the runtime *)
  5341. dump := operatorInitializationCodeSection.comments;
  5342. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5343. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5344. (* push ID *)
  5345. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5346. id := Global.GetSymbol(module.module.case, operator.name);
  5347. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5348. (* push kind *)
  5349. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5350. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5351. (* push type infos *)
  5352. PushTypeInfo(leftType);
  5353. PushTypeInfo(rightType);
  5354. (* push operator address *)
  5355. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5356. StaticCallOperand(operatorOperand, operator);
  5357. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5358. ReleaseOperand(operatorOperand);
  5359. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5360. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5361. ReleaseOperand(runtimeProcedureOperand)
  5362. END
  5363. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5364. END
  5365. END RegisterDynamicOperator;
  5366. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5367. VAR
  5368. traceModule: SyntaxTree.Module;
  5369. procedure: SyntaxTree.Procedure;
  5370. procedureVariable: SyntaxTree.Variable;
  5371. s,msg: Basic.MessageString;
  5372. res: Operand;
  5373. i: LONGINT;
  5374. sv: SyntaxTree.StringValue;
  5375. type: SyntaxTree.Type;
  5376. recordType: SyntaxTree.RecordType;
  5377. printout: Printout.Printer;
  5378. stringWriter: Streams.StringWriter;
  5379. expression: SyntaxTree.Expression;
  5380. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5381. BEGIN
  5382. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5383. IF procedure = NIL THEN
  5384. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5385. END;
  5386. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5387. s := "procedure ";
  5388. Strings.Append(s,backend.traceModuleName);
  5389. Strings.Append(s,".");
  5390. Strings.Append(s,procedureName);
  5391. Strings.Append(s," not present");
  5392. Error(position,s);
  5393. RETURN FALSE
  5394. ELSE
  5395. RETURN TRUE
  5396. END;
  5397. END GetProcedure;
  5398. PROCEDURE CallProcedure;
  5399. VAR size: LONGINT;
  5400. BEGIN
  5401. IF procedure # NIL THEN
  5402. StaticCallOperand(result,procedure);
  5403. size := ProcedureParametersSize(system,procedure);
  5404. ELSE
  5405. Symbol(procedureVariable, result);
  5406. LoadValue(result, procedureVariable.type.resolved);
  5407. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5408. END;
  5409. Emit(Call(position,result.op,size));
  5410. END CallProcedure;
  5411. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5412. VAR res: Operand; string: SyntaxTree.String;
  5413. BEGIN
  5414. IF GetProcedure("String") THEN
  5415. NEW(string, LEN(s)); COPY(s, string^);
  5416. sv := SyntaxTree.NewStringValue(-1,string);
  5417. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5418. sv.SetType(type);
  5419. Designate(sv,res);
  5420. Emit(Push(position,res.tag));
  5421. Emit(Push(position,res.op));
  5422. ReleaseOperand(res);
  5423. CallProcedure;
  5424. END;
  5425. END String;
  5426. PROCEDURE Integer(op: IntermediateCode.Operand);
  5427. BEGIN
  5428. IF GetProcedure("Int") THEN
  5429. Emit(Push(position,op));
  5430. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5431. CallProcedure;
  5432. END;
  5433. END Integer;
  5434. PROCEDURE Float(op: IntermediateCode.Operand);
  5435. BEGIN
  5436. IF GetProcedure("HIntHex") THEN
  5437. Emit(Push(position,op));
  5438. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5439. CallProcedure;
  5440. END;
  5441. END Float;
  5442. PROCEDURE Set(op: IntermediateCode.Operand);
  5443. BEGIN
  5444. IF GetProcedure("Set") THEN
  5445. Emit(Push(position,op));
  5446. (*
  5447. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5448. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5449. *)
  5450. CallProcedure;
  5451. END;
  5452. END Set;
  5453. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5454. BEGIN
  5455. IF GetProcedure("Boolean") THEN
  5456. Emit(Push(position,op));
  5457. CallProcedure;
  5458. END;
  5459. END Boolean;
  5460. PROCEDURE Char(op: IntermediateCode.Operand);
  5461. BEGIN
  5462. IF GetProcedure("Char") THEN
  5463. Emit(Push(position,op));
  5464. CallProcedure;
  5465. END;
  5466. END Char;
  5467. PROCEDURE Address(op: IntermediateCode.Operand);
  5468. BEGIN
  5469. IF GetProcedure("Address") THEN
  5470. Emit(Push(position,op));
  5471. CallProcedure;
  5472. END;
  5473. END Address;
  5474. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5475. BEGIN
  5476. IF GetProcedure("String") THEN
  5477. Emit(Push(position,tag));
  5478. Emit(Push(position,op));
  5479. CallProcedure;
  5480. END;
  5481. END StringOperand;
  5482. PROCEDURE Ln;
  5483. BEGIN
  5484. IF GetProcedure("Ln") THEN
  5485. CallProcedure;
  5486. END;
  5487. END Ln;
  5488. BEGIN
  5489. IF backend.traceModuleName = "" THEN RETURN END;
  5490. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5491. IF GetProcedure("Enter") THEN
  5492. CallProcedure
  5493. END;
  5494. NEW(stringWriter,LEN(s));
  5495. FOR i := 0 TO x.Length()-1 DO
  5496. msg := "";
  5497. expression := x.GetExpression(i);
  5498. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5499. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5500. ELSE
  5501. Global.GetModuleName(module.module, s);
  5502. END;
  5503. IF i = 0 THEN
  5504. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5505. stringWriter.String(":");
  5506. END;
  5507. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5508. IF ~(expression IS SyntaxTree.StringValue) THEN
  5509. printout.Expression(expression);
  5510. stringWriter.Get(s);
  5511. Strings.Append(msg,s);
  5512. Strings.Append(msg,"= ");
  5513. ELSE stringWriter.Get(s); (* remove from string writer *)
  5514. Strings.Append(msg, s);
  5515. END;
  5516. String(msg);
  5517. IF SemanticChecker.IsStringType(expression.type) THEN
  5518. Designate(expression,res);
  5519. StringOperand(res.op,res.tag);
  5520. ELSE
  5521. Evaluate(expression,res);
  5522. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5523. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5524. Convert(res.op,int64);
  5525. END;
  5526. Integer(res.op);
  5527. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5528. Boolean(res.op);
  5529. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5530. Set(res.op);
  5531. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5532. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5533. Convert(res.op,float64);
  5534. END;
  5535. Float(res.op);
  5536. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5537. Char(res.op);
  5538. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5539. Address(res.op);String("H");
  5540. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5541. Address(res.op);String("H");
  5542. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5543. Address(res.op);String("H");
  5544. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5545. Address(res.op);String("H");
  5546. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5547. String("NIL");
  5548. ELSE HALT(200);
  5549. END;
  5550. END;
  5551. ReleaseOperand(res);
  5552. String("; ");
  5553. END;
  5554. IF GetProcedure("Exit") THEN
  5555. CallProcedure
  5556. ELSE
  5557. Ln;
  5558. END;
  5559. END;
  5560. END SystemTrace;
  5561. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5562. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5563. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5564. BEGIN
  5565. type := type.resolved;
  5566. IF type IS SyntaxTree.RecordType THEN
  5567. WITH type: SyntaxTree.RecordType DO
  5568. baseType := type.baseType;
  5569. IF baseType # NIL THEN
  5570. baseType := baseType.resolved;
  5571. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5572. InitFields(baseType,adr,offset);
  5573. END;
  5574. variable := type.recordScope.firstVariable;
  5575. WHILE variable # NIL DO
  5576. IF variable.initializer # NIL THEN
  5577. Evaluate(variable.initializer,initializerOp);
  5578. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5579. Emit(Mov(position,mem,initializerOp.op));
  5580. ReleaseOperand(initializerOp);
  5581. ReleaseIntermediateOperand(mem);
  5582. END;
  5583. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5584. variable := variable.nextVariable
  5585. END;
  5586. END;
  5587. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5588. WITH type: SyntaxTree.ArrayType DO
  5589. IF type.form = SyntaxTree.Static THEN
  5590. baseType := type.arrayBase;
  5591. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5592. FOR i := 0 TO type.staticLength-1 DO
  5593. InitFields(baseType,adr,offset+i*size);
  5594. END;
  5595. END;
  5596. END;
  5597. ELSIF type IS SyntaxTree.MathArrayType THEN
  5598. WITH type: SyntaxTree.MathArrayType DO
  5599. IF type.form = SyntaxTree.Open THEN
  5600. dim := DynamicDim(type);
  5601. imm := IntermediateCode.Immediate(addressType,dim);
  5602. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5603. baseType := SemanticChecker.ArrayBase(type,dim);
  5604. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5605. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5606. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5607. ReleaseIntermediateOperand(imm);
  5608. (* flags remain empty (=0) for open array *)
  5609. ELSIF type.form = SyntaxTree.Static THEN
  5610. baseType := type.arrayBase;
  5611. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5612. ASSERT(type.staticLength < 1024*1024*1024);
  5613. FOR i := 0 TO type.staticLength-1 DO
  5614. InitFields(baseType,adr,offset+i*size);
  5615. END;
  5616. END;
  5617. END;
  5618. END;
  5619. END InitFields;
  5620. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5621. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5622. BEGIN
  5623. type := variable.type.resolved;
  5624. IF (type IS SyntaxTree.MathArrayType) THEN
  5625. WITH type: SyntaxTree.MathArrayType DO
  5626. IF type.form = SyntaxTree.Open THEN
  5627. Symbol(variable,operand);
  5628. InitFields(type, operand.tag,0);
  5629. ELSIF type.form = SyntaxTree.Tensor THEN
  5630. Symbol(variable, operand);
  5631. MakeMemory(tmp,operand.op,addressType,0);
  5632. ReleaseOperand(operand);
  5633. Emit(Mov(position,tmp, nil ) );
  5634. ReleaseIntermediateOperand(tmp);
  5635. END;
  5636. END;
  5637. ELSE
  5638. Symbol(variable,operand);
  5639. IF variable.initializer # NIL THEN
  5640. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5641. reference.SetType(variable.type.resolved);
  5642. reference.SetAssignable(TRUE);
  5643. Assign(reference,variable.initializer);
  5644. END;
  5645. InitFields(type, operand.op,0);
  5646. ReleaseOperand(operand);
  5647. END;
  5648. END InitVariable;
  5649. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5650. VAR end: Label;
  5651. BEGIN
  5652. IF type.form = SyntaxTree.Tensor THEN
  5653. InitOperand(result,ModeValue);
  5654. ReuseCopy(result.op,base);
  5655. end := NewLabel();
  5656. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5657. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5658. SetLabel(end);
  5659. Convert(result.op,int32);
  5660. ELSE
  5661. InitOperand(result,ModeValue);
  5662. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5663. END
  5664. END MathArrayDim;
  5665. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5666. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5667. BEGIN
  5668. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5669. MakeMemory(mem,base,addressType,offset);
  5670. Emit(Mov(position,mem,value));
  5671. ReleaseIntermediateOperand(mem);
  5672. END PutMathArrayField;
  5673. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5674. VAR mem: IntermediateCode.Operand;
  5675. BEGIN
  5676. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5677. MakeMemory(mem,base,addressType,offset);
  5678. Emit(Mov(position,mem,value));
  5679. ReleaseIntermediateOperand(mem);
  5680. END PutMathArrayFieldOffset;
  5681. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5682. BEGIN
  5683. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5684. MakeMemory(value,base,addressType,offset);
  5685. END GetMathArrayField;
  5686. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5687. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5688. BEGIN
  5689. IF incr THEN
  5690. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5691. ELSE
  5692. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5693. END;
  5694. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5695. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5696. ELSE
  5697. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5698. Emit(Mov(position,reg,dim));
  5699. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5700. Emit(Add(position,reg,reg,base));
  5701. MakeMemory(mem, reg, addressType, offset);
  5702. ReleaseIntermediateOperand(reg);
  5703. Emit(Mov(position,mem,value));
  5704. ReleaseIntermediateOperand(mem);
  5705. END;
  5706. END PutMathArrayLenOrIncr;
  5707. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5708. BEGIN
  5709. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5710. END PutMathArrayLength;
  5711. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5712. BEGIN
  5713. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5714. END PutMathArrayIncrement;
  5715. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5716. BEGIN
  5717. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5718. END GetMathArrayIncrement;
  5719. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5720. BEGIN
  5721. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5722. END GetMathArrayLength;
  5723. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5724. VAR dimOp: IntermediateCode.Operand;
  5725. BEGIN
  5726. dimOp := IntermediateCode.Immediate(int32, dim);
  5727. GetMathArrayLength(type, operand, dimOp, check, result);
  5728. END GetMathArrayLengthAt;
  5729. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5730. VAR dimOp: IntermediateCode.Operand;
  5731. BEGIN
  5732. dimOp := IntermediateCode.Immediate(int32, dim);
  5733. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5734. END GetMathArrayIncrementAt;
  5735. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5736. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5737. offset: LONGINT;
  5738. BEGIN
  5739. IF increment THEN
  5740. offset := MathIncrOffset;
  5741. ELSE
  5742. offset := MathLenOffset;
  5743. END;
  5744. INC(offset,operand.dimOffset*2);
  5745. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5746. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5747. END;
  5748. (* static dimension *)
  5749. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5750. IF check & (type.form = SyntaxTree.Tensor) THEN
  5751. DimensionCheck(operand.tag,dim,BrltL);
  5752. END;
  5753. val := SHORT(dim.intValue);
  5754. IF type.form # SyntaxTree.Tensor THEN
  5755. t := SemanticChecker.ArrayBase(type,val);
  5756. type := t.resolved(SyntaxTree.MathArrayType);
  5757. IF type.form = SyntaxTree.Static THEN
  5758. IF increment THEN
  5759. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5760. ELSE
  5761. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5762. END;
  5763. InitOperand(result,ModeValue);
  5764. result.op := res;
  5765. RETURN;
  5766. END;
  5767. END;
  5768. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5769. MakeMemory(res,operand.tag,addressType,offset);
  5770. (*
  5771. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5772. *)
  5773. InitOperand(result,ModeValue);
  5774. result.op := res;
  5775. ELSE
  5776. Convert(dim,addressType);
  5777. IF check THEN
  5778. IF type.form = SyntaxTree.Tensor THEN
  5779. DimensionCheck(operand.tag,dim,BrltL);
  5780. ELSIF isUnchecked THEN (* do nothing *)
  5781. ELSE
  5782. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5783. END;
  5784. END;
  5785. end := NewLabel(); next := NIL;
  5786. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5787. Emit(Mov(position,res,dim));
  5788. Convert(res,int32);
  5789. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5790. WHILE t IS SyntaxTree.MathArrayType DO
  5791. type := t(SyntaxTree.MathArrayType);
  5792. IF type.form = SyntaxTree.Static THEN
  5793. imm := IntermediateCode.Immediate(int32,val);
  5794. next := NewLabel();
  5795. BrneL(next,imm,res);
  5796. IF increment THEN
  5797. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5798. ELSE
  5799. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5800. END;
  5801. Emit(MovReplace(position,res,imm));
  5802. BrL(end);
  5803. ELSE hasDynamicPart := TRUE;
  5804. END;
  5805. t := type.arrayBase.resolved;
  5806. val := val + 1;
  5807. IF next # NIL THEN SetLabel(next) END;
  5808. END;
  5809. IF hasDynamicPart THEN
  5810. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5811. Emit(Mov(position,res2,dim));
  5812. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5813. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5814. Emit(Add(position,res2,res2,imm));
  5815. Emit(Add(position,res2,res2,operand.tag));
  5816. IntermediateCode.MakeMemory(res2,int32);
  5817. Emit(MovReplace(position,res,res2));
  5818. ReleaseIntermediateOperand(res2);
  5819. END;
  5820. SetLabel(end);
  5821. Convert(res,int32);
  5822. InitOperand(result,ModeValue);
  5823. result.op := res;
  5824. END;
  5825. END MathArrayLenOrIncr;
  5826. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5827. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5828. offset: LONGINT;
  5829. BEGIN
  5830. offset := operand.dimOffset+DynamicDim(type)-1;
  5831. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5832. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5833. val := SHORT(dim.intValue);
  5834. t := SemanticChecker.ArrayBase(type,val);
  5835. type := t.resolved(SyntaxTree.ArrayType);
  5836. IF type.form = SyntaxTree.Static THEN
  5837. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5838. ELSE
  5839. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5840. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5841. END;
  5842. UseIntermediateOperand(res);
  5843. InitOperand(result,ModeValue);
  5844. result.op := res;
  5845. ELSE
  5846. Convert(dim,addressType);
  5847. IF ~isUnchecked THEN
  5848. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5849. END;
  5850. end := NewLabel(); next := NIL;
  5851. (* ReuseCopy(dim,res); *)
  5852. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5853. Emit(Mov(position,res,dim));
  5854. Convert(res,int32);
  5855. Convert(res,int32);
  5856. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5857. WHILE t IS SyntaxTree.ArrayType DO
  5858. type := t(SyntaxTree.ArrayType);
  5859. IF type.form = SyntaxTree.Static THEN
  5860. imm := IntermediateCode.Immediate(int32,val);
  5861. next := NewLabel();
  5862. BrneL(next,imm,res);
  5863. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5864. Emit(MovReplace(position,res,imm));
  5865. BrL(end);
  5866. ELSE hasDynamicPart := TRUE;
  5867. END;
  5868. t := type.arrayBase.resolved;
  5869. val := val + 1;
  5870. IF next # NIL THEN SetLabel(next) END;
  5871. END;
  5872. IF hasDynamicPart THEN
  5873. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  5874. Convert(res2,addressType);
  5875. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  5876. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5877. Emit(Sub(position,res2,imm,res2));
  5878. Emit(Add(position,res2,res2,operand.tag));
  5879. IntermediateCode.MakeMemory(res2,int32);
  5880. Emit(MovReplace(position,res,res2));
  5881. ReleaseIntermediateOperand(res2);
  5882. END;
  5883. SetLabel(end);
  5884. Convert(res,int32);
  5885. InitOperand(result,ModeValue);
  5886. result.op := res;
  5887. END;
  5888. END ArrayLen;
  5889. (**
  5890. create a temporary variable in current scope
  5891. **)
  5892. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  5893. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  5894. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  5895. BEGIN
  5896. IF ~register THEN
  5897. variable := temporaries.GetFreeVariable(type, index);
  5898. ELSE
  5899. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  5900. END;
  5901. scope := currentScope;
  5902. IF variable = NIL THEN
  5903. COPY("@hiddenIRVar",string);
  5904. Basic.AppendNumber(string,index);
  5905. name := SyntaxTree.NewIdentifier(string);
  5906. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  5907. variable.SetType(type);
  5908. variable.SetAccess(SyntaxTree.Hidden);
  5909. IF ~register THEN
  5910. temporaries.AddVariable(variable);
  5911. IF scope.lastVariable # NIL THEN
  5912. offset := scope.lastVariable.offsetInBits;
  5913. ELSE
  5914. offset := 0;
  5915. END;
  5916. DEC(offset,system.SizeOf(variable.type));
  5917. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  5918. variable(SyntaxTree.Variable).SetOffset(offset);
  5919. scope.AddVariable(variable(SyntaxTree.Variable));
  5920. scope.EnterSymbol(variable, duplicate);
  5921. ASSERT(~duplicate);
  5922. InitVariable(variable(SyntaxTree.Variable));
  5923. ELSE
  5924. variable.SetUseRegister(TRUE);
  5925. variable(SyntaxTree.Variable).SetOffset(0);
  5926. END;
  5927. ELSE
  5928. InitVariable(variable(SyntaxTree.Variable));
  5929. (*
  5930. ASSERT(variable.type.resolved = type.resolved)
  5931. *)
  5932. END;
  5933. RETURN variable(SyntaxTree.Variable)
  5934. END GetTemporaryVariable;
  5935. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  5936. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  5937. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  5938. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  5939. i: LONGINT; duplicate: BOOLEAN;
  5940. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  5941. VAR variable: SyntaxTree.Variable;
  5942. BEGIN
  5943. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  5944. variable.SetType(type);
  5945. recordScope.AddVariable(variable);
  5946. END AddVariable;
  5947. BEGIN
  5948. name := "@ArrayDescriptor";
  5949. Basic.AppendNumber(name,dimensions);
  5950. identifier := SyntaxTree.NewIdentifier(name);
  5951. parentScope := module.module.moduleScope;
  5952. symbol := parentScope.FindSymbol(identifier);
  5953. IF symbol # NIL THEN
  5954. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  5955. type := typeDeclaration.declaredType;
  5956. ELSE
  5957. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  5958. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  5959. recordScope := SyntaxTree.NewRecordScope(parentScope);
  5960. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  5961. recordType.SetTypeDeclaration(typeDeclaration);
  5962. recordType.SetState(SyntaxTree.Resolved);
  5963. typeDeclaration.SetDeclaredType(recordType);
  5964. AddVariable("@ptr",system.anyType);
  5965. AddVariable("@adr",system.addressType);
  5966. AddVariable("@flags",system.addressType);
  5967. AddVariable("@dim",system.addressType);
  5968. AddVariable("@elementSize",system.addressType);
  5969. FOR i := 0 TO dimensions-1 DO
  5970. name := "@len";
  5971. Basic.AppendNumber(name,i);
  5972. AddVariable(name,system.addressType);
  5973. name := "@incr";
  5974. Basic.AppendNumber(name,i);
  5975. AddVariable(name,system.addressType);
  5976. END;
  5977. parentScope.AddTypeDeclaration(typeDeclaration);
  5978. parentScope.EnterSymbol(typeDeclaration,duplicate);
  5979. ASSERT(~duplicate);
  5980. type := recordType;
  5981. END;
  5982. RETURN type
  5983. END GetMathArrayDescriptorType;
  5984. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  5985. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  5986. BEGIN
  5987. type := GetMathArrayDescriptorType(dimensions);
  5988. Emit(Push(position,op.op));
  5989. (* push type descriptor *)
  5990. reg := TypeDescriptorAdr(type);
  5991. IF ~newObjectFile THEN
  5992. IntermediateCode.MakeMemory(reg,addressType);
  5993. END;
  5994. Emit(Push(position,reg));
  5995. ReleaseIntermediateOperand(reg);
  5996. (* push realtime flag: false by default *)
  5997. Emit(Push(position,false));
  5998. CallThis(position,"Heaps","NewRec",3);
  5999. END NewMathArrayDescriptor;
  6000. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6001. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6002. BEGIN
  6003. NEW(string, LEN(s)); COPY(s, string^);
  6004. sv := SyntaxTree.NewStringValue(-1,string);
  6005. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6006. sv.SetType(type);
  6007. Designate(sv,res);
  6008. Emit(Push(position,res.tag));
  6009. Emit(Push(position,res.op));
  6010. ReleaseOperand(res);
  6011. END PushConstString;
  6012. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6013. BEGIN
  6014. IF b THEN
  6015. Emit(Push(-1, true));
  6016. ELSE
  6017. Emit(Push(-1, false));
  6018. END;
  6019. END PushConstBoolean;
  6020. PROCEDURE PushConstSet(v: SET);
  6021. VAR value: SyntaxTree.Value; op: Operand;
  6022. BEGIN
  6023. value := SyntaxTree.NewSetValue(-1, v);
  6024. value.SetType(system.setType);
  6025. Evaluate(value, op);
  6026. Emit(Push(-1, op.op));
  6027. ReleaseOperand(op);
  6028. END PushConstSet;
  6029. PROCEDURE PushConstInteger(v: LONGINT);
  6030. VAR value: SyntaxTree.Value; op: Operand;
  6031. BEGIN
  6032. value := SyntaxTree.NewIntegerValue(-1, v);
  6033. value.SetType(system.longintType);
  6034. Evaluate(value, op);
  6035. Emit(Push(-1, op.op));
  6036. ReleaseOperand(op);
  6037. END PushConstInteger;
  6038. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6039. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6040. section: IntermediateCode.Section;
  6041. BEGIN
  6042. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6043. Global.GetSymbolSegmentedName(symbol, name);
  6044. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6045. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6046. procedure.SetScope(moduleScope);
  6047. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6048. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6049. procedure.SetAccess(SyntaxTree.Hidden);
  6050. currentScope := procedureScope;
  6051. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6052. EmitEnter(section, -1,NIL,0,0,0);
  6053. RETURN section;
  6054. END OpenInitializer;
  6055. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6056. BEGIN
  6057. EmitLeave(section, 0, 0 );
  6058. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6059. section := prev;
  6060. END CloseInitializer;
  6061. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6062. VAR name: SyntaxTree.IdentifierString;
  6063. variable: SyntaxTree.Variable;
  6064. type: SyntaxTree.Type;
  6065. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6066. BEGIN
  6067. InitOperand(op,ModeReference);
  6068. op.op := fp;
  6069. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6070. Dereference(op, x, FALSE);
  6071. result := op;
  6072. Symbol(symbol, op);
  6073. END Field;
  6074. PROCEDURE Direction(direction: LONGINT): SET;
  6075. BEGIN
  6076. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6077. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6078. ELSE HALT(100);
  6079. END;
  6080. END Direction;
  6081. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6082. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6083. BEGIN
  6084. Field(port, op);
  6085. ToMemory(op.op,addressType,0);
  6086. Emit(Push(-1, op.op));
  6087. ReleaseOperand(op);
  6088. Basic.GetString(modifier.identifier, name);
  6089. PushConstString(name);
  6090. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6091. ASSERT(SemanticChecker.IsStringType(value.type));
  6092. Designate(value, op);
  6093. Emit(Push(modifier.position, op.tag));
  6094. Emit(Push(modifier.position, op.op));
  6095. ReleaseOperand(op);
  6096. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6097. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6098. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6099. Evaluate(value, op);
  6100. Emit(Push(modifier.position, op.op));
  6101. ReleaseOperand(op);
  6102. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6103. ELSE
  6104. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6105. END;
  6106. END AddPortProperty;
  6107. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6108. VAR modifier: SyntaxTree.Modifier;
  6109. BEGIN
  6110. modifier := variable.modifiers;
  6111. WHILE modifier # NIL DO
  6112. AddPortProperty(variable,modifier, modifier.expression);
  6113. modifier := modifier.nextModifier;
  6114. END;
  6115. END AddPortProperties;
  6116. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6117. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6118. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6119. PROCEDURE PushLens(type: SyntaxTree.Type);
  6120. BEGIN
  6121. IF IsSemiDynamicArray(type) THEN
  6122. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6123. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6124. Emit(Push(-1, op.op));
  6125. ReleaseOperand(op);
  6126. INC(dim);
  6127. ELSIF IsStaticArray(type) THEN
  6128. len := len * type(SyntaxTree.ArrayType).staticLength;
  6129. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6130. INC(dim);
  6131. ELSE
  6132. baseType := type;
  6133. END;
  6134. END PushLens;
  6135. BEGIN
  6136. (* cell *)
  6137. IF variable.type IS SyntaxTree.ArrayType THEN
  6138. type := variable.type;
  6139. dim := 0;
  6140. len := 1;
  6141. PushLens(type);
  6142. portType := baseType.resolved(SyntaxTree.PortType);
  6143. ELSE
  6144. portType := variable.type(SyntaxTree.PortType);
  6145. END;
  6146. PushSelfPointer();
  6147. (* port / array of ports *)
  6148. IF IsStaticArray(type) THEN
  6149. PushConstInteger(len);
  6150. END;
  6151. Field(variable, op);
  6152. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6153. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6154. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6155. Designate(d, op);*)
  6156. Emit(Push(-1, op.op));
  6157. ReleaseOperand(op);
  6158. (* name *)
  6159. PushConstString(name);
  6160. (* inout *)
  6161. PushConstSet(Direction(portType.direction));
  6162. (* width *)
  6163. PushConstInteger(portType.sizeInBits);
  6164. IF variable.type IS SyntaxTree.PortType THEN
  6165. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6166. AddPortProperties(variable);
  6167. ELSIF IsStaticArray(type)THEN
  6168. CallThis(variable.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6169. ELSIF IsSemiDynamicArray(type) THEN
  6170. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6171. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6172. Emit(Add(position,reg, sp, size));
  6173. (* dim *)
  6174. PushConstInteger(dim);
  6175. (* len array *)
  6176. Emit(Push(position, reg));
  6177. ReleaseIntermediateOperand(reg);
  6178. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6179. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6180. Emit(Add(position, sp,sp, size));
  6181. ELSE
  6182. HALT(100);
  6183. END;
  6184. END Variable;
  6185. BEGIN
  6186. IF backend.cellsAreObjects THEN
  6187. variable := x.cellScope.firstVariable;
  6188. WHILE (variable # NIL) DO
  6189. type := variable.type.resolved;
  6190. WHILE (type IS SyntaxTree.ArrayType) DO
  6191. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6192. END;
  6193. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6194. (*!!! check port arrays !! *)
  6195. Global.GetSymbolName(variable,name);
  6196. Variable(name,variable);
  6197. END;
  6198. variable := variable.nextVariable;
  6199. END;
  6200. ELSE HALT(200)
  6201. END;
  6202. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6203. (*
  6204. x.typeDeclaration.GetName(componentName);
  6205. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6206. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6207. instanceType.SetDataMemorySize(dataMemorySize);
  6208. END;
  6209. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6210. instanceType.SetInstructionMemorySize(codeMemorySize)
  6211. END;
  6212. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6213. instanceType.AddCapability(ActiveCells.VectorCapability)
  6214. END;
  6215. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6216. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6217. END;
  6218. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6219. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6220. END;
  6221. AddDevices(instanceType, x);
  6222. *)
  6223. (*
  6224. IF x.isCellNet THEN
  6225. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6226. END;
  6227. *)
  6228. (*currentActiveCellsScope := instanceType;*)
  6229. (*
  6230. parameter := x.firstParameter;
  6231. portIndex := 0;
  6232. WHILE parameter # NIL DO
  6233. parameter.GetName(parameterName);
  6234. parameterType := parameter.type.resolved;
  6235. Parameter(parameterName, parameterType);
  6236. (*
  6237. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6238. ParameterArray(parameterType);
  6239. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6240. FOR i := 0 TO len-1 DO
  6241. COPY(parameterName,name);
  6242. AppendIndex(name,i);
  6243. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6244. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6245. INC(portIndex);
  6246. END;
  6247. ELSE
  6248. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6249. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6250. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6251. INC(portIndex);
  6252. END;
  6253. *)
  6254. parameter := parameter.nextParameter;
  6255. END;
  6256. *)
  6257. (*
  6258. Scope(x.cellScope);
  6259. currentActiveCellsScope := prevActiveCellsScope;
  6260. AddModules(instanceType,x.cellScope);
  6261. *)
  6262. END AddPorts;
  6263. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6264. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6265. BEGIN
  6266. Symbol(cell,op);
  6267. ToMemory(op.op,addressType,0);
  6268. Emit(Push(position,op.op));
  6269. ReleaseOperand(op);
  6270. Basic.GetString(property.name, name);
  6271. PushConstString(name);
  6272. IF SemanticChecker.IsStringType(property.type) OR (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6273. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6274. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6275. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6276. Designate(d, op);
  6277. IF SemanticChecker.IsStringType(property.type) THEN
  6278. Emit(Push(-1, op.tag))
  6279. END;
  6280. Emit(Push(-1, op.op));
  6281. ReleaseOperand(op);
  6282. END;
  6283. IF SemanticChecker.IsStringType(property.type) THEN
  6284. ASSERT(SemanticChecker.IsStringType(value.type));
  6285. Designate(value, op);
  6286. Emit(Push(property.position, op.tag));
  6287. Emit(Push(property.position, op.op));
  6288. ReleaseOperand(op);
  6289. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6290. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6291. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6292. Evaluate(value, op);
  6293. Emit(Push(property.position, op.op));
  6294. ReleaseOperand(op);
  6295. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6296. ELSE
  6297. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6298. END;
  6299. END AddProperty;
  6300. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6301. VAR symbol: SyntaxTree.Symbol;
  6302. BEGIN
  6303. WHILE modifier # NIL DO
  6304. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6305. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6306. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6307. ELSE
  6308. (*! move this check to checker *)
  6309. Error(modifier.position, "undefined property");
  6310. END;
  6311. modifier := modifier.nextModifier;
  6312. END;
  6313. END AddModifiers;
  6314. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6315. VAR last: SyntaxTree.Modifier;
  6316. BEGIN
  6317. IF to = NIL THEN
  6318. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6319. ELSE
  6320. last := to;
  6321. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6322. last := last.nextModifier;
  6323. END;
  6324. IF last.identifier # this.identifier THEN
  6325. ASSERT(last.nextModifier = NIL);
  6326. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6327. END;
  6328. END;
  6329. END AppendModifier;
  6330. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6331. BEGIN
  6332. WHILE this # NIL DO
  6333. AppendModifier(to, this);
  6334. this := this.nextModifier;
  6335. END;
  6336. END AppendModifiers;
  6337. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6338. VAR op: Operand;
  6339. BEGIN
  6340. Evaluate(p, op);
  6341. Emit(Push(p.position, op.op));
  6342. ReleaseOperand(op);
  6343. (*
  6344. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6345. p := p(SyntaxTree.Designator).left;
  6346. END;
  6347. IF p # NIL THEN
  6348. Evaluate(p, op);
  6349. Emit(Push(p.position, op.op));
  6350. ReleaseOperand(op);
  6351. ELSE
  6352. Emit(Push(-1, nil));
  6353. END;
  6354. *)
  6355. END PushPort;
  6356. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6357. VAR
  6358. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6359. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6360. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6361. tmp:IntermediateCode.Operand;
  6362. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6363. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6364. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6365. dest: IntermediateCode.Operand;
  6366. staticLength: LONGINT; itype: IntermediateCode.Type;
  6367. convert,isTensor: BOOLEAN;
  6368. recordType: SyntaxTree.RecordType;
  6369. baseType: SyntaxTree.Type;
  6370. flags: SET;
  6371. left: SyntaxTree.Expression;
  6372. call: SyntaxTree.Designator;
  6373. procedure: SyntaxTree.Procedure;
  6374. temporaryVariable: SyntaxTree.Variable;
  6375. dummy: IntermediateCode.Operand;
  6376. customBuiltin: SyntaxTree.CustomBuiltin;
  6377. isVarPar: ARRAY 3 OF BOOLEAN;
  6378. callsection: Sections.Section;
  6379. segmentedName: Basic.SegmentedName;
  6380. needsTrace: BOOLEAN;
  6381. n: ARRAY 256 OF CHAR;
  6382. modifier: SyntaxTree.Modifier;
  6383. previous, init: IntermediateCode.Section;
  6384. prevScope: SyntaxTree.Scope;
  6385. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6386. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6387. priority: IntermediateCode.Operand;
  6388. op,callop: Operand;
  6389. BEGIN
  6390. IF type = NIL THEN RETURN END;
  6391. type := type.resolved;
  6392. IF type IS SyntaxTree.PointerType THEN
  6393. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6394. END;
  6395. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6396. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6397. recordScope := type(SyntaxTree.RecordType).recordScope;
  6398. IF recordScope.bodyProcedure # NIL THEN
  6399. procedure := recordScope.bodyProcedure;
  6400. body := procedure.procedureScope.body;
  6401. Emit(Push(position,self));
  6402. IF body.isActive THEN
  6403. StaticCallOperand(callop,procedure);
  6404. Emit(Push(position,callop.op));
  6405. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6406. Convert(priority,sizeType);
  6407. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6408. END;
  6409. Emit(Push(position,priority));
  6410. ReleaseIntermediateOperand(priority);
  6411. IF backend.cooperative THEN
  6412. Emit(Push(position,self));
  6413. CallThis(position,"Activities","Create",3)
  6414. ELSE
  6415. flags := 0;
  6416. IF body.isSafe THEN
  6417. flags := 1;
  6418. END;
  6419. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6420. Emit(Push(position,self));
  6421. CallThis(position,"Objects","CreateProcess",4)
  6422. END;
  6423. ELSE
  6424. Emit(Push(position,self));
  6425. StaticCallOperand(callop,procedure);
  6426. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6427. END;
  6428. Emit(Pop(position,self));
  6429. END;
  6430. END CallBodies;
  6431. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6432. BEGIN
  6433. actualType := actualType.resolved;
  6434. IF actualType IS SyntaxTree.StringType THEN
  6435. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6436. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6437. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6438. ELSE
  6439. tmp := op.tag;
  6440. IntermediateCode.MakeMemory(tmp,addressType);
  6441. Emit(Push(position,tmp));
  6442. END;
  6443. Emit(Push(position,op.op))
  6444. END PushString;
  6445. PROCEDURE PushTD(type: SyntaxTree.Type);
  6446. VAR op: IntermediateCode.Operand;
  6447. BEGIN
  6448. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6449. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6450. ELSE
  6451. IF type.resolved IS SyntaxTree.PointerType THEN
  6452. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6453. END;
  6454. op := TypeDescriptorAdr(type.resolved);
  6455. IF ~newObjectFile THEN
  6456. IntermediateCode.MakeMemory(op,addressType);
  6457. END;
  6458. Emit(Push(position,op));
  6459. END
  6460. END PushTD;
  6461. BEGIN
  6462. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6463. dest := destination; destination := emptyOperand;
  6464. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6465. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6466. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6467. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6468. CASE x.id OF
  6469. (* ---- COPY ----- *)
  6470. |Global.Copy:
  6471. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6472. (* ---- EXCL, INCL----- *)
  6473. |Global.Excl,Global.Incl:
  6474. Evaluate(p0,s0);
  6475. Evaluate(p1,s1);
  6476. Convert(s1.op,setType);
  6477. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6478. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6479. END;
  6480. ReuseCopy(res,s0.op);
  6481. ReleaseOperand(s0);
  6482. Reuse1(tmp,s1.op);
  6483. ReleaseOperand(s1);
  6484. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6485. IF x.id = Global.Excl THEN
  6486. Emit(Not(position,tmp,tmp));
  6487. Emit(And(position,res,res,tmp));
  6488. ELSE
  6489. Emit(Or(position,res,res,tmp));
  6490. END;
  6491. ReleaseIntermediateOperand(tmp);
  6492. Designate(p0,s0);
  6493. ToMemory(s0.op,setType,0);
  6494. Emit(Mov(position,s0.op,res));
  6495. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6496. (* ---- DISPOSE ----- *)
  6497. |Global.Dispose:
  6498. Designate(p0,s0);
  6499. Emit(Push(position,s0.op));
  6500. ReleaseOperand(s0);
  6501. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6502. (* ---- GETPROCEDURE ----- *)
  6503. |Global.GetProcedure:
  6504. Designate(p0,s0);
  6505. PushString(s0,p0.type);
  6506. Designate(p1,s1);
  6507. PushString(s1,p1.type);
  6508. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6509. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6510. ELSE PushTD(procedureType.firstParameter.type)
  6511. END;
  6512. PushTD(procedureType.returnType);
  6513. Designate(p2,s2);
  6514. Emit(Push(position,s2.op));
  6515. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6516. CallThis(position,"Modules","GetProcedure", 7);
  6517. (* ---- ASH, LSH, ROT ----- *)
  6518. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6519. Evaluate(p0,s0);
  6520. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6521. (* make unsigned arguments in order to produced a logical shift *)
  6522. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6523. convert:= TRUE;
  6524. itype := s0.op.type;
  6525. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6526. Convert(s0.op,itype);
  6527. ELSE
  6528. convert := FALSE;
  6529. END;
  6530. END;
  6531. Evaluate(p1,s1);
  6532. IF IsIntegerConstant(p1,hint) THEN
  6533. ReuseCopy(reg,s0.op);
  6534. IF hint > 0 THEN
  6535. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6536. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6537. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6538. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6539. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6540. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6541. END;
  6542. ELSIF hint < 0 THEN
  6543. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6544. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6545. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6546. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6547. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6548. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6549. END;
  6550. END;
  6551. ReleaseOperand(s0); ReleaseOperand(s1);
  6552. ELSE
  6553. exit := NewLabel();
  6554. end := NewLabel();
  6555. ReuseCopy(reg,s0.op);
  6556. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6557. Reuse1(tmp,s1.op);
  6558. Emit(Neg(position,tmp,s1.op));
  6559. Convert(tmp,s1.op.type);
  6560. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6561. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6562. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6563. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6564. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6565. END;
  6566. ReleaseIntermediateOperand(tmp);
  6567. BrL(end);
  6568. SetLabel(exit);
  6569. ReuseCopy(tmp,s1.op);
  6570. Convert(tmp,s1.op.type);
  6571. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6572. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6573. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6574. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6575. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6576. END;
  6577. ReleaseIntermediateOperand(tmp);
  6578. SetLabel(end);
  6579. ReleaseOperand(s0); ReleaseOperand(s1);
  6580. END;
  6581. InitOperand(result,ModeValue);
  6582. IF convert THEN
  6583. itype := reg.type;
  6584. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6585. Convert(reg,itype);
  6586. END;
  6587. result.op := reg;
  6588. (* ---- CAP ----- *)
  6589. |Global.Cap:
  6590. Evaluate(p0,result);
  6591. ReuseCopy(reg,result.op);
  6592. ReleaseIntermediateOperand(result.op);
  6593. ignore := NewLabel();
  6594. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6595. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6596. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6597. SetLabel(ignore);
  6598. result.op := reg;
  6599. (* ---- CHR ----- *)
  6600. |Global.Chr, Global.Chr32:
  6601. Evaluate(p0,result);
  6602. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6603. |Global.Entier, Global.EntierH:
  6604. Evaluate(p0,result);
  6605. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6606. (* ---- MIN and MAX ----- *)
  6607. |Global.Max,Global.Min:
  6608. Evaluate(p0,s0);
  6609. Evaluate(p1,s1);
  6610. Reuse2(res,s0.op,s1.op);
  6611. else := NewLabel();
  6612. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6613. ELSE BrltL(else,s1.op,s0.op) END;
  6614. Emit(Mov(position,res,s0.op));
  6615. ReleaseOperand(s0);
  6616. end := NewLabel();
  6617. BrL(end);
  6618. SetLabel(else);
  6619. Emit(MovReplace(position,res,s1.op));
  6620. SetLabel(end);
  6621. ReleaseOperand(s1);
  6622. InitOperand(result,ModeValue);
  6623. result.op := res;
  6624. (* ---- ODD ----- *)
  6625. |Global.Odd:
  6626. IF ~conditional THEN
  6627. ConditionToValue(x)
  6628. ELSE
  6629. Evaluate(p0,result);
  6630. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6631. Reuse1(res,result.op);
  6632. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6633. ReleaseIntermediateOperand(result.op);
  6634. result.op := res;
  6635. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6636. ReleaseOperand(result);
  6637. BrL(falseLabel);
  6638. END;
  6639. (* ---- ORD ----- *)
  6640. |Global.Ord, Global.Ord32:
  6641. Evaluate(p0,result);
  6642. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6643. (* ---- SHORT, LONG ----- *)
  6644. |Global.Short, Global.Long:
  6645. Evaluate(p0,result);
  6646. IF x.type IS SyntaxTree.ComplexType THEN
  6647. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6648. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6649. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6650. ELSE
  6651. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6652. END
  6653. (* ---- HALT, SYSTEM.HALT----- *)
  6654. |Global.Halt, Global.systemHalt:
  6655. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6656. EmitTrap (position, val);
  6657. (* ---- ASSERT ----- *)
  6658. |Global.Assert:
  6659. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6660. trueL := NewLabel();
  6661. falseL := NewLabel();
  6662. Condition(p0,trueL,falseL);
  6663. IF p1 = NIL THEN val := AssertTrap
  6664. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6665. END;
  6666. SetLabel(falseL);
  6667. EmitTrap(position,val);
  6668. SetLabel(trueL);
  6669. END;
  6670. (*
  6671. Emit(TrapC(result.op,val);
  6672. *)
  6673. (* ---- INC, DEC----- *)
  6674. |Global.Inc,Global.Dec:
  6675. Expression(p0); adr := result.op;
  6676. LoadValue(result,p0.type); l := result;
  6677. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6678. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6679. END;
  6680. IF x.id = Global.Inc THEN
  6681. Emit(Add(position,l.op,l.op,r.op));
  6682. ELSE
  6683. Emit(Sub(position,l.op,l.op,r.op));
  6684. END;
  6685. ReleaseOperand(l); ReleaseOperand(r);
  6686. (* ---- LEN ----- *)
  6687. |Global.Len: (* dynamic length, static length done by checker *)
  6688. Designate(p0,operand);
  6689. IF p1 = NIL THEN
  6690. InitOperand(l,ModeValue);
  6691. l.op := IntermediateCode.Immediate(int32,0);
  6692. ELSE
  6693. Evaluate(p1,l);
  6694. END;
  6695. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6696. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6697. Dereference(operand, p0.type.resolved, FALSE);
  6698. END;
  6699. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6700. ReleaseOperand(operand); ReleaseOperand(l);
  6701. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6702. ASSERT(p1 # NIL);
  6703. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6704. Dereference(operand,p0.type.resolved,FALSE);
  6705. END;
  6706. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6707. ReleaseOperand(operand); ReleaseOperand(l);
  6708. ELSE HALT(100);
  6709. END;
  6710. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6711. (* ---- FIRST ---- *)
  6712. |Global.First:
  6713. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6714. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6715. ELSE
  6716. Designate(p0, result)
  6717. END
  6718. (* ---- LAST ---- *)
  6719. |Global.Last:
  6720. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6721. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6722. ELSE
  6723. Designate(p0, result);
  6724. (* make sure result.op is a register *)
  6725. tmp := result.op;
  6726. ReuseCopy(result.op, result.op);
  6727. ReleaseIntermediateOperand(tmp);
  6728. (* add offset to result.op *)
  6729. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6730. END
  6731. (* ---- STEP ---- *)
  6732. |Global.Step:
  6733. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6734. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6735. ELSE
  6736. Designate(p0, result);
  6737. (* make sure result.op is a register *)
  6738. tmp := result.op;
  6739. ReuseCopy(result.op, result.op);
  6740. ReleaseIntermediateOperand(tmp);
  6741. (* add offset to result.op *)
  6742. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6743. END
  6744. (* ---- RE ---- *)
  6745. |Global.Re:
  6746. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6747. Designate(p0, result)
  6748. ELSE
  6749. Evaluate(p0, result)
  6750. END
  6751. (* ---- IM ---- *)
  6752. |Global.Im:
  6753. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6754. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6755. Designate(p0, result);
  6756. (* make sure result.op is a register *)
  6757. tmp := result.op;
  6758. ReuseCopy(result.op, result.op);
  6759. ReleaseIntermediateOperand(tmp);
  6760. (* add offset to result.op *)
  6761. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6762. (* ---- ABS ----- *)
  6763. |Global.Abs:
  6764. Evaluate(p0,operand);
  6765. type := p0.type.resolved;
  6766. InitOperand(result,ModeValue);
  6767. Reuse1a(result.op,operand.op,dest);
  6768. Emit(Abs(position,result.op,operand.op));
  6769. ReleaseOperand(operand);
  6770. (* ---- WAIT ----- *)
  6771. |Global.Wait:
  6772. Evaluate(p0,operand);
  6773. Emit(Push(position,operand.op));
  6774. ReleaseOperand(operand);
  6775. CallThis(position,"Activities","Wait", 1);
  6776. (* ---- NEW ----- *)
  6777. |Global.New:
  6778. (*! the following code is only correct for "standard" Oberon calling convention *)
  6779. type := p0.type.resolved;
  6780. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6781. THEN
  6782. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6783. IF backend.cooperative THEN
  6784. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6785. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6786. IF recordType.isObject THEN
  6787. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6788. IF recordType.IsActive() THEN
  6789. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6790. END;
  6791. IF recordType.IsProtected() THEN
  6792. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6793. END;
  6794. ELSE
  6795. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6796. END;
  6797. END;
  6798. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6799. CallThis(position,"Runtime","New", 1);
  6800. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6801. Emit(Result(position, pointer));
  6802. exit := NewLabel();
  6803. BreqL(exit,pointer,nil);
  6804. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6805. GetRecordTypeName (recordType,name);
  6806. IF ~recordType.isObject THEN
  6807. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6808. END;
  6809. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6810. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6811. IF recordType.isObject THEN
  6812. IF recordType.IsProtected() THEN
  6813. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6814. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6815. END;
  6816. IF recordType.IsActive() THEN
  6817. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6818. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6819. END;
  6820. END;
  6821. END;
  6822. (* initialize fields *)
  6823. IF type(SyntaxTree.PointerType).isPlain THEN
  6824. size := 0;
  6825. ELSIF recordType.isObject THEN
  6826. size := BaseObjectTypeSize;
  6827. ELSE
  6828. size := BaseRecordTypeSize;
  6829. END;
  6830. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  6831. (* call initializer *)
  6832. constructor := GetConstructor(recordType);
  6833. IF constructor # NIL THEN
  6834. (*! should be unified with ProcedureCallDesignator *)
  6835. Emit(Push(position,pointer));
  6836. ReleaseIntermediateOperand(pointer);
  6837. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6838. FOR i := 1 TO x.parameters.Length()-1 DO
  6839. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6840. formalParameter := formalParameter.nextParameter;
  6841. END;
  6842. (* static call of the constructor *)
  6843. GetCodeSectionNameForSymbol(constructor,name);
  6844. ASSERT(~constructor.isInline);
  6845. IF constructor.scope.ownerModule # module.module THEN
  6846. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6847. ELSE
  6848. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6849. END;
  6850. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  6851. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6852. Emit(Pop(position,pointer));
  6853. END;
  6854. (* call bodies *)
  6855. CallBodies(pointer,p0.type);
  6856. SetLabel(exit);
  6857. needsTrace := p0.NeedsTrace();
  6858. IF needsTrace THEN ModifyAssignments(true) END;
  6859. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  6860. Emit(Push(position, pointer));
  6861. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  6862. Emit(Pop(position, pointer));
  6863. END;
  6864. Designate(p0,l);
  6865. IF needsTrace THEN
  6866. CallAssignPointer(l.op, pointer);
  6867. ELSE
  6868. ToMemory(l.op,addressType,0);
  6869. Emit(Mov(position,l.op,pointer));
  6870. END;
  6871. ReleaseIntermediateOperand(pointer);
  6872. ReleaseOperand(l);
  6873. IF needsTrace THEN ModifyAssignments(false) END;
  6874. ELSE
  6875. temporaryVariable := GetTemporaryVariable(type, FALSE);
  6876. IF temporaryVariable # NIL THEN
  6877. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  6878. ELSE
  6879. Designate(p0,l);
  6880. END;
  6881. (* l.op contains address of pointer to record *)
  6882. Emit(Push(position,l.op)); (* address for use after syscall *)
  6883. Emit(Push(position,l.op));
  6884. ReleaseOperand(l);
  6885. (* push type descriptor *)
  6886. reg := TypeDescriptorAdr(recordType);
  6887. IF ~newObjectFile THEN
  6888. IntermediateCode.MakeMemory(reg,addressType);
  6889. END;
  6890. Emit(Push(position,reg));
  6891. ReleaseIntermediateOperand(reg);
  6892. (* push realtime flag *)
  6893. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6894. ELSE Emit(Push(position,false));
  6895. END;
  6896. CallThis(position,"Heaps","NewRec", 3);
  6897. (* check allocation success, if not successful then do not call initializers and bodies *)
  6898. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6899. Emit(Pop(position,pointer));
  6900. MakeMemory(reg,pointer,addressType,0);
  6901. ReleaseIntermediateOperand(pointer);
  6902. pointer := reg;
  6903. exit := NewLabel();
  6904. BreqL(exit,pointer,nil);
  6905. Emit(Push(position,pointer));
  6906. (* initialize fields *)
  6907. InitFields(recordType, pointer,0);
  6908. (* call initializer *)
  6909. constructor := GetConstructor(recordType);
  6910. IF constructor # NIL THEN
  6911. (*! should be unified with ProcedureCallDesignator *)
  6912. Emit(Push(position,pointer));
  6913. ReleaseIntermediateOperand(pointer);
  6914. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6915. FOR i := 1 TO x.parameters.Length()-1 DO
  6916. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6917. formalParameter := formalParameter.nextParameter;
  6918. END;
  6919. (* static call of the constructor *)
  6920. GetCodeSectionNameForSymbol(constructor,name);
  6921. ASSERT(~constructor.isInline);
  6922. IF constructor.scope.ownerModule # module.module THEN
  6923. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6924. ELSE
  6925. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6926. END;
  6927. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  6928. ELSE
  6929. ReleaseIntermediateOperand(pointer);
  6930. END;
  6931. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6932. Emit(Pop(position,pointer));
  6933. IF temporaryVariable # NIL THEN
  6934. Designate(p0,l);
  6935. ToMemory(l.op,addressType,0);
  6936. Emit(Mov(position,l.op,pointer));
  6937. ReleaseOperand(l);
  6938. result.tag := emptyOperand;
  6939. END;
  6940. (* call bodies *)
  6941. CallBodies(pointer,p0.type);
  6942. ReleaseIntermediateOperand(pointer);
  6943. IF temporaryVariable # NIL THEN
  6944. end := NewLabel();
  6945. BrL(end);
  6946. SetLabel(exit);
  6947. Designate(p0,l);
  6948. ToMemory(l.op,addressType,0);
  6949. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  6950. ReleaseOperand(l);
  6951. SetLabel(end);
  6952. ELSE
  6953. SetLabel(exit);
  6954. END;
  6955. END;
  6956. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  6957. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  6958. dim := 0;
  6959. IF p1 # NIL THEN
  6960. FOR i := 1 TO x.parameters.Length()-1 DO
  6961. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6962. parameter := x.parameters.GetExpression(i);
  6963. Evaluate(parameter,r);
  6964. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6965. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  6966. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  6967. END;
  6968. Emit(Push(position,r.op));
  6969. IF i=1 THEN
  6970. ReuseCopy(reg,r.op);
  6971. ELSE
  6972. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  6973. END;
  6974. ReleaseOperand(r);
  6975. INC(dim);
  6976. END;
  6977. Convert(reg,addressType);
  6978. ELSE
  6979. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6980. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  6981. END;
  6982. openDim := dim;
  6983. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  6984. IF backend.cooperative THEN
  6985. size := ToMemoryUnits(system,system.SizeOf(type));
  6986. WHILE type IS SyntaxTree.ArrayType DO
  6987. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6988. END;
  6989. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  6990. IF (size # 1) THEN
  6991. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6992. END;
  6993. Emit(Push(position,reg));
  6994. size := ToMemoryUnits(system,system.SizeOf(type));
  6995. IF (size # 1) THEN
  6996. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6997. END;
  6998. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  6999. Emit(Push(position,reg));
  7000. ReleaseIntermediateOperand(reg);
  7001. CallThis(position,"Runtime","New", 1);
  7002. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7003. Emit(Result(position, pointer));
  7004. exit := NewLabel();
  7005. else := NewLabel();
  7006. BreqL(else,pointer,nil);
  7007. IF ~type.hasPointers THEN
  7008. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7009. ELSIF type IS SyntaxTree.RecordType THEN
  7010. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7011. ELSIF type IS SyntaxTree.ProcedureType THEN
  7012. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7013. ELSE
  7014. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7015. END;
  7016. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7017. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7018. 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))));
  7019. IF type IS SyntaxTree.RecordType THEN
  7020. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7021. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7022. ELSE
  7023. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7024. END;
  7025. i := openDim;
  7026. WHILE i > 0 DO
  7027. DEC (i);
  7028. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7029. END;
  7030. needsTrace := p0.NeedsTrace();
  7031. IF needsTrace THEN ModifyAssignments(true) END;
  7032. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7033. Emit(Push(position, pointer));
  7034. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7035. Emit(Pop(position, pointer));
  7036. END;
  7037. Designate(p0,l);
  7038. IF needsTrace THEN
  7039. CallAssignPointer(l.op, pointer);
  7040. ModifyAssignments(false);
  7041. ELSE
  7042. ToMemory(l.op,addressType,0);
  7043. Emit(Mov(position,l.op,pointer));
  7044. END;
  7045. ReleaseIntermediateOperand(pointer);
  7046. ReleaseOperand(l);
  7047. BrL(exit);
  7048. SetLabel(else);
  7049. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7050. Designate(p0,l);
  7051. IF needsTrace THEN
  7052. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7053. ELSE
  7054. ToMemory(l.op,addressType,0);
  7055. Emit(Mov(position,l.op,pointer));
  7056. END;
  7057. ReleaseOperand(l);
  7058. SetLabel(exit);
  7059. ELSE
  7060. (*! the following code is only correct for "standard" Oberon calling convention *)
  7061. IF SemanticChecker.ContainsPointer(type) THEN
  7062. IF type IS SyntaxTree.ArrayType THEN
  7063. staticLength := 1;
  7064. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7065. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7066. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7067. END;
  7068. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7069. Emit(Mul(position,reg,reg,tmp));
  7070. END;
  7071. Designate(p0,l);
  7072. IF openDim > 0 THEN
  7073. Emit(Push(position,l.op)); (* address for use after syscall *)
  7074. END;
  7075. Emit(Push(position,l.op)); (* address *)
  7076. ReleaseOperand(l);
  7077. tmp := TypeDescriptorAdr(type);
  7078. IF ~newObjectFile THEN
  7079. IntermediateCode.MakeMemory(tmp,addressType);
  7080. END;
  7081. Emit(Push(position,tmp)); (* type descriptor *)
  7082. ReleaseIntermediateOperand(tmp);
  7083. Emit(Push(position,reg)); (* number Elements *)
  7084. ReleaseIntermediateOperand(reg);
  7085. tmp := IntermediateCode.Immediate(addressType,dim);
  7086. Emit(Push(position,tmp)); (* dimensions *)
  7087. (* push realtime flag *)
  7088. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7089. ELSE Emit(Push(position,false));
  7090. END;
  7091. CallThis(position,"Heaps","NewArr",5)
  7092. ELSE
  7093. size := ToMemoryUnits(system,system.SizeOf(type));
  7094. IF (size # 1) THEN
  7095. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7096. END;
  7097. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7098. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7099. Emit(Add(position,reg,reg,tmp));
  7100. Designate(p0,l);
  7101. IF openDim >0 THEN
  7102. Emit(Push(position,l.op)); (* address for use after syscall *)
  7103. END;
  7104. Emit(Push(position,l.op)); (* address for syscall *)
  7105. ReleaseOperand(l); (* pointer address *)
  7106. Emit(Push(position,reg)); (* size *)
  7107. ReleaseIntermediateOperand(reg);
  7108. (* push realtime flag *)
  7109. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7110. ELSE Emit(Push(position,false));
  7111. END;
  7112. CallThis(position,"Heaps","NewSys", 3)
  7113. END;
  7114. IF openDim > 0 THEN
  7115. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7116. Emit(Pop(position,adr));
  7117. ToMemory(adr,addressType,0);
  7118. ReuseCopy(tmp,adr);
  7119. ReleaseIntermediateOperand(adr);
  7120. adr := tmp;
  7121. else := NewLabel();
  7122. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7123. i := openDim-1;
  7124. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7125. WHILE (i >= 0) DO
  7126. Emit(Pop(position,reg));
  7127. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7128. Emit(Mov(position,res,reg));
  7129. DEC(i);
  7130. END;
  7131. ReleaseIntermediateOperand(adr);
  7132. ReleaseIntermediateOperand(reg);
  7133. exit := NewLabel();
  7134. BrL(exit);
  7135. SetLabel(else);
  7136. (* else part: array could not be allocated *)
  7137. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7138. Emit(Add(position,sp,sp,tmp));
  7139. SetLabel(exit);
  7140. END;
  7141. END;
  7142. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7143. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7144. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7145. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7146. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7147. left.SetType(procedure.type);
  7148. formalParameter := procedureType.firstParameter;
  7149. (* push array to allocate *)
  7150. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7151. formalParameter :=formalParameter.nextParameter;
  7152. (* push length array *)
  7153. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7154. (* push size *)
  7155. type := t0;
  7156. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7157. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7158. END;
  7159. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7160. Emit(Push(position,tmp));
  7161. (* *)
  7162. IF SemanticChecker.ContainsPointer(type) THEN
  7163. tmp := TypeDescriptorAdr(type);
  7164. IF ~newObjectFile THEN
  7165. IntermediateCode.MakeMemory(tmp,addressType);
  7166. END;
  7167. ELSE
  7168. tmp := IntermediateCode.Immediate(addressType, 0);
  7169. END;
  7170. Emit(Push(position,tmp)); (* type descriptor *)
  7171. StaticCallOperand(result,procedure);
  7172. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7173. ReleaseOperand(result);
  7174. END;
  7175. (*
  7176. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7177. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7178. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7179. *)
  7180. ELSE
  7181. dim := 0;
  7182. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7183. (* generate geometry descriptor *)
  7184. Designate(p0,l);
  7185. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7186. ReleaseOperand(l);
  7187. isTensor := TRUE;
  7188. ELSE
  7189. isTensor := FALSE;
  7190. END;
  7191. FOR i := 1 TO x.parameters.Length()-1 DO
  7192. IF ~isTensor THEN
  7193. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7194. END;
  7195. parameter := x.parameters.GetExpression(i);
  7196. Evaluate(parameter,r);
  7197. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7198. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7199. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7200. END;
  7201. Emit(Push(position,r.op));
  7202. IF i=1 THEN
  7203. ReuseCopy(reg,r.op);
  7204. ELSE
  7205. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7206. END;
  7207. ReleaseOperand(r);
  7208. INC(dim);
  7209. END;
  7210. Convert(reg,addressType);
  7211. openDim := dim;
  7212. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7213. (*! the following code is only correct for "standard" Oberon calling convention *)
  7214. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7215. t := type;
  7216. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7217. staticLength := 1;
  7218. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7219. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7220. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7221. END;
  7222. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7223. Emit(Mul(position,reg,reg,tmp));
  7224. END;
  7225. Designate(p0,l);
  7226. IF isTensor THEN
  7227. Dereference(l,type,FALSE);
  7228. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7229. END;
  7230. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7231. Emit(Push(position,l.tag)); (* address *)
  7232. ReleaseOperand(l);
  7233. tmp := TypeDescriptorAdr(t);
  7234. IF ~newObjectFile THEN
  7235. IntermediateCode.MakeMemory(tmp,addressType);
  7236. END;
  7237. Emit(Push(position,tmp)); (* type descriptor *)
  7238. ReleaseIntermediateOperand(tmp);
  7239. Emit(Push(position,reg)); (* number Elements *)
  7240. ReleaseIntermediateOperand(reg);
  7241. tmp := IntermediateCode.Immediate(addressType,0);
  7242. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7243. (* push realtime flag: false by default *)
  7244. Emit(Push(position,false));
  7245. CallThis(position,"Heaps","NewArr",5);
  7246. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7247. Emit(Pop(position,adr));
  7248. GetMathArrayField(tmp,adr,MathPtrOffset);
  7249. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7250. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7251. PutMathArrayField(adr,reg,MathAdrOffset);
  7252. ReleaseIntermediateOperand(tmp);
  7253. ReleaseIntermediateOperand(reg);
  7254. ELSE
  7255. IF isTensor THEN
  7256. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7257. ELSE
  7258. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7259. END;
  7260. IF (size # 1) THEN
  7261. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7262. END;
  7263. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7264. Emit(Add(position,reg,reg,tmp));
  7265. Designate(p0,l);
  7266. IF isTensor THEN
  7267. Dereference(l,type,FALSE);
  7268. END;
  7269. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7270. Emit(Push(position,l.tag)); (* address for syscall *)
  7271. ReleaseOperand(l); (* pointer address *)
  7272. Emit(Push(position,reg)); (* size *)
  7273. ReleaseIntermediateOperand(reg);
  7274. (* push realtime flag: false by default *)
  7275. Emit(Push(position,false));
  7276. CallThis(position,"Heaps","NewSys",3);
  7277. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7278. Emit(Pop(position,adr));
  7279. GetMathArrayField(tmp,adr,MathPtrOffset);
  7280. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7281. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7282. PutMathArrayField(adr,reg,MathAdrOffset);
  7283. ReleaseIntermediateOperand(tmp);
  7284. ReleaseIntermediateOperand(reg);
  7285. END;
  7286. flags := {};
  7287. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7288. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7289. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7290. PutMathArrayField(adr,tmp,MathDimOffset);
  7291. else := NewLabel();
  7292. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7293. i := openDim-1;
  7294. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7295. IF isTensor THEN
  7296. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7297. ELSE
  7298. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7299. END;
  7300. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7301. WHILE (i >= 0) DO
  7302. Emit(Pop(position,reg));
  7303. PutMathArrayLength(adr,reg,i);
  7304. PutMathArrayIncrement(adr,tmp,i);
  7305. IF i > 0 THEN
  7306. IF i=openDim-1 THEN
  7307. ReuseCopy(tmp,tmp);
  7308. END;
  7309. Emit(Mul(position,tmp,tmp,reg));
  7310. END;
  7311. DEC(i);
  7312. END;
  7313. ReleaseIntermediateOperand(adr);
  7314. ReleaseIntermediateOperand(reg);
  7315. ReleaseIntermediateOperand(tmp);
  7316. exit := NewLabel();
  7317. BrL(exit);
  7318. SetLabel(else);
  7319. (* else part: array could not be allocated *)
  7320. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7321. Emit(Add(position,sp,sp,tmp));
  7322. SetLabel(exit);
  7323. END;
  7324. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7325. THEN
  7326. IF ~backend.cellsAreObjects THEN RETURN END;
  7327. IF InCellScope(currentScope) THEN
  7328. PushSelfPointer()
  7329. ELSE
  7330. Emit(Push(position, nil));
  7331. END;
  7332. (* push temp address *)
  7333. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7334. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7335. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7336. (* l.op contains address of pointer to record *)
  7337. Emit(Push(position,l.op)); (* address for use after syscall *)
  7338. ReleaseOperand(l);
  7339. (* push type descriptor *)
  7340. reg := TypeDescriptorAdr(baseType);
  7341. IF ~newObjectFile THEN
  7342. IntermediateCode.MakeMemory(reg,addressType);
  7343. END;
  7344. Emit(Push(position,reg));
  7345. ReleaseIntermediateOperand(reg);
  7346. (* push name *)
  7347. (*Global.GetSymbolName(p0, n);*)
  7348. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7349. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7350. ELSE
  7351. Global.GetModuleName(module.module, n);
  7352. END;
  7353. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7354. (*type.typeDeclaration.GetName(n);*)
  7355. PushConstString(n);
  7356. (* push cellnet boolean *)
  7357. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7358. (* push engine boolean *)
  7359. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7360. (* allocate *)
  7361. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7362. (* add capabilities *)
  7363. modifier := p0(SyntaxTree.Designator).modifiers;
  7364. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7365. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7366. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7367. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7368. END;
  7369. AppendModifiers(modifier, baseType(SyntaxTree.CellType).modifiers);
  7370. (*
  7371. modifier := baseType(SyntaxTree.CellType).modifiers;
  7372. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7373. modifier := p0(SyntaxTree.Designator).modifiers;
  7374. *)
  7375. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7376. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7377. (* l.op contains address of pointer to record *)
  7378. ToMemory(l.op,addressType,0);
  7379. (* l.op contains value of pointer to record *)
  7380. Emit(Push(position,l.op)); (* address for use after syscall *)
  7381. ReleaseOperand(l);
  7382. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7383. prevScope := currentScope;
  7384. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7385. previous := section;
  7386. section := init;
  7387. (* add ports *)
  7388. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7389. CloseInitializer(previous);
  7390. currentScope := prevScope;
  7391. Symbol(temporaryVariable,l);
  7392. ToMemory(l.op,addressType,0);
  7393. Emit(Push(position,l.op));
  7394. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7395. (*
  7396. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7397. IF constructor # NIL THEN
  7398. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7399. FOR i := 1 TO x.parameters.Length()-1 DO
  7400. p := x.parameters.GetExpression(i);
  7401. Global.GetSymbolName(parameter,name);
  7402. Evaluate(p, value);
  7403. ASSERT(value.type # NIL);
  7404. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7405. par := instance.AddParameter(name);
  7406. par.SetInteger(value.integer);
  7407. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7408. par := instance.AddParameter(name);
  7409. par.SetBoolean(value.boolean);
  7410. ELSE Error(x.position,NotYetImplemented)
  7411. END;
  7412. parameter := parameter.nextParameter
  7413. END;
  7414. END;
  7415. *)
  7416. (* call initializer *)
  7417. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7418. IF constructor # NIL THEN
  7419. (*! should be unified with ProcedureCallDesignator *)
  7420. IF backend.cellsAreObjects THEN
  7421. Symbol(temporaryVariable,l);
  7422. ToMemory(l.op,addressType,0);
  7423. Emit(Push(position,l.op));
  7424. ReleaseOperand(l);
  7425. END;
  7426. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7427. FOR i := 1 TO x.parameters.Length()-1 DO
  7428. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7429. formalParameter := formalParameter.nextParameter;
  7430. END;
  7431. (* static call of the constructor *)
  7432. Global.GetSymbolSegmentedName(constructor,name);
  7433. ASSERT(~constructor.isInline);
  7434. IF constructor.scope.ownerModule # module.module THEN
  7435. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7436. ELSE
  7437. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7438. END;
  7439. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7440. (*ELSE
  7441. ReleaseIntermediateOperand(pointer);*)
  7442. END;
  7443. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7444. ToMemory(l.op, addressType, 0);
  7445. Designate(p0,s0);
  7446. ToMemory(s0.op,addressType,0);
  7447. Emit(Mov(position,s0.op,l.op));
  7448. ReleaseOperand(l);
  7449. ReleaseOperand(s0);
  7450. result.tag := emptyOperand;
  7451. (* start *)
  7452. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7453. (* push cell *)
  7454. Symbol(temporaryVariable, l);
  7455. ToMemory(l.op,addressType,0);
  7456. Emit(Push(-1,l.op));
  7457. (* push delegate *)
  7458. Emit(Push(-1,l.op));
  7459. ReleaseOperand(l);
  7460. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7461. Emit(Push(position, s1.op));
  7462. ReleaseOperand(s1);
  7463. CallThis(position,"ActiveCellsRuntime","Start",3);
  7464. END;
  7465. (*IF temporaryVariable # NIL THEN
  7466. end := NewLabel();
  7467. BrL(end);
  7468. SetLabel(exit);
  7469. Designate(p0,l);
  7470. ToMemory(l.op,addressType,0);
  7471. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7472. ReleaseOperand(l);
  7473. SetLabel(end);
  7474. ELSE
  7475. SetLabel(exit);
  7476. END;
  7477. *)
  7478. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7479. ELSE (* no pointer to record, no pointer to array *)
  7480. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7481. (* ignore new statement *)
  7482. Warning(p0.position, "cannot run on final hardware");
  7483. ELSE
  7484. HALT(200);
  7485. END;
  7486. END;
  7487. (* ---- ADDRESSOF----- *)
  7488. |Global.systemAdr:
  7489. Designate(p0,s0);
  7490. s0.mode := ModeValue;
  7491. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7492. ReleaseIntermediateOperand(s0.op);
  7493. s0.op := s0.tag;
  7494. IntermediateCode.InitOperand(s0.tag);
  7495. END;
  7496. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7497. result := s0;
  7498. (* ---- BIT ----- *)
  7499. |Global.systemBit:
  7500. Evaluate(p0,s0);
  7501. ToMemory(s0.op,addressType,0);
  7502. ReuseCopy(res,s0.op);
  7503. ReleaseOperand(s0);
  7504. Evaluate(p1,s1);
  7505. Emit(Ror(position,res,res,s1.op));
  7506. ReleaseOperand(s1);
  7507. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7508. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7509. IF ~conditional THEN
  7510. InitOperand(result,ModeValue); result.op := res;
  7511. ELSE
  7512. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7513. BrL(falseLabel);
  7514. ReleaseIntermediateOperand(res);
  7515. END;
  7516. (* --- MSK ----*)
  7517. |Global.systemMsk:
  7518. Evaluate(p0,s0);
  7519. Evaluate(p1,s1);
  7520. ReuseCopy(res,s0.op);
  7521. ReleaseOperand(s0);
  7522. Emit(And(position,res,res,s1.op));
  7523. ReleaseOperand(s1);
  7524. InitOperand(result,ModeValue);
  7525. result.op := res;
  7526. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7527. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7528. Evaluate(p0,s0);
  7529. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7530. ReleaseOperand(s0);
  7531. InitOperand(result,ModeValue);
  7532. result.op := res;
  7533. (* ---- SYSTEM.GetStackPointer ----- *)
  7534. |Global.systemGetStackPointer:
  7535. InitOperand(result,ModeValue);
  7536. result.op := sp;
  7537. (* ---- SYSTEM.GetFramePointer ----- *)
  7538. |Global.systemGetFramePointer:
  7539. InitOperand(result,ModeValue);
  7540. result.op := fp;
  7541. (* ---- SYSTEM.GetActivity ----- *)
  7542. |Global.systemGetActivity:
  7543. ASSERT(backend.cooperative);
  7544. InitOperand(result,ModeValue);
  7545. result.op := ap;
  7546. (* ---- SYSTEM.SetStackPointer ----- *)
  7547. |Global.systemSetStackPointer:
  7548. Evaluate(p0,s0); (* *)
  7549. Emit(Mov(position,sp,s0.op));
  7550. ReleaseOperand(s0);
  7551. (* ---- SYSTEM.SetFramePointer ----- *)
  7552. |Global.systemSetFramePointer:
  7553. Evaluate(p0,s0); (* *)
  7554. Emit(Mov(position,fp,s0.op));
  7555. ReleaseOperand(s0);
  7556. (* ---- SYSTEM.Activity ----- *)
  7557. |Global.systemSetActivity:
  7558. ASSERT(backend.cooperative);
  7559. Evaluate(p0,s0); (* *)
  7560. Emit(Mov(position,ap,s0.op));
  7561. ReleaseOperand(s0);
  7562. (* ---- SYSTEM.VAL ----- *)
  7563. |Global.systemVal:
  7564. Expression(p1);
  7565. s1 := result;
  7566. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7567. IF s1.mode = ModeReference THEN
  7568. (* nothing to be done if not record type, just take over new type *)
  7569. IF (type IS SyntaxTree.RecordType) THEN
  7570. ReleaseIntermediateOperand(s1.tag);
  7571. s1.tag := TypeDescriptorAdr(type);
  7572. IF ~newObjectFile THEN
  7573. IntermediateCode.MakeMemory(s1.tag,addressType);
  7574. END;
  7575. UseIntermediateOperand(s1.tag);
  7576. END;
  7577. result := s1;
  7578. ELSE (* copy over result to different type, may not use convert *)
  7579. itype := IntermediateCode.GetType(system,type);
  7580. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7581. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7582. Emit(Mov(position,s0.op,s1.op));
  7583. ReleaseOperand(s1);
  7584. InitOperand(result,ModeValue);
  7585. result.op := s0.op;
  7586. ELSE (* different size, must convert *)
  7587. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7588. Convert(s1.op, IntermediateCode.GetType(system,type));
  7589. result := s1;
  7590. END;
  7591. END;
  7592. (* ---- SYSTEM.GET ----- *)
  7593. |Global.systemGet:
  7594. Evaluate(p0,s0); (* adr *)
  7595. Designate(p1,s1); (* variable *)
  7596. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7597. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7598. Emit(Mov(position,s1.op,s0.op));
  7599. ReleaseOperand(s1);
  7600. ReleaseOperand(s0);
  7601. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7602. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7603. Evaluate(p0,s0); (* *)
  7604. Evaluate(p1,s1); (* variable *)
  7605. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7606. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7607. (* real part *)
  7608. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7609. Emit(Mov(position,res, s1.op));
  7610. ReleaseIntermediateOperand(res);
  7611. (* imaginary part *)
  7612. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7613. Emit(Mov(position,res, s1.tag));
  7614. ReleaseIntermediateOperand(res);
  7615. ReleaseOperand(s1);
  7616. ReleaseOperand(s0);
  7617. ELSE
  7618. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7619. ReleaseOperand(s0);
  7620. Emit(Mov(position,res,s1.op));
  7621. ReleaseIntermediateOperand(res);
  7622. ReleaseOperand(s1);
  7623. END;
  7624. (* ---- SYSTEM.MOVE ----- *)
  7625. |Global.systemMove:
  7626. Evaluate(p0,s0);
  7627. Evaluate(p1,s1);
  7628. Evaluate(p2,s2);
  7629. Emit(Copy(position,s1.op,s0.op,s2.op));
  7630. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7631. (* ---- SYSTEM.NEW ----- *)
  7632. |Global.systemNew:
  7633. Designate(p0,s0);
  7634. Emit(Push(position,s0.op));
  7635. ReleaseOperand(s0);
  7636. Evaluate(p1,s1);
  7637. Emit(Push(position,s1.op));
  7638. ReleaseOperand(s1);
  7639. (* push realtime flag: false by default *)
  7640. Emit(Push(position,false));
  7641. CallThis(position,"Heaps","NewSys",3);
  7642. (* ---- SYSTEM.CALL ----- *)
  7643. |Global.systemRef:
  7644. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7645. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7646. s0.mode := ModeValue;
  7647. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7648. result := s0
  7649. (* ---- INCR ----- *)
  7650. |Global.Incr:
  7651. Designate(p0,operand);
  7652. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7653. Dereference(operand,p0.type.resolved,FALSE);
  7654. END;
  7655. ASSERT(p1 # NIL);
  7656. Evaluate(p1,l);
  7657. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7658. ReleaseOperand(operand); ReleaseOperand(l);
  7659. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7660. (* ---- SUM ----- *)
  7661. |Global.Sum: HALT(200);
  7662. (* ---- ALL ----- *)
  7663. |Global.All: HALT(200);
  7664. (* ---- CAS ----- *)
  7665. |Global.Cas:
  7666. needsTrace := p0.NeedsTrace();
  7667. IF needsTrace THEN ModifyAssignments(true) END;
  7668. Designate(p0,s0);
  7669. Evaluate(p1,s1);
  7670. Evaluate(p2,s2);
  7671. IF needsTrace THEN
  7672. Emit(Push(position, s0.op));
  7673. Emit(Push(position, s1.op));
  7674. Emit(Push(position, s2.op));
  7675. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7676. ELSE
  7677. Emit(Cas(position,s0.op,s1.op,s2.op));
  7678. END;
  7679. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7680. IF needsTrace THEN ModifyAssignments(false) END;
  7681. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7682. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7683. IF conditional THEN
  7684. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7685. BrL(falseLabel);
  7686. ReleaseIntermediateOperand(res);
  7687. END;
  7688. (* ---- DIM ----- *)
  7689. |Global.Dim:
  7690. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7691. Designate(p0,s0);
  7692. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7693. Dereference(s0,p0.type.resolved,FALSE);
  7694. END;
  7695. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7696. ReleaseOperand(s0);
  7697. (* ---- RESHAPE ----- *)
  7698. |Global.Reshape:
  7699. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7700. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7701. left.SetType(procedure.type);
  7702. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7703. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7704. END;
  7705. (* ---- SYSTEM.TYPECODE ----- *)
  7706. |Global.systemTypeCode:
  7707. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7708. IF type.resolved IS SyntaxTree.PointerType THEN
  7709. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7710. END;
  7711. result.op := TypeDescriptorAdr(type);
  7712. IF ~newObjectFile THEN
  7713. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7714. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7715. END;
  7716. result.mode := ModeValue;
  7717. (* ---- SYSTEM.TRACE ----- *)
  7718. |Global.systemTrace:
  7719. SystemTrace(x.parameters, x.position);
  7720. (* ----- CONNECT ------*)
  7721. |Global.Connect:
  7722. IF backend.cellsAreObjects THEN
  7723. PushPort(p0);
  7724. PushPort(p1);
  7725. IF p2 # NIL THEN
  7726. Evaluate(p2, s2);
  7727. Emit(Push(p2.position, s2.op));
  7728. ReleaseOperand(s2);
  7729. ELSE
  7730. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7731. END;
  7732. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7733. ELSE
  7734. Warning(x.position, "cannot run on final hardware");
  7735. END;
  7736. (* ----- DELEGATE ------*)
  7737. |Global.Delegate:
  7738. IF backend.cellsAreObjects THEN
  7739. PushPort(p0);
  7740. PushPort(p1);
  7741. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7742. ELSE
  7743. Warning(x.position, "cannot run on final hardware");
  7744. END;
  7745. (* ----- SEND ------*)
  7746. |Global.Send:
  7747. Evaluate(p0,s0);
  7748. Evaluate(p1,s1);
  7749. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7750. Emit(Push(position,s0.op));
  7751. Emit(Push(position,s1.op));
  7752. (*
  7753. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7754. *)
  7755. IF ~backend.cellsAreObjects THEN
  7756. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7757. END;
  7758. ReleaseOperand(s0);
  7759. ReleaseOperand(s1);
  7760. IF backend.cellsAreObjects THEN
  7761. CallThis(position,"ActiveCellsRuntime","Send",2);
  7762. ELSE
  7763. CallThis(position,ChannelModuleName,"Send",2);
  7764. END;
  7765. (* ----- RECEIVE ------*)
  7766. |Global.Receive:
  7767. Evaluate(p0,s0);
  7768. Emit(Push(position,s0.op));
  7769. Designate(p1,s1);
  7770. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7771. Emit(Push(position,s1.op));
  7772. IF p2 # NIL THEN
  7773. Designate(p2,s2);
  7774. Emit(Push(position,s2.op));
  7775. END;
  7776. (*
  7777. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7778. *)
  7779. IF ~backend.cellsAreObjects THEN
  7780. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7781. END;
  7782. ReleaseOperand(s0);
  7783. ReleaseOperand(s1);
  7784. ReleaseOperand(s2);
  7785. IF backend.cellsAreObjects THEN
  7786. IF p2 = NIL THEN
  7787. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7788. ELSE
  7789. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7790. END;
  7791. ELSE
  7792. IF p2 = NIL THEN
  7793. CallThis(position,ChannelModuleName,"Receive",2)
  7794. ELSE
  7795. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7796. END;
  7797. END;
  7798. | Global.systemSpecial:
  7799. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7800. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7801. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7802. (* determine if parameters are of the VAR kind *)
  7803. ASSERT(x.parameters.Length() <= 3);
  7804. formalParameter := procedureType.firstParameter;
  7805. FOR i := 0 TO x.parameters.Length() - 1 DO
  7806. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7807. formalParameter := formalParameter.nextParameter
  7808. END;
  7809. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7810. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7811. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7812. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7813. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7814. IF procedureType.returnType # NIL THEN
  7815. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7816. Emit(Result(position, res));
  7817. (*InitOperand(result,ModeValue);
  7818. result.op := res;
  7819. *)
  7820. IF ~conditional THEN
  7821. InitOperand(result,ModeValue); result.op := res;
  7822. ELSE
  7823. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7824. BrL(falseLabel);
  7825. ReleaseIntermediateOperand(res);
  7826. END;
  7827. END
  7828. ELSE (* function not yet implemented *)
  7829. Error(position,"not yet implemented");
  7830. END;
  7831. destination := dest;
  7832. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  7833. END VisitBuiltinCallDesignator;
  7834. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  7835. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  7836. BEGIN
  7837. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  7838. dest := destination; destination := emptyOperand;
  7839. Expression(x.left);
  7840. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  7841. ELSIF isUnchecked THEN (* no check *)
  7842. ELSE
  7843. trueL := NewLabel();
  7844. falseL := NewLabel();
  7845. IF IsPointerToRecord(x.left.type,recordType) THEN
  7846. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7847. Emit(Mov(position,tag, result.op));
  7848. IF result.mode # ModeValue THEN
  7849. ptr := tag;
  7850. IntermediateCode.MakeMemory(ptr,addressType);
  7851. Emit(Mov(position,tag, ptr));
  7852. END;
  7853. IF ~backend.cooperative THEN
  7854. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7855. END;
  7856. IntermediateCode.MakeMemory(tag,addressType);
  7857. ELSE
  7858. tag := result.tag;
  7859. END;
  7860. TypeTest(tag,x.type,trueL,falseL);
  7861. ReleaseIntermediateOperand(tag);
  7862. SetLabel(falseL);
  7863. EmitTrap(position,TypeCheckTrap);
  7864. SetLabel(trueL);
  7865. END;
  7866. destination := dest;
  7867. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  7868. END VisitTypeGuardDesignator;
  7869. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  7870. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  7871. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  7872. VAR label: Label; pc: LONGINT;
  7873. BEGIN
  7874. IF backend.cooperative & ~isUnchecked THEN
  7875. pc := section.pc;
  7876. label := NewLabel();
  7877. BrneL(label, operand.op, nil);
  7878. EmitTrap(position, NilPointerTrap);
  7879. SetLabel(label);
  7880. INC(statCoopNilCheck, section.pc - pc);
  7881. END;
  7882. END NilCheck;
  7883. BEGIN
  7884. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  7885. ReuseCopy(dereferenced,operand.op);
  7886. ReleaseOperand(operand);
  7887. operand.mode := ModeReference;
  7888. operand.op := dereferenced;
  7889. operand.tag := dereferenced;
  7890. UseIntermediateOperand(operand.tag);
  7891. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  7892. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  7893. ReleaseIntermediateOperand(operand.tag);
  7894. operand.tag := TypeDescriptorAdr(type);
  7895. IF ~newObjectFile THEN
  7896. IntermediateCode.MakeMemory(operand.tag,addressType);
  7897. END;
  7898. ELSE
  7899. IF ~backend.cooperative THEN
  7900. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7901. END;
  7902. IntermediateCode.MakeMemory(operand.tag,addressType);
  7903. END;
  7904. NilCheck(operand.op);
  7905. ELSIF type IS SyntaxTree.ArrayType THEN
  7906. IF isUnsafe THEN
  7907. NilCheck(operand.op);
  7908. ReleaseIntermediateOperand(operand.tag);
  7909. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7910. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  7911. ELSE
  7912. operand.tag := emptyOperand;
  7913. END;
  7914. ELSE
  7915. NilCheck(operand.op);
  7916. IF backend.cooperative THEN
  7917. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  7918. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7919. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  7920. ELSE
  7921. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  7922. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  7923. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7924. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  7925. END;
  7926. END;
  7927. ELSIF type IS SyntaxTree.MathArrayType THEN
  7928. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  7929. IntermediateCode.MakeMemory(operand.op,addressType);
  7930. ELSE HALT(100);
  7931. END;
  7932. END Dereference;
  7933. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  7934. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  7935. BEGIN
  7936. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  7937. dest := destination; destination := emptyOperand;
  7938. Evaluate(x.left,d);
  7939. type := x.type.resolved;
  7940. prevIsUnchecked := isUnchecked;
  7941. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  7942. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  7943. END;
  7944. Dereference(d,type,IsUnsafePointer(x.left.type));
  7945. isUnchecked := prevIsUnchecked;
  7946. result := d;
  7947. 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
  7948. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  7949. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7950. END;
  7951. END;
  7952. destination := dest;
  7953. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  7954. END VisitDereferenceDesignator;
  7955. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  7956. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  7957. BEGIN
  7958. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  7959. dest := destination; destination := emptyOperand;
  7960. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  7961. tag := result.op;
  7962. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  7963. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  7964. StaticCallOperand(result,procedure.super);
  7965. ReleaseIntermediateOperand(result.tag);
  7966. UseIntermediateOperand(tag); (* necessary ? *)
  7967. result.tag := tag;
  7968. destination := dest;
  7969. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  7970. END VisitSupercallDesignator;
  7971. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  7972. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  7973. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  7974. name: Basic.SegmentedName;
  7975. BEGIN
  7976. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  7977. dest := destination; destination := emptyOperand;
  7978. scope := currentScope;
  7979. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  7980. scope := scope.outerScope;
  7981. END;
  7982. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  7983. IF newObjectFile THEN
  7984. moduleSection := meta.ModuleSection();
  7985. IF backend.cooperative THEN
  7986. moduleOffset := 0;
  7987. ELSE
  7988. moduleOffset := moduleSection.pc;
  7989. END;
  7990. result.mode := ModeValue;
  7991. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  7992. ELSE
  7993. Symbol(moduleSelf,result);
  7994. IntermediateCode.MakeMemory(result.op,addressType);
  7995. END
  7996. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  7997. result.mode := ModeValue;
  7998. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  7999. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8000. ELSE
  8001. GetBaseRegister(basereg,currentScope,scope);
  8002. InitOperand(result,ModeReference);
  8003. result.op := basereg;
  8004. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  8005. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  8006. IF backend.cooperative THEN
  8007. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8008. END;
  8009. (* tag must be loaded when dereferencing SELF pointer *)
  8010. END;
  8011. destination := dest;
  8012. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8013. END VisitSelfDesignator;
  8014. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8015. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8016. BEGIN
  8017. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8018. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8019. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8020. parameter := procedureType.returnParameter;
  8021. VisitParameter(parameter);
  8022. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8023. END VisitResultDesignator;
  8024. (** values *)
  8025. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8026. BEGIN
  8027. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8028. IF conditional THEN
  8029. IF x.value THEN BrL(trueLabel)
  8030. ELSE BrL(falseLabel)
  8031. END;
  8032. ELSE
  8033. InitOperand(result,ModeValue);
  8034. IF x.value THEN result.op := true ELSE result.op := false END;
  8035. END;
  8036. END VisitBooleanValue;
  8037. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8038. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8039. BEGIN
  8040. Global.GetModuleSegmentedName(module.module, name);
  8041. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8042. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8043. RETURN section
  8044. END GetDataSection;
  8045. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8046. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8047. BEGIN
  8048. type := vop.type;
  8049. data := GetDataSection();
  8050. pc := EnterImmediate(data,vop);
  8051. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8052. IntermediateCode.MakeMemory(vop, type);
  8053. END GetImmediateMem;
  8054. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8055. BEGIN
  8056. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8057. InitOperand(result,ModeValue);
  8058. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8059. IF ~supportedImmediate(result.op) &~inData THEN
  8060. GetImmediateMem(result.op)
  8061. END;
  8062. END VisitIntegerValue;
  8063. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8064. BEGIN
  8065. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8066. InitOperand(result,ModeValue);
  8067. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8068. END VisitCharacterValue;
  8069. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8070. BEGIN
  8071. IF Trace THEN TraceEnter("VisitSetValue") END;
  8072. InitOperand(result,ModeValue);
  8073. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8074. END VisitSetValue;
  8075. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8076. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8077. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8078. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8079. BEGIN
  8080. numberElements := x.elements.Length();
  8081. FOR i := 0 TO numberElements-1 DO
  8082. expression := x.elements.GetExpression(i);
  8083. IF expression IS SyntaxTree.MathArrayExpression THEN
  8084. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8085. ELSE
  8086. inData := TRUE;
  8087. Evaluate(expression,op);
  8088. irv.Emit(Data(position,op.op));
  8089. inData := FALSE;
  8090. ReleaseOperand(op);
  8091. END;
  8092. END;
  8093. END RecursiveData;
  8094. BEGIN
  8095. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8096. IF ~TryConstantDeclaration() THEN
  8097. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8098. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8099. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8100. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8101. ELSE
  8102. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8103. END;
  8104. RecursiveData(x.array);
  8105. InitOperand(result,ModeReference);
  8106. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8107. END
  8108. END VisitMathArrayValue;
  8109. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8110. VAR constant: Sections.Section;
  8111. BEGIN
  8112. IF constantDeclaration = NIL THEN
  8113. RETURN FALSE
  8114. ELSE
  8115. (* Is a constant in this module: did we generate it already? *)
  8116. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8117. IF constant # NIL THEN
  8118. InitOperand(result,ModeReference);
  8119. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8120. RETURN TRUE;
  8121. END;
  8122. END;
  8123. RETURN FALSE
  8124. END TryConstantDeclaration;
  8125. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8126. BEGIN
  8127. constantDeclaration := x;
  8128. x.value.resolved.Accept(SELF);
  8129. END VisitConstant;
  8130. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8131. BEGIN
  8132. IF Trace THEN TraceEnter("VisitRealValue") END;
  8133. InitOperand(result,ModeValue);
  8134. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8135. END VisitRealValue;
  8136. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8137. VAR
  8138. componentType: SyntaxTree.Type;
  8139. BEGIN
  8140. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8141. ASSERT(x.type IS SyntaxTree.ComplexType);
  8142. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8143. InitOperand(result,ModeValue);
  8144. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8145. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8146. END VisitComplexValue;
  8147. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8148. VAR i: LONGINT; name: Basic.SegmentedName;
  8149. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8150. BEGIN
  8151. IF Trace THEN TraceEnter("VisitStringValue") END;
  8152. IF ~TryConstantDeclaration() THEN
  8153. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8154. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8155. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8156. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8157. ELSE
  8158. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8159. END;
  8160. FOR i := 0 TO x.length-1 DO
  8161. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8162. irv.Emit(Data(position,op));
  8163. END;
  8164. InitOperand(result,ModeReference);
  8165. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8166. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8167. END
  8168. END VisitStringValue;
  8169. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8170. BEGIN
  8171. IF Trace THEN TraceEnter("VisitNilValue") END;
  8172. InitOperand(result,ModeValue);
  8173. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8174. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8175. END VisitNilValue;
  8176. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8177. BEGIN
  8178. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8179. InitOperand(result,ModeValue);
  8180. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8181. END VisitEnumerationValue;
  8182. (** symbols *)
  8183. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8184. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8185. END VisitImport;
  8186. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8187. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8188. BEGIN
  8189. IF scope # baseScope THEN
  8190. (* left := [fp+8] *)
  8191. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8192. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8193. ReuseCopy(left,right);
  8194. ReleaseIntermediateOperand(right);
  8195. scope := scope.outerScope; DEC(level);
  8196. (* { left := [left+8] } *)
  8197. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8198. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8199. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8200. Emit(Mov(position,left,right));
  8201. scope := scope.outerScope; DEC(level);
  8202. END;
  8203. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8204. result := left;
  8205. ELSE
  8206. result := fp;
  8207. END;
  8208. END GetBaseRegister;
  8209. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8210. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8211. BEGIN
  8212. IF Trace THEN TraceEnter("VisitVariable"); END;
  8213. type := x.type.resolved;
  8214. IF (x.useRegister) THEN
  8215. InitOperand(result, ModeValue);
  8216. IF x.registerNumber < 0 THEN
  8217. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8218. reg := x.registerNumber;
  8219. ELSE
  8220. reg := registerUsageCount.Map(x.registerNumber);
  8221. UseRegister(reg);
  8222. END;
  8223. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8224. ELSIF x.externalName # NIL THEN
  8225. InitOperand(result,ModeReference);
  8226. Basic.ToSegmentedName(x.externalName^, name);
  8227. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8228. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8229. InitOperand(result,ModeReference);
  8230. GetBaseRegister(result.op,currentScope,x.scope);
  8231. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8232. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8233. InitOperand(result,ModeReference);
  8234. GetCodeSectionNameForSymbol(x,name);
  8235. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8236. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8237. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8238. InitOperand(result,ModeReference);
  8239. GetCodeSectionNameForSymbol(x,name);
  8240. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8241. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8242. ELSE (* field, left designator must have been emitted *)
  8243. ASSERT(result.mode = ModeReference);
  8244. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8245. ReuseCopy(temp,result.op);
  8246. ReleaseIntermediateOperand(result.op);
  8247. result.op := temp;
  8248. END;
  8249. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8250. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8251. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8252. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8253. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8254. END;
  8255. END;
  8256. END;
  8257. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8258. ValueToCondition(result);
  8259. ELSIF type IS SyntaxTree.ProcedureType THEN
  8260. ReleaseIntermediateOperand(result.tag);
  8261. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8262. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8263. UseIntermediateOperand(result.tag);
  8264. ELSE
  8265. result.tag := nil; (* nil *)
  8266. END;
  8267. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8268. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8269. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8270. ReleaseIntermediateOperand(result.tag);
  8271. Global.GetSymbolSegmentedName(x,name);
  8272. Basic.AppendToSegmentedName(name,"@len");
  8273. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8274. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8275. ELSE
  8276. END;
  8277. ELSE
  8278. ReleaseIntermediateOperand(result.tag);
  8279. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8280. END;
  8281. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8282. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8283. ReleaseIntermediateOperand(result.tag);
  8284. result.tag := result.op;
  8285. UseIntermediateOperand(result.tag);
  8286. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8287. IntermediateCode.MakeMemory(result.op,addressType);
  8288. END;
  8289. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8290. ReleaseIntermediateOperand(result.tag);
  8291. result.tag := TypeDescriptorAdr(type);
  8292. IF ~newObjectFile THEN
  8293. IntermediateCode.MakeMemory(result.tag,addressType);
  8294. END;
  8295. UseIntermediateOperand(result.tag);
  8296. (* tag for pointer type computed not here but during dereferencing *)
  8297. END;
  8298. IF Trace THEN TraceExit("VisitVariable") END;
  8299. END VisitVariable;
  8300. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8301. BEGIN
  8302. VisitVariable(property);
  8303. END VisitProperty;
  8304. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8305. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8306. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8307. BEGIN
  8308. type := x.type.resolved;
  8309. IF Trace THEN TraceEnter("VisitParameter") END;
  8310. IF x.ownerType IS SyntaxTree.CellType THEN
  8311. ptype := x.type.resolved;
  8312. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8313. IF ~(ptype IS SyntaxTree.PortType) THEN
  8314. InitOperand(result,ModeReference);
  8315. GetCodeSectionNameForSymbol(x,name);
  8316. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8317. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8318. RETURN
  8319. ELSE
  8320. InitOperand(result, ModeValue);
  8321. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8322. adr := 0;
  8323. WHILE parameter # x DO
  8324. parameterType := parameter.type;
  8325. inc := 1;
  8326. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8327. INC(adr, inc);
  8328. parameter := parameter.nextParameter
  8329. END;
  8330. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8331. RETURN
  8332. END;
  8333. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8334. InitOperand(result,ModeReference);
  8335. GetCodeSectionNameForSymbol(x,name);
  8336. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8337. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8338. RETURN
  8339. ELSE
  8340. GetBaseRegister(basereg,currentScope,x.scope);
  8341. InitOperand(result,ModeReference);
  8342. result.op := basereg;
  8343. END;
  8344. IF IsOpenArray(type) THEN
  8345. result.tag := basereg;
  8346. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8347. IntermediateCode.MakeMemory(result.op,addressType);
  8348. IF Global.IsOberonProcedure(x.ownerType) THEN
  8349. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8350. UseIntermediateOperand(result.tag);
  8351. ELSE
  8352. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8353. END;
  8354. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8355. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8356. ELSIF IsStaticArray(type) THEN
  8357. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8358. IntermediateCode.MakeMemory(result.op,addressType);
  8359. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8360. ELSIF type IS SyntaxTree.MathArrayType THEN
  8361. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8362. WITH type: SyntaxTree.MathArrayType DO
  8363. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8364. IF type.form = SyntaxTree.Tensor THEN
  8365. ELSIF type.form = SyntaxTree.Open THEN
  8366. result.tag := result.op;
  8367. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8368. IntermediateCode.MakeMemory(result.op,addressType);
  8369. UseIntermediateOperand(result.tag);
  8370. ELSIF type.form = SyntaxTree.Static THEN
  8371. IF x.kind = SyntaxTree.ConstParameter THEN
  8372. IntermediateCode.MakeMemory(result.op,addressType);
  8373. END;
  8374. ELSE HALT(100)
  8375. END;
  8376. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8377. IF type.form = SyntaxTree.Tensor THEN
  8378. ToMemory(result.op,addressType,0);
  8379. ELSIF type.form = SyntaxTree.Open THEN
  8380. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8381. ReuseCopy(result.tag, mem);
  8382. ReleaseIntermediateOperand(mem);
  8383. ReleaseIntermediateOperand(result.op);
  8384. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8385. ELSIF type.form = SyntaxTree.Static THEN
  8386. IntermediateCode.MakeMemory(result.op,addressType);
  8387. ELSE HALT(100)
  8388. END;
  8389. ELSE HALT(100)
  8390. END;
  8391. END;
  8392. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8393. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8394. IntermediateCode.MakeMemory(result.op,addressType);
  8395. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8396. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8397. END;
  8398. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8399. ValueToCondition(result);
  8400. ELSIF type IS SyntaxTree.ProcedureType THEN
  8401. ReleaseIntermediateOperand(result.tag);
  8402. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8403. IF x.kind = SyntaxTree.VarParameter THEN
  8404. ReuseCopy(result.tag,result.op);
  8405. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8406. IntermediateCode.MakeMemory(result.tag,addressType);
  8407. ELSE
  8408. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8409. UseIntermediateOperand(result.tag);
  8410. END;
  8411. ELSE
  8412. result.tag := nil;
  8413. END;
  8414. (* tag for pointer type computed not here but during dereferencing *)
  8415. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8416. ReleaseIntermediateOperand(result.tag);
  8417. result.tag := basereg;
  8418. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8419. IntermediateCode.MakeMemory(result.tag,addressType);
  8420. UseIntermediateOperand(result.tag);
  8421. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8422. ReleaseIntermediateOperand(result.tag);
  8423. result.tag := TypeDescriptorAdr(type);
  8424. IF ~newObjectFile THEN
  8425. IntermediateCode.MakeMemory(result.tag,addressType);
  8426. END;
  8427. UseIntermediateOperand(result.tag);
  8428. END;
  8429. IF Trace THEN TraceExit("VisitParameter") END;
  8430. END VisitParameter;
  8431. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8432. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8433. BEGIN
  8434. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8435. (* left.p: left already emitted *)
  8436. tag := result.op; (* value of pointer to left *)
  8437. (* get type desc *)
  8438. tmp := result.tag;
  8439. IntermediateCode.MakeMemory(tmp,addressType);
  8440. (* get method adr *)
  8441. Reuse1(reg,tmp);
  8442. ReleaseIntermediateOperand(tmp);
  8443. IF backend.cooperative THEN
  8444. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8445. WHILE recordType.baseType # NIL DO
  8446. recordType := recordType.GetBaseRecord ();
  8447. END;
  8448. GetRecordTypeName (recordType,name);
  8449. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8450. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8451. offset := 0;
  8452. ELSE
  8453. offset := 2;
  8454. END;
  8455. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8456. ELSE
  8457. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8458. END;
  8459. InitOperand(operand,ModeReference);
  8460. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8461. operand.op := reg;
  8462. operand.tag := tag;
  8463. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8464. END DynamicCallOperand;
  8465. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8466. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8467. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8468. BEGIN
  8469. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8470. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8471. tag := operand.op;
  8472. ReleaseIntermediateOperand(operand.tag);
  8473. ELSE tag := nil
  8474. END;
  8475. IF x.isInline THEN
  8476. sectionType := Sections.InlineCodeSection;
  8477. ELSE
  8478. sectionType := Sections.CodeSection;
  8479. END;
  8480. IF x.externalName # NIL THEN
  8481. Basic.ToSegmentedName(x.externalName^, name);
  8482. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8483. ELSE
  8484. GetCodeSectionNameForSymbol(x, name);
  8485. IF (x.scope.ownerModule = module.module) THEN
  8486. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8487. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8488. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8489. IF source.pc = 0 THEN (* no code yet *)
  8490. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8491. END;
  8492. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8493. bits := x.procedureScope.body.code.inlineCode;
  8494. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8495. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8496. binary.CopyBits(bits, 0, bits.GetSize());
  8497. source.SetResolved(binary);
  8498. ELSE
  8499. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8500. END;
  8501. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8502. END;
  8503. InitOperand(operand,ModeValue);
  8504. operand.op := reg;
  8505. operand.tag := tag;
  8506. IF Trace THEN TraceExit("StaticCallOperand") END;
  8507. END StaticCallOperand;
  8508. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8509. (* handle expressions of the form designator.procedure or procedure *)
  8510. BEGIN
  8511. IF Trace THEN TraceEnter("VisitProcedure") END;
  8512. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8513. DynamicCallOperand(result,x);
  8514. ELSIF x.isInline THEN
  8515. StaticCallOperand(result,x);
  8516. ELSE
  8517. StaticCallOperand(result,x);
  8518. END;
  8519. IF Trace THEN TraceExit("VisitProcedure") END;
  8520. END VisitProcedure;
  8521. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8522. BEGIN
  8523. VisitProcedure(x);
  8524. END VisitOperator;
  8525. (** statements *)
  8526. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8527. BEGIN
  8528. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8529. Expression(x.call);
  8530. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8531. ReleaseOperand(result)
  8532. END;
  8533. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8534. END VisitProcedureCallStatement;
  8535. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8536. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8537. leftBase, rightBase: SyntaxTree.Type;
  8538. procedureName,s: SyntaxTree.IdentifierString;
  8539. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8540. size: LONGINT; rightKind: LONGINT;
  8541. dummy: IntermediateCode.Operand;
  8542. CONST moduleName = "FoxArrayBase";
  8543. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8544. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8545. BEGIN
  8546. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8547. IF base IS SyntaxTree.MathArrayType THEN
  8548. base := OpenArray(base(SyntaxTree.MathArrayType));
  8549. END;
  8550. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8551. result.SetArrayBase(base);
  8552. RETURN result
  8553. END OpenArray;
  8554. BEGIN
  8555. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8556. SaveRegisters();ReleaseUsedRegisters(saved);
  8557. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8558. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8559. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8560. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8561. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8562. IF leftType.form = SyntaxTree.Tensor THEN
  8563. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8564. ELSIF leftType.form = SyntaxTree.Open THEN
  8565. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8566. ELSIF leftType.form = SyntaxTree.Static THEN
  8567. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8568. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8569. END;
  8570. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8571. IF procedure = NIL THEN
  8572. s := "Instruction not supported on target, emulation procedure ";
  8573. Strings.Append(s,moduleName);
  8574. Strings.Append(s,".");
  8575. Strings.Append(s,procedureName);
  8576. Strings.Append(s," not present");
  8577. Error(position,s);
  8578. ELSE
  8579. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8580. parameter.SetType(leftType);
  8581. parameter.SetAccess(SyntaxTree.Internal);
  8582. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8583. parameter.SetKind(rightKind);
  8584. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8585. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8586. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8587. StaticCallOperand(result,procedure);
  8588. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8589. ReleaseOperand(result);
  8590. END;
  8591. RestoreRegisters(saved);
  8592. END;
  8593. END AssignMathArray;
  8594. VAR modifyAssignmentCounter := 0: LONGINT;
  8595. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8596. VAR processor,mem,dst: IntermediateCode.Operand;
  8597. BEGIN
  8598. IF value.intValue = true.intValue THEN
  8599. INC(modifyAssignmentCounter);
  8600. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8601. modifyAssignmentsPC := section.pc;
  8602. ELSE
  8603. DEC(modifyAssignmentCounter);
  8604. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8605. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8606. END;
  8607. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8608. dst := NewRegisterOperand (addressType);
  8609. Emit(Mov(position,dst, processor));
  8610. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8611. Emit(Mov(position,mem, value));
  8612. ReleaseIntermediateOperand(dst);
  8613. END ModifyAssignments;
  8614. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8615. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8616. BEGIN
  8617. type := left.type.resolved;
  8618. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8619. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8620. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8621. IF procedureType.returnParameter = parameter THEN
  8622. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8623. END;
  8624. END;
  8625. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8626. END CopySize;
  8627. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8628. VAR
  8629. leftO, rightO: Operand;
  8630. mem, sizeOp: IntermediateCode.Operand;
  8631. leftType, rightType, componentType: SyntaxTree.Type;
  8632. size: LONGINT;
  8633. parameters: SyntaxTree.ExpressionList;
  8634. procedure: SyntaxTree.Procedure;
  8635. call: SyntaxTree.ProcedureCallDesignator;
  8636. designator: SyntaxTree.Designator;
  8637. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8638. VAR procedureType: SyntaxTree.ProcedureType;
  8639. BEGIN
  8640. IF ReturnedAsParameter(right.type) THEN
  8641. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8642. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8643. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8644. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8645. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8646. IF right.id = Global.Reshape THEN RETURN TRUE
  8647. END;
  8648. END;
  8649. END;
  8650. END;
  8651. RETURN FALSE
  8652. END CanPassAsResultParameter;
  8653. BEGIN
  8654. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8655. leftType := left.type.resolved; rightType:= right.type.resolved;
  8656. IF backend.cooperative & left.NeedsTrace() THEN
  8657. ModifyAssignments(true);
  8658. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8659. Designate(right, rightO);
  8660. Designate(left, leftO);
  8661. ASSERT(leftO.mode = ModeReference);
  8662. TransferToRegister(leftO.op, leftO.op);
  8663. TransferToRegister(rightO.op, rightO.op);
  8664. Emit(Push(position, leftO.op));
  8665. Emit(Push(position, rightO.op));
  8666. CallAssignMethod(leftO.op, rightO.op, left.type);
  8667. Emit(Pop(position, rightO.op));
  8668. Emit(Pop(position, leftO.op));
  8669. sizeOp := CopySize(left);
  8670. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8671. ReleaseOperand(leftO);
  8672. ReleaseOperand(rightO);
  8673. ELSE
  8674. Evaluate(right,rightO);
  8675. Designate(left,leftO);
  8676. ASSERT(leftO.mode = ModeReference);
  8677. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8678. (* copy procedure address first *)
  8679. MakeMemory(mem,leftO.op,addressType,0);
  8680. Emit(Mov(position,mem,rightO.op));
  8681. ReleaseIntermediateOperand(mem);
  8682. (* copy pointer address *)
  8683. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8684. CallAssignPointer(leftO.tag, rightO.tag);
  8685. ELSE
  8686. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8687. CallAssignPointer(leftO.op, rightO.op);
  8688. END;
  8689. ReleaseOperand(leftO);
  8690. ReleaseOperand(rightO);
  8691. END;
  8692. ModifyAssignments(false);
  8693. RETURN;
  8694. END;
  8695. IF CanPassAsResultParameter(right) THEN
  8696. procedureResultDesignator := left(SyntaxTree.Designator);
  8697. Expression(right);
  8698. procedureResultDesignator := NIL;
  8699. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8700. (* left <-- ALIAS OF right: zerocopy *)
  8701. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8702. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8703. designator.SetType(procedure.type);
  8704. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8705. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8706. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8707. END;
  8708. ELSIF leftType IS SyntaxTree.RangeType THEN
  8709. (* LHS is of array range type *)
  8710. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8711. Evaluate(right, rightO);
  8712. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8713. (* first *)
  8714. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8715. Emit(Mov(position,mem, rightO.op));
  8716. ReleaseIntermediateOperand(mem);
  8717. (* last *)
  8718. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8719. Emit(Mov(position,mem, rightO.tag));
  8720. ReleaseIntermediateOperand(mem);
  8721. (* step *)
  8722. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8723. Emit(Mov(position,mem, rightO.extra));
  8724. ReleaseIntermediateOperand(mem);
  8725. ReleaseOperand(rightO);
  8726. ReleaseOperand(leftO)
  8727. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8728. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8729. Evaluate(right, rightO);
  8730. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8731. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8732. (* real part *)
  8733. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8734. Emit(Mov(position,mem, rightO.op));
  8735. ReleaseIntermediateOperand(mem);
  8736. (* imaginary part *)
  8737. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8738. Emit(Mov(position,mem, rightO.tag));
  8739. ReleaseIntermediateOperand(mem);
  8740. ReleaseOperand(rightO);
  8741. ReleaseOperand(leftO)
  8742. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8743. OR (leftType IS SyntaxTree.PortType) THEN
  8744. (* rightO := leftO;*)
  8745. Evaluate(right,rightO);
  8746. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8747. Designate(left,leftO);
  8748. IF leftO.mode = ModeReference THEN
  8749. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8750. destination := mem;
  8751. ELSE
  8752. destination := leftO.op;
  8753. END;
  8754. ReleaseOperand(leftO);
  8755. IF destination.mode # IntermediateCode.Undefined THEN
  8756. Emit(Mov(position,destination,rightO.op));
  8757. END;
  8758. ReleaseOperand(rightO);
  8759. ReleaseIntermediateOperand(mem);
  8760. IntermediateCode.InitOperand(destination);
  8761. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8762. Evaluate(right,rightO);
  8763. Designate(left,leftO);
  8764. MakeMemory(mem,leftO.op,addressType,0);
  8765. Emit(Mov(position,mem,rightO.op));
  8766. ReleaseIntermediateOperand(mem);
  8767. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8768. (* delegate *)
  8769. (*
  8770. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8771. *)
  8772. Emit(Mov(position,leftO.tag,rightO.tag));
  8773. END;
  8774. ReleaseOperand(leftO);
  8775. ReleaseOperand(rightO);
  8776. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8777. Designate(right,rightO);
  8778. Designate(left,leftO);
  8779. sizeOp := CopySize(left);
  8780. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8781. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8782. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8783. IF (rightType IS SyntaxTree.StringType) THEN
  8784. CopyString(left,right);
  8785. 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
  8786. Designate(right,rightO);
  8787. Designate(left,leftO);
  8788. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8789. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8790. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8791. ELSE
  8792. HALT(201)
  8793. END;
  8794. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8795. AssignMathArray(left,right);
  8796. ELSE
  8797. HALT(200);
  8798. END;
  8799. END Assign;
  8800. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8801. BEGIN
  8802. IF Trace THEN TraceEnter("VisitAssignment") END;
  8803. Assign(x.left,x.right);
  8804. IF Trace THEN TraceExit("VisitAssignment") END;
  8805. END VisitAssignment;
  8806. PROCEDURE EmitCooperativeSwitch;
  8807. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8808. BEGIN
  8809. ASSERT (cooperativeSwitches);
  8810. pc := section.pc;
  8811. IF lastSwitchPC = section.pc THEN RETURN END;
  8812. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8813. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8814. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8815. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  8816. INC(statCoopSwitch, section.pc - pc);
  8817. END EmitCooperativeSwitch;
  8818. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8819. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  8820. BEGIN
  8821. p0 := communication.left; p1 := communication.right;
  8822. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  8823. Evaluate(p0,s0);
  8824. Evaluate(p1,s1);
  8825. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8826. Emit(Push(position,s0.op));
  8827. Emit(Push(position,s1.op));
  8828. (*
  8829. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8830. *)
  8831. IF ~backend.cellsAreObjects THEN
  8832. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  8833. END;
  8834. ReleaseOperand(s0);
  8835. ReleaseOperand(s1);
  8836. IF backend.cellsAreObjects THEN
  8837. CallThis(position,"ActiveCellsRuntime","Send",2);
  8838. ELSE
  8839. CallThis(position,ChannelModuleName,"Send",2);
  8840. END;
  8841. (* ----- RECEIVE ------*)
  8842. ELSE
  8843. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  8844. tmp := p0; p0 := p1; p1 := tmp;
  8845. END;
  8846. Evaluate(p0,s0);
  8847. Emit(Push(position,s0.op));
  8848. Designate(p1,s1);
  8849. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8850. Emit(Push(position,s1.op));
  8851. (*
  8852. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8853. *)
  8854. IF ~backend.cellsAreObjects THEN
  8855. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  8856. END;
  8857. ReleaseOperand(s0);
  8858. ReleaseOperand(s1);
  8859. IF backend.cellsAreObjects THEN
  8860. CallThis(position,"ActiveCellsRuntime","Receive",2);
  8861. ELSE
  8862. CallThis(position,ChannelModuleName,"Receive",2)
  8863. END;
  8864. END;
  8865. END VisitCommunicationStatement;
  8866. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  8867. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  8868. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  8869. VAR true, false: Label; condition, value: BOOLEAN;
  8870. BEGIN
  8871. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  8872. IF condition THEN
  8873. true := NewLabel();
  8874. false := NewLabel();
  8875. Condition(if.condition,true,false);
  8876. SetLabel(true);
  8877. StatementSequence(if.statements);
  8878. BrL(end);
  8879. SetLabel(false);
  8880. ELSE
  8881. IF value THEN (* always true *)
  8882. escape := TRUE;
  8883. StatementSequence(if.statements);
  8884. (* no branch necessary -- rest skipped *)
  8885. END;
  8886. END;
  8887. END IfPart;
  8888. BEGIN
  8889. IF Trace THEN TraceEnter("VisitIfStatement") END;
  8890. end := NewLabel();
  8891. elsifs := x.ElsifParts();
  8892. IfPart(x.ifPart);
  8893. FOR i := 0 TO elsifs-1 DO
  8894. IF ~escape THEN
  8895. elsif := x.GetElsifPart(i);
  8896. IfPart(elsif);
  8897. END;
  8898. END;
  8899. IF (x.elsePart # NIL) & ~escape THEN
  8900. StatementSequence(x.elsePart);
  8901. END;
  8902. SetLabel(end);
  8903. IF Trace THEN TraceExit("VisitIfStatement") END;
  8904. END VisitIfStatement;
  8905. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  8906. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  8907. BEGIN
  8908. (*IF x.variable.type.resolved = x.type.resolved THEN
  8909. (* always true, do nothing *)
  8910. ELSE*)
  8911. Designate(x.variable,res);
  8912. IF IsPointerToRecord(x.variable.type,recordType) THEN
  8913. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  8914. END;
  8915. trueL := NewLabel();
  8916. TypeTest(res.tag,x.type,trueL,falseL);
  8917. ReleaseOperand(res);
  8918. SetLabel(trueL);
  8919. StatementSequence(x.statements);
  8920. BrL(endL);
  8921. END WithPart;
  8922. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  8923. VAR endL,falseL: Label;i: LONGINT;
  8924. BEGIN
  8925. IF Trace THEN TraceEnter("VisitWithStatement") END;
  8926. endL := NewLabel();
  8927. FOR i := 0 TO x.WithParts()-1 DO
  8928. falseL := NewLabel();
  8929. WithPart(x.GetWithPart(i),falseL,endL);
  8930. SetLabel(falseL);
  8931. END;
  8932. IF x.elsePart = NIL THEN
  8933. IF ~isUnchecked THEN
  8934. EmitTrap(position,WithTrap);
  8935. END;
  8936. ELSE
  8937. StatementSequence(x.elsePart)
  8938. END;
  8939. SetLabel(endL);
  8940. IF Trace THEN TraceExit("VisitWithStatement") END;
  8941. END VisitWithStatement;
  8942. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  8943. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  8944. out,else: Label; label: Label;
  8945. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  8946. symbol: SyntaxTree.Symbol;
  8947. BEGIN
  8948. (*! split case statement into if-elsif statements for large case label lists *)
  8949. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  8950. size := x.max-x.min+1;
  8951. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  8952. END;
  8953. Evaluate(x.variable,var);
  8954. ReuseCopy(tmp,var.op);
  8955. ReleaseIntermediateOperand(var.op);
  8956. var.op := tmp;
  8957. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  8958. Convert(var.op,addressType);
  8959. size := x.max-x.min+1;
  8960. else := NewLabel();
  8961. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  8962. (*
  8963. UniqueId(name,module.module,"case",caseId);
  8964. *)
  8965. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  8966. Global.GetModuleSegmentedName(module.module, name);
  8967. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  8968. symbol := SyntaxTree.NewSymbol(name[1]);
  8969. symbol.SetScope(moduleScope);
  8970. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  8971. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  8972. section.isCaseTable := TRUE;
  8973. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  8974. ReuseCopy(res,var.op);
  8975. ReleaseOperand(var);
  8976. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  8977. Emit(Add(position,res,res,jmp));
  8978. IntermediateCode.MakeMemory(res,addressType);
  8979. Emit(Br(position,res));
  8980. ReleaseIntermediateOperand(res);
  8981. out := NewLabel();
  8982. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  8983. part := x.GetCasePart(i);
  8984. constant := part.firstConstant;
  8985. label := NewLabel();
  8986. SetLabel(label);
  8987. WHILE(constant # NIL) DO (* case labels for this case part *)
  8988. FOR j := constant.min TO constant.max DO
  8989. fixups[j-x.min] := label;
  8990. END;
  8991. constant := constant.next;
  8992. END;
  8993. StatementSequence(part.statements);
  8994. BrL(out);
  8995. END;
  8996. SetLabel(else);
  8997. FOR i := 0 TO size-1 DO
  8998. IF fixups[i] = NIL THEN
  8999. fixups[i] := else;
  9000. END;
  9001. END;
  9002. IF x.elsePart # NIL THEN
  9003. StatementSequence(x.elsePart);
  9004. ELSIF ~isUnchecked THEN
  9005. EmitTrap(position,CaseTrap);
  9006. END;
  9007. SetLabel(out);
  9008. FOR i := 0 TO size-1 DO
  9009. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9010. section.Emit(Data(position,op));
  9011. END;
  9012. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9013. END VisitCaseStatement;
  9014. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9015. VAR start: Label; true,false: Label;
  9016. BEGIN
  9017. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9018. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9019. start := NewLabel();
  9020. true := NewLabel();
  9021. false := NewLabel();
  9022. SetLabel(start);
  9023. Condition(x.condition,true,false);
  9024. SetLabel(true);
  9025. StatementSequence(x.statements);
  9026. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9027. BrL(start);
  9028. SetLabel(false);
  9029. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9030. END VisitWhileStatement;
  9031. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9032. VAR false,true: Label;
  9033. BEGIN
  9034. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9035. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9036. true := NewLabel();
  9037. false := NewLabel();
  9038. SetLabel(false);
  9039. StatementSequence(x.statements);
  9040. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9041. Condition(x.condition,true,false);
  9042. SetLabel(true);
  9043. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9044. END VisitRepeatStatement;
  9045. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9046. VAR
  9047. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9048. temporaryVariable: SyntaxTree.Variable;
  9049. temporaryVariableDesignator : SyntaxTree.Designator;
  9050. BEGIN
  9051. IF Trace THEN TraceEnter("VisitForStatement") END;
  9052. true := NewLabel();
  9053. false := NewLabel();
  9054. start := NewLabel();
  9055. Assign(x.variable,x.from);
  9056. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9057. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9058. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9059. Assign(temporaryVariableDesignator,x.to);
  9060. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9061. IF by > 0 THEN
  9062. cmp := Scanner.LessEqual
  9063. ELSE
  9064. cmp := Scanner.GreaterEqual
  9065. END;
  9066. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9067. binary.SetType(system.booleanType);
  9068. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9069. SetLabel(start);
  9070. Condition(binary,true,false);
  9071. SetLabel(true);
  9072. StatementSequence(x.statements);
  9073. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9074. binary.SetType(x.variable.type);
  9075. Assign(x.variable,binary);
  9076. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9077. BrL(start);
  9078. SetLabel(false);
  9079. IF Trace THEN TraceExit("VisitForStatement") END;
  9080. END VisitForStatement;
  9081. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9082. VAR prevLoop: Label;
  9083. BEGIN
  9084. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9085. prevLoop := currentLoop;
  9086. currentLoop := NewLabel();
  9087. StatementSequence(x.statements);
  9088. SetLabel(currentLoop);
  9089. currentLoop := prevLoop;
  9090. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9091. END VisitExitableBlock;
  9092. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9093. VAR prevLoop,start: Label;
  9094. BEGIN
  9095. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9096. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9097. start := NewLabel();
  9098. prevLoop := currentLoop;
  9099. SetLabel(start);
  9100. currentLoop := NewLabel();
  9101. StatementSequence(x.statements);
  9102. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9103. BrL(start);
  9104. SetLabel(currentLoop);
  9105. currentLoop := prevLoop;
  9106. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9107. END VisitLoopStatement;
  9108. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9109. VAR outer: SyntaxTree.Statement;
  9110. BEGIN
  9111. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9112. IF locked THEN (* r if we jump out of an exclusive block *)
  9113. outer := x.outer;
  9114. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9115. outer := outer.outer;
  9116. END;
  9117. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9118. Lock(FALSE);
  9119. END;
  9120. END;
  9121. BrL(currentLoop);
  9122. IF Trace THEN TraceExit("VisitExitStatement") END;
  9123. END VisitExitStatement;
  9124. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9125. VAR
  9126. expression, parameterDesignator: SyntaxTree.Expression;
  9127. type, componentType: SyntaxTree.Type;
  9128. res, right: Operand;
  9129. left, mem, reg: IntermediateCode.Operand;
  9130. parameter: SyntaxTree.Parameter;
  9131. procedure: SyntaxTree.Procedure;
  9132. procedureType: SyntaxTree.ProcedureType;
  9133. returnTypeOffset: LONGINT;
  9134. delegate: BOOLEAN;
  9135. map: SymbolMap;
  9136. BEGIN
  9137. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9138. expression := x.returnValue;
  9139. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9140. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9141. IF currentIsInline THEN
  9142. IF expression # NIL THEN
  9143. map := currentMapper.Get(NIL);
  9144. IF map # NIL THEN
  9145. Assign(map.to, expression);
  9146. END;
  9147. END;
  9148. BrL(currentInlineExit);
  9149. RETURN;
  9150. END;
  9151. IF expression # NIL THEN
  9152. type := expression.type.resolved;
  9153. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9154. IF locked THEN Lock(FALSE) END;
  9155. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9156. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9157. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9158. (* return without structured return parameter *)
  9159. Evaluate(expression,res);
  9160. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9161. IF locked OR profile THEN
  9162. Emit(Push(position,res.op));
  9163. IF delegate THEN HALT(200) END;
  9164. ReleaseOperand(res);
  9165. IF locked THEN Lock(FALSE) END;
  9166. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9167. reg := NewRegisterOperand(res.op.type);
  9168. Emit(Pop(position,reg));
  9169. Emit(Return(position,reg));
  9170. ReleaseIntermediateOperand(reg);
  9171. ELSE
  9172. Emit(Return(position,res.op));
  9173. ReleaseOperand(res);
  9174. END;
  9175. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9176. THEN
  9177. (* return using structured return parameter *)
  9178. 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)
  9179. OR SemanticChecker.IsPointerType(type));
  9180. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9181. parameter :=procedureType.returnParameter;
  9182. ASSERT(parameter # NIL);
  9183. returnTypeOffset := parameter.offsetInBits;
  9184. (*
  9185. IF parameter# NIL THEN
  9186. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9187. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9188. ELSE
  9189. returnTypeOffset := system.offsetFirstParameter
  9190. END;
  9191. *)
  9192. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9193. IF type IS SyntaxTree.RangeType THEN
  9194. (* array range type *)
  9195. Evaluate(expression, right);
  9196. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9197. Emit(Mov(position,mem, right.op)); (* first *)
  9198. ReleaseIntermediateOperand(mem);
  9199. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9200. Emit(Mov(position,mem, right.tag)); (* last *)
  9201. ReleaseIntermediateOperand(mem);
  9202. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9203. Emit(Mov(position,mem, right.extra)); (* step *)
  9204. ReleaseIntermediateOperand(mem);
  9205. ReleaseOperand(right);
  9206. ELSIF type IS SyntaxTree.ComplexType THEN
  9207. Evaluate(expression, right);
  9208. componentType := type(SyntaxTree.ComplexType).componentType;
  9209. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9210. Emit(Mov(position,mem, right.op)); (* real part *)
  9211. ReleaseIntermediateOperand(mem);
  9212. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9213. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9214. ReleaseIntermediateOperand(mem);
  9215. ReleaseOperand(right);
  9216. ELSE (* covers cases: pointer / record / array *)
  9217. parameter := procedureType.returnParameter;
  9218. checker.SetCurrentScope(currentScope);
  9219. ASSERT(parameter # NIL);
  9220. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9221. Assign(parameterDesignator,expression);
  9222. END;
  9223. ReleaseIntermediateOperand(left);
  9224. IF locked THEN Lock(FALSE) END;
  9225. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9226. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9227. parameter := procedureType.returnParameter;
  9228. checker.SetCurrentScope(currentScope);
  9229. IF parameter = NIL THEN
  9230. Error(procedure.position, "structured return of parameter of procedure not found");
  9231. ELSE
  9232. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9233. Assign(parameterDesignator,expression);
  9234. END;
  9235. IF locked THEN Lock(FALSE) END;
  9236. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9237. ELSE
  9238. HALT(200);
  9239. END;
  9240. ELSE
  9241. IF locked THEN Lock(FALSE) END;
  9242. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9243. END;
  9244. IF backend.cooperative THEN
  9245. BrL(exitLabel);
  9246. ELSE
  9247. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9248. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9249. END;
  9250. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9251. END VisitReturnStatement;
  9252. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9253. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9254. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9255. statements: SyntaxTree.StatementSequence;
  9256. name, suffix: SyntaxTree.IdentifierString;
  9257. BEGIN
  9258. Strings.IntToStr(awaitProcCounter,suffix);
  9259. Strings.Concat("@AwaitProcedure",suffix,name);
  9260. identifier := SyntaxTree.NewIdentifier(name);
  9261. INC(awaitProcCounter);
  9262. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9263. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9264. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9265. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9266. procedure.SetAccess(SyntaxTree.Hidden);
  9267. procedure.SetScope(currentScope);
  9268. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9269. procedureType.SetReturnType(system.booleanType);
  9270. procedure.SetType(procedureType);
  9271. body := SyntaxTree.NewBody(x.position,procedureScope);
  9272. procedureScope.SetBody(body);
  9273. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9274. returnStatement.SetReturnValue(x.condition);
  9275. statements := SyntaxTree.NewStatementSequence();
  9276. statements.AddStatement(returnStatement);
  9277. body.SetStatementSequence(statements);
  9278. currentScope.AddProcedure(procedure);
  9279. RETURN procedure
  9280. END MakeAwaitProcedure;
  9281. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9282. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9283. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9284. BEGIN
  9285. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9286. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9287. IF backend.cooperative THEN
  9288. start := NewLabel();
  9289. true := NewLabel();
  9290. false := NewLabel();
  9291. SetLabel(start);
  9292. Condition(x.condition,true,false);
  9293. SetLabel(false);
  9294. PushSelfPointer();
  9295. CallThis(position,"ExclusiveBlocks","Await",1);
  9296. BrL(start);
  9297. SetLabel(true);
  9298. PushSelfPointer();
  9299. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9300. ELSE
  9301. proc := MakeAwaitProcedure(x);
  9302. Emit(Push(position,fp));
  9303. GetCodeSectionNameForSymbol(proc,name);
  9304. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9305. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9306. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9307. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9308. Emit(Result(position,res));
  9309. (*
  9310. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9311. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9312. *)
  9313. InitOperand(result,ModeValue);
  9314. result.op := res;
  9315. label := NewLabel();
  9316. BreqL(label, result.op, SELF.true);
  9317. ReleaseOperand(result);
  9318. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9319. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9320. Emit(Push(position,res));
  9321. Emit(Push(position,fp));
  9322. PushSelfPointer();
  9323. Emit(Push(position,nil));
  9324. CallThis(position,"Objects","Await",4);
  9325. SetLabel(label);
  9326. END;
  9327. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9328. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9329. END VisitAwaitStatement;
  9330. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9331. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9332. BEGIN
  9333. FOR i := 0 TO x.Length() - 1 DO
  9334. statement := x.GetStatement( i );
  9335. Statement(statement);
  9336. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9337. END;
  9338. END StatementSequence;
  9339. PROCEDURE PushSelfPointer;
  9340. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9341. BEGIN
  9342. scope := currentScope;
  9343. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9344. scope := scope.outerScope;
  9345. END;
  9346. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9347. IF ~newObjectFile THEN
  9348. Symbol(moduleSelf,op);
  9349. IntermediateCode.MakeMemory(op.op,addressType);
  9350. ELSE
  9351. moduleSection := meta.ModuleSection();
  9352. IF backend.cooperative THEN
  9353. moduleOffset := 0;
  9354. ELSE
  9355. moduleOffset := moduleSection.pc;
  9356. END;
  9357. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9358. END;
  9359. ELSE
  9360. GetBaseRegister(op.op,currentScope,scope);
  9361. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9362. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9363. IF backend.cooperative THEN
  9364. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9365. END;
  9366. IntermediateCode.MakeMemory(op.op,addressType);
  9367. END;
  9368. Emit(Push(position,op.op));
  9369. ReleaseOperand(op);
  9370. END PushSelfPointer;
  9371. PROCEDURE Lock(lock: BOOLEAN);
  9372. BEGIN
  9373. IF Trace THEN TraceEnter("Lock") END;
  9374. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9375. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9376. ASSERT(modifyAssignmentCounter = 0);
  9377. IF dump # NIL THEN
  9378. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9379. dump.Ln;dump.Update;
  9380. END;
  9381. PushSelfPointer;
  9382. IF backend.cooperative THEN
  9383. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9384. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9385. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9386. END;
  9387. ELSE
  9388. Emit(Push(position,true));
  9389. IF lock THEN CallThis(position,"Objects","Lock",2)
  9390. ELSE CallThis(position,"Objects","Unlock",2);
  9391. END;
  9392. END;
  9393. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9394. IF Trace THEN TraceExit("Lock") END;
  9395. END Lock;
  9396. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9397. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9398. BEGIN
  9399. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9400. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9401. previouslyUnchecked := isUnchecked;
  9402. isUnchecked := isUnchecked OR x.isUnchecked;
  9403. previouslyCooperativeSwitches := cooperativeSwitches;
  9404. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9405. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9406. IF x.statements # NIL THEN
  9407. StatementSequence(x.statements);
  9408. END;
  9409. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9410. isUnchecked := previouslyUnchecked;
  9411. cooperativeSwitches := previouslyCooperativeSwitches;
  9412. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9413. END VisitStatementBlock;
  9414. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9415. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9416. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9417. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9418. procedure: SyntaxTree.Procedure;
  9419. map: SymbolMap;
  9420. BEGIN
  9421. scope := currentScope;
  9422. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9423. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9424. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9425. return := emptyOperand;
  9426. IF Trace THEN TraceEnter("VisitCode") END;
  9427. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9428. NEW(in, x.inRules.Length());
  9429. FOR i := 0 TO LEN(in)-1 DO
  9430. statement := x.inRules.GetStatement(i);
  9431. WITH statement: SyntaxTree.Assignment DO
  9432. Evaluate(statement.right, operand);
  9433. result := operand.op;
  9434. NEW(str, 64);
  9435. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9436. in[i] := result; IntermediateCode.SetString(in[i], str);
  9437. ReleaseIntermediateOperand(operand.tag);
  9438. END;
  9439. END;
  9440. ELSE in := NIL
  9441. END;
  9442. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9443. NEW(out, x.outRules.Length());
  9444. FOR i := 0 TO LEN(out)-1 DO
  9445. statement := x.outRules.GetStatement(i);
  9446. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9447. WITH statement: SyntaxTree.Assignment DO
  9448. Evaluate(statement.left, operand); (*?? or designate *)
  9449. result := operand.op;
  9450. NEW(str, 64);
  9451. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9452. out[i] := result; IntermediateCode.SetString(out[i], str);
  9453. ReleaseIntermediateOperand(operand.tag);
  9454. |statement: SyntaxTree.ReturnStatement DO
  9455. NEW(str, 64);
  9456. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9457. IF currentIsInline THEN
  9458. map := currentMapper.Get(NIL);
  9459. Evaluate(map.to, operand);
  9460. out[i] := operand.op;
  9461. ELSE
  9462. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9463. END;
  9464. IntermediateCode.SetString(out[i], str);
  9465. ReleaseIntermediateOperand(operand.tag);
  9466. return := out[i];
  9467. ELSE
  9468. END;
  9469. END;
  9470. ELSE out := NIL
  9471. END;
  9472. Emit(Asm(x.position,x.sourceCode, in, out));
  9473. IF in # NIL THEN
  9474. FOR i := 0 TO LEN(in)-1 DO
  9475. ReleaseIntermediateOperand(in[i]);
  9476. END;
  9477. END;
  9478. IF out # NIL THEN
  9479. FOR i := 0 TO LEN(out)-1 DO
  9480. WITH statement: SyntaxTree.Assignment DO
  9481. ReleaseIntermediateOperand(out[i]);
  9482. ELSE
  9483. IF currentIsInline THEN
  9484. ReleaseIntermediateOperand(out[i]);
  9485. END;
  9486. END;
  9487. statement := x.outRules.GetStatement(i);
  9488. END;
  9489. END;
  9490. IF return.mode # IntermediateCode.Undefined THEN
  9491. IF currentIsInline THEN
  9492. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9493. Symbol(procedureType.returnParameter, par);
  9494. MakeMemory(mem, par.op, return.type, 0);
  9495. ReleaseOperand(par);
  9496. Emit(Mov(position, mem, return));
  9497. ReleaseIntermediateOperand(mem);
  9498. ELSE
  9499. Emit(Return(position,return));
  9500. END;
  9501. IF currentIsInline THEN RETURN END;
  9502. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9503. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9504. ReleaseIntermediateOperand(return);
  9505. END;
  9506. IF Trace THEN TraceExit("VisitCode") END;
  9507. END VisitCode;
  9508. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9509. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9510. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9511. const, call: IntermediateCode.Operand;
  9512. parameterDesignator: SyntaxTree.Expression;
  9513. saved: RegisterEntry;
  9514. name: Basic.SegmentedName;
  9515. BEGIN
  9516. IF Trace THEN TraceEnter("ParameterCopies") END;
  9517. parameter := x.firstParameter;
  9518. WHILE parameter # NIL DO
  9519. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9520. type := parameter.type.resolved;
  9521. IF IsOpenArray(type) THEN
  9522. VisitParameter(parameter);
  9523. op := result;
  9524. IF backend.cooperative & parameter.NeedsTrace() THEN
  9525. length := GetArrayLength(type, op.tag);
  9526. size := NewRegisterOperand(addressType);
  9527. base := ArrayBaseType(type);
  9528. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9529. Emit(Mul(position, size, length, const));
  9530. dst := NewRegisterOperand (addressType);
  9531. Emit(Mov(position, dst, size));
  9532. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9533. Emit(Sub(position,dst,sp,dst));
  9534. Emit(And(position,dst,dst,const));
  9535. Emit(Mov(position,sp,dst));
  9536. par := fp;
  9537. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9538. IntermediateCode.InitImmediate(null, byteType, 0);
  9539. Emit(Fill(position, dst, size, null));
  9540. ReleaseIntermediateOperand(dst);
  9541. ReleaseIntermediateOperand(length);
  9542. SaveRegisters();ReleaseUsedRegisters(saved);
  9543. (* register dst has been freed before SaveRegisters already *)
  9544. base := ArrayBaseType(type);
  9545. (* assign method of open array *)
  9546. IF base.IsRecordType() THEN
  9547. Emit (Push(position, length));
  9548. Emit (Push(position, dst));
  9549. Emit (Push(position, op.op));
  9550. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9551. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9552. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9553. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9554. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9555. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9556. Emit (Push(position,length));
  9557. Emit (Push(position, dst));
  9558. Emit (Push(position, length));
  9559. Emit (Push(position, op.op));
  9560. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9561. ELSE
  9562. Emit (Push(position, length));
  9563. Emit (Push(position, dst));
  9564. Emit (Push(position, length));
  9565. Emit (Push(position, op.op));
  9566. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9567. ASSERT(ArrayBaseType(type).IsPointer());
  9568. END;
  9569. RestoreRegisters(saved);
  9570. ELSE
  9571. temp := GetDynamicSize(type,op.tag);
  9572. ReuseCopy(size,temp);
  9573. ReleaseIntermediateOperand(temp);
  9574. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9575. Emit(Sub(position,size,sp,size));
  9576. Emit(And(position,size,size,const));
  9577. Emit(Mov(position,sp,size));
  9578. par := fp;
  9579. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9580. ReleaseIntermediateOperand(size);
  9581. size := GetDynamicSize(type,op.tag);
  9582. END;
  9583. Emit(Copy(position,sp,op.op,size));
  9584. ReleaseIntermediateOperand(size);
  9585. ReleaseOperand(op);
  9586. IntermediateCode.MakeMemory(par,addressType);
  9587. Emit(Mov(position,par,sp));
  9588. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9589. checker.SetCurrentScope(currentScope);
  9590. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9591. Assign(parameterDesignator,parameterDesignator);
  9592. END;
  9593. END;
  9594. parameter := parameter.nextParameter;
  9595. END;
  9596. IF Trace THEN TraceExit("ParameterCopies") END;
  9597. END ParameterCopies;
  9598. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9599. VAR x: SyntaxTree.Variable;
  9600. BEGIN
  9601. x := scope.firstVariable;
  9602. WHILE x # NIL DO
  9603. InitVariable(x);
  9604. x := x.nextVariable;
  9605. END;
  9606. END InitVariables;
  9607. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9608. BEGIN
  9609. IF (symbol # NIL) THEN
  9610. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9611. ELSE
  9612. RETURN 0
  9613. END;
  9614. END GetFingerprint;
  9615. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9616. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9617. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9618. saved: RegisterEntry;
  9619. BEGIN
  9620. IF Trace THEN TraceEnter("Body") END;
  9621. ReleaseUsedRegisters(saved); (* just in case ... *)
  9622. section := ir;
  9623. exitLabel := NewLabel ();
  9624. IF moduleBody THEN moduleBodySection := section END;
  9625. IF ir.comments # NIL THEN
  9626. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9627. commentPrintout.SingleStatement(TRUE);
  9628. dump := ir.comments;
  9629. ELSE
  9630. commentPrintout := NIL;
  9631. dump := NIL;
  9632. END;
  9633. prevScope := currentScope;
  9634. currentScope := scope;
  9635. lastSwitchPC := 0;
  9636. cooperativeSwitches := backend.cooperative;
  9637. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9638. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9639. IF x # NIL THEN
  9640. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9641. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9642. IF moduleBody THEN
  9643. ProfilerInit();
  9644. ELSE
  9645. Basic.SegmentedNameToString(ir.name, string);
  9646. ProfilerAddProcedure(numberProcedures,string);
  9647. ProfilerEnterExit(numberProcedures,TRUE);
  9648. END;
  9649. END;
  9650. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9651. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9652. END;
  9653. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9654. IF moduleBody THEN
  9655. InitVariables(moduleScope)
  9656. END;
  9657. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9658. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9659. IF procedure = cellScope.bodyProcedure THEN
  9660. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9661. StaticCallOperand(op, cellScope.constructor);
  9662. Emit(Call(position,op.op,0));
  9663. END;
  9664. END;
  9665. END;
  9666. ParameterCopies(procedureType);
  9667. InitVariables(scope);
  9668. IF x.code = NIL THEN
  9669. VisitStatementBlock(x);
  9670. ELSE
  9671. VisitCode(x.code)
  9672. END;
  9673. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9674. ir.SetFinally(ir.pc);
  9675. StatementSequence(x.finally)
  9676. END;
  9677. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9678. IF ~backend.cooperative THEN
  9679. ProfilerEnterExit(numberProcedures,FALSE);
  9680. END;
  9681. INC(numberProcedures);
  9682. END;
  9683. END;
  9684. IF backend.cooperative THEN
  9685. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9686. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9687. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9688. (*! not required any more? check and delete!
  9689. PushSelfPointer();
  9690. CallThis(position,"Modules","SetInitialized",1);
  9691. *)
  9692. (*
  9693. SetLabel(end);
  9694. *)
  9695. END;
  9696. IF x # NIL THEN
  9697. SELF.position := x.position;
  9698. END;
  9699. CheckRegistersFree();
  9700. ASSERT(modifyAssignmentCounter = 0);
  9701. currentScope := prevScope;
  9702. IF Trace THEN TraceExit("Body") END;
  9703. END Body;
  9704. END ImplementationVisitor;
  9705. MetaDataGenerator=OBJECT
  9706. VAR
  9707. implementationVisitor: ImplementationVisitor;
  9708. declarationVisitor: DeclarationVisitor;
  9709. module: Sections.Module;
  9710. moduleName: ARRAY 128 OF CHAR;
  9711. moduleNamePool: Basic.HashTableInt;
  9712. moduleNamePoolSection: IntermediateCode.Section;
  9713. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9714. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9715. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9716. TypeTags: LONGINT; (* type extension level support *)
  9717. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9718. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9719. BEGIN
  9720. IF implementationVisitor.backend.cooperative THEN
  9721. TypeTags := MAX(LONGINT);
  9722. BaseTypesTableOffset := 0;
  9723. MethodTableOffset := 2;
  9724. TypeRecordBaseOffset := 0;
  9725. ELSIF simple THEN
  9726. TypeTags := 3; (* only 3 extensions allowed *)
  9727. BaseTypesTableOffset := 1;
  9728. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9729. TypeRecordBaseOffset := 0;
  9730. ELSE
  9731. TypeTags := 16;
  9732. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9733. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9734. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9735. END;
  9736. SELF.simple := simple;
  9737. SELF.implementationVisitor := implementationVisitor;
  9738. SELF.declarationVisitor := declarationVisitor;
  9739. implementationVisitor.meta := SELF;
  9740. declarationVisitor.meta := SELF;
  9741. END InitMetaDataGenerator;
  9742. PROCEDURE SetModule(module: Sections.Module);
  9743. VAR namePoolOffset: LONGINT;
  9744. BEGIN
  9745. SELF.module := module;
  9746. Global.GetModuleName(module.module,moduleName);
  9747. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9748. NEW(moduleNamePool, 32);
  9749. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9750. END;
  9751. END SetModule;
  9752. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9753. BEGIN
  9754. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9755. END GetTypeRecordBaseOffset;
  9756. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9757. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9758. BEGIN
  9759. INC(dataAdrOffset,6);
  9760. Info(section,"headerAdr");
  9761. Address(section,0);
  9762. Info(section,"typeDesc");
  9763. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9764. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9765. NamedSymbol(section, name, symbol, 0, offset);
  9766. Info(section,"mark: LONGINT;");
  9767. Longint(section,-1);
  9768. Info(section,"dataAdr-: ADDRESS");
  9769. Symbol(section,section, dataAdrOffset,0);
  9770. Info(section,"size-: SIZE");
  9771. Address(section,0);
  9772. Info(section,"nextRealtime: HeapBlock;");
  9773. Address(section,0);
  9774. END HeapBlock;
  9775. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9776. VAR i: LONGINT;
  9777. BEGIN
  9778. INC(dataAdrOffset,14);
  9779. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9780. Info(section,"count*: LONGINT");
  9781. Longint(section,0);
  9782. Info(section,"locked*: BOOLEAN");
  9783. Longint(section,0);
  9784. Info(section,"awaitingLock*: ProcessQueue");
  9785. Address(section,0);
  9786. Address(section,0);
  9787. Info(section,"awaitingCond*: ProcessQueue");
  9788. Address(section,0);
  9789. Address(section,0);
  9790. Info(section,"lockedBy*: ANY");
  9791. Address(section,0);
  9792. Info(section,"lock*: ANY");
  9793. Address(section,0);
  9794. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9795. Longint(section,1);
  9796. FOR i := 2 TO 6 DO
  9797. Longint(section,0);
  9798. END;
  9799. END ProtectedHeapBlock;
  9800. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9801. BEGIN
  9802. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9803. END Info;
  9804. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9805. VAR op: IntermediateCode.Operand;
  9806. BEGIN
  9807. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9808. section.Emit(Data(-11,op));
  9809. END Address;
  9810. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9811. VAR op: IntermediateCode.Operand;
  9812. BEGIN
  9813. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9814. section.Emit(Data(-12,op));
  9815. END Size;
  9816. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9817. VAR op: IntermediateCode.Operand;
  9818. BEGIN
  9819. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9820. section.Emit(Data(-1,op));
  9821. END Set;
  9822. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9823. VAR op: IntermediateCode.Operand;
  9824. BEGIN
  9825. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9826. section.Emit(Data(-1,op));
  9827. END Longint;
  9828. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  9829. VAR op,noOperand: IntermediateCode.Operand;
  9830. BEGIN
  9831. IntermediateCode.InitOperand(noOperand);
  9832. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9833. section.PatchOperands(pc,op,noOperand,noOperand);
  9834. END PatchLongint;
  9835. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9836. VAR op, noOperand: IntermediateCode.Operand;
  9837. BEGIN
  9838. IntermediateCode.InitOperand(noOperand);
  9839. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9840. section.PatchOperands(pc,op,noOperand,noOperand);
  9841. END PatchSymbol;
  9842. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  9843. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  9844. BEGIN
  9845. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  9846. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  9847. section.Emit(Data(-1,op));
  9848. END Boolean;
  9849. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  9850. VAR op: IntermediateCode.Operand;
  9851. BEGIN
  9852. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  9853. section.Emit(Data(-1,op));
  9854. END Char;
  9855. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  9856. VAR i: LONGINT;
  9857. BEGIN
  9858. Info(section,str);
  9859. i := 0;
  9860. WHILE(str[i] # 0X) DO
  9861. Char(section,str[i]);
  9862. INC(i);
  9863. END;
  9864. Char(section,0X);
  9865. END String;
  9866. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9867. VAR op: IntermediateCode.Operand;
  9868. BEGIN
  9869. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9870. IntermediateCode.SetOffset(op,realOffset);
  9871. section.Emit(Data(-1,op));
  9872. END NamedSymbol;
  9873. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  9874. BEGIN
  9875. IF symbol= NIL THEN
  9876. Address( section, realOffset);
  9877. ASSERT(virtualOffset = 0);
  9878. ELSE
  9879. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  9880. END;
  9881. END Symbol;
  9882. (* OutPointers delivers
  9883. {pointerOffset}
  9884. *)
  9885. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  9886. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  9887. BEGIN
  9888. type := type.resolved;
  9889. IF type IS SyntaxTree.AnyType THEN
  9890. Symbol(section, symbol, 0, (offset ));
  9891. INC(numberPointers);
  9892. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9893. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  9894. Symbol(section, symbol, 0, offset); INC(numberPointers);
  9895. ELSIF type IS SyntaxTree.PointerType THEN
  9896. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  9897. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  9898. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  9899. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  9900. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  9901. ELSIF (type IS SyntaxTree.RecordType) THEN
  9902. (* never treat a record like a pointer, even if the pointer field is set! *)
  9903. WITH type: SyntaxTree.RecordType DO
  9904. base := type.GetBaseRecord();
  9905. IF base # NIL THEN
  9906. Pointers(offset,symbol,section, base,numberPointers);
  9907. END;
  9908. variable := type.recordScope.firstVariable;
  9909. WHILE(variable # NIL) DO
  9910. IF ~(variable.untraced) THEN
  9911. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9912. END;
  9913. variable := variable.nextVariable;
  9914. END;
  9915. END;
  9916. ELSIF (type IS SyntaxTree.CellType) THEN
  9917. WITH type: SyntaxTree.CellType DO
  9918. base := type.GetBaseRecord();
  9919. IF base # NIL THEN
  9920. Pointers(offset,symbol,section, base,numberPointers);
  9921. END;
  9922. variable := type.cellScope.firstVariable;
  9923. WHILE(variable # NIL) DO
  9924. IF ~(variable.untraced) THEN
  9925. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9926. END;
  9927. variable := variable.nextVariable;
  9928. END;
  9929. END;
  9930. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9931. WITH type: SyntaxTree.ArrayType DO
  9932. IF type.form= SyntaxTree.Static THEN
  9933. n := type.staticLength;
  9934. base := type.arrayBase.resolved;
  9935. WHILE(base IS SyntaxTree.ArrayType) DO
  9936. type := base(SyntaxTree.ArrayType);
  9937. n := n* type.staticLength;
  9938. base := type.arrayBase.resolved;
  9939. END;
  9940. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9941. IF SemanticChecker.ContainsPointer(base) THEN
  9942. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9943. FOR i := 0 TO n-1 DO
  9944. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9945. END;
  9946. END;
  9947. ELSE
  9948. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  9949. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9950. END;
  9951. END;
  9952. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9953. WITH type: SyntaxTree.MathArrayType DO
  9954. IF type.form = SyntaxTree.Static THEN
  9955. n := type.staticLength;
  9956. base := type.arrayBase.resolved;
  9957. WHILE(base IS SyntaxTree.MathArrayType) DO
  9958. type := base(SyntaxTree.MathArrayType);
  9959. n := n* type.staticLength;
  9960. base := type.arrayBase.resolved;
  9961. END;
  9962. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9963. IF SemanticChecker.ContainsPointer(base) THEN
  9964. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9965. FOR i := 0 TO n-1 DO
  9966. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9967. END;
  9968. END;
  9969. ELSE
  9970. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  9971. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9972. END
  9973. END;
  9974. (* ELSE no pointers in type *)
  9975. END;
  9976. END Pointers;
  9977. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  9978. VAR position,i: LONGINT; ch: CHAR;
  9979. BEGIN
  9980. IF pool.Has(index) THEN
  9981. RETURN pool.GetInt(index)
  9982. ELSE
  9983. position := source.pc;
  9984. pool.PutInt(index, position);
  9985. Info(source, name);
  9986. i := 0;
  9987. REPEAT
  9988. ch := name[i]; INC(i);
  9989. Char( source, ch);
  9990. UNTIL ch = 0X;
  9991. END;
  9992. RETURN position;
  9993. END EnterDynamicName;
  9994. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  9995. VAR name: Basic.SectionName; position: LONGINT;
  9996. BEGIN
  9997. IF pool.Has(index) THEN
  9998. RETURN pool.GetInt(index)
  9999. ELSE
  10000. StringPool.GetString(index, name);
  10001. position := EnterDynamicName(source,name,index, pool);
  10002. END;
  10003. RETURN position;
  10004. END DynamicName;
  10005. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10006. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10007. BEGIN
  10008. COPY(moduleName,name);
  10009. Strings.Append(name,suffix);
  10010. Basic.ToSegmentedName(name, pooledName);
  10011. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10012. IF implementationVisitor.backend.cooperative THEN
  10013. Info(section, "TypeDescriptor");
  10014. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10015. NamedSymbol(section, pooledName,NIL, 0, 0);
  10016. BasePointer(section);
  10017. offset := 0;
  10018. ELSE
  10019. HeapBlock(mName,typeName,section,2);
  10020. Info(section, "HeapBlock");
  10021. (*
  10022. Symbol(section,section,2,0);
  10023. *)
  10024. Address(section,0); (* empty such that GC does not go on traversing *)
  10025. Info(section, "TypeDescriptor");
  10026. Address(section,0);
  10027. offset := section.pc;
  10028. END;
  10029. RETURN section
  10030. END Block;
  10031. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10032. VAR name: Basic.SegmentedName;
  10033. BEGIN
  10034. Info(source,"ArrayHeader");
  10035. IF implementationVisitor.backend.cooperative THEN
  10036. sizePC := source.pc;
  10037. Address(source,0);
  10038. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10039. IF baseType # "" THEN
  10040. Basic.ToSegmentedName(baseType, name);
  10041. NamedSymbol(source, name,NIL, 0, 0);
  10042. ELSE
  10043. Address(source,0);
  10044. END;
  10045. Address(source,0);
  10046. ELSE
  10047. Address(source,0);
  10048. Address(source,0);
  10049. Address(source,0);
  10050. sizePC := source.pc;
  10051. Address(source,0);
  10052. Info(source,"array data");
  10053. END;
  10054. END Array;
  10055. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10056. BEGIN
  10057. IF implementationVisitor.backend.cooperative THEN
  10058. PatchLongint(section, pc, size);
  10059. PatchLongint(section, pc + 3, size);
  10060. ELSE
  10061. PatchLongint(section, pc, size);
  10062. END;
  10063. END PatchArray;
  10064. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10065. VAR
  10066. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10067. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10068. poolMap: Basic.HashTableInt;
  10069. namePool: IntermediateCode.Section;
  10070. namePoolOffset: LONGINT;
  10071. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10072. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10073. BEGIN
  10074. Basic.SegmentedNameToString(s1.name,n1);
  10075. Basic.SegmentedNameToString(s2.name,n2);
  10076. index := 0;
  10077. ch1 := n1[index];
  10078. ch2 := n2[index];
  10079. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10080. INC(index);
  10081. ch1 := n1[index];
  10082. ch2 := n2[index];
  10083. END;
  10084. RETURN ch1 < ch2;
  10085. END Compare;
  10086. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10087. VAR
  10088. i, j: LONGINT;
  10089. x, t: Sections.Section;
  10090. BEGIN
  10091. IF lo < hi THEN
  10092. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10093. WHILE i <= j DO
  10094. WHILE Compare(list[i], x) DO INC(i) END;
  10095. WHILE Compare(x, list[j]) DO DEC(j) END;
  10096. IF i <= j THEN
  10097. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10098. INC(i); DEC(j)
  10099. END
  10100. END;
  10101. IF lo < j THEN QuickSort(list, lo, j) END;
  10102. IF i < hi THEN QuickSort(list, i, hi) END
  10103. END;
  10104. END QuickSort;
  10105. (*
  10106. ExportDesc* = RECORD
  10107. fp*: ADDRESS;
  10108. name* {UNTRACED}: DynamicName;
  10109. adr*: ADDRESS;
  10110. exports*: LONGINT;
  10111. dsc* {UNTRACED}: ExportArray
  10112. END;
  10113. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10114. *)
  10115. PROCEDURE ExportDesc2(
  10116. source: IntermediateCode.Section;
  10117. namePool: IntermediateCode.Section;
  10118. fingerPrinter: FingerPrinter.FingerPrinter;
  10119. symbol: Sections.Section;
  10120. name: StringPool.Index;
  10121. VAR patchAdr: LONGINT
  10122. ): BOOLEAN;
  10123. VAR fingerPrint: SyntaxTree.FingerPrint;
  10124. BEGIN
  10125. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10126. & (symbol.type # Sections.InlineCodeSection)
  10127. THEN
  10128. *)
  10129. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10130. & (symbol.type # Sections.InlineCodeSection))
  10131. THEN
  10132. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10133. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10134. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10135. Longint(source,fingerPrint.shallow);
  10136. ELSE
  10137. Longint(source, 0);
  10138. END;
  10139. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10140. Symbol(source, symbol,0,0);
  10141. patchAdr := source.pc;
  10142. Address(source,0);
  10143. Address(source,0);
  10144. END;
  10145. RETURN TRUE
  10146. ELSE
  10147. RETURN FALSE
  10148. END;
  10149. END ExportDesc2;
  10150. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10151. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10152. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10153. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10154. TYPE
  10155. Scope = RECORD
  10156. elements: LONGINT;
  10157. gelements: LONGINT;
  10158. section: IntermediateCode.Section;
  10159. patchAdr: LONGINT;
  10160. arraySizePC: LONGINT;
  10161. beginPC: LONGINT; (* current scope start pc *)
  10162. END;
  10163. BEGIN
  10164. Basic.InitSegmentedName(prev);
  10165. olevel := -1;
  10166. scopes[0].section := source;
  10167. FOR s := 0 TO LEN(sections)-1 DO
  10168. symbol := sections[s];
  10169. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10170. this := sections[s].name;
  10171. level := 0;
  10172. WHILE (this[level] > 0) DO
  10173. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10174. INC(level);
  10175. END;
  10176. WHILE level < olevel DO
  10177. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10178. IF olevel > 0 THEN
  10179. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10180. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10181. END;
  10182. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10183. DEC(olevel);
  10184. END;
  10185. IF (this[level] > 0) THEN
  10186. IF level > olevel THEN
  10187. (*TRACE("opening",level); *)
  10188. IF scopes[level].section = NIL THEN
  10189. arrayName := ".@ExportArray";
  10190. Strings.AppendInt(arrayName, level);
  10191. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10192. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10193. END;
  10194. scopes[level].beginPC := scopes[level].section.pc;
  10195. olevel := level;
  10196. scopes[olevel].elements := 0;
  10197. END;
  10198. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10199. sym := sections[s];
  10200. ELSE
  10201. sym := NIL;
  10202. END;
  10203. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10204. THEN
  10205. INC(scopes[olevel].elements);
  10206. END;
  10207. (*StringPool.GetString(this[level], name);*)
  10208. (*TRACE(level, name);*)
  10209. (* enter string in scope *)
  10210. INC(level);
  10211. END;
  10212. END;
  10213. Basic.SegmentedNameToString(this, name);
  10214. (*TRACE(level, "enter", name);*)
  10215. prev := this;
  10216. END;
  10217. END;
  10218. WHILE 0 <= olevel DO
  10219. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10220. IF olevel > 0 THEN
  10221. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10222. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10223. END;
  10224. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10225. DEC(olevel);
  10226. END;
  10227. level := 0;
  10228. WHILE (level < LEN(scopes)) DO
  10229. IF scopes[level].section # NIL THEN
  10230. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10231. END;
  10232. INC(level);
  10233. END;
  10234. END Export;
  10235. BEGIN
  10236. NEW(fingerPrinter, module.system);
  10237. NEW(poolMap, 64);
  10238. (* 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 *)
  10239. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10240. NEW(sectionArray, module.allSections.Length());
  10241. FOR i := 0 TO module.allSections.Length() - 1 DO
  10242. section := module.allSections.GetSection(i);
  10243. sectionArray[i] := section;
  10244. END;
  10245. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10246. Export(sectionArray^);
  10247. END ExportDesc;
  10248. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10249. VAR
  10250. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10251. BEGIN
  10252. Info(source, "exception table offsets array descriptor");
  10253. size := 0;
  10254. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10255. Info(source, "exception table content");
  10256. FOR i := 0 TO module.allSections.Length() - 1 DO
  10257. p := module.allSections.GetSection(i);
  10258. IF p.type = Sections.CodeSection THEN
  10259. finallyPC := p(IntermediateCode.Section).finally;
  10260. IF finallyPC>=0 THEN
  10261. Symbol( source, p, 0,0);
  10262. Symbol( source, p, finallyPC, 0);
  10263. Symbol( source, p, finallyPC,0);
  10264. INC(size);
  10265. END;
  10266. END
  10267. END;
  10268. PatchArray(source,sizePC,size);
  10269. END ExceptionArray;
  10270. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10271. VAR i: LONGINT; ch: CHAR;
  10272. BEGIN
  10273. i := 0;
  10274. REPEAT
  10275. ch := name[i]; INC(i);
  10276. Char( section, ch);
  10277. UNTIL ch = 0X;
  10278. WHILE i < 32 DO
  10279. Char( section, 0X); INC(i);
  10280. END;
  10281. END Name;
  10282. PROCEDURE References(section: IntermediateCode.Section);
  10283. CONST
  10284. rfDirect = 1X; rfIndirect = 3X;
  10285. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10286. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10287. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10288. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10289. rfRecordPointer=1DX;
  10290. rfArrayFlag = 80X;
  10291. VAR
  10292. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10293. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10294. VAR char: CHAR;
  10295. BEGIN
  10296. IF type = NIL THEN char := rfLongint
  10297. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10298. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10299. ELSIF type IS SyntaxTree.CharacterType THEN
  10300. IF type.sizeInBits = 8 THEN char := rfChar8
  10301. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10302. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10303. END;
  10304. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10305. IF type.sizeInBits = 8 THEN char := rfShortint
  10306. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10307. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10308. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10309. END;
  10310. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10311. ELSIF type IS SyntaxTree.FloatType THEN
  10312. IF type.sizeInBits = 32 THEN char := rfReal
  10313. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10314. END;
  10315. ELSIF type IS SyntaxTree.ComplexType THEN
  10316. IF type.sizeInBits = 64 THEN char := rfComplex
  10317. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10318. END;
  10319. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10320. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10321. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10322. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10323. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10324. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10325. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10326. END;
  10327. RETURN char
  10328. END BaseType;
  10329. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10330. VAR destination: Sections.Section;
  10331. BEGIN
  10332. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10333. IF type.pointerType # NIL THEN
  10334. Char(section,rfRecordPointer)
  10335. ELSE
  10336. Char(section,rfRecord);
  10337. END;
  10338. IF destination = NIL THEN
  10339. Longint(section,0);
  10340. ELSE
  10341. Longint(section,destination.offset); (* used for ? *)
  10342. END;
  10343. END RecordType;
  10344. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10345. BEGIN
  10346. baseType := type.arrayBase.resolved;
  10347. IF type.form = SyntaxTree.Static THEN
  10348. IF baseType IS SyntaxTree.ArrayType THEN
  10349. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10350. ELSE
  10351. RETURN type.staticLength
  10352. END
  10353. ELSE
  10354. RETURN 0
  10355. END;
  10356. END StaticArrayLength;
  10357. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10358. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10359. BEGIN
  10360. length := StaticArrayLength(type, baseType);
  10361. char := BaseType(baseType);
  10362. IF type.form # SyntaxTree.Open THEN
  10363. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10364. Longint(section, length)
  10365. ELSE
  10366. length :=0;
  10367. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10368. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10369. Longint(section, length)
  10370. END;
  10371. END ArrayType;
  10372. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10373. BEGIN
  10374. baseType := type.arrayBase;
  10375. IF baseType # NIL THEN
  10376. baseType := baseType.resolved;
  10377. END;
  10378. IF type.form = SyntaxTree.Static THEN
  10379. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10380. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10381. ELSE
  10382. RETURN type.staticLength
  10383. END
  10384. ELSE
  10385. RETURN 0
  10386. END;
  10387. END StaticMathArrayLength;
  10388. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10389. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10390. BEGIN
  10391. length := StaticMathArrayLength(type, baseType);
  10392. char := BaseType(baseType);
  10393. IF type.form = SyntaxTree.Open THEN
  10394. char := BaseType(module.system.addressType);
  10395. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10396. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10397. Longint(section, length)
  10398. ELSIF type.form=SyntaxTree.Tensor THEN
  10399. char := BaseType(module.system.addressType);
  10400. Char(section, CHR(ORD(char)));
  10401. ELSE
  10402. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10403. Longint(section, length)
  10404. END;
  10405. END MathArrayType;
  10406. PROCEDURE Type(type: SyntaxTree.Type);
  10407. BEGIN
  10408. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10409. IF type IS SyntaxTree.BasicType THEN
  10410. Char(section, BaseType(type));
  10411. ELSIF type IS SyntaxTree.RecordType THEN
  10412. RecordType(type(SyntaxTree.RecordType));
  10413. ELSIF type IS SyntaxTree.ArrayType THEN
  10414. ArrayType(type(SyntaxTree.ArrayType))
  10415. ELSIF type IS SyntaxTree.EnumerationType THEN
  10416. Char(section, BaseType(module.system.longintType))
  10417. ELSIF type IS SyntaxTree.PointerType THEN
  10418. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10419. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10420. ELSE
  10421. Char(section, BaseType(type))
  10422. END;
  10423. ELSIF type IS SyntaxTree.ProcedureType THEN
  10424. Char(section, BaseType(type));
  10425. ELSIF type IS SyntaxTree.MathArrayType THEN
  10426. MathArrayType(type(SyntaxTree.MathArrayType));
  10427. ELSIF type IS SyntaxTree.CellType THEN
  10428. Char(section, BaseType(module.system.anyType));
  10429. ELSE HALT(200)
  10430. END;
  10431. END Type;
  10432. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10433. VAR name: ARRAY 256 OF CHAR;
  10434. BEGIN
  10435. IF variable.externalName # NIL THEN RETURN END;
  10436. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10437. variable.GetName(name);
  10438. Type(variable.type);
  10439. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10440. String(section,name);
  10441. END WriteVariable;
  10442. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10443. VAR name: ARRAY 256 OF CHAR;
  10444. BEGIN
  10445. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10446. variable.GetName(name);
  10447. Type(variable.type);
  10448. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10449. variable.GetName(name);
  10450. String(section,name);
  10451. END WriteParameter;
  10452. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10453. BEGIN
  10454. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10455. IF type IS SyntaxTree.ArrayType THEN
  10456. WITH type: SyntaxTree.ArrayType DO
  10457. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10458. ELSE Char(section,rfOpenArray)
  10459. END;
  10460. END
  10461. ELSIF type IS SyntaxTree.MathArrayType THEN
  10462. WITH type: SyntaxTree.MathArrayType DO
  10463. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10464. ELSE Char(section,rfOpenArray)
  10465. END;
  10466. END
  10467. ELSIF type IS SyntaxTree.RecordType THEN
  10468. Char(section,rfRecord);
  10469. ELSE
  10470. Char(section, BaseType(type));
  10471. END;
  10472. END ReturnType;
  10473. PROCEDURE Procedure(s: Sections.Section);
  10474. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10475. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10476. name: ARRAY 256 OF CHAR;
  10477. BEGIN
  10478. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10479. (*procedure.name,name);*)
  10480. Global.GetSymbolNameInScope(procedure,module.module.moduleScope,name);
  10481. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10482. Char(section,0F9X);
  10483. Symbol(section,s,0,0);
  10484. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10485. Longint(section,procedureType.numberParameters);
  10486. ReturnType(procedureType.returnType);
  10487. Longint(section,0); (*! level *)
  10488. Longint(section,0);
  10489. (*
  10490. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10491. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10492. recordName := "";
  10493. IF record.pointerType # NIL THEN
  10494. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10495. ELSE
  10496. DeclarationName(record.typeDeclaration,recordName);
  10497. END;
  10498. i := 0;
  10499. Info(section,recordName);
  10500. WHILE recordName[i] # 0X DO
  10501. Char(section,recordName[i]); INC(i);
  10502. INC(size);
  10503. END;
  10504. Char(section,".");
  10505. INC(size);
  10506. END;
  10507. *)
  10508. String(section,name);
  10509. parameter := procedureType.firstParameter;
  10510. WHILE(parameter # NIL) DO
  10511. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10512. parameter := parameter.nextParameter;
  10513. END;
  10514. variable := procedure.procedureScope.firstVariable;
  10515. WHILE(variable # NIL) DO
  10516. WriteVariable(variable,FALSE);
  10517. variable := variable.nextVariable;
  10518. END;
  10519. END Procedure;
  10520. PROCEDURE Scope(s: Sections.Section);
  10521. BEGIN
  10522. Char(section,0F8X);
  10523. Symbol(section,s,0,0); (* start *)
  10524. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10525. String(section,"$$");
  10526. (* removed variables -- wrongly interpreted by Reflection
  10527. variable := module.module.moduleScope.firstVariable;
  10528. WHILE(variable # NIL) DO
  10529. WriteVariable(variable,FALSE);
  10530. variable := variable.nextVariable;
  10531. END;
  10532. *)
  10533. END Scope;
  10534. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10535. VAR result, i: LONGINT;
  10536. BEGIN
  10537. FOR i := startPC TO endPC -1 DO
  10538. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10539. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10540. END;
  10541. RETURN result;
  10542. END ComputeSize;
  10543. BEGIN
  10544. Array(section,sizePC,"");
  10545. startPC := section.pc;
  10546. Char(section,0FFX); (* sign for trap writer *)
  10547. FOR i := 0 TO module.allSections.Length() - 1 DO
  10548. s := module.allSections.GetSection(i);
  10549. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10550. Scope(s) (*! must be first procedure in ref section *)
  10551. END
  10552. END;
  10553. FOR i := 0 TO module.allSections.Length() - 1 DO
  10554. s := module.allSections.GetSection(i);
  10555. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10556. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10557. Procedure(s)
  10558. END
  10559. END;
  10560. endPC := section.pc;
  10561. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10562. END References;
  10563. (*
  10564. Command* = RECORD
  10565. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10566. name*: Name; (* name of the procedure *)
  10567. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10568. entryAdr* : ADDRESS; (* entry address of procedure *)
  10569. END;
  10570. *)
  10571. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10572. VAR
  10573. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10574. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10575. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  10576. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10577. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10578. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10579. BEGIN
  10580. RETURN
  10581. (type = NIL) OR
  10582. (type.resolved IS SyntaxTree.RecordType) OR
  10583. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10584. (type.resolved IS SyntaxTree.AnyType);
  10585. END TypeAllowed;
  10586. BEGIN
  10587. numberParameters := procedureType.numberParameters;
  10588. RETURN
  10589. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10590. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10591. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10592. END GetProcedureAllowed;
  10593. PROCEDURE WriteType(type : SyntaxTree.Type);
  10594. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10595. name: Basic.SegmentedName; offset: LONGINT;
  10596. BEGIN
  10597. IF type = NIL THEN
  10598. Address(source,0);
  10599. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10600. Address(source,1);
  10601. ELSE
  10602. type := type.resolved;
  10603. IF type IS SyntaxTree.PointerType THEN
  10604. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10605. END;
  10606. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10607. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10608. name[0] := typeDeclaration.name; name[1] := -1;
  10609. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10610. ASSERT(section # NIL);
  10611. ELSE
  10612. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10613. (* TODO *)
  10614. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10615. END;
  10616. IF implementationVisitor.backend.cooperative THEN
  10617. offset := 0;
  10618. ELSE
  10619. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10620. END;
  10621. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10622. END;
  10623. END WriteType;
  10624. BEGIN
  10625. Info(source, "command array descriptor");
  10626. Array(source,sizePC,"Modules.Command");
  10627. numberCommands := 0;
  10628. Info(source, "command array content");
  10629. FOR i := 0 TO module.allSections.Length() - 1 DO
  10630. p := module.allSections.GetSection(i);
  10631. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10632. procedure := p.symbol(SyntaxTree.Procedure);
  10633. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10634. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10635. procedure.GetName(name);
  10636. Name(source,name);
  10637. numberParameters := procedureType.numberParameters;
  10638. (* offset of type of first parameter *)
  10639. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10640. ELSE WriteType(procedureType.firstParameter.type)
  10641. END;
  10642. (* offset of type of return parameter *)
  10643. WriteType(procedureType.returnType);
  10644. (* command name *)
  10645. (* command code offset *)
  10646. Symbol(source,p,0,0);
  10647. INC(numberCommands);
  10648. IF Trace THEN
  10649. D.Ln;
  10650. END;
  10651. END;
  10652. END
  10653. END;
  10654. PatchArray(source,sizePC,numberCommands);
  10655. END CommandArray;
  10656. (* to prevent from double import of different module aliases *)
  10657. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10658. VAR i: SyntaxTree.Import;
  10659. BEGIN
  10660. i := module.module.moduleScope.firstImport;
  10661. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10662. i := i.nextImport;
  10663. END;
  10664. RETURN i = import
  10665. END IsFirstDirectOccurence;
  10666. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10667. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10668. BEGIN
  10669. Array(source,pc,"");
  10670. Info(source, "import module array data");
  10671. IF implementationVisitor.backend.cooperative THEN
  10672. offset := 0;
  10673. ELSE
  10674. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10675. END;
  10676. import := module.module.moduleScope.firstImport;
  10677. numberImports := 0;
  10678. WHILE import # NIL DO
  10679. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10680. Global.GetModuleSegmentedName(import.module,name);
  10681. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10682. NamedSymbol(source, name, NIL, 0, offset);
  10683. INC(numberImports);
  10684. END;
  10685. import := import.nextImport
  10686. END;
  10687. PatchArray(source,pc,numberImports);
  10688. END ImportsArray;
  10689. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10690. VAR
  10691. p: Sections.Section; sizePC, size, i: LONGINT;
  10692. BEGIN
  10693. Info(source, "Type info section");
  10694. size := 0;
  10695. Array(source,sizePC,"Modules.TypeDesc");
  10696. FOR i := 0 TO module.allSections.Length() - 1 DO
  10697. p := module.allSections.GetSection(i);
  10698. WITH p: IntermediateCode.Section DO
  10699. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10700. Symbol(source,p,0,0);
  10701. INC(size);
  10702. END;
  10703. END
  10704. END;
  10705. PatchArray(source,sizePC,size);
  10706. END TypeInfoSection;
  10707. (*
  10708. ProcTableEntry* = RECORD
  10709. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10710. noPtr*: LONGINT;
  10711. END;
  10712. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10713. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10714. *)
  10715. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10716. VAR
  10717. destination: Sections.Section;
  10718. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10719. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10720. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10721. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10722. BEGIN
  10723. Info(procArray,"pcFrom");
  10724. Symbol(procArray,destination,0,0);
  10725. Info(procArray,"pcTo");
  10726. Symbol(procArray,destination,destination.pc,0);
  10727. Info(procArray,"pcStatementBegin");
  10728. Symbol(procArray,destination,destination.validPAFEnter,0);
  10729. Info(procArray,"pcStatementEnd");
  10730. Symbol(procArray,destination,destination.validPAFExit,0);
  10731. IF ~implementationVisitor.backend.cooperative THEN
  10732. Basic.SegmentedNameToString(destination.name, string);
  10733. Info(pointerArray,string);
  10734. procedure := destination.symbol(SyntaxTree.Procedure);
  10735. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10736. variable := procedure.procedureScope.firstVariable;
  10737. WHILE(variable # NIL) DO
  10738. IF ~(variable.untraced) THEN
  10739. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10740. END;
  10741. variable := variable.nextVariable
  10742. END;
  10743. parameter := procedureType.firstParameter;
  10744. WHILE(parameter # NIL) DO
  10745. IF ~(parameter.untraced) THEN
  10746. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10747. END;
  10748. parameter := parameter.nextParameter;
  10749. END;
  10750. END;
  10751. Info(procArray,"numberPointers");
  10752. Longint(procArray,numberPointers);
  10753. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10754. INC(pointerArraySize, numberPointers);
  10755. END PointerOffsets;
  10756. BEGIN
  10757. maxPointers := 0;
  10758. Info(procArray, "proc array descriptor");
  10759. Address(procArray,0);
  10760. Address(procArray,0);
  10761. Address(procArray,0);
  10762. procArraySizePC := procArray.pc;
  10763. Address(procArray,0);
  10764. procArraySize := 0;
  10765. IF ~implementationVisitor.backend.cooperative THEN
  10766. Info(pointerArray, "pointer array descriptor");
  10767. Address(pointerArray,0);
  10768. Address(pointerArray,0);
  10769. Address(pointerArray,0);
  10770. pointerArraySizePC := pointerArray.pc;
  10771. Address(pointerArray,0);
  10772. pointerArraySize := 0;
  10773. END;
  10774. procArraySize := 0;
  10775. FOR i := 0 TO module.allSections.Length() - 1 DO
  10776. destination := module.allSections.GetSection(i);
  10777. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10778. PointerOffsets(destination(IntermediateCode.Section));
  10779. INC(procArraySize);
  10780. END
  10781. END;
  10782. PatchLongint(procArray,procArraySizePC,procArraySize);
  10783. IF ~implementationVisitor.backend.cooperative THEN
  10784. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10785. END;
  10786. END PointersInProcTables;
  10787. (*
  10788. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10789. VAR
  10790. next*: Module; (** once a module is published, all fields are read-only *)
  10791. name*: Name;
  10792. init, published: BOOLEAN;
  10793. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10794. sb*: ADDRESS; <- set to beginning of data section by loader
  10795. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10796. command*: POINTER TO ARRAY OF Command;
  10797. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10798. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10799. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10800. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10801. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10802. data*, code*: Bytes;
  10803. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10804. export*: ExportDesc;
  10805. term*: TerminationHandler;
  10806. exTable*: ExceptionTable;
  10807. noProcs*: LONGINT;
  10808. firstProc*: ADDRESS; <- done by loader
  10809. maxPtrs*: LONGINT;
  10810. crc*: LONGINT;
  10811. *)
  10812. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10813. BEGIN
  10814. Info(section, "cycle");
  10815. Size(section,0);
  10816. Info(section, "references");
  10817. Size(section,0);
  10818. Info(section, "nextMarked");
  10819. Address(section,0);
  10820. Info(section, "nextWatched");
  10821. Address(section,0);
  10822. END BasePointer;
  10823. PROCEDURE BaseObject (section: IntermediateCode.Section);
  10824. BEGIN
  10825. BasePointer(section);
  10826. Info(section, "action");
  10827. Address(section,0);
  10828. Info(section, "monitor");
  10829. Address(section,0);
  10830. END BaseObject;
  10831. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  10832. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  10833. pooledName: Basic.SegmentedName;
  10834. symbol: SyntaxTree.Symbol;
  10835. BEGIN
  10836. Global.GetModuleName(module.module,name);
  10837. Strings.Append(name,".@Module.@Descriptor");
  10838. Basic.ToSegmentedName(name, pooledName);
  10839. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10840. Symbol(section,descriptorSection,0,0);
  10841. Info(descriptorSection, "descriptor");
  10842. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10843. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  10844. Address(descriptorSection,0);
  10845. Global.GetModuleName(module.module,name);
  10846. Strings.Append(name,".@Trace");
  10847. Basic.ToSegmentedName(name, pooledName);
  10848. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10849. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  10850. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10851. END ModuleDescriptor;
  10852. PROCEDURE ModuleSection(): IntermediateCode.Section;
  10853. VAR name: ARRAY 128 OF CHAR;
  10854. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  10855. symbol: SyntaxTree.Symbol;
  10856. BEGIN
  10857. Global.GetModuleName(module.module,name);
  10858. Strings.Append(name,".@Module");
  10859. Basic.ToSegmentedName(name, pooledName);
  10860. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10861. moduleSection.SetExported(TRUE);
  10862. IF moduleSection.pc = 0 THEN
  10863. IF implementationVisitor.backend.cooperative THEN
  10864. Info(moduleSection, "descriptor");
  10865. ModuleDescriptor(moduleSection);
  10866. BaseObject(moduleSection);
  10867. implementationVisitor.CreateTraceModuleMethod(module.module);
  10868. ELSE
  10869. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  10870. Info(moduleSection, "HeapBlock");
  10871. Symbol(moduleSection,moduleSection,2,0);
  10872. Info(moduleSection, "TypeDescriptor");
  10873. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10874. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  10875. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  10876. END;
  10877. END;
  10878. RETURN moduleSection;
  10879. END ModuleSection;
  10880. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  10881. VAR
  10882. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  10883. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  10884. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  10885. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  10886. referenceSectionOffset : LONGINT;
  10887. BEGIN
  10888. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  10889. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  10890. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  10891. ImportsArray(importSection);
  10892. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  10893. CommandArray(commandsSection);
  10894. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  10895. ExceptionArray(exceptionSection);
  10896. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  10897. TypeInfoSection(typeInfoSection);
  10898. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  10899. References(referenceSection);
  10900. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  10901. IF ~implementationVisitor.backend.cooperative THEN
  10902. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  10903. ELSE
  10904. ptrTableSection := NIL;
  10905. END;
  10906. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  10907. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  10908. Array(emptyArraySection,temp,"");
  10909. moduleSection := ModuleSection();
  10910. Info(moduleSection, "nextRoot*: RootObject");
  10911. Address(moduleSection,0);
  10912. Info(moduleSection, "next*: Module");
  10913. Address(moduleSection,0);
  10914. Info(moduleSection, "name*: Name");
  10915. Name(moduleSection,moduleName);
  10916. Info(moduleSection, "init, published: BOOLEAN");
  10917. Boolean(moduleSection,FALSE);
  10918. Boolean(moduleSection,FALSE);
  10919. Info(moduleSection,"filler"); (*! introduce alignment! *)
  10920. Boolean(moduleSection,FALSE);
  10921. Boolean(moduleSection,FALSE);
  10922. Info(moduleSection, "refcnt*: LONGINT");
  10923. Longint(moduleSection,0);
  10924. Info(moduleSection, "sb*: ADDRESS");
  10925. Address(moduleSection,0);
  10926. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  10927. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10928. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  10929. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  10930. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  10931. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  10932. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  10933. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  10934. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  10935. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  10936. Info(moduleSection, "procTable*: ProcTable");
  10937. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  10938. Info(moduleSection, "ptrTable*: PtrTable");
  10939. IF ~implementationVisitor.backend.cooperative THEN
  10940. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  10941. ELSE
  10942. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10943. END;
  10944. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  10945. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10946. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10947. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10948. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  10949. Info(moduleSection, "export*: ExportDesc");
  10950. ExportDesc(moduleSection);
  10951. Info(moduleSection, "term*: TerminationHandler");
  10952. Address(moduleSection,0);
  10953. Info(moduleSection, "exTable*: ExceptionTable");
  10954. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  10955. Info(moduleSection, "noProcs*: LONGINT");
  10956. Longint(moduleSection,numberProcs);
  10957. Info(moduleSection, "firstProc*: ADDRESS");
  10958. Address(moduleSection,0);
  10959. Info(moduleSection, "maxPtrs*: LONGINT");
  10960. Longint(moduleSection,maxPointers);
  10961. Info(moduleSection, "crc*: LONGINT");
  10962. Longint(moduleSection, 0); (*! must be implemented *)
  10963. Info(moduleSection, "body*: ADDRESS");
  10964. Symbol(moduleSection, bodyProc, 0,0);
  10965. IF implementationVisitor.backend.cooperative THEN
  10966. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  10967. Info(moduleSection, "monitor.owner");
  10968. Address(moduleSection,0);
  10969. Info(moduleSection, "monitor.nestingLevel");
  10970. Address(moduleSection,0);
  10971. Info(moduleSection, "monitor.blockedQueue");
  10972. Address(moduleSection,0); Address(moduleSection,0);
  10973. Info(moduleSection, "monitor.waitingQueue");
  10974. Address(moduleSection,0); Address(moduleSection,0);
  10975. Info(moduleSection, "monitor.waitingSentinel");
  10976. Address(moduleSection,0);
  10977. END;
  10978. END Module;
  10979. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  10980. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  10981. BEGIN
  10982. Array(source,pc,"");
  10983. Info(source, "pointer offsets array data");
  10984. IF scope IS SyntaxTree.RecordScope THEN
  10985. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  10986. ELSIF scope IS SyntaxTree.CellScope THEN
  10987. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  10988. ELSIF scope IS SyntaxTree.ModuleScope THEN
  10989. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  10990. WHILE variable # NIL DO
  10991. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  10992. symbol := module.allSections.FindBySymbol(variable);
  10993. ASSERT(symbol # NIL);
  10994. Pointers(0,symbol, source,variable.type,numberPointers);
  10995. END;
  10996. variable := variable.nextVariable;
  10997. END;
  10998. END;
  10999. PatchArray(source,pc,numberPointers);
  11000. END PointerArray;
  11001. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11002. VAR
  11003. name: Basic.SegmentedName;
  11004. section: IntermediateCode.Section;
  11005. BEGIN
  11006. ASSERT(implementationVisitor.newObjectFile);
  11007. Global.GetSymbolSegmentedName(symbol,name);
  11008. Basic.AppendToSegmentedName(name,suffix);
  11009. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11010. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11011. Info(section, "HeapBlock");
  11012. Address(section,0); (* empty such that GC does not go on traversing *)
  11013. Info(section, suffix);
  11014. Address(section,0);
  11015. pc := section.pc;
  11016. RETURN section;
  11017. END SymbolSection;
  11018. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11019. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11020. BEGIN
  11021. ASSERT(implementationVisitor.newObjectFile);
  11022. IF ~ReflectionSupport OR simple THEN variable := NIL
  11023. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11024. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11025. IF type IS SyntaxTree.PointerType THEN
  11026. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11027. END;
  11028. IF type IS SyntaxTree.RecordType THEN
  11029. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11030. ELSIF type IS SyntaxTree.CellType THEN
  11031. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11032. END;
  11033. ELSIF symbol IS SyntaxTree.Procedure THEN
  11034. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11035. END;
  11036. Info(in, "variables");
  11037. IF variable # NIL THEN
  11038. section := SymbolSection(symbol, "@Variables",pc);
  11039. VariableArray(section, variable);
  11040. Symbol(in, section, pc, 0);
  11041. ELSE
  11042. Address(in, 0);
  11043. END;
  11044. END ReflectVariables;
  11045. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11046. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11047. BEGIN
  11048. ASSERT(implementationVisitor.newObjectFile);
  11049. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11050. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11051. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11052. IF type IS SyntaxTree.PointerType THEN
  11053. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11054. END;
  11055. IF type IS SyntaxTree.RecordType THEN
  11056. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11057. ELSIF type IS SyntaxTree.CellType THEN
  11058. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11059. END;
  11060. ELSIF symbol IS SyntaxTree.Procedure THEN
  11061. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11062. END;
  11063. Info(in, "procedures");
  11064. IF procedure # NIL THEN
  11065. section := SymbolSection(symbol, "@Procedures",pc);
  11066. ProcedureArray(section, procedure);
  11067. Symbol(in, section, pc, 0);
  11068. ELSE
  11069. Address(in, 0);
  11070. END;
  11071. END ReflectProcedures;
  11072. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11073. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11074. segmentedName: Basic.SegmentedName;
  11075. td: SyntaxTree.TypeDeclaration;
  11076. type: SyntaxTree.Type;
  11077. BEGIN
  11078. Array(source,pc,"Modules.FieldEntry");
  11079. Info(source, "FieldArray");
  11080. size :=0;
  11081. WHILE variable # NIL DO
  11082. Info(source,"name");
  11083. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11084. type := variable.type.resolved;
  11085. Info(source,"offset");
  11086. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11087. Info(source,"type class");
  11088. IF type IS SyntaxTree.PointerType THEN
  11089. Size(source, 1);
  11090. ELSIF type IS SyntaxTree.RecordType THEN
  11091. Size(source, 2);
  11092. ELSIF type IS SyntaxTree.NumberType THEN
  11093. Size(source, 3);
  11094. ELSE
  11095. Size(source, 0);
  11096. END;
  11097. Info(source, "type desc");
  11098. IF type IS SyntaxTree.RecordType THEN
  11099. td := type(SyntaxTree.RecordType).typeDeclaration;
  11100. Global.GetSymbolSegmentedName(td,segmentedName);
  11101. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11102. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11103. ELSE
  11104. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11105. END;
  11106. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11107. Symbol(source, tir, 0, offset);
  11108. ELSE
  11109. Address(source, 0);
  11110. END;
  11111. Info(source,"flags");
  11112. Set(source, {});
  11113. variable := variable.nextVariable;
  11114. INC(size);
  11115. END;
  11116. PatchArray(source,pc,size);
  11117. END VariableArray;
  11118. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11119. VAR pc: LONGINT; size: LONGINT;
  11120. segmentedName: Basic.SegmentedName;
  11121. BEGIN
  11122. Array(source,pc,"Modules.ProcedureEntry");
  11123. Info(source, "ProcedureArray");
  11124. size :=0;
  11125. WHILE procedure # NIL DO
  11126. Info(source,"name");
  11127. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11128. Global.GetSymbolSegmentedName(procedure, segmentedName);
  11129. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11130. (* size *)
  11131. Size(source, 0);
  11132. (* parameters *)
  11133. Address(source, 0);
  11134. (* variables *)
  11135. ReflectVariables(source, procedure);
  11136. ReflectProcedures(source, procedure);
  11137. (* return type entry *)
  11138. Address(source, 0);
  11139. Address(source, 0);
  11140. procedure := procedure.nextProcedure;
  11141. INC(size);
  11142. END;
  11143. PatchArray(source,pc,size);
  11144. END ProcedureArray;
  11145. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11146. VAR recordType: SyntaxTree.RecordType;
  11147. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11148. section: Sections.Section; cellType: SyntaxTree.CellType;
  11149. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11150. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11151. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11152. sectionName: Basic.SectionName;
  11153. CONST MPO=-40000000H;
  11154. BEGIN
  11155. (*
  11156. TypeDesc* = POINTER TO RECORD
  11157. descSize: LONGINT;
  11158. sentinel: LONGINT; (* = MPO-4 *)
  11159. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11160. flags*: SET;
  11161. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11162. name*: Name;
  11163. END;
  11164. *)
  11165. (* source := module.sections.FindByName(...) *)
  11166. Global.GetSymbolSegmentedName(td,name);
  11167. Basic.AppendToSegmentedName(name,"@Info");
  11168. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11169. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11170. Address(source,MPO-4);
  11171. Info(source, "type tag pointer");
  11172. Symbol( source, tag, offset, 0);
  11173. Info(source, "type flags");
  11174. flags := {};
  11175. IF isProtected THEN INCL(flags,31) END;
  11176. Set( source, flags);
  11177. Info(source, "pointer to module");
  11178. moduleSection := ModuleSection();
  11179. Symbol( source, moduleSection, moduleSection.pc,0);
  11180. Info(source, "type name");
  11181. i := 0;
  11182. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11183. (*
  11184. Global.GetSymbolSegmentedName(td,name);
  11185. Basic.SegmentedNameToString(name, sectionName);
  11186. *)
  11187. Name(source,sectionName);
  11188. source.SetReferenced(FALSE);
  11189. Global.GetSymbolSegmentedName(td,name);
  11190. Basic.AppendToSegmentedName(name,"@Fields");
  11191. ReflectVariables(source, td);
  11192. ReflectProcedures(source, td);
  11193. (*
  11194. fieldSection := VariableArray(
  11195. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11196. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11197. Info(fieldSection, "HeapBlock");
  11198. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11199. Info(fieldSection, "TypeDescriptor");
  11200. Address(fieldSection,0);
  11201. Info(source, "FieldArray ref");
  11202. Symbol(source, fieldSection, fieldSection.pc, 0);
  11203. FieldArray(fieldSection);
  11204. Global.GetSymbolSegmentedName(td,name);
  11205. Basic.AppendToSegmentedName(name,"@Procedures");
  11206. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11207. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11208. Info(fieldSection, "HeapBlock");
  11209. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11210. Info(fieldSection, "TypeDescriptor");
  11211. Address(fieldSection,0);
  11212. Info(source, "Procedure Array ref");
  11213. Symbol(source, fieldSection, fieldSection.pc, 0);
  11214. ProcedureArray(fieldSection);
  11215. *)
  11216. RETURN source;
  11217. END NewTypeDescriptorInfo;
  11218. PROCEDURE NewTypeDescriptor;
  11219. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11220. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11221. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11222. numberPointers: LONGINT; padding, i: LONGINT;
  11223. CONST MPO=-40000000H;
  11224. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11225. VAR i: LONGINT;
  11226. PROCEDURE Td(record: SyntaxTree.RecordType);
  11227. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11228. BEGIN
  11229. IF record # NIL THEN
  11230. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11231. baseTD := record.typeDeclaration;
  11232. Global.GetSymbolSegmentedName(baseTD,name);
  11233. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11234. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11235. ELSE
  11236. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11237. END;
  11238. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11239. Symbol(source, tir, 0, offset);
  11240. IF reverse THEN Td(record.GetBaseRecord()) END;
  11241. END;
  11242. END Td;
  11243. BEGIN
  11244. Info(source, "tag table");
  11245. baseRecord := recordType;
  11246. i := 0;
  11247. WHILE baseRecord # NIL DO
  11248. INC(i);
  11249. baseRecord := baseRecord.GetBaseRecord();
  11250. END;
  11251. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11252. IF ~reverse THEN Td(recordType) END;
  11253. WHILE i < size DO
  11254. Address(source,0);
  11255. INC(i);
  11256. END;
  11257. IF reverse THEN Td(recordType) END;
  11258. END TdTable;
  11259. PROCEDURE MethodTable(reverse: BOOLEAN);
  11260. VAR i,methods: LONGINT;
  11261. BEGIN
  11262. Info(source, "method table");
  11263. IF recordType # NIL THEN
  11264. methods := recordType.recordScope.numberMethods;
  11265. IF reverse THEN
  11266. FOR i := methods-1 TO 0 BY -1 DO
  11267. procedure := recordType.recordScope.FindMethod(i);
  11268. Global.GetSymbolSegmentedName(procedure, name);
  11269. NamedSymbol(source, name,procedure, 0,0);
  11270. END;
  11271. ELSE
  11272. FOR i := 0 TO methods-1 DO
  11273. procedure := recordType.recordScope.FindMethod(i);
  11274. Global.GetSymbolSegmentedName(procedure, name);
  11275. NamedSymbol(source, name,procedure, 0,0);
  11276. END;
  11277. END;
  11278. END;
  11279. END MethodTable;
  11280. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11281. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11282. BEGIN
  11283. Info(source, "method table");
  11284. baseRecord := recordType;
  11285. WHILE baseRecord.baseType # NIL DO
  11286. baseRecord := baseRecord.GetBaseRecord ();
  11287. END;
  11288. GetRecordTypeName (baseRecord, name);
  11289. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11290. IF name = stackFrame THEN
  11291. start := 0;
  11292. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11293. baseRecord := recordType;
  11294. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11295. baseRecord := baseRecord.GetBaseRecord ();
  11296. END;
  11297. IF baseRecord # NIL THEN
  11298. GetRecordTypeName (baseRecord, name);
  11299. IF pointer & ~baseRecord.isObject THEN
  11300. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11301. END;
  11302. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11303. ELSIF recordType.isObject THEN
  11304. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11305. ELSIF pointer THEN
  11306. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11307. ELSE
  11308. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11309. END;
  11310. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11311. Symbol(source, tir, 0, 0);
  11312. start := 0;
  11313. baseRecord := recordType;
  11314. WHILE (baseRecord # NIL) DO
  11315. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11316. baseRecord := baseRecord.GetBaseRecord ();
  11317. END;
  11318. ELSE
  11319. (* explicit trace method: *)
  11320. procedure := recordType.recordScope.FindMethod(0);
  11321. IF ~procedure.isFinalizer THEN
  11322. Global.GetSymbolSegmentedName(procedure, name);
  11323. NamedSymbol(source, name,procedure, 0,0);
  11324. END;
  11325. start := 1;
  11326. END;
  11327. IF (name # stackFrame) & recordType.isObject THEN
  11328. baseRecord := recordType;
  11329. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11330. baseRecord := baseRecord.GetBaseRecord ();
  11331. END;
  11332. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11333. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11334. ELSE
  11335. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11336. END;
  11337. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11338. Symbol(source, tir, 0, 0);
  11339. END;
  11340. methods := recordType.recordScope.numberMethods;
  11341. FOR i := start TO methods-1 DO
  11342. procedure := recordType.recordScope.FindMethod(i);
  11343. IF ~procedure.isFinalizer THEN
  11344. Global.GetSymbolSegmentedName(procedure, name);
  11345. NamedSymbol(source, name,procedure, 0,0);
  11346. END;
  11347. END;
  11348. END CooperativeMethodTable;
  11349. BEGIN
  11350. Global.GetSymbolSegmentedName(td,name);
  11351. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11352. source.SetExported(IsExported(td));
  11353. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11354. IF implementationVisitor.backend.cooperative THEN
  11355. base := NIL;
  11356. baseRecord := recordType.GetBaseRecord();
  11357. IF baseRecord # NIL THEN
  11358. baseTD := baseRecord.typeDeclaration;
  11359. END;
  11360. IF ~recordType.isObject THEN
  11361. Info(source, "parent");
  11362. IF baseRecord # NIL THEN
  11363. Global.GetSymbolSegmentedName(baseTD,name);
  11364. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11365. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11366. ELSE
  11367. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11368. END;
  11369. Symbol(source, tir, 0, 0);
  11370. ELSE
  11371. Address(source,0);
  11372. END;
  11373. Info(source, "record size");
  11374. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11375. source.SetReferenced(FALSE);
  11376. CooperativeMethodTable(FALSE);
  11377. base := source;
  11378. Global.GetSymbolSegmentedName(td,name);
  11379. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11380. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11381. source.SetExported(IsExported(td));
  11382. source.SetReferenced(FALSE);
  11383. END;
  11384. Info(source, "parent");
  11385. IF baseRecord # NIL THEN
  11386. Global.GetSymbolSegmentedName(baseTD,name);
  11387. sym := baseTD;
  11388. IF ~recordType.isObject THEN
  11389. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11390. sym := NIL;
  11391. END;
  11392. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11393. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11394. ELSE
  11395. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11396. END;
  11397. Symbol(source, tir, 0, 0);
  11398. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11399. Address(source,0);
  11400. ELSE
  11401. IF recordType.isObject THEN
  11402. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11403. ELSE
  11404. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11405. END;
  11406. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11407. Symbol(source, tir, 0, 0);
  11408. END;
  11409. Info(source, "base record descriptor");
  11410. Symbol(source, base, 0, 0);
  11411. CooperativeMethodTable(TRUE);
  11412. source.SetReferenced(FALSE);
  11413. IF recordType.hasPointers THEN
  11414. IF ~HasExplicitTraceMethod (recordType) THEN
  11415. implementationVisitor.CreateTraceMethod(recordType);
  11416. END;
  11417. implementationVisitor.CreateResetProcedure(recordType);
  11418. implementationVisitor.CreateAssignProcedure(recordType);
  11419. END;
  11420. ELSIF ~simple THEN
  11421. (*
  11422. MethodEnd = MPO
  11423. ---
  11424. methods (# methods)
  11425. ---
  11426. tags (16)
  11427. ---
  11428. TypeDesc = TypeInfoAdr
  11429. ---
  11430. td adr ---> rec size
  11431. ----
  11432. pointer offsets
  11433. ----
  11434. (padding)
  11435. -----
  11436. empty [2 addresses aligned]
  11437. empty
  11438. empty
  11439. numPtrs
  11440. ---
  11441. pointer offsets
  11442. ---
  11443. *)
  11444. Info(source, "MethodEnd = MPO");
  11445. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11446. source(IntermediateCode.Section).Emit(Data(-1,op));
  11447. MethodTable(TRUE);
  11448. TdTable(TypeTags, TRUE);
  11449. Info(source, "type descriptor info pointer");
  11450. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11451. IF (cellType # NIL) THEN
  11452. IF cellType.sizeInBits < 0 THEN
  11453. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11454. END;
  11455. Info(source, "cell size");
  11456. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11457. ELSE
  11458. Info(source, "record size");
  11459. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11460. END;
  11461. Info(source, "pointer offsets pointer");
  11462. padding := 1- source.pc MOD 2;
  11463. Symbol(source, source, source.pc+1+padding,0);
  11464. IF padding >0 THEN
  11465. Info(source, "padding");
  11466. FOR i := 1 TO padding DO Address(source,0) END;
  11467. END;
  11468. IF cellType # NIL THEN
  11469. PointerArray(source, cellType.cellScope, numberPointers);
  11470. ELSE
  11471. PointerArray(source, recordType.recordScope, numberPointers);
  11472. END;
  11473. ELSE
  11474. (*
  11475. simple:
  11476. td adr --> size
  11477. tag(1)
  11478. tag(2)
  11479. tag(3)
  11480. methods ->
  11481. *)
  11482. Info(source, "record size");
  11483. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11484. TdTable(TypeTags, FALSE);
  11485. MethodTable(FALSE);
  11486. source.SetReferenced(FALSE);
  11487. END;
  11488. END NewTypeDescriptor;
  11489. BEGIN
  11490. x := x.resolved;
  11491. IF (x IS SyntaxTree.PointerType) THEN
  11492. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11493. END;
  11494. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11495. recordType := x(SyntaxTree.RecordType);
  11496. td := x.typeDeclaration;
  11497. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11498. ASSERT(td # NIL);
  11499. section := module.allSections.FindBySymbol(td); (* TODO *)
  11500. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11501. IF implementationVisitor.newObjectFile THEN
  11502. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11503. NewTypeDescriptor
  11504. END;
  11505. ELSE
  11506. (* data section in intermediate code *)
  11507. Global.GetSymbolSegmentedName(td,name);
  11508. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11509. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11510. tir.Emit(Data(-1,op));
  11511. END;
  11512. END;
  11513. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11514. cellType := x(SyntaxTree.CellType);
  11515. td := x.typeDeclaration;
  11516. section := module.allSections.FindBySymbol(td); (* TODO *)
  11517. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11518. IF implementationVisitor.newObjectFile THEN
  11519. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11520. NewTypeDescriptor
  11521. END;
  11522. END;
  11523. END;
  11524. END
  11525. END CheckTypeDeclaration
  11526. END MetaDataGenerator;
  11527. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11528. VAR
  11529. trace-: BOOLEAN;
  11530. traceString-: SyntaxTree.IdentifierString;
  11531. traceModuleName-: SyntaxTree.IdentifierString;
  11532. newObjectFile-: BOOLEAN;
  11533. profile-: BOOLEAN;
  11534. noRuntimeChecks: BOOLEAN;
  11535. simpleMetaData-: BOOLEAN;
  11536. noAsserts: BOOLEAN;
  11537. optimize-: BOOLEAN;
  11538. cooperative-: BOOLEAN;
  11539. preregisterStatic-: BOOLEAN;
  11540. dump-: Basic.Writer;
  11541. cellsAreObjects: BOOLEAN;
  11542. PROCEDURE &InitIntermediateBackend*;
  11543. BEGIN
  11544. simpleMetaData := FALSE;
  11545. newObjectFile := FALSE;
  11546. InitBackend;
  11547. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11548. SetTraceModuleName(DefaultTraceModuleName);
  11549. END InitIntermediateBackend;
  11550. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11551. VAR
  11552. declarationVisitor: DeclarationVisitor;
  11553. implementationVisitor: ImplementationVisitor;
  11554. module: Sections.Module;
  11555. name, platformName: SyntaxTree.IdentifierString;
  11556. meta: MetaDataGenerator;
  11557. BEGIN
  11558. ResetError;
  11559. Global.GetSymbolName(x,name);
  11560. NEW(module,x,system); (* backend structures *)
  11561. Global.GetModuleName(x, name);
  11562. module.SetModuleName(name);
  11563. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11564. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11565. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11566. declarationVisitor.Module(x,module);
  11567. IF newObjectFile & ~meta.simple THEN
  11568. meta.Module(implementationVisitor.moduleBodySection);
  11569. END;
  11570. GetDescription(platformName);
  11571. module.SetPlatformName(platformName);
  11572. RETURN module
  11573. END GenerateIntermediate;
  11574. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11575. BEGIN RETURN TRUE
  11576. END SupportedImmediate;
  11577. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11578. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11579. END ProcessSyntaxTreeModule;
  11580. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11581. VAR
  11582. result: Sections.Module;
  11583. traceName: Basic.MessageString;
  11584. BEGIN
  11585. ASSERT(intermediateCodeModule IS Sections.Module);
  11586. result := intermediateCodeModule(Sections.Module);
  11587. IF trace THEN
  11588. traceName := "intermediate code trace: ";
  11589. Strings.Append(traceName,traceString);
  11590. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11591. IF (traceString="") OR (traceString="*") THEN
  11592. result.Dump(dump);
  11593. dump.Update
  11594. ELSE
  11595. Sections.DumpFiltered(dump, result, traceString);
  11596. END
  11597. END;
  11598. RETURN result
  11599. END ProcessIntermediateCodeModule;
  11600. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11601. BEGIN instructionSet := "Intermediate";
  11602. END GetDescription;
  11603. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11604. BEGIN
  11605. SELF.newObjectFile := newObjectFile;
  11606. SELF.simpleMetaData := simpleMetaData;
  11607. END SetNewObjectFile;
  11608. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11609. BEGIN COPY(name, traceModuleName)
  11610. END SetTraceModuleName;
  11611. PROCEDURE DefineOptions(options: Options.Options);
  11612. BEGIN
  11613. DefineOptions^(options);
  11614. options.Add(0X,"trace",Options.String);
  11615. options.Add(0X,"runtime",Options.String);
  11616. options.Add(0X,"newObjectFile",Options.Flag);
  11617. options.Add(0X,"traceModule",Options.String);
  11618. options.Add(0X,"profile",Options.Flag);
  11619. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11620. options.Add(0X,"noAsserts",Options.Flag);
  11621. options.Add(0X,"metaData",Options.String);
  11622. options.Add('o',"optimize", Options.Flag);
  11623. options.Add(0X,"preregisterStatic", Options.Flag);
  11624. options.Add(0X,"cellsAreObjects", Options.Flag);
  11625. END DefineOptions;
  11626. PROCEDURE GetOptions(options: Options.Options);
  11627. VAR name,string: SyntaxTree.IdentifierString;
  11628. BEGIN
  11629. GetOptions^(options);
  11630. trace := options.GetString("trace",traceString);
  11631. profile := options.GetFlag("profile");
  11632. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11633. noAsserts := options.GetFlag("noAsserts");
  11634. cooperative := options.GetFlag("cooperative");
  11635. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11636. IF cooperative THEN
  11637. SetRuntimeModuleName("CPU") END
  11638. END;
  11639. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11640. simpleMetaData := TRUE
  11641. END;
  11642. IF options.GetString("metaData",string) THEN
  11643. IF string = "simple" THEN simpleMetaData := TRUE
  11644. ELSIF string ="full" THEN simpleMetaData := FALSE
  11645. END;
  11646. END;
  11647. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11648. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11649. optimize := options.GetFlag("optimize");
  11650. preregisterStatic := options.GetFlag("preregisterStatic");
  11651. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11652. END GetOptions;
  11653. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11654. BEGIN RETURN SymbolFileFormat.Get()
  11655. END DefaultSymbolFileFormat;
  11656. END IntermediateBackend;
  11657. (* ----------------------------------- register allocation ------------------------------------- *)
  11658. (* register mapping scheme
  11659. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11660. spill offset
  11661. part(n) --> ticket <--> physical register
  11662. spill offset
  11663. *)
  11664. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11665. emptyOperand: IntermediateCode.Operand;
  11666. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11667. statCoopResetVariables: LONGINT;
  11668. statCoopModifyAssignments: LONGINT;
  11669. modifyAssignmentsPC : LONGINT;
  11670. statCoopNilCheck: LONGINT;
  11671. statCoopSwitch: LONGINT;
  11672. statCoopAssignProcedure: LONGINT;
  11673. statCoopTraceMethod: LONGINT;
  11674. statCoopResetProcedure: LONGINT;
  11675. statCoopTraceModule: LONGINT;
  11676. PROCEDURE ResetStatistics*;
  11677. BEGIN
  11678. statCoopResetVariables := 0;
  11679. statCoopModifyAssignments := 0;
  11680. statCoopNilCheck:= 0;
  11681. statCoopSwitch:= 0;
  11682. statCoopAssignProcedure:= 0;
  11683. statCoopTraceMethod:= 0;
  11684. statCoopResetProcedure:= 0;
  11685. statCoopTraceModule:= 0;
  11686. END ResetStatistics;
  11687. PROCEDURE Statistics*;
  11688. BEGIN
  11689. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11690. TRACE(statCoopNilCheck, statCoopSwitch);
  11691. TRACE(statCoopAssignProcedure,
  11692. statCoopTraceMethod,
  11693. statCoopResetProcedure,
  11694. statCoopTraceModule)
  11695. END Statistics;
  11696. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11697. VAR h: LONGINT;
  11698. BEGIN
  11699. WHILE b # 0 DO
  11700. h := a MOD b;
  11701. a := b;
  11702. b := h;
  11703. END;
  11704. RETURN a
  11705. END GCD;
  11706. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11707. BEGIN
  11708. RETURN a*b DIV GCD(a,b)
  11709. END SCM;
  11710. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11711. BEGIN
  11712. (*TRACE(a,b);*)
  11713. IF a = 0 THEN RETURN b
  11714. ELSIF b = 0 THEN RETURN a
  11715. ELSE RETURN SCM(a,b)
  11716. END;
  11717. END CommonAlignment;
  11718. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11719. BEGIN
  11720. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11721. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11722. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11723. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11724. 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)
  11725. END
  11726. END PassBySingleReference;
  11727. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11728. BEGIN
  11729. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11730. END PassInRegister;
  11731. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11732. VAR new: RegisterEntry;
  11733. BEGIN
  11734. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11735. IF queue = NIL THEN
  11736. queue := new
  11737. ELSE
  11738. new.next := queue;
  11739. IF queue#NIL THEN queue.prev := new END;
  11740. queue := new
  11741. END;
  11742. END AddRegisterEntry;
  11743. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11744. VAR this: RegisterEntry;
  11745. BEGIN
  11746. this := queue;
  11747. WHILE (this # NIL) & (this.register # register) DO
  11748. this := this.next;
  11749. END;
  11750. IF this = NIL THEN
  11751. RETURN FALSE
  11752. END;
  11753. ASSERT(this # NIL);
  11754. IF this = queue THEN queue := queue.next END;
  11755. IF this.prev # NIL THEN this.prev.next := this.next END;
  11756. IF this.next # NIL THEN this.next.prev := this.prev END;
  11757. RETURN TRUE
  11758. END RemoveRegisterEntry;
  11759. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11760. BEGIN ASSERT(cond);
  11761. END Assert;
  11762. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11763. BEGIN
  11764. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11765. END ReusableRegister;
  11766. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11767. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11768. BEGIN
  11769. procedure := moduleScope.bodyProcedure;
  11770. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11771. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11772. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11773. procedure.SetScope(moduleScope);
  11774. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11775. procedure.SetAccess(SyntaxTree.Hidden);
  11776. moduleScope.SetBodyProcedure(procedure);
  11777. moduleScope.AddProcedure(procedure);
  11778. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11779. END;
  11780. END EnsureBodyProcedure;
  11781. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11782. VAR import: SyntaxTree.Import;
  11783. selfName: SyntaxTree.IdentifierString;
  11784. module: SyntaxTree.Module;
  11785. BEGIN
  11786. scope.ownerModule.GetName(selfName);
  11787. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11788. module := scope.ownerModule
  11789. ELSE
  11790. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11791. IF import = NIL THEN
  11792. RETURN NIL
  11793. ELSIF import.module = NIL THEN
  11794. RETURN NIL
  11795. ELSE module := import.module
  11796. END;
  11797. END;
  11798. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11799. END GetSymbol;
  11800. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11801. BEGIN
  11802. op.mode := mode;
  11803. IntermediateCode.InitOperand(op.op);
  11804. IntermediateCode.InitOperand(op.tag);
  11805. IntermediateCode.InitOperand(op.extra);
  11806. op.dimOffset := 0;
  11807. END InitOperand;
  11808. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11809. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11810. BEGIN RETURN IntermediateCode.GetType(system, type)
  11811. END GetType;
  11812. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11813. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11814. BEGIN
  11815. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  11816. (*
  11817. UniqueId(name,module,name,adr);
  11818. *)
  11819. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  11820. constant.SetValue(value);
  11821. module.moduleScope.AddConstant(constant);
  11822. constant.SetScope(module.moduleScope);
  11823. RETURN constant
  11824. END BuildConstant;
  11825. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11826. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  11827. BEGIN
  11828. variable := scope.firstVariable;
  11829. WHILE variable # NIL DO
  11830. IF variable.NeedsTrace() THEN
  11831. RETURN TRUE;
  11832. END;
  11833. variable := variable.nextVariable;
  11834. END;
  11835. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11836. WHILE parameter # NIL DO
  11837. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11838. RETURN TRUE;
  11839. END;
  11840. parameter := parameter.nextParameter;
  11841. END;
  11842. RETURN FALSE;
  11843. END HasPointers;
  11844. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  11845. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  11846. END IsVariableParameter;
  11847. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11848. VAR parameter: SyntaxTree.Parameter;
  11849. BEGIN
  11850. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11851. WHILE parameter # NIL DO
  11852. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  11853. IF parameter.movable THEN RETURN TRUE END;
  11854. parameter := parameter.nextParameter;
  11855. END;
  11856. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  11857. END HasVariableParameters;
  11858. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  11859. BEGIN
  11860. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  11861. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  11862. END HasExplicitTraceMethod;
  11863. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  11864. BEGIN
  11865. IF expression.resolved # NIL THEN expression := expression.resolved END;
  11866. IF (expression IS SyntaxTree.IntegerValue) THEN
  11867. val := expression(SyntaxTree.IntegerValue).value;
  11868. RETURN TRUE
  11869. ELSE
  11870. RETURN FALSE
  11871. END;
  11872. END IsIntegerConstant;
  11873. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  11874. BEGIN
  11875. IF val <= 0 THEN RETURN FALSE END;
  11876. exp := 0;
  11877. WHILE ~ODD(val) DO
  11878. val := val DIV 2;
  11879. INC(exp)
  11880. END;
  11881. RETURN val = 1
  11882. END PowerOf2;
  11883. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  11884. VAR procedure: SyntaxTree.Procedure;
  11885. BEGIN
  11886. procedure := record.recordScope.constructor;
  11887. IF procedure = NIL THEN
  11888. record := record.GetBaseRecord();
  11889. IF record # NIL THEN
  11890. procedure := GetConstructor(record)
  11891. END;
  11892. END;
  11893. RETURN procedure;
  11894. END GetConstructor;
  11895. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  11896. BEGIN
  11897. value := SHORT(op.intValue);
  11898. RETURN op.mode = IntermediateCode.ModeImmediate;
  11899. END IsIntegerImmediate;
  11900. (** whether a type strictily is a pointer to record or object type
  11901. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  11902. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  11903. BEGIN
  11904. IF type = NIL THEN
  11905. RETURN FALSE
  11906. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  11907. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  11908. ELSE
  11909. RETURN FALSE
  11910. END
  11911. END IsStrictlyPointerToRecord;
  11912. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  11913. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  11914. END IsUnsafePointer;
  11915. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  11916. BEGIN type := type.resolved;
  11917. IF type IS SyntaxTree.PointerType THEN
  11918. type := type(SyntaxTree.PointerType).pointerBase;
  11919. type := type.resolved;
  11920. IF type IS SyntaxTree.RecordType THEN
  11921. recordType := type(SyntaxTree.RecordType);
  11922. RETURN TRUE
  11923. ELSE
  11924. RETURN FALSE
  11925. END
  11926. ELSIF type IS SyntaxTree.RecordType THEN
  11927. recordType := type(SyntaxTree.RecordType);
  11928. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  11929. ELSIF type IS SyntaxTree.ObjectType THEN
  11930. RETURN TRUE
  11931. ELSIF type IS SyntaxTree.AnyType THEN
  11932. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  11933. ELSE
  11934. RETURN FALSE
  11935. END;
  11936. END IsPointerToRecord;
  11937. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  11938. BEGIN
  11939. type := type.resolved;
  11940. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  11941. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  11942. END IsArrayOfSystemByte;
  11943. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  11944. BEGIN
  11945. IF type = NIL THEN RETURN FALSE END;
  11946. type := type.resolved;
  11947. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  11948. END IsOpenArray;
  11949. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  11950. BEGIN
  11951. IF type = NIL THEN RETURN FALSE END;
  11952. type := type.resolved;
  11953. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  11954. END IsSemiDynamicArray;
  11955. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  11956. BEGIN
  11957. IF type = NIL THEN RETURN FALSE END;
  11958. type := type.resolved;
  11959. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  11960. END IsStaticArray;
  11961. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  11962. VAR size: LONGINT;
  11963. BEGIN
  11964. size := 1;
  11965. WHILE (IsStaticArray(type)) DO
  11966. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  11967. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11968. END;
  11969. RETURN size;
  11970. END StaticArrayNumElements;
  11971. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11972. BEGIN
  11973. WHILE (IsStaticArray(type)) DO
  11974. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11975. END;
  11976. RETURN type;
  11977. END StaticArrayBaseType;
  11978. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11979. BEGIN
  11980. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  11981. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11982. END;
  11983. RETURN type;
  11984. END ArrayBaseType;
  11985. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  11986. BEGIN
  11987. IF type = NIL THEN RETURN FALSE END;
  11988. type := type.resolved;
  11989. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  11990. END IsDelegate;
  11991. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  11992. VAR i: LONGINT;
  11993. BEGIN
  11994. i := 0; type := type.resolved;
  11995. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  11996. INC(i);
  11997. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  11998. END;
  11999. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12000. INC(i);
  12001. type := type(SyntaxTree.MathArrayType).arrayBase;
  12002. IF type # NIL THEN type := type.resolved END;
  12003. END;
  12004. RETURN i
  12005. END DynamicDim;
  12006. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12007. BEGIN
  12008. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12009. type := type(SyntaxTree.ArrayType).arrayBase;
  12010. END;
  12011. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12012. type := type(SyntaxTree.MathArrayType).arrayBase;
  12013. END;
  12014. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12015. END StaticSize;
  12016. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12017. BEGIN
  12018. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12019. END IsImmediate;
  12020. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12021. BEGIN
  12022. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12023. END IsAddress;
  12024. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12025. BEGIN
  12026. RETURN (x.mode = IntermediateCode.ModeRegister);
  12027. END IsRegister;
  12028. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12029. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12030. BEGIN
  12031. typeDeclaration := recordType.typeDeclaration;
  12032. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12033. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12034. END GetRecordTypeName;
  12035. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12036. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12037. BEGIN
  12038. parSize := 0;
  12039. IF StructuredReturnType(procedureType) THEN
  12040. parameter := procedureType.returnParameter;
  12041. INC(parSize,system.SizeOfParameter(parameter));
  12042. parSize := parSize + (-parSize) MOD system.addressSize;
  12043. END;
  12044. parameter :=procedureType.lastParameter;
  12045. WHILE (parameter # NIL) DO
  12046. INC(parSize,system.SizeOfParameter(parameter));
  12047. parSize := parSize + (-parSize) MOD system.addressSize;
  12048. parameter := parameter.prevParameter;
  12049. END;
  12050. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12051. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12052. RETURN ToMemoryUnits(system,parSize)
  12053. END ParametersSize;
  12054. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12055. BEGIN
  12056. IF type = NIL THEN RETURN FALSE
  12057. ELSE
  12058. type := type.resolved;
  12059. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12060. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12061. END
  12062. END ReturnedAsParameter;
  12063. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12064. BEGIN
  12065. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12066. END StructuredReturnType;
  12067. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12068. BEGIN
  12069. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12070. END IsNested;
  12071. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12072. BEGIN
  12073. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12074. scope := scope.outerScope;
  12075. END;
  12076. RETURN scope # NIL;
  12077. END InCellScope;
  12078. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12079. BEGIN
  12080. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12081. RETURN 0
  12082. ELSE
  12083. *)
  12084. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12085. (*END;*)
  12086. END ProcedureParametersSize;
  12087. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12088. VAR dataUnit: LONGINT;
  12089. BEGIN dataUnit := system.dataUnit;
  12090. ASSERT(size MOD system.dataUnit = 0);
  12091. RETURN size DIV system.dataUnit
  12092. END ToMemoryUnits;
  12093. PROCEDURE Get*(): Backend.Backend;
  12094. VAR backend: IntermediateBackend;
  12095. BEGIN NEW(backend); RETURN backend
  12096. END Get;
  12097. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12098. VAR instruction: IntermediateCode.Instruction;
  12099. BEGIN
  12100. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12101. RETURN instruction
  12102. END Nop;
  12103. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12104. VAR instruction: IntermediateCode.Instruction;
  12105. BEGIN
  12106. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12107. RETURN instruction
  12108. END Mov;
  12109. (* like Mov but ensures that no new register will be allocated for dest *)
  12110. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12111. VAR instruction: IntermediateCode.Instruction;
  12112. BEGIN
  12113. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12114. RETURN instruction
  12115. END MovReplace;
  12116. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12117. VAR instruction: IntermediateCode.Instruction;
  12118. BEGIN
  12119. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12120. RETURN instruction
  12121. END Conv;
  12122. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12123. VAR instruction: IntermediateCode.Instruction;
  12124. BEGIN
  12125. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12126. RETURN instruction
  12127. END Call;
  12128. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12129. VAR op1, op2: IntermediateCode.Operand;
  12130. VAR instruction: IntermediateCode.Instruction;
  12131. BEGIN
  12132. IntermediateCode.InitNumber(op1,pcOffset);
  12133. IntermediateCode.InitNumber(op2,callingConvention);
  12134. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12135. RETURN instruction
  12136. END Exit;
  12137. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12138. VAR instruction: IntermediateCode.Instruction;
  12139. BEGIN
  12140. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12141. RETURN instruction
  12142. END Return;
  12143. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12144. VAR instruction: IntermediateCode.Instruction;
  12145. BEGIN
  12146. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12147. RETURN instruction
  12148. END Result;
  12149. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12150. VAR op1: IntermediateCode.Operand;
  12151. VAR instruction: IntermediateCode.Instruction;
  12152. BEGIN
  12153. IntermediateCode.InitNumber(op1,nr);
  12154. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12155. RETURN instruction
  12156. END Trap;
  12157. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12158. VAR instruction: IntermediateCode.Instruction;
  12159. BEGIN
  12160. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12161. RETURN instruction
  12162. END Br;
  12163. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12164. VAR instruction: IntermediateCode.Instruction;
  12165. BEGIN
  12166. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12167. RETURN instruction
  12168. END Breq;
  12169. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12170. VAR instruction: IntermediateCode.Instruction;
  12171. BEGIN
  12172. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12173. RETURN instruction
  12174. END Brne;
  12175. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12176. VAR instruction: IntermediateCode.Instruction;
  12177. BEGIN
  12178. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12179. RETURN instruction
  12180. END Brge;
  12181. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12182. VAR instruction: IntermediateCode.Instruction;
  12183. BEGIN
  12184. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12185. RETURN instruction
  12186. END Brlt;
  12187. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12188. VAR instruction: IntermediateCode.Instruction;
  12189. BEGIN
  12190. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12191. RETURN instruction
  12192. END Pop;
  12193. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12194. VAR instruction: IntermediateCode.Instruction;
  12195. BEGIN
  12196. ASSERT(op.mode # IntermediateCode.Undefined);
  12197. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12198. RETURN instruction
  12199. END Push;
  12200. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12201. VAR instruction: IntermediateCode.Instruction;
  12202. BEGIN
  12203. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12204. RETURN instruction
  12205. END Neg;
  12206. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12207. VAR instruction: IntermediateCode.Instruction;
  12208. BEGIN
  12209. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12210. RETURN instruction
  12211. END Not;
  12212. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12213. VAR instruction: IntermediateCode.Instruction;
  12214. BEGIN
  12215. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12216. RETURN instruction
  12217. END Abs;
  12218. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12219. VAR instruction: IntermediateCode.Instruction;
  12220. BEGIN
  12221. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12222. RETURN instruction
  12223. END Mul;
  12224. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12225. VAR instruction: IntermediateCode.Instruction;
  12226. BEGIN
  12227. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12228. RETURN instruction
  12229. END Div;
  12230. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12231. VAR instruction: IntermediateCode.Instruction;
  12232. BEGIN
  12233. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12234. RETURN instruction
  12235. END Mod;
  12236. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12237. VAR instruction: IntermediateCode.Instruction;
  12238. BEGIN
  12239. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12240. RETURN instruction
  12241. END Sub;
  12242. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12243. VAR instruction: IntermediateCode.Instruction;
  12244. BEGIN
  12245. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12246. RETURN instruction
  12247. END Add;
  12248. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12249. VAR instruction: IntermediateCode.Instruction;
  12250. BEGIN
  12251. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12252. RETURN instruction
  12253. END And;
  12254. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12255. VAR instruction: IntermediateCode.Instruction;
  12256. BEGIN
  12257. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12258. RETURN instruction
  12259. END Or;
  12260. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12261. VAR instruction: IntermediateCode.Instruction;
  12262. BEGIN
  12263. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12264. RETURN instruction
  12265. END Xor;
  12266. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12267. VAR instruction: IntermediateCode.Instruction;
  12268. BEGIN
  12269. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12270. RETURN instruction
  12271. END Shl;
  12272. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12273. VAR instruction: IntermediateCode.Instruction;
  12274. BEGIN
  12275. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12276. RETURN instruction
  12277. END Shr;
  12278. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12279. VAR instruction: IntermediateCode.Instruction;
  12280. BEGIN
  12281. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12282. RETURN instruction
  12283. END Rol;
  12284. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12285. VAR instruction: IntermediateCode.Instruction;
  12286. BEGIN
  12287. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12288. RETURN instruction
  12289. END Ror;
  12290. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12291. VAR instruction: IntermediateCode.Instruction;
  12292. BEGIN
  12293. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12294. RETURN instruction
  12295. END Cas;
  12296. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12297. VAR instruction: IntermediateCode.Instruction;
  12298. BEGIN
  12299. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12300. RETURN instruction
  12301. END Copy;
  12302. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12303. VAR instruction: IntermediateCode.Instruction;
  12304. BEGIN
  12305. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12306. RETURN instruction
  12307. END Fill;
  12308. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12309. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12310. BEGIN
  12311. string := IntermediateCode.String(s);
  12312. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12313. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12314. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12315. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12316. RETURN instruction
  12317. END Asm;
  12318. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12319. VAR instruction: IntermediateCode.Instruction;
  12320. BEGIN
  12321. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12322. RETURN instruction
  12323. END Data;
  12324. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12325. VAR instruction: IntermediateCode.Instruction;
  12326. BEGIN
  12327. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12328. IntermediateCode.SetSubType(instruction, subtype);
  12329. RETURN instruction
  12330. END SpecialInstruction;
  12331. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12332. VAR op1: IntermediateCode.Operand;
  12333. VAR instruction: IntermediateCode.Instruction;
  12334. BEGIN
  12335. (*! generate a warning if size exceeds a certain limit *)
  12336. (*
  12337. ASSERT(bytes < 1000000); (* sanity check *)
  12338. *)
  12339. ASSERT(0 <= units); (* sanity check *)
  12340. IntermediateCode.InitNumber(op1,units);
  12341. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12342. RETURN instruction
  12343. END Reserve;
  12344. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12345. VAR op1: IntermediateCode.Operand;
  12346. VAR instruction: IntermediateCode.Instruction;
  12347. BEGIN
  12348. IntermediateCode.InitNumber(op1,position);
  12349. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12350. RETURN instruction
  12351. END LabelInstruction;
  12352. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12353. VAR pc: LONGINT;
  12354. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12355. BEGIN
  12356. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12357. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12358. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12359. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12360. IF instr.op1.type.form = IntermediateCode.Float THEN
  12361. RETURN instr.op1.floatValue = op.floatValue
  12362. ELSE
  12363. RETURN instr.op1.intValue = op.intValue
  12364. END;
  12365. END ProvidesValue;
  12366. BEGIN
  12367. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12368. pc := 0;
  12369. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12370. INC(pc);
  12371. END;
  12372. IF pc = data.pc THEN
  12373. data.Emit(Data(-1,vop));
  12374. END;
  12375. RETURN pc
  12376. END EnterImmediate;
  12377. PROCEDURE Init;
  12378. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12379. BEGIN
  12380. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12381. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12382. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12383. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12384. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12385. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12386. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12387. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12388. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12389. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12390. IntermediateCode.InitOperand(emptyOperand);
  12391. FOR i := 0 TO NumberSystemCalls-1 DO
  12392. name := "@SystemCall";
  12393. Basic.AppendNumber(name,i);
  12394. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12395. END;
  12396. END Init;
  12397. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12398. BEGIN
  12399. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12400. END IsExported;
  12401. BEGIN
  12402. Init;
  12403. END FoxIntermediateBackend.
  12404. Compiler.Compile FoxIntermediateBackend.Mod ~