FoxIntermediateBackend.Mod 538 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. suppressModuleRegistration=FALSE;
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. StrictChecks = FALSE;
  63. BasePointerTypeSize = 5;
  64. BaseArrayTypeSize = BasePointerTypeSize + 3;
  65. LengthOffset = BasePointerTypeSize + 0;
  66. DataOffset = BasePointerTypeSize + 1;
  67. DescriptorOffset = BasePointerTypeSize + 2;
  68. BaseRecordTypeSize = BasePointerTypeSize + 2;
  69. ActionOffset = BasePointerTypeSize + 0;
  70. MonitorOffset = BasePointerTypeSize + 1;
  71. BaseObjectTypeSize = BaseRecordTypeSize;
  72. ActionTypeSize = 3;
  73. MonitorTypeSize = 7;
  74. ProcessorOffset = BaseObjectTypeSize + 1;
  75. StackLimitOffset* = BaseObjectTypeSize + 3;
  76. QuantumOffset = BaseObjectTypeSize + 4;
  77. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  78. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  79. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  80. Size2Flag = 4; (* size = 2 *)
  81. Size3Flag = 5; (* size = 3 *)
  82. Size4Flag = 6; (* size = 4 *)
  83. Size5Flag = 7; (* size = 5 *)
  84. Size6Flag = 8; (* size = 6 *)
  85. Size7Flag = 9; (* size = 7 *)
  86. Size8Flag = 10; (* size = 8 *)
  87. ReflectionSupport = TRUE;
  88. TYPE
  89. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  90. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  91. Operand = RECORD
  92. mode: SHORTINT;
  93. op: IntermediateCode.Operand;
  94. tag: IntermediateCode.Operand;
  95. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  96. dimOffset: LONGINT;
  97. END;
  98. Fixup= POINTER TO RECORD
  99. pc: LONGINT;
  100. nextFixup: Fixup;
  101. END;
  102. WriteBackCall = POINTER TO RECORD
  103. call: SyntaxTree.ProcedureCallDesignator;
  104. next: WriteBackCall;
  105. END;
  106. Label= OBJECT
  107. VAR
  108. fixups: Fixup;
  109. section: IntermediateCode.Section;
  110. pc: LONGINT;
  111. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  112. BEGIN
  113. SELF.section := section; pc := -1;
  114. END InitLabel;
  115. PROCEDURE Resolve(pc: LONGINT);
  116. VAR at: LONGINT;
  117. BEGIN
  118. SELF.pc := pc;
  119. WHILE(fixups # NIL) DO
  120. at := fixups.pc;
  121. section.PatchAddress(at,pc);
  122. fixups := fixups.nextFixup;
  123. END;
  124. END Resolve;
  125. PROCEDURE AddFixup(at: LONGINT);
  126. VAR fixup: Fixup;
  127. BEGIN
  128. ASSERT(pc=-1);
  129. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  130. END AddFixup;
  131. END Label;
  132. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  133. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  134. VAR
  135. backend: IntermediateBackend;
  136. implementationVisitor: ImplementationVisitor;
  137. meta: MetaDataGenerator;
  138. system: Global.System;
  139. currentScope: SyntaxTree.Scope;
  140. module: Sections.Module;
  141. moduleSelf: SyntaxTree.Variable;
  142. dump: BOOLEAN;
  143. forceModuleBody: BOOLEAN;
  144. addressType: IntermediateCode.Type;
  145. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  146. BEGIN
  147. currentScope := NIL; module := NIL; moduleSelf := NIL;
  148. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  149. SELF.dump := dump;
  150. SELF.backend := backend;
  151. SELF.forceModuleBody := forceModuleBody;
  152. addressType := IntermediateCode.GetType(system,system.addressType)
  153. END Init;
  154. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  155. BEGIN
  156. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  157. END Error;
  158. PROCEDURE Type(x: SyntaxTree.Type);
  159. BEGIN
  160. x.Accept(SELF);
  161. END Type;
  162. (** types **)
  163. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  164. BEGIN (* no code emission *) END VisitBasicType;
  165. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  166. BEGIN (* no code emission *) END VisitCharacterType;
  167. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  168. BEGIN (* no code emission *) END VisitIntegerType;
  169. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  170. BEGIN (* no code emission *) END VisitFloatType;
  171. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  172. BEGIN (* no code emission *) END VisitComplexType;
  173. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  174. VAR type: SyntaxTree.Type;
  175. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  176. type := x.resolved;
  177. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  178. meta.CheckTypeDeclaration(type);
  179. END;
  180. END VisitQualifiedType;
  181. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  182. BEGIN (* no code emission *) END VisitStringType;
  183. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  184. BEGIN (* no code emission *)
  185. END VisitArrayRangeType;
  186. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  187. BEGIN (* no code emission *) END VisitArrayType;
  188. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  189. BEGIN
  190. meta.CheckTypeDeclaration(x);
  191. END VisitMathArrayType;
  192. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  193. BEGIN
  194. meta.CheckTypeDeclaration(x);
  195. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  196. END VisitPointerType;
  197. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  198. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  199. BEGIN (* no code emission *)
  200. meta.CheckTypeDeclaration(x);
  201. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  202. IF x.pointerType.typeDeclaration # NIL THEN
  203. td := x.pointerType.typeDeclaration
  204. ELSE
  205. td := x.typeDeclaration
  206. END;
  207. Global.GetSymbolName(td,name);
  208. (* code section for object *)
  209. END;
  210. Scope(x.recordScope);
  211. END VisitRecordType;
  212. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  213. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  214. BEGIN
  215. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  216. WHILE (this # NIL) & (this.identifier# id) DO
  217. this := this.nextModifier;
  218. END;
  219. RETURN this # NIL
  220. END HasFlag;
  221. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  222. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  223. (*
  224. PROCEDURE CreatePorts(type: SyntaxTree.Type; len: LONGINT);
  225. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  226. BEGIN
  227. FOR i := 0 TO len-1 DO
  228. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  229. CreatePorts(baseType, len*len2);
  230. ELSIF IsSemiDynamicArray(type) THEN
  231. port := MIN(LONGINT); (* unknown port address from here on *)
  232. ELSE
  233. IntermediateCode.InitImmediate(op,addressType,adr);
  234. symbol.Emit(Data(-1,op));
  235. INC(port);
  236. END;
  237. END;
  238. END CreatePorts;
  239. *)
  240. BEGIN
  241. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  242. (*
  243. IF (x.cellScope.ownerModule = module.module) THEN
  244. td := x.typeDeclaration;
  245. Global.GetSymbolSegmentedName(td,name);
  246. (* code section for object *)
  247. END;
  248. *)
  249. (* unnecessary to generate space for ports: already represented as hidden variables *)
  250. (*
  251. port := 0;
  252. parameter := x.firstParameter;
  253. WHILE parameter # NIL DO
  254. type := parameter.type.resolved;
  255. Global.GetSymbolSegmentedName(parameter,name);
  256. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection,name,parameter,dump);
  257. IF port >= 0 THEN
  258. (*! could be used for optimization: query value here ???
  259. parameter.SetResolved(SyntaxTree.NewIntegerValue(-1, port));
  260. *)
  261. END;
  262. CreatePorts(type, 1);
  263. IF backend.cellsAreObjects THEN
  264. IF IsStaticArray(parameter.type.resolved) THEN
  265. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  266. END;
  267. END;
  268. parameter := parameter.nextParameter;
  269. END;
  270. *)
  271. capabilities := {};
  272. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  273. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  274. backend.SetCapabilities(capabilities);
  275. Scope(x.cellScope);
  276. END VisitCellType;
  277. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  278. BEGIN (* no code emission *) END VisitProcedureType;
  279. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  280. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  281. END VisitEnumerationType;
  282. (* symbols *)
  283. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  284. BEGIN
  285. Procedure(x);
  286. END VisitProcedure;
  287. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  288. BEGIN
  289. Procedure(x);
  290. END VisitOperator;
  291. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  292. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  293. size, addressSize: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  294. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  295. BEGIN
  296. type := type.resolved;
  297. IF type IS SyntaxTree.RecordType THEN
  298. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  299. ELSIF (type IS SyntaxTree.ArrayType) THEN
  300. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  301. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  302. END;
  303. ELSIF type IS SyntaxTree.MathArrayType THEN
  304. WITH type: SyntaxTree.MathArrayType DO
  305. IF type.form = SyntaxTree.Open THEN
  306. RETURN TRUE
  307. ELSIF type.form = SyntaxTree.Static THEN
  308. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  309. END;
  310. END;
  311. END;
  312. RETURN FALSE
  313. END TypeNeedsInitialization;
  314. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  315. VAR variable: SyntaxTree.Variable;
  316. BEGIN
  317. variable := scope.firstVariable;
  318. WHILE variable # NIL DO
  319. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  320. IF variable.initializer # NIL THEN RETURN TRUE END;
  321. variable := variable.nextVariable;
  322. END;
  323. RETURN FALSE
  324. END ScopeNeedsInitialization;
  325. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset: LONGINT);
  326. BEGIN
  327. size := offset - lastUpdated;
  328. IF size > 0 THEN
  329. irv.Emit(Reserve(x.position,size));
  330. END;
  331. irv.Emit(Data(x.position, op));
  332. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  333. END SingleInitialize;
  334. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset: LONGINT);
  335. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable;
  336. BEGIN
  337. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  338. WITH type: SyntaxTree.RecordType DO
  339. baseType := type.baseType;
  340. IF baseType # NIL THEN
  341. baseType := baseType.resolved;
  342. IF baseType IS SyntaxTree.PointerType THEN
  343. baseType := baseType(SyntaxTree.PointerType).pointerBase
  344. END;
  345. Initialize(baseType,NIL, offset);
  346. END;
  347. variable := type.recordScope.firstVariable;
  348. WHILE variable # NIL DO
  349. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  350. variable := variable.nextVariable
  351. END;
  352. | type: SyntaxTree.ArrayType DO
  353. IF type.form = SyntaxTree.Static THEN
  354. baseType := type.arrayBase;
  355. IF TypeNeedsInitialization(baseType) THEN
  356. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  357. FOR i := 0 TO type.staticLength-1 DO
  358. Initialize(baseType,NIL,offset+i*size);
  359. END;
  360. END;
  361. END;
  362. | type: SyntaxTree.MathArrayType DO
  363. IF type.form = SyntaxTree.Open THEN
  364. dim := DynamicDim(type);
  365. baseType := SemanticChecker.ArrayBase(type,dim);
  366. imm := IntermediateCode.Immediate(addressType,dim);
  367. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  368. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  369. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  370. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  371. (* flags remain empty (=0) for open array *)
  372. ELSIF type.form = SyntaxTree.Static THEN
  373. baseType := type.arrayBase;
  374. IF TypeNeedsInitialization(baseType) THEN
  375. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  376. ASSERT(type.staticLength < 1024*1024*1024);
  377. FOR i := 0 TO type.staticLength-1 DO
  378. Initialize(baseType,NIL,offset+i*size);
  379. END;
  380. END;
  381. END;
  382. ELSE
  383. IF initializer # NIL THEN
  384. implementationVisitor.Evaluate(initializer, op);
  385. SingleInitialize(op.op, offset);
  386. END;
  387. END;
  388. END Initialize;
  389. BEGIN
  390. IF x.externalName # NIL THEN RETURN END;
  391. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  392. (* code section for variable *)
  393. Global.GetSymbolSegmentedName(x,name);
  394. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  395. irv.SetExported(IsExported(x));
  396. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  397. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  398. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  399. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  400. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  401. FOR i := 0 TO DynamicDim(x.type)-1 DO
  402. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  403. END;
  404. ELSE
  405. lastUpdated:= 0;
  406. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  407. Initialize(x.type, x.initializer, 0);
  408. END;
  409. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  410. IF size > 0 THEN
  411. irv.Emit(Reserve(x.position,size));
  412. END;
  413. IF ~x.fixed THEN
  414. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  415. ELSE
  416. align := x.alignment;
  417. END;
  418. irv.SetPositionOrAlignment(x.fixed, align);
  419. meta.CheckTypeDeclaration(x.type);
  420. END;
  421. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  422. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  423. END;
  424. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  425. END VisitVariable;
  426. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  427. VAR name: Basic.SegmentedName; irv, irl: IntermediateCode.Section; op: Operand; dim: LONGINT;
  428. BEGIN
  429. HALT(100);
  430. (*
  431. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  432. (* code section for variable *)
  433. Global.GetSymbolSegmentedName(x,name);
  434. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  435. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  436. (*
  437. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  438. *)
  439. IF IsSemiDynamicArray(x.type) & ~backend.cellsAreObjects THEN
  440. HALT(100);
  441. irv.Emit(Reserve(x.position, system.addressSize));
  442. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  443. irl := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  444. irl.Emit(Reserve(x.position, DynamicDim(x.type) * system.addressSize));
  445. ELSIF x.defaultValue = NIL THEN
  446. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  447. ELSE
  448. implementationVisitor.inData := TRUE;
  449. implementationVisitor.Evaluate(x.defaultValue, op);
  450. irv.Emit(Data(x.position,op.op));
  451. implementationVisitor.inData := FALSE;
  452. END;
  453. meta.CheckTypeDeclaration(x.type);
  454. *)
  455. END VisitParameter;
  456. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  457. BEGIN
  458. Type(x.declaredType); (* => code in objects *)
  459. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  460. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  461. END;
  462. END VisitTypeDeclaration;
  463. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  464. BEGIN
  465. IF (SyntaxTree.Public * x.access # {}) THEN
  466. implementationVisitor.VisitConstant(x);
  467. END;
  468. END VisitConstant;
  469. PROCEDURE Scope(x: SyntaxTree.Scope);
  470. VAR procedure: SyntaxTree.Procedure;
  471. constant: SyntaxTree.Constant;
  472. variable: SyntaxTree.Variable;
  473. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  474. BEGIN
  475. prevScope := currentScope;
  476. currentScope := x;
  477. (* constants treated in implementation visitor *)
  478. typeDeclaration := x.firstTypeDeclaration;
  479. WHILE typeDeclaration # NIL DO
  480. VisitTypeDeclaration(typeDeclaration);
  481. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  482. END;
  483. variable := x.firstVariable;
  484. WHILE variable # NIL DO
  485. VisitVariable(variable);
  486. variable := variable.nextVariable;
  487. END;
  488. procedure := x.firstProcedure;
  489. WHILE procedure # NIL DO
  490. VisitProcedure(procedure);
  491. procedure := procedure.nextProcedure;
  492. END;
  493. constant := x.firstConstant;
  494. WHILE constant # NIL DO
  495. VisitConstant(constant);
  496. constant := constant.nextConstant;
  497. END;
  498. currentScope := prevScope;
  499. END Scope;
  500. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  501. VAR parameter: SyntaxTree.Parameter;
  502. BEGIN
  503. parameter := first;
  504. WHILE parameter # NIL DO
  505. VisitParameter(parameter);
  506. parameter := parameter.nextParameter;
  507. END;
  508. END Parameters;
  509. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  510. VAR scope: SyntaxTree.ProcedureScope;
  511. prevScope: SyntaxTree.Scope;
  512. inline, finalizer: BOOLEAN;
  513. procedureType: SyntaxTree.ProcedureType;
  514. pc: LONGINT;
  515. stackSize: LONGINT;
  516. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  517. null,size,src,dest,fp,res: IntermediateCode.Operand;
  518. cc: LONGINT;
  519. cellType: SyntaxTree.CellType;
  520. registerNumber: LONGINT;
  521. registerClass: IntermediateCode.RegisterClass;
  522. type: IntermediateCode.Type;
  523. formalParameter: SyntaxTree.Parameter;
  524. recordType: SyntaxTree.RecordType;
  525. isModuleBody: BOOLEAN;
  526. PROCEDURE Signature;
  527. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  528. BEGIN
  529. procedureType := x.type(SyntaxTree.ProcedureType);
  530. returnType := procedureType.returnType;
  531. IF returnType # NIL THEN
  532. meta.CheckTypeDeclaration(returnType)
  533. END;
  534. parameter := procedureType.firstParameter;
  535. WHILE parameter # NIL DO
  536. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  537. parameter := parameter.nextParameter;
  538. END;
  539. END Signature;
  540. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  541. VAR result: BOOLEAN;
  542. BEGIN
  543. result := FALSE;
  544. IF x = SyntaxTree.invalidExpression THEN
  545. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  546. result := TRUE;
  547. value := x.resolved(SyntaxTree.IntegerValue).value;
  548. ELSE
  549. Error(x.position,"expression is not an integer constant");
  550. END;
  551. RETURN result;
  552. END CheckIntegerValue;
  553. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  554. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  555. BEGIN
  556. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  557. WHILE (this # NIL) & (this.identifier # id) DO
  558. this := this.nextModifier;
  559. END;
  560. IF this # NIL THEN
  561. IF this.expression = NIL THEN
  562. Error(this.position,"expected expression value");
  563. ELSIF CheckIntegerValue(this.expression,value) THEN
  564. END;
  565. RETURN TRUE
  566. ELSE RETURN FALSE
  567. END;
  568. END HasValue;
  569. CONST DefaultDataMemorySize=512;
  570. BEGIN
  571. IF x.externalName # NIL THEN RETURN END;
  572. (*
  573. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  574. *)
  575. (* code section for this procedure *)
  576. scope := x.procedureScope;
  577. prevScope := currentScope;
  578. currentScope := scope;
  579. procedureType := x.type(SyntaxTree.ProcedureType);
  580. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  581. implementationVisitor.temporaries.Init;
  582. implementationVisitor.usedRegisters := NIL;
  583. implementationVisitor.registerUsageCount.Init;
  584. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  585. IF (scope.body # NIL) & (x.isInline) THEN
  586. inline := TRUE;
  587. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  588. ir.SetExported(IsExported(x));
  589. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  590. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  591. IF backend.cellsAreObjects THEN
  592. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  593. ir.SetExported(IsExported(x));
  594. ELSE
  595. RETURN; (* cellnet cannot be compiled for final static hardware *)
  596. END;
  597. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  598. inline := FALSE;
  599. AddBodyCallStub(x);
  600. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  601. ir.SetExported(IsExported(x));
  602. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  603. inline := FALSE;
  604. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  605. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  606. AddBodyCallStub(x);
  607. AddStackAllocation(x,stackSize);
  608. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  609. ir.SetExported(IsExported(x));
  610. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  611. inline := FALSE;
  612. Parameters(procedureType.firstParameter);
  613. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  614. ir.SetExported(IsExported(x));
  615. ELSE
  616. inline := FALSE;
  617. IF x.isEntry OR x.isExit THEN
  618. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  619. ir.SetExported(TRUE);
  620. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  621. ELSE
  622. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  623. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  624. END;
  625. END;
  626. cc := procedureType.callingConvention;
  627. IF scope.body # NIL THEN
  628. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  629. registerNumber := 0;
  630. IF ~inline THEN
  631. IF scope.lastVariable = NIL THEN
  632. stackSize := 0
  633. ELSE
  634. stackSize := scope.lastVariable.offsetInBits;
  635. IF stackSize <0 THEN stackSize := -stackSize END;
  636. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  637. END;
  638. (*
  639. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  640. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  641. *)
  642. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  643. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  644. END;
  645. pc := ir.pc-1;
  646. (*
  647. ir.Emit(Nop(position)); (* placeholder for fill *)
  648. *)
  649. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  650. formalParameter := procedureType.lastParameter;
  651. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  652. IF ~PassInRegister(formalParameter) THEN
  653. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  654. ELSE
  655. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  656. type := GetType(system, formalParameter.type);
  657. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  658. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  659. ir.Emit(Mov(-1,dest, src));
  660. implementationVisitor.ReleaseIntermediateOperand(src);
  661. INC(registerNumber);
  662. formalParameter := formalParameter.prevParameter;
  663. END;
  664. END;
  665. END;
  666. ir.EnterValidPAF;
  667. END;
  668. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  669. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  670. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  671. IF scope.lastVariable # NIL THEN
  672. stackSize := scope.lastVariable.offsetInBits;
  673. IF stackSize <0 THEN stackSize := -stackSize END;
  674. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  675. END;
  676. END;
  677. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  678. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  679. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  680. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  681. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  682. ir.EmitAt(pc,Push(size));
  683. implementationVisitor.StaticCallOperand(result,procedure);
  684. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  685. END;
  686. *)
  687. END;
  688. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  689. IF stackSize > 0 THEN
  690. IF (stackSize MOD system.addressSize = 0) THEN
  691. null := IntermediateCode.Immediate(addressType,0);
  692. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  693. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  694. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  695. ELSE
  696. null := IntermediateCode.Immediate(int8,0);
  697. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  698. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  699. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  700. END;
  701. (*! should potentially be called by backend -- enter might initialize
  702. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  703. *)
  704. END;
  705. ir.ExitValidPAF;
  706. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  707. finalizer := FALSE;
  708. IF backend.cooperative & x.isFinalizer THEN
  709. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  710. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  711. GetRecordTypeName(recordType,name);
  712. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  713. END;
  714. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  715. IF backend.cooperative THEN
  716. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  717. IF implementationVisitor.profile & ~isModuleBody THEN
  718. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  719. END;
  720. END;
  721. implementationVisitor.EmitLeave(ir, x.position,cc);
  722. IF finalizer THEN
  723. IF backend.hasLinkRegister THEN
  724. ir.Emit(Pop(-1, implementationVisitor.lr));
  725. END;
  726. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  727. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  728. ir.Emit(Br(x.position,dest));
  729. ELSE
  730. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  731. END;
  732. ELSE
  733. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  734. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  735. END;
  736. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  737. IF backend.cooperative THEN
  738. IF HasPointers (scope) THEN
  739. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  740. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  741. ir.Emit(Result(x.position, res));
  742. ir.Emit(Push(x.position, res));
  743. implementationVisitor.ResetVariables(scope);
  744. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  745. ir.Emit(Pop(x.position, res));
  746. ir.Emit(Return(x.position, res));
  747. ELSE
  748. implementationVisitor.ResetVariables(scope);
  749. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  750. END;
  751. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  752. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  753. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  754. ir.Emit(Result(x.position, res));
  755. ir.Emit(Push(x.position, res));
  756. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  757. ir.Emit(Pop(x.position, res));
  758. ir.Emit(Return(x.position, res));
  759. ELSE
  760. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  761. END;
  762. END;
  763. implementationVisitor.EmitLeave(ir,x.position,cc);
  764. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  765. ELSE
  766. ir.Emit(Nop(x.position));
  767. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  768. implementationVisitor.EmitLeave(ir,x.position,cc);
  769. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  770. END;
  771. END;
  772. END
  773. END;
  774. ELSE (* force body for procedures *)
  775. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  776. ir.EnterValidPAF;
  777. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  778. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  779. ir.ExitValidPAF;
  780. implementationVisitor.EmitLeave(ir,x.position,cc);
  781. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  782. END;
  783. Scope(scope);
  784. Signature;
  785. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  786. currentScope := prevScope;
  787. END Procedure;
  788. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  789. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  790. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  791. BEGIN
  792. ASSERT (bodyProcedure # NIL);
  793. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  794. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  795. procedure.SetScope(bodyProcedure.scope);
  796. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  797. procedure.SetAccess(SyntaxTree.Hidden);
  798. Global.GetSymbolSegmentedName (procedure,name);
  799. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  800. ir.SetExported(TRUE);
  801. ir.SetPriority(InitPriority);
  802. Global.GetSymbolSegmentedName (bodyProcedure,name);
  803. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  804. implementationVisitor.currentScope := module.module.moduleScope;
  805. implementationVisitor.section := ir;
  806. implementationVisitor.PushSelfPointer();
  807. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  808. ELSIF backend.preregisterStatic THEN
  809. implementationVisitor.currentScope := module.module.moduleScope;
  810. implementationVisitor.section := ir;
  811. implementationVisitor.PushSelfPointer();
  812. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  813. ELSE
  814. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  815. ir.Emit(Call(bodyProcedure.position,op, 0));
  816. END;
  817. END AddBodyCallStub;
  818. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  819. VAR name: Basic.SegmentedName;
  820. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  821. BEGIN
  822. Global.GetSymbolSegmentedName (symbol,name);
  823. Basic.RemoveSuffix(name);
  824. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  825. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  826. ir.SetExported(TRUE);
  827. ir.SetPriority(FirstPriority);
  828. IntermediateCode.InitImmediate(op,addressType,initStack);
  829. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  830. END AddStackAllocation;
  831. (** entry function to visit a complete module *)
  832. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  833. VAR
  834. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  835. hasDynamicOperatorDeclarations: BOOLEAN;
  836. operator: SyntaxTree.Operator;
  837. import: SyntaxTree.Import;
  838. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  839. BEGIN
  840. type := type.resolved;
  841. IF type IS SyntaxTree.RecordType THEN
  842. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  843. ELSIF (type IS SyntaxTree.ArrayType) THEN
  844. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  845. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  846. END;
  847. ELSIF type IS SyntaxTree.MathArrayType THEN
  848. WITH type: SyntaxTree.MathArrayType DO
  849. IF type.form = SyntaxTree.Open THEN
  850. RETURN TRUE
  851. ELSIF type.form = SyntaxTree.Static THEN
  852. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  853. END;
  854. END;
  855. END;
  856. RETURN FALSE
  857. END TypeNeedsInitialization;
  858. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  859. VAR variable: SyntaxTree.Variable;
  860. BEGIN
  861. variable := scope.firstVariable;
  862. WHILE variable # NIL DO
  863. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  864. IF variable.initializer # NIL THEN RETURN TRUE END;
  865. variable := variable.nextVariable;
  866. END;
  867. RETURN FALSE
  868. END ScopeNeedsInitialization;
  869. BEGIN
  870. ASSERT(x # NIL); ASSERT(module # NIL);
  871. SELF.module := module;
  872. (* add import names to the generated Sections.Module *)
  873. import := x.moduleScope.firstImport;
  874. WHILE import # NIL DO
  875. import.module.GetName(idstr);
  876. module.imports.AddName(idstr);
  877. import := import.nextImport
  878. END;
  879. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  880. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  881. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  882. moduleSelf.SetType(system.anyType);
  883. moduleSelf.SetScope(x.moduleScope);
  884. moduleSelf.SetUntraced(TRUE);
  885. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  886. ir.SetExported(TRUE);
  887. IntermediateCode.InitImmediate(op,addressType,0);
  888. ir.Emit(Data(-1,op));
  889. END;
  890. implementationVisitor.module := module;
  891. implementationVisitor.moduleScope := x.moduleScope;
  892. implementationVisitor.moduleSelf := moduleSelf;
  893. implementationVisitor.canBeLoaded := TRUE;
  894. meta.SetModule(module);
  895. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  896. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  897. END;
  898. IF backend.profile THEN
  899. EnsureBodyProcedure(x.moduleScope);
  900. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  901. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  902. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  903. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  904. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  905. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  906. Global.GetModuleName(module.module,idstr);
  907. implementationVisitor.ProfilerAddModule(idstr);
  908. implementationVisitor.numberProcedures := 0;
  909. END;
  910. implementationVisitor.profile := backend.profile;
  911. (* check if there is at least one dynamic operator locally defined *)
  912. hasDynamicOperatorDeclarations := FALSE;
  913. operator := x.moduleScope.firstOperator;
  914. WHILE operator # NIL DO
  915. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  916. operator := operator.nextOperator
  917. END;
  918. (* add operator initialization code section *)
  919. IF hasDynamicOperatorDeclarations THEN
  920. EnsureBodyProcedure(x.moduleScope);
  921. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  922. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  923. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  924. END;
  925. Scope(x.moduleScope);
  926. IF hasDynamicOperatorDeclarations THEN
  927. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  928. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  929. END;
  930. IF backend.profile THEN
  931. implementationVisitor.ProfilerPatchInit;
  932. END;
  933. END Module;
  934. END DeclarationVisitor;
  935. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  936. RegisterUsageCount*=OBJECT
  937. VAR used: UsedArray; count: LONGINT;
  938. PROCEDURE &Init;
  939. VAR i: LONGINT;
  940. BEGIN
  941. count := 0;
  942. IF used = NIL THEN NEW(used,64); END;
  943. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  944. END Init;
  945. PROCEDURE Grow;
  946. VAR new: UsedArray; size,i: LONGINT;
  947. BEGIN
  948. size := LEN(used)*2;
  949. NEW(new,size);
  950. FOR i := 0 TO LEN(used)-1 DO
  951. new[i].count := used[i].count;
  952. new[i].type := used[i].type;
  953. new[i].map := used[i].map
  954. END;
  955. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  956. used := new
  957. END Grow;
  958. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  959. BEGIN
  960. INC(count);
  961. IF count = LEN(used) THEN Grow END;
  962. used[count].type := type;
  963. used[count].class := class;
  964. used[count].map := count;
  965. RETURN count;
  966. END Next;
  967. PROCEDURE IncUse(register: LONGINT);
  968. BEGIN
  969. INC(used[register].count);
  970. (*
  971. IF (register = 1) & (count > 30) THEN
  972. D.TraceBack;
  973. END;
  974. *)
  975. END IncUse;
  976. PROCEDURE DecUse(register: LONGINT);
  977. BEGIN
  978. DEC(used[register].count);
  979. END DecUse;
  980. PROCEDURE Map(register: LONGINT): LONGINT;
  981. VAR map : LONGINT;
  982. BEGIN
  983. IF register > 0 THEN
  984. map := used[register].map;
  985. WHILE register # map DO register := map; map := used[register].map END;
  986. END;
  987. RETURN register
  988. END Map;
  989. PROCEDURE Use(register: LONGINT): LONGINT;
  990. BEGIN
  991. IF register< LEN(used) THEN
  992. RETURN used[register].count
  993. ELSE
  994. RETURN 0
  995. END
  996. END Use;
  997. END RegisterUsageCount;
  998. RegisterEntry = POINTER TO RECORD
  999. prev,next: RegisterEntry;
  1000. register: LONGINT;
  1001. registerClass: IntermediateCode.RegisterClass;
  1002. type: IntermediateCode.Type;
  1003. END;
  1004. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1005. Variables = OBJECT (Basic.List)
  1006. VAR
  1007. inUse: VariableUse;
  1008. registerIndex: LONGINT;
  1009. PROCEDURE & Init;
  1010. VAR i: LONGINT;
  1011. BEGIN
  1012. InitList(16);
  1013. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1014. registerIndex := 1024;
  1015. END Init;
  1016. PROCEDURE GetUsage(VAR use: VariableUse);
  1017. BEGIN
  1018. use := inUse;
  1019. END GetUsage;
  1020. PROCEDURE SetUsage(CONST use: VariableUse);
  1021. BEGIN
  1022. inUse := use;
  1023. END SetUsage;
  1024. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1025. VAR any: ANY;
  1026. BEGIN
  1027. any := Get(i);;
  1028. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1029. END GetVariable;
  1030. PROCEDURE Occupy(pos: LONGINT);
  1031. BEGIN
  1032. INCL(inUse[pos DIV 32], pos MOD 32);
  1033. END Occupy;
  1034. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1035. BEGIN
  1036. Occupy(Length());
  1037. Add(v);
  1038. END AddVariable;
  1039. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  1040. VAR var : SyntaxTree.Variable;
  1041. BEGIN
  1042. FOR pos := 0 TO Length()-1 DO
  1043. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  1044. var := GetVariable(pos);
  1045. IF type.SameType(var.type) THEN
  1046. Occupy(pos); RETURN var
  1047. END;
  1048. END;
  1049. END;
  1050. pos := Length();
  1051. RETURN NIL
  1052. END GetFreeVariable;
  1053. END Variables;
  1054. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  1055. SymbolMapper = OBJECT
  1056. VAR
  1057. first: SymbolMap;
  1058. PROCEDURE & Init;
  1059. BEGIN
  1060. first := NIL;
  1061. END Init;
  1062. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  1063. VAR new: SymbolMap;
  1064. BEGIN
  1065. NEW(new); new.this := this; new.to := to; new.tag := tag;
  1066. new.next := first; first := new;
  1067. END Add;
  1068. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1069. VAR s: SymbolMap;
  1070. BEGIN
  1071. s := first;
  1072. WHILE (s # NIL) & (s.this # this) DO
  1073. s := s.next
  1074. END;
  1075. RETURN s
  1076. END Get;
  1077. END SymbolMapper;
  1078. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1079. VAR
  1080. system: Global.System;
  1081. section: IntermediateCode.Section;
  1082. module: Sections.Module;
  1083. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1084. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1085. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1086. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1087. checker: SemanticChecker.Checker;
  1088. backend: IntermediateBackend;
  1089. meta: MetaDataGenerator;
  1090. position: LONGINT;
  1091. moduleSelf: SyntaxTree.Variable;
  1092. (* variables for hand over of variables / temporary state *)
  1093. currentScope: SyntaxTree.Scope;
  1094. constantDeclaration : SyntaxTree.Symbol;
  1095. result: Operand; (* result of the most recent expression / statement *)
  1096. destination: IntermediateCode.Operand;
  1097. arrayDestinationTag: IntermediateCode.Operand;
  1098. arrayDestinationDimension:LONGINT;
  1099. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1100. conditional: BOOLEAN;
  1101. trueLabel, falseLabel, exitLabel: Label;
  1102. locked: BOOLEAN;
  1103. (*
  1104. usedRegisters: Registers;
  1105. *)
  1106. registerUsageCount: RegisterUsageCount;
  1107. usedRegisters: RegisterEntry;
  1108. (* useful operands and types *)
  1109. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1110. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1111. commentPrintout: Printout.Printer;
  1112. dump: Streams.Writer;
  1113. tagsAvailable : BOOLEAN;
  1114. supportedInstruction: SupportedInstructionProcedure;
  1115. supportedImmediate: SupportedImmediateProcedure;
  1116. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1117. emitLabels: BOOLEAN;
  1118. runtimeModuleName : SyntaxTree.IdentifierString;
  1119. newObjectFile: BOOLEAN;
  1120. indexCounter: LONGINT;
  1121. profile: BOOLEAN;
  1122. profileId, profileInit: IntermediateCode.Section;
  1123. profileInitPatchPosition: LONGINT;
  1124. numberProcedures: LONGINT;
  1125. procedureResultDesignator : SyntaxTree.Designator;
  1126. operatorInitializationCodeSection: IntermediateCode.Section;
  1127. fingerPrinter: FingerPrinter.FingerPrinter;
  1128. temporaries: Variables;
  1129. canBeLoaded : BOOLEAN;
  1130. currentIsInline: BOOLEAN;
  1131. currentMapper: SymbolMapper;
  1132. currentInlineExit: Label;
  1133. moduleBodySection: IntermediateCode.Section;
  1134. NeedDescriptor : BOOLEAN;
  1135. cooperativeSwitches: BOOLEAN;
  1136. lastSwitchPC: LONGINT;
  1137. isUnchecked: BOOLEAN;
  1138. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1139. newObjectFile: BOOLEAN);
  1140. BEGIN
  1141. SELF.system := system;
  1142. SELF.runtimeModuleName := runtime;
  1143. currentScope := NIL;
  1144. hiddenPointerType := NIL;
  1145. delegatePointerType := NIL;
  1146. awaitProcCounter := 0;
  1147. labelId := 0; constId := 0; labelId := 0;
  1148. SELF.checker := checker;
  1149. SELF.backend := backend;
  1150. position := Diagnostics.Invalid;
  1151. conditional := FALSE;
  1152. locked := FALSE;
  1153. InitOperand(result,ModeUndefined);
  1154. addressType := IntermediateCode.GetType(system,system.addressType);
  1155. setType := IntermediateCode.GetType(system,system.setType);
  1156. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1157. byteType := IntermediateCode.GetType(system, system.byteType);
  1158. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1159. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1160. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1161. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1162. nil := IntermediateCode.Immediate(addressType,0);
  1163. IntermediateCode.InitOperand(destination);
  1164. tagsAvailable := TRUE;
  1165. supportedInstruction := supportedInstructionProcedure;
  1166. supportedImmediate := supportedImmediateProcedure;
  1167. inData := FALSE;
  1168. SELF.emitLabels := emitLabels;
  1169. IntermediateCode.InitOperand(arrayDestinationTag);
  1170. bool := IntermediateCode.GetType(system,system.booleanType);
  1171. IntermediateCode.InitImmediate(false,bool,0);
  1172. IntermediateCode.InitImmediate(true,bool,1);
  1173. SELF.newObjectFile := newObjectFile;
  1174. indexCounter := 0;
  1175. NEW(registerUsageCount);
  1176. usedRegisters := NIL;
  1177. procedureResultDesignator := NIL;
  1178. NEW(fingerPrinter, system);
  1179. NEW(temporaries);
  1180. currentIsInline := FALSE;
  1181. NeedDescriptor := FALSE;
  1182. isUnchecked := backend.noRuntimeChecks;
  1183. END Init;
  1184. TYPE Context = RECORD
  1185. section: IntermediateCode.Section;
  1186. registerUsageCount: RegisterUsageCount;
  1187. usedRegisters: RegisterEntry;
  1188. END;
  1189. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1190. VAR context: Context;
  1191. BEGIN
  1192. context.section := section;
  1193. context.registerUsageCount := registerUsageCount;
  1194. context.usedRegisters := usedRegisters;
  1195. section := new;
  1196. NEW(registerUsageCount);
  1197. usedRegisters := NIL;
  1198. RETURN context;
  1199. END SwitchContext;
  1200. PROCEDURE ReturnToContext(context: Context);
  1201. BEGIN
  1202. section := context.section;
  1203. registerUsageCount := context.registerUsageCount;
  1204. usedRegisters := context.usedRegisters;
  1205. END ReturnToContext;
  1206. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1207. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1208. BEGIN
  1209. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1210. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1211. END;
  1212. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1213. section.SetExported(IsExported(syntaxTreeSymbol));
  1214. RETURN section
  1215. END NewSection;
  1216. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1217. VAR new: LONGINT;
  1218. BEGIN
  1219. new := registerUsageCount.Next(type,class);
  1220. UseRegister(new);
  1221. RETURN new
  1222. END AcquireRegister;
  1223. (** get the name for the code section that represens a certain symbol
  1224. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1225. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1226. VAR
  1227. operatorFingerPrint: SyntaxTree.FingerPrint;
  1228. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1229. BEGIN
  1230. Global.GetSymbolSegmentedName(symbol, name);
  1231. (* if the symbol is an operator, then append the fingerprint to the name *)
  1232. IF symbol IS SyntaxTree.Operator THEN
  1233. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1234. string := "[";
  1235. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1236. Strings.Append(string, operatorFingerPrintString);
  1237. Strings.Append(string, "]");
  1238. Basic.AppendToSegmentedName(name,string);
  1239. END
  1240. END GetCodeSectionNameForSymbol;
  1241. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1242. BEGIN
  1243. IF dump # NIL THEN
  1244. dump.String("enter "); dump.String(s); dump.Ln;
  1245. END;
  1246. END TraceEnter;
  1247. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1248. BEGIN
  1249. IF dump # NIL THEN
  1250. dump.String("exit "); dump.String(s); dump.Ln;
  1251. END;
  1252. END TraceExit;
  1253. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1254. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1255. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1256. VAR i: LONGINT;
  1257. BEGIN
  1258. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1259. IF op.rule # NIL THEN
  1260. FOR i := 0 TO LEN(op.rule)-1 DO
  1261. CheckRegister(op.rule[i])
  1262. END;
  1263. END;
  1264. END CheckRegister;
  1265. BEGIN
  1266. CheckRegister(instruction.op1);
  1267. CheckRegister(instruction.op2);
  1268. CheckRegister(instruction.op3);
  1269. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1270. ELSE section.Emit(instruction);
  1271. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1272. END;
  1273. END Emit;
  1274. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1275. BEGIN
  1276. IF backend.cooperative THEN
  1277. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1278. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1279. ELSE
  1280. Emit(Trap(position,trapNo));
  1281. END;
  1282. END EmitTrap;
  1283. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1284. VAR name: Basic.SegmentedName;
  1285. VAR op1, op2, reg: IntermediateCode.Operand;
  1286. VAR call, nocall: Label;
  1287. VAR parametersSize: LONGINT;
  1288. VAR prevSection: IntermediateCode.Section;
  1289. VAR prevDump: Streams.Writer;
  1290. VAR body: SyntaxTree.Body;
  1291. BEGIN
  1292. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1293. prevSection := SELF.section;
  1294. SELF.section := section;
  1295. prevDump := dump;
  1296. dump := section.comments;
  1297. IF backend.hasLinkRegister THEN
  1298. Emit(Push(-1, lr));
  1299. END;
  1300. Emit(Push(-1,fp));
  1301. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1302. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1303. GetCodeSectionNameForSymbol(procedure, name);
  1304. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1305. ELSE
  1306. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1307. END;
  1308. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1309. Emit(Push(-1,op1));
  1310. Emit(Mov(-1,fp, sp));
  1311. body := procedure.procedureScope.body;
  1312. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1313. NEW(call, section);
  1314. NEW(nocall, section);
  1315. reg := NewRegisterOperand(addressType);
  1316. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1317. Emit(Sub(-1,reg, sp, op1));
  1318. BrltL(call, sp, reg);
  1319. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1320. BrgeL(nocall, sp, op2);
  1321. call.Resolve(section.pc);
  1322. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1323. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1324. Emit(Push(-1, op2));
  1325. Emit(Push(-1, reg));
  1326. ReleaseIntermediateOperand(reg);
  1327. CallThis(position, "Activities","ExpandStack",2);
  1328. Emit(Result(-1, sp));
  1329. nocall.Resolve(section.pc);
  1330. END;
  1331. ELSE
  1332. Emit(Mov(-1, fp, sp));
  1333. END;
  1334. Emit(Enter(-1, callconv, varSize));
  1335. SELF.section := prevSection;
  1336. dump := prevDump;
  1337. END EmitEnter;
  1338. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1339. VAR op1,op2: IntermediateCode.Operand;
  1340. VAR instruction: IntermediateCode.Instruction;
  1341. BEGIN
  1342. IntermediateCode.InitNumber(op1,callconv);
  1343. IntermediateCode.InitNumber(op2,varSize);
  1344. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1345. RETURN instruction
  1346. END Enter;
  1347. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1348. VAR op1: IntermediateCode.Operand;
  1349. VAR instruction: IntermediateCode.Instruction;
  1350. BEGIN
  1351. IntermediateCode.InitNumber(op1,callconv);
  1352. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1353. RETURN instruction
  1354. END Leave;
  1355. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1356. VAR prevSection: IntermediateCode.Section;
  1357. VAR op2: IntermediateCode.Operand;
  1358. BEGIN
  1359. prevSection := SELF.section;
  1360. SELF.section := section;
  1361. Emit(Leave(position, callconv));
  1362. IF backend.cooperative THEN
  1363. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1364. Emit(Add(position, sp, fp, op2));
  1365. ELSE
  1366. Emit(Mov(position, sp, fp));
  1367. END;
  1368. Emit(Pop(position, fp));
  1369. SELF.section := prevSection;
  1370. END EmitLeave;
  1371. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1372. VAR m: SymbolMap;
  1373. BEGIN
  1374. position := x.position;
  1375. IF currentIsInline THEN
  1376. m := currentMapper.Get(x);
  1377. IF m # NIL THEN
  1378. (*
  1379. Printout.Info("mapping from", x);
  1380. Printout.Info("mapping to ", m.to);
  1381. *)
  1382. m.to.Accept(SELF);
  1383. op := result;
  1384. IF m.tag # NIL THEN
  1385. ReleaseIntermediateOperand(result.tag);
  1386. m.tag.Accept(SELF);
  1387. op.tag := result.op;
  1388. ReleaseIntermediateOperand(result.tag);
  1389. END;
  1390. RETURN
  1391. END;
  1392. END;
  1393. x.Accept(SELF);
  1394. op := result;
  1395. END Symbol;
  1396. PROCEDURE Expression(x: SyntaxTree.Expression);
  1397. BEGIN
  1398. position := x.position;
  1399. constantDeclaration := NIL;
  1400. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1401. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1402. END;
  1403. IF x.resolved # NIL THEN
  1404. x.resolved.Accept(SELF)
  1405. ELSE
  1406. x.Accept(SELF)
  1407. END;
  1408. (* check this, was commented out in ActiveCells3 *)
  1409. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1410. Error(x.position, "unsupported modifier");
  1411. END;
  1412. END Expression;
  1413. (*
  1414. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1415. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1416. BEGIN
  1417. temporaries.GetUsage(current);
  1418. FOR i := 0 TO LEN(current)-1 DO
  1419. set := current[i] - previous[i];
  1420. IF set # {} THEN
  1421. FOR j := 0 TO MAX(SET)-1 DO
  1422. IF j IN set THEN
  1423. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1424. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1425. Symbol(variable, op);
  1426. MakeMemory(tmp,op.op,addressType,0);
  1427. ReleaseOperand(op);
  1428. Emit(Mov(position,tmp, nil ) );
  1429. ReleaseIntermediateOperand(tmp);
  1430. END;
  1431. END;
  1432. END;
  1433. END;
  1434. END;
  1435. END ResetUsedTemporaries;
  1436. *)
  1437. PROCEDURE Statement(x: SyntaxTree.Statement);
  1438. VAR use: VariableUse;
  1439. BEGIN
  1440. temporaries.GetUsage(use);
  1441. position := x.position;
  1442. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1443. IF commentPrintout # NIL THEN
  1444. commentPrintout.Statement(x);
  1445. dump.Ln;
  1446. (*dump.Update;*)
  1447. END;
  1448. x.Accept(SELF);
  1449. (*
  1450. CheckRegistersFree();
  1451. *)
  1452. (*ResetUsedTemporaries(use);*)
  1453. temporaries.SetUsage(use);
  1454. END Statement;
  1455. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1456. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1457. *)
  1458. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1459. BEGIN
  1460. IF op.mode = IntermediateCode.ModeMemory THEN
  1461. ReuseCopy(res,op);
  1462. ELSE
  1463. res := op;
  1464. UseIntermediateOperand(res);
  1465. END;
  1466. IntermediateCode.AddOffset(res,offset);
  1467. IntermediateCode.MakeMemory(res,type);
  1468. END MakeMemory;
  1469. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1470. VAR mem: IntermediateCode.Operand;
  1471. BEGIN
  1472. MakeMemory(mem,res,type,offset);
  1473. ReleaseIntermediateOperand(res);
  1474. res := mem;
  1475. END ToMemory;
  1476. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1477. VAR mem: IntermediateCode.Operand;
  1478. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1479. componentType: SyntaxTree.Type;
  1480. BEGIN
  1481. type := type.resolved;
  1482. IF operand.mode = ModeReference THEN
  1483. IF type IS SyntaxTree.RangeType THEN
  1484. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1485. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1486. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1487. ReleaseOperand(operand);
  1488. operand.op := firstOp;
  1489. operand.tag := lastOp;
  1490. operand.extra := stepOp;
  1491. ELSIF type IS SyntaxTree.ComplexType THEN
  1492. componentType := type(SyntaxTree.ComplexType).componentType;
  1493. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1494. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1495. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1496. ReleaseOperand(operand);
  1497. operand.op := firstOp;
  1498. operand.tag := lastOp
  1499. ELSE
  1500. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1501. ReleaseIntermediateOperand(operand.op);
  1502. operand.op := mem;
  1503. END;
  1504. operand.mode := ModeValue;
  1505. END;
  1506. ASSERT(operand.mode = ModeValue);
  1507. END LoadValue;
  1508. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1509. VAR prevConditional: BOOLEAN;
  1510. BEGIN
  1511. prevConditional := conditional;
  1512. conditional := FALSE;
  1513. InitOperand(result, ModeUndefined);
  1514. Expression(x);
  1515. op := result;
  1516. LoadValue(op,x.type.resolved);
  1517. conditional := prevConditional;
  1518. END Evaluate;
  1519. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1520. VAR prevConditional: BOOLEAN;
  1521. BEGIN
  1522. prevConditional := conditional;
  1523. conditional := FALSE;
  1524. InitOperand(result,ModeUndefined);
  1525. Expression(x);
  1526. op := result;
  1527. (*
  1528. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1529. *)
  1530. conditional := prevConditional;
  1531. END Designate;
  1532. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1533. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1534. BEGIN
  1535. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1536. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1537. conditional := TRUE;
  1538. trueLabel := trueL; falseLabel := falseL;
  1539. Expression(x);
  1540. trueL := trueLabel; falseL := falseLabel;
  1541. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1542. END Condition;
  1543. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1544. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1545. BEGIN
  1546. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1547. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1548. RETURN op
  1549. END NewRegisterOperand;
  1550. PROCEDURE UnuseRegister(register: LONGINT);
  1551. BEGIN
  1552. IF (register > 0) THEN
  1553. register := registerUsageCount.Map(register);
  1554. registerUsageCount.DecUse(register);
  1555. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1556. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1557. END;
  1558. IF registerUsageCount.Use(register)=0 THEN
  1559. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1560. Warning(position, "register cannot be removed");
  1561. END;
  1562. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1563. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1564. END;
  1565. ELSIF registerUsageCount.Use(register)<0 THEN
  1566. Warning(position, "register removed too often");
  1567. IF dump # NIL THEN
  1568. dump.String("register removed too often"); dump.Ln; dump.Update;
  1569. END;
  1570. D.TraceBack;
  1571. END;
  1572. END;
  1573. END UnuseRegister;
  1574. PROCEDURE UseRegister(register: LONGINT);
  1575. BEGIN
  1576. IF (register > 0) THEN
  1577. register := registerUsageCount.Map(register);
  1578. registerUsageCount.IncUse(register);
  1579. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1580. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1581. END;
  1582. IF registerUsageCount.Use(register)=1 THEN
  1583. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1584. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1585. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1586. END;
  1587. END;
  1588. END;
  1589. END UseRegister;
  1590. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1591. BEGIN
  1592. UnuseRegister(op.register)
  1593. END ReleaseIntermediateOperand;
  1594. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1595. BEGIN
  1596. UseRegister(op.register)
  1597. END UseIntermediateOperand;
  1598. PROCEDURE ReleaseOperand(CONST op: Operand);
  1599. BEGIN
  1600. UnuseRegister(op.op.register);
  1601. UnuseRegister(op.tag.register);
  1602. UnuseRegister(op.extra.register);
  1603. END ReleaseOperand;
  1604. (* save registers marked in array "markedRegisters" to the stack
  1605. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1606. *)
  1607. PROCEDURE SaveRegisters();
  1608. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1609. BEGIN
  1610. entry := usedRegisters;
  1611. WHILE entry # NIL DO
  1612. type := registerUsageCount.used[entry.register].type;
  1613. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1614. Emit(Push(position,op));
  1615. entry := entry.next;
  1616. END;
  1617. END SaveRegisters;
  1618. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1619. BEGIN
  1620. saved := usedRegisters;
  1621. usedRegisters := NIL;
  1622. END ReleaseUsedRegisters;
  1623. (** remove parameter registers from used queue *)
  1624. PROCEDURE ReleaseParameterRegisters;
  1625. VAR entry,prev,next: RegisterEntry;
  1626. BEGIN
  1627. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1628. WHILE entry # NIL DO
  1629. next := entry.next;
  1630. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1631. registerUsageCount.DecUse(entry.register);
  1632. ASSERT(registerUsageCount.Use(entry.register)=0);
  1633. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1634. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1635. END;
  1636. ELSIF prev = NIL THEN
  1637. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1638. ELSE
  1639. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1640. END;
  1641. entry := next;
  1642. END;
  1643. END ReleaseParameterRegisters;
  1644. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1645. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1646. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1647. BEGIN
  1648. entry := saved;
  1649. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1650. entry := prev;
  1651. WHILE entry # NIL DO
  1652. prev := entry.prev;
  1653. type := entry.type;
  1654. class := entry.registerClass;
  1655. IntermediateCode.InitRegister(op,type,class,entry.register);
  1656. (*
  1657. new := registerUsageCount.Next(type,class);
  1658. registerUsageCount.Remap(entry.register,new);
  1659. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1660. dump.String("remap register "); dump.Int(entry.register,1);
  1661. dump.String("to "); dump.Int(new,1);
  1662. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1663. END;
  1664. entry.register := new;
  1665. *)
  1666. Emit(Pop(position,op));
  1667. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1668. entry := prev;
  1669. END;
  1670. (*
  1671. usedRegisters := saved;
  1672. *)
  1673. END RestoreRegisters;
  1674. PROCEDURE CheckRegistersFree;
  1675. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1676. BEGIN
  1677. IF usedRegisters # NIL THEN
  1678. r := usedRegisters;
  1679. WHILE r # NIL DO
  1680. warning := "register ";
  1681. Strings.AppendInt(warning, r.register);
  1682. Strings.Append(warning, " not released.");
  1683. Warning(position,warning);
  1684. r := r .next;
  1685. END;
  1686. END;
  1687. FOR i := 0 TO registerUsageCount.count-1 DO
  1688. IF registerUsageCount.used[i].count < 0 THEN
  1689. warning := "register ";
  1690. Strings.AppendInt(warning, i);
  1691. Strings.Append(warning, " unused too often.");
  1692. Warning(position,warning);
  1693. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1694. warning := "register ";
  1695. Strings.AppendInt(warning, i);
  1696. Strings.Append(warning, " not unused often enough.");
  1697. Warning(position,warning);
  1698. END;
  1699. END;
  1700. END CheckRegistersFree;
  1701. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1702. Otherwise allocate a new register.
  1703. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1704. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1705. BEGIN
  1706. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1707. UseIntermediateOperand(result);
  1708. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1709. UseIntermediateOperand(result);
  1710. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1711. END;
  1712. END Reuse2;
  1713. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1714. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1715. If not then allocate a new register.
  1716. Does NOT necessarily keep the content of src1 or src2 in result!
  1717. *)
  1718. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1719. BEGIN
  1720. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1721. UseIntermediateOperand(result);
  1722. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1723. UseIntermediateOperand(result);
  1724. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1725. result := alternative; alternative := emptyOperand;
  1726. UseIntermediateOperand(result);
  1727. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1728. END;
  1729. END Reuse2a;
  1730. (* like reuse2 but only one source *)
  1731. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1732. BEGIN
  1733. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1734. UseIntermediateOperand(result);
  1735. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1736. END;
  1737. END Reuse1;
  1738. (* like reuse2a but only one source *)
  1739. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1740. BEGIN
  1741. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1742. UseIntermediateOperand(result);
  1743. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1744. UseIntermediateOperand(result);
  1745. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1746. END;
  1747. END Reuse1a;
  1748. (* like reuse1 but guarantees that content of src1 is in result *)
  1749. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1750. BEGIN
  1751. IF ReusableRegister(src1) THEN
  1752. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1753. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1754. UseIntermediateOperand(result);
  1755. ELSE
  1756. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1757. Emit(Mov(position,result,src1));
  1758. END
  1759. END ReuseCopy;
  1760. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1761. BEGIN
  1762. IF ReusableRegister(src) THEN
  1763. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1764. ELSE
  1765. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1766. Emit(Mov(position,result,src));
  1767. ReleaseIntermediateOperand(src);
  1768. END
  1769. END TransferToRegister;
  1770. (** labels and branches **)
  1771. PROCEDURE NewLabel(): Label;
  1772. VAR label: Label;
  1773. BEGIN
  1774. NEW(label,section); RETURN label;
  1775. END NewLabel;
  1776. PROCEDURE SetLabel(label: Label);
  1777. BEGIN label.Resolve(section.pc);
  1778. END SetLabel;
  1779. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1780. BEGIN
  1781. ASSERT(label # NIL);
  1782. IF label.pc < 0 THEN (* label not yet set *)
  1783. label.AddFixup(section.pc);
  1784. END;
  1785. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1786. END LabelOperand;
  1787. PROCEDURE BrL(label: Label);
  1788. BEGIN
  1789. Emit(Br(position,LabelOperand(label)));
  1790. END BrL;
  1791. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1792. BEGIN
  1793. Emit(Brge(position,LabelOperand(label),left,right));
  1794. END BrgeL;
  1795. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1796. BEGIN
  1797. Emit(Brlt(position,LabelOperand(label),left,right));
  1798. END BrltL;
  1799. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1800. BEGIN
  1801. Emit(Breq(position,LabelOperand(label),left,right));
  1802. END BreqL;
  1803. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1804. BEGIN
  1805. Emit(Brne(position,LabelOperand(label),left,right));
  1806. END BrneL;
  1807. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1808. VAR new: IntermediateCode.Operand;
  1809. BEGIN
  1810. IF Trace THEN TraceEnter("Convert") END;
  1811. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1812. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1813. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1814. & (operand.offset = 0)
  1815. THEN
  1816. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1817. Emit(Conv(position,new,operand));
  1818. ELSE
  1819. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1820. Emit(Conv(position,new,operand));
  1821. ReleaseIntermediateOperand(operand);
  1822. END;
  1823. operand := new;
  1824. 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
  1825. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1826. ELSE
  1827. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1828. Emit(Conv(position,new,operand));
  1829. ReleaseIntermediateOperand(operand);
  1830. operand := new;
  1831. END;
  1832. IF Trace THEN TraceExit("Convert") END;
  1833. END Convert;
  1834. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1835. VAR exit: Label;
  1836. BEGIN
  1837. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1838. exit := NewLabel();
  1839. br(exit,left,right);
  1840. EmitTrap(position,trapNo);
  1841. SetLabel(exit);
  1842. END TrapC;
  1843. (** expressions *)
  1844. (** emit necessary runtime check for set elements **)
  1845. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1846. VAR max: IntermediateCode.Operand;
  1847. BEGIN
  1848. IF isUnchecked THEN RETURN END;
  1849. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1850. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1851. TrapC(BrgeL, max, o, SetElementTrap);
  1852. END;
  1853. END CheckSetElement;
  1854. (** the set that a range represents **)
  1855. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1856. VAR
  1857. operand: Operand;
  1858. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1859. BEGIN
  1860. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1861. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1862. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1863. one := IntermediateCode.Immediate(setType, 1);
  1864. Evaluate(x, operand);
  1865. Convert(operand.op, setType);
  1866. Convert(operand.tag, setType);
  1867. CheckSetElement(operand.op);
  1868. CheckSetElement(operand.tag);
  1869. (* create mask for lower bound
  1870. i.e. shift 11111111 to the left by the value of the lower bound
  1871. *)
  1872. Reuse1(temp, operand.op);
  1873. Emit(Shl(position,temp, allBits, operand.op));
  1874. ReleaseIntermediateOperand(operand.op);
  1875. operand.op := temp;
  1876. (* create mask for upper bound
  1877. i.e. shift 11111111 to the right by the difference between the
  1878. upper bound and the maximum number of set elements
  1879. *)
  1880. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1881. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1882. Reuse1(temp, operand.tag);
  1883. ELSE
  1884. Reuse1(temp, operand.tag);
  1885. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1886. Emit(Sub(position,temp, size, operand.tag));
  1887. END;
  1888. Emit(Shr(position,temp, allBits, operand.tag));
  1889. ReleaseIntermediateOperand(operand.tag);
  1890. operand.tag := temp;
  1891. Reuse2(resultingSet, operand.op, operand.tag);
  1892. (* intersect the two masks *)
  1893. Emit(And(position,resultingSet, operand.op, operand.tag));
  1894. ReleaseOperand(operand);
  1895. RETURN resultingSet
  1896. END SetFromRange;
  1897. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1898. VAR
  1899. res, operand: Operand;
  1900. temp, one, noBits, dest: IntermediateCode.Operand;
  1901. expression: SyntaxTree.Expression;
  1902. i: LONGINT;
  1903. BEGIN
  1904. IF Trace THEN TraceEnter("VisitSet") END;
  1905. dest := destination;
  1906. destination := emptyOperand;
  1907. noBits := IntermediateCode.Immediate(setType, 0);
  1908. one := IntermediateCode.Immediate(setType, 1);
  1909. (* start off with the empty set *)
  1910. InitOperand(res, ModeValue);
  1911. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1912. Emit(Mov(position,res.op, noBits));
  1913. FOR i := 0 TO x.elements.Length() - 1 DO
  1914. expression := x.elements.GetExpression(i);
  1915. IF expression IS SyntaxTree.RangeExpression THEN
  1916. (* range of set elements *)
  1917. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1918. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1919. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1920. ReleaseIntermediateOperand(temp)
  1921. ELSE
  1922. (* singelton element *)
  1923. Evaluate(expression, operand);
  1924. Convert(operand.op, setType);
  1925. CheckSetElement(operand.op);
  1926. (* create subset containing single element *)
  1927. Reuse1(temp, operand.op);
  1928. Emit(Shl(position,temp, one, operand.op));
  1929. ReleaseOperand(operand);
  1930. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1931. ReleaseIntermediateOperand(temp);
  1932. END
  1933. END;
  1934. result := res;
  1935. destination := dest;
  1936. IF Trace THEN TraceExit("VisitSet") END;
  1937. END VisitSet;
  1938. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1939. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1940. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1941. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1942. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1943. element: SyntaxTree.IntegerValue;
  1944. BEGIN
  1945. numberElements := x.elements.Length();
  1946. expression := index.parameters.GetExpression(dim);
  1947. element := expression(SyntaxTree.IntegerValue);
  1948. FOR i := 0 TO numberElements-1 DO
  1949. expression := x.elements.GetExpression(i);
  1950. element.SetValue(i);
  1951. IF expression IS SyntaxTree.MathArrayExpression THEN
  1952. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1953. ELSE
  1954. Assign(index,expression);
  1955. END;
  1956. END;
  1957. END RecursiveAssignment;
  1958. BEGIN
  1959. variable := GetTemporaryVariable(x.type, FALSE);
  1960. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1961. designator.SetType(variable.type);
  1962. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1963. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1964. FOR i := 0 TO dim-1 DO
  1965. element := SyntaxTree.NewIntegerValue(x.position,0);
  1966. element.SetType(system.longintType);
  1967. index.parameters.AddExpression(element);
  1968. END;
  1969. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1970. RecursiveAssignment(x,0);
  1971. Expression(designator);
  1972. END VisitMathArrayExpression;
  1973. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1974. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1975. BEGIN
  1976. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1977. dest := destination; destination := emptyOperand;
  1978. IF x.operator = Scanner.Not THEN
  1979. IF conditional THEN
  1980. Condition(x.left,falseLabel,trueLabel)
  1981. ELSE
  1982. Evaluate(x.left,operand);
  1983. InitOperand(result,ModeValue);
  1984. Reuse1a(result.op,operand.op,dest);
  1985. Emit(Xor(position,result.op,operand.op,true));
  1986. ReleaseOperand(operand);
  1987. END;
  1988. ELSIF x.operator = Scanner.Minus THEN
  1989. Evaluate(x.left,operand);
  1990. InitOperand(result,ModeValue);
  1991. Reuse1a(result.op,operand.op,dest);
  1992. type := x.left.type.resolved;
  1993. IF type IS SyntaxTree.SetType THEN
  1994. Emit(Not(position,result.op,operand.op));
  1995. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1996. Reuse1(result.tag,operand.tag);
  1997. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1998. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1999. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2000. Emit(Neg(position,result.op,operand.op));
  2001. ELSE HALT(200)
  2002. END;
  2003. ReleaseOperand(operand);
  2004. ELSIF x.operator = Scanner.Address THEN
  2005. Designate(x.left,operand);
  2006. operand.mode := ModeValue;
  2007. t0 := x.left.type.resolved;
  2008. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2009. ReleaseIntermediateOperand(operand.op);
  2010. operand.op := operand.tag;
  2011. IntermediateCode.InitOperand(operand.tag);
  2012. END;
  2013. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2014. result := operand;
  2015. ELSE HALT(100)
  2016. END;
  2017. destination := dest;
  2018. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2019. END VisitUnaryExpression;
  2020. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2021. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2022. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2023. BEGIN
  2024. type := type.resolved;
  2025. originalType := type;
  2026. IF type IS SyntaxTree.PointerType THEN
  2027. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2028. END;
  2029. IF type IS SyntaxTree.ObjectType THEN
  2030. BrL(trueL);
  2031. ELSE
  2032. ASSERT(type IS SyntaxTree.RecordType);
  2033. (*
  2034. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2035. *)
  2036. ReuseCopy(left,tag);
  2037. right := TypeDescriptorAdr(type);
  2038. IF ~newObjectFile THEN
  2039. IntermediateCode.MakeMemory(right,addressType);
  2040. END;
  2041. IF backend.cooperative THEN
  2042. repeatL := NewLabel();
  2043. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2044. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2045. END;
  2046. SetLabel(repeatL);
  2047. BreqL(trueL,left,right);
  2048. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2049. BrneL(repeatL,left,nil);
  2050. ELSIF meta.simple THEN
  2051. level := type(SyntaxTree.RecordType).Level();
  2052. (* get type desc tag of level relative to base tag *)
  2053. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2054. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2055. IntermediateCode.MakeMemory(left,addressType);
  2056. BreqL(trueL,left,right);
  2057. ELSE
  2058. level := type(SyntaxTree.RecordType).Level();
  2059. (* get type desc tag of level relative to base tag *)
  2060. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2061. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2062. IntermediateCode.MakeMemory(left,addressType);
  2063. BreqL(trueL,left,right);
  2064. END;
  2065. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2066. BrL(falseL);
  2067. END;
  2068. END TypeTest;
  2069. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  2070. BEGIN
  2071. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2072. IF dump # NIL THEN
  2073. dump.String(s); dump.Ln;
  2074. END;
  2075. END Error;
  2076. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  2077. BEGIN
  2078. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  2079. IF dump # NIL THEN
  2080. dump.String(s); dump.Ln; dump.Update;
  2081. END;
  2082. END Warning;
  2083. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2084. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2085. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2086. operand:Operand;
  2087. BEGIN
  2088. previousSection := section;
  2089. Global.GetModuleName(mod,name);
  2090. Strings.Append(name,".@Trace");
  2091. Basic.ToSegmentedName(name, pooledName);
  2092. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2093. IF dump # NIL THEN dump := section.comments END;
  2094. IF backend.hasLinkRegister THEN
  2095. Emit(Push(-1, lr));
  2096. END;
  2097. variable := mod.moduleScope.firstVariable;
  2098. WHILE variable # NIL DO
  2099. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2100. Symbol(variable, operand);
  2101. register := operand.op;
  2102. CallTraceMethod(register, variable.type);
  2103. ReleaseIntermediateOperand(register);
  2104. END;
  2105. variable := variable.nextVariable;
  2106. END;
  2107. IF backend.hasLinkRegister THEN
  2108. Emit(Pop(-1, lr));
  2109. END;
  2110. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2111. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2112. Emit(Br(position,op));
  2113. INC(statCoopTraceModule, section.pc);
  2114. section := previousSection;
  2115. IF dump # NIL THEN dump := section.comments END;
  2116. END CreateTraceModuleMethod;
  2117. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2118. BEGIN
  2119. Emit (Push(position, dst));
  2120. Emit (Push(position, src));
  2121. CallThis(position,"GarbageCollector","Assign", 2);
  2122. END CallAssignPointer;
  2123. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2124. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2125. BEGIN
  2126. IF SemanticChecker.IsPointerType (type) THEN
  2127. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2128. ELSIF type.IsRecordType() THEN
  2129. Emit (Push(position,dst));
  2130. Emit (Push(position,src));
  2131. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2132. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2133. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2134. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2135. ELSIF IsStaticArray(type) THEN
  2136. size := StaticArrayNumElements(type);
  2137. base := StaticArrayBaseType(type);
  2138. IF base.IsRecordType() THEN
  2139. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2140. Emit (Push(position, dst));
  2141. Emit (Push(position, src));
  2142. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2143. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2144. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2145. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2146. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2147. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2148. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2149. Emit (Push(position, dst));
  2150. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2151. Emit (Push(position, src));
  2152. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2153. ELSE
  2154. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2155. Emit (Push(position, dst));
  2156. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2157. Emit (Push(position, src));
  2158. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2159. ASSERT(StaticArrayBaseType(type).IsPointer());
  2160. END;
  2161. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2162. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2163. Emit (Push(position, dst));
  2164. Emit (Push(position, src));
  2165. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2166. ELSE HALT(100); (* missing ? *)
  2167. END;
  2168. END CallAssignMethod;
  2169. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2170. VAR name: Basic.SegmentedName;
  2171. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2172. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2173. context: Context;
  2174. BEGIN
  2175. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2176. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2177. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2178. GetRecordTypeName (recordType,name);
  2179. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2180. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2181. IF dump # NIL THEN dump := section.comments END;
  2182. IF backend.hasLinkRegister THEN
  2183. Emit(Push(-1, lr));
  2184. END;
  2185. variable := recordType.recordScope.firstVariable;
  2186. WHILE variable # NIL DO
  2187. IF variable.NeedsTrace() THEN
  2188. dst := NewRegisterOperand (addressType);
  2189. src := NewRegisterOperand (addressType);
  2190. Emit (Mov(position, dst, parameter1));
  2191. Emit (Mov(position, src, parameter2));
  2192. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2193. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2194. CallAssignMethod(dst, src, variable.type);
  2195. ReleaseIntermediateOperand(src);
  2196. ReleaseIntermediateOperand(dst);
  2197. END;
  2198. variable := variable.nextVariable;
  2199. END;
  2200. recordBase := recordType.GetBaseRecord();
  2201. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2202. IF backend.hasLinkRegister THEN
  2203. Emit(Pop(-1, lr));
  2204. END;
  2205. GetRecordTypeName (recordBase,name);
  2206. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2207. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2208. Emit(Br(position,op));
  2209. ELSE
  2210. Emit(Exit(position,0,0));
  2211. END;
  2212. IF ~recordType.isObject THEN
  2213. GetRecordTypeName (recordType,name);
  2214. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2215. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2216. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2217. NEW(registerUsageCount);
  2218. usedRegisters := NIL;
  2219. dst := NewRegisterOperand (addressType);
  2220. src := NewRegisterOperand (addressType);
  2221. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2222. Emit(Mov(position, dst, parameter1));
  2223. Emit(Mov(position, src, parameter2));
  2224. label := NewLabel();
  2225. SetLabel(label);
  2226. Emit(Push(position, dst));
  2227. Emit(Push(position, src));
  2228. GetRecordTypeName (recordType,name);
  2229. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2230. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2231. Emit(Call(position, op, 0));
  2232. Emit(Pop(position, src));
  2233. Emit(Pop(position, dst));
  2234. Emit(Add(position, dst, dst, ofs));
  2235. Emit(Add(position, src, src, ofs));
  2236. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2237. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2238. Emit(Exit(position,0,0));
  2239. END;
  2240. INC(statCoopAssignProcedure, section.pc);
  2241. ReturnToContext(context);
  2242. IF dump # NIL THEN dump := section.comments END;
  2243. END CreateAssignProcedure;
  2244. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2245. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2246. BEGIN
  2247. IF IsUnsafePointer (type) THEN
  2248. skip := NewLabel();
  2249. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2250. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2251. BreqL (skip, op, nil);
  2252. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2253. SetLabel (skip);
  2254. ELSIF SemanticChecker.IsPointerType (type) THEN
  2255. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2256. CallThis(position,"GarbageCollector","Mark", 1);
  2257. ELSIF type.IsRecordType() THEN
  2258. Emit (Push(position,register));
  2259. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2260. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2261. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2262. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2263. ELSIF IsStaticArray(type) THEN
  2264. size := StaticArrayNumElements(type);
  2265. base := StaticArrayBaseType(type);
  2266. IF base.IsRecordType() THEN
  2267. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2268. Emit (Push(position, register));
  2269. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2270. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2271. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2272. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2273. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2274. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2275. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2276. Emit (Push(position, register));
  2277. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2278. ELSE
  2279. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2280. Emit (Push(position, register));
  2281. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2282. ASSERT(base.IsPointer());
  2283. END;
  2284. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2285. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2286. CallThis(position,"GarbageCollector","Mark", 1);
  2287. ELSE HALT(100); (* missing ? *)
  2288. END;
  2289. END CallTraceMethod;
  2290. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2291. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2292. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2293. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2294. BEGIN
  2295. previousSection := section;
  2296. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2297. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2298. GetRecordTypeName (recordType,name);
  2299. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2300. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2301. IF dump # NIL THEN dump := section.comments END;
  2302. IF backend.hasLinkRegister THEN
  2303. Emit(Push(-1, lr));
  2304. END;
  2305. variable := recordType.recordScope.firstVariable;
  2306. WHILE variable # NIL DO
  2307. IF variable.NeedsTrace() THEN
  2308. register := NewRegisterOperand (addressType);
  2309. Emit (Mov(position,register,parameter1));
  2310. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2311. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2312. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2313. END;
  2314. CallTraceMethod(register, variable.type);
  2315. ReleaseIntermediateOperand(register);
  2316. END;
  2317. variable := variable.nextVariable;
  2318. END;
  2319. recordBase := recordType.GetBaseRecord();
  2320. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2321. recordBase := recordBase.GetBaseRecord();
  2322. END;
  2323. IF recordBase # NIL THEN
  2324. IF backend.hasLinkRegister THEN
  2325. Emit(Pop(-1, lr));
  2326. END;
  2327. GetRecordTypeName (recordBase,name);
  2328. IF HasExplicitTraceMethod (recordBase) THEN
  2329. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2330. ELSE
  2331. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2332. END;
  2333. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2334. Emit(Br(position,op));
  2335. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2336. Emit(Exit(position,0,0));
  2337. ELSE
  2338. IF backend.hasLinkRegister THEN
  2339. Emit(Pop(-1, lr));
  2340. END;
  2341. IF recordType.isObject THEN
  2342. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2343. ELSE
  2344. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2345. END;
  2346. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2347. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2348. Emit(Br(position,op));
  2349. END;
  2350. IF ~recordType.isObject THEN
  2351. GetRecordTypeName (recordType,name);
  2352. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2353. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2354. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2355. NEW(registerUsageCount);
  2356. usedRegisters := NIL;
  2357. IF dump # NIL THEN dump := section.comments END;
  2358. register := NewRegisterOperand (addressType);
  2359. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2360. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2361. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2362. END;
  2363. Emit (Push(position,register));
  2364. GetRecordTypeName (recordType,name);
  2365. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2366. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2367. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2368. ReleaseIntermediateOperand(register);
  2369. Emit(Exit(position,0,0));
  2370. GetRecordTypeName (recordType,name);
  2371. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2372. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2373. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2374. NEW(registerUsageCount);
  2375. usedRegisters := NIL;
  2376. register := NewRegisterOperand (addressType);
  2377. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2378. Emit(Mov(position, register, parameter1));
  2379. label := NewLabel();
  2380. SetLabel(label);
  2381. Emit(Push(position, register));
  2382. GetRecordTypeName (recordType,name);
  2383. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2384. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2385. Emit(Call(position, op, 0));
  2386. Emit(Pop(position, register));
  2387. Emit(Add(position, register, register, ofs));
  2388. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2389. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2390. Emit(Exit(position,0,0));
  2391. END;
  2392. INC(statCoopTraceMethod, section.pc);
  2393. ReturnToContext(context);
  2394. IF dump # NIL THEN dump := section.comments END;
  2395. END CreateTraceMethod;
  2396. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2397. VAR name: Basic.SegmentedName;
  2398. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2399. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2400. context: Context;
  2401. BEGIN
  2402. IF recordType.isObject THEN RETURN END;
  2403. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2404. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2405. GetRecordTypeName (recordType,name);
  2406. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2407. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2408. IF dump # NIL THEN dump := section.comments END;
  2409. IF backend.hasLinkRegister THEN
  2410. Emit(Push(-1, lr));
  2411. END;
  2412. variable := recordType.recordScope.firstVariable;
  2413. WHILE variable # NIL DO
  2414. IF variable.NeedsTrace() THEN
  2415. dst := NewRegisterOperand (addressType);
  2416. Emit (Mov(position, dst, parameter1));
  2417. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2418. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2419. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2420. END;
  2421. CallResetProcedure(dst, nil, variable.type);
  2422. ReleaseIntermediateOperand(dst);
  2423. END;
  2424. variable := variable.nextVariable;
  2425. END;
  2426. recordBase := recordType.GetBaseRecord();
  2427. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2428. IF backend.hasLinkRegister THEN
  2429. Emit(Pop(-1, lr));
  2430. END;
  2431. GetRecordTypeName (recordBase,name);
  2432. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2433. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2434. Emit(Br(position,op));
  2435. ELSE
  2436. Emit(Exit(position,0,0));
  2437. END;
  2438. GetRecordTypeName (recordType,name);
  2439. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2440. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2441. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2442. NEW(registerUsageCount);
  2443. usedRegisters := NIL;
  2444. dst := NewRegisterOperand (addressType);
  2445. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2446. Emit(Mov(position, dst, parameter1));
  2447. label := NewLabel();
  2448. SetLabel(label);
  2449. Emit(Push(position, dst));
  2450. GetRecordTypeName (recordType,name);
  2451. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2452. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2453. Emit(Call(position, op, 0));
  2454. Emit(Pop(position, dst));
  2455. Emit(Add(position, dst, dst, ofs));
  2456. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2457. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2458. Emit(Exit(position,0,0));
  2459. INC(statCoopResetProcedure, section.pc);
  2460. ReturnToContext(context);
  2461. IF dump # NIL THEN dump := section.comments END;
  2462. END CreateResetProcedure;
  2463. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2464. VAR name: Basic.SegmentedName; context: Context;
  2465. BEGIN
  2466. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2467. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2468. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2469. IF dump # NIL THEN dump := section.comments END;
  2470. IF backend.hasLinkRegister THEN
  2471. Emit(Push(-1, lr));
  2472. END;
  2473. Emit(Push(position,fp));
  2474. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2475. ResetVariables(scope);
  2476. Emit(Pop(position,fp));
  2477. Emit(Exit(position,0,0));
  2478. ReturnToContext(context);
  2479. IF dump # NIL THEN dump := section.comments END;
  2480. END CreateResetMethod;
  2481. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2482. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2483. BEGIN
  2484. IF SemanticChecker.IsPointerType (type) THEN
  2485. Emit (Push(position, dest));
  2486. CallThis(position,"GarbageCollector","Reset", 1);
  2487. ELSIF type.IsRecordType() THEN
  2488. Emit (Push(position, dest));
  2489. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2490. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2491. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2492. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2493. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2494. size := GetArrayLength(type, tag);
  2495. base := ArrayBaseType(type);
  2496. IF base.IsRecordType() THEN
  2497. Emit (Push(position, size));
  2498. Emit (Push(position, dest));
  2499. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2500. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2501. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2502. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2503. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2504. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2505. Emit (Push(position, size));
  2506. Emit (Push(position, dest));
  2507. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2508. ELSE
  2509. Emit (Push(position, size));
  2510. Emit (Push(position, dest));
  2511. CallThis(position,"GarbageCollector","ResetArray", 2);
  2512. ASSERT(ArrayBaseType(type).IsPointer());
  2513. END;
  2514. ReleaseIntermediateOperand(size);
  2515. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2516. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2517. Emit (Push(position, dest));
  2518. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2519. ELSE HALT(100); (* missing ? *)
  2520. END;
  2521. END CallResetProcedure;
  2522. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2523. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2524. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2525. VAR operand: Operand;
  2526. BEGIN
  2527. Symbol (symbol, operand);
  2528. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2529. ReleaseOperand(operand);
  2530. END Reset;
  2531. BEGIN
  2532. previousScope := currentScope;
  2533. currentScope := scope;
  2534. pc := section.pc;
  2535. variable := scope.firstVariable;
  2536. WHILE variable # NIL DO
  2537. IF variable.NeedsTrace() THEN
  2538. Reset (variable);
  2539. END;
  2540. variable := variable.nextVariable;
  2541. END;
  2542. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2543. WHILE parameter # NIL DO
  2544. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2545. Reset (parameter);
  2546. END;
  2547. parameter := parameter.nextParameter;
  2548. END;
  2549. INC(statCoopResetVariables, section.pc - pc);
  2550. currentScope := previousScope;
  2551. END ResetVariables;
  2552. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2553. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2554. VAR op: IntermediateCode.Operand; context: Context;
  2555. BEGIN
  2556. previousSection := section;
  2557. GetCodeSectionNameForSymbol(procedure, name);
  2558. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2559. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2560. IF dump # NIL THEN dump := section.comments END;
  2561. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2562. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2563. Emit(Data(position,op));
  2564. Emit(Data(position,nil));
  2565. IF HasPointers (procedure.procedureScope) THEN
  2566. GetCodeSectionNameForSymbol(procedure, name);
  2567. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2568. ELSE
  2569. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2570. END;
  2571. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2572. Emit(Data(position,op));
  2573. ReturnToContext(context);
  2574. IF dump # NIL THEN dump := section.comments END;
  2575. END CreateProcedureDescriptor;
  2576. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2577. VAR import: SyntaxTree.Import;
  2578. s: Basic.MessageString;
  2579. selfName: SyntaxTree.IdentifierString;
  2580. BEGIN
  2581. moduleScope.ownerModule.GetName(selfName);
  2582. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2583. module := moduleScope.ownerModule
  2584. ELSE
  2585. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2586. IF import = NIL THEN
  2587. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2588. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2589. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2590. s := "Module ";
  2591. Strings.Append(s,moduleName);
  2592. Strings.Append(s," cannot be imported.");
  2593. IF force THEN
  2594. Error(position,s);
  2595. ELSIF canBeLoaded THEN
  2596. Strings.Append(s, "=> no dynamic linking.");
  2597. Warning(position, s);
  2598. canBeLoaded := FALSE;
  2599. END;
  2600. RETURN FALSE
  2601. ELSE
  2602. SELF.module.imports.AddName(moduleName)
  2603. END;
  2604. ELSIF import.module = NIL THEN (* already tried *)
  2605. RETURN FALSE
  2606. END;
  2607. module := import.module;
  2608. END;
  2609. RETURN TRUE
  2610. END AddImport;
  2611. (* needed for old binary object file format*)
  2612. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2613. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2614. BEGIN
  2615. IF AddImport(moduleName,module,TRUE) THEN
  2616. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2617. IF procedure = NIL THEN
  2618. s := "Instruction not supported on target, emulation procedure ";
  2619. Strings.Append(s,moduleName);
  2620. Strings.Append(s,".");
  2621. Strings.Append(s,procedureName);
  2622. Strings.Append(s," not present");
  2623. Error(position,s);
  2624. ELSE
  2625. StaticCallOperand(r,procedure);
  2626. ReleaseOperand(r);
  2627. fp := GetFingerprint(procedure);
  2628. END;
  2629. END;
  2630. END EnsureSymbol;
  2631. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2632. VAR exit: Label; trueL,falseL: Label;
  2633. BEGIN
  2634. trueL := NewLabel();
  2635. falseL := NewLabel();
  2636. exit := NewLabel();
  2637. Condition(x,trueL,falseL);
  2638. InitOperand(result,ModeValue);
  2639. SetLabel(trueL);
  2640. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2641. Emit(Mov(position,result.op,true));
  2642. BrL(exit);
  2643. SetLabel(falseL);
  2644. Emit(MovReplace(position,result.op,false));
  2645. SetLabel(exit);
  2646. END ConditionToValue;
  2647. PROCEDURE ValueToCondition(VAR op: Operand);
  2648. BEGIN
  2649. LoadValue(op,system.booleanType);
  2650. BrneL(trueLabel,op.op, false);
  2651. ReleaseOperand(op);
  2652. BrL(falseLabel);
  2653. END ValueToCondition;
  2654. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2655. VAR size: LONGINT;
  2656. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2657. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2658. BEGIN
  2659. ASSERT(type.form = SyntaxTree.Open);
  2660. baseType := type.arrayBase.resolved;
  2661. IF IsOpenArray(baseType) THEN
  2662. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2663. ELSE
  2664. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2665. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2666. END;
  2667. len := tag;
  2668. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2669. IntermediateCode.MakeMemory(len,addressType);
  2670. UseIntermediateOperand(len);
  2671. Reuse2(res,sizeOperand,len);
  2672. Emit(Mul(position,res,sizeOperand,len));
  2673. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2674. RETURN res
  2675. END GetArraySize;
  2676. BEGIN
  2677. type := type.resolved;
  2678. IF IsOpenArray(type) THEN
  2679. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2680. RETURN tag
  2681. ELSE
  2682. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2683. END;
  2684. ELSE
  2685. size := ToMemoryUnits(system,system.SizeOf(type));
  2686. RETURN IntermediateCode.Immediate(addressType,size)
  2687. END;
  2688. END GetDynamicSize;
  2689. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2690. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2691. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2692. BEGIN
  2693. ASSERT(type.form = SyntaxTree.Open);
  2694. baseType := type.arrayBase.resolved;
  2695. IF IsOpenArray(baseType) THEN
  2696. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2697. ELSE
  2698. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2699. END;
  2700. len := tag;
  2701. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2702. IntermediateCode.MakeMemory(len,addressType);
  2703. UseIntermediateOperand(len);
  2704. Reuse2(res,sizeOperand,len);
  2705. Emit(Mul(position,res,sizeOperand,len));
  2706. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2707. RETURN res
  2708. END GetLength;
  2709. BEGIN
  2710. type := type.resolved;
  2711. IF IsOpenArray(type) THEN
  2712. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2713. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2714. ELSE
  2715. RETURN IntermediateCode.Immediate(addressType,1)
  2716. END;
  2717. END GetArrayLength;
  2718. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2719. VAR result: IntermediateCode.Operand;
  2720. BEGIN
  2721. IF backend.cooperative THEN
  2722. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2723. ELSE
  2724. MakeMemory(result, tag, addressType, 0);
  2725. END;
  2726. RETURN result
  2727. END GetSizeFromTag;
  2728. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2729. VAR parameter: SyntaxTree.Parameter;
  2730. BEGIN
  2731. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2732. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2733. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2734. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2735. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2736. END;
  2737. RETURN GetDynamicSize(e.type, tag);
  2738. END GetArrayOfBytesSize;
  2739. (*
  2740. to find imported symbol. not needed ?
  2741. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2742. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2743. BEGIN
  2744. IF AddImport(moduleName,importedModule,FALSE) THEN
  2745. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2746. RETURN symbol
  2747. ELSE
  2748. RETURN NIL
  2749. END
  2750. END SymbolByName;
  2751. *)
  2752. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2753. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2754. BEGIN
  2755. IF AddImport(moduleName,runtimeModule,force) THEN
  2756. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2757. IF procedure = NIL THEN
  2758. s := "Procedure ";
  2759. Strings.Append(s,moduleName);
  2760. Strings.Append(s,".");
  2761. Strings.Append(s,procedureName);
  2762. Strings.Append(s," not present");
  2763. Error(position,s);
  2764. RETURN FALSE
  2765. ELSE
  2766. RETURN TRUE
  2767. END;
  2768. ELSE RETURN FALSE
  2769. END;
  2770. END GetRuntimeProcedure;
  2771. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2772. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2773. s: Basic.MessageString;
  2774. BEGIN
  2775. Basic.InitSegmentedName(name);
  2776. name[0] := Basic.MakeString(moduleName);
  2777. name[1] := Basic.MakeString(typeName);
  2778. name[2] := -1;
  2779. IF AddImport(moduleName,importedModule, FALSE) THEN
  2780. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2781. IF symbol = NIL THEN
  2782. s := "type ";
  2783. Strings.Append(s,moduleName);
  2784. Strings.Append(s,".");
  2785. Strings.Append(s,typeName);
  2786. Strings.Append(s," not present");
  2787. Error(position,s);
  2788. END;
  2789. ELSE symbol := NIL;
  2790. END;
  2791. IF importedModule = moduleScope.ownerModule THEN
  2792. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2793. ELSE
  2794. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2795. END;
  2796. RETURN symbol
  2797. END GetTypeDescriptor;
  2798. (* 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. *)
  2799. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2800. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2801. pooledName: Basic.SegmentedName; size: LONGINT;
  2802. BEGIN
  2803. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2804. StaticCallOperand(result,procedure);
  2805. IF numberParameters < 0 THEN
  2806. size := ProcedureParametersSize(system,procedure);
  2807. ELSE
  2808. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2809. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2810. Error(position,"runtime call parameter count mismatch");
  2811. END;
  2812. END;
  2813. Emit(Call(position, result.op, size));
  2814. ReleaseOperand(result);
  2815. ELSE (* only static linking possible *)
  2816. ASSERT(numberParameters >= 0);
  2817. Basic.InitSegmentedName(pooledName);
  2818. pooledName[0] := Basic.MakeString(moduleName);
  2819. pooledName[1] := Basic.MakeString(procedureName);
  2820. pooledName[2] := -1;
  2821. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2822. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2823. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2824. END;
  2825. END CallThisChecked;
  2826. (* 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. *)
  2827. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2828. BEGIN
  2829. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2830. END CallThis;
  2831. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2832. VAR
  2833. left,right: Operand;
  2834. leftSize, rightSize: IntermediateCode.Operand;
  2835. saved: RegisterEntry;
  2836. reg: IntermediateCode.Operand;
  2837. procedureName: SyntaxTree.IdentifierString;
  2838. BEGIN
  2839. procedureName := "CompareString";
  2840. SaveRegisters();ReleaseUsedRegisters(saved);
  2841. Designate(leftExpression,left);
  2842. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2843. Emit(Push(position,leftSize));
  2844. ReleaseIntermediateOperand(leftSize);
  2845. Emit(Push(position,left.op));
  2846. ReleaseOperand(left);
  2847. Designate(rightExpression,right);
  2848. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2849. Emit(Push(position,rightSize));
  2850. ReleaseIntermediateOperand(rightSize);
  2851. Emit(Push(position,right.op));
  2852. ReleaseOperand(right);
  2853. IF backend.cooperative THEN
  2854. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2855. ELSE
  2856. CallThis(position,runtimeModuleName,procedureName, 4);
  2857. END;
  2858. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2859. Emit(Result(position,reg));
  2860. (*
  2861. AcquireThisRegister(int8,IntermediateCode.Result);
  2862. *)
  2863. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2864. (*
  2865. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2866. *)
  2867. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2868. ReleaseIntermediateOperand(reg);
  2869. BrL(falseLabel);
  2870. END CompareString;
  2871. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2872. VAR
  2873. left,right: Operand;
  2874. leftSize, rightSize: IntermediateCode.Operand;
  2875. saved: RegisterEntry;
  2876. procedureName: SyntaxTree.IdentifierString;
  2877. BEGIN
  2878. procedureName := "CopyString";
  2879. SaveRegisters();ReleaseUsedRegisters(saved);
  2880. Designate(leftExpression,left);
  2881. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2882. Emit(Push(position,leftSize));
  2883. ReleaseIntermediateOperand(leftSize);
  2884. Emit(Push(position,left.op));
  2885. ReleaseOperand(left);
  2886. Designate(rightExpression,right);
  2887. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2888. Emit(Push(position,rightSize));
  2889. ReleaseIntermediateOperand(rightSize);
  2890. Emit(Push(position,right.op));
  2891. ReleaseOperand(right);
  2892. IF backend.cooperative THEN
  2893. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2894. ELSE
  2895. CallThis(position,runtimeModuleName,procedureName,4);
  2896. END;
  2897. RestoreRegisters(saved);
  2898. END CopyString;
  2899. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2900. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2901. leftType,rightType: SyntaxTree.Type;
  2902. leftExpression,rightExpression : SyntaxTree.Expression;
  2903. componentType: IntermediateCode.Type;
  2904. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2905. size: LONGINT;
  2906. BEGIN
  2907. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2908. dest := destination; destination := emptyOperand;
  2909. leftType := x.left.type.resolved;
  2910. rightType := x.right.type.resolved;
  2911. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2912. CASE x.operator OF
  2913. Scanner.Or:
  2914. (* shortcut evaluation of left OR right *)
  2915. IF ~conditional THEN ConditionToValue(x);
  2916. ELSE
  2917. next := NewLabel();
  2918. Condition(x.left,trueLabel,next);
  2919. SetLabel(next);
  2920. Condition(x.right,trueLabel,falseLabel);
  2921. END;
  2922. |Scanner.And:
  2923. (* shortcut evaluation of left & right *)
  2924. IF ~conditional THEN ConditionToValue(x);
  2925. ELSE
  2926. next := NewLabel();
  2927. Condition(x.left,next,falseLabel);
  2928. SetLabel(next);
  2929. Condition(x.right,trueLabel,falseLabel);
  2930. END;
  2931. |Scanner.Is:
  2932. IF ~conditional THEN ConditionToValue(x);
  2933. ELSE
  2934. (* get type desc tag *)
  2935. IF IsPointerToRecord(leftType,recordType) THEN
  2936. Evaluate(x.left,left);
  2937. Dereference(left,recordType,IsUnsafePointer(leftType))
  2938. ELSE
  2939. Designate(x.left,left);
  2940. END;
  2941. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2942. ReleaseOperand(left);
  2943. END;
  2944. |Scanner.Plus:
  2945. Evaluate(x.left,left);
  2946. Evaluate(x.right,right);
  2947. IF leftType IS SyntaxTree.SetType THEN
  2948. InitOperand(result,ModeValue);
  2949. Reuse2a(result.op,left.op,right.op,dest);
  2950. Emit(Or(position,result.op,left.op,right.op));
  2951. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2952. InitOperand(result,ModeValue);
  2953. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2954. Reuse2(result.tag,left.tag,right.tag);
  2955. Emit(Add(position,result.op,left.op,right.op));
  2956. Emit(Add(position,result.tag,left.tag,right.tag))
  2957. ELSE
  2958. InitOperand(result,ModeValue);
  2959. Reuse2a(result.op,left.op,right.op,dest);
  2960. Emit(Add(position,result.op,left.op,right.op));
  2961. END;
  2962. ReleaseOperand(left); ReleaseOperand(right);
  2963. |Scanner.Minus:
  2964. Evaluate(x.left,left);
  2965. Evaluate(x.right,right);
  2966. IF leftType IS SyntaxTree.SetType THEN
  2967. InitOperand(result,ModeValue);
  2968. Reuse1(result.op,right.op);
  2969. Emit(Not(position,result.op,right.op));
  2970. ReleaseOperand(right);
  2971. Emit(And(position,result.op,result.op,left.op));
  2972. ReleaseOperand(left);
  2973. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2974. InitOperand(result,ModeValue);
  2975. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2976. Reuse2(result.tag,left.tag,right.tag);
  2977. Emit(Sub(position,result.op,left.op,right.op));
  2978. Emit(Sub(position,result.tag,left.tag,right.tag));
  2979. ReleaseOperand(left); ReleaseOperand(right)
  2980. ELSE
  2981. InitOperand(result,ModeValue);
  2982. Reuse2a(result.op,left.op,right.op,dest);
  2983. Emit(Sub(position,result.op,left.op,right.op));
  2984. ReleaseOperand(left); ReleaseOperand(right);
  2985. END;
  2986. |Scanner.Times:
  2987. Evaluate(x.left,left);
  2988. Evaluate(x.right,right);
  2989. IF leftType IS SyntaxTree.SetType THEN
  2990. InitOperand(result,ModeValue);
  2991. Reuse2a(result.op,left.op,right.op,dest);
  2992. Emit(And(position,result.op,left.op,right.op));
  2993. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2994. InitOperand(result,ModeValue);
  2995. Reuse1a(result.op,left.op,dest);
  2996. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2997. Emit(Shl(position,result.op,left.op,right.op));
  2998. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2999. InitOperand(result, ModeValue);
  3000. componentType := left.op.type;
  3001. (* TODO: review this *)
  3002. (*
  3003. result.op = left.op * right.op - left.tag * right.tag
  3004. result.tag = left.tag * right.op + left.op * right.tag
  3005. *)
  3006. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3007. Emit(Mul(position,result.op, left.op, right.op));
  3008. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3009. Emit(Mul(position,tempReg, left.tag, right.tag));
  3010. Emit(Sub(position,result.op, result.op, tempReg));
  3011. Reuse2(result.tag, left.tag, right.op);
  3012. Emit(Mul(position,result.tag, left.tag, right.op));
  3013. Emit(Mul(position,tempReg, left.op, right.tag));
  3014. Emit(Add(position,result.tag, result.tag, tempReg));
  3015. ReleaseIntermediateOperand(tempReg)
  3016. ELSE
  3017. InitOperand(result,ModeValue);
  3018. Reuse2a(result.op,left.op,right.op,dest);
  3019. Emit(Mul(position,result.op,left.op,right.op));
  3020. END;
  3021. ReleaseOperand(left); ReleaseOperand(right);
  3022. |Scanner.Div:
  3023. Evaluate(x.left,left);
  3024. Evaluate(x.right,right);
  3025. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3026. InitOperand(result,ModeValue);
  3027. Reuse1a(result.op,left.op,dest);
  3028. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  3029. Emit(Shr(position,result.op,left.op,right.op));
  3030. ELSE
  3031. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3032. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3033. IF ~isUnchecked THEN
  3034. exit := NewLabel();
  3035. BrltL(exit,zero,right.op);
  3036. EmitTrap(position,NegativeDivisorTrap);
  3037. SetLabel(exit);
  3038. END;
  3039. END;
  3040. InitOperand(result,ModeValue);
  3041. Reuse2a(result.op,left.op,right.op,dest);
  3042. Emit(Div(position,result.op,left.op,right.op));
  3043. END;
  3044. ReleaseOperand(left); ReleaseOperand(right);
  3045. |Scanner.Mod:
  3046. Evaluate(x.left,left);
  3047. Evaluate(x.right,right);
  3048. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3049. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  3050. InitOperand(result,ModeValue);
  3051. Reuse1a(result.op,left.op,dest);
  3052. Emit(And(position,result.op,left.op,right.op));
  3053. ELSE
  3054. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3055. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3056. IF ~isUnchecked THEN
  3057. exit := NewLabel();
  3058. BrltL(exit,zero,right.op);
  3059. EmitTrap(position,NegativeDivisorTrap);
  3060. SetLabel(exit);
  3061. END;
  3062. END;
  3063. InitOperand(result,ModeValue);
  3064. Reuse2a(result.op,left.op,right.op,dest);
  3065. Emit(Mod(position,result.op,left.op,right.op));
  3066. END;
  3067. ReleaseOperand(left); ReleaseOperand(right);
  3068. |Scanner.Slash:
  3069. Evaluate(x.left,left);
  3070. Evaluate(x.right,right);
  3071. IF leftType IS SyntaxTree.SetType THEN
  3072. InitOperand(result,ModeValue);
  3073. Reuse2a(result.op,left.op,right.op,dest);
  3074. Emit(Xor(position,result.op,left.op,right.op));
  3075. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3076. InitOperand(result,ModeValue);
  3077. componentType := left.op.type;
  3078. (* review this *)
  3079. (*
  3080. divisor = right.op * right.op + right.tag * right.tag
  3081. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3082. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3083. *)
  3084. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3085. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3086. Emit(Mul(position,tempReg, right.op, right.op));
  3087. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3088. Emit(Add(position,tempReg, tempReg, tempReg2));
  3089. result.op := tempReg2;
  3090. Emit(Mul(position,result.op, left.op, right.op));
  3091. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3092. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3093. Emit(Add(position,result.op, result.op, tempReg2));
  3094. Emit(Div(position,result.op, result.op, tempReg));
  3095. Reuse2(result.tag, left.tag, right.op);
  3096. Emit(Mul(position,result.tag, left.tag, right.op));
  3097. Emit(Mul(position,tempReg2, left.op, right.tag));
  3098. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3099. Emit(Div(position,result.tag, result.tag, tempReg));
  3100. ReleaseIntermediateOperand(tempReg);
  3101. ReleaseIntermediateOperand(tempReg2)
  3102. ELSE
  3103. InitOperand(result,ModeValue);
  3104. Reuse2a(result.op,left.op,right.op,dest);
  3105. Emit(Div(position,result.op,left.op,right.op));
  3106. END;
  3107. ReleaseOperand(left); ReleaseOperand(right);
  3108. |Scanner.Equal:
  3109. IF ~conditional THEN ConditionToValue(x);
  3110. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3111. CompareString(BreqL,x.left,x.right);
  3112. ELSE
  3113. Evaluate(x.left,left);
  3114. Evaluate(x.right,right);
  3115. IF leftType IS SyntaxTree.RangeType THEN
  3116. ASSERT(rightType IS SyntaxTree.RangeType);
  3117. BrneL(falseLabel, left.op, right.op); (* first *)
  3118. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3119. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3120. ReleaseOperand(left); ReleaseOperand(right);
  3121. BrL(trueLabel)
  3122. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3123. BrneL(falseLabel, left.op, right.op); (* first *)
  3124. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3125. ReleaseOperand(left); ReleaseOperand(right);
  3126. BrL(trueLabel)
  3127. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3128. (* TODO: review this *)
  3129. BrneL(falseLabel, left.op, right.op); (* real part *)
  3130. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3131. ReleaseOperand(left); ReleaseOperand(right);
  3132. BrL(trueLabel)
  3133. ELSE
  3134. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3135. ReleaseOperand(left); ReleaseOperand(right);
  3136. BrL(trueLabel);
  3137. END;
  3138. END;
  3139. |Scanner.LessEqual:
  3140. IF ~conditional THEN ConditionToValue(x);
  3141. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3142. CompareString(BrgeL,x.right,x.left);
  3143. ELSE
  3144. Evaluate(x.left,left);
  3145. Evaluate(x.right,right);
  3146. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3147. Reuse1(temp.op,right.op);
  3148. Emit(And(position,temp.op,left.op,right.op));
  3149. ReleaseOperand(right);
  3150. BreqL(trueLabel,temp.op,left.op);
  3151. BrL(falseLabel);
  3152. ReleaseOperand(temp);ReleaseOperand(left);
  3153. ELSE
  3154. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3155. ReleaseOperand(left); ReleaseOperand(right);
  3156. BrL(trueLabel);
  3157. END;
  3158. END;
  3159. |Scanner.Less:
  3160. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3161. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3162. leftExpression.SetType(system.booleanType);
  3163. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3164. rightExpression.SetType(system.booleanType);
  3165. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3166. leftExpression.SetType(system.booleanType);
  3167. Expression(leftExpression);
  3168. ELSIF ~conditional THEN ConditionToValue(x);
  3169. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3170. CompareString(BrltL,x.left,x.right);
  3171. ELSE
  3172. Evaluate(x.left,left);
  3173. Evaluate(x.right,right);
  3174. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3175. ReleaseOperand(left); ReleaseOperand(right);
  3176. BrL(trueLabel);
  3177. END;
  3178. |Scanner.Greater:
  3179. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3180. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3181. leftExpression.SetType(system.booleanType);
  3182. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3183. rightExpression.SetType(system.booleanType);
  3184. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3185. leftExpression.SetType(system.booleanType);
  3186. Expression(leftExpression);
  3187. ELSIF ~conditional THEN ConditionToValue(x);
  3188. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3189. CompareString(BrltL,x.right,x.left);
  3190. ELSE
  3191. Evaluate(x.left,left);
  3192. Evaluate(x.right,right);
  3193. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3194. ReleaseOperand(left); ReleaseOperand(right);
  3195. BrL(trueLabel);
  3196. END;
  3197. |Scanner.GreaterEqual:
  3198. IF ~conditional THEN ConditionToValue(x);
  3199. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3200. CompareString(BrgeL,x.left,x.right);
  3201. ELSE
  3202. Evaluate(x.left,left);
  3203. Evaluate(x.right,right);
  3204. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3205. Reuse1(temp.op,left.op);
  3206. Emit(And(position,temp.op,left.op,right.op));
  3207. ReleaseOperand(left);
  3208. BreqL(trueLabel, temp.op,right.op);
  3209. ReleaseOperand(temp); ReleaseOperand(right);
  3210. BrL(falseLabel);
  3211. ELSE
  3212. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3213. ReleaseOperand(left); ReleaseOperand(right);
  3214. BrL(trueLabel);
  3215. END;
  3216. END;
  3217. |Scanner.Unequal:
  3218. IF ~conditional THEN ConditionToValue(x);
  3219. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3220. CompareString(BrneL,x.left,x.right);
  3221. ELSE
  3222. Evaluate(x.left,left);
  3223. Evaluate(x.right,right);
  3224. IF leftType IS SyntaxTree.RangeType THEN
  3225. ASSERT(rightType IS SyntaxTree.RangeType);
  3226. BrneL(trueLabel, left.op, right.op); (* first *)
  3227. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3228. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3229. ReleaseOperand(left); ReleaseOperand(right);
  3230. BrL(falseLabel)
  3231. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3232. BrneL(trueLabel, left.op, right.op); (* first *)
  3233. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3234. ReleaseOperand(left); ReleaseOperand(right);
  3235. BrL(falseLabel)
  3236. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3237. (* TODO: review this *)
  3238. BrneL(trueLabel, left.op, right.op); (* real part *)
  3239. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3240. ReleaseOperand(left); ReleaseOperand(right);
  3241. BrL(falseLabel)
  3242. ELSE
  3243. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3244. ReleaseOperand(left); ReleaseOperand(right);
  3245. BrL(trueLabel);
  3246. END;
  3247. END;
  3248. |Scanner.In:
  3249. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3250. Evaluate(x.left,left);
  3251. Evaluate(x.right,right);
  3252. Convert(left.op,setType);
  3253. ReuseCopy(temp.op,right.op);
  3254. Emit(Shr(position,temp.op,temp.op,left.op));
  3255. ReleaseOperand(right); ReleaseOperand(left);
  3256. IntermediateCode.InitImmediate(one,setType,1);
  3257. Emit(And(position,temp.op,temp.op,one));
  3258. IF conditional THEN
  3259. IntermediateCode.InitImmediate(zero,setType,0);
  3260. BrneL(trueLabel,temp.op,zero);
  3261. ReleaseOperand(temp);
  3262. BrL(falseLabel);
  3263. ELSE
  3264. Convert(temp.op,bool);
  3265. result.mode := ModeValue;
  3266. result.op := temp.op;
  3267. result.tag := nil; (* may be left over from calls to evaluate *)
  3268. END;
  3269. ELSE
  3270. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3271. IF x.operator = Scanner.Questionmarks THEN
  3272. leftExpression := x.left;
  3273. rightExpression := x.right;
  3274. ELSE
  3275. leftExpression := x.right;
  3276. rightExpression := x.left;
  3277. END;
  3278. Evaluate(leftExpression, left);
  3279. Emit(Push(position,left.op));
  3280. ReleaseOperand(left);
  3281. Designate(rightExpression, right);
  3282. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3283. IF ~backend.cellsAreObjects THEN
  3284. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3285. END;
  3286. Emit(Push(position,right.op));
  3287. ReleaseOperand(right);
  3288. IF backend.cellsAreObjects THEN
  3289. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3290. ELSE
  3291. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3292. END;
  3293. InitOperand(result, ModeValue);
  3294. result.op := NewRegisterOperand(bool);
  3295. Emit(Result(position,result.op));
  3296. IF conditional THEN
  3297. IntermediateCode.InitImmediate(zero,setType,0);
  3298. BrneL(trueLabel,result.op,zero);
  3299. ReleaseOperand(result);
  3300. BrL(falseLabel);
  3301. END;
  3302. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3303. leftExpression := x.left;
  3304. rightExpression := x.right;
  3305. Evaluate(leftExpression, left);
  3306. Emit(Push(position,left.op));
  3307. ReleaseOperand(left);
  3308. Evaluate(rightExpression, right);
  3309. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3310. IF ~backend.cellsAreObjects THEN
  3311. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3312. END;
  3313. Emit(Push(position,right.op));
  3314. ReleaseOperand(right);
  3315. IF backend.cellsAreObjects THEN
  3316. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3317. ELSE
  3318. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3319. END;
  3320. InitOperand(result, ModeValue);
  3321. result.op := NewRegisterOperand(bool);
  3322. Emit(Result(position,result.op));
  3323. IF conditional THEN
  3324. IntermediateCode.InitImmediate(zero,setType,0);
  3325. BrneL(trueLabel,result.op,zero);
  3326. ReleaseOperand(result);
  3327. BrL(falseLabel);
  3328. END;
  3329. ELSE
  3330. HALT(100);
  3331. END;
  3332. END;
  3333. destination := dest;
  3334. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3335. END VisitBinaryExpression;
  3336. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3337. VAR localResult, operand: Operand;
  3338. BEGIN
  3339. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3340. InitOperand(localResult, ModeValue);
  3341. ASSERT(x.first # NIL);
  3342. Evaluate(x.first, operand);
  3343. localResult.op := operand.op;
  3344. ReleaseOperand(operand);
  3345. UseIntermediateOperand(localResult.op);
  3346. ASSERT(x.last # NIL);
  3347. Evaluate(x.last, operand);
  3348. localResult.tag := operand.op;
  3349. ReleaseOperand(operand);
  3350. UseIntermediateOperand(localResult.tag);
  3351. IF x.step # NIL THEN
  3352. Evaluate(x.step, operand);
  3353. localResult.extra := operand.op;
  3354. ReleaseOperand(operand);
  3355. UseIntermediateOperand(localResult.extra);
  3356. END;
  3357. result := localResult;
  3358. IF Trace THEN TraceExit("VisitRangeExpression") END
  3359. END VisitRangeExpression;
  3360. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3361. BEGIN
  3362. HALT(100); (* should never be evaluated *)
  3363. END VisitTensorRangeExpression;
  3364. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3365. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3366. BEGIN
  3367. IF Trace THEN TraceEnter("VisitConversion") END;
  3368. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3369. dest := destination; destination := emptyOperand;
  3370. Evaluate(x.expression,old);
  3371. InitOperand(result,ModeValue);
  3372. result.op := old.op;
  3373. ASSERT(result.op.mode # 0);
  3374. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3375. (* convert TO a complex number *)
  3376. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3377. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3378. ASSERT(result.op.mode # 0);
  3379. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3380. (* convert FROM a complex number TO a complex number*)
  3381. result.tag := old.tag;
  3382. ASSERT(result.tag.mode # 0);
  3383. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3384. ASSERT(result.tag.mode # 0)
  3385. ELSE
  3386. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3387. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3388. END
  3389. ELSE
  3390. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3391. ASSERT(result.op.mode # 0);
  3392. result.tag := old.tag; (*! probably never used *)
  3393. END;
  3394. destination := dest;
  3395. IF Trace THEN TraceExit("VisitConversion") END;
  3396. END VisitConversion;
  3397. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3398. BEGIN
  3399. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3400. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3401. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3402. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3403. END VisitTypeDeclaration;
  3404. (** designators (expressions) *)
  3405. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3406. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3407. BEGIN
  3408. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3409. IF x.left # NIL THEN Expression(x.left) END;
  3410. Symbol(x.symbol,result);
  3411. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3412. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3413. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3414. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3415. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3416. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3417. END;
  3418. END;
  3419. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3420. END VisitSymbolDesignator;
  3421. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3422. BEGIN
  3423. IF isUnchecked THEN RETURN END;
  3424. IF tagsAvailable THEN
  3425. TrapC(BrltL,index,length,IndexCheckTrap);
  3426. END;
  3427. END BoundCheck;
  3428. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3429. VAR d: IntermediateCode.Operand;
  3430. BEGIN
  3431. IF isUnchecked THEN RETURN END;
  3432. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3433. TrapC(op,dim,d,ArraySizeTrap);
  3434. ReleaseIntermediateOperand(d);
  3435. END DimensionCheck;
  3436. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3437. VAR
  3438. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3439. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3440. expression: SyntaxTree.Expression;
  3441. resultingType, leftType, baseType: SyntaxTree.Type;
  3442. skipLabel1: Label;
  3443. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3444. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3445. variableOp: Operand;
  3446. variable: SyntaxTree.Variable;
  3447. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3448. VAR expression: SyntaxTree.Expression;
  3449. BEGIN
  3450. (* count the number of indices, ranges and tensorRanges in the index list *)
  3451. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3452. FOR i := 0 TO parameters.Length() - 1 DO
  3453. expression := parameters.GetExpression(i);
  3454. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3455. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3456. ELSE INC(indexCount)
  3457. END
  3458. END;
  3459. END CountIndices;
  3460. BEGIN
  3461. ASSERT(tagsAvailable);
  3462. resultingType := x.type.resolved; (* resulting type *)
  3463. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3464. InitOperand(localResult, ModeReference);
  3465. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3466. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3467. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3468. (* a globally defined array destination tag is available -> use and invalidate it*)
  3469. localResult.tag := arrayDestinationTag;
  3470. IntermediateCode.InitOperand(arrayDestinationTag)
  3471. ELSE
  3472. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3473. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3474. Symbol(variable, variableOp);
  3475. ReuseCopy(localResult.tag, variableOp.op);
  3476. ReleaseOperand(variableOp);
  3477. END
  3478. END;
  3479. indexListSize := x.parameters.Length();
  3480. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3481. ASSERT(tensorRangeCount <= 1);
  3482. (* designate the array to be indexed over, perform tensor range check if known *)
  3483. Designate(x.left, array);
  3484. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3485. Dereference(array, leftType,FALSE);
  3486. IF tensorRangeCount=0 THEN
  3487. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3488. END
  3489. END;
  3490. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3491. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3492. srcDimOffset := -indexListSize;
  3493. destDimOffset := -rangeCount
  3494. ELSE
  3495. srcDimOffset := 0;
  3496. destDimOffset := 0
  3497. END;
  3498. indexDim := 0;
  3499. (* use address of source array as basis *)
  3500. (*
  3501. ReuseCopy(localResult.op, array.op);
  3502. *)
  3503. localResult.op := array.op;
  3504. UseIntermediateOperand(localResult.op);
  3505. (* go through the index list *)
  3506. FOR i := 0 TO indexListSize - 1 DO
  3507. expression := x.parameters.GetExpression(i);
  3508. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3509. (* nothing to do *)
  3510. ELSE
  3511. (* determine which dimension of source array is currently looked at *)
  3512. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3513. (* get the memory operand pointing to array descriptor dimension *)
  3514. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3515. (* make a reusable register from it *)
  3516. ReuseCopy(srcDim, tmp);
  3517. ReleaseIntermediateOperand(tmp);
  3518. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3519. ELSE
  3520. srcDim := IntermediateCode.Immediate(int32, i)
  3521. END;
  3522. (* get length and increment of source array for current dimension *)
  3523. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3524. Convert(sourceLength.op, sizeType);
  3525. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3526. Convert(sourceIncrement.op, sizeType);
  3527. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3528. ReleaseIntermediateOperand(srcDim);
  3529. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3530. (* SINGLE INDEX *)
  3531. Evaluate(expression, index);
  3532. ReleaseIntermediateOperand(index.tag);
  3533. index.tag := emptyOperand;
  3534. Convert(index.op, sizeType);
  3535. (* lower bound check *)
  3536. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3537. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3538. ELSIF isUnchecked THEN (* do nothing *)
  3539. ELSE
  3540. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3541. END;
  3542. (* upper bound check *)
  3543. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3544. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3545. ELSIF isUnchecked THEN (* do nothing *)
  3546. ELSE
  3547. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3548. END;
  3549. ReleaseOperand(sourceLength);
  3550. Convert(index.op, addressType);
  3551. summand := index.op;
  3552. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3553. (* RANGE OF INDICES *)
  3554. Evaluate(expression, range);
  3555. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3556. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3557. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3558. ReleaseOperand(range);
  3559. Convert(firstIndex, sizeType);
  3560. Convert(lastIndex, sizeType);
  3561. Convert(stepSize, sizeType);
  3562. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3563. if it is 'MAX(LONGINT)' *)
  3564. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3565. TransferToRegister(lastIndex, lastIndex);
  3566. skipLabel1 := NewLabel();
  3567. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3568. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3569. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3570. SetLabel(skipLabel1)
  3571. END;
  3572. (* check if step size is valid *)
  3573. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3574. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3575. ELSIF isUnchecked THEN (* do nothing *)
  3576. ELSE
  3577. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3578. END;
  3579. (* check lower bound check *)
  3580. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3581. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3582. ELSIF isUnchecked THEN (* do nothing *)
  3583. ELSE
  3584. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3585. END;
  3586. (* check upper bound check *)
  3587. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3588. (* statically open range: nothing to do *)
  3589. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3590. ASSERT(staticLastIndex < staticSourceLength)
  3591. ELSIF isUnchecked THEN (* do nothing *)
  3592. ELSE
  3593. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3594. END;
  3595. (* determine length of target array for current dimension *)
  3596. (* 1. incorporate last index: *)
  3597. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3598. (* last index is static *)
  3599. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3600. targetLength := sourceLength.op
  3601. ELSE
  3602. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3603. END;
  3604. UseIntermediateOperand(targetLength);
  3605. ELSE
  3606. (* targetLength := lastIndex + 1
  3607. Reuse1(targetLength, lastIndex);
  3608. *)
  3609. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3610. END;
  3611. ReleaseOperand(sourceLength);
  3612. ReleaseIntermediateOperand(lastIndex);
  3613. (* 2. incorporate first index: *)
  3614. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3615. (* first index and current target length are static *)
  3616. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3617. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3618. (* first index = 0: nothing to do *)
  3619. ELSE
  3620. (* targetLength := targetLength - firstIndex *)
  3621. TransferToRegister(targetLength, targetLength);
  3622. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3623. END;
  3624. (* clip negative lengths to 0 *)
  3625. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3626. IF staticTargetLength < 0 THEN
  3627. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3628. END
  3629. ELSE
  3630. skipLabel1 := NewLabel();
  3631. TransferToRegister(targetLength, targetLength);
  3632. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3633. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3634. SetLabel(skipLabel1)
  3635. END;
  3636. (* 3. incorporate index step size: *)
  3637. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3638. (*step size and current target length are static *)
  3639. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3640. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3641. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3642. (* step size = 1: nothing to do *)
  3643. ELSE
  3644. (* emit code for this:
  3645. targetLength := (targetLength-1) DIV stepSize +1;
  3646. *)
  3647. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3648. DivInt(targetLength, targetLength, stepSize);
  3649. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3650. END;
  3651. (* determine increment of target array for current dimension *)
  3652. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3653. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3654. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3655. (* step size = 1 *)
  3656. targetIncrement := sourceIncrement.op;
  3657. UseIntermediateOperand(targetIncrement)
  3658. ELSE
  3659. (* targetIncrement := sourceIncrement * stepSize *)
  3660. Reuse1(targetIncrement, stepSize);
  3661. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3662. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3663. END;
  3664. ReleaseIntermediateOperand(stepSize);
  3665. (* write length and increment of target array to descriptor *)
  3666. IF destDimOffset < 0 THEN
  3667. (* determine which dimension of target array is currently looked at *)
  3668. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3669. TransferToRegister(destDim, tmp);
  3670. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3671. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3672. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3673. ReleaseIntermediateOperand(destDim)
  3674. ELSE
  3675. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3676. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3677. END;
  3678. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3679. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3680. INC(indexDim);
  3681. Convert(firstIndex, addressType);
  3682. TransferToRegister(summand, firstIndex);
  3683. ELSE HALT(100);
  3684. END;
  3685. (*
  3686. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3687. *)
  3688. Convert(sourceIncrement.op, addressType);
  3689. Convert(summand, addressType);
  3690. MulInt(summand, summand, sourceIncrement.op);
  3691. ReleaseIntermediateOperand(sourceIncrement.op);
  3692. AddInt(localResult.op, localResult.op, summand);
  3693. ReleaseIntermediateOperand(summand);
  3694. END
  3695. END;
  3696. result := localResult;
  3697. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3698. ReleaseIntermediateOperand(result.tag);
  3699. result.tag := TypeDescriptorAdr(resultingType);
  3700. IF ~newObjectFile THEN
  3701. IntermediateCode.MakeMemory(result.tag,addressType);
  3702. END;
  3703. ELSIF IsDelegate(resultingType) THEN
  3704. ReleaseIntermediateOperand(result.tag);
  3705. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3706. UseIntermediateOperand(result.tag);
  3707. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3708. ReleaseIntermediateOperand(result.tag);
  3709. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3710. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3711. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3712. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3713. (* finalize target array descriptor *)
  3714. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3715. (* write lengths and increments of target array for remaining dimensions *)
  3716. i := indexListSize;
  3717. WHILE indexDim < targetArrayDimensionality DO
  3718. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3719. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3720. ReleaseOperand(sourceLength);
  3721. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3722. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3723. ReleaseOperand(sourceIncrement);
  3724. INC(i); INC(indexDim);
  3725. END;
  3726. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3727. tmp := nil;
  3728. ELSE
  3729. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3730. END;
  3731. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3732. ReleaseIntermediateOperand(tmp);
  3733. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3734. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3735. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3736. ELSE
  3737. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3738. END;
  3739. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3740. ReleaseIntermediateOperand(tmp);
  3741. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3742. (* write dimensionality *)
  3743. IF targetArrayDimensionality # 0 THEN
  3744. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3745. END;
  3746. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3747. END;
  3748. ReleaseOperand(array);
  3749. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3750. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3751. END;
  3752. END MathIndexDesignator;
  3753. (* TENTATIVE *)
  3754. PROCEDURE DumpOperand(operand: Operand);
  3755. BEGIN
  3756. D.Log.String(" op = ");
  3757. IntermediateCode.DumpOperand(D.Log, operand.op );
  3758. D.Log.Ln;
  3759. D.Log.String(" tag = ");
  3760. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3761. D.Log.Ln;
  3762. D.Log.String(" extra = ");
  3763. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3764. D.Log.Ln;
  3765. D.Log.Update
  3766. END DumpOperand;
  3767. (* get the length of an array , trying to make use of static information *)
  3768. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3769. VAR res: IntermediateCode.Operand; size: LONGINT;
  3770. BEGIN
  3771. type := type.resolved;
  3772. IF type IS SyntaxTree.ArrayType THEN
  3773. WITH type: SyntaxTree.ArrayType DO
  3774. IF type.form = SyntaxTree.Static THEN
  3775. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3776. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3777. Evaluate(type.length, op);
  3778. ReleaseIntermediateOperand(op.tag);
  3779. RETURN op.op;*)
  3780. ELSE
  3781. res := tag;
  3782. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3783. IntermediateCode.MakeMemory(res,addressType);
  3784. UseIntermediateOperand(res);
  3785. RETURN res
  3786. END
  3787. END;
  3788. ELSE
  3789. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3790. RETURN IntermediateCode.Immediate(addressType,size);
  3791. END;
  3792. END ArrayLength;
  3793. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3794. BEGIN
  3795. ReleaseIntermediateOperand(res);
  3796. IF IsImmediate(x) & IsImmediate(y) THEN
  3797. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3798. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3799. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3800. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3801. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3802. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3803. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3804. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3805. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3806. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3807. UseIntermediateOperand(res);
  3808. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3809. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3810. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3811. UseIntermediateOperand(res);
  3812. ELSE
  3813. IF ~ReusableRegister(res) THEN
  3814. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3815. ELSE
  3816. UseIntermediateOperand(res);
  3817. END;
  3818. IF IsImmediate(x) & (x.intValue = 0) THEN
  3819. Emit(Mov(position,res,y))
  3820. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3821. Emit(Mov(position,res,x))
  3822. ELSE
  3823. Emit(Add(position,res, x, y));
  3824. END;
  3825. END;
  3826. END AddInt;
  3827. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3828. BEGIN
  3829. ReleaseIntermediateOperand(res);
  3830. IF IsImmediate(x) & IsImmediate(y) THEN
  3831. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3832. ELSE
  3833. IF ~ReusableRegister(res) THEN
  3834. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3835. ELSE UseIntermediateOperand(res);
  3836. END;
  3837. IF IsImmediate(x) & (x.intValue = 1) THEN
  3838. Emit(Mov(position,res,y))
  3839. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3840. Emit(Mov(position,res,x))
  3841. ELSE
  3842. Emit(Mul(position,res, x, y));
  3843. END;
  3844. END;
  3845. END MulInt;
  3846. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3847. BEGIN
  3848. ReleaseIntermediateOperand(res);
  3849. IF IsImmediate(x) & IsImmediate(y) THEN
  3850. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3851. ELSE
  3852. IF ~ReusableRegister(res) THEN
  3853. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3854. ELSE UseIntermediateOperand(res);
  3855. END;
  3856. IF IsImmediate(x) & (x.intValue = 1) THEN
  3857. Emit(Mov(position,res,y))
  3858. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3859. Emit(Mov(position,res,x))
  3860. ELSE
  3861. Emit(Div(position,res, x, y));
  3862. END;
  3863. END;
  3864. END DivInt;
  3865. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3866. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3867. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3868. BEGIN
  3869. type := x.left.type.resolved;
  3870. IF type IS SyntaxTree.StringType THEN
  3871. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3872. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3873. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3874. type := atype;
  3875. x.left.SetType(type);
  3876. END;
  3877. IntermediateCode.InitImmediate(res,addressType,0);
  3878. maxDim := x.parameters.Length()-1;
  3879. FOR i := 0 TO maxDim DO
  3880. e := x.parameters.GetExpression(i);
  3881. Evaluate(e,index);
  3882. Convert(index.op,addressType);
  3883. AddInt(res, res, index.op);
  3884. IF i = 0 THEN
  3885. (*
  3886. ReuseCopy(res, index.op);
  3887. *)
  3888. Designate(x.left,array);
  3889. type := x.left.type.resolved;
  3890. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3891. Dereference(array, type, FALSE);
  3892. END;
  3893. (*
  3894. ELSE AddInt(res, res, index.op);
  3895. *)
  3896. END;
  3897. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3898. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3899. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3900. BoundCheck(index.op, length);
  3901. END;
  3902. ReleaseIntermediateOperand(length);
  3903. END;
  3904. ReleaseOperand(index);
  3905. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3906. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3907. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3908. MulInt(res,res,length);
  3909. END;
  3910. ReleaseIntermediateOperand(length);
  3911. END;
  3912. IF (type IS SyntaxTree.ArrayType) THEN
  3913. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3914. size := StaticSize(system, type);
  3915. IF size # 1 THEN
  3916. length := IntermediateCode.Immediate(addressType,size);
  3917. MulInt(res,res,length);
  3918. END;
  3919. ELSE
  3920. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3921. IF size # 1 THEN
  3922. length := IntermediateCode.Immediate(addressType,size);
  3923. MulInt(res,res,length);
  3924. END;
  3925. END;
  3926. END;
  3927. AddInt(res,res,array.op);
  3928. InitOperand(result,ModeReference);
  3929. result.op := res;
  3930. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3931. ReleaseIntermediateOperand(result.tag);
  3932. result.tag := TypeDescriptorAdr(type);
  3933. IF ~newObjectFile THEN
  3934. IntermediateCode.MakeMemory(result.tag,addressType);
  3935. END
  3936. ELSIF IsDelegate(type) THEN
  3937. ReleaseIntermediateOperand(result.tag);
  3938. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3939. UseIntermediateOperand(result.tag);
  3940. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3941. ReleaseIntermediateOperand(result.tag);
  3942. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3943. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3944. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3945. END;
  3946. ReleaseOperand(array);
  3947. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3948. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3949. END;
  3950. END IndexDesignator;
  3951. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3952. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3953. BEGIN
  3954. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3955. dest := destination; destination := emptyOperand;
  3956. type := x.left.type.resolved;
  3957. IF type IS SyntaxTree.MathArrayType THEN
  3958. MathIndexDesignator(x);
  3959. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3960. IndexDesignator(x);
  3961. END;
  3962. destination := dest;
  3963. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3964. END VisitIndexDesignator;
  3965. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3966. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3967. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3968. procedure: SyntaxTree.Procedure;
  3969. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3970. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3971. BEGIN
  3972. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3973. parameters := expression.parameters;
  3974. moduleName := "FoxArrayBase";
  3975. procedureName := "CopyDescriptor";
  3976. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3977. SaveRegisters();ReleaseUsedRegisters(saved);
  3978. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3979. IF procedure = NIL THEN
  3980. s := "procedure ";
  3981. Strings.Append(s,moduleName);
  3982. Strings.Append(s,".");
  3983. Strings.Append(s,procedureName);
  3984. Strings.Append(s," not present");
  3985. Error(position,s);
  3986. ELSE
  3987. (* push address of temporary variable *)
  3988. Symbol(variable,destOperand);
  3989. Emit(Push(position,destOperand.op));
  3990. ReleaseOperand(destOperand);
  3991. (* push src *)
  3992. Evaluate(expression.left,srcOperand);
  3993. (*
  3994. Dereference(srcOperand,expression.type.resolved);
  3995. Emit(Push(position,srcOperand.tag));
  3996. *)
  3997. Emit(Push(position,srcOperand.op));
  3998. ReleaseOperand(srcOperand);
  3999. tensorFound := FALSE;
  4000. FOR i := 0 TO parameters.Length()-1 DO
  4001. e := parameters.GetExpression(i);
  4002. IF e IS SyntaxTree.TensorRangeExpression THEN
  4003. tensorFound := TRUE;
  4004. ELSIF e IS SyntaxTree.RangeExpression THEN
  4005. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4006. ELSE
  4007. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4008. END;
  4009. END;
  4010. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  4011. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  4012. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  4013. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  4014. StaticCallOperand(procOp,procedure);
  4015. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4016. ReleaseOperand(procOp);
  4017. END;
  4018. RestoreRegisters(saved);
  4019. END;
  4020. RETURN variable
  4021. END PrepareTensorDescriptor;
  4022. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4023. VAR
  4024. type, descriptorType, baseType: SyntaxTree.Type;
  4025. operand, tmpOperand, variableOp, variable2Op: Operand;
  4026. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4027. variable, variable2: SyntaxTree.Variable;
  4028. dim, i, size: LONGINT;
  4029. (* TODO: needed? *)
  4030. oldArrayDestinationTag: IntermediateCode.Operand;
  4031. oldArrayDestinationDimension: LONGINT;
  4032. position: LONGINT;
  4033. saved: RegisterEntry;
  4034. arrayFlags: SET;
  4035. m, n: LONGINT;
  4036. PROCEDURE Pass(op: IntermediateCode.Operand);
  4037. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4038. BEGIN
  4039. IF numberRegister >= 0 THEN
  4040. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4041. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4042. Emit(Mov(position,parameterRegister, op));
  4043. ELSE
  4044. Emit(Push(position,op))
  4045. END
  4046. END Pass;
  4047. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4048. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4049. BEGIN
  4050. formalType := formalType.resolved; actualType := actualType.resolved;
  4051. IF IsOpenArray(formalType)THEN
  4052. IF actualType IS SyntaxTree.StringType THEN
  4053. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4054. RETURN;
  4055. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4056. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4057. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4058. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4059. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4060. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4061. ELSE
  4062. tmp := baseReg;
  4063. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4064. IntermediateCode.MakeMemory(tmp,addressType);
  4065. Pass((tmp));
  4066. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4067. END;
  4068. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4069. END;
  4070. END PushArrayLens;
  4071. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4072. BEGIN
  4073. CASE size OF
  4074. |2: INCL(flags,Size2Flag);
  4075. |3: INCL(flags,Size3Flag);
  4076. |4: INCL(flags,Size4Flag);
  4077. |5: INCL(flags,Size5Flag);
  4078. |6: INCL(flags,Size6Flag);
  4079. |7: INCL(flags,Size7Flag);
  4080. |8: INCL(flags,Size8Flag);
  4081. END;
  4082. END SetSmallArraySizeFlag;
  4083. BEGIN
  4084. IF Trace THEN TraceEnter("PushParameter") END;
  4085. position := expression.position;
  4086. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4087. type := expression.type.resolved;
  4088. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4089. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4090. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4091. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4092. );
  4093. (* TODO: needed? *)
  4094. oldArrayDestinationTag := arrayDestinationTag;
  4095. oldArrayDestinationDimension := arrayDestinationDimension;
  4096. IF IsArrayOfSystemByte(parameter.type) THEN
  4097. Designate(expression,operand);
  4098. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4099. ReleaseIntermediateOperand(operand.tag);
  4100. operand.tag := tmp;
  4101. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4102. Pass((operand.tag));
  4103. END;
  4104. Pass((operand.op));
  4105. ELSIF IsOpenArray(parameter.type) THEN
  4106. Designate(expression,operand);
  4107. baseReg := operand.tag;
  4108. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4109. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4110. END;
  4111. Pass((operand.op)); (* address of the array *)
  4112. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4113. (* case 1 *)
  4114. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4115. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4116. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4117. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4118. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4119. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4120. arrayDestinationTag := sp;
  4121. (* case 1b *)
  4122. IF expression IS SyntaxTree.IndexDesignator THEN
  4123. (*
  4124. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4125. descriptorType := GetMathArrayDescriptorType(dim);
  4126. variable := GetTemporaryVariable(descriptorType,expression.position);
  4127. Symbol(variable,variableOp);
  4128. arrayDestinationTag := variableOp.op;
  4129. *)
  4130. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4131. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4132. arrayDestinationDimension := dim;
  4133. Designate(expression,operand);
  4134. (* case 1a *)
  4135. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4136. Designate(expression,operand);
  4137. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4138. i := 0;
  4139. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4140. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4141. INC(i);
  4142. END;
  4143. type := expression.type.resolved;
  4144. WHILE (i<dim) DO (* remaining static dimensions *)
  4145. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4146. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4147. ReleaseOperand(tmpOperand);
  4148. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4149. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4150. ReleaseOperand(tmpOperand);
  4151. INC(i);
  4152. END;
  4153. dimOp := IntermediateCode.Immediate(addressType,dim);
  4154. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4155. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4156. (* case 1d *)
  4157. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4158. Designate(expression,operand);
  4159. Dereference(operand,type.resolved,FALSE);
  4160. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4161. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4162. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4163. (* case 1f *)
  4164. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4165. Designate(expression,operand);
  4166. FOR i := 0 TO dim-1 DO
  4167. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4168. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4169. ReleaseOperand(tmpOperand);
  4170. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4171. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4172. ReleaseOperand(tmpOperand);
  4173. END;
  4174. (*******
  4175. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4176. *)
  4177. arrayFlags := {StaticFlag};
  4178. IF dim = 1 THEN
  4179. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4180. ReleaseOperand(tmpOperand);
  4181. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4182. m := LONGINT(tmpOperand.op.intValue);
  4183. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4184. ELSIF dim = 2 THEN
  4185. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4186. ReleaseOperand(tmpOperand);
  4187. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4188. m := LONGINT(tmpOperand.op.intValue);
  4189. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4190. ReleaseOperand(tmpOperand);
  4191. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4192. n := LONGINT(tmpOperand.op.intValue);
  4193. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4194. INCL(arrayFlags,SmallMatrixFlag);
  4195. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4196. END;
  4197. END;
  4198. (*******)
  4199. dimOp := IntermediateCode.Immediate(addressType,dim);
  4200. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4201. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4202. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4203. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4204. baseType := SemanticChecker.ArrayBase(type,dim);
  4205. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4206. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4207. ELSE HALT(100);
  4208. END;
  4209. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4210. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4211. (* case 2b *)
  4212. IF expression IS SyntaxTree.IndexDesignator THEN
  4213. descriptorType := GetMathArrayDescriptorType(dim);
  4214. variable := GetTemporaryVariable(descriptorType, FALSE);
  4215. Symbol(variable,variableOp);
  4216. arrayDestinationTag := variableOp.op;
  4217. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4218. arrayDestinationDimension := dim;
  4219. NeedDescriptor := TRUE;
  4220. Designate(expression,operand);
  4221. Pass((operand.tag));
  4222. NeedDescriptor := FALSE;
  4223. (* case 2a *)
  4224. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4225. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4226. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4227. INC(i);
  4228. END;
  4229. IF i = dim THEN
  4230. Designate(expression,operand);
  4231. Pass((operand.tag));
  4232. ELSE (* open-static *)
  4233. type := expression.type.resolved;
  4234. descriptorType := GetMathArrayDescriptorType(dim);
  4235. variable := GetTemporaryVariable(descriptorType, FALSE);
  4236. Symbol(variable,variableOp);
  4237. arrayDestinationTag := variableOp.op;
  4238. Designate(expression,operand);
  4239. FOR i := 0 TO dim-1 DO
  4240. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4241. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4242. ReleaseOperand(tmpOperand);
  4243. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4244. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4245. ReleaseOperand(tmpOperand);
  4246. END;
  4247. dimOp := IntermediateCode.Immediate(addressType,dim);
  4248. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4249. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4250. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4251. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4252. baseType := SemanticChecker.ArrayBase(type,dim);
  4253. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4254. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4255. Pass((arrayDestinationTag));
  4256. END;
  4257. (* case 2d *)
  4258. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4259. Designate(expression,operand);
  4260. Dereference(operand,type.resolved,FALSE);
  4261. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4262. Pass((operand.tag));
  4263. (* case 2f *)
  4264. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4265. descriptorType := GetMathArrayDescriptorType(dim);
  4266. variable := GetTemporaryVariable(descriptorType, FALSE);
  4267. Symbol(variable,variableOp);
  4268. arrayDestinationTag := variableOp.op;
  4269. Designate(expression,operand);
  4270. FOR i := 0 TO dim-1 DO
  4271. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4272. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4273. ReleaseOperand(tmpOperand);
  4274. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4275. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4276. ReleaseOperand(tmpOperand);
  4277. END;
  4278. (*
  4279. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4280. *)
  4281. arrayFlags := {StaticFlag};
  4282. IF dim = 1 THEN
  4283. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4284. ReleaseOperand(tmpOperand);
  4285. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4286. m := LONGINT(tmpOperand.op.intValue);
  4287. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4288. ELSIF dim = 2 THEN
  4289. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4290. ReleaseOperand(tmpOperand);
  4291. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4292. m := LONGINT(tmpOperand.op.intValue);
  4293. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4294. ReleaseOperand(tmpOperand);
  4295. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4296. n := LONGINT(tmpOperand.op.intValue);
  4297. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4298. INCL(arrayFlags,SmallMatrixFlag);
  4299. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4300. END;
  4301. END;
  4302. (*******)
  4303. dimOp := IntermediateCode.Immediate(addressType,dim);
  4304. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4305. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4306. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4307. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4308. baseType := SemanticChecker.ArrayBase(type,dim);
  4309. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4310. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4311. Pass((arrayDestinationTag));
  4312. ELSE HALT(100);
  4313. END;
  4314. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4315. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4316. (* case 3b *)
  4317. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4318. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4319. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4320. Symbol(variable,variableOp);
  4321. LoadValue(variableOp,system.addressType);
  4322. ELSE
  4323. descriptorType := GetMathArrayDescriptorType(dim);
  4324. variable := GetTemporaryVariable(descriptorType, FALSE);
  4325. Symbol(variable,variableOp);
  4326. END;
  4327. arrayDestinationTag := variableOp.op;
  4328. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4329. arrayDestinationDimension := 0;
  4330. Designate(expression,operand);
  4331. Pass((operand.tag));
  4332. (* case 3a *)
  4333. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4334. i := 0;
  4335. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4336. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4337. INC(i);
  4338. END;
  4339. IF i = dim THEN
  4340. Designate(expression,operand);
  4341. Pass((operand.tag));
  4342. ELSE (* open-static *)
  4343. type := expression.type.resolved;
  4344. descriptorType := GetMathArrayDescriptorType(dim);
  4345. variable := GetTemporaryVariable(descriptorType, FALSE);
  4346. Symbol(variable,variableOp);
  4347. arrayDestinationTag := variableOp.op;
  4348. Designate(expression,operand);
  4349. FOR i := 0 TO dim-1 DO
  4350. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4351. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4352. ReleaseOperand(tmpOperand);
  4353. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4354. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4355. ReleaseOperand(tmpOperand);
  4356. END;
  4357. dimOp := IntermediateCode.Immediate(addressType,dim);
  4358. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4359. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4360. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4361. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4362. baseType := SemanticChecker.ArrayBase(type,dim);
  4363. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4364. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4365. Pass((arrayDestinationTag));
  4366. END;
  4367. (* case 3d *)
  4368. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4369. Designate(expression,operand);
  4370. Dereference(operand,type.resolved,FALSE);
  4371. (*
  4372. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4373. *)
  4374. Pass((operand.tag));
  4375. (* case 3f *)
  4376. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4377. descriptorType := GetMathArrayDescriptorType(dim);
  4378. variable := GetTemporaryVariable(descriptorType, FALSE);
  4379. Symbol(variable,variableOp);
  4380. arrayDestinationTag := variableOp.op;
  4381. Designate(expression,operand);
  4382. IF operand.op.type.length >1 THEN (* vector register *)
  4383. variable2 := GetTemporaryVariable(type, FALSE);
  4384. Symbol(variable2, variable2Op);
  4385. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4386. Emit(Mov(position,tmp, operand.op));
  4387. ReleaseOperand(operand);
  4388. Symbol(variable2, operand);
  4389. END;
  4390. FOR i := 0 TO dim-1 DO
  4391. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4392. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4393. ReleaseOperand(tmpOperand);
  4394. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4395. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4396. ReleaseOperand(tmpOperand);
  4397. END;
  4398. dimOp := IntermediateCode.Immediate(addressType,dim);
  4399. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4400. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4401. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4402. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4403. baseType := SemanticChecker.ArrayBase(type,dim);
  4404. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4405. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4406. Pass((arrayDestinationTag));
  4407. ELSE HALT(100);
  4408. END;
  4409. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4410. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4411. (* case 4b *)
  4412. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4413. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4414. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4415. Symbol(variable,variableOp);
  4416. LoadValue(variableOp,system.addressType);
  4417. ELSE
  4418. descriptorType := GetMathArrayDescriptorType(dim);
  4419. variable := GetTemporaryVariable(descriptorType, FALSE);
  4420. Symbol(variable,variableOp);
  4421. END;
  4422. arrayDestinationTag := variableOp.op;
  4423. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4424. arrayDestinationDimension := 0;
  4425. Designate(expression,operand);
  4426. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4427. Symbol(variable,variableOp);
  4428. ELSE
  4429. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4430. Symbol(variable,variableOp);
  4431. MakeMemory(tmp,variableOp.op,addressType,0);
  4432. Emit(Mov(position,tmp,operand.tag));
  4433. ReleaseIntermediateOperand(tmp);
  4434. END;
  4435. Pass((variableOp.op));
  4436. ReleaseOperand(variableOp);
  4437. (* case 4a *)
  4438. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4439. i := 0;
  4440. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4441. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4442. INC(i);
  4443. END;
  4444. IF i = dim THEN
  4445. Designate(expression,operand);
  4446. arrayDestinationTag := operand.tag;
  4447. ELSE (* open-static *)
  4448. type := expression.type.resolved;
  4449. descriptorType := GetMathArrayDescriptorType(dim);
  4450. variable := GetTemporaryVariable(descriptorType, FALSE);
  4451. Symbol(variable,variableOp);
  4452. arrayDestinationTag := variableOp.op;
  4453. Designate(expression,operand);
  4454. FOR i := 0 TO dim-1 DO
  4455. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4456. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4457. ReleaseOperand(tmpOperand);
  4458. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4459. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4460. ReleaseOperand(tmpOperand);
  4461. END;
  4462. dimOp := IntermediateCode.Immediate(addressType,dim);
  4463. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4464. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4465. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4466. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4467. baseType := SemanticChecker.ArrayBase(type,dim);
  4468. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4469. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4470. END;
  4471. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4472. Symbol(variable,variableOp);
  4473. MakeMemory(tmp,variableOp.op,addressType,0);
  4474. Emit(Mov(position,tmp,arrayDestinationTag));
  4475. ReleaseIntermediateOperand(tmp);
  4476. Pass((variableOp.op));
  4477. ReleaseOperand(variableOp);
  4478. (* case 4d *)
  4479. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4480. Designate(expression,operand);
  4481. (*
  4482. Dereference(operand,type.resolved,FALSE);
  4483. *)
  4484. (*
  4485. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4486. *)
  4487. Pass((operand.op));
  4488. (* case 4f *)
  4489. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4490. descriptorType := GetMathArrayDescriptorType(dim);
  4491. variable := GetTemporaryVariable(descriptorType, FALSE);
  4492. Symbol(variable,variableOp);
  4493. arrayDestinationTag := variableOp.op;
  4494. Designate(expression,operand);
  4495. FOR i := 0 TO dim-1 DO
  4496. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4497. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4498. ReleaseOperand(tmpOperand);
  4499. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4500. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4501. ReleaseOperand(tmpOperand);
  4502. END;
  4503. dimOp := IntermediateCode.Immediate(addressType,dim);
  4504. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4505. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4506. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4507. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4508. baseType := SemanticChecker.ArrayBase(type,dim);
  4509. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4510. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4511. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4512. Symbol(variable,variableOp);
  4513. MakeMemory(tmp,variableOp.op,addressType,0);
  4514. Emit(Mov(position,tmp,arrayDestinationTag));
  4515. ReleaseIntermediateOperand(tmp);
  4516. Pass((variableOp.op));
  4517. ReleaseOperand(variableOp);
  4518. ELSE HALT(100);
  4519. END;
  4520. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4521. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4522. Designate(expression,operand);
  4523. IF operand.op.type.length > 1 THEN
  4524. Emit(Push(position, operand.op));
  4525. ReleaseOperand(operand);
  4526. ELSE
  4527. size := system.SizeOf(type);
  4528. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4529. size := ToMemoryUnits(system,size);
  4530. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4531. arrayDestinationTag := sp;
  4532. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4533. END;
  4534. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4535. Designate(expression,operand);
  4536. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4537. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4538. Symbol(variable,variableOp);
  4539. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4540. Emit(Mov(position,tmp,operand.op));
  4541. Emit(Push(position,variableOp.op));
  4542. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4543. Pass((operand.op));
  4544. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4545. END;
  4546. ELSE HALT(200)
  4547. END;
  4548. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4549. IF parameter.kind = SyntaxTree.VarParameter THEN
  4550. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4551. Designate(expression, operand);
  4552. Pass((operand.op));
  4553. ELSE
  4554. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4555. Evaluate(expression, operand);
  4556. Pass((operand.extra)); (* step *)
  4557. Pass((operand.tag)); (* last *)
  4558. Pass((operand.op)) (* first *)
  4559. END
  4560. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4561. IF parameter.kind = SyntaxTree.VarParameter THEN
  4562. Designate(expression, operand);
  4563. Pass((operand.op));
  4564. ELSE
  4565. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4566. Evaluate(expression, operand);
  4567. Pass((operand.tag)); (* real part *)
  4568. Pass((operand.op)) (* imaginary part *)
  4569. END
  4570. ELSE
  4571. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4572. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4573. Designate(expression,operand);
  4574. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4575. (* stack allocation *)
  4576. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4577. (*! parameter alignment to be discussed ... *)
  4578. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4579. size := type(SyntaxTree.StringType).length;
  4580. END;
  4581. IF backend.cooperative & parameter.NeedsTrace() THEN
  4582. dst := NewRegisterOperand (addressType);
  4583. Emit(Mov(position,dst, sp));
  4584. IntermediateCode.InitImmediate(null, byteType, 0);
  4585. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4586. ReleaseIntermediateOperand(dst);
  4587. SaveRegisters();ReleaseUsedRegisters(saved);
  4588. (* register dst has been freed before SaveRegisters already *)
  4589. CallAssignMethod(dst, operand.op, parameter.type);
  4590. RestoreRegisters(saved);
  4591. END;
  4592. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4593. ELSIF IsOpenArray(parameter.type) THEN
  4594. Designate(expression,operand);
  4595. baseReg := operand.tag;
  4596. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4597. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4598. END;
  4599. Pass((operand.op)); (* address of the array *)
  4600. ELSIF IsDelegate(parameter.type) THEN
  4601. Evaluate(expression,operand);
  4602. IF backend.cooperative & parameter.NeedsTrace() THEN
  4603. Emit(Push(position, nil));
  4604. dst := NewRegisterOperand (addressType);
  4605. Emit(Mov(position,dst, sp));
  4606. ReleaseIntermediateOperand(dst);
  4607. SaveRegisters();ReleaseUsedRegisters(saved);
  4608. Emit(Push(position, dst));
  4609. (* register dst has been freed before SaveRegisters already *)
  4610. Emit(Push(position, operand.tag));
  4611. CallThis(position,"GarbageCollector","Assign",2);
  4612. RestoreRegisters(saved);
  4613. ELSE
  4614. Pass((operand.tag));
  4615. END;
  4616. Pass((operand.op));
  4617. ELSE
  4618. Evaluate(expression,operand);
  4619. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4620. Emit(Push(position, nil));
  4621. dst := NewRegisterOperand (addressType);
  4622. Emit(Mov(position,dst, sp));
  4623. ReleaseIntermediateOperand(dst);
  4624. SaveRegisters();ReleaseUsedRegisters(saved);
  4625. Emit(Push(position, dst));
  4626. (* register dst has been freed before SaveRegisters already *)
  4627. Emit(Push(position, operand.op));
  4628. CallThis(position,"GarbageCollector","Assign",2);
  4629. RestoreRegisters(saved);
  4630. ELSE
  4631. Pass((operand.op));
  4632. END;
  4633. END;
  4634. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4635. Evaluate(expression,operand);
  4636. Pass((operand.op));
  4637. ELSE (* var parameter *)
  4638. Designate(expression,operand);
  4639. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4640. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4641. Pass((operand.tag));
  4642. END;
  4643. END;
  4644. Pass((operand.op));
  4645. END;
  4646. END;
  4647. (* TODO: needed? *)
  4648. arrayDestinationTag := oldArrayDestinationTag;
  4649. arrayDestinationDimension := oldArrayDestinationDimension;
  4650. IF needsParameterBackup THEN
  4651. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4652. ReuseCopy(parameterBackup, operand.op)
  4653. END;
  4654. ReleaseOperand(operand);
  4655. IF Trace THEN TraceExit("PushParameter") END;
  4656. END PushParameter;
  4657. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4658. VAR prevConditional: BOOLEAN;
  4659. BEGIN
  4660. prevConditional := conditional;
  4661. conditional := FALSE;
  4662. 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
  4663. Expression(x.result); (* use register *)
  4664. END;
  4665. Statement(x.statement);
  4666. conditional := prevConditional;
  4667. IF x.result # NIL THEN Expression(x.result) END;
  4668. 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
  4669. ReleaseIntermediateOperand(result.op);
  4670. END;
  4671. END VisitStatementDesignator;
  4672. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4673. VAR
  4674. procedure: SyntaxTree.Procedure;
  4675. procedureType: SyntaxTree.ProcedureType;
  4676. wasInline: BOOLEAN;
  4677. actualParameters: SyntaxTree.ExpressionList;
  4678. formalParameter: SyntaxTree.Parameter;
  4679. actualParameter: SyntaxTree.Expression;
  4680. i: LONGINT;
  4681. localVariable: SyntaxTree.Variable;
  4682. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4683. src, dest: Operand;
  4684. prevInlineExit : Label;
  4685. prevMapper: SymbolMapper;
  4686. tooComplex: BOOLEAN;
  4687. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4688. BEGIN
  4689. IF e = NIL THEN RETURN TRUE
  4690. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4691. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4692. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4693. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4694. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4695. ELSE RETURN FALSE
  4696. END;
  4697. END SimpleExpression;
  4698. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4699. BEGIN
  4700. RETURN checker.CanPassInRegister(type)
  4701. END FitsInRegister;
  4702. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4703. VAR
  4704. variable: SyntaxTree.Variable;
  4705. variableDesignator: SyntaxTree.Designator;
  4706. BEGIN
  4707. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4708. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4709. variableDesignator.SetType(type);
  4710. RETURN variableDesignator
  4711. END GetTemp;
  4712. BEGIN
  4713. wasInline := currentIsInline;
  4714. prevInlineExit := currentInlineExit;
  4715. prevMapper := currentMapper;
  4716. currentInlineExit := NewLabel();
  4717. tooComplex := FALSE;
  4718. NEW(currentMapper);
  4719. currentIsInline := TRUE;
  4720. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4721. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4722. formalParameter := procedureType.firstParameter;
  4723. actualParameters := x.parameters;
  4724. i := 0;
  4725. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4726. actualParameter := actualParameters.GetExpression(i);
  4727. IF actualParameter.resolved # NIL THEN
  4728. actualParameter := actualParameter.resolved
  4729. END;
  4730. (*
  4731. if expression is simple and can be passed immediately
  4732. or if type fits in register then we can proceed
  4733. otherwise we escape to ordinary procedure call.
  4734. *)
  4735. (* cases where the expression can be mapped identically *)
  4736. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4737. currentMapper.Add(formalParameter, actualParameter, NIL);
  4738. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4739. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4740. (*
  4741. Assign(variableDesignator, actualParameter);
  4742. *)
  4743. Evaluate(actualParameter, src);
  4744. Designate(variableDesignator, dest);
  4745. Emit(Mov(x.position, dest.op, src.op));
  4746. ReleaseOperand(dest);
  4747. ReleaseOperand(src);
  4748. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4749. ELSE tooComplex := TRUE
  4750. END;
  4751. (*
  4752. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4753. currentMapper.Add(formalParameter, actualParameter, NIL);
  4754. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4755. variableDesignator := GetTemp(system.addressType, FALSE);
  4756. Designate(actualParameter, src);
  4757. Designate(variableDesignator, dest);
  4758. IntermediateCode.MakeMemory(dest.op,addressType);
  4759. Emit(Mov(x.position, dest.op, src.op));
  4760. ReleaseOperand(dest);
  4761. IF src.tag.mode # IntermediateCode.Undefined THEN
  4762. tagDesignator := GetTemp(system.addressType, FALSE);
  4763. Designate(tagDesignator, dest);
  4764. IntermediateCode.MakeMemory(dest.op,addressType);
  4765. Emit(Mov(x.position, dest.op, src.op));
  4766. END;
  4767. ReleaseOperand(dest); ReleaseOperand(src);
  4768. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4769. END;
  4770. *)
  4771. formalParameter := formalParameter.nextParameter;
  4772. INC(i);
  4773. END;
  4774. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4775. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4776. currentMapper.Add(NIL, returnDesignator, NIL);
  4777. END;
  4778. localVariable := procedure.procedureScope.firstVariable;
  4779. WHILE ~tooComplex & (localVariable # NIL) DO
  4780. variableDesignator := GetTemp(localVariable.type, FALSE);
  4781. currentMapper.Add(localVariable, variableDesignator, NIL);
  4782. localVariable := localVariable.nextVariable;
  4783. END;
  4784. IF ~tooComplex THEN
  4785. VisitStatementBlock(procedure.procedureScope.body);
  4786. SetLabel(currentInlineExit);
  4787. IF procedureType.returnType # NIL THEN
  4788. Designate(returnDesignator, result);
  4789. IF conditional THEN
  4790. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4791. ValueToCondition(result)
  4792. END;
  4793. END;
  4794. END;
  4795. currentMapper := prevMapper;
  4796. currentInlineExit := prevInlineExit;
  4797. currentIsInline := wasInline;
  4798. RETURN ~tooComplex
  4799. END InlineProcedureCall;
  4800. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4801. VAR
  4802. parameters: SyntaxTree.ExpressionList;
  4803. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4804. designator: SyntaxTree.Designator;
  4805. procedureType: SyntaxTree.ProcedureType;
  4806. formalParameter: SyntaxTree.Parameter;
  4807. operand, returnValue: Operand;
  4808. reg, size, mask, dest: IntermediateCode.Operand;
  4809. saved: RegisterEntry;
  4810. symbol: SyntaxTree.Symbol;
  4811. variable: SyntaxTree.Variable;
  4812. i, parametersSize, returnTypeSize : LONGINT;
  4813. structuredReturnType: BOOLEAN;
  4814. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4815. tempVariableDesignator: SyntaxTree.Designator;
  4816. gap, alignment: LONGINT; (*fld*)
  4817. (* TODO: remove unnecessary backup variables *)
  4818. oldResult: Operand;
  4819. oldCurrentScope: SyntaxTree.Scope;
  4820. oldArrayDestinationTag: IntermediateCode.Operand;
  4821. oldArrayDestinationDimension: LONGINT;
  4822. oldConstantDeclaration: SyntaxTree.Symbol;
  4823. oldDestination: IntermediateCode.Operand;
  4824. oldCurrentLoop: Label;
  4825. oldConditional: BOOLEAN;
  4826. oldTrueLabel, oldFalseLabel: Label;
  4827. oldLocked: BOOLEAN;
  4828. usedRegisters,oldUsedRegisters: RegisterEntry;
  4829. return: IntermediateCode.Operand;
  4830. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4831. arg: IntermediateCode.Operand;
  4832. dummy: IntermediateCode.Operand;
  4833. recordType: SyntaxTree.RecordType;
  4834. operatorSelectionProcedureOperand: Operand;
  4835. operatorSelectionProcedure: SyntaxTree.Procedure;
  4836. fingerPrint: SyntaxTree.FingerPrint;
  4837. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4838. identifierNumber: LONGINT;
  4839. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4840. procedure: SyntaxTree.Procedure;
  4841. PROCEDURE BackupGlobalState;
  4842. BEGIN
  4843. oldResult := result;
  4844. oldCurrentScope := currentScope;
  4845. oldArrayDestinationTag := arrayDestinationTag;
  4846. oldArrayDestinationDimension := arrayDestinationDimension;
  4847. oldConstantDeclaration := constantDeclaration;
  4848. oldDestination := destination;
  4849. oldCurrentLoop := currentLoop;
  4850. oldConditional := conditional;
  4851. oldTrueLabel := trueLabel;
  4852. oldFalseLabel := falseLabel;
  4853. oldLocked := locked;
  4854. oldUsedRegisters := usedRegisters
  4855. END BackupGlobalState;
  4856. PROCEDURE RestoreGlobalState;
  4857. BEGIN
  4858. result := oldResult;
  4859. currentScope := oldCurrentScope;
  4860. arrayDestinationTag := oldArrayDestinationTag;
  4861. arrayDestinationDimension := oldArrayDestinationDimension;
  4862. constantDeclaration := oldConstantDeclaration;
  4863. destination := oldDestination;
  4864. currentLoop := oldCurrentLoop;
  4865. conditional := oldConditional;
  4866. trueLabel := oldTrueLabel;
  4867. falseLabel := oldFalseLabel;
  4868. locked := oldLocked;
  4869. usedRegisters := oldUsedRegisters
  4870. END RestoreGlobalState;
  4871. (** do preparations before parameter push for array-structured object types (ASOTs):
  4872. if ASOT is passed as VAR parameter:
  4873. - allocate temporary variable of math array type
  4874. - copy contents of ASOT to be passed to temporary variable
  4875. - use temporary variable as the actual parameter instead
  4876. - 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)
  4877. **)
  4878. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4879. VAR
  4880. expression: SyntaxTree.Expression;
  4881. BEGIN
  4882. IF actualParameter IS SyntaxTree.Designator THEN
  4883. designator := actualParameter(SyntaxTree.Designator);
  4884. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4885. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4886. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4887. ASSERT(checker # NIL);
  4888. checker.SetCurrentScope(currentScope);
  4889. (* allocate temporary variable *)
  4890. ASSERT(actualParameter.type # NIL);
  4891. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4892. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4893. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4894. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4895. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4896. ASSERT(tempVariableDesignator.type # NIL);
  4897. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4898. (* copy math array stored in actual parameter to temporary variable *)
  4899. BackupGlobalState;
  4900. AssignMathArray(tempVariableDesignator, actualParameter);
  4901. RestoreGlobalState;
  4902. (* use temporary variable as actual parameter instead of the original one *)
  4903. actualParameter := tempVariableDesignator;
  4904. (* create write-back call and store it in linked list *)
  4905. (* create new list entry *)
  4906. IF firstWriteBackCall = NIL THEN
  4907. NEW(firstWriteBackCall);
  4908. currentWriteBackCall := firstWriteBackCall
  4909. ELSE
  4910. ASSERT(currentWriteBackCall # NIL);
  4911. NEW(currentWriteBackCall.next);
  4912. currentWriteBackCall := currentWriteBackCall.next
  4913. END;
  4914. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4915. ASSERT(expression.type = NIL);
  4916. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4917. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4918. (* prepare writeback for any other "normal" indexer *)
  4919. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4920. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4921. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4922. Assign(tempVariableDesignator, actualParameter);
  4923. actualParameter := tempVariableDesignator;
  4924. IF firstWriteBackCall = NIL THEN
  4925. NEW(firstWriteBackCall);
  4926. currentWriteBackCall := firstWriteBackCall
  4927. ELSE
  4928. ASSERT(currentWriteBackCall # NIL);
  4929. NEW(currentWriteBackCall.next);
  4930. currentWriteBackCall := currentWriteBackCall.next
  4931. END;
  4932. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4933. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4934. END
  4935. END
  4936. END PrepareParameter;
  4937. BEGIN
  4938. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4939. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4940. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4941. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4942. IF InlineProcedureCall(x) THEN
  4943. RETURN
  4944. ELSE
  4945. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4946. END
  4947. END;
  4948. END;
  4949. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4950. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4951. dest := destination; destination := emptyOperand;
  4952. SaveRegisters();ReleaseUsedRegisters(saved);
  4953. parameters := x.parameters;
  4954. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4955. (* an operator is called *)
  4956. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4957. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4958. (* check if a dynamic operator call should be performed *)
  4959. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4960. ELSE
  4961. isCallOfDynamicOperator := FALSE
  4962. END;
  4963. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4964. Emit(Push(position, ap));
  4965. END;
  4966. alignment := procedureType.stackAlignment;
  4967. IF alignment > 1 THEN
  4968. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4969. Emit(Mov(position,reg, sp));
  4970. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4971. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4972. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4973. Emit(And(position,sp, sp, mask));
  4974. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4975. Emit(Push(position,reg));
  4976. (*
  4977. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4978. Emit(Mov(position,mem,reg));
  4979. *)
  4980. ReleaseIntermediateOperand(reg);
  4981. END;
  4982. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4983. IntermediateCode.InitImmediate(mask,addressType,-16);
  4984. Emit(And(position,sp, sp, mask));
  4985. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4986. IF gap # 0 THEN
  4987. IntermediateCode.InitImmediate(size,addressType,gap);
  4988. Emit(Sub(position,sp,sp,size))
  4989. END;
  4990. END;
  4991. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4992. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4993. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4994. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4995. ELSE
  4996. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4997. END;
  4998. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4999. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5000. (* push ID *)
  5001. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5002. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5003. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5004. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5005. formalParameter := procedureType.firstParameter;
  5006. FOR i := 0 TO parameters.Length() - 1 DO
  5007. IF formalParameter.access # SyntaxTree.Hidden THEN
  5008. ASSERT(i < 2);
  5009. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5010. (* push pointer *)
  5011. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5012. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5013. (* add dereference *)
  5014. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5015. ReleaseIntermediateOperand(parameterBackups[i]);
  5016. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5017. END;
  5018. Emit(Push(position,parameterBackups[i]));
  5019. ReleaseIntermediateOperand(parameterBackups[i]);
  5020. (* push typetag *)
  5021. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5022. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5023. arg := TypeDescriptorAdr(recordType);
  5024. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5025. Emit(Push(position,arg));
  5026. ELSE
  5027. (* push 'NonPointer' *)
  5028. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5029. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5030. (* push fingerprint *)
  5031. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5032. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5033. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  5034. END
  5035. END;
  5036. formalParameter := formalParameter.nextParameter
  5037. END;
  5038. (* for unary operators: complete the information for the second parameter *)
  5039. IF procedureType.numberParameters < 2 THEN
  5040. (* push 'NonPointer' *)
  5041. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5042. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5043. (* push 'NoType' *)
  5044. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5045. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5046. END;
  5047. (* call operator selection procedure *)
  5048. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5049. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5050. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5051. ReleaseOperand(operatorSelectionProcedureOperand);
  5052. (* use the address that the operator selection procedure returned as the target address of the call *)
  5053. InitOperand(operand, ModeValue);
  5054. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5055. Emit(Result(position,operand.op))
  5056. END
  5057. ELSE
  5058. Evaluate(x.left, operand)
  5059. END;
  5060. IF symbol IS SyntaxTree.Procedure THEN
  5061. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5062. Emit(Push(position,operand.tag));
  5063. ELSIF (procedureType.isDelegate) THEN
  5064. Emit(Push(position,operand.tag));
  5065. END;
  5066. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5067. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5068. Emit(Push(position,operand.tag));
  5069. END;
  5070. ELSE HALT(200);
  5071. END;
  5072. ReleaseIntermediateOperand(operand.tag);
  5073. operand.tag := emptyOperand;
  5074. (* determine if a structured return type is needed *)
  5075. structuredReturnType := StructuredReturnType(procedureType);
  5076. IF structuredReturnType THEN
  5077. IF resultDesignator # NIL THEN
  5078. d := resultDesignator;
  5079. ELSE
  5080. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  5081. variable.SetUntraced(procedureType.hasUntracedReturn);
  5082. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  5083. d.SetType(variable.type);
  5084. END;
  5085. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5086. Designate(d,returnValue);
  5087. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5088. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5089. Emit(Push(position,size));
  5090. Emit(Push(position,returnValue.op));
  5091. ReleaseOperand(returnValue);
  5092. ELSE
  5093. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5094. END;
  5095. END;
  5096. firstWriteBackCall := NIL; (* reset write-back call list *)
  5097. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5098. passByRegister := system.registerParameters > 0;
  5099. registerNumber := 0;
  5100. formalParameter := procedureType.lastParameter;
  5101. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5102. actualParameter := parameters.GetExpression(i);
  5103. PrepareParameter(actualParameter, formalParameter);
  5104. IF passByRegister & (i < system.registerParameters) THEN
  5105. IF ~PassInRegister(formalParameter) THEN
  5106. Error(actualParameter.position,"cannot be passed by register")
  5107. ELSE
  5108. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  5109. END;
  5110. INC(registerNumber);
  5111. ELSE
  5112. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5113. END;
  5114. formalParameter := formalParameter.prevParameter;
  5115. END;
  5116. IF passByRegister & (registerNumber > 0) THEN
  5117. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5118. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5119. END;
  5120. ELSE
  5121. hasDynamicOperands := FALSE;
  5122. formalParameter := procedureType.firstParameter;
  5123. FOR i := 0 TO parameters.Length() - 1 DO
  5124. actualParameter := parameters.GetExpression(i);
  5125. IF formalParameter # NIL THEN (* TENTATIVE *)
  5126. PrepareParameter(actualParameter, formalParameter);
  5127. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5128. ASSERT(i < 2);
  5129. hasDynamicOperands := TRUE;
  5130. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5131. ELSE
  5132. IF passByRegister & (registerNumber > 0) THEN
  5133. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5134. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5135. END;
  5136. passByRegister := FALSE;
  5137. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5138. END;
  5139. formalParameter := formalParameter.nextParameter;
  5140. END;
  5141. END;
  5142. END;
  5143. IF symbol IS SyntaxTree.Procedure THEN
  5144. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5145. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5146. Emit(Push(position,reg));
  5147. ReleaseIntermediateOperand(reg);
  5148. END;
  5149. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5150. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5151. parametersSize := ParametersSize(system,procedureType,FALSE);
  5152. END;
  5153. ReleaseParameterRegisters();
  5154. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  5155. Emit(Call(position,operand.op,0));
  5156. ELSE
  5157. Emit(Call(position,operand.op,parametersSize));
  5158. END;
  5159. ReleaseOperand(operand);
  5160. IF procedureType.noReturn THEN
  5161. EmitTrap(position,NoReturnTrap);
  5162. END;
  5163. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5164. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5165. Emit(Result(position,return));
  5166. END;
  5167. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  5168. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  5169. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5170. END;
  5171. size := IntermediateCode.Immediate(addressType,parametersSize);
  5172. Emit(Add(position,sp,sp,size));
  5173. END;
  5174. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5175. IF structuredReturnType THEN
  5176. (* stack pointer rewinding done by callee
  5177. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5178. Emit(Add(position,sp,sp,size));
  5179. *)
  5180. RestoreRegisters(saved);
  5181. InitOperand(result,ModeReference);
  5182. Symbol(variable,result);
  5183. ELSE
  5184. RestoreRegisters(saved);
  5185. InitOperand(result,ModeValue);
  5186. result.op := return;
  5187. END;
  5188. END;
  5189. IF alignment > 1 THEN
  5190. Emit(Pop(position,sp));
  5191. END;
  5192. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5193. Emit(Pop(position, ap));
  5194. END;
  5195. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5196. ValueToCondition(result);
  5197. END;
  5198. destination := dest;
  5199. (* perform all write-back calls in the list *)
  5200. BackupGlobalState;
  5201. currentWriteBackCall := firstWriteBackCall;
  5202. WHILE currentWriteBackCall # NIL DO
  5203. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5204. currentWriteBackCall := currentWriteBackCall.next
  5205. END;
  5206. RestoreGlobalState;
  5207. (* TENATIVE *)
  5208. (*
  5209. IF isOperatorCall THEN
  5210. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5211. END;
  5212. *)
  5213. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5214. END VisitProcedureCallDesignator;
  5215. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5216. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5217. td: SyntaxTree.Symbol;
  5218. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5219. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5220. BEGIN
  5221. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5222. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5223. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5224. variable.SetType(system.anyType);
  5225. scope.AddVariable(variable);
  5226. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5227. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5228. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5229. typeDeclaration.SetScope(module.module.moduleScope);
  5230. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5231. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5232. END;
  5233. RETURN hiddenPointerType;
  5234. END GetHiddenPointerType;
  5235. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5236. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5237. BEGIN
  5238. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5239. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5240. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5241. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5242. scope.AddVariable(variable);
  5243. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5244. variable.SetType(system.anyType);
  5245. scope.AddVariable(variable);
  5246. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5247. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5248. typeDeclaration.SetDeclaredType(delegatePointerType);
  5249. typeDeclaration.SetScope(module.module.moduleScope);
  5250. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5251. delegatePointerType.SetState(SyntaxTree.Resolved);
  5252. END;
  5253. RETURN delegatePointerType
  5254. END GetDelegateType;
  5255. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5256. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5257. such as in VAR a: RECORD ... END;
  5258. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5259. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5260. *)
  5261. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5262. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5263. BEGIN (* no code emission *)
  5264. source := NIL;
  5265. x := x.resolved;
  5266. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5267. x := GetHiddenPointerType();
  5268. ELSIF IsDelegate(x) THEN
  5269. x := GetDelegateType();
  5270. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5271. ELSE HALT(200);
  5272. END;
  5273. td := x.typeDeclaration;
  5274. IF td = NIL THEN
  5275. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5276. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5277. ASSERT(td # NIL);
  5278. END;
  5279. IF newObjectFile THEN
  5280. GetCodeSectionNameForSymbol(td,name);
  5281. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5282. meta.CheckTypeDeclaration(x);
  5283. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5284. ELSE
  5285. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5286. END;
  5287. IF backend.cooperative OR meta.simple THEN
  5288. offset := 0;
  5289. ELSE
  5290. IF x IS SyntaxTree.CellType THEN
  5291. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5292. IF baseRecord = NIL THEN
  5293. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5294. ELSE
  5295. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5296. END;
  5297. ELSE
  5298. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5299. END;
  5300. END;
  5301. ELSE
  5302. offset := 0;
  5303. source := module.allSections.FindBySymbol(td); (*TODO*)
  5304. IF source = NIL THEN
  5305. null := 0;
  5306. GetCodeSectionNameForSymbol(td,name);
  5307. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5308. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5309. ELSE
  5310. source := NewSection(module.importedSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5311. END;
  5312. IntermediateCode.InitImmediate(op,addressType,0);
  5313. source(IntermediateCode.Section).Emit(Data(position,op));
  5314. source.SetReferenced(FALSE)
  5315. ELSE
  5316. name := source.name;
  5317. END;
  5318. END;
  5319. RETURN td
  5320. END GetBackendType;
  5321. BEGIN
  5322. (*td := t.typeDeclaration;*)
  5323. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5324. (*
  5325. IF t IS SyntaxTree.PointerType THEN
  5326. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5327. ELSE
  5328. source := GetBackendType(t);
  5329. END;
  5330. *)
  5331. IF newObjectFile THEN
  5332. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5333. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5334. IntermediateCode.SetOffset(res,offset);
  5335. ELSE
  5336. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5337. END;
  5338. (*
  5339. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5340. make memory should be used when tag is used, not earlier
  5341. *)
  5342. RETURN res
  5343. END TypeDescriptorAdr;
  5344. (*
  5345. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5346. VAR result: IntermediateCode.Operand;
  5347. BEGIN
  5348. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5349. operand.tag := TypeDescriptorAdr(operand.type);
  5350. IntermediateCode.MakeMemory(operand.tag,addressType);
  5351. UseIntermediateOperand(operand.tag);
  5352. END;
  5353. END MakeTypeTag;
  5354. *)
  5355. PROCEDURE ProfilerInit;
  5356. VAR reg: IntermediateCode.Operand;
  5357. BEGIN
  5358. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5359. Emit(Call(position,reg,0));
  5360. END ProfilerInit;
  5361. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5362. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5363. BEGIN
  5364. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5365. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5366. THEN
  5367. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5368. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5369. Emit(Push(position,reg));
  5370. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5371. Emit(Push(position,reg));
  5372. StaticCallOperand(result,procedure);
  5373. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5374. ReleaseOperand(result);
  5375. END;
  5376. END ProfilerEnterExit;
  5377. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5378. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5379. BEGIN
  5380. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5381. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5382. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5383. profileInit.Emit(Push(position,reg));
  5384. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5385. profileInit.Emit(Push(position,reg));
  5386. NEW(string, LEN(name)); COPY(name, string^);
  5387. sv := SyntaxTree.NewStringValue(-1,string);
  5388. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5389. sv.SetType(type);
  5390. Designate(sv,result);
  5391. profileInit.Emit(Push(position,result.tag));
  5392. profileInit.Emit(Push(position,result.op));
  5393. StaticCallOperand(result,procedure);
  5394. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5395. ReleaseOperand(result);
  5396. END;
  5397. END ProfilerAddProcedure;
  5398. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5399. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5400. BEGIN
  5401. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5402. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5403. profileInit.Emit(Push(position,reg));
  5404. profileInitPatchPosition := profileInit.pc;
  5405. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5406. NEW(string, LEN(name)); COPY(name, string^);
  5407. sv := SyntaxTree.NewStringValue(-1,string);
  5408. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5409. sv.SetType(type);
  5410. Designate(sv,result);
  5411. profileInit.Emit(Push(position,result.tag));
  5412. profileInit.Emit(Push(position,result.op));
  5413. StaticCallOperand(result,procedure);
  5414. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5415. ReleaseOperand(result);
  5416. END;
  5417. END ProfilerAddModule;
  5418. PROCEDURE ProfilerPatchInit;
  5419. VAR reg: IntermediateCode.Operand;
  5420. BEGIN
  5421. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5422. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5423. EmitLeave(profileInit,position,0);
  5424. profileInit.Emit(Exit(position,0,0));
  5425. END ProfilerPatchInit;
  5426. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5427. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5428. VAR
  5429. id: LONGINT;
  5430. leftType, rightType: SyntaxTree.Type;
  5431. procedureType: SyntaxTree.ProcedureType;
  5432. runtimeProcedure: SyntaxTree.Procedure;
  5433. runtimeProcedureOperand, operatorOperand: Operand;
  5434. kind: SET;
  5435. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5436. VAR
  5437. arg: IntermediateCode.Operand;
  5438. recordType: SyntaxTree.RecordType;
  5439. fingerPrint: SyntaxTree.FingerPrint;
  5440. BEGIN
  5441. IF type = NIL THEN
  5442. (* no type: push 'NoType' *)
  5443. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5444. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5445. ELSIF IsStrictlyPointerToRecord(type) THEN
  5446. (* pointer to record type: push typetag *)
  5447. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5448. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5449. arg := TypeDescriptorAdr(recordType);
  5450. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5451. ELSE
  5452. (* non-pointer to record type: push fingerprint *)
  5453. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5454. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5455. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5456. END;
  5457. operatorInitializationCodeSection.Emit(Push(position,arg))
  5458. END PushTypeInfo;
  5459. BEGIN
  5460. ASSERT(operatorInitializationCodeSection # NIL);
  5461. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5462. procedureType := operator.type(SyntaxTree.ProcedureType);
  5463. (* determine types *)
  5464. leftType := procedureType.firstParameter.type;
  5465. IF procedureType.numberParameters = 2 THEN
  5466. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5467. rightType := procedureType.firstParameter.nextParameter.type;
  5468. ELSE
  5469. rightType := NIL
  5470. END;
  5471. (* determine operator kind *)
  5472. IF IsStrictlyPointerToRecord(leftType) THEN
  5473. kind := {LhsIsPointer}
  5474. ELSE
  5475. kind := {}
  5476. END;
  5477. IF IsStrictlyPointerToRecord(rightType) THEN
  5478. kind := kind + {RhsIsPointer}
  5479. END;
  5480. IF kind # {} THEN (* TODO: to be removed later on *)
  5481. (* at least one of the types is a pointer to record *)
  5482. (* emit a code that registers this specific operator in the runtime *)
  5483. dump := operatorInitializationCodeSection.comments;
  5484. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5485. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5486. (* push ID *)
  5487. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5488. id := Global.GetSymbol(module.module.case, operator.name);
  5489. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5490. (* push kind *)
  5491. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5492. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5493. (* push type infos *)
  5494. PushTypeInfo(leftType);
  5495. PushTypeInfo(rightType);
  5496. (* push operator address *)
  5497. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5498. StaticCallOperand(operatorOperand, operator);
  5499. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5500. ReleaseOperand(operatorOperand);
  5501. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5502. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5503. ReleaseOperand(runtimeProcedureOperand)
  5504. END
  5505. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5506. END
  5507. END RegisterDynamicOperator;
  5508. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5509. VAR
  5510. traceModule: SyntaxTree.Module;
  5511. procedure: SyntaxTree.Procedure;
  5512. procedureVariable: SyntaxTree.Variable;
  5513. s,msg: Basic.MessageString;
  5514. res: Operand;
  5515. i: LONGINT;
  5516. sv: SyntaxTree.StringValue;
  5517. type: SyntaxTree.Type;
  5518. recordType: SyntaxTree.RecordType;
  5519. printout: Printout.Printer;
  5520. stringWriter: Streams.StringWriter;
  5521. expression: SyntaxTree.Expression;
  5522. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5523. BEGIN
  5524. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5525. IF procedure = NIL THEN
  5526. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5527. END;
  5528. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5529. s := "procedure ";
  5530. Strings.Append(s,backend.traceModuleName);
  5531. Strings.Append(s,".");
  5532. Strings.Append(s,procedureName);
  5533. Strings.Append(s," not present");
  5534. Error(position,s);
  5535. RETURN FALSE
  5536. ELSE
  5537. RETURN TRUE
  5538. END;
  5539. END GetProcedure;
  5540. PROCEDURE CallProcedure;
  5541. VAR size: LONGINT;
  5542. BEGIN
  5543. IF procedure # NIL THEN
  5544. StaticCallOperand(result,procedure);
  5545. size := ProcedureParametersSize(system,procedure);
  5546. ELSE
  5547. Symbol(procedureVariable, result);
  5548. LoadValue(result, procedureVariable.type.resolved);
  5549. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5550. END;
  5551. Emit(Call(position,result.op,size));
  5552. END CallProcedure;
  5553. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5554. VAR res: Operand; string: SyntaxTree.String;
  5555. BEGIN
  5556. IF GetProcedure("String") THEN
  5557. NEW(string, LEN(s)); COPY(s, string^);
  5558. sv := SyntaxTree.NewStringValue(-1,string);
  5559. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5560. sv.SetType(type);
  5561. Designate(sv,res);
  5562. Emit(Push(position,res.tag));
  5563. Emit(Push(position,res.op));
  5564. ReleaseOperand(res);
  5565. CallProcedure;
  5566. END;
  5567. END String;
  5568. PROCEDURE Integer(op: IntermediateCode.Operand);
  5569. BEGIN
  5570. IF GetProcedure("Int") THEN
  5571. Emit(Push(position,op));
  5572. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5573. CallProcedure;
  5574. END;
  5575. END Integer;
  5576. PROCEDURE Float(op: IntermediateCode.Operand);
  5577. BEGIN
  5578. IF GetProcedure("HIntHex") THEN
  5579. Emit(Push(position,op));
  5580. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5581. CallProcedure;
  5582. END;
  5583. END Float;
  5584. PROCEDURE Set(op: IntermediateCode.Operand);
  5585. BEGIN
  5586. IF GetProcedure("Set") THEN
  5587. Emit(Push(position,op));
  5588. (*
  5589. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5590. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5591. *)
  5592. CallProcedure;
  5593. END;
  5594. END Set;
  5595. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5596. BEGIN
  5597. IF GetProcedure("Boolean") THEN
  5598. Emit(Push(position,op));
  5599. CallProcedure;
  5600. END;
  5601. END Boolean;
  5602. PROCEDURE Char(op: IntermediateCode.Operand);
  5603. BEGIN
  5604. IF GetProcedure("Char") THEN
  5605. Emit(Push(position,op));
  5606. CallProcedure;
  5607. END;
  5608. END Char;
  5609. PROCEDURE Address(op: IntermediateCode.Operand);
  5610. BEGIN
  5611. IF GetProcedure("Address") THEN
  5612. Emit(Push(position,op));
  5613. CallProcedure;
  5614. END;
  5615. END Address;
  5616. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5617. BEGIN
  5618. IF GetProcedure("String") THEN
  5619. Emit(Push(position,tag));
  5620. Emit(Push(position,op));
  5621. CallProcedure;
  5622. END;
  5623. END StringOperand;
  5624. PROCEDURE Ln;
  5625. BEGIN
  5626. IF GetProcedure("Ln") THEN
  5627. CallProcedure;
  5628. END;
  5629. END Ln;
  5630. BEGIN
  5631. IF backend.traceModuleName = "" THEN RETURN END;
  5632. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5633. IF GetProcedure("Enter") THEN
  5634. CallProcedure
  5635. END;
  5636. NEW(stringWriter,LEN(s));
  5637. FOR i := 0 TO x.Length()-1 DO
  5638. msg := "";
  5639. expression := x.GetExpression(i);
  5640. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5641. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5642. ELSE
  5643. Global.GetModuleName(module.module, s);
  5644. END;
  5645. IF i = 0 THEN
  5646. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5647. stringWriter.String(":");
  5648. END;
  5649. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5650. IF ~(expression IS SyntaxTree.StringValue) THEN
  5651. printout.Expression(expression);
  5652. stringWriter.Get(s);
  5653. Strings.Append(msg,s);
  5654. Strings.Append(msg,"= ");
  5655. ELSE stringWriter.Get(s); (* remove from string writer *)
  5656. Strings.Append(msg, s);
  5657. END;
  5658. String(msg);
  5659. IF SemanticChecker.IsStringType(expression.type) THEN
  5660. Designate(expression,res);
  5661. StringOperand(res.op,res.tag);
  5662. ELSE
  5663. Evaluate(expression,res);
  5664. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5665. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5666. Convert(res.op,int64);
  5667. END;
  5668. Integer(res.op);
  5669. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5670. Boolean(res.op);
  5671. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5672. Set(res.op);
  5673. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5674. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5675. Convert(res.op,float64);
  5676. END;
  5677. Float(res.op);
  5678. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5679. Char(res.op);
  5680. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5681. Address(res.op);String("H");
  5682. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5683. Address(res.op);String("H");
  5684. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5685. Address(res.op);String("H");
  5686. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5687. Address(res.op);String("H");
  5688. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5689. String("NIL");
  5690. ELSE HALT(200);
  5691. END;
  5692. END;
  5693. ReleaseOperand(res);
  5694. String("; ");
  5695. END;
  5696. IF GetProcedure("Exit") THEN
  5697. CallProcedure
  5698. ELSE
  5699. Ln;
  5700. END;
  5701. END;
  5702. END SystemTrace;
  5703. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5704. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5705. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5706. BEGIN
  5707. type := type.resolved;
  5708. IF type IS SyntaxTree.RecordType THEN
  5709. WITH type: SyntaxTree.RecordType DO
  5710. baseType := type.baseType;
  5711. IF baseType # NIL THEN
  5712. baseType := baseType.resolved;
  5713. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5714. InitFields(baseType,adr,offset);
  5715. END;
  5716. variable := type.recordScope.firstVariable;
  5717. WHILE variable # NIL DO
  5718. IF variable.initializer # NIL THEN
  5719. Evaluate(variable.initializer,initializerOp);
  5720. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5721. Emit(Mov(position,mem,initializerOp.op));
  5722. ReleaseOperand(initializerOp);
  5723. ReleaseIntermediateOperand(mem);
  5724. END;
  5725. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5726. variable := variable.nextVariable
  5727. END;
  5728. END;
  5729. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5730. WITH type: SyntaxTree.ArrayType DO
  5731. IF type.form = SyntaxTree.Static THEN
  5732. baseType := type.arrayBase;
  5733. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5734. FOR i := 0 TO type.staticLength-1 DO
  5735. InitFields(baseType,adr,offset+i*size);
  5736. END;
  5737. END;
  5738. END;
  5739. ELSIF type IS SyntaxTree.MathArrayType THEN
  5740. WITH type: SyntaxTree.MathArrayType DO
  5741. IF type.form = SyntaxTree.Open THEN
  5742. dim := DynamicDim(type);
  5743. imm := IntermediateCode.Immediate(addressType,dim);
  5744. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5745. baseType := SemanticChecker.ArrayBase(type,dim);
  5746. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5747. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5748. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5749. ReleaseIntermediateOperand(imm);
  5750. (* flags remain empty (=0) for open array *)
  5751. ELSIF type.form = SyntaxTree.Static THEN
  5752. baseType := type.arrayBase;
  5753. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5754. ASSERT(type.staticLength < 1024*1024*1024);
  5755. FOR i := 0 TO type.staticLength-1 DO
  5756. InitFields(baseType,adr,offset+i*size);
  5757. END;
  5758. END;
  5759. END;
  5760. END;
  5761. END InitFields;
  5762. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5763. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5764. BEGIN
  5765. type := variable.type.resolved;
  5766. IF (type IS SyntaxTree.MathArrayType) THEN
  5767. WITH type: SyntaxTree.MathArrayType DO
  5768. IF type.form = SyntaxTree.Open THEN
  5769. Symbol(variable,operand);
  5770. InitFields(type, operand.tag,0);
  5771. ELSIF type.form = SyntaxTree.Tensor THEN
  5772. Symbol(variable, operand);
  5773. MakeMemory(tmp,operand.op,addressType,0);
  5774. ReleaseOperand(operand);
  5775. Emit(Mov(position,tmp, nil ) );
  5776. ReleaseIntermediateOperand(tmp);
  5777. END;
  5778. END;
  5779. ELSE
  5780. Symbol(variable,operand);
  5781. IF variable.initializer # NIL THEN
  5782. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5783. reference.SetType(variable.type.resolved);
  5784. reference.SetAssignable(TRUE);
  5785. Assign(reference,variable.initializer);
  5786. END;
  5787. InitFields(type, operand.op,0);
  5788. ReleaseOperand(operand);
  5789. END;
  5790. END InitVariable;
  5791. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5792. VAR end: Label;
  5793. BEGIN
  5794. IF type.form = SyntaxTree.Tensor THEN
  5795. InitOperand(result,ModeValue);
  5796. ReuseCopy(result.op,base);
  5797. end := NewLabel();
  5798. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5799. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5800. SetLabel(end);
  5801. Convert(result.op,int32);
  5802. ELSE
  5803. InitOperand(result,ModeValue);
  5804. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5805. END
  5806. END MathArrayDim;
  5807. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5808. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5809. BEGIN
  5810. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5811. MakeMemory(mem,base,addressType,offset);
  5812. Emit(Mov(position,mem,value));
  5813. ReleaseIntermediateOperand(mem);
  5814. END PutMathArrayField;
  5815. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5816. VAR mem: IntermediateCode.Operand;
  5817. BEGIN
  5818. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5819. MakeMemory(mem,base,addressType,offset);
  5820. Emit(Mov(position,mem,value));
  5821. ReleaseIntermediateOperand(mem);
  5822. END PutMathArrayFieldOffset;
  5823. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5824. BEGIN
  5825. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5826. MakeMemory(value,base,addressType,offset);
  5827. END GetMathArrayField;
  5828. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5829. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5830. BEGIN
  5831. IF incr THEN
  5832. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5833. ELSE
  5834. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5835. END;
  5836. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5837. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5838. ELSE
  5839. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5840. Emit(Mov(position,reg,dim));
  5841. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5842. Emit(Add(position,reg,reg,base));
  5843. MakeMemory(mem, reg, addressType, offset);
  5844. ReleaseIntermediateOperand(reg);
  5845. Emit(Mov(position,mem,value));
  5846. ReleaseIntermediateOperand(mem);
  5847. END;
  5848. END PutMathArrayLenOrIncr;
  5849. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5850. BEGIN
  5851. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5852. END PutMathArrayLength;
  5853. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5854. BEGIN
  5855. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5856. END PutMathArrayIncrement;
  5857. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5858. BEGIN
  5859. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5860. END GetMathArrayIncrement;
  5861. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5862. BEGIN
  5863. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5864. END GetMathArrayLength;
  5865. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5866. VAR dimOp: IntermediateCode.Operand;
  5867. BEGIN
  5868. dimOp := IntermediateCode.Immediate(int32, dim);
  5869. GetMathArrayLength(type, operand, dimOp, check, result);
  5870. END GetMathArrayLengthAt;
  5871. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5872. VAR dimOp: IntermediateCode.Operand;
  5873. BEGIN
  5874. dimOp := IntermediateCode.Immediate(int32, dim);
  5875. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5876. END GetMathArrayIncrementAt;
  5877. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5878. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5879. offset: LONGINT;
  5880. BEGIN
  5881. IF increment THEN
  5882. offset := MathIncrOffset;
  5883. ELSE
  5884. offset := MathLenOffset;
  5885. END;
  5886. INC(offset,operand.dimOffset*2);
  5887. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5888. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5889. END;
  5890. (* static dimension *)
  5891. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5892. IF check & (type.form = SyntaxTree.Tensor) THEN
  5893. DimensionCheck(operand.tag,dim,BrltL);
  5894. END;
  5895. val := SHORT(dim.intValue);
  5896. IF type.form # SyntaxTree.Tensor THEN
  5897. t := SemanticChecker.ArrayBase(type,val);
  5898. type := t.resolved(SyntaxTree.MathArrayType);
  5899. IF type.form = SyntaxTree.Static THEN
  5900. IF increment THEN
  5901. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5902. ELSE
  5903. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5904. END;
  5905. InitOperand(result,ModeValue);
  5906. result.op := res;
  5907. RETURN;
  5908. END;
  5909. END;
  5910. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5911. MakeMemory(res,operand.tag,addressType,offset);
  5912. (*
  5913. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5914. *)
  5915. InitOperand(result,ModeValue);
  5916. result.op := res;
  5917. ELSE
  5918. Convert(dim,addressType);
  5919. IF check THEN
  5920. IF type.form = SyntaxTree.Tensor THEN
  5921. DimensionCheck(operand.tag,dim,BrltL);
  5922. ELSIF isUnchecked THEN (* do nothing *)
  5923. ELSE
  5924. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5925. END;
  5926. END;
  5927. end := NewLabel(); next := NIL;
  5928. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5929. Emit(Mov(position,res,dim));
  5930. Convert(res,int32);
  5931. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5932. WHILE t IS SyntaxTree.MathArrayType DO
  5933. type := t(SyntaxTree.MathArrayType);
  5934. IF type.form = SyntaxTree.Static THEN
  5935. imm := IntermediateCode.Immediate(int32,val);
  5936. next := NewLabel();
  5937. BrneL(next,imm,res);
  5938. IF increment THEN
  5939. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5940. ELSE
  5941. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5942. END;
  5943. Emit(MovReplace(position,res,imm));
  5944. BrL(end);
  5945. ELSE hasDynamicPart := TRUE;
  5946. END;
  5947. t := type.arrayBase.resolved;
  5948. val := val + 1;
  5949. IF next # NIL THEN SetLabel(next) END;
  5950. END;
  5951. IF hasDynamicPart THEN
  5952. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5953. Emit(Mov(position,res2,dim));
  5954. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5955. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5956. Emit(Add(position,res2,res2,imm));
  5957. Emit(Add(position,res2,res2,operand.tag));
  5958. IntermediateCode.MakeMemory(res2,int32);
  5959. Emit(MovReplace(position,res,res2));
  5960. ReleaseIntermediateOperand(res2);
  5961. END;
  5962. SetLabel(end);
  5963. Convert(res,int32);
  5964. InitOperand(result,ModeValue);
  5965. result.op := res;
  5966. END;
  5967. END MathArrayLenOrIncr;
  5968. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5969. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5970. offset: LONGINT;
  5971. BEGIN
  5972. offset := operand.dimOffset+DynamicDim(type)-1;
  5973. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5974. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5975. val := SHORT(dim.intValue);
  5976. t := SemanticChecker.ArrayBase(type,val);
  5977. type := t.resolved(SyntaxTree.ArrayType);
  5978. IF type.form = SyntaxTree.Static THEN
  5979. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5980. ELSE
  5981. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5982. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5983. END;
  5984. UseIntermediateOperand(res);
  5985. InitOperand(result,ModeValue);
  5986. result.op := res;
  5987. ELSE
  5988. Convert(dim,addressType);
  5989. IF ~isUnchecked THEN
  5990. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5991. END;
  5992. end := NewLabel(); next := NIL;
  5993. (* ReuseCopy(dim,res); *)
  5994. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5995. Emit(Mov(position,res,dim));
  5996. Convert(res,int32);
  5997. Convert(res,int32);
  5998. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5999. WHILE t IS SyntaxTree.ArrayType DO
  6000. type := t(SyntaxTree.ArrayType);
  6001. IF type.form = SyntaxTree.Static THEN
  6002. imm := IntermediateCode.Immediate(int32,val);
  6003. next := NewLabel();
  6004. BrneL(next,imm,res);
  6005. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6006. Emit(MovReplace(position,res,imm));
  6007. BrL(end);
  6008. ELSE hasDynamicPart := TRUE;
  6009. END;
  6010. t := type.arrayBase.resolved;
  6011. val := val + 1;
  6012. IF next # NIL THEN SetLabel(next) END;
  6013. END;
  6014. IF hasDynamicPart THEN
  6015. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6016. Convert(res2,addressType);
  6017. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6018. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6019. Emit(Sub(position,res2,imm,res2));
  6020. Emit(Add(position,res2,res2,operand.tag));
  6021. IntermediateCode.MakeMemory(res2,int32);
  6022. Emit(MovReplace(position,res,res2));
  6023. ReleaseIntermediateOperand(res2);
  6024. END;
  6025. SetLabel(end);
  6026. Convert(res,int32);
  6027. InitOperand(result,ModeValue);
  6028. result.op := res;
  6029. END;
  6030. END ArrayLen;
  6031. (**
  6032. create a temporary variable in current scope
  6033. **)
  6034. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  6035. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  6036. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6037. BEGIN
  6038. IF ~register THEN
  6039. variable := temporaries.GetFreeVariable(type, index);
  6040. ELSE
  6041. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6042. END;
  6043. scope := currentScope;
  6044. IF variable = NIL THEN
  6045. COPY("@hiddenIRVar",string);
  6046. Basic.AppendNumber(string,index);
  6047. name := SyntaxTree.NewIdentifier(string);
  6048. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  6049. variable.SetType(type);
  6050. variable.SetAccess(SyntaxTree.Hidden);
  6051. IF ~register THEN
  6052. temporaries.AddVariable(variable);
  6053. IF scope.lastVariable # NIL THEN
  6054. offset := scope.lastVariable.offsetInBits;
  6055. ELSE
  6056. offset := 0;
  6057. END;
  6058. DEC(offset,system.SizeOf(variable.type));
  6059. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6060. variable(SyntaxTree.Variable).SetOffset(offset);
  6061. scope.AddVariable(variable(SyntaxTree.Variable));
  6062. scope.EnterSymbol(variable, duplicate);
  6063. ASSERT(~duplicate);
  6064. InitVariable(variable(SyntaxTree.Variable));
  6065. ELSE
  6066. variable.SetUseRegister(TRUE);
  6067. variable(SyntaxTree.Variable).SetOffset(0);
  6068. END;
  6069. ELSE
  6070. InitVariable(variable(SyntaxTree.Variable));
  6071. (*
  6072. ASSERT(variable.type.resolved = type.resolved)
  6073. *)
  6074. END;
  6075. RETURN variable(SyntaxTree.Variable)
  6076. END GetTemporaryVariable;
  6077. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6078. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6079. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6080. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6081. i: LONGINT; duplicate: BOOLEAN;
  6082. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6083. VAR variable: SyntaxTree.Variable;
  6084. BEGIN
  6085. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  6086. variable.SetType(type);
  6087. recordScope.AddVariable(variable);
  6088. END AddVariable;
  6089. BEGIN
  6090. name := "@ArrayDescriptor";
  6091. Basic.AppendNumber(name,dimensions);
  6092. identifier := SyntaxTree.NewIdentifier(name);
  6093. parentScope := module.module.moduleScope;
  6094. symbol := parentScope.FindSymbol(identifier);
  6095. IF symbol # NIL THEN
  6096. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6097. type := typeDeclaration.declaredType;
  6098. ELSE
  6099. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  6100. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6101. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6102. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  6103. recordType.SetTypeDeclaration(typeDeclaration);
  6104. recordType.SetState(SyntaxTree.Resolved);
  6105. typeDeclaration.SetDeclaredType(recordType);
  6106. AddVariable("@ptr",system.anyType);
  6107. AddVariable("@adr",system.addressType);
  6108. AddVariable("@flags",system.addressType);
  6109. AddVariable("@dim",system.addressType);
  6110. AddVariable("@elementSize",system.addressType);
  6111. FOR i := 0 TO dimensions-1 DO
  6112. name := "@len";
  6113. Basic.AppendNumber(name,i);
  6114. AddVariable(name,system.addressType);
  6115. name := "@incr";
  6116. Basic.AppendNumber(name,i);
  6117. AddVariable(name,system.addressType);
  6118. END;
  6119. parentScope.AddTypeDeclaration(typeDeclaration);
  6120. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6121. ASSERT(~duplicate);
  6122. type := recordType;
  6123. END;
  6124. RETURN type
  6125. END GetMathArrayDescriptorType;
  6126. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6127. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6128. BEGIN
  6129. type := GetMathArrayDescriptorType(dimensions);
  6130. Emit(Push(position,op.op));
  6131. (* push type descriptor *)
  6132. reg := TypeDescriptorAdr(type);
  6133. IF ~newObjectFile THEN
  6134. IntermediateCode.MakeMemory(reg,addressType);
  6135. END;
  6136. Emit(Push(position,reg));
  6137. ReleaseIntermediateOperand(reg);
  6138. (* push realtime flag: false by default *)
  6139. Emit(Push(position,false));
  6140. CallThis(position,"Heaps","NewRec",3);
  6141. END NewMathArrayDescriptor;
  6142. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6143. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6144. BEGIN
  6145. NEW(string, LEN(s)); COPY(s, string^);
  6146. sv := SyntaxTree.NewStringValue(-1,string);
  6147. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6148. sv.SetType(type);
  6149. Designate(sv,res);
  6150. Emit(Push(position,res.tag));
  6151. Emit(Push(position,res.op));
  6152. ReleaseOperand(res);
  6153. END PushConstString;
  6154. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6155. BEGIN
  6156. IF b THEN
  6157. Emit(Push(-1, true));
  6158. ELSE
  6159. Emit(Push(-1, false));
  6160. END;
  6161. END PushConstBoolean;
  6162. PROCEDURE PushConstSet(v: SET);
  6163. VAR value: SyntaxTree.Value; op: Operand;
  6164. BEGIN
  6165. value := SyntaxTree.NewSetValue(-1, v);
  6166. value.SetType(system.setType);
  6167. Evaluate(value, op);
  6168. Emit(Push(-1, op.op));
  6169. ReleaseOperand(op);
  6170. END PushConstSet;
  6171. PROCEDURE PushConstInteger(v: LONGINT);
  6172. VAR value: SyntaxTree.Value; op: Operand;
  6173. BEGIN
  6174. value := SyntaxTree.NewIntegerValue(-1, v);
  6175. value.SetType(system.longintType);
  6176. Evaluate(value, op);
  6177. Emit(Push(-1, op.op));
  6178. ReleaseOperand(op);
  6179. END PushConstInteger;
  6180. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6181. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6182. section: IntermediateCode.Section;
  6183. BEGIN
  6184. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6185. Global.GetSymbolSegmentedName(symbol, name);
  6186. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6187. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6188. procedure.SetScope(moduleScope);
  6189. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6190. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6191. procedure.SetAccess(SyntaxTree.Hidden);
  6192. currentScope := procedureScope;
  6193. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6194. EmitEnter(section, -1,NIL,0,0,0);
  6195. RETURN section;
  6196. END OpenInitializer;
  6197. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6198. BEGIN
  6199. EmitLeave(section, 0, 0 );
  6200. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6201. section := prev;
  6202. END CloseInitializer;
  6203. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6204. VAR name: SyntaxTree.IdentifierString;
  6205. variable: SyntaxTree.Variable;
  6206. type: SyntaxTree.Type;
  6207. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6208. BEGIN
  6209. InitOperand(op,ModeReference);
  6210. op.op := fp;
  6211. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6212. Dereference(op, x, FALSE);
  6213. result := op;
  6214. Symbol(symbol, op);
  6215. END Field;
  6216. PROCEDURE Direction(direction: LONGINT): SET;
  6217. BEGIN
  6218. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6219. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6220. ELSE HALT(100);
  6221. END;
  6222. END Direction;
  6223. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6224. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6225. BEGIN
  6226. Field(port, op);
  6227. ToMemory(op.op,addressType,0);
  6228. Emit(Push(-1, op.op));
  6229. ReleaseOperand(op);
  6230. Basic.GetString(modifier.identifier, name);
  6231. PushConstString(name);
  6232. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6233. ASSERT(SemanticChecker.IsStringType(value.type));
  6234. Designate(value, op);
  6235. Emit(Push(modifier.position, op.tag));
  6236. Emit(Push(modifier.position, op.op));
  6237. ReleaseOperand(op);
  6238. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6239. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6240. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6241. Evaluate(value, op);
  6242. Emit(Push(modifier.position, op.op));
  6243. ReleaseOperand(op);
  6244. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6245. ELSE
  6246. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6247. END;
  6248. END AddPortProperty;
  6249. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6250. VAR modifier: SyntaxTree.Modifier;
  6251. BEGIN
  6252. modifier := variable.modifiers;
  6253. WHILE modifier # NIL DO
  6254. AddPortProperty(variable,modifier, modifier.expression);
  6255. modifier := modifier.nextModifier;
  6256. END;
  6257. END AddPortProperties;
  6258. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6259. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6260. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6261. PROCEDURE PushLens(type: SyntaxTree.Type);
  6262. BEGIN
  6263. IF IsSemiDynamicArray(type) THEN
  6264. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6265. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6266. Emit(Push(-1, op.op));
  6267. ReleaseOperand(op);
  6268. INC(dim);
  6269. ELSIF IsStaticArray(type) THEN
  6270. len := len * type(SyntaxTree.ArrayType).staticLength;
  6271. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6272. INC(dim);
  6273. ELSE
  6274. baseType := type;
  6275. END;
  6276. END PushLens;
  6277. BEGIN
  6278. (* cell *)
  6279. IF variable.type IS SyntaxTree.ArrayType THEN
  6280. type := variable.type;
  6281. dim := 0;
  6282. len := 1;
  6283. PushLens(type);
  6284. portType := baseType.resolved(SyntaxTree.PortType);
  6285. ELSE
  6286. portType := variable.type(SyntaxTree.PortType);
  6287. END;
  6288. PushSelfPointer();
  6289. (* port / array of ports *)
  6290. IF IsStaticArray(type) THEN
  6291. PushConstInteger(len);
  6292. END;
  6293. Field(variable, op);
  6294. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6295. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6296. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6297. Designate(d, op);*)
  6298. Emit(Push(-1, op.op));
  6299. ReleaseOperand(op);
  6300. (* name *)
  6301. PushConstString(name);
  6302. (* inout *)
  6303. PushConstSet(Direction(portType.direction));
  6304. (* width *)
  6305. PushConstInteger(portType.sizeInBits);
  6306. IF variable.type IS SyntaxTree.PortType THEN
  6307. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6308. AddPortProperties(variable);
  6309. ELSIF IsStaticArray(type)THEN
  6310. CallThis(variable.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6311. ELSIF IsSemiDynamicArray(type) THEN
  6312. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6313. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6314. Emit(Add(position,reg, sp, size));
  6315. (* dim *)
  6316. PushConstInteger(dim);
  6317. (* len array *)
  6318. Emit(Push(position, reg));
  6319. ReleaseIntermediateOperand(reg);
  6320. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6321. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6322. Emit(Add(position, sp,sp, size));
  6323. ELSE
  6324. HALT(100);
  6325. END;
  6326. END Variable;
  6327. BEGIN
  6328. IF backend.cellsAreObjects THEN
  6329. variable := x.cellScope.firstVariable;
  6330. WHILE (variable # NIL) DO
  6331. type := variable.type.resolved;
  6332. WHILE (type IS SyntaxTree.ArrayType) DO
  6333. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6334. END;
  6335. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6336. Global.GetSymbolNameInScope(variable,x.cellScope,name);
  6337. Variable(name,variable);
  6338. END;
  6339. variable := variable.nextVariable;
  6340. END;
  6341. ELSE HALT(200)
  6342. END;
  6343. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6344. (*
  6345. x.typeDeclaration.GetName(componentName);
  6346. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6347. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6348. instanceType.SetDataMemorySize(dataMemorySize);
  6349. END;
  6350. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6351. instanceType.SetInstructionMemorySize(codeMemorySize)
  6352. END;
  6353. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6354. instanceType.AddCapability(ActiveCells.VectorCapability)
  6355. END;
  6356. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6357. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6358. END;
  6359. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6360. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6361. END;
  6362. AddDevices(instanceType, x);
  6363. *)
  6364. (*
  6365. IF x.isCellNet THEN
  6366. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6367. END;
  6368. *)
  6369. (*currentActiveCellsScope := instanceType;*)
  6370. (*
  6371. parameter := x.firstParameter;
  6372. portIndex := 0;
  6373. WHILE parameter # NIL DO
  6374. parameter.GetName(parameterName);
  6375. parameterType := parameter.type.resolved;
  6376. Parameter(parameterName, parameterType);
  6377. (*
  6378. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6379. ParameterArray(parameterType);
  6380. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6381. FOR i := 0 TO len-1 DO
  6382. COPY(parameterName,name);
  6383. AppendIndex(name,i);
  6384. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6385. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6386. INC(portIndex);
  6387. END;
  6388. ELSE
  6389. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6390. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6391. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6392. INC(portIndex);
  6393. END;
  6394. *)
  6395. parameter := parameter.nextParameter;
  6396. END;
  6397. *)
  6398. (*
  6399. Scope(x.cellScope);
  6400. currentActiveCellsScope := prevActiveCellsScope;
  6401. AddModules(instanceType,x.cellScope);
  6402. *)
  6403. END AddPorts;
  6404. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6405. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6406. BEGIN
  6407. Symbol(cell,op);
  6408. ToMemory(op.op,addressType,0);
  6409. Emit(Push(position,op.op));
  6410. ReleaseOperand(op);
  6411. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6412. PushConstString(name);
  6413. IF (value # NIL) THEN
  6414. ASSERT(
  6415. SemanticChecker.IsStringType(property.type)
  6416. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6417. OR (property.type.resolved IS SyntaxTree.FloatType)
  6418. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6419. );
  6420. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6421. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6422. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6423. Designate(d, op);
  6424. IF SemanticChecker.IsStringType(property.type) THEN
  6425. Emit(Push(-1, op.tag))
  6426. END;
  6427. Emit(Push(-1, op.op));
  6428. ReleaseOperand(op);
  6429. END;
  6430. IF value = NIL THEN
  6431. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6432. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6433. ASSERT(SemanticChecker.IsStringType(value.type));
  6434. Designate(value, op);
  6435. Emit(Push(property.position, op.tag));
  6436. Emit(Push(property.position, op.op));
  6437. ReleaseOperand(op);
  6438. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6439. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6440. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6441. Evaluate(value, op);
  6442. Emit(Push(property.position, op.op));
  6443. ReleaseOperand(op);
  6444. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6445. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6446. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6447. Evaluate(value, op);
  6448. Emit(Push(property.position, op.op));
  6449. ReleaseOperand(op);
  6450. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6451. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6452. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6453. Evaluate(value, op);
  6454. Emit(Push(property.position, op.op));
  6455. ReleaseOperand(op);
  6456. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6457. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6458. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6459. Evaluate(value, op);
  6460. Emit(Push(property.position, op.op));
  6461. ReleaseOperand(op);
  6462. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6463. ELSE
  6464. HALT(200);
  6465. END;
  6466. END AddProperty;
  6467. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6468. VAR symbol: SyntaxTree.Symbol;
  6469. BEGIN
  6470. WHILE modifier # NIL DO
  6471. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6472. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6473. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6474. ELSE
  6475. (*! move this check to checker *)
  6476. Error(modifier.position, "undefined property");
  6477. END;
  6478. modifier := modifier.nextModifier;
  6479. END;
  6480. END AddModifiers;
  6481. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6482. VAR last: SyntaxTree.Modifier;
  6483. BEGIN
  6484. IF to = NIL THEN
  6485. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6486. ELSE
  6487. last := to;
  6488. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6489. last := last.nextModifier;
  6490. END;
  6491. IF last.identifier # this.identifier THEN
  6492. ASSERT(last.nextModifier = NIL);
  6493. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6494. END;
  6495. END;
  6496. END AppendModifier;
  6497. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6498. BEGIN
  6499. WHILE this # NIL DO
  6500. AppendModifier(to, this);
  6501. this := this.nextModifier;
  6502. END;
  6503. END AppendModifiers;
  6504. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6505. VAR base: SyntaxTree.Type;
  6506. BEGIN
  6507. AppendModifiers(to, c.modifiers);
  6508. base := c.GetBaseValueType();
  6509. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6510. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6511. END;
  6512. END AppendCellTypeModifiers;
  6513. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6514. VAR op: Operand;
  6515. BEGIN
  6516. Evaluate(p, op);
  6517. Emit(Push(p.position, op.op));
  6518. ReleaseOperand(op);
  6519. (*
  6520. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6521. p := p(SyntaxTree.Designator).left;
  6522. END;
  6523. IF p # NIL THEN
  6524. Evaluate(p, op);
  6525. Emit(Push(p.position, op.op));
  6526. ReleaseOperand(op);
  6527. ELSE
  6528. Emit(Push(-1, nil));
  6529. END;
  6530. *)
  6531. END PushPort;
  6532. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6533. VAR
  6534. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6535. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6536. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6537. tmp:IntermediateCode.Operand;
  6538. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6539. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6540. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6541. dest: IntermediateCode.Operand;
  6542. staticLength: LONGINT; itype: IntermediateCode.Type;
  6543. convert,isTensor: BOOLEAN;
  6544. recordType: SyntaxTree.RecordType;
  6545. baseType: SyntaxTree.Type;
  6546. flags: SET;
  6547. left: SyntaxTree.Expression;
  6548. call: SyntaxTree.Designator;
  6549. procedure: SyntaxTree.Procedure;
  6550. temporaryVariable: SyntaxTree.Variable;
  6551. dummy: IntermediateCode.Operand;
  6552. customBuiltin: SyntaxTree.CustomBuiltin;
  6553. isVarPar: ARRAY 3 OF BOOLEAN;
  6554. callsection: Sections.Section;
  6555. segmentedName: Basic.SegmentedName;
  6556. needsTrace: BOOLEAN;
  6557. n: ARRAY 256 OF CHAR;
  6558. modifier: SyntaxTree.Modifier;
  6559. previous, init: IntermediateCode.Section;
  6560. prevScope: SyntaxTree.Scope;
  6561. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6562. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6563. priority: IntermediateCode.Operand;
  6564. op,callop: Operand;
  6565. BEGIN
  6566. IF type = NIL THEN RETURN END;
  6567. type := type.resolved;
  6568. IF type IS SyntaxTree.PointerType THEN
  6569. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6570. END;
  6571. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6572. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6573. recordScope := type(SyntaxTree.RecordType).recordScope;
  6574. IF recordScope.bodyProcedure # NIL THEN
  6575. procedure := recordScope.bodyProcedure;
  6576. body := procedure.procedureScope.body;
  6577. Emit(Push(position,self));
  6578. IF body.isActive THEN
  6579. StaticCallOperand(callop,procedure);
  6580. Emit(Push(position,callop.op));
  6581. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6582. Convert(priority,sizeType);
  6583. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6584. END;
  6585. Emit(Push(position,priority));
  6586. ReleaseIntermediateOperand(priority);
  6587. IF backend.cooperative THEN
  6588. Emit(Push(position,self));
  6589. CallThis(position,"Activities","Create",3)
  6590. ELSE
  6591. flags := 0;
  6592. IF body.isSafe THEN
  6593. flags := 1;
  6594. END;
  6595. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6596. Emit(Push(position,self));
  6597. CallThis(position,"Objects","CreateProcess",4)
  6598. END;
  6599. ELSE
  6600. Emit(Push(position,self));
  6601. StaticCallOperand(callop,procedure);
  6602. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6603. END;
  6604. Emit(Pop(position,self));
  6605. END;
  6606. END CallBodies;
  6607. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6608. BEGIN
  6609. actualType := actualType.resolved;
  6610. IF actualType IS SyntaxTree.StringType THEN
  6611. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6612. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6613. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6614. ELSE
  6615. tmp := op.tag;
  6616. IntermediateCode.MakeMemory(tmp,addressType);
  6617. Emit(Push(position,tmp));
  6618. END;
  6619. Emit(Push(position,op.op))
  6620. END PushString;
  6621. PROCEDURE PushTD(type: SyntaxTree.Type);
  6622. VAR op: IntermediateCode.Operand;
  6623. BEGIN
  6624. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6625. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6626. ELSE
  6627. IF type.resolved IS SyntaxTree.PointerType THEN
  6628. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6629. END;
  6630. op := TypeDescriptorAdr(type.resolved);
  6631. IF ~newObjectFile THEN
  6632. IntermediateCode.MakeMemory(op,addressType);
  6633. END;
  6634. Emit(Push(position,op));
  6635. END
  6636. END PushTD;
  6637. BEGIN
  6638. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6639. dest := destination; destination := emptyOperand;
  6640. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6641. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6642. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6643. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6644. CASE x.id OF
  6645. (* ---- COPY ----- *)
  6646. |Global.Copy:
  6647. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6648. (* ---- EXCL, INCL----- *)
  6649. |Global.Excl,Global.Incl:
  6650. Evaluate(p0,s0);
  6651. Evaluate(p1,s1);
  6652. Convert(s1.op,setType);
  6653. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6654. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6655. END;
  6656. ReuseCopy(res,s0.op);
  6657. ReleaseOperand(s0);
  6658. Reuse1(tmp,s1.op);
  6659. ReleaseOperand(s1);
  6660. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6661. IF x.id = Global.Excl THEN
  6662. Emit(Not(position,tmp,tmp));
  6663. Emit(And(position,res,res,tmp));
  6664. ELSE
  6665. Emit(Or(position,res,res,tmp));
  6666. END;
  6667. ReleaseIntermediateOperand(tmp);
  6668. Designate(p0,s0);
  6669. ToMemory(s0.op,setType,0);
  6670. Emit(Mov(position,s0.op,res));
  6671. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6672. (* ---- DISPOSE ----- *)
  6673. |Global.Dispose:
  6674. Designate(p0,s0);
  6675. Emit(Push(position,s0.op));
  6676. ReleaseOperand(s0);
  6677. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6678. (* ---- GETPROCEDURE ----- *)
  6679. |Global.GetProcedure:
  6680. Designate(p0,s0);
  6681. PushString(s0,p0.type);
  6682. Designate(p1,s1);
  6683. PushString(s1,p1.type);
  6684. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6685. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6686. ELSE PushTD(procedureType.firstParameter.type)
  6687. END;
  6688. PushTD(procedureType.returnType);
  6689. Designate(p2,s2);
  6690. Emit(Push(position,s2.op));
  6691. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6692. CallThis(position,"Modules","GetProcedure", 7);
  6693. (* ---- ASH, LSH, ROT ----- *)
  6694. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6695. Evaluate(p0,s0);
  6696. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6697. (* make unsigned arguments in order to produced a logical shift *)
  6698. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6699. convert:= TRUE;
  6700. itype := s0.op.type;
  6701. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6702. Convert(s0.op,itype);
  6703. ELSE
  6704. convert := FALSE;
  6705. END;
  6706. END;
  6707. Evaluate(p1,s1);
  6708. IF IsIntegerConstant(p1,hint) THEN
  6709. ReuseCopy(reg,s0.op);
  6710. IF hint > 0 THEN
  6711. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6712. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6713. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6714. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6715. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6716. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6717. END;
  6718. ELSIF hint < 0 THEN
  6719. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6720. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6721. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6722. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6723. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6724. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6725. END;
  6726. END;
  6727. ReleaseOperand(s0); ReleaseOperand(s1);
  6728. ELSE
  6729. exit := NewLabel();
  6730. end := NewLabel();
  6731. ReuseCopy(reg,s0.op);
  6732. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6733. Reuse1(tmp,s1.op);
  6734. Emit(Neg(position,tmp,s1.op));
  6735. Convert(tmp,s1.op.type);
  6736. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6737. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6738. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6739. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6740. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6741. END;
  6742. ReleaseIntermediateOperand(tmp);
  6743. BrL(end);
  6744. SetLabel(exit);
  6745. ReuseCopy(tmp,s1.op);
  6746. Convert(tmp,s1.op.type);
  6747. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6748. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6749. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6750. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6751. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6752. END;
  6753. ReleaseIntermediateOperand(tmp);
  6754. SetLabel(end);
  6755. ReleaseOperand(s0); ReleaseOperand(s1);
  6756. END;
  6757. InitOperand(result,ModeValue);
  6758. IF convert THEN
  6759. itype := reg.type;
  6760. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6761. Convert(reg,itype);
  6762. END;
  6763. result.op := reg;
  6764. (* ---- CAP ----- *)
  6765. |Global.Cap:
  6766. Evaluate(p0,result);
  6767. ReuseCopy(reg,result.op);
  6768. ReleaseIntermediateOperand(result.op);
  6769. ignore := NewLabel();
  6770. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6771. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6772. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6773. SetLabel(ignore);
  6774. result.op := reg;
  6775. (* ---- CHR ----- *)
  6776. |Global.Chr, Global.Chr32:
  6777. Evaluate(p0,result);
  6778. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6779. |Global.Entier, Global.EntierH:
  6780. Evaluate(p0,result);
  6781. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6782. (* ---- MIN and MAX ----- *)
  6783. |Global.Max,Global.Min:
  6784. Evaluate(p0,s0);
  6785. Evaluate(p1,s1);
  6786. Reuse2(res,s0.op,s1.op);
  6787. else := NewLabel();
  6788. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6789. ELSE BrltL(else,s1.op,s0.op) END;
  6790. Emit(Mov(position,res,s0.op));
  6791. ReleaseOperand(s0);
  6792. end := NewLabel();
  6793. BrL(end);
  6794. SetLabel(else);
  6795. Emit(MovReplace(position,res,s1.op));
  6796. SetLabel(end);
  6797. ReleaseOperand(s1);
  6798. InitOperand(result,ModeValue);
  6799. result.op := res;
  6800. (* ---- ODD ----- *)
  6801. |Global.Odd:
  6802. IF ~conditional THEN
  6803. ConditionToValue(x)
  6804. ELSE
  6805. Evaluate(p0,result);
  6806. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6807. Reuse1(res,result.op);
  6808. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6809. ReleaseIntermediateOperand(result.op);
  6810. result.op := res;
  6811. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6812. ReleaseOperand(result);
  6813. BrL(falseLabel);
  6814. END;
  6815. (* ---- ORD ----- *)
  6816. |Global.Ord, Global.Ord32:
  6817. Evaluate(p0,result);
  6818. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6819. (* ---- SHORT, LONG ----- *)
  6820. |Global.Short, Global.Long:
  6821. Evaluate(p0,result);
  6822. IF x.type IS SyntaxTree.ComplexType THEN
  6823. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6824. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6825. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6826. ELSE
  6827. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6828. END
  6829. (* ---- HALT, SYSTEM.HALT----- *)
  6830. |Global.Halt, Global.systemHalt:
  6831. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6832. EmitTrap (position, val);
  6833. (* ---- ASSERT ----- *)
  6834. |Global.Assert:
  6835. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6836. trueL := NewLabel();
  6837. falseL := NewLabel();
  6838. Condition(p0,trueL,falseL);
  6839. IF p1 = NIL THEN val := AssertTrap
  6840. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6841. END;
  6842. SetLabel(falseL);
  6843. EmitTrap(position,val);
  6844. SetLabel(trueL);
  6845. END;
  6846. (*
  6847. Emit(TrapC(result.op,val);
  6848. *)
  6849. (* ---- INC, DEC----- *)
  6850. |Global.Inc,Global.Dec:
  6851. Expression(p0); adr := result.op;
  6852. LoadValue(result,p0.type); l := result;
  6853. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6854. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6855. END;
  6856. IF x.id = Global.Inc THEN
  6857. Emit(Add(position,l.op,l.op,r.op));
  6858. ELSE
  6859. Emit(Sub(position,l.op,l.op,r.op));
  6860. END;
  6861. ReleaseOperand(l); ReleaseOperand(r);
  6862. (* ---- LEN ----- *)
  6863. |Global.Len: (* dynamic length, static length done by checker *)
  6864. Designate(p0,operand);
  6865. IF p1 = NIL THEN
  6866. InitOperand(l,ModeValue);
  6867. l.op := IntermediateCode.Immediate(int32,0);
  6868. ELSE
  6869. Evaluate(p1,l);
  6870. END;
  6871. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6872. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6873. Dereference(operand, p0.type.resolved, FALSE);
  6874. END;
  6875. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6876. ReleaseOperand(operand); ReleaseOperand(l);
  6877. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6878. ASSERT(p1 # NIL);
  6879. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6880. Dereference(operand,p0.type.resolved,FALSE);
  6881. END;
  6882. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6883. ReleaseOperand(operand); ReleaseOperand(l);
  6884. ELSE HALT(100);
  6885. END;
  6886. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6887. (* ---- FIRST ---- *)
  6888. |Global.First:
  6889. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6890. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6891. ELSE
  6892. Designate(p0, result)
  6893. END
  6894. (* ---- LAST ---- *)
  6895. |Global.Last:
  6896. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6897. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6898. ELSE
  6899. Designate(p0, result);
  6900. (* make sure result.op is a register *)
  6901. tmp := result.op;
  6902. ReuseCopy(result.op, result.op);
  6903. ReleaseIntermediateOperand(tmp);
  6904. (* add offset to result.op *)
  6905. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6906. END
  6907. (* ---- STEP ---- *)
  6908. |Global.Step:
  6909. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6910. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6911. ELSE
  6912. Designate(p0, result);
  6913. (* make sure result.op is a register *)
  6914. tmp := result.op;
  6915. ReuseCopy(result.op, result.op);
  6916. ReleaseIntermediateOperand(tmp);
  6917. (* add offset to result.op *)
  6918. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6919. END
  6920. (* ---- RE ---- *)
  6921. |Global.Re:
  6922. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6923. Designate(p0, result)
  6924. ELSE
  6925. Evaluate(p0, result)
  6926. END
  6927. (* ---- IM ---- *)
  6928. |Global.Im:
  6929. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6930. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6931. Designate(p0, result);
  6932. (* make sure result.op is a register *)
  6933. tmp := result.op;
  6934. ReuseCopy(result.op, result.op);
  6935. ReleaseIntermediateOperand(tmp);
  6936. (* add offset to result.op *)
  6937. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6938. (* ---- ABS ----- *)
  6939. |Global.Abs:
  6940. Evaluate(p0,operand);
  6941. type := p0.type.resolved;
  6942. InitOperand(result,ModeValue);
  6943. Reuse1a(result.op,operand.op,dest);
  6944. Emit(Abs(position,result.op,operand.op));
  6945. ReleaseOperand(operand);
  6946. (* ---- WAIT ----- *)
  6947. |Global.Wait:
  6948. Evaluate(p0,operand);
  6949. Emit(Push(position,operand.op));
  6950. ReleaseOperand(operand);
  6951. CallThis(position,"Activities","Wait", 1);
  6952. (* ---- NEW ----- *)
  6953. |Global.New:
  6954. (*! the following code is only correct for "standard" Oberon calling convention *)
  6955. type := p0.type.resolved;
  6956. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6957. THEN
  6958. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6959. IF backend.cooperative THEN
  6960. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6961. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6962. IF recordType.isObject THEN
  6963. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6964. IF recordType.IsActive() THEN
  6965. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6966. END;
  6967. IF recordType.IsProtected() THEN
  6968. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6969. END;
  6970. ELSE
  6971. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6972. END;
  6973. END;
  6974. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6975. CallThis(position,"Runtime","New", 1);
  6976. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6977. Emit(Result(position, pointer));
  6978. exit := NewLabel();
  6979. BreqL(exit,pointer,nil);
  6980. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6981. GetRecordTypeName (recordType,name);
  6982. IF ~recordType.isObject THEN
  6983. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6984. END;
  6985. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6986. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6987. IF recordType.isObject THEN
  6988. IF recordType.IsProtected() THEN
  6989. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6990. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6991. END;
  6992. IF recordType.IsActive() THEN
  6993. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6994. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6995. END;
  6996. END;
  6997. END;
  6998. (* initialize fields *)
  6999. IF type(SyntaxTree.PointerType).isPlain THEN
  7000. size := 0;
  7001. ELSIF recordType.isObject THEN
  7002. size := BaseObjectTypeSize;
  7003. ELSE
  7004. size := BaseRecordTypeSize;
  7005. END;
  7006. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7007. (* call initializer *)
  7008. constructor := GetConstructor(recordType);
  7009. IF constructor # NIL THEN
  7010. (*! should be unified with ProcedureCallDesignator *)
  7011. Emit(Push(position,pointer));
  7012. ReleaseIntermediateOperand(pointer);
  7013. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7014. FOR i := 1 TO x.parameters.Length()-1 DO
  7015. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7016. formalParameter := formalParameter.nextParameter;
  7017. END;
  7018. (* static call of the constructor *)
  7019. GetCodeSectionNameForSymbol(constructor,name);
  7020. ASSERT(~constructor.isInline);
  7021. IF constructor.scope.ownerModule # module.module THEN
  7022. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7023. ELSE
  7024. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7025. END;
  7026. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7027. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7028. Emit(Pop(position,pointer));
  7029. END;
  7030. (* call bodies *)
  7031. CallBodies(pointer,p0.type);
  7032. SetLabel(exit);
  7033. needsTrace := p0.NeedsTrace();
  7034. IF needsTrace THEN ModifyAssignments(true) END;
  7035. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7036. Emit(Push(position, pointer));
  7037. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7038. Emit(Pop(position, pointer));
  7039. END;
  7040. Designate(p0,l);
  7041. IF needsTrace THEN
  7042. CallAssignPointer(l.op, pointer);
  7043. ELSE
  7044. ToMemory(l.op,addressType,0);
  7045. Emit(Mov(position,l.op,pointer));
  7046. END;
  7047. ReleaseIntermediateOperand(pointer);
  7048. ReleaseOperand(l);
  7049. IF needsTrace THEN ModifyAssignments(false) END;
  7050. ELSE
  7051. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7052. IF temporaryVariable # NIL THEN
  7053. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7054. ELSE
  7055. Designate(p0,l);
  7056. END;
  7057. (* l.op contains address of pointer to record *)
  7058. Emit(Push(position,l.op)); (* address for use after syscall *)
  7059. Emit(Push(position,l.op));
  7060. ReleaseOperand(l);
  7061. (* push type descriptor *)
  7062. reg := TypeDescriptorAdr(recordType);
  7063. IF ~newObjectFile THEN
  7064. IntermediateCode.MakeMemory(reg,addressType);
  7065. END;
  7066. Emit(Push(position,reg));
  7067. ReleaseIntermediateOperand(reg);
  7068. (* push realtime flag *)
  7069. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7070. ELSE Emit(Push(position,false));
  7071. END;
  7072. CallThis(position,"Heaps","NewRec", 3);
  7073. (* check allocation success, if not successful then do not call initializers and bodies *)
  7074. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7075. Emit(Pop(position,pointer));
  7076. MakeMemory(reg,pointer,addressType,0);
  7077. ReleaseIntermediateOperand(pointer);
  7078. pointer := reg;
  7079. exit := NewLabel();
  7080. BreqL(exit,pointer,nil);
  7081. Emit(Push(position,pointer));
  7082. (* initialize fields *)
  7083. InitFields(recordType, pointer,0);
  7084. (* call initializer *)
  7085. constructor := GetConstructor(recordType);
  7086. IF constructor # NIL THEN
  7087. (*! should be unified with ProcedureCallDesignator *)
  7088. Emit(Push(position,pointer));
  7089. ReleaseIntermediateOperand(pointer);
  7090. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7091. FOR i := 1 TO x.parameters.Length()-1 DO
  7092. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7093. formalParameter := formalParameter.nextParameter;
  7094. END;
  7095. (* static call of the constructor *)
  7096. GetCodeSectionNameForSymbol(constructor,name);
  7097. ASSERT(~constructor.isInline);
  7098. IF constructor.scope.ownerModule # module.module THEN
  7099. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7100. ELSE
  7101. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7102. END;
  7103. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7104. ELSE
  7105. ReleaseIntermediateOperand(pointer);
  7106. END;
  7107. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7108. Emit(Pop(position,pointer));
  7109. IF temporaryVariable # NIL THEN
  7110. Designate(p0,l);
  7111. ToMemory(l.op,addressType,0);
  7112. Emit(Mov(position,l.op,pointer));
  7113. ReleaseOperand(l);
  7114. result.tag := emptyOperand;
  7115. END;
  7116. (* call bodies *)
  7117. CallBodies(pointer,p0.type);
  7118. ReleaseIntermediateOperand(pointer);
  7119. IF temporaryVariable # NIL THEN
  7120. end := NewLabel();
  7121. BrL(end);
  7122. SetLabel(exit);
  7123. Designate(p0,l);
  7124. ToMemory(l.op,addressType,0);
  7125. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7126. ReleaseOperand(l);
  7127. SetLabel(end);
  7128. ELSE
  7129. SetLabel(exit);
  7130. END;
  7131. END;
  7132. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7133. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7134. dim := 0;
  7135. IF p1 # NIL THEN
  7136. FOR i := 1 TO x.parameters.Length()-1 DO
  7137. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7138. parameter := x.parameters.GetExpression(i);
  7139. Evaluate(parameter,r);
  7140. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7141. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7142. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7143. END;
  7144. Emit(Push(position,r.op));
  7145. IF i=1 THEN
  7146. ReuseCopy(reg,r.op);
  7147. ELSE
  7148. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7149. END;
  7150. ReleaseOperand(r);
  7151. INC(dim);
  7152. END;
  7153. Convert(reg,addressType);
  7154. ELSE
  7155. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7156. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7157. END;
  7158. openDim := dim;
  7159. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7160. IF backend.cooperative THEN
  7161. size := ToMemoryUnits(system,system.SizeOf(type));
  7162. WHILE type IS SyntaxTree.ArrayType DO
  7163. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7164. END;
  7165. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7166. IF (size # 1) THEN
  7167. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7168. END;
  7169. Emit(Push(position,reg));
  7170. size := ToMemoryUnits(system,system.SizeOf(type));
  7171. IF (size # 1) THEN
  7172. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7173. END;
  7174. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7175. Emit(Push(position,reg));
  7176. ReleaseIntermediateOperand(reg);
  7177. CallThis(position,"Runtime","New", 1);
  7178. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7179. Emit(Result(position, pointer));
  7180. exit := NewLabel();
  7181. else := NewLabel();
  7182. BreqL(else,pointer,nil);
  7183. IF ~type.hasPointers THEN
  7184. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7185. ELSIF type IS SyntaxTree.RecordType THEN
  7186. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7187. ELSIF type IS SyntaxTree.ProcedureType THEN
  7188. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7189. ELSE
  7190. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7191. END;
  7192. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7193. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7194. 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))));
  7195. IF type IS SyntaxTree.RecordType THEN
  7196. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7197. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7198. ELSE
  7199. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7200. END;
  7201. i := openDim;
  7202. WHILE i > 0 DO
  7203. DEC (i);
  7204. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7205. END;
  7206. needsTrace := p0.NeedsTrace();
  7207. IF needsTrace THEN ModifyAssignments(true) END;
  7208. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7209. Emit(Push(position, pointer));
  7210. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7211. Emit(Pop(position, pointer));
  7212. END;
  7213. Designate(p0,l);
  7214. IF needsTrace THEN
  7215. CallAssignPointer(l.op, pointer);
  7216. ModifyAssignments(false);
  7217. ELSE
  7218. ToMemory(l.op,addressType,0);
  7219. Emit(Mov(position,l.op,pointer));
  7220. END;
  7221. ReleaseIntermediateOperand(pointer);
  7222. ReleaseOperand(l);
  7223. BrL(exit);
  7224. SetLabel(else);
  7225. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7226. Designate(p0,l);
  7227. IF needsTrace THEN
  7228. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7229. ELSE
  7230. ToMemory(l.op,addressType,0);
  7231. Emit(Mov(position,l.op,pointer));
  7232. END;
  7233. ReleaseOperand(l);
  7234. SetLabel(exit);
  7235. ELSE
  7236. (*! the following code is only correct for "standard" Oberon calling convention *)
  7237. IF SemanticChecker.ContainsPointer(type) THEN
  7238. IF type IS SyntaxTree.ArrayType THEN
  7239. staticLength := 1;
  7240. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7241. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7242. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7243. END;
  7244. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7245. Emit(Mul(position,reg,reg,tmp));
  7246. END;
  7247. Designate(p0,l);
  7248. IF openDim > 0 THEN
  7249. Emit(Push(position,l.op)); (* address for use after syscall *)
  7250. END;
  7251. Emit(Push(position,l.op)); (* address *)
  7252. ReleaseOperand(l);
  7253. tmp := TypeDescriptorAdr(type);
  7254. IF ~newObjectFile THEN
  7255. IntermediateCode.MakeMemory(tmp,addressType);
  7256. END;
  7257. Emit(Push(position,tmp)); (* type descriptor *)
  7258. ReleaseIntermediateOperand(tmp);
  7259. Emit(Push(position,reg)); (* number Elements *)
  7260. ReleaseIntermediateOperand(reg);
  7261. tmp := IntermediateCode.Immediate(addressType,dim);
  7262. Emit(Push(position,tmp)); (* dimensions *)
  7263. (* push realtime flag *)
  7264. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7265. ELSE Emit(Push(position,false));
  7266. END;
  7267. CallThis(position,"Heaps","NewArr",5)
  7268. ELSE
  7269. size := ToMemoryUnits(system,system.SizeOf(type));
  7270. IF (size # 1) THEN
  7271. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7272. END;
  7273. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7274. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7275. Emit(Add(position,reg,reg,tmp));
  7276. Designate(p0,l);
  7277. IF openDim >0 THEN
  7278. Emit(Push(position,l.op)); (* address for use after syscall *)
  7279. END;
  7280. Emit(Push(position,l.op)); (* address for syscall *)
  7281. ReleaseOperand(l); (* pointer address *)
  7282. Emit(Push(position,reg)); (* size *)
  7283. ReleaseIntermediateOperand(reg);
  7284. (* push realtime flag *)
  7285. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7286. ELSE Emit(Push(position,false));
  7287. END;
  7288. CallThis(position,"Heaps","NewSys", 3)
  7289. END;
  7290. IF openDim > 0 THEN
  7291. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7292. Emit(Pop(position,adr));
  7293. ToMemory(adr,addressType,0);
  7294. ReuseCopy(tmp,adr);
  7295. ReleaseIntermediateOperand(adr);
  7296. adr := tmp;
  7297. else := NewLabel();
  7298. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7299. i := openDim-1;
  7300. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7301. WHILE (i >= 0) DO
  7302. Emit(Pop(position,reg));
  7303. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7304. Emit(Mov(position,res,reg));
  7305. DEC(i);
  7306. END;
  7307. ReleaseIntermediateOperand(adr);
  7308. ReleaseIntermediateOperand(reg);
  7309. exit := NewLabel();
  7310. BrL(exit);
  7311. SetLabel(else);
  7312. (* else part: array could not be allocated *)
  7313. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7314. Emit(Add(position,sp,sp,tmp));
  7315. SetLabel(exit);
  7316. END;
  7317. END;
  7318. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7319. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7320. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7321. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7322. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7323. left.SetType(procedure.type);
  7324. formalParameter := procedureType.firstParameter;
  7325. (* push array to allocate *)
  7326. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7327. formalParameter :=formalParameter.nextParameter;
  7328. (* push length array *)
  7329. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7330. (* push size *)
  7331. type := t0;
  7332. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7333. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7334. END;
  7335. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7336. Emit(Push(position,tmp));
  7337. (* *)
  7338. IF SemanticChecker.ContainsPointer(type) THEN
  7339. tmp := TypeDescriptorAdr(type);
  7340. IF ~newObjectFile THEN
  7341. IntermediateCode.MakeMemory(tmp,addressType);
  7342. END;
  7343. ELSE
  7344. tmp := IntermediateCode.Immediate(addressType, 0);
  7345. END;
  7346. Emit(Push(position,tmp)); (* type descriptor *)
  7347. StaticCallOperand(result,procedure);
  7348. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7349. ReleaseOperand(result);
  7350. END;
  7351. (*
  7352. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7353. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7354. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7355. *)
  7356. ELSE
  7357. dim := 0;
  7358. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7359. (* generate geometry descriptor *)
  7360. Designate(p0,l);
  7361. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7362. ReleaseOperand(l);
  7363. isTensor := TRUE;
  7364. ELSE
  7365. isTensor := FALSE;
  7366. END;
  7367. FOR i := 1 TO x.parameters.Length()-1 DO
  7368. IF ~isTensor THEN
  7369. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7370. END;
  7371. parameter := x.parameters.GetExpression(i);
  7372. Evaluate(parameter,r);
  7373. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7374. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7375. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7376. END;
  7377. Emit(Push(position,r.op));
  7378. IF i=1 THEN
  7379. ReuseCopy(reg,r.op);
  7380. ELSE
  7381. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7382. END;
  7383. ReleaseOperand(r);
  7384. INC(dim);
  7385. END;
  7386. Convert(reg,addressType);
  7387. openDim := dim;
  7388. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7389. (*! the following code is only correct for "standard" Oberon calling convention *)
  7390. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7391. t := type;
  7392. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7393. staticLength := 1;
  7394. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7395. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7396. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7397. END;
  7398. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7399. Emit(Mul(position,reg,reg,tmp));
  7400. END;
  7401. Designate(p0,l);
  7402. IF isTensor THEN
  7403. Dereference(l,type,FALSE);
  7404. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7405. END;
  7406. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7407. Emit(Push(position,l.tag)); (* address *)
  7408. ReleaseOperand(l);
  7409. tmp := TypeDescriptorAdr(t);
  7410. IF ~newObjectFile THEN
  7411. IntermediateCode.MakeMemory(tmp,addressType);
  7412. END;
  7413. Emit(Push(position,tmp)); (* type descriptor *)
  7414. ReleaseIntermediateOperand(tmp);
  7415. Emit(Push(position,reg)); (* number Elements *)
  7416. ReleaseIntermediateOperand(reg);
  7417. tmp := IntermediateCode.Immediate(addressType,0);
  7418. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7419. (* push realtime flag: false by default *)
  7420. Emit(Push(position,false));
  7421. CallThis(position,"Heaps","NewArr",5);
  7422. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7423. Emit(Pop(position,adr));
  7424. GetMathArrayField(tmp,adr,MathPtrOffset);
  7425. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7426. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7427. PutMathArrayField(adr,reg,MathAdrOffset);
  7428. ReleaseIntermediateOperand(tmp);
  7429. ReleaseIntermediateOperand(reg);
  7430. ELSE
  7431. IF isTensor THEN
  7432. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7433. ELSE
  7434. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7435. END;
  7436. IF (size # 1) THEN
  7437. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7438. END;
  7439. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7440. Emit(Add(position,reg,reg,tmp));
  7441. Designate(p0,l);
  7442. IF isTensor THEN
  7443. Dereference(l,type,FALSE);
  7444. END;
  7445. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7446. Emit(Push(position,l.tag)); (* address for syscall *)
  7447. ReleaseOperand(l); (* pointer address *)
  7448. Emit(Push(position,reg)); (* size *)
  7449. ReleaseIntermediateOperand(reg);
  7450. (* push realtime flag: false by default *)
  7451. Emit(Push(position,false));
  7452. CallThis(position,"Heaps","NewSys",3);
  7453. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7454. Emit(Pop(position,adr));
  7455. GetMathArrayField(tmp,adr,MathPtrOffset);
  7456. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7457. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7458. PutMathArrayField(adr,reg,MathAdrOffset);
  7459. ReleaseIntermediateOperand(tmp);
  7460. ReleaseIntermediateOperand(reg);
  7461. END;
  7462. flags := {};
  7463. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7464. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7465. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7466. PutMathArrayField(adr,tmp,MathDimOffset);
  7467. else := NewLabel();
  7468. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7469. i := openDim-1;
  7470. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7471. IF isTensor THEN
  7472. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7473. ELSE
  7474. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7475. END;
  7476. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7477. WHILE (i >= 0) DO
  7478. Emit(Pop(position,reg));
  7479. PutMathArrayLength(adr,reg,i);
  7480. PutMathArrayIncrement(adr,tmp,i);
  7481. IF i > 0 THEN
  7482. IF i=openDim-1 THEN
  7483. ReuseCopy(tmp,tmp);
  7484. END;
  7485. Emit(Mul(position,tmp,tmp,reg));
  7486. END;
  7487. DEC(i);
  7488. END;
  7489. ReleaseIntermediateOperand(adr);
  7490. ReleaseIntermediateOperand(reg);
  7491. ReleaseIntermediateOperand(tmp);
  7492. exit := NewLabel();
  7493. BrL(exit);
  7494. SetLabel(else);
  7495. (* else part: array could not be allocated *)
  7496. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7497. Emit(Add(position,sp,sp,tmp));
  7498. SetLabel(exit);
  7499. END;
  7500. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7501. THEN
  7502. IF ~backend.cellsAreObjects THEN RETURN END;
  7503. IF InCellScope(currentScope) THEN
  7504. PushSelfPointer()
  7505. ELSE
  7506. Emit(Push(position, nil));
  7507. END;
  7508. (* push temp address *)
  7509. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7510. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7511. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7512. (* l.op contains address of pointer to record *)
  7513. Emit(Push(position,l.op)); (* address for use after syscall *)
  7514. ReleaseOperand(l);
  7515. (* push type descriptor *)
  7516. reg := TypeDescriptorAdr(baseType);
  7517. IF ~newObjectFile THEN
  7518. IntermediateCode.MakeMemory(reg,addressType);
  7519. END;
  7520. Emit(Push(position,reg));
  7521. ReleaseIntermediateOperand(reg);
  7522. (* push name *)
  7523. (*Global.GetSymbolName(p0, n);*)
  7524. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7525. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7526. ELSE
  7527. Global.GetModuleName(module.module, n);
  7528. END;
  7529. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7530. (*type.typeDeclaration.GetName(n);*)
  7531. PushConstString(n);
  7532. (* push cellnet boolean *)
  7533. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7534. (* push engine boolean *)
  7535. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7536. (* allocate *)
  7537. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7538. (* add capabilities *)
  7539. modifier := p0(SyntaxTree.Designator).modifiers;
  7540. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7541. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7542. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7543. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7544. END;
  7545. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7546. (*
  7547. modifier := baseType(SyntaxTree.CellType).modifiers;
  7548. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7549. modifier := p0(SyntaxTree.Designator).modifiers;
  7550. *)
  7551. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7552. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7553. (* l.op contains address of pointer to record *)
  7554. ToMemory(l.op,addressType,0);
  7555. (* l.op contains value of pointer to record *)
  7556. Emit(Push(position,l.op)); (* address for use after syscall *)
  7557. ReleaseOperand(l);
  7558. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7559. prevScope := currentScope;
  7560. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7561. previous := section;
  7562. section := init;
  7563. (* add ports *)
  7564. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7565. CloseInitializer(previous);
  7566. currentScope := prevScope;
  7567. Symbol(temporaryVariable,l);
  7568. ToMemory(l.op,addressType,0);
  7569. Emit(Push(position,l.op));
  7570. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7571. (*
  7572. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7573. IF constructor # NIL THEN
  7574. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7575. FOR i := 1 TO x.parameters.Length()-1 DO
  7576. p := x.parameters.GetExpression(i);
  7577. Global.GetSymbolName(parameter,name);
  7578. Evaluate(p, value);
  7579. ASSERT(value.type # NIL);
  7580. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7581. par := instance.AddParameter(name);
  7582. par.SetInteger(value.integer);
  7583. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7584. par := instance.AddParameter(name);
  7585. par.SetBoolean(value.boolean);
  7586. ELSE Error(x.position,NotYetImplemented)
  7587. END;
  7588. parameter := parameter.nextParameter
  7589. END;
  7590. END;
  7591. *)
  7592. (* call initializer *)
  7593. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7594. IF constructor # NIL THEN
  7595. (*! should be unified with ProcedureCallDesignator *)
  7596. IF backend.cellsAreObjects THEN
  7597. Symbol(temporaryVariable,l);
  7598. ToMemory(l.op,addressType,0);
  7599. Emit(Push(position,l.op));
  7600. ReleaseOperand(l);
  7601. END;
  7602. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7603. FOR i := 1 TO x.parameters.Length()-1 DO
  7604. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7605. formalParameter := formalParameter.nextParameter;
  7606. END;
  7607. (* static call of the constructor *)
  7608. Global.GetSymbolSegmentedName(constructor,name);
  7609. ASSERT(~constructor.isInline);
  7610. IF constructor.scope.ownerModule # module.module THEN
  7611. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7612. ELSE
  7613. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7614. END;
  7615. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7616. (*ELSE
  7617. ReleaseIntermediateOperand(pointer);*)
  7618. END;
  7619. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7620. ToMemory(l.op, addressType, 0);
  7621. Designate(p0,s0);
  7622. ToMemory(s0.op,addressType,0);
  7623. Emit(Mov(position,s0.op,l.op));
  7624. ReleaseOperand(l);
  7625. ReleaseOperand(s0);
  7626. result.tag := emptyOperand;
  7627. (* start *)
  7628. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7629. (* push cell *)
  7630. Symbol(temporaryVariable, l);
  7631. ToMemory(l.op,addressType,0);
  7632. Emit(Push(-1,l.op));
  7633. (* push delegate *)
  7634. Emit(Push(-1,l.op));
  7635. ReleaseOperand(l);
  7636. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7637. Emit(Push(position, s1.op));
  7638. ReleaseOperand(s1);
  7639. CallThis(position,"ActiveCellsRuntime","Start",3);
  7640. END;
  7641. (*IF temporaryVariable # NIL THEN
  7642. end := NewLabel();
  7643. BrL(end);
  7644. SetLabel(exit);
  7645. Designate(p0,l);
  7646. ToMemory(l.op,addressType,0);
  7647. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7648. ReleaseOperand(l);
  7649. SetLabel(end);
  7650. ELSE
  7651. SetLabel(exit);
  7652. END;
  7653. *)
  7654. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7655. ELSE (* no pointer to record, no pointer to array *)
  7656. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7657. (* ignore new statement *)
  7658. Warning(p0.position, "cannot run on final hardware");
  7659. ELSE
  7660. HALT(200);
  7661. END;
  7662. END;
  7663. (* ---- ADDRESSOF----- *)
  7664. |Global.systemAdr:
  7665. Designate(p0,s0);
  7666. s0.mode := ModeValue;
  7667. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7668. ReleaseIntermediateOperand(s0.op);
  7669. s0.op := s0.tag;
  7670. IntermediateCode.InitOperand(s0.tag);
  7671. END;
  7672. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7673. result := s0;
  7674. (* ---- BIT ----- *)
  7675. |Global.systemBit:
  7676. Evaluate(p0,s0);
  7677. ToMemory(s0.op,addressType,0);
  7678. ReuseCopy(res,s0.op);
  7679. ReleaseOperand(s0);
  7680. Evaluate(p1,s1);
  7681. Emit(Ror(position,res,res,s1.op));
  7682. ReleaseOperand(s1);
  7683. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7684. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7685. IF ~conditional THEN
  7686. InitOperand(result,ModeValue); result.op := res;
  7687. ELSE
  7688. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7689. BrL(falseLabel);
  7690. ReleaseIntermediateOperand(res);
  7691. END;
  7692. (* --- MSK ----*)
  7693. |Global.systemMsk:
  7694. Evaluate(p0,s0);
  7695. Evaluate(p1,s1);
  7696. ReuseCopy(res,s0.op);
  7697. ReleaseOperand(s0);
  7698. Emit(And(position,res,res,s1.op));
  7699. ReleaseOperand(s1);
  7700. InitOperand(result,ModeValue);
  7701. result.op := res;
  7702. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7703. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7704. Evaluate(p0,s0);
  7705. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7706. ReleaseOperand(s0);
  7707. InitOperand(result,ModeValue);
  7708. result.op := res;
  7709. (* ---- SYSTEM.GetStackPointer ----- *)
  7710. |Global.systemGetStackPointer:
  7711. InitOperand(result,ModeValue);
  7712. result.op := sp;
  7713. (* ---- SYSTEM.GetFramePointer ----- *)
  7714. |Global.systemGetFramePointer:
  7715. InitOperand(result,ModeValue);
  7716. result.op := fp;
  7717. (* ---- SYSTEM.GetActivity ----- *)
  7718. |Global.systemGetActivity:
  7719. ASSERT(backend.cooperative);
  7720. InitOperand(result,ModeValue);
  7721. result.op := ap;
  7722. (* ---- SYSTEM.SetStackPointer ----- *)
  7723. |Global.systemSetStackPointer:
  7724. Evaluate(p0,s0); (* *)
  7725. Emit(Mov(position,sp,s0.op));
  7726. ReleaseOperand(s0);
  7727. (* ---- SYSTEM.SetFramePointer ----- *)
  7728. |Global.systemSetFramePointer:
  7729. Evaluate(p0,s0); (* *)
  7730. Emit(Mov(position,fp,s0.op));
  7731. ReleaseOperand(s0);
  7732. (* ---- SYSTEM.Activity ----- *)
  7733. |Global.systemSetActivity:
  7734. ASSERT(backend.cooperative);
  7735. Evaluate(p0,s0); (* *)
  7736. Emit(Mov(position,ap,s0.op));
  7737. ReleaseOperand(s0);
  7738. (* ---- SYSTEM.VAL ----- *)
  7739. |Global.systemVal:
  7740. Expression(p1);
  7741. s1 := result;
  7742. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7743. IF s1.mode = ModeReference THEN
  7744. (* nothing to be done if not record type, just take over new type *)
  7745. IF (type IS SyntaxTree.RecordType) THEN
  7746. ReleaseIntermediateOperand(s1.tag);
  7747. s1.tag := TypeDescriptorAdr(type);
  7748. IF ~newObjectFile THEN
  7749. IntermediateCode.MakeMemory(s1.tag,addressType);
  7750. END;
  7751. UseIntermediateOperand(s1.tag);
  7752. END;
  7753. result := s1;
  7754. ELSE (* copy over result to different type, may not use convert *)
  7755. itype := IntermediateCode.GetType(system,type);
  7756. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7757. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7758. Emit(Mov(position,s0.op,s1.op));
  7759. ReleaseOperand(s1);
  7760. InitOperand(result,ModeValue);
  7761. result.op := s0.op;
  7762. ELSE (* different size, must convert *)
  7763. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7764. Convert(s1.op, IntermediateCode.GetType(system,type));
  7765. result := s1;
  7766. END;
  7767. END;
  7768. (* ---- SYSTEM.GET ----- *)
  7769. |Global.systemGet:
  7770. Evaluate(p0,s0); (* adr *)
  7771. Designate(p1,s1); (* variable *)
  7772. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7773. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7774. Emit(Mov(position,s1.op,s0.op));
  7775. ReleaseOperand(s1);
  7776. ReleaseOperand(s0);
  7777. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7778. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7779. Evaluate(p0,s0); (* *)
  7780. Evaluate(p1,s1); (* variable *)
  7781. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7782. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7783. (* real part *)
  7784. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7785. Emit(Mov(position,res, s1.op));
  7786. ReleaseIntermediateOperand(res);
  7787. (* imaginary part *)
  7788. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7789. Emit(Mov(position,res, s1.tag));
  7790. ReleaseIntermediateOperand(res);
  7791. ReleaseOperand(s1);
  7792. ReleaseOperand(s0);
  7793. ELSE
  7794. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7795. ReleaseOperand(s0);
  7796. Emit(Mov(position,res,s1.op));
  7797. ReleaseIntermediateOperand(res);
  7798. ReleaseOperand(s1);
  7799. END;
  7800. (* ---- SYSTEM.MOVE ----- *)
  7801. |Global.systemMove:
  7802. Evaluate(p0,s0);
  7803. Evaluate(p1,s1);
  7804. Evaluate(p2,s2);
  7805. Emit(Copy(position,s1.op,s0.op,s2.op));
  7806. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7807. (* ---- SYSTEM.NEW ----- *)
  7808. |Global.systemNew:
  7809. Designate(p0,s0);
  7810. Emit(Push(position,s0.op));
  7811. ReleaseOperand(s0);
  7812. Evaluate(p1,s1);
  7813. Emit(Push(position,s1.op));
  7814. ReleaseOperand(s1);
  7815. (* push realtime flag: false by default *)
  7816. Emit(Push(position,false));
  7817. CallThis(position,"Heaps","NewSys",3);
  7818. (* ---- SYSTEM.CALL ----- *)
  7819. |Global.systemRef:
  7820. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7821. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7822. s0.mode := ModeValue;
  7823. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7824. result := s0
  7825. (* ---- INCR ----- *)
  7826. |Global.Incr:
  7827. Designate(p0,operand);
  7828. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7829. Dereference(operand,p0.type.resolved,FALSE);
  7830. END;
  7831. ASSERT(p1 # NIL);
  7832. Evaluate(p1,l);
  7833. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7834. ReleaseOperand(operand); ReleaseOperand(l);
  7835. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7836. (* ---- SUM ----- *)
  7837. |Global.Sum: HALT(200);
  7838. (* ---- ALL ----- *)
  7839. |Global.All: HALT(200);
  7840. (* ---- CAS ----- *)
  7841. |Global.Cas:
  7842. needsTrace := p0.NeedsTrace();
  7843. IF needsTrace THEN ModifyAssignments(true) END;
  7844. Designate(p0,s0);
  7845. Evaluate(p1,s1);
  7846. Evaluate(p2,s2);
  7847. IF needsTrace THEN
  7848. Emit(Push(position, s0.op));
  7849. Emit(Push(position, s1.op));
  7850. Emit(Push(position, s2.op));
  7851. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7852. ELSE
  7853. Emit(Cas(position,s0.op,s1.op,s2.op));
  7854. END;
  7855. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7856. IF needsTrace THEN ModifyAssignments(false) END;
  7857. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7858. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7859. IF conditional THEN
  7860. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7861. BrL(falseLabel);
  7862. ReleaseIntermediateOperand(res);
  7863. END;
  7864. (* ---- DIM ----- *)
  7865. |Global.Dim:
  7866. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7867. Designate(p0,s0);
  7868. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7869. Dereference(s0,p0.type.resolved,FALSE);
  7870. END;
  7871. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7872. ReleaseOperand(s0);
  7873. (* ---- RESHAPE ----- *)
  7874. |Global.Reshape:
  7875. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7876. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7877. left.SetType(procedure.type);
  7878. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7879. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7880. END;
  7881. (* ---- SYSTEM.TYPECODE ----- *)
  7882. |Global.systemTypeCode:
  7883. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7884. IF type.resolved IS SyntaxTree.PointerType THEN
  7885. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7886. END;
  7887. result.op := TypeDescriptorAdr(type);
  7888. IF ~newObjectFile THEN
  7889. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7890. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7891. END;
  7892. result.mode := ModeValue;
  7893. (* ---- SYSTEM.TRACE ----- *)
  7894. |Global.systemTrace:
  7895. SystemTrace(x.parameters, x.position);
  7896. (* ----- CONNECT ------*)
  7897. |Global.Connect:
  7898. IF backend.cellsAreObjects THEN
  7899. PushPort(p0);
  7900. PushPort(p1);
  7901. IF p2 # NIL THEN
  7902. Evaluate(p2, s2);
  7903. Emit(Push(p2.position, s2.op));
  7904. ReleaseOperand(s2);
  7905. ELSE
  7906. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7907. END;
  7908. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7909. ELSE
  7910. Warning(x.position, "cannot run on final hardware");
  7911. END;
  7912. (* ----- DELEGATE ------*)
  7913. |Global.Delegate:
  7914. IF backend.cellsAreObjects THEN
  7915. PushPort(p0);
  7916. PushPort(p1);
  7917. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7918. ELSE
  7919. Warning(x.position, "cannot run on final hardware");
  7920. END;
  7921. (* ----- SEND ------*)
  7922. |Global.Send:
  7923. Evaluate(p0,s0);
  7924. Evaluate(p1,s1);
  7925. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7926. Emit(Push(position,s0.op));
  7927. Emit(Push(position,s1.op));
  7928. (*
  7929. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7930. *)
  7931. IF ~backend.cellsAreObjects THEN
  7932. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7933. END;
  7934. ReleaseOperand(s0);
  7935. ReleaseOperand(s1);
  7936. IF backend.cellsAreObjects THEN
  7937. CallThis(position,"ActiveCellsRuntime","Send",2);
  7938. ELSE
  7939. CallThis(position,ChannelModuleName,"Send",2);
  7940. END;
  7941. (* ----- RECEIVE ------*)
  7942. |Global.Receive:
  7943. Evaluate(p0,s0);
  7944. Emit(Push(position,s0.op));
  7945. Designate(p1,s1);
  7946. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7947. Emit(Push(position,s1.op));
  7948. IF p2 # NIL THEN
  7949. Designate(p2,s2);
  7950. Emit(Push(position,s2.op));
  7951. END;
  7952. (*
  7953. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7954. *)
  7955. IF ~backend.cellsAreObjects THEN
  7956. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7957. END;
  7958. ReleaseOperand(s0);
  7959. ReleaseOperand(s1);
  7960. ReleaseOperand(s2);
  7961. IF backend.cellsAreObjects THEN
  7962. IF p2 = NIL THEN
  7963. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7964. ELSE
  7965. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7966. END;
  7967. ELSE
  7968. IF p2 = NIL THEN
  7969. CallThis(position,ChannelModuleName,"Receive",2)
  7970. ELSE
  7971. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7972. END;
  7973. END;
  7974. | Global.systemSpecial:
  7975. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7976. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7977. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7978. (* determine if parameters are of the VAR kind *)
  7979. ASSERT(x.parameters.Length() <= 3);
  7980. formalParameter := procedureType.firstParameter;
  7981. FOR i := 0 TO x.parameters.Length() - 1 DO
  7982. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7983. formalParameter := formalParameter.nextParameter
  7984. END;
  7985. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7986. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7987. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7988. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7989. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7990. IF procedureType.returnType # NIL THEN
  7991. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7992. Emit(Result(position, res));
  7993. (*InitOperand(result,ModeValue);
  7994. result.op := res;
  7995. *)
  7996. IF ~conditional THEN
  7997. InitOperand(result,ModeValue); result.op := res;
  7998. ELSE
  7999. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8000. BrL(falseLabel);
  8001. ReleaseIntermediateOperand(res);
  8002. END;
  8003. END
  8004. ELSE (* function not yet implemented *)
  8005. Error(position,"not yet implemented");
  8006. END;
  8007. destination := dest;
  8008. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8009. END VisitBuiltinCallDesignator;
  8010. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8011. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8012. BEGIN
  8013. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8014. dest := destination; destination := emptyOperand;
  8015. Expression(x.left);
  8016. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8017. ELSIF isUnchecked THEN (* no check *)
  8018. ELSE
  8019. trueL := NewLabel();
  8020. falseL := NewLabel();
  8021. IF IsPointerToRecord(x.left.type,recordType) THEN
  8022. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8023. Emit(Mov(position,tag, result.op));
  8024. IF result.mode # ModeValue THEN
  8025. ptr := tag;
  8026. IntermediateCode.MakeMemory(ptr,addressType);
  8027. Emit(Mov(position,tag, ptr));
  8028. END;
  8029. IF ~backend.cooperative THEN
  8030. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8031. END;
  8032. IntermediateCode.MakeMemory(tag,addressType);
  8033. ELSE
  8034. tag := result.tag;
  8035. END;
  8036. TypeTest(tag,x.type,trueL,falseL);
  8037. ReleaseIntermediateOperand(tag);
  8038. SetLabel(falseL);
  8039. EmitTrap(position,TypeCheckTrap);
  8040. SetLabel(trueL);
  8041. END;
  8042. destination := dest;
  8043. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8044. END VisitTypeGuardDesignator;
  8045. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8046. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8047. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8048. VAR label: Label; pc: LONGINT;
  8049. BEGIN
  8050. IF backend.cooperative & ~isUnchecked THEN
  8051. pc := section.pc;
  8052. label := NewLabel();
  8053. BrneL(label, operand.op, nil);
  8054. EmitTrap(position, NilPointerTrap);
  8055. SetLabel(label);
  8056. INC(statCoopNilCheck, section.pc - pc);
  8057. END;
  8058. END NilCheck;
  8059. BEGIN
  8060. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8061. ReuseCopy(dereferenced,operand.op);
  8062. ReleaseOperand(operand);
  8063. operand.mode := ModeReference;
  8064. operand.op := dereferenced;
  8065. operand.tag := dereferenced;
  8066. UseIntermediateOperand(operand.tag);
  8067. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8068. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8069. ReleaseIntermediateOperand(operand.tag);
  8070. operand.tag := TypeDescriptorAdr(type);
  8071. IF ~newObjectFile THEN
  8072. IntermediateCode.MakeMemory(operand.tag,addressType);
  8073. END;
  8074. ELSE
  8075. IF ~backend.cooperative THEN
  8076. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8077. END;
  8078. IntermediateCode.MakeMemory(operand.tag,addressType);
  8079. END;
  8080. NilCheck(operand.op);
  8081. ELSIF type IS SyntaxTree.ArrayType THEN
  8082. IF isUnsafe THEN
  8083. NilCheck(operand.op);
  8084. ReleaseIntermediateOperand(operand.tag);
  8085. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8086. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8087. ELSE
  8088. operand.tag := emptyOperand;
  8089. END;
  8090. ELSE
  8091. NilCheck(operand.op);
  8092. IF backend.cooperative THEN
  8093. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8094. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8095. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8096. ELSE
  8097. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8098. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8099. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8100. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8101. END;
  8102. END;
  8103. ELSIF type IS SyntaxTree.MathArrayType THEN
  8104. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8105. IntermediateCode.MakeMemory(operand.op,addressType);
  8106. ELSE HALT(100);
  8107. END;
  8108. END Dereference;
  8109. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8110. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8111. BEGIN
  8112. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8113. dest := destination; destination := emptyOperand;
  8114. Evaluate(x.left,d);
  8115. type := x.type.resolved;
  8116. prevIsUnchecked := isUnchecked;
  8117. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8118. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8119. END;
  8120. Dereference(d,type,IsUnsafePointer(x.left.type));
  8121. isUnchecked := prevIsUnchecked;
  8122. result := d;
  8123. 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
  8124. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8125. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8126. END;
  8127. END;
  8128. destination := dest;
  8129. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8130. END VisitDereferenceDesignator;
  8131. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8132. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8133. BEGIN
  8134. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8135. dest := destination; destination := emptyOperand;
  8136. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8137. tag := result.op;
  8138. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8139. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8140. StaticCallOperand(result,procedure.super);
  8141. ReleaseIntermediateOperand(result.tag);
  8142. UseIntermediateOperand(tag); (* necessary ? *)
  8143. result.tag := tag;
  8144. destination := dest;
  8145. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8146. END VisitSupercallDesignator;
  8147. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8148. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8149. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8150. name: Basic.SegmentedName;
  8151. BEGIN
  8152. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8153. dest := destination; destination := emptyOperand;
  8154. scope := currentScope;
  8155. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8156. scope := scope.outerScope;
  8157. END;
  8158. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8159. IF newObjectFile THEN
  8160. moduleSection := meta.ModuleSection();
  8161. IF backend.cooperative THEN
  8162. moduleOffset := 0;
  8163. ELSE
  8164. moduleOffset := moduleSection.pc;
  8165. END;
  8166. result.mode := ModeValue;
  8167. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8168. ELSE
  8169. Symbol(moduleSelf,result);
  8170. IntermediateCode.MakeMemory(result.op,addressType);
  8171. END
  8172. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8173. result.mode := ModeValue;
  8174. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8175. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8176. ELSE
  8177. GetBaseRegister(basereg,currentScope,scope);
  8178. InitOperand(result,ModeReference);
  8179. result.op := basereg;
  8180. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  8181. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  8182. IF backend.cooperative THEN
  8183. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8184. END;
  8185. (* tag must be loaded when dereferencing SELF pointer *)
  8186. END;
  8187. destination := dest;
  8188. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8189. END VisitSelfDesignator;
  8190. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8191. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8192. BEGIN
  8193. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8194. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8195. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8196. parameter := procedureType.returnParameter;
  8197. VisitParameter(parameter);
  8198. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8199. END VisitResultDesignator;
  8200. (** values *)
  8201. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8202. BEGIN
  8203. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8204. IF conditional THEN
  8205. IF x.value THEN BrL(trueLabel)
  8206. ELSE BrL(falseLabel)
  8207. END;
  8208. ELSE
  8209. InitOperand(result,ModeValue);
  8210. IF x.value THEN result.op := true ELSE result.op := false END;
  8211. END;
  8212. END VisitBooleanValue;
  8213. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8214. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8215. BEGIN
  8216. Global.GetModuleSegmentedName(module.module, name);
  8217. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8218. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8219. RETURN section
  8220. END GetDataSection;
  8221. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8222. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8223. BEGIN
  8224. type := vop.type;
  8225. data := GetDataSection();
  8226. pc := EnterImmediate(data,vop);
  8227. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8228. IntermediateCode.MakeMemory(vop, type);
  8229. END GetImmediateMem;
  8230. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8231. BEGIN
  8232. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8233. InitOperand(result,ModeValue);
  8234. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8235. IF ~supportedImmediate(result.op) &~inData THEN
  8236. GetImmediateMem(result.op)
  8237. END;
  8238. END VisitIntegerValue;
  8239. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8240. BEGIN
  8241. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8242. InitOperand(result,ModeValue);
  8243. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8244. END VisitCharacterValue;
  8245. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8246. BEGIN
  8247. IF Trace THEN TraceEnter("VisitSetValue") END;
  8248. InitOperand(result,ModeValue);
  8249. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8250. END VisitSetValue;
  8251. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8252. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8253. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8254. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8255. BEGIN
  8256. numberElements := x.elements.Length();
  8257. FOR i := 0 TO numberElements-1 DO
  8258. expression := x.elements.GetExpression(i);
  8259. IF expression IS SyntaxTree.MathArrayExpression THEN
  8260. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8261. ELSE
  8262. inData := TRUE;
  8263. Evaluate(expression,op);
  8264. irv.Emit(Data(position,op.op));
  8265. inData := FALSE;
  8266. ReleaseOperand(op);
  8267. END;
  8268. END;
  8269. END RecursiveData;
  8270. BEGIN
  8271. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8272. IF ~TryConstantDeclaration() THEN
  8273. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8274. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8275. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8276. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8277. ELSE
  8278. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8279. END;
  8280. RecursiveData(x.array);
  8281. InitOperand(result,ModeReference);
  8282. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8283. END
  8284. END VisitMathArrayValue;
  8285. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8286. VAR constant: Sections.Section;
  8287. BEGIN
  8288. IF constantDeclaration = NIL THEN
  8289. RETURN FALSE
  8290. ELSE
  8291. (* Is a constant in this module: did we generate it already? *)
  8292. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8293. IF constant # NIL THEN
  8294. InitOperand(result,ModeReference);
  8295. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8296. RETURN TRUE;
  8297. END;
  8298. END;
  8299. RETURN FALSE
  8300. END TryConstantDeclaration;
  8301. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8302. BEGIN
  8303. constantDeclaration := x;
  8304. x.value.resolved.Accept(SELF);
  8305. END VisitConstant;
  8306. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8307. BEGIN
  8308. IF Trace THEN TraceEnter("VisitRealValue") END;
  8309. InitOperand(result,ModeValue);
  8310. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8311. END VisitRealValue;
  8312. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8313. VAR
  8314. componentType: SyntaxTree.Type;
  8315. BEGIN
  8316. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8317. ASSERT(x.type IS SyntaxTree.ComplexType);
  8318. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8319. InitOperand(result,ModeValue);
  8320. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8321. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8322. END VisitComplexValue;
  8323. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8324. VAR i: LONGINT; name: Basic.SegmentedName;
  8325. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8326. BEGIN
  8327. IF Trace THEN TraceEnter("VisitStringValue") END;
  8328. IF ~TryConstantDeclaration() THEN
  8329. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8330. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8331. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8332. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8333. ELSE
  8334. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8335. END;
  8336. FOR i := 0 TO x.length-1 DO
  8337. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8338. irv.Emit(Data(position,op));
  8339. END;
  8340. InitOperand(result,ModeReference);
  8341. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8342. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8343. END
  8344. END VisitStringValue;
  8345. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8346. BEGIN
  8347. IF Trace THEN TraceEnter("VisitNilValue") END;
  8348. InitOperand(result,ModeValue);
  8349. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8350. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8351. END VisitNilValue;
  8352. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8353. BEGIN
  8354. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8355. InitOperand(result,ModeValue);
  8356. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8357. END VisitEnumerationValue;
  8358. (** symbols *)
  8359. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8360. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8361. END VisitImport;
  8362. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8363. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8364. BEGIN
  8365. IF scope # baseScope THEN
  8366. (* left := [fp+8] *)
  8367. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8368. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8369. ReuseCopy(left,right);
  8370. ReleaseIntermediateOperand(right);
  8371. scope := scope.outerScope; DEC(level);
  8372. (* { left := [left+8] } *)
  8373. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8374. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8375. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8376. Emit(Mov(position,left,right));
  8377. scope := scope.outerScope; DEC(level);
  8378. END;
  8379. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8380. result := left;
  8381. ELSE
  8382. result := fp;
  8383. END;
  8384. END GetBaseRegister;
  8385. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8386. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8387. BEGIN
  8388. IF Trace THEN TraceEnter("VisitVariable"); END;
  8389. type := x.type.resolved;
  8390. IF (x.useRegister) THEN
  8391. InitOperand(result, ModeValue);
  8392. IF x.registerNumber < 0 THEN
  8393. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8394. reg := x.registerNumber;
  8395. ELSE
  8396. reg := registerUsageCount.Map(x.registerNumber);
  8397. UseRegister(reg);
  8398. END;
  8399. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8400. ELSIF x.externalName # NIL THEN
  8401. InitOperand(result,ModeReference);
  8402. Basic.ToSegmentedName(x.externalName^, name);
  8403. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8404. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8405. InitOperand(result,ModeReference);
  8406. GetBaseRegister(result.op,currentScope,x.scope);
  8407. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8408. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8409. InitOperand(result,ModeReference);
  8410. GetCodeSectionNameForSymbol(x,name);
  8411. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8412. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8413. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8414. InitOperand(result,ModeReference);
  8415. GetCodeSectionNameForSymbol(x,name);
  8416. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8417. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8418. ELSE (* field, left designator must have been emitted *)
  8419. ASSERT(result.mode = ModeReference);
  8420. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8421. ReuseCopy(temp,result.op);
  8422. ReleaseIntermediateOperand(result.op);
  8423. result.op := temp;
  8424. END;
  8425. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8426. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8427. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8428. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8429. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8430. END;
  8431. END;
  8432. END;
  8433. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8434. ValueToCondition(result);
  8435. ELSIF type IS SyntaxTree.ProcedureType THEN
  8436. ReleaseIntermediateOperand(result.tag);
  8437. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8438. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8439. UseIntermediateOperand(result.tag);
  8440. ELSE
  8441. result.tag := nil; (* nil *)
  8442. END;
  8443. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8444. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8445. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8446. ReleaseIntermediateOperand(result.tag);
  8447. Global.GetSymbolSegmentedName(x,name);
  8448. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8449. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8450. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8451. ELSE
  8452. END;
  8453. ELSE
  8454. ReleaseIntermediateOperand(result.tag);
  8455. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8456. END;
  8457. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8458. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8459. ReleaseIntermediateOperand(result.tag);
  8460. result.tag := result.op;
  8461. UseIntermediateOperand(result.tag);
  8462. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8463. IntermediateCode.MakeMemory(result.op,addressType);
  8464. END;
  8465. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8466. ReleaseIntermediateOperand(result.tag);
  8467. result.tag := TypeDescriptorAdr(type);
  8468. IF ~newObjectFile THEN
  8469. IntermediateCode.MakeMemory(result.tag,addressType);
  8470. END;
  8471. UseIntermediateOperand(result.tag);
  8472. (* tag for pointer type computed not here but during dereferencing *)
  8473. END;
  8474. IF Trace THEN TraceExit("VisitVariable") END;
  8475. END VisitVariable;
  8476. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8477. BEGIN
  8478. VisitVariable(property);
  8479. END VisitProperty;
  8480. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8481. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8482. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8483. BEGIN
  8484. type := x.type.resolved;
  8485. IF Trace THEN TraceEnter("VisitParameter") END;
  8486. IF x.ownerType IS SyntaxTree.CellType THEN
  8487. ptype := x.type.resolved;
  8488. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8489. IF ~(ptype IS SyntaxTree.PortType) THEN
  8490. InitOperand(result,ModeReference);
  8491. GetCodeSectionNameForSymbol(x,name);
  8492. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8493. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8494. RETURN
  8495. ELSE
  8496. InitOperand(result, ModeValue);
  8497. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8498. adr := 0;
  8499. WHILE parameter # x DO
  8500. parameterType := parameter.type;
  8501. inc := 1;
  8502. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8503. INC(adr, inc);
  8504. parameter := parameter.nextParameter
  8505. END;
  8506. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8507. RETURN
  8508. END;
  8509. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8510. InitOperand(result,ModeReference);
  8511. GetCodeSectionNameForSymbol(x,name);
  8512. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8513. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8514. RETURN
  8515. ELSE
  8516. GetBaseRegister(basereg,currentScope,x.scope);
  8517. InitOperand(result,ModeReference);
  8518. result.op := basereg;
  8519. END;
  8520. IF IsOpenArray(type) THEN
  8521. result.tag := basereg;
  8522. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8523. IntermediateCode.MakeMemory(result.op,addressType);
  8524. IF Global.IsOberonProcedure(x.ownerType) THEN
  8525. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8526. UseIntermediateOperand(result.tag);
  8527. ELSE
  8528. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8529. END;
  8530. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8531. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8532. ELSIF IsStaticArray(type) THEN
  8533. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8534. IntermediateCode.MakeMemory(result.op,addressType);
  8535. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8536. ELSIF type IS SyntaxTree.MathArrayType THEN
  8537. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8538. WITH type: SyntaxTree.MathArrayType DO
  8539. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8540. IF type.form = SyntaxTree.Tensor THEN
  8541. ELSIF type.form = SyntaxTree.Open THEN
  8542. result.tag := result.op;
  8543. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8544. IntermediateCode.MakeMemory(result.op,addressType);
  8545. UseIntermediateOperand(result.tag);
  8546. ELSIF type.form = SyntaxTree.Static THEN
  8547. IF x.kind = SyntaxTree.ConstParameter THEN
  8548. IntermediateCode.MakeMemory(result.op,addressType);
  8549. END;
  8550. ELSE HALT(100)
  8551. END;
  8552. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8553. IF type.form = SyntaxTree.Tensor THEN
  8554. ToMemory(result.op,addressType,0);
  8555. ELSIF type.form = SyntaxTree.Open THEN
  8556. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8557. ReuseCopy(result.tag, mem);
  8558. ReleaseIntermediateOperand(mem);
  8559. ReleaseIntermediateOperand(result.op);
  8560. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8561. ELSIF type.form = SyntaxTree.Static THEN
  8562. IntermediateCode.MakeMemory(result.op,addressType);
  8563. ELSE HALT(100)
  8564. END;
  8565. ELSE HALT(100)
  8566. END;
  8567. END;
  8568. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8569. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8570. IntermediateCode.MakeMemory(result.op,addressType);
  8571. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8572. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8573. END;
  8574. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8575. ValueToCondition(result);
  8576. ELSIF type IS SyntaxTree.ProcedureType THEN
  8577. ReleaseIntermediateOperand(result.tag);
  8578. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8579. IF x.kind = SyntaxTree.VarParameter THEN
  8580. ReuseCopy(result.tag,result.op);
  8581. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8582. IntermediateCode.MakeMemory(result.tag,addressType);
  8583. ELSE
  8584. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8585. UseIntermediateOperand(result.tag);
  8586. END;
  8587. ELSE
  8588. result.tag := nil;
  8589. END;
  8590. (* tag for pointer type computed not here but during dereferencing *)
  8591. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8592. ReleaseIntermediateOperand(result.tag);
  8593. result.tag := basereg;
  8594. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8595. IntermediateCode.MakeMemory(result.tag,addressType);
  8596. UseIntermediateOperand(result.tag);
  8597. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8598. ReleaseIntermediateOperand(result.tag);
  8599. result.tag := TypeDescriptorAdr(type);
  8600. IF ~newObjectFile THEN
  8601. IntermediateCode.MakeMemory(result.tag,addressType);
  8602. END;
  8603. UseIntermediateOperand(result.tag);
  8604. END;
  8605. IF Trace THEN TraceExit("VisitParameter") END;
  8606. END VisitParameter;
  8607. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8608. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8609. BEGIN
  8610. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8611. (* left.p: left already emitted *)
  8612. tag := result.op; (* value of pointer to left *)
  8613. (* get type desc *)
  8614. tmp := result.tag;
  8615. IntermediateCode.MakeMemory(tmp,addressType);
  8616. (* get method adr *)
  8617. Reuse1(reg,tmp);
  8618. ReleaseIntermediateOperand(tmp);
  8619. IF backend.cooperative THEN
  8620. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8621. WHILE recordType.baseType # NIL DO
  8622. recordType := recordType.GetBaseRecord ();
  8623. END;
  8624. GetRecordTypeName (recordType,name);
  8625. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8626. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8627. offset := 0;
  8628. ELSE
  8629. offset := 2;
  8630. END;
  8631. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8632. ELSE
  8633. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8634. END;
  8635. InitOperand(operand,ModeReference);
  8636. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8637. operand.op := reg;
  8638. operand.tag := tag;
  8639. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8640. END DynamicCallOperand;
  8641. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8642. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8643. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8644. BEGIN
  8645. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8646. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8647. tag := operand.op;
  8648. ReleaseIntermediateOperand(operand.tag);
  8649. ELSE tag := nil
  8650. END;
  8651. IF x.isInline THEN
  8652. sectionType := Sections.InlineCodeSection;
  8653. ELSE
  8654. sectionType := Sections.CodeSection;
  8655. END;
  8656. IF x.externalName # NIL THEN
  8657. Basic.ToSegmentedName(x.externalName^, name);
  8658. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8659. ELSE
  8660. GetCodeSectionNameForSymbol(x, name);
  8661. IF (x.scope.ownerModule = module.module) THEN
  8662. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8663. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8664. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8665. IF source.pc = 0 THEN (* no code yet *)
  8666. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8667. END;
  8668. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8669. bits := x.procedureScope.body.code.inlineCode;
  8670. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8671. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8672. binary.CopyBits(bits, 0, bits.GetSize());
  8673. source.SetResolved(binary);
  8674. ELSE
  8675. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8676. END;
  8677. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8678. END;
  8679. InitOperand(operand,ModeValue);
  8680. operand.op := reg;
  8681. operand.tag := tag;
  8682. IF Trace THEN TraceExit("StaticCallOperand") END;
  8683. END StaticCallOperand;
  8684. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8685. (* handle expressions of the form designator.procedure or procedure *)
  8686. BEGIN
  8687. IF Trace THEN TraceEnter("VisitProcedure") END;
  8688. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8689. DynamicCallOperand(result,x);
  8690. ELSIF x.isInline THEN
  8691. StaticCallOperand(result,x);
  8692. ELSE
  8693. StaticCallOperand(result,x);
  8694. END;
  8695. IF Trace THEN TraceExit("VisitProcedure") END;
  8696. END VisitProcedure;
  8697. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8698. BEGIN
  8699. VisitProcedure(x);
  8700. END VisitOperator;
  8701. (** statements *)
  8702. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8703. BEGIN
  8704. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8705. Expression(x.call);
  8706. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8707. ReleaseOperand(result)
  8708. END;
  8709. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8710. END VisitProcedureCallStatement;
  8711. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8712. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8713. leftBase, rightBase: SyntaxTree.Type;
  8714. procedureName,s: SyntaxTree.IdentifierString;
  8715. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8716. size: LONGINT; rightKind: LONGINT;
  8717. dummy: IntermediateCode.Operand;
  8718. CONST moduleName = "FoxArrayBase";
  8719. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8720. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8721. BEGIN
  8722. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8723. IF base IS SyntaxTree.MathArrayType THEN
  8724. base := OpenArray(base(SyntaxTree.MathArrayType));
  8725. END;
  8726. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8727. result.SetArrayBase(base);
  8728. RETURN result
  8729. END OpenArray;
  8730. BEGIN
  8731. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8732. SaveRegisters();ReleaseUsedRegisters(saved);
  8733. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8734. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8735. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8736. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8737. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8738. IF leftType.form = SyntaxTree.Tensor THEN
  8739. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8740. ELSIF leftType.form = SyntaxTree.Open THEN
  8741. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8742. ELSIF leftType.form = SyntaxTree.Static THEN
  8743. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8744. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8745. END;
  8746. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8747. IF procedure = NIL THEN
  8748. s := "Instruction not supported on target, emulation procedure ";
  8749. Strings.Append(s,moduleName);
  8750. Strings.Append(s,".");
  8751. Strings.Append(s,procedureName);
  8752. Strings.Append(s," not present");
  8753. Error(position,s);
  8754. ELSE
  8755. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8756. parameter.SetType(leftType);
  8757. parameter.SetAccess(SyntaxTree.Internal);
  8758. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8759. parameter.SetKind(rightKind);
  8760. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8761. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8762. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8763. StaticCallOperand(result,procedure);
  8764. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8765. ReleaseOperand(result);
  8766. END;
  8767. RestoreRegisters(saved);
  8768. END;
  8769. END AssignMathArray;
  8770. VAR modifyAssignmentCounter := 0: LONGINT;
  8771. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8772. VAR processor,mem,dst: IntermediateCode.Operand;
  8773. BEGIN
  8774. IF value.intValue = true.intValue THEN
  8775. INC(modifyAssignmentCounter);
  8776. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8777. modifyAssignmentsPC := section.pc;
  8778. ELSE
  8779. DEC(modifyAssignmentCounter);
  8780. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8781. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8782. END;
  8783. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8784. dst := NewRegisterOperand (addressType);
  8785. Emit(Mov(position,dst, processor));
  8786. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8787. Emit(Mov(position,mem, value));
  8788. ReleaseIntermediateOperand(dst);
  8789. END ModifyAssignments;
  8790. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8791. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8792. BEGIN
  8793. type := left.type.resolved;
  8794. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8795. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8796. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8797. IF procedureType.returnParameter = parameter THEN
  8798. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8799. END;
  8800. END;
  8801. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8802. END CopySize;
  8803. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8804. VAR
  8805. leftO, rightO: Operand;
  8806. mem, sizeOp: IntermediateCode.Operand;
  8807. leftType, rightType, componentType: SyntaxTree.Type;
  8808. size: LONGINT;
  8809. parameters: SyntaxTree.ExpressionList;
  8810. procedure: SyntaxTree.Procedure;
  8811. call: SyntaxTree.ProcedureCallDesignator;
  8812. designator: SyntaxTree.Designator;
  8813. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8814. VAR procedureType: SyntaxTree.ProcedureType;
  8815. BEGIN
  8816. IF ReturnedAsParameter(right.type) THEN
  8817. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8818. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8819. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8820. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8821. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8822. IF right.id = Global.Reshape THEN RETURN TRUE
  8823. END;
  8824. END;
  8825. END;
  8826. END;
  8827. RETURN FALSE
  8828. END CanPassAsResultParameter;
  8829. BEGIN
  8830. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8831. leftType := left.type.resolved; rightType:= right.type.resolved;
  8832. IF backend.cooperative & left.NeedsTrace() THEN
  8833. ModifyAssignments(true);
  8834. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8835. Designate(right, rightO);
  8836. Designate(left, leftO);
  8837. ASSERT(leftO.mode = ModeReference);
  8838. TransferToRegister(leftO.op, leftO.op);
  8839. TransferToRegister(rightO.op, rightO.op);
  8840. Emit(Push(position, leftO.op));
  8841. Emit(Push(position, rightO.op));
  8842. CallAssignMethod(leftO.op, rightO.op, left.type);
  8843. Emit(Pop(position, rightO.op));
  8844. Emit(Pop(position, leftO.op));
  8845. sizeOp := CopySize(left);
  8846. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8847. ReleaseOperand(leftO);
  8848. ReleaseOperand(rightO);
  8849. ELSE
  8850. Evaluate(right,rightO);
  8851. Designate(left,leftO);
  8852. ASSERT(leftO.mode = ModeReference);
  8853. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8854. (* copy procedure address first *)
  8855. MakeMemory(mem,leftO.op,addressType,0);
  8856. Emit(Mov(position,mem,rightO.op));
  8857. ReleaseIntermediateOperand(mem);
  8858. (* copy pointer address *)
  8859. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8860. CallAssignPointer(leftO.tag, rightO.tag);
  8861. ELSE
  8862. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8863. CallAssignPointer(leftO.op, rightO.op);
  8864. END;
  8865. ReleaseOperand(leftO);
  8866. ReleaseOperand(rightO);
  8867. END;
  8868. ModifyAssignments(false);
  8869. RETURN;
  8870. END;
  8871. IF CanPassAsResultParameter(right) THEN
  8872. procedureResultDesignator := left(SyntaxTree.Designator);
  8873. Expression(right);
  8874. procedureResultDesignator := NIL;
  8875. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8876. (* left <-- ALIAS OF right: zerocopy *)
  8877. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8878. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8879. designator.SetType(procedure.type);
  8880. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8881. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8882. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8883. END;
  8884. ELSIF leftType IS SyntaxTree.RangeType THEN
  8885. (* LHS is of array range type *)
  8886. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8887. Evaluate(right, rightO);
  8888. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8889. (* first *)
  8890. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8891. Emit(Mov(position,mem, rightO.op));
  8892. ReleaseIntermediateOperand(mem);
  8893. (* last *)
  8894. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8895. Emit(Mov(position,mem, rightO.tag));
  8896. ReleaseIntermediateOperand(mem);
  8897. (* step *)
  8898. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8899. Emit(Mov(position,mem, rightO.extra));
  8900. ReleaseIntermediateOperand(mem);
  8901. ReleaseOperand(rightO);
  8902. ReleaseOperand(leftO)
  8903. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8904. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8905. Evaluate(right, rightO);
  8906. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8907. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8908. (* real part *)
  8909. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8910. Emit(Mov(position,mem, rightO.op));
  8911. ReleaseIntermediateOperand(mem);
  8912. (* imaginary part *)
  8913. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8914. Emit(Mov(position,mem, rightO.tag));
  8915. ReleaseIntermediateOperand(mem);
  8916. ReleaseOperand(rightO);
  8917. ReleaseOperand(leftO)
  8918. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8919. OR (leftType IS SyntaxTree.PortType) THEN
  8920. (* rightO := leftO;*)
  8921. Evaluate(right,rightO);
  8922. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8923. Designate(left,leftO);
  8924. IF leftO.mode = ModeReference THEN
  8925. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8926. destination := mem;
  8927. ELSE
  8928. destination := leftO.op;
  8929. END;
  8930. ReleaseOperand(leftO);
  8931. IF destination.mode # IntermediateCode.Undefined THEN
  8932. Emit(Mov(position,destination,rightO.op));
  8933. END;
  8934. ReleaseOperand(rightO);
  8935. ReleaseIntermediateOperand(mem);
  8936. IntermediateCode.InitOperand(destination);
  8937. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8938. Evaluate(right,rightO);
  8939. Designate(left,leftO);
  8940. MakeMemory(mem,leftO.op,addressType,0);
  8941. Emit(Mov(position,mem,rightO.op));
  8942. ReleaseIntermediateOperand(mem);
  8943. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8944. (* delegate *)
  8945. (*
  8946. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8947. *)
  8948. Emit(Mov(position,leftO.tag,rightO.tag));
  8949. END;
  8950. ReleaseOperand(leftO);
  8951. ReleaseOperand(rightO);
  8952. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8953. Designate(right,rightO);
  8954. Designate(left,leftO);
  8955. sizeOp := CopySize(left);
  8956. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8957. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8958. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8959. IF (rightType IS SyntaxTree.StringType) THEN
  8960. CopyString(left,right);
  8961. 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
  8962. Designate(right,rightO);
  8963. Designate(left,leftO);
  8964. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8965. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8966. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8967. ELSE
  8968. HALT(201)
  8969. END;
  8970. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8971. AssignMathArray(left,right);
  8972. ELSE
  8973. HALT(200);
  8974. END;
  8975. END Assign;
  8976. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8977. BEGIN
  8978. IF Trace THEN TraceEnter("VisitAssignment") END;
  8979. Assign(x.left,x.right);
  8980. IF Trace THEN TraceExit("VisitAssignment") END;
  8981. END VisitAssignment;
  8982. PROCEDURE EmitCooperativeSwitch;
  8983. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8984. BEGIN
  8985. ASSERT (cooperativeSwitches);
  8986. pc := section.pc;
  8987. IF lastSwitchPC = section.pc THEN RETURN END;
  8988. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8989. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8990. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8991. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  8992. INC(statCoopSwitch, section.pc - pc);
  8993. END EmitCooperativeSwitch;
  8994. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8995. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  8996. BEGIN
  8997. p0 := communication.left; p1 := communication.right;
  8998. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  8999. Evaluate(p0,s0);
  9000. Evaluate(p1,s1);
  9001. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9002. Emit(Push(position,s0.op));
  9003. Emit(Push(position,s1.op));
  9004. (*
  9005. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9006. *)
  9007. IF ~backend.cellsAreObjects THEN
  9008. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9009. END;
  9010. ReleaseOperand(s0);
  9011. ReleaseOperand(s1);
  9012. IF backend.cellsAreObjects THEN
  9013. CallThis(position,"ActiveCellsRuntime","Send",2);
  9014. ELSE
  9015. CallThis(position,ChannelModuleName,"Send",2);
  9016. END;
  9017. (* ----- RECEIVE ------*)
  9018. ELSE
  9019. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9020. tmp := p0; p0 := p1; p1 := tmp;
  9021. END;
  9022. Evaluate(p0,s0);
  9023. Emit(Push(position,s0.op));
  9024. Designate(p1,s1);
  9025. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9026. Emit(Push(position,s1.op));
  9027. (*
  9028. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9029. *)
  9030. IF ~backend.cellsAreObjects THEN
  9031. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9032. END;
  9033. ReleaseOperand(s0);
  9034. ReleaseOperand(s1);
  9035. IF backend.cellsAreObjects THEN
  9036. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9037. ELSE
  9038. CallThis(position,ChannelModuleName,"Receive",2)
  9039. END;
  9040. END;
  9041. END VisitCommunicationStatement;
  9042. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9043. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9044. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9045. VAR true, false: Label; condition, value: BOOLEAN;
  9046. BEGIN
  9047. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9048. IF condition THEN
  9049. true := NewLabel();
  9050. false := NewLabel();
  9051. Condition(if.condition,true,false);
  9052. SetLabel(true);
  9053. StatementSequence(if.statements);
  9054. BrL(end);
  9055. SetLabel(false);
  9056. ELSE
  9057. IF value THEN (* always true *)
  9058. escape := TRUE;
  9059. StatementSequence(if.statements);
  9060. (* no branch necessary -- rest skipped *)
  9061. END;
  9062. END;
  9063. END IfPart;
  9064. BEGIN
  9065. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9066. end := NewLabel();
  9067. elsifs := x.ElsifParts();
  9068. IfPart(x.ifPart);
  9069. FOR i := 0 TO elsifs-1 DO
  9070. IF ~escape THEN
  9071. elsif := x.GetElsifPart(i);
  9072. IfPart(elsif);
  9073. END;
  9074. END;
  9075. IF (x.elsePart # NIL) & ~escape THEN
  9076. StatementSequence(x.elsePart);
  9077. END;
  9078. SetLabel(end);
  9079. IF Trace THEN TraceExit("VisitIfStatement") END;
  9080. END VisitIfStatement;
  9081. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9082. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9083. BEGIN
  9084. (*IF x.variable.type.resolved = x.type.resolved THEN
  9085. (* always true, do nothing *)
  9086. ELSE*)
  9087. Designate(x.variable,res);
  9088. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9089. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9090. END;
  9091. trueL := NewLabel();
  9092. TypeTest(res.tag,x.type,trueL,falseL);
  9093. ReleaseOperand(res);
  9094. SetLabel(trueL);
  9095. StatementSequence(x.statements);
  9096. BrL(endL);
  9097. END WithPart;
  9098. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9099. VAR endL,falseL: Label;i: LONGINT;
  9100. BEGIN
  9101. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9102. endL := NewLabel();
  9103. FOR i := 0 TO x.WithParts()-1 DO
  9104. falseL := NewLabel();
  9105. WithPart(x.GetWithPart(i),falseL,endL);
  9106. SetLabel(falseL);
  9107. END;
  9108. IF x.elsePart = NIL THEN
  9109. IF ~isUnchecked THEN
  9110. EmitTrap(position,WithTrap);
  9111. END;
  9112. ELSE
  9113. StatementSequence(x.elsePart)
  9114. END;
  9115. SetLabel(endL);
  9116. IF Trace THEN TraceExit("VisitWithStatement") END;
  9117. END VisitWithStatement;
  9118. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9119. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9120. out,else: Label; label: Label;
  9121. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9122. symbol: SyntaxTree.Symbol;
  9123. BEGIN
  9124. (*! split case statement into if-elsif statements for large case label lists *)
  9125. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9126. size := x.max-x.min+1;
  9127. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9128. END;
  9129. Evaluate(x.variable,var);
  9130. ReuseCopy(tmp,var.op);
  9131. ReleaseIntermediateOperand(var.op);
  9132. var.op := tmp;
  9133. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9134. Convert(var.op,addressType);
  9135. size := x.max-x.min+1;
  9136. else := NewLabel();
  9137. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9138. (*
  9139. UniqueId(name,module.module,"case",caseId);
  9140. *)
  9141. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9142. Global.GetModuleSegmentedName(module.module, name);
  9143. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9144. symbol := SyntaxTree.NewSymbol(name[1]);
  9145. symbol.SetScope(moduleScope);
  9146. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9147. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9148. section.isCaseTable := TRUE;
  9149. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9150. ReuseCopy(res,var.op);
  9151. ReleaseOperand(var);
  9152. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9153. Emit(Add(position,res,res,jmp));
  9154. IntermediateCode.MakeMemory(res,addressType);
  9155. Emit(Br(position,res));
  9156. ReleaseIntermediateOperand(res);
  9157. out := NewLabel();
  9158. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9159. part := x.GetCasePart(i);
  9160. constant := part.firstConstant;
  9161. label := NewLabel();
  9162. SetLabel(label);
  9163. WHILE(constant # NIL) DO (* case labels for this case part *)
  9164. FOR j := constant.min TO constant.max DO
  9165. fixups[j-x.min] := label;
  9166. END;
  9167. constant := constant.next;
  9168. END;
  9169. StatementSequence(part.statements);
  9170. BrL(out);
  9171. END;
  9172. SetLabel(else);
  9173. FOR i := 0 TO size-1 DO
  9174. IF fixups[i] = NIL THEN
  9175. fixups[i] := else;
  9176. END;
  9177. END;
  9178. IF x.elsePart # NIL THEN
  9179. StatementSequence(x.elsePart);
  9180. ELSIF ~isUnchecked THEN
  9181. EmitTrap(position,CaseTrap);
  9182. END;
  9183. SetLabel(out);
  9184. FOR i := 0 TO size-1 DO
  9185. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9186. section.Emit(Data(position,op));
  9187. END;
  9188. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9189. END VisitCaseStatement;
  9190. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9191. VAR start: Label; true,false: Label;
  9192. BEGIN
  9193. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9194. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9195. start := NewLabel();
  9196. true := NewLabel();
  9197. false := NewLabel();
  9198. SetLabel(start);
  9199. Condition(x.condition,true,false);
  9200. SetLabel(true);
  9201. StatementSequence(x.statements);
  9202. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9203. BrL(start);
  9204. SetLabel(false);
  9205. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9206. END VisitWhileStatement;
  9207. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9208. VAR false,true: Label;
  9209. BEGIN
  9210. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9211. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9212. true := NewLabel();
  9213. false := NewLabel();
  9214. SetLabel(false);
  9215. StatementSequence(x.statements);
  9216. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9217. Condition(x.condition,true,false);
  9218. SetLabel(true);
  9219. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9220. END VisitRepeatStatement;
  9221. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9222. VAR
  9223. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9224. temporaryVariable: SyntaxTree.Variable;
  9225. temporaryVariableDesignator : SyntaxTree.Designator;
  9226. BEGIN
  9227. IF Trace THEN TraceEnter("VisitForStatement") END;
  9228. true := NewLabel();
  9229. false := NewLabel();
  9230. start := NewLabel();
  9231. Assign(x.variable,x.from);
  9232. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9233. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9234. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9235. Assign(temporaryVariableDesignator,x.to);
  9236. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9237. IF by > 0 THEN
  9238. cmp := Scanner.LessEqual
  9239. ELSE
  9240. cmp := Scanner.GreaterEqual
  9241. END;
  9242. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9243. binary.SetType(system.booleanType);
  9244. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9245. SetLabel(start);
  9246. Condition(binary,true,false);
  9247. SetLabel(true);
  9248. StatementSequence(x.statements);
  9249. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9250. binary.SetType(x.variable.type);
  9251. Assign(x.variable,binary);
  9252. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9253. BrL(start);
  9254. SetLabel(false);
  9255. IF Trace THEN TraceExit("VisitForStatement") END;
  9256. END VisitForStatement;
  9257. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9258. VAR prevLoop: Label;
  9259. BEGIN
  9260. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9261. prevLoop := currentLoop;
  9262. currentLoop := NewLabel();
  9263. StatementSequence(x.statements);
  9264. SetLabel(currentLoop);
  9265. currentLoop := prevLoop;
  9266. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9267. END VisitExitableBlock;
  9268. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9269. VAR prevLoop,start: Label;
  9270. BEGIN
  9271. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9272. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9273. start := NewLabel();
  9274. prevLoop := currentLoop;
  9275. SetLabel(start);
  9276. currentLoop := NewLabel();
  9277. StatementSequence(x.statements);
  9278. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9279. BrL(start);
  9280. SetLabel(currentLoop);
  9281. currentLoop := prevLoop;
  9282. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9283. END VisitLoopStatement;
  9284. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9285. VAR outer: SyntaxTree.Statement;
  9286. BEGIN
  9287. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9288. IF locked THEN (* r if we jump out of an exclusive block *)
  9289. outer := x.outer;
  9290. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9291. outer := outer.outer;
  9292. END;
  9293. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9294. Lock(FALSE);
  9295. END;
  9296. END;
  9297. BrL(currentLoop);
  9298. IF Trace THEN TraceExit("VisitExitStatement") END;
  9299. END VisitExitStatement;
  9300. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9301. VAR
  9302. expression, parameterDesignator: SyntaxTree.Expression;
  9303. type, componentType: SyntaxTree.Type;
  9304. res, right: Operand;
  9305. left, mem, reg: IntermediateCode.Operand;
  9306. parameter: SyntaxTree.Parameter;
  9307. procedure: SyntaxTree.Procedure;
  9308. procedureType: SyntaxTree.ProcedureType;
  9309. returnTypeOffset: LONGINT;
  9310. delegate: BOOLEAN;
  9311. map: SymbolMap;
  9312. BEGIN
  9313. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9314. expression := x.returnValue;
  9315. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9316. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9317. IF currentIsInline THEN
  9318. IF expression # NIL THEN
  9319. map := currentMapper.Get(NIL);
  9320. IF map # NIL THEN
  9321. Assign(map.to, expression);
  9322. END;
  9323. END;
  9324. BrL(currentInlineExit);
  9325. RETURN;
  9326. END;
  9327. IF expression # NIL THEN
  9328. type := expression.type.resolved;
  9329. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9330. IF locked THEN Lock(FALSE) END;
  9331. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9332. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9333. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9334. (* return without structured return parameter *)
  9335. Evaluate(expression,res);
  9336. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9337. IF locked OR profile THEN
  9338. Emit(Push(position,res.op));
  9339. IF delegate THEN HALT(200) END;
  9340. ReleaseOperand(res);
  9341. IF locked THEN Lock(FALSE) END;
  9342. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9343. reg := NewRegisterOperand(res.op.type);
  9344. Emit(Pop(position,reg));
  9345. Emit(Return(position,reg));
  9346. ReleaseIntermediateOperand(reg);
  9347. ELSE
  9348. Emit(Return(position,res.op));
  9349. ReleaseOperand(res);
  9350. END;
  9351. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9352. THEN
  9353. (* return using structured return parameter *)
  9354. 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)
  9355. OR SemanticChecker.IsPointerType(type));
  9356. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9357. parameter :=procedureType.returnParameter;
  9358. ASSERT(parameter # NIL);
  9359. returnTypeOffset := parameter.offsetInBits;
  9360. (*
  9361. IF parameter# NIL THEN
  9362. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9363. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9364. ELSE
  9365. returnTypeOffset := system.offsetFirstParameter
  9366. END;
  9367. *)
  9368. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9369. IF type IS SyntaxTree.RangeType THEN
  9370. (* array range type *)
  9371. Evaluate(expression, right);
  9372. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9373. Emit(Mov(position,mem, right.op)); (* first *)
  9374. ReleaseIntermediateOperand(mem);
  9375. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9376. Emit(Mov(position,mem, right.tag)); (* last *)
  9377. ReleaseIntermediateOperand(mem);
  9378. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9379. Emit(Mov(position,mem, right.extra)); (* step *)
  9380. ReleaseIntermediateOperand(mem);
  9381. ReleaseOperand(right);
  9382. ELSIF type IS SyntaxTree.ComplexType THEN
  9383. Evaluate(expression, right);
  9384. componentType := type(SyntaxTree.ComplexType).componentType;
  9385. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9386. Emit(Mov(position,mem, right.op)); (* real part *)
  9387. ReleaseIntermediateOperand(mem);
  9388. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9389. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9390. ReleaseIntermediateOperand(mem);
  9391. ReleaseOperand(right);
  9392. ELSE (* covers cases: pointer / record / array *)
  9393. parameter := procedureType.returnParameter;
  9394. checker.SetCurrentScope(currentScope);
  9395. ASSERT(parameter # NIL);
  9396. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9397. Assign(parameterDesignator,expression);
  9398. END;
  9399. ReleaseIntermediateOperand(left);
  9400. IF locked THEN Lock(FALSE) END;
  9401. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9402. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9403. parameter := procedureType.returnParameter;
  9404. checker.SetCurrentScope(currentScope);
  9405. IF parameter = NIL THEN
  9406. Error(procedure.position, "structured return of parameter of procedure not found");
  9407. ELSE
  9408. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9409. Assign(parameterDesignator,expression);
  9410. END;
  9411. IF locked THEN Lock(FALSE) END;
  9412. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9413. ELSE
  9414. HALT(200);
  9415. END;
  9416. ELSE
  9417. IF locked THEN Lock(FALSE) END;
  9418. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9419. END;
  9420. IF backend.cooperative THEN
  9421. BrL(exitLabel);
  9422. ELSE
  9423. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9424. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9425. END;
  9426. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9427. END VisitReturnStatement;
  9428. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9429. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9430. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9431. statements: SyntaxTree.StatementSequence;
  9432. name, suffix: SyntaxTree.IdentifierString;
  9433. BEGIN
  9434. Strings.IntToStr(awaitProcCounter,suffix);
  9435. Strings.Concat("@AwaitProcedure",suffix,name);
  9436. identifier := SyntaxTree.NewIdentifier(name);
  9437. INC(awaitProcCounter);
  9438. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9439. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9440. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9441. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9442. procedure.SetAccess(SyntaxTree.Hidden);
  9443. procedure.SetScope(currentScope);
  9444. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9445. procedureType.SetReturnType(system.booleanType);
  9446. procedure.SetType(procedureType);
  9447. body := SyntaxTree.NewBody(x.position,procedureScope);
  9448. procedureScope.SetBody(body);
  9449. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9450. returnStatement.SetReturnValue(x.condition);
  9451. statements := SyntaxTree.NewStatementSequence();
  9452. statements.AddStatement(returnStatement);
  9453. body.SetStatementSequence(statements);
  9454. currentScope.AddProcedure(procedure);
  9455. RETURN procedure
  9456. END MakeAwaitProcedure;
  9457. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9458. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9459. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9460. BEGIN
  9461. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9462. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9463. IF backend.cooperative THEN
  9464. start := NewLabel();
  9465. true := NewLabel();
  9466. false := NewLabel();
  9467. SetLabel(start);
  9468. Condition(x.condition,true,false);
  9469. SetLabel(false);
  9470. PushSelfPointer();
  9471. CallThis(position,"ExclusiveBlocks","Await",1);
  9472. BrL(start);
  9473. SetLabel(true);
  9474. PushSelfPointer();
  9475. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9476. ELSE
  9477. proc := MakeAwaitProcedure(x);
  9478. Emit(Push(position,fp));
  9479. GetCodeSectionNameForSymbol(proc,name);
  9480. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9481. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9482. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9483. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9484. Emit(Result(position,res));
  9485. (*
  9486. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9487. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9488. *)
  9489. InitOperand(result,ModeValue);
  9490. result.op := res;
  9491. label := NewLabel();
  9492. BreqL(label, result.op, SELF.true);
  9493. ReleaseOperand(result);
  9494. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9495. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9496. Emit(Push(position,res));
  9497. Emit(Push(position,fp));
  9498. PushSelfPointer();
  9499. Emit(Push(position,nil));
  9500. CallThis(position,"Objects","Await",4);
  9501. SetLabel(label);
  9502. END;
  9503. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9504. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9505. END VisitAwaitStatement;
  9506. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9507. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9508. BEGIN
  9509. FOR i := 0 TO x.Length() - 1 DO
  9510. statement := x.GetStatement( i );
  9511. Statement(statement);
  9512. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9513. END;
  9514. END StatementSequence;
  9515. PROCEDURE PushSelfPointer;
  9516. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9517. BEGIN
  9518. scope := currentScope;
  9519. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9520. scope := scope.outerScope;
  9521. END;
  9522. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9523. IF ~newObjectFile THEN
  9524. Symbol(moduleSelf,op);
  9525. IntermediateCode.MakeMemory(op.op,addressType);
  9526. ELSE
  9527. moduleSection := meta.ModuleSection();
  9528. IF backend.cooperative THEN
  9529. moduleOffset := 0;
  9530. ELSE
  9531. moduleOffset := moduleSection.pc;
  9532. END;
  9533. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9534. END;
  9535. ELSE
  9536. GetBaseRegister(op.op,currentScope,scope);
  9537. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9538. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9539. IF backend.cooperative THEN
  9540. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9541. END;
  9542. IntermediateCode.MakeMemory(op.op,addressType);
  9543. END;
  9544. Emit(Push(position,op.op));
  9545. ReleaseOperand(op);
  9546. END PushSelfPointer;
  9547. PROCEDURE Lock(lock: BOOLEAN);
  9548. BEGIN
  9549. IF Trace THEN TraceEnter("Lock") END;
  9550. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9551. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9552. ASSERT(modifyAssignmentCounter = 0);
  9553. IF dump # NIL THEN
  9554. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9555. dump.Ln;dump.Update;
  9556. END;
  9557. PushSelfPointer;
  9558. IF backend.cooperative THEN
  9559. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9560. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9561. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9562. END;
  9563. ELSE
  9564. Emit(Push(position,true));
  9565. IF lock THEN CallThis(position,"Objects","Lock",2)
  9566. ELSE CallThis(position,"Objects","Unlock",2);
  9567. END;
  9568. END;
  9569. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9570. IF Trace THEN TraceExit("Lock") END;
  9571. END Lock;
  9572. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9573. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9574. BEGIN
  9575. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9576. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9577. previouslyUnchecked := isUnchecked;
  9578. isUnchecked := isUnchecked OR x.isUnchecked;
  9579. previouslyCooperativeSwitches := cooperativeSwitches;
  9580. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9581. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9582. IF x.statements # NIL THEN
  9583. StatementSequence(x.statements);
  9584. END;
  9585. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9586. isUnchecked := previouslyUnchecked;
  9587. cooperativeSwitches := previouslyCooperativeSwitches;
  9588. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9589. END VisitStatementBlock;
  9590. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9591. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9592. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9593. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9594. procedure: SyntaxTree.Procedure;
  9595. map: SymbolMap;
  9596. BEGIN
  9597. scope := currentScope;
  9598. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9599. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9600. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9601. return := emptyOperand;
  9602. IF Trace THEN TraceEnter("VisitCode") END;
  9603. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9604. NEW(in, x.inRules.Length());
  9605. FOR i := 0 TO LEN(in)-1 DO
  9606. statement := x.inRules.GetStatement(i);
  9607. WITH statement: SyntaxTree.Assignment DO
  9608. Evaluate(statement.right, operand);
  9609. result := operand.op;
  9610. NEW(str, 64);
  9611. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9612. in[i] := result; IntermediateCode.SetString(in[i], str);
  9613. ReleaseIntermediateOperand(operand.tag);
  9614. END;
  9615. END;
  9616. ELSE in := NIL
  9617. END;
  9618. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9619. NEW(out, x.outRules.Length());
  9620. FOR i := 0 TO LEN(out)-1 DO
  9621. statement := x.outRules.GetStatement(i);
  9622. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9623. WITH statement: SyntaxTree.Assignment DO
  9624. Evaluate(statement.left, operand); (*?? or designate *)
  9625. result := operand.op;
  9626. NEW(str, 64);
  9627. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9628. out[i] := result; IntermediateCode.SetString(out[i], str);
  9629. ReleaseIntermediateOperand(operand.tag);
  9630. |statement: SyntaxTree.ReturnStatement DO
  9631. NEW(str, 64);
  9632. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9633. IF currentIsInline THEN
  9634. map := currentMapper.Get(NIL);
  9635. Evaluate(map.to, operand);
  9636. out[i] := operand.op;
  9637. ELSE
  9638. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9639. END;
  9640. IntermediateCode.SetString(out[i], str);
  9641. ReleaseIntermediateOperand(operand.tag);
  9642. return := out[i];
  9643. ELSE
  9644. END;
  9645. END;
  9646. ELSE out := NIL
  9647. END;
  9648. Emit(Asm(x.position,x.sourceCode, in, out));
  9649. IF in # NIL THEN
  9650. FOR i := 0 TO LEN(in)-1 DO
  9651. ReleaseIntermediateOperand(in[i]);
  9652. END;
  9653. END;
  9654. IF out # NIL THEN
  9655. FOR i := 0 TO LEN(out)-1 DO
  9656. WITH statement: SyntaxTree.Assignment DO
  9657. ReleaseIntermediateOperand(out[i]);
  9658. ELSE
  9659. IF currentIsInline THEN
  9660. ReleaseIntermediateOperand(out[i]);
  9661. END;
  9662. END;
  9663. statement := x.outRules.GetStatement(i);
  9664. END;
  9665. END;
  9666. IF return.mode # IntermediateCode.Undefined THEN
  9667. IF currentIsInline THEN
  9668. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9669. Symbol(procedureType.returnParameter, par);
  9670. MakeMemory(mem, par.op, return.type, 0);
  9671. ReleaseOperand(par);
  9672. Emit(Mov(position, mem, return));
  9673. ReleaseIntermediateOperand(mem);
  9674. ELSE
  9675. Emit(Return(position,return));
  9676. END;
  9677. IF currentIsInline THEN RETURN END;
  9678. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9679. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9680. ReleaseIntermediateOperand(return);
  9681. END;
  9682. IF Trace THEN TraceExit("VisitCode") END;
  9683. END VisitCode;
  9684. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9685. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9686. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9687. const, call: IntermediateCode.Operand;
  9688. parameterDesignator: SyntaxTree.Expression;
  9689. saved: RegisterEntry;
  9690. name: Basic.SegmentedName;
  9691. BEGIN
  9692. IF Trace THEN TraceEnter("ParameterCopies") END;
  9693. parameter := x.firstParameter;
  9694. WHILE parameter # NIL DO
  9695. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9696. type := parameter.type.resolved;
  9697. IF IsOpenArray(type) THEN
  9698. VisitParameter(parameter);
  9699. op := result;
  9700. IF backend.cooperative & parameter.NeedsTrace() THEN
  9701. length := GetArrayLength(type, op.tag);
  9702. size := NewRegisterOperand(addressType);
  9703. base := ArrayBaseType(type);
  9704. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9705. Emit(Mul(position, size, length, const));
  9706. dst := NewRegisterOperand (addressType);
  9707. Emit(Mov(position, dst, size));
  9708. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9709. Emit(Sub(position,dst,sp,dst));
  9710. Emit(And(position,dst,dst,const));
  9711. Emit(Mov(position,sp,dst));
  9712. par := fp;
  9713. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9714. IntermediateCode.InitImmediate(null, byteType, 0);
  9715. Emit(Fill(position, dst, size, null));
  9716. ReleaseIntermediateOperand(dst);
  9717. ReleaseIntermediateOperand(length);
  9718. SaveRegisters();ReleaseUsedRegisters(saved);
  9719. (* register dst has been freed before SaveRegisters already *)
  9720. base := ArrayBaseType(type);
  9721. (* assign method of open array *)
  9722. IF base.IsRecordType() THEN
  9723. Emit (Push(position, length));
  9724. Emit (Push(position, dst));
  9725. Emit (Push(position, op.op));
  9726. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9727. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9728. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9729. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9730. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9731. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9732. Emit (Push(position,length));
  9733. Emit (Push(position, dst));
  9734. Emit (Push(position, length));
  9735. Emit (Push(position, op.op));
  9736. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9737. ELSE
  9738. Emit (Push(position, length));
  9739. Emit (Push(position, dst));
  9740. Emit (Push(position, length));
  9741. Emit (Push(position, op.op));
  9742. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9743. ASSERT(ArrayBaseType(type).IsPointer());
  9744. END;
  9745. RestoreRegisters(saved);
  9746. ELSE
  9747. temp := GetDynamicSize(type,op.tag);
  9748. ReuseCopy(size,temp);
  9749. ReleaseIntermediateOperand(temp);
  9750. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9751. Emit(Sub(position,size,sp,size));
  9752. Emit(And(position,size,size,const));
  9753. Emit(Mov(position,sp,size));
  9754. par := fp;
  9755. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9756. ReleaseIntermediateOperand(size);
  9757. size := GetDynamicSize(type,op.tag);
  9758. END;
  9759. Emit(Copy(position,sp,op.op,size));
  9760. ReleaseIntermediateOperand(size);
  9761. ReleaseOperand(op);
  9762. IntermediateCode.MakeMemory(par,addressType);
  9763. Emit(Mov(position,par,sp));
  9764. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9765. checker.SetCurrentScope(currentScope);
  9766. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9767. Assign(parameterDesignator,parameterDesignator);
  9768. END;
  9769. END;
  9770. parameter := parameter.nextParameter;
  9771. END;
  9772. IF Trace THEN TraceExit("ParameterCopies") END;
  9773. END ParameterCopies;
  9774. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9775. VAR x: SyntaxTree.Variable;
  9776. BEGIN
  9777. x := scope.firstVariable;
  9778. WHILE x # NIL DO
  9779. InitVariable(x);
  9780. x := x.nextVariable;
  9781. END;
  9782. END InitVariables;
  9783. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9784. BEGIN
  9785. IF (symbol # NIL) THEN
  9786. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9787. ELSE
  9788. RETURN 0
  9789. END;
  9790. END GetFingerprint;
  9791. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9792. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9793. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9794. saved: RegisterEntry;
  9795. BEGIN
  9796. IF Trace THEN TraceEnter("Body") END;
  9797. ReleaseUsedRegisters(saved); (* just in case ... *)
  9798. section := ir;
  9799. exitLabel := NewLabel ();
  9800. IF moduleBody THEN moduleBodySection := section END;
  9801. IF ir.comments # NIL THEN
  9802. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9803. commentPrintout.SingleStatement(TRUE);
  9804. dump := ir.comments;
  9805. ELSE
  9806. commentPrintout := NIL;
  9807. dump := NIL;
  9808. END;
  9809. prevScope := currentScope;
  9810. currentScope := scope;
  9811. lastSwitchPC := 0;
  9812. cooperativeSwitches := backend.cooperative;
  9813. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9814. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9815. IF x # NIL THEN
  9816. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9817. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9818. IF moduleBody THEN
  9819. ProfilerInit();
  9820. ELSE
  9821. Basic.SegmentedNameToString(ir.name, string);
  9822. ProfilerAddProcedure(numberProcedures,string);
  9823. ProfilerEnterExit(numberProcedures,TRUE);
  9824. END;
  9825. END;
  9826. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9827. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9828. END;
  9829. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9830. IF moduleBody & ~newObjectFile THEN
  9831. InitVariables(moduleScope)
  9832. END;
  9833. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9834. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9835. IF procedure = cellScope.bodyProcedure THEN
  9836. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9837. StaticCallOperand(op, cellScope.constructor);
  9838. Emit(Call(position,op.op,0));
  9839. END;
  9840. END;
  9841. END;
  9842. ParameterCopies(procedureType);
  9843. InitVariables(scope);
  9844. IF x.code = NIL THEN
  9845. VisitStatementBlock(x);
  9846. ELSE
  9847. VisitCode(x.code)
  9848. END;
  9849. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9850. ir.SetFinally(ir.pc);
  9851. StatementSequence(x.finally)
  9852. END;
  9853. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9854. IF ~backend.cooperative THEN
  9855. ProfilerEnterExit(numberProcedures,FALSE);
  9856. END;
  9857. INC(numberProcedures);
  9858. END;
  9859. END;
  9860. IF backend.cooperative THEN
  9861. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9862. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9863. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9864. (*! not required any more? check and delete!
  9865. PushSelfPointer();
  9866. CallThis(position,"Modules","SetInitialized",1);
  9867. *)
  9868. (*
  9869. SetLabel(end);
  9870. *)
  9871. END;
  9872. IF x # NIL THEN
  9873. SELF.position := x.position;
  9874. END;
  9875. CheckRegistersFree();
  9876. ASSERT(modifyAssignmentCounter = 0);
  9877. currentScope := prevScope;
  9878. IF Trace THEN TraceExit("Body") END;
  9879. END Body;
  9880. END ImplementationVisitor;
  9881. MetaDataGenerator=OBJECT
  9882. VAR
  9883. implementationVisitor: ImplementationVisitor;
  9884. declarationVisitor: DeclarationVisitor;
  9885. module: Sections.Module;
  9886. moduleName: ARRAY 128 OF CHAR;
  9887. moduleNamePool: Basic.HashTableInt;
  9888. moduleNamePoolSection: IntermediateCode.Section;
  9889. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9890. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9891. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9892. TypeTags: LONGINT; (* type extension level support *)
  9893. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9894. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9895. BEGIN
  9896. IF implementationVisitor.backend.cooperative THEN
  9897. TypeTags := MAX(LONGINT);
  9898. BaseTypesTableOffset := 0;
  9899. MethodTableOffset := 2;
  9900. TypeRecordBaseOffset := 0;
  9901. ELSIF simple THEN
  9902. TypeTags := 3; (* only 3 extensions allowed *)
  9903. BaseTypesTableOffset := 1;
  9904. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9905. TypeRecordBaseOffset := 0;
  9906. ELSE
  9907. TypeTags := 16;
  9908. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9909. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9910. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9911. END;
  9912. SELF.simple := simple;
  9913. SELF.implementationVisitor := implementationVisitor;
  9914. SELF.declarationVisitor := declarationVisitor;
  9915. implementationVisitor.meta := SELF;
  9916. declarationVisitor.meta := SELF;
  9917. END InitMetaDataGenerator;
  9918. PROCEDURE SetModule(module: Sections.Module);
  9919. VAR namePoolOffset: LONGINT;
  9920. BEGIN
  9921. SELF.module := module;
  9922. Global.GetModuleName(module.module,moduleName);
  9923. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9924. NEW(moduleNamePool, 32);
  9925. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9926. END;
  9927. END SetModule;
  9928. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9929. BEGIN
  9930. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9931. END GetTypeRecordBaseOffset;
  9932. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9933. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9934. BEGIN
  9935. INC(dataAdrOffset,6);
  9936. Info(section,"headerAdr");
  9937. Address(section,0);
  9938. Info(section,"typeDesc");
  9939. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9940. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9941. NamedSymbol(section, name, symbol, 0, offset);
  9942. Info(section,"mark: LONGINT;");
  9943. Longint(section,-1);
  9944. Info(section,"dataAdr-: ADDRESS");
  9945. Symbol(section,section, dataAdrOffset,0);
  9946. Info(section,"size-: SIZE");
  9947. Address(section,0);
  9948. Info(section,"nextRealtime: HeapBlock;");
  9949. Address(section,0);
  9950. END HeapBlock;
  9951. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9952. VAR i: LONGINT;
  9953. BEGIN
  9954. INC(dataAdrOffset,14);
  9955. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9956. Info(section,"count*: LONGINT");
  9957. Longint(section,0);
  9958. Info(section,"locked*: BOOLEAN");
  9959. Longint(section,0);
  9960. Info(section,"awaitingLock*: ProcessQueue");
  9961. Address(section,0);
  9962. Address(section,0);
  9963. Info(section,"awaitingCond*: ProcessQueue");
  9964. Address(section,0);
  9965. Address(section,0);
  9966. Info(section,"lockedBy*: ANY");
  9967. Address(section,0);
  9968. Info(section,"lock*: ANY");
  9969. Address(section,0);
  9970. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9971. Longint(section,1);
  9972. FOR i := 2 TO 6 DO
  9973. Longint(section,0);
  9974. END;
  9975. END ProtectedHeapBlock;
  9976. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9977. BEGIN
  9978. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9979. END Info;
  9980. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9981. VAR op: IntermediateCode.Operand;
  9982. BEGIN
  9983. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9984. section.Emit(Data(-11,op));
  9985. END Address;
  9986. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9987. VAR op: IntermediateCode.Operand;
  9988. BEGIN
  9989. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9990. section.Emit(Data(-12,op));
  9991. END Size;
  9992. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9993. VAR op: IntermediateCode.Operand;
  9994. BEGIN
  9995. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9996. section.Emit(Data(-1,op));
  9997. END Set;
  9998. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9999. VAR op: IntermediateCode.Operand;
  10000. BEGIN
  10001. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10002. section.Emit(Data(-1,op));
  10003. END Longint;
  10004. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10005. VAR op,noOperand: IntermediateCode.Operand;
  10006. BEGIN
  10007. IntermediateCode.InitOperand(noOperand);
  10008. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10009. section.PatchOperands(pc,op,noOperand,noOperand);
  10010. END PatchLongint;
  10011. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10012. VAR op, noOperand: IntermediateCode.Operand;
  10013. BEGIN
  10014. IntermediateCode.InitOperand(noOperand);
  10015. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10016. section.PatchOperands(pc,op,noOperand,noOperand);
  10017. END PatchSymbol;
  10018. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10019. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10020. BEGIN
  10021. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10022. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10023. section.Emit(Data(-1,op));
  10024. END Boolean;
  10025. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10026. VAR op: IntermediateCode.Operand;
  10027. BEGIN
  10028. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10029. section.Emit(Data(-1,op));
  10030. END Char;
  10031. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10032. VAR i: LONGINT;
  10033. BEGIN
  10034. Info(section,str);
  10035. i := 0;
  10036. WHILE(str[i] # 0X) DO
  10037. Char(section,str[i]);
  10038. INC(i);
  10039. END;
  10040. Char(section,0X);
  10041. END String;
  10042. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10043. VAR op: IntermediateCode.Operand;
  10044. BEGIN
  10045. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10046. IntermediateCode.SetOffset(op,realOffset);
  10047. section.Emit(Data(-1,op));
  10048. END NamedSymbol;
  10049. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10050. BEGIN
  10051. IF symbol= NIL THEN
  10052. Address( section, realOffset);
  10053. ASSERT(virtualOffset = 0);
  10054. ELSE
  10055. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10056. END;
  10057. END Symbol;
  10058. (* OutPointers delivers
  10059. {pointerOffset}
  10060. *)
  10061. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10062. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  10063. BEGIN
  10064. type := type.resolved;
  10065. IF type IS SyntaxTree.AnyType THEN
  10066. Symbol(section, symbol, 0, (offset ));
  10067. INC(numberPointers);
  10068. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10069. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10070. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10071. ELSIF type IS SyntaxTree.PointerType THEN
  10072. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10073. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10074. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10075. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10076. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10077. ELSIF (type IS SyntaxTree.RecordType) THEN
  10078. (* never treat a record like a pointer, even if the pointer field is set! *)
  10079. WITH type: SyntaxTree.RecordType DO
  10080. base := type.GetBaseRecord();
  10081. IF base # NIL THEN
  10082. Pointers(offset,symbol,section, base,numberPointers);
  10083. END;
  10084. variable := type.recordScope.firstVariable;
  10085. WHILE(variable # NIL) DO
  10086. IF ~(variable.untraced) THEN
  10087. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10088. END;
  10089. variable := variable.nextVariable;
  10090. END;
  10091. END;
  10092. ELSIF (type IS SyntaxTree.CellType) THEN
  10093. WITH type: SyntaxTree.CellType DO
  10094. base := type.GetBaseRecord();
  10095. IF base # NIL THEN
  10096. Pointers(offset,symbol,section, base,numberPointers);
  10097. END;
  10098. variable := type.cellScope.firstVariable;
  10099. WHILE(variable # NIL) DO
  10100. IF ~(variable.untraced) THEN
  10101. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10102. END;
  10103. variable := variable.nextVariable;
  10104. END;
  10105. END;
  10106. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10107. WITH type: SyntaxTree.ArrayType DO
  10108. IF type.form= SyntaxTree.Static THEN
  10109. n := type.staticLength;
  10110. base := type.arrayBase.resolved;
  10111. WHILE(base IS SyntaxTree.ArrayType) DO
  10112. type := base(SyntaxTree.ArrayType);
  10113. n := n* type.staticLength;
  10114. base := type.arrayBase.resolved;
  10115. END;
  10116. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10117. IF SemanticChecker.ContainsPointer(base) THEN
  10118. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10119. FOR i := 0 TO n-1 DO
  10120. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10121. END;
  10122. END;
  10123. ELSE
  10124. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10125. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10126. END;
  10127. END;
  10128. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10129. WITH type: SyntaxTree.MathArrayType DO
  10130. IF type.form = SyntaxTree.Static THEN
  10131. n := type.staticLength;
  10132. base := type.arrayBase.resolved;
  10133. WHILE(base IS SyntaxTree.MathArrayType) DO
  10134. type := base(SyntaxTree.MathArrayType);
  10135. n := n* type.staticLength;
  10136. base := type.arrayBase.resolved;
  10137. END;
  10138. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10139. IF SemanticChecker.ContainsPointer(base) THEN
  10140. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10141. FOR i := 0 TO n-1 DO
  10142. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10143. END;
  10144. END;
  10145. ELSE
  10146. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10147. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10148. END
  10149. END;
  10150. (* ELSE no pointers in type *)
  10151. END;
  10152. END Pointers;
  10153. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10154. VAR position,i: LONGINT; ch: CHAR;
  10155. BEGIN
  10156. IF pool.Has(index) THEN
  10157. RETURN pool.GetInt(index)
  10158. ELSE
  10159. position := source.pc;
  10160. pool.PutInt(index, position);
  10161. Info(source, name);
  10162. i := 0;
  10163. REPEAT
  10164. ch := name[i]; INC(i);
  10165. Char( source, ch);
  10166. UNTIL ch = 0X;
  10167. END;
  10168. RETURN position;
  10169. END EnterDynamicName;
  10170. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10171. VAR name: Basic.SectionName; position: LONGINT;
  10172. BEGIN
  10173. IF pool.Has(index) THEN
  10174. RETURN pool.GetInt(index)
  10175. ELSE
  10176. StringPool.GetString(index, name);
  10177. position := EnterDynamicName(source,name,index, pool);
  10178. END;
  10179. RETURN position;
  10180. END DynamicName;
  10181. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10182. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10183. BEGIN
  10184. COPY(moduleName,name);
  10185. Strings.Append(name,suffix);
  10186. Basic.ToSegmentedName(name, pooledName);
  10187. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10188. IF implementationVisitor.backend.cooperative THEN
  10189. Info(section, "TypeDescriptor");
  10190. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10191. NamedSymbol(section, pooledName,NIL, 0, 0);
  10192. BasePointer(section);
  10193. offset := 0;
  10194. ELSE
  10195. HeapBlock(mName,typeName,section,2);
  10196. Info(section, "HeapBlock");
  10197. (*
  10198. Symbol(section,section,2,0);
  10199. *)
  10200. Address(section,0); (* empty such that GC does not go on traversing *)
  10201. Info(section, "TypeDescriptor");
  10202. Address(section,0);
  10203. offset := section.pc;
  10204. END;
  10205. RETURN section
  10206. END Block;
  10207. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10208. VAR name: Basic.SegmentedName;
  10209. BEGIN
  10210. Info(source,"ArrayHeader");
  10211. IF implementationVisitor.backend.cooperative THEN
  10212. sizePC := source.pc;
  10213. Address(source,0);
  10214. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10215. IF baseType # "" THEN
  10216. Basic.ToSegmentedName(baseType, name);
  10217. NamedSymbol(source, name,NIL, 0, 0);
  10218. ELSE
  10219. Address(source,0);
  10220. END;
  10221. Address(source,0);
  10222. ELSE
  10223. Address(source,0);
  10224. Address(source,0);
  10225. Address(source,0);
  10226. sizePC := source.pc;
  10227. Address(source,0);
  10228. Info(source,"array data");
  10229. END;
  10230. END Array;
  10231. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10232. BEGIN
  10233. IF implementationVisitor.backend.cooperative THEN
  10234. PatchLongint(section, pc, size);
  10235. PatchLongint(section, pc + 3, size);
  10236. ELSE
  10237. PatchLongint(section, pc, size);
  10238. END;
  10239. END PatchArray;
  10240. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10241. VAR
  10242. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10243. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10244. poolMap: Basic.HashTableInt;
  10245. namePool: IntermediateCode.Section;
  10246. namePoolOffset: LONGINT;
  10247. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10248. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10249. BEGIN
  10250. Basic.SegmentedNameToString(s1.name,n1);
  10251. Basic.SegmentedNameToString(s2.name,n2);
  10252. index := 0;
  10253. ch1 := n1[index];
  10254. ch2 := n2[index];
  10255. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10256. INC(index);
  10257. ch1 := n1[index];
  10258. ch2 := n2[index];
  10259. END;
  10260. RETURN ch1 < ch2;
  10261. END Compare;
  10262. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10263. VAR
  10264. i, j: LONGINT;
  10265. x, t: Sections.Section;
  10266. BEGIN
  10267. IF lo < hi THEN
  10268. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10269. WHILE i <= j DO
  10270. WHILE Compare(list[i], x) DO INC(i) END;
  10271. WHILE Compare(x, list[j]) DO DEC(j) END;
  10272. IF i <= j THEN
  10273. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10274. INC(i); DEC(j)
  10275. END
  10276. END;
  10277. IF lo < j THEN QuickSort(list, lo, j) END;
  10278. IF i < hi THEN QuickSort(list, i, hi) END
  10279. END;
  10280. END QuickSort;
  10281. (*
  10282. ExportDesc* = RECORD
  10283. fp*: ADDRESS;
  10284. name* {UNTRACED}: DynamicName;
  10285. adr*: ADDRESS;
  10286. exports*: LONGINT;
  10287. dsc* {UNTRACED}: ExportArray
  10288. END;
  10289. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10290. *)
  10291. PROCEDURE ExportDesc2(
  10292. source: IntermediateCode.Section;
  10293. namePool: IntermediateCode.Section;
  10294. fingerPrinter: FingerPrinter.FingerPrinter;
  10295. symbol: Sections.Section;
  10296. name: StringPool.Index;
  10297. VAR patchAdr: LONGINT
  10298. ): BOOLEAN;
  10299. VAR fingerPrint: SyntaxTree.FingerPrint;
  10300. BEGIN
  10301. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10302. & (symbol.type # Sections.InlineCodeSection)
  10303. THEN
  10304. *)
  10305. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10306. & (symbol.type # Sections.InlineCodeSection))
  10307. THEN
  10308. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10309. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10310. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10311. Longint(source,fingerPrint.shallow);
  10312. ELSE
  10313. Longint(source, 0);
  10314. END;
  10315. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10316. Symbol(source, symbol,0,0);
  10317. patchAdr := source.pc;
  10318. Address(source,0);
  10319. Address(source,0);
  10320. END;
  10321. RETURN TRUE
  10322. ELSE
  10323. RETURN FALSE
  10324. END;
  10325. END ExportDesc2;
  10326. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10327. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10328. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10329. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10330. TYPE
  10331. Scope = RECORD
  10332. elements: LONGINT;
  10333. gelements: LONGINT;
  10334. section: IntermediateCode.Section;
  10335. patchAdr: LONGINT;
  10336. arraySizePC: LONGINT;
  10337. beginPC: LONGINT; (* current scope start pc *)
  10338. END;
  10339. BEGIN
  10340. Basic.InitSegmentedName(prev);
  10341. olevel := -1;
  10342. scopes[0].section := source;
  10343. FOR s := 0 TO LEN(sections)-1 DO
  10344. symbol := sections[s];
  10345. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10346. this := sections[s].name;
  10347. level := 0;
  10348. WHILE (this[level] > 0) DO
  10349. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10350. INC(level);
  10351. END;
  10352. WHILE level < olevel DO
  10353. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10354. IF olevel > 0 THEN
  10355. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10356. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10357. END;
  10358. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10359. DEC(olevel);
  10360. END;
  10361. IF (this[level] > 0) THEN
  10362. IF level > olevel THEN
  10363. (*TRACE("opening",level); *)
  10364. IF scopes[level].section = NIL THEN
  10365. arrayName := ".@ExportArray";
  10366. Strings.AppendInt(arrayName, level);
  10367. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10368. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10369. END;
  10370. scopes[level].beginPC := scopes[level].section.pc;
  10371. olevel := level;
  10372. scopes[olevel].elements := 0;
  10373. END;
  10374. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10375. sym := sections[s];
  10376. ELSE
  10377. sym := NIL;
  10378. END;
  10379. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10380. THEN
  10381. INC(scopes[olevel].elements);
  10382. END;
  10383. (*StringPool.GetString(this[level], name);*)
  10384. (*TRACE(level, name);*)
  10385. (* enter string in scope *)
  10386. INC(level);
  10387. END;
  10388. END;
  10389. Basic.SegmentedNameToString(this, name);
  10390. (*TRACE(level, "enter", name);*)
  10391. prev := this;
  10392. END;
  10393. END;
  10394. WHILE 0 <= olevel DO
  10395. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10396. IF olevel > 0 THEN
  10397. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10398. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10399. END;
  10400. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10401. DEC(olevel);
  10402. END;
  10403. level := 0;
  10404. WHILE (level < LEN(scopes)) DO
  10405. IF scopes[level].section # NIL THEN
  10406. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10407. END;
  10408. INC(level);
  10409. END;
  10410. END Export;
  10411. BEGIN
  10412. NEW(fingerPrinter, module.system);
  10413. NEW(poolMap, 64);
  10414. (* 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 *)
  10415. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10416. NEW(sectionArray, module.allSections.Length());
  10417. FOR i := 0 TO module.allSections.Length() - 1 DO
  10418. section := module.allSections.GetSection(i);
  10419. sectionArray[i] := section;
  10420. END;
  10421. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10422. Export(sectionArray^);
  10423. END ExportDesc;
  10424. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10425. VAR
  10426. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10427. BEGIN
  10428. Info(source, "exception table offsets array descriptor");
  10429. size := 0;
  10430. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10431. Info(source, "exception table content");
  10432. FOR i := 0 TO module.allSections.Length() - 1 DO
  10433. p := module.allSections.GetSection(i);
  10434. IF p.type = Sections.CodeSection THEN
  10435. finallyPC := p(IntermediateCode.Section).finally;
  10436. IF finallyPC>=0 THEN
  10437. Symbol( source, p, 0,0);
  10438. Symbol( source, p, finallyPC, 0);
  10439. Symbol( source, p, finallyPC,0);
  10440. INC(size);
  10441. END;
  10442. END
  10443. END;
  10444. PatchArray(source,sizePC,size);
  10445. END ExceptionArray;
  10446. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10447. VAR i: LONGINT; ch: CHAR;
  10448. BEGIN
  10449. i := 0;
  10450. REPEAT
  10451. ch := name[i]; INC(i);
  10452. Char( section, ch);
  10453. UNTIL ch = 0X;
  10454. WHILE i < 32 DO
  10455. Char( section, 0X); INC(i);
  10456. END;
  10457. END Name;
  10458. PROCEDURE References(section: IntermediateCode.Section);
  10459. CONST
  10460. rfDirect = 1X; rfIndirect = 3X;
  10461. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10462. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10463. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10464. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10465. rfPort = 19X;
  10466. rfRecordPointer=1DX;
  10467. rfArrayFlag = 80X;
  10468. VAR
  10469. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10470. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10471. VAR char: CHAR;
  10472. BEGIN
  10473. IF type = NIL THEN char := rfLongint
  10474. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10475. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10476. ELSIF type IS SyntaxTree.CharacterType THEN
  10477. IF type.sizeInBits = 8 THEN char := rfChar8
  10478. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10479. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10480. END;
  10481. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10482. IF type.sizeInBits = 8 THEN char := rfShortint
  10483. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10484. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10485. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10486. END;
  10487. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10488. ELSIF type IS SyntaxTree.FloatType THEN
  10489. IF type.sizeInBits = 32 THEN char := rfReal
  10490. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10491. END;
  10492. ELSIF type IS SyntaxTree.ComplexType THEN
  10493. IF type.sizeInBits = 64 THEN char := rfComplex
  10494. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10495. END;
  10496. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10497. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10498. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10499. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10500. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10501. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10502. ELSIF type IS SyntaxTree.PortType THEN char := rfPort
  10503. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10504. END;
  10505. RETURN char
  10506. END BaseType;
  10507. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10508. VAR destination: Sections.Section;
  10509. BEGIN
  10510. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10511. IF type.pointerType # NIL THEN
  10512. Char(section,rfRecordPointer)
  10513. ELSE
  10514. Char(section,rfRecord);
  10515. END;
  10516. IF destination = NIL THEN
  10517. Longint(section,0);
  10518. ELSE
  10519. Longint(section,destination.offset); (* used for ? *)
  10520. END;
  10521. END RecordType;
  10522. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10523. BEGIN
  10524. baseType := type.arrayBase.resolved;
  10525. IF type.form = SyntaxTree.Static THEN
  10526. IF baseType IS SyntaxTree.ArrayType THEN
  10527. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10528. ELSE
  10529. RETURN type.staticLength
  10530. END
  10531. ELSE
  10532. RETURN 0
  10533. END;
  10534. END StaticArrayLength;
  10535. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10536. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10537. BEGIN
  10538. length := StaticArrayLength(type, baseType);
  10539. char := BaseType(baseType);
  10540. IF type.form # SyntaxTree.Open THEN
  10541. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10542. Longint(section, length)
  10543. ELSE
  10544. length :=0;
  10545. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10546. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10547. Longint(section, length)
  10548. END;
  10549. END ArrayType;
  10550. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10551. BEGIN
  10552. baseType := type.arrayBase;
  10553. IF baseType # NIL THEN
  10554. baseType := baseType.resolved;
  10555. END;
  10556. IF type.form = SyntaxTree.Static THEN
  10557. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10558. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10559. ELSE
  10560. RETURN type.staticLength
  10561. END
  10562. ELSE
  10563. RETURN 0
  10564. END;
  10565. END StaticMathArrayLength;
  10566. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10567. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10568. BEGIN
  10569. length := StaticMathArrayLength(type, baseType);
  10570. char := BaseType(baseType);
  10571. IF type.form = SyntaxTree.Open THEN
  10572. char := BaseType(module.system.addressType);
  10573. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10574. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10575. Longint(section, length)
  10576. ELSIF type.form=SyntaxTree.Tensor THEN
  10577. char := BaseType(module.system.addressType);
  10578. Char(section, CHR(ORD(char)));
  10579. ELSE
  10580. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10581. Longint(section, length)
  10582. END;
  10583. END MathArrayType;
  10584. PROCEDURE Type(type: SyntaxTree.Type);
  10585. BEGIN
  10586. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10587. IF type IS SyntaxTree.BasicType THEN
  10588. Char(section, BaseType(type));
  10589. ELSIF type IS SyntaxTree.RecordType THEN
  10590. RecordType(type(SyntaxTree.RecordType));
  10591. ELSIF type IS SyntaxTree.ArrayType THEN
  10592. ArrayType(type(SyntaxTree.ArrayType))
  10593. ELSIF type IS SyntaxTree.EnumerationType THEN
  10594. Char(section, BaseType(module.system.longintType))
  10595. ELSIF type IS SyntaxTree.PointerType THEN
  10596. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10597. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10598. ELSE
  10599. Char(section, BaseType(type))
  10600. END;
  10601. ELSIF type IS SyntaxTree.ProcedureType THEN
  10602. Char(section, BaseType(type));
  10603. ELSIF type IS SyntaxTree.MathArrayType THEN
  10604. MathArrayType(type(SyntaxTree.MathArrayType));
  10605. ELSIF type IS SyntaxTree.CellType THEN
  10606. Char(section, BaseType(module.system.anyType));
  10607. ELSIF type IS SyntaxTree.PortType THEN
  10608. Char(section, rfPort);
  10609. ELSE HALT(200)
  10610. END;
  10611. END Type;
  10612. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10613. VAR name: ARRAY 256 OF CHAR;
  10614. BEGIN
  10615. IF variable.externalName # NIL THEN RETURN END;
  10616. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10617. variable.GetName(name);
  10618. Type(variable.type);
  10619. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10620. String(section,name);
  10621. END WriteVariable;
  10622. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10623. VAR name: ARRAY 256 OF CHAR;
  10624. BEGIN
  10625. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10626. variable.GetName(name);
  10627. Type(variable.type);
  10628. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10629. variable.GetName(name);
  10630. String(section,name);
  10631. END WriteParameter;
  10632. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10633. BEGIN
  10634. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10635. IF type IS SyntaxTree.ArrayType THEN
  10636. WITH type: SyntaxTree.ArrayType DO
  10637. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10638. ELSE Char(section,rfOpenArray)
  10639. END;
  10640. END
  10641. ELSIF type IS SyntaxTree.MathArrayType THEN
  10642. WITH type: SyntaxTree.MathArrayType DO
  10643. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10644. ELSE Char(section,rfOpenArray)
  10645. END;
  10646. END
  10647. ELSIF type IS SyntaxTree.RecordType THEN
  10648. Char(section,rfRecord);
  10649. ELSE
  10650. Char(section, BaseType(type));
  10651. END;
  10652. END ReturnType;
  10653. PROCEDURE Procedure(s: Sections.Section);
  10654. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10655. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10656. name: ARRAY 256 OF CHAR;
  10657. BEGIN
  10658. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10659. (*procedure.name,name);*)
  10660. Global.GetSymbolNameInScope(procedure,module.module.moduleScope,name);
  10661. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10662. Char(section,0F9X);
  10663. Symbol(section,s,0,0);
  10664. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10665. Longint(section,procedureType.numberParameters);
  10666. ReturnType(procedureType.returnType);
  10667. Longint(section,0); (*! level *)
  10668. Longint(section,0);
  10669. (*
  10670. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10671. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10672. recordName := "";
  10673. IF record.pointerType # NIL THEN
  10674. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10675. ELSE
  10676. DeclarationName(record.typeDeclaration,recordName);
  10677. END;
  10678. i := 0;
  10679. Info(section,recordName);
  10680. WHILE recordName[i] # 0X DO
  10681. Char(section,recordName[i]); INC(i);
  10682. INC(size);
  10683. END;
  10684. Char(section,".");
  10685. INC(size);
  10686. END;
  10687. *)
  10688. String(section,name);
  10689. parameter := procedureType.firstParameter;
  10690. WHILE(parameter # NIL) DO
  10691. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10692. parameter := parameter.nextParameter;
  10693. END;
  10694. variable := procedure.procedureScope.firstVariable;
  10695. WHILE(variable # NIL) DO
  10696. WriteVariable(variable,FALSE);
  10697. variable := variable.nextVariable;
  10698. END;
  10699. END Procedure;
  10700. PROCEDURE Scope(s: Sections.Section);
  10701. BEGIN
  10702. Char(section,0F8X);
  10703. Symbol(section,s,0,0); (* start *)
  10704. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10705. String(section,"$$");
  10706. (* removed variables -- wrongly interpreted by Reflection
  10707. variable := module.module.moduleScope.firstVariable;
  10708. WHILE(variable # NIL) DO
  10709. WriteVariable(variable,FALSE);
  10710. variable := variable.nextVariable;
  10711. END;
  10712. *)
  10713. END Scope;
  10714. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10715. VAR result, i: LONGINT;
  10716. BEGIN
  10717. FOR i := startPC TO endPC -1 DO
  10718. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10719. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10720. END;
  10721. RETURN result;
  10722. END ComputeSize;
  10723. BEGIN
  10724. Array(section,sizePC,"");
  10725. startPC := section.pc;
  10726. Char(section,0FFX); (* sign for trap writer *)
  10727. FOR i := 0 TO module.allSections.Length() - 1 DO
  10728. s := module.allSections.GetSection(i);
  10729. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10730. Scope(s) (*! must be first procedure in ref section *)
  10731. END
  10732. END;
  10733. FOR i := 0 TO module.allSections.Length() - 1 DO
  10734. s := module.allSections.GetSection(i);
  10735. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10736. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10737. Procedure(s)
  10738. END
  10739. END;
  10740. endPC := section.pc;
  10741. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10742. END References;
  10743. (*
  10744. Command* = RECORD
  10745. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10746. name*: Name; (* name of the procedure *)
  10747. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10748. entryAdr* : ADDRESS; (* entry address of procedure *)
  10749. END;
  10750. *)
  10751. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10752. VAR
  10753. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10754. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10755. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  10756. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10757. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10758. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10759. BEGIN
  10760. RETURN
  10761. (type = NIL) OR
  10762. (type.resolved IS SyntaxTree.RecordType) OR
  10763. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10764. (type.resolved IS SyntaxTree.AnyType);
  10765. END TypeAllowed;
  10766. BEGIN
  10767. numberParameters := procedureType.numberParameters;
  10768. RETURN
  10769. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10770. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10771. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10772. END GetProcedureAllowed;
  10773. PROCEDURE WriteType(type : SyntaxTree.Type);
  10774. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10775. name: Basic.SegmentedName; offset: LONGINT;
  10776. BEGIN
  10777. IF type = NIL THEN
  10778. Address(source,0);
  10779. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10780. Address(source,1);
  10781. ELSE
  10782. type := type.resolved;
  10783. IF type IS SyntaxTree.PointerType THEN
  10784. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10785. END;
  10786. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10787. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10788. name[0] := typeDeclaration.name; name[1] := -1;
  10789. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10790. ASSERT(section # NIL);
  10791. ELSE
  10792. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10793. (* TODO *)
  10794. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10795. END;
  10796. IF implementationVisitor.backend.cooperative THEN
  10797. offset := 0;
  10798. ELSE
  10799. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10800. END;
  10801. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10802. END;
  10803. END WriteType;
  10804. BEGIN
  10805. Info(source, "command array descriptor");
  10806. Array(source,sizePC,"Modules.Command");
  10807. numberCommands := 0;
  10808. Info(source, "command array content");
  10809. FOR i := 0 TO module.allSections.Length() - 1 DO
  10810. p := module.allSections.GetSection(i);
  10811. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10812. procedure := p.symbol(SyntaxTree.Procedure);
  10813. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10814. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10815. procedure.GetName(name);
  10816. Name(source,name);
  10817. numberParameters := procedureType.numberParameters;
  10818. (* offset of type of first parameter *)
  10819. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10820. ELSE WriteType(procedureType.firstParameter.type)
  10821. END;
  10822. (* offset of type of return parameter *)
  10823. WriteType(procedureType.returnType);
  10824. (* command name *)
  10825. (* command code offset *)
  10826. Symbol(source,p,0,0);
  10827. INC(numberCommands);
  10828. IF Trace THEN
  10829. D.Ln;
  10830. END;
  10831. END;
  10832. END
  10833. END;
  10834. PatchArray(source,sizePC,numberCommands);
  10835. END CommandArray;
  10836. (* to prevent from double import of different module aliases *)
  10837. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10838. VAR i: SyntaxTree.Import;
  10839. BEGIN
  10840. i := module.module.moduleScope.firstImport;
  10841. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10842. i := i.nextImport;
  10843. END;
  10844. RETURN i = import
  10845. END IsFirstDirectOccurence;
  10846. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10847. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10848. BEGIN
  10849. Array(source,pc,"");
  10850. Info(source, "import module array data");
  10851. IF implementationVisitor.backend.cooperative THEN
  10852. offset := 0;
  10853. ELSE
  10854. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10855. END;
  10856. import := module.module.moduleScope.firstImport;
  10857. numberImports := 0;
  10858. WHILE import # NIL DO
  10859. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10860. Global.GetModuleSegmentedName(import.module,name);
  10861. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10862. NamedSymbol(source, name, NIL, 0, offset);
  10863. INC(numberImports);
  10864. END;
  10865. import := import.nextImport
  10866. END;
  10867. PatchArray(source,pc,numberImports);
  10868. END ImportsArray;
  10869. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10870. VAR
  10871. p: Sections.Section; sizePC, size, i: LONGINT;
  10872. BEGIN
  10873. Info(source, "Type info section");
  10874. size := 0;
  10875. Array(source,sizePC,"Modules.TypeDesc");
  10876. FOR i := 0 TO module.allSections.Length() - 1 DO
  10877. p := module.allSections.GetSection(i);
  10878. WITH p: IntermediateCode.Section DO
  10879. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10880. Symbol(source,p,0,0);
  10881. INC(size);
  10882. END;
  10883. END
  10884. END;
  10885. PatchArray(source,sizePC,size);
  10886. END TypeInfoSection;
  10887. (*
  10888. ProcTableEntry* = RECORD
  10889. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10890. noPtr*: LONGINT;
  10891. END;
  10892. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10893. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10894. *)
  10895. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10896. VAR
  10897. destination: Sections.Section;
  10898. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10899. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10900. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10901. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10902. BEGIN
  10903. Info(procArray,"pcFrom");
  10904. Symbol(procArray,destination,0,0);
  10905. Info(procArray,"pcTo");
  10906. Symbol(procArray,destination,destination.pc,0);
  10907. Info(procArray,"pcStatementBegin");
  10908. Symbol(procArray,destination,destination.validPAFEnter,0);
  10909. Info(procArray,"pcStatementEnd");
  10910. Symbol(procArray,destination,destination.validPAFExit,0);
  10911. IF ~implementationVisitor.backend.cooperative THEN
  10912. Basic.SegmentedNameToString(destination.name, string);
  10913. Info(pointerArray,string);
  10914. procedure := destination.symbol(SyntaxTree.Procedure);
  10915. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10916. variable := procedure.procedureScope.firstVariable;
  10917. WHILE(variable # NIL) DO
  10918. IF ~(variable.untraced) THEN
  10919. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10920. END;
  10921. variable := variable.nextVariable
  10922. END;
  10923. parameter := procedureType.firstParameter;
  10924. WHILE(parameter # NIL) DO
  10925. IF ~(parameter.untraced) THEN
  10926. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10927. END;
  10928. parameter := parameter.nextParameter;
  10929. END;
  10930. END;
  10931. Info(procArray,"numberPointers");
  10932. Longint(procArray,numberPointers);
  10933. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10934. INC(pointerArraySize, numberPointers);
  10935. END PointerOffsets;
  10936. BEGIN
  10937. maxPointers := 0;
  10938. Info(procArray, "proc array descriptor");
  10939. Address(procArray,0);
  10940. Address(procArray,0);
  10941. Address(procArray,0);
  10942. procArraySizePC := procArray.pc;
  10943. Address(procArray,0);
  10944. procArraySize := 0;
  10945. IF ~implementationVisitor.backend.cooperative THEN
  10946. Info(pointerArray, "pointer array descriptor");
  10947. Address(pointerArray,0);
  10948. Address(pointerArray,0);
  10949. Address(pointerArray,0);
  10950. pointerArraySizePC := pointerArray.pc;
  10951. Address(pointerArray,0);
  10952. pointerArraySize := 0;
  10953. END;
  10954. procArraySize := 0;
  10955. FOR i := 0 TO module.allSections.Length() - 1 DO
  10956. destination := module.allSections.GetSection(i);
  10957. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10958. PointerOffsets(destination(IntermediateCode.Section));
  10959. INC(procArraySize);
  10960. END
  10961. END;
  10962. PatchLongint(procArray,procArraySizePC,procArraySize);
  10963. IF ~implementationVisitor.backend.cooperative THEN
  10964. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10965. END;
  10966. END PointersInProcTables;
  10967. (*
  10968. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10969. VAR
  10970. next*: Module; (** once a module is published, all fields are read-only *)
  10971. name*: Name;
  10972. init, published: BOOLEAN;
  10973. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10974. sb*: ADDRESS; <- set to beginning of data section by loader
  10975. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10976. command*: POINTER TO ARRAY OF Command;
  10977. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10978. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10979. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10980. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10981. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10982. data*, code*: Bytes;
  10983. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10984. export*: ExportDesc;
  10985. term*: TerminationHandler;
  10986. exTable*: ExceptionTable;
  10987. noProcs*: LONGINT;
  10988. firstProc*: ADDRESS; <- done by loader
  10989. maxPtrs*: LONGINT;
  10990. crc*: LONGINT;
  10991. *)
  10992. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10993. BEGIN
  10994. Info(section, "cycle");
  10995. Size(section,0);
  10996. Info(section, "references");
  10997. Size(section,0);
  10998. Info(section, "nextMarked");
  10999. Address(section,0);
  11000. Info(section, "nextWatched");
  11001. Address(section,0);
  11002. END BasePointer;
  11003. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11004. BEGIN
  11005. BasePointer(section);
  11006. Info(section, "action");
  11007. Address(section,0);
  11008. Info(section, "monitor");
  11009. Address(section,0);
  11010. END BaseObject;
  11011. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11012. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11013. pooledName: Basic.SegmentedName;
  11014. symbol: SyntaxTree.Symbol;
  11015. BEGIN
  11016. Global.GetModuleName(module.module,name);
  11017. Strings.Append(name,".@Module.@Descriptor");
  11018. Basic.ToSegmentedName(name, pooledName);
  11019. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  11020. Symbol(section,descriptorSection,0,0);
  11021. Info(descriptorSection, "descriptor");
  11022. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11023. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11024. Address(descriptorSection,0);
  11025. Global.GetModuleName(module.module,name);
  11026. Strings.Append(name,".@Trace");
  11027. Basic.ToSegmentedName(name, pooledName);
  11028. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11029. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11030. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11031. END ModuleDescriptor;
  11032. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11033. VAR name: ARRAY 128 OF CHAR;
  11034. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11035. symbol: SyntaxTree.Symbol;
  11036. BEGIN
  11037. Global.GetModuleName(module.module,name);
  11038. Strings.Append(name,".@Module");
  11039. Basic.ToSegmentedName(name, pooledName);
  11040. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  11041. moduleSection.SetExported(TRUE);
  11042. IF moduleSection.pc = 0 THEN
  11043. IF implementationVisitor.backend.cooperative THEN
  11044. Info(moduleSection, "descriptor");
  11045. ModuleDescriptor(moduleSection);
  11046. BaseObject(moduleSection);
  11047. implementationVisitor.CreateTraceModuleMethod(module.module);
  11048. ELSE
  11049. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11050. Info(moduleSection, "HeapBlock");
  11051. Symbol(moduleSection,moduleSection,2,0);
  11052. Info(moduleSection, "TypeDescriptor");
  11053. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11054. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11055. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11056. END;
  11057. END;
  11058. RETURN moduleSection;
  11059. END ModuleSection;
  11060. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11061. VAR
  11062. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11063. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  11064. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11065. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  11066. referenceSectionOffset : LONGINT;
  11067. BEGIN
  11068. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11069. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11070. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11071. ImportsArray(importSection);
  11072. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11073. CommandArray(commandsSection);
  11074. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11075. ExceptionArray(exceptionSection);
  11076. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11077. TypeInfoSection(typeInfoSection);
  11078. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11079. References(referenceSection);
  11080. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11081. IF ~implementationVisitor.backend.cooperative THEN
  11082. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  11083. ELSE
  11084. ptrTableSection := NIL;
  11085. END;
  11086. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  11087. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11088. Array(emptyArraySection,temp,"");
  11089. moduleSection := ModuleSection();
  11090. Info(moduleSection, "nextRoot*: RootObject");
  11091. Address(moduleSection,0);
  11092. Info(moduleSection, "next*: Module");
  11093. Address(moduleSection,0);
  11094. Info(moduleSection, "name*: Name");
  11095. Name(moduleSection,moduleName);
  11096. Info(moduleSection, "init, published: BOOLEAN");
  11097. Boolean(moduleSection,FALSE);
  11098. Boolean(moduleSection,FALSE);
  11099. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11100. Boolean(moduleSection,FALSE);
  11101. Boolean(moduleSection,FALSE);
  11102. Info(moduleSection, "refcnt*: LONGINT");
  11103. Longint(moduleSection,0);
  11104. Info(moduleSection, "sb*: ADDRESS");
  11105. Address(moduleSection,0);
  11106. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11107. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11108. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11109. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11110. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11111. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11112. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11113. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11114. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11115. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  11116. Info(moduleSection, "procTable*: ProcTable");
  11117. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11118. Info(moduleSection, "ptrTable*: PtrTable");
  11119. IF ~implementationVisitor.backend.cooperative THEN
  11120. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  11121. ELSE
  11122. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11123. END;
  11124. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11125. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11126. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11127. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11128. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11129. Info(moduleSection, "export*: ExportDesc");
  11130. ExportDesc(moduleSection);
  11131. Info(moduleSection, "term*: TerminationHandler");
  11132. Address(moduleSection,0);
  11133. Info(moduleSection, "exTable*: ExceptionTable");
  11134. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11135. Info(moduleSection, "noProcs*: LONGINT");
  11136. Longint(moduleSection,numberProcs);
  11137. Info(moduleSection, "firstProc*: ADDRESS");
  11138. Address(moduleSection,0);
  11139. Info(moduleSection, "maxPtrs*: LONGINT");
  11140. Longint(moduleSection,maxPointers);
  11141. Info(moduleSection, "crc*: LONGINT");
  11142. Longint(moduleSection, 0); (*! must be implemented *)
  11143. Info(moduleSection, "body*: ADDRESS");
  11144. Symbol(moduleSection, bodyProc, 0,0);
  11145. IF implementationVisitor.backend.cooperative THEN
  11146. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11147. Info(moduleSection, "monitor.owner");
  11148. Address(moduleSection,0);
  11149. Info(moduleSection, "monitor.nestingLevel");
  11150. Address(moduleSection,0);
  11151. Info(moduleSection, "monitor.blockedQueue");
  11152. Address(moduleSection,0); Address(moduleSection,0);
  11153. Info(moduleSection, "monitor.waitingQueue");
  11154. Address(moduleSection,0); Address(moduleSection,0);
  11155. Info(moduleSection, "monitor.waitingSentinel");
  11156. Address(moduleSection,0);
  11157. END;
  11158. END Module;
  11159. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11160. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  11161. BEGIN
  11162. Array(source,pc,"");
  11163. Info(source, "pointer offsets array data");
  11164. IF scope IS SyntaxTree.RecordScope THEN
  11165. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11166. ELSIF scope IS SyntaxTree.CellScope THEN
  11167. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11168. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11169. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11170. WHILE variable # NIL DO
  11171. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11172. symbol := module.allSections.FindBySymbol(variable);
  11173. ASSERT(symbol # NIL);
  11174. Pointers(0,symbol, source,variable.type,numberPointers);
  11175. END;
  11176. variable := variable.nextVariable;
  11177. END;
  11178. END;
  11179. PatchArray(source,pc,numberPointers);
  11180. END PointerArray;
  11181. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11182. VAR
  11183. name: Basic.SegmentedName;
  11184. section: IntermediateCode.Section;
  11185. BEGIN
  11186. ASSERT(implementationVisitor.newObjectFile);
  11187. Global.GetSymbolSegmentedName(symbol,name);
  11188. Basic.AppendToSegmentedName(name,suffix);
  11189. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11190. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11191. Info(section, "HeapBlock");
  11192. Address(section,0); (* empty such that GC does not go on traversing *)
  11193. Info(section, suffix);
  11194. Address(section,0);
  11195. pc := section.pc;
  11196. RETURN section;
  11197. END SymbolSection;
  11198. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11199. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11200. BEGIN
  11201. ASSERT(implementationVisitor.newObjectFile);
  11202. IF ~ReflectionSupport OR simple THEN variable := NIL
  11203. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11204. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11205. IF type IS SyntaxTree.PointerType THEN
  11206. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11207. END;
  11208. IF type IS SyntaxTree.RecordType THEN
  11209. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11210. ELSIF type IS SyntaxTree.CellType THEN
  11211. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11212. END;
  11213. ELSIF symbol IS SyntaxTree.Procedure THEN
  11214. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11215. END;
  11216. Info(in, "variables");
  11217. IF variable # NIL THEN
  11218. section := SymbolSection(symbol, "@Variables",pc);
  11219. VariableArray(section, variable);
  11220. Symbol(in, section, pc, 0);
  11221. ELSE
  11222. Address(in, 0);
  11223. END;
  11224. END ReflectVariables;
  11225. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11226. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11227. BEGIN
  11228. ASSERT(implementationVisitor.newObjectFile);
  11229. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11230. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11231. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11232. IF type IS SyntaxTree.PointerType THEN
  11233. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11234. END;
  11235. IF type IS SyntaxTree.RecordType THEN
  11236. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11237. ELSIF type IS SyntaxTree.CellType THEN
  11238. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11239. END;
  11240. ELSIF symbol IS SyntaxTree.Procedure THEN
  11241. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11242. END;
  11243. Info(in, "procedures");
  11244. IF procedure # NIL THEN
  11245. section := SymbolSection(symbol, "@Procedures",pc);
  11246. ProcedureArray(section, procedure);
  11247. Symbol(in, section, pc, 0);
  11248. ELSE
  11249. Address(in, 0);
  11250. END;
  11251. END ReflectProcedures;
  11252. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11253. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11254. segmentedName: Basic.SegmentedName;
  11255. td: SyntaxTree.TypeDeclaration;
  11256. type: SyntaxTree.Type;
  11257. BEGIN
  11258. Array(source,pc,"Modules.FieldEntry");
  11259. Info(source, "FieldArray");
  11260. size :=0;
  11261. WHILE variable # NIL DO
  11262. Info(source,"name");
  11263. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11264. type := variable.type.resolved;
  11265. Info(source,"offset");
  11266. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11267. Info(source,"type class");
  11268. IF type IS SyntaxTree.PointerType THEN
  11269. Size(source, 1);
  11270. ELSIF type IS SyntaxTree.RecordType THEN
  11271. Size(source, 2);
  11272. ELSIF type IS SyntaxTree.NumberType THEN
  11273. Size(source, 3);
  11274. ELSE
  11275. Size(source, 0);
  11276. END;
  11277. Info(source, "type desc");
  11278. IF type IS SyntaxTree.RecordType THEN
  11279. td := type(SyntaxTree.RecordType).typeDeclaration;
  11280. Global.GetSymbolSegmentedName(td,segmentedName);
  11281. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11282. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11283. ELSE
  11284. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11285. END;
  11286. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11287. Symbol(source, tir, 0, offset);
  11288. ELSE
  11289. Address(source, 0);
  11290. END;
  11291. Info(source,"flags");
  11292. Set(source, {});
  11293. variable := variable.nextVariable;
  11294. INC(size);
  11295. END;
  11296. PatchArray(source,pc,size);
  11297. END VariableArray;
  11298. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11299. VAR pc: LONGINT; size: LONGINT;
  11300. segmentedName: Basic.SegmentedName;
  11301. BEGIN
  11302. Array(source,pc,"Modules.ProcedureEntry");
  11303. Info(source, "ProcedureArray");
  11304. size :=0;
  11305. WHILE procedure # NIL DO
  11306. Info(source,"name");
  11307. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11308. Global.GetSymbolSegmentedName(procedure, segmentedName);
  11309. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11310. (* size *)
  11311. Size(source, 0);
  11312. (* parameters *)
  11313. Address(source, 0);
  11314. (* variables *)
  11315. ReflectVariables(source, procedure);
  11316. ReflectProcedures(source, procedure);
  11317. (* return type entry *)
  11318. Address(source, 0);
  11319. Address(source, 0);
  11320. procedure := procedure.nextProcedure;
  11321. INC(size);
  11322. END;
  11323. PatchArray(source,pc,size);
  11324. END ProcedureArray;
  11325. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11326. VAR recordType: SyntaxTree.RecordType;
  11327. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11328. section: Sections.Section; cellType: SyntaxTree.CellType;
  11329. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11330. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11331. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11332. sectionName: Basic.SectionName;
  11333. CONST MPO=-40000000H;
  11334. BEGIN
  11335. (*
  11336. TypeDesc* = POINTER TO RECORD
  11337. descSize: LONGINT;
  11338. sentinel: LONGINT; (* = MPO-4 *)
  11339. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11340. flags*: SET;
  11341. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11342. name*: Name;
  11343. END;
  11344. *)
  11345. (* source := module.sections.FindByName(...) *)
  11346. Global.GetSymbolSegmentedName(td,name);
  11347. Basic.AppendToSegmentedName(name,"@Info");
  11348. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11349. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11350. Address(source,MPO-4);
  11351. Info(source, "type tag pointer");
  11352. Symbol( source, tag, offset, 0);
  11353. Info(source, "type flags");
  11354. flags := {};
  11355. IF isProtected THEN INCL(flags,31) END;
  11356. Set( source, flags);
  11357. Info(source, "pointer to module");
  11358. moduleSection := ModuleSection();
  11359. Symbol( source, moduleSection, moduleSection.pc,0);
  11360. Info(source, "type name");
  11361. i := 0;
  11362. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11363. (*
  11364. Global.GetSymbolSegmentedName(td,name);
  11365. Basic.SegmentedNameToString(name, sectionName);
  11366. *)
  11367. Name(source,sectionName);
  11368. source.SetReferenced(FALSE);
  11369. Global.GetSymbolSegmentedName(td,name);
  11370. Basic.AppendToSegmentedName(name,"@Fields");
  11371. ReflectVariables(source, td);
  11372. ReflectProcedures(source, td);
  11373. (*
  11374. fieldSection := VariableArray(
  11375. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11376. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11377. Info(fieldSection, "HeapBlock");
  11378. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11379. Info(fieldSection, "TypeDescriptor");
  11380. Address(fieldSection,0);
  11381. Info(source, "FieldArray ref");
  11382. Symbol(source, fieldSection, fieldSection.pc, 0);
  11383. FieldArray(fieldSection);
  11384. Global.GetSymbolSegmentedName(td,name);
  11385. Basic.AppendToSegmentedName(name,"@Procedures");
  11386. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11387. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11388. Info(fieldSection, "HeapBlock");
  11389. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11390. Info(fieldSection, "TypeDescriptor");
  11391. Address(fieldSection,0);
  11392. Info(source, "Procedure Array ref");
  11393. Symbol(source, fieldSection, fieldSection.pc, 0);
  11394. ProcedureArray(fieldSection);
  11395. *)
  11396. RETURN source;
  11397. END NewTypeDescriptorInfo;
  11398. PROCEDURE NewTypeDescriptor;
  11399. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11400. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11401. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11402. numberPointers: LONGINT; padding, i: LONGINT;
  11403. CONST MPO=-40000000H;
  11404. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11405. VAR i: LONGINT;
  11406. PROCEDURE Td(record: SyntaxTree.RecordType);
  11407. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11408. BEGIN
  11409. IF record # NIL THEN
  11410. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11411. baseTD := record.typeDeclaration;
  11412. Global.GetSymbolSegmentedName(baseTD,name);
  11413. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11414. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11415. ELSE
  11416. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11417. END;
  11418. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11419. Symbol(source, tir, 0, offset);
  11420. IF reverse THEN Td(record.GetBaseRecord()) END;
  11421. END;
  11422. END Td;
  11423. BEGIN
  11424. Info(source, "tag table");
  11425. baseRecord := recordType;
  11426. i := 0;
  11427. WHILE baseRecord # NIL DO
  11428. INC(i);
  11429. baseRecord := baseRecord.GetBaseRecord();
  11430. END;
  11431. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11432. IF ~reverse THEN Td(recordType) END;
  11433. WHILE i < size DO
  11434. Address(source,0);
  11435. INC(i);
  11436. END;
  11437. IF reverse THEN Td(recordType) END;
  11438. END TdTable;
  11439. PROCEDURE MethodTable(reverse: BOOLEAN);
  11440. VAR i,methods: LONGINT;
  11441. BEGIN
  11442. Info(source, "method table");
  11443. IF recordType # NIL THEN
  11444. methods := recordType.recordScope.numberMethods;
  11445. IF reverse THEN
  11446. FOR i := methods-1 TO 0 BY -1 DO
  11447. procedure := recordType.recordScope.FindMethod(i);
  11448. Global.GetSymbolSegmentedName(procedure, name);
  11449. NamedSymbol(source, name,procedure, 0,0);
  11450. END;
  11451. ELSE
  11452. FOR i := 0 TO methods-1 DO
  11453. procedure := recordType.recordScope.FindMethod(i);
  11454. Global.GetSymbolSegmentedName(procedure, name);
  11455. NamedSymbol(source, name,procedure, 0,0);
  11456. END;
  11457. END;
  11458. END;
  11459. END MethodTable;
  11460. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11461. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11462. BEGIN
  11463. Info(source, "method table");
  11464. baseRecord := recordType;
  11465. WHILE baseRecord.baseType # NIL DO
  11466. baseRecord := baseRecord.GetBaseRecord ();
  11467. END;
  11468. GetRecordTypeName (baseRecord, name);
  11469. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11470. IF name = stackFrame THEN
  11471. start := 0;
  11472. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11473. baseRecord := recordType;
  11474. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11475. baseRecord := baseRecord.GetBaseRecord ();
  11476. END;
  11477. IF baseRecord # NIL THEN
  11478. GetRecordTypeName (baseRecord, name);
  11479. IF pointer & ~baseRecord.isObject THEN
  11480. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11481. END;
  11482. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11483. ELSIF recordType.isObject THEN
  11484. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11485. ELSIF pointer THEN
  11486. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11487. ELSE
  11488. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11489. END;
  11490. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11491. Symbol(source, tir, 0, 0);
  11492. start := 0;
  11493. baseRecord := recordType;
  11494. WHILE (baseRecord # NIL) DO
  11495. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11496. baseRecord := baseRecord.GetBaseRecord ();
  11497. END;
  11498. ELSE
  11499. (* explicit trace method: *)
  11500. procedure := recordType.recordScope.FindMethod(0);
  11501. IF ~procedure.isFinalizer THEN
  11502. Global.GetSymbolSegmentedName(procedure, name);
  11503. NamedSymbol(source, name,procedure, 0,0);
  11504. END;
  11505. start := 1;
  11506. END;
  11507. IF (name # stackFrame) & recordType.isObject THEN
  11508. baseRecord := recordType;
  11509. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11510. baseRecord := baseRecord.GetBaseRecord ();
  11511. END;
  11512. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11513. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11514. ELSE
  11515. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11516. END;
  11517. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11518. Symbol(source, tir, 0, 0);
  11519. END;
  11520. methods := recordType.recordScope.numberMethods;
  11521. FOR i := start TO methods-1 DO
  11522. procedure := recordType.recordScope.FindMethod(i);
  11523. IF ~procedure.isFinalizer THEN
  11524. Global.GetSymbolSegmentedName(procedure, name);
  11525. NamedSymbol(source, name,procedure, 0,0);
  11526. END;
  11527. END;
  11528. END CooperativeMethodTable;
  11529. BEGIN
  11530. Global.GetSymbolSegmentedName(td,name);
  11531. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11532. source.SetExported(IsExported(td));
  11533. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11534. IF implementationVisitor.backend.cooperative THEN
  11535. base := NIL;
  11536. baseRecord := recordType.GetBaseRecord();
  11537. IF baseRecord # NIL THEN
  11538. baseTD := baseRecord.typeDeclaration;
  11539. END;
  11540. IF ~recordType.isObject THEN
  11541. Info(source, "parent");
  11542. IF baseRecord # NIL THEN
  11543. Global.GetSymbolSegmentedName(baseTD,name);
  11544. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11545. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11546. ELSE
  11547. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11548. END;
  11549. Symbol(source, tir, 0, 0);
  11550. ELSE
  11551. Address(source,0);
  11552. END;
  11553. Info(source, "record size");
  11554. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11555. source.SetReferenced(FALSE);
  11556. CooperativeMethodTable(FALSE);
  11557. base := source;
  11558. Global.GetSymbolSegmentedName(td,name);
  11559. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11560. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11561. source.SetExported(IsExported(td));
  11562. source.SetReferenced(FALSE);
  11563. END;
  11564. Info(source, "parent");
  11565. IF baseRecord # NIL THEN
  11566. Global.GetSymbolSegmentedName(baseTD,name);
  11567. sym := baseTD;
  11568. IF ~recordType.isObject THEN
  11569. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11570. sym := NIL;
  11571. END;
  11572. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11573. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11574. ELSE
  11575. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11576. END;
  11577. Symbol(source, tir, 0, 0);
  11578. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11579. Address(source,0);
  11580. ELSE
  11581. IF recordType.isObject THEN
  11582. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11583. ELSE
  11584. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11585. END;
  11586. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11587. Symbol(source, tir, 0, 0);
  11588. END;
  11589. Info(source, "base record descriptor");
  11590. Symbol(source, base, 0, 0);
  11591. CooperativeMethodTable(TRUE);
  11592. source.SetReferenced(FALSE);
  11593. IF recordType.hasPointers THEN
  11594. IF ~HasExplicitTraceMethod (recordType) THEN
  11595. implementationVisitor.CreateTraceMethod(recordType);
  11596. END;
  11597. implementationVisitor.CreateResetProcedure(recordType);
  11598. implementationVisitor.CreateAssignProcedure(recordType);
  11599. END;
  11600. ELSIF ~simple THEN
  11601. (*
  11602. MethodEnd = MPO
  11603. ---
  11604. methods (# methods)
  11605. ---
  11606. tags (16)
  11607. ---
  11608. TypeDesc = TypeInfoAdr
  11609. ---
  11610. td adr ---> rec size
  11611. ----
  11612. pointer offsets
  11613. ----
  11614. (padding)
  11615. -----
  11616. empty [2 addresses aligned]
  11617. empty
  11618. empty
  11619. numPtrs
  11620. ---
  11621. pointer offsets
  11622. ---
  11623. *)
  11624. Info(source, "MethodEnd = MPO");
  11625. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11626. source(IntermediateCode.Section).Emit(Data(-1,op));
  11627. MethodTable(TRUE);
  11628. TdTable(TypeTags, TRUE);
  11629. Info(source, "type descriptor info pointer");
  11630. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11631. IF (cellType # NIL) THEN
  11632. IF cellType.sizeInBits < 0 THEN
  11633. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11634. END;
  11635. Info(source, "cell size");
  11636. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11637. ELSE
  11638. Info(source, "record size");
  11639. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11640. END;
  11641. Info(source, "pointer offsets pointer");
  11642. padding := 1- source.pc MOD 2;
  11643. Symbol(source, source, source.pc+1+padding,0);
  11644. IF padding >0 THEN
  11645. Info(source, "padding");
  11646. FOR i := 1 TO padding DO Address(source,0) END;
  11647. END;
  11648. IF cellType # NIL THEN
  11649. PointerArray(source, cellType.cellScope, numberPointers);
  11650. ELSE
  11651. PointerArray(source, recordType.recordScope, numberPointers);
  11652. END;
  11653. ELSE
  11654. (*
  11655. simple:
  11656. td adr --> size
  11657. tag(1)
  11658. tag(2)
  11659. tag(3)
  11660. methods ->
  11661. *)
  11662. Info(source, "record size");
  11663. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11664. TdTable(TypeTags, FALSE);
  11665. MethodTable(FALSE);
  11666. source.SetReferenced(FALSE);
  11667. END;
  11668. END NewTypeDescriptor;
  11669. BEGIN
  11670. x := x.resolved;
  11671. IF (x IS SyntaxTree.PointerType) THEN
  11672. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11673. END;
  11674. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11675. recordType := x(SyntaxTree.RecordType);
  11676. td := x.typeDeclaration;
  11677. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11678. ASSERT(td # NIL);
  11679. section := module.allSections.FindBySymbol(td); (* TODO *)
  11680. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11681. IF implementationVisitor.newObjectFile THEN
  11682. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11683. NewTypeDescriptor
  11684. END;
  11685. ELSE
  11686. (* data section in intermediate code *)
  11687. Global.GetSymbolSegmentedName(td,name);
  11688. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11689. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11690. ELSE
  11691. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11692. END;
  11693. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11694. tir.Emit(Data(-1,op));
  11695. END;
  11696. END;
  11697. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11698. cellType := x(SyntaxTree.CellType);
  11699. td := x.typeDeclaration;
  11700. section := module.allSections.FindBySymbol(td); (* TODO *)
  11701. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11702. IF implementationVisitor.newObjectFile THEN
  11703. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11704. NewTypeDescriptor
  11705. END;
  11706. END;
  11707. END;
  11708. END
  11709. END CheckTypeDeclaration
  11710. END MetaDataGenerator;
  11711. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11712. VAR
  11713. trace-: BOOLEAN;
  11714. traceString-: SyntaxTree.IdentifierString;
  11715. traceModuleName-: SyntaxTree.IdentifierString;
  11716. newObjectFile-: BOOLEAN;
  11717. profile-: BOOLEAN;
  11718. noRuntimeChecks: BOOLEAN;
  11719. simpleMetaData-: BOOLEAN;
  11720. noAsserts: BOOLEAN;
  11721. optimize-: BOOLEAN;
  11722. cooperative-: BOOLEAN;
  11723. preregisterStatic-: BOOLEAN;
  11724. dump-: Basic.Writer;
  11725. cellsAreObjects: BOOLEAN;
  11726. PROCEDURE &InitIntermediateBackend*;
  11727. BEGIN
  11728. simpleMetaData := FALSE;
  11729. newObjectFile := FALSE;
  11730. InitBackend;
  11731. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11732. SetTraceModuleName(DefaultTraceModuleName);
  11733. END InitIntermediateBackend;
  11734. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11735. VAR
  11736. declarationVisitor: DeclarationVisitor;
  11737. implementationVisitor: ImplementationVisitor;
  11738. module: Sections.Module;
  11739. name, platformName: SyntaxTree.IdentifierString;
  11740. meta: MetaDataGenerator;
  11741. BEGIN
  11742. ResetError;
  11743. Global.GetSymbolName(x,name);
  11744. NEW(module,x,system); (* backend structures *)
  11745. Global.GetModuleName(x, name);
  11746. module.SetModuleName(name);
  11747. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11748. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11749. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11750. declarationVisitor.Module(x,module);
  11751. IF newObjectFile & ~meta.simple THEN
  11752. meta.Module(implementationVisitor.moduleBodySection);
  11753. END;
  11754. GetDescription(platformName);
  11755. module.SetPlatformName(platformName);
  11756. RETURN module
  11757. END GenerateIntermediate;
  11758. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11759. BEGIN RETURN TRUE
  11760. END SupportedImmediate;
  11761. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11762. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11763. END ProcessSyntaxTreeModule;
  11764. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11765. VAR
  11766. result: Sections.Module;
  11767. traceName: Basic.MessageString;
  11768. BEGIN
  11769. ASSERT(intermediateCodeModule IS Sections.Module);
  11770. result := intermediateCodeModule(Sections.Module);
  11771. IF trace THEN
  11772. traceName := "intermediate code trace: ";
  11773. Strings.Append(traceName,traceString);
  11774. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11775. IF (traceString="") OR (traceString="*") THEN
  11776. result.Dump(dump);
  11777. dump.Update
  11778. ELSE
  11779. Sections.DumpFiltered(dump, result, traceString);
  11780. END
  11781. END;
  11782. RETURN result
  11783. END ProcessIntermediateCodeModule;
  11784. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11785. BEGIN instructionSet := "Intermediate";
  11786. END GetDescription;
  11787. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11788. BEGIN
  11789. SELF.newObjectFile := newObjectFile;
  11790. SELF.simpleMetaData := simpleMetaData;
  11791. END SetNewObjectFile;
  11792. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11793. BEGIN COPY(name, traceModuleName)
  11794. END SetTraceModuleName;
  11795. PROCEDURE DefineOptions(options: Options.Options);
  11796. BEGIN
  11797. DefineOptions^(options);
  11798. options.Add(0X,"trace",Options.String);
  11799. options.Add(0X,"runtime",Options.String);
  11800. options.Add(0X,"newObjectFile",Options.Flag);
  11801. options.Add(0X,"traceModule",Options.String);
  11802. options.Add(0X,"profile",Options.Flag);
  11803. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11804. options.Add(0X,"noAsserts",Options.Flag);
  11805. options.Add(0X,"metaData",Options.String);
  11806. options.Add('o',"optimize", Options.Flag);
  11807. options.Add(0X,"preregisterStatic", Options.Flag);
  11808. options.Add(0X,"cellsAreObjects", Options.Flag);
  11809. END DefineOptions;
  11810. PROCEDURE GetOptions(options: Options.Options);
  11811. VAR name,string: SyntaxTree.IdentifierString;
  11812. BEGIN
  11813. GetOptions^(options);
  11814. trace := options.GetString("trace",traceString);
  11815. profile := options.GetFlag("profile");
  11816. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11817. noAsserts := options.GetFlag("noAsserts");
  11818. cooperative := options.GetFlag("cooperative");
  11819. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11820. IF cooperative THEN
  11821. SetRuntimeModuleName("CPU") END
  11822. END;
  11823. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11824. simpleMetaData := TRUE
  11825. END;
  11826. IF options.GetString("metaData",string) THEN
  11827. IF string = "simple" THEN simpleMetaData := TRUE
  11828. ELSIF string ="full" THEN simpleMetaData := FALSE
  11829. END;
  11830. END;
  11831. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11832. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11833. optimize := options.GetFlag("optimize");
  11834. preregisterStatic := options.GetFlag("preregisterStatic");
  11835. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11836. END GetOptions;
  11837. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11838. BEGIN RETURN SymbolFileFormat.Get()
  11839. END DefaultSymbolFileFormat;
  11840. END IntermediateBackend;
  11841. (* ----------------------------------- register allocation ------------------------------------- *)
  11842. (* register mapping scheme
  11843. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11844. spill offset
  11845. part(n) --> ticket <--> physical register
  11846. spill offset
  11847. *)
  11848. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11849. emptyOperand: IntermediateCode.Operand;
  11850. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11851. statCoopResetVariables: LONGINT;
  11852. statCoopModifyAssignments: LONGINT;
  11853. modifyAssignmentsPC : LONGINT;
  11854. statCoopNilCheck: LONGINT;
  11855. statCoopSwitch: LONGINT;
  11856. statCoopAssignProcedure: LONGINT;
  11857. statCoopTraceMethod: LONGINT;
  11858. statCoopResetProcedure: LONGINT;
  11859. statCoopTraceModule: LONGINT;
  11860. PROCEDURE ResetStatistics*;
  11861. BEGIN
  11862. statCoopResetVariables := 0;
  11863. statCoopModifyAssignments := 0;
  11864. statCoopNilCheck:= 0;
  11865. statCoopSwitch:= 0;
  11866. statCoopAssignProcedure:= 0;
  11867. statCoopTraceMethod:= 0;
  11868. statCoopResetProcedure:= 0;
  11869. statCoopTraceModule:= 0;
  11870. END ResetStatistics;
  11871. PROCEDURE Statistics*;
  11872. BEGIN
  11873. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11874. TRACE(statCoopNilCheck, statCoopSwitch);
  11875. TRACE(statCoopAssignProcedure,
  11876. statCoopTraceMethod,
  11877. statCoopResetProcedure,
  11878. statCoopTraceModule)
  11879. END Statistics;
  11880. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11881. VAR h: LONGINT;
  11882. BEGIN
  11883. WHILE b # 0 DO
  11884. h := a MOD b;
  11885. a := b;
  11886. b := h;
  11887. END;
  11888. RETURN a
  11889. END GCD;
  11890. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11891. BEGIN
  11892. RETURN a*b DIV GCD(a,b)
  11893. END SCM;
  11894. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11895. BEGIN
  11896. (*TRACE(a,b);*)
  11897. IF a = 0 THEN RETURN b
  11898. ELSIF b = 0 THEN RETURN a
  11899. ELSE RETURN SCM(a,b)
  11900. END;
  11901. END CommonAlignment;
  11902. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11903. BEGIN
  11904. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11905. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11906. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11907. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11908. 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)
  11909. END
  11910. END PassBySingleReference;
  11911. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11912. BEGIN
  11913. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11914. END PassInRegister;
  11915. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11916. VAR new: RegisterEntry;
  11917. BEGIN
  11918. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11919. IF queue = NIL THEN
  11920. queue := new
  11921. ELSE
  11922. new.next := queue;
  11923. IF queue#NIL THEN queue.prev := new END;
  11924. queue := new
  11925. END;
  11926. END AddRegisterEntry;
  11927. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11928. VAR this: RegisterEntry;
  11929. BEGIN
  11930. this := queue;
  11931. WHILE (this # NIL) & (this.register # register) DO
  11932. this := this.next;
  11933. END;
  11934. IF this = NIL THEN
  11935. RETURN FALSE
  11936. END;
  11937. ASSERT(this # NIL);
  11938. IF this = queue THEN queue := queue.next END;
  11939. IF this.prev # NIL THEN this.prev.next := this.next END;
  11940. IF this.next # NIL THEN this.next.prev := this.prev END;
  11941. RETURN TRUE
  11942. END RemoveRegisterEntry;
  11943. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11944. BEGIN ASSERT(cond);
  11945. END Assert;
  11946. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11947. BEGIN
  11948. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11949. END ReusableRegister;
  11950. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11951. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11952. BEGIN
  11953. procedure := moduleScope.bodyProcedure;
  11954. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11955. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11956. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11957. procedure.SetScope(moduleScope);
  11958. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11959. procedure.SetAccess(SyntaxTree.Hidden);
  11960. moduleScope.SetBodyProcedure(procedure);
  11961. moduleScope.AddProcedure(procedure);
  11962. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11963. END;
  11964. END EnsureBodyProcedure;
  11965. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11966. VAR import: SyntaxTree.Import;
  11967. selfName: SyntaxTree.IdentifierString;
  11968. module: SyntaxTree.Module;
  11969. BEGIN
  11970. scope.ownerModule.GetName(selfName);
  11971. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11972. module := scope.ownerModule
  11973. ELSE
  11974. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11975. IF import = NIL THEN
  11976. RETURN NIL
  11977. ELSIF import.module = NIL THEN
  11978. RETURN NIL
  11979. ELSE module := import.module
  11980. END;
  11981. END;
  11982. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11983. END GetSymbol;
  11984. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11985. BEGIN
  11986. op.mode := mode;
  11987. IntermediateCode.InitOperand(op.op);
  11988. IntermediateCode.InitOperand(op.tag);
  11989. IntermediateCode.InitOperand(op.extra);
  11990. op.dimOffset := 0;
  11991. END InitOperand;
  11992. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11993. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11994. BEGIN RETURN IntermediateCode.GetType(system, type)
  11995. END GetType;
  11996. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11997. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11998. BEGIN
  11999. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12000. (*
  12001. UniqueId(name,module,name,adr);
  12002. *)
  12003. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  12004. constant.SetValue(value);
  12005. module.moduleScope.AddConstant(constant);
  12006. constant.SetScope(module.moduleScope);
  12007. RETURN constant
  12008. END BuildConstant;
  12009. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12010. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12011. BEGIN
  12012. variable := scope.firstVariable;
  12013. WHILE variable # NIL DO
  12014. IF variable.NeedsTrace() THEN
  12015. RETURN TRUE;
  12016. END;
  12017. variable := variable.nextVariable;
  12018. END;
  12019. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12020. WHILE parameter # NIL DO
  12021. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12022. RETURN TRUE;
  12023. END;
  12024. parameter := parameter.nextParameter;
  12025. END;
  12026. RETURN FALSE;
  12027. END HasPointers;
  12028. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12029. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  12030. END IsVariableParameter;
  12031. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12032. VAR parameter: SyntaxTree.Parameter;
  12033. BEGIN
  12034. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12035. WHILE parameter # NIL DO
  12036. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12037. IF parameter.movable THEN RETURN TRUE END;
  12038. parameter := parameter.nextParameter;
  12039. END;
  12040. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12041. END HasVariableParameters;
  12042. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12043. BEGIN
  12044. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12045. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12046. END HasExplicitTraceMethod;
  12047. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12048. BEGIN
  12049. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12050. IF (expression IS SyntaxTree.IntegerValue) THEN
  12051. val := expression(SyntaxTree.IntegerValue).value;
  12052. RETURN TRUE
  12053. ELSE
  12054. RETURN FALSE
  12055. END;
  12056. END IsIntegerConstant;
  12057. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12058. BEGIN
  12059. IF val <= 0 THEN RETURN FALSE END;
  12060. exp := 0;
  12061. WHILE ~ODD(val) DO
  12062. val := val DIV 2;
  12063. INC(exp)
  12064. END;
  12065. RETURN val = 1
  12066. END PowerOf2;
  12067. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12068. VAR procedure: SyntaxTree.Procedure;
  12069. BEGIN
  12070. procedure := record.recordScope.constructor;
  12071. IF procedure = NIL THEN
  12072. record := record.GetBaseRecord();
  12073. IF record # NIL THEN
  12074. procedure := GetConstructor(record)
  12075. END;
  12076. END;
  12077. RETURN procedure;
  12078. END GetConstructor;
  12079. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12080. BEGIN
  12081. value := SHORT(op.intValue);
  12082. RETURN op.mode = IntermediateCode.ModeImmediate;
  12083. END IsIntegerImmediate;
  12084. (** whether a type strictily is a pointer to record or object type
  12085. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12086. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12087. BEGIN
  12088. IF type = NIL THEN
  12089. RETURN FALSE
  12090. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12091. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12092. ELSE
  12093. RETURN FALSE
  12094. END
  12095. END IsStrictlyPointerToRecord;
  12096. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12097. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12098. END IsUnsafePointer;
  12099. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12100. BEGIN type := type.resolved;
  12101. IF type IS SyntaxTree.PointerType THEN
  12102. type := type(SyntaxTree.PointerType).pointerBase;
  12103. type := type.resolved;
  12104. IF type IS SyntaxTree.RecordType THEN
  12105. recordType := type(SyntaxTree.RecordType);
  12106. RETURN TRUE
  12107. ELSE
  12108. RETURN FALSE
  12109. END
  12110. ELSIF type IS SyntaxTree.RecordType THEN
  12111. recordType := type(SyntaxTree.RecordType);
  12112. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12113. ELSIF type IS SyntaxTree.ObjectType THEN
  12114. RETURN TRUE
  12115. ELSIF type IS SyntaxTree.AnyType THEN
  12116. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12117. ELSE
  12118. RETURN FALSE
  12119. END;
  12120. END IsPointerToRecord;
  12121. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12122. BEGIN
  12123. type := type.resolved;
  12124. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12125. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12126. END IsArrayOfSystemByte;
  12127. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12128. BEGIN
  12129. IF type = NIL THEN RETURN FALSE END;
  12130. type := type.resolved;
  12131. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12132. END IsOpenArray;
  12133. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12134. BEGIN
  12135. IF type = NIL THEN RETURN FALSE END;
  12136. type := type.resolved;
  12137. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12138. END IsSemiDynamicArray;
  12139. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12140. BEGIN
  12141. IF type = NIL THEN RETURN FALSE END;
  12142. type := type.resolved;
  12143. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12144. END IsStaticArray;
  12145. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12146. VAR size: LONGINT;
  12147. BEGIN
  12148. size := 1;
  12149. WHILE (IsStaticArray(type)) DO
  12150. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12151. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12152. END;
  12153. RETURN size;
  12154. END StaticArrayNumElements;
  12155. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12156. BEGIN
  12157. WHILE (IsStaticArray(type)) DO
  12158. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12159. END;
  12160. RETURN type;
  12161. END StaticArrayBaseType;
  12162. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12163. BEGIN
  12164. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12165. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12166. END;
  12167. RETURN type;
  12168. END ArrayBaseType;
  12169. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12170. BEGIN
  12171. IF type = NIL THEN RETURN FALSE END;
  12172. type := type.resolved;
  12173. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12174. END IsDelegate;
  12175. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12176. VAR i: LONGINT;
  12177. BEGIN
  12178. i := 0; type := type.resolved;
  12179. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12180. INC(i);
  12181. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12182. END;
  12183. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12184. INC(i);
  12185. type := type(SyntaxTree.MathArrayType).arrayBase;
  12186. IF type # NIL THEN type := type.resolved END;
  12187. END;
  12188. RETURN i
  12189. END DynamicDim;
  12190. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12191. BEGIN
  12192. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12193. type := type(SyntaxTree.ArrayType).arrayBase;
  12194. END;
  12195. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12196. type := type(SyntaxTree.MathArrayType).arrayBase;
  12197. END;
  12198. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12199. END StaticSize;
  12200. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12201. BEGIN
  12202. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12203. END IsImmediate;
  12204. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12205. BEGIN
  12206. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12207. END IsAddress;
  12208. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12209. BEGIN
  12210. RETURN (x.mode = IntermediateCode.ModeRegister);
  12211. END IsRegister;
  12212. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12213. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12214. BEGIN
  12215. typeDeclaration := recordType.typeDeclaration;
  12216. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12217. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12218. END GetRecordTypeName;
  12219. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12220. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12221. BEGIN
  12222. parSize := 0;
  12223. IF StructuredReturnType(procedureType) THEN
  12224. parameter := procedureType.returnParameter;
  12225. INC(parSize,system.SizeOfParameter(parameter));
  12226. parSize := parSize + (-parSize) MOD system.addressSize;
  12227. END;
  12228. parameter :=procedureType.lastParameter;
  12229. WHILE (parameter # NIL) DO
  12230. INC(parSize,system.SizeOfParameter(parameter));
  12231. parSize := parSize + (-parSize) MOD system.addressSize;
  12232. parameter := parameter.prevParameter;
  12233. END;
  12234. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12235. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12236. RETURN ToMemoryUnits(system,parSize)
  12237. END ParametersSize;
  12238. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12239. BEGIN
  12240. IF type = NIL THEN RETURN FALSE
  12241. ELSE
  12242. type := type.resolved;
  12243. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12244. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12245. END
  12246. END ReturnedAsParameter;
  12247. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12248. BEGIN
  12249. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12250. END StructuredReturnType;
  12251. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12252. BEGIN
  12253. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12254. END IsNested;
  12255. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12256. BEGIN
  12257. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12258. scope := scope.outerScope;
  12259. END;
  12260. RETURN scope # NIL;
  12261. END InCellScope;
  12262. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12263. BEGIN
  12264. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12265. RETURN 0
  12266. ELSE
  12267. *)
  12268. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12269. (*END;*)
  12270. END ProcedureParametersSize;
  12271. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12272. VAR dataUnit: LONGINT;
  12273. BEGIN dataUnit := system.dataUnit;
  12274. ASSERT(size MOD system.dataUnit = 0);
  12275. RETURN size DIV system.dataUnit
  12276. END ToMemoryUnits;
  12277. PROCEDURE Get*(): Backend.Backend;
  12278. VAR backend: IntermediateBackend;
  12279. BEGIN NEW(backend); RETURN backend
  12280. END Get;
  12281. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12282. VAR instruction: IntermediateCode.Instruction;
  12283. BEGIN
  12284. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12285. RETURN instruction
  12286. END Nop;
  12287. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12288. VAR instruction: IntermediateCode.Instruction;
  12289. BEGIN
  12290. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12291. RETURN instruction
  12292. END Mov;
  12293. (* like Mov but ensures that no new register will be allocated for dest *)
  12294. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12295. VAR instruction: IntermediateCode.Instruction;
  12296. BEGIN
  12297. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12298. RETURN instruction
  12299. END MovReplace;
  12300. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12301. VAR instruction: IntermediateCode.Instruction;
  12302. BEGIN
  12303. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12304. RETURN instruction
  12305. END Conv;
  12306. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12307. VAR instruction: IntermediateCode.Instruction;
  12308. BEGIN
  12309. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12310. RETURN instruction
  12311. END Call;
  12312. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12313. VAR op1, op2: IntermediateCode.Operand;
  12314. VAR instruction: IntermediateCode.Instruction;
  12315. BEGIN
  12316. IntermediateCode.InitNumber(op1,pcOffset);
  12317. IntermediateCode.InitNumber(op2,callingConvention);
  12318. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12319. RETURN instruction
  12320. END Exit;
  12321. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12322. VAR instruction: IntermediateCode.Instruction;
  12323. BEGIN
  12324. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12325. RETURN instruction
  12326. END Return;
  12327. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12328. VAR instruction: IntermediateCode.Instruction;
  12329. BEGIN
  12330. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12331. RETURN instruction
  12332. END Result;
  12333. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12334. VAR op1: IntermediateCode.Operand;
  12335. VAR instruction: IntermediateCode.Instruction;
  12336. BEGIN
  12337. IntermediateCode.InitNumber(op1,nr);
  12338. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12339. RETURN instruction
  12340. END Trap;
  12341. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12342. VAR instruction: IntermediateCode.Instruction;
  12343. BEGIN
  12344. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12345. RETURN instruction
  12346. END Br;
  12347. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12348. VAR instruction: IntermediateCode.Instruction;
  12349. BEGIN
  12350. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12351. RETURN instruction
  12352. END Breq;
  12353. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12354. VAR instruction: IntermediateCode.Instruction;
  12355. BEGIN
  12356. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12357. RETURN instruction
  12358. END Brne;
  12359. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12360. VAR instruction: IntermediateCode.Instruction;
  12361. BEGIN
  12362. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12363. RETURN instruction
  12364. END Brge;
  12365. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12366. VAR instruction: IntermediateCode.Instruction;
  12367. BEGIN
  12368. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12369. RETURN instruction
  12370. END Brlt;
  12371. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12372. VAR instruction: IntermediateCode.Instruction;
  12373. BEGIN
  12374. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12375. RETURN instruction
  12376. END Pop;
  12377. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12378. VAR instruction: IntermediateCode.Instruction;
  12379. BEGIN
  12380. ASSERT(op.mode # IntermediateCode.Undefined);
  12381. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12382. RETURN instruction
  12383. END Push;
  12384. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12385. VAR instruction: IntermediateCode.Instruction;
  12386. BEGIN
  12387. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12388. RETURN instruction
  12389. END Neg;
  12390. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12391. VAR instruction: IntermediateCode.Instruction;
  12392. BEGIN
  12393. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12394. RETURN instruction
  12395. END Not;
  12396. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12397. VAR instruction: IntermediateCode.Instruction;
  12398. BEGIN
  12399. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12400. RETURN instruction
  12401. END Abs;
  12402. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12403. VAR instruction: IntermediateCode.Instruction;
  12404. BEGIN
  12405. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12406. RETURN instruction
  12407. END Mul;
  12408. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12409. VAR instruction: IntermediateCode.Instruction;
  12410. BEGIN
  12411. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12412. RETURN instruction
  12413. END Div;
  12414. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12415. VAR instruction: IntermediateCode.Instruction;
  12416. BEGIN
  12417. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12418. RETURN instruction
  12419. END Mod;
  12420. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12421. VAR instruction: IntermediateCode.Instruction;
  12422. BEGIN
  12423. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12424. RETURN instruction
  12425. END Sub;
  12426. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12427. VAR instruction: IntermediateCode.Instruction;
  12428. BEGIN
  12429. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12430. RETURN instruction
  12431. END Add;
  12432. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12433. VAR instruction: IntermediateCode.Instruction;
  12434. BEGIN
  12435. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12436. RETURN instruction
  12437. END And;
  12438. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12439. VAR instruction: IntermediateCode.Instruction;
  12440. BEGIN
  12441. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12442. RETURN instruction
  12443. END Or;
  12444. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12445. VAR instruction: IntermediateCode.Instruction;
  12446. BEGIN
  12447. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12448. RETURN instruction
  12449. END Xor;
  12450. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12451. VAR instruction: IntermediateCode.Instruction;
  12452. BEGIN
  12453. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12454. RETURN instruction
  12455. END Shl;
  12456. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12457. VAR instruction: IntermediateCode.Instruction;
  12458. BEGIN
  12459. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12460. RETURN instruction
  12461. END Shr;
  12462. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12463. VAR instruction: IntermediateCode.Instruction;
  12464. BEGIN
  12465. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12466. RETURN instruction
  12467. END Rol;
  12468. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12469. VAR instruction: IntermediateCode.Instruction;
  12470. BEGIN
  12471. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12472. RETURN instruction
  12473. END Ror;
  12474. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12475. VAR instruction: IntermediateCode.Instruction;
  12476. BEGIN
  12477. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12478. RETURN instruction
  12479. END Cas;
  12480. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12481. VAR instruction: IntermediateCode.Instruction;
  12482. BEGIN
  12483. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12484. RETURN instruction
  12485. END Copy;
  12486. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12487. VAR instruction: IntermediateCode.Instruction;
  12488. BEGIN
  12489. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12490. RETURN instruction
  12491. END Fill;
  12492. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12493. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12494. BEGIN
  12495. string := IntermediateCode.String(s);
  12496. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12497. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12498. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12499. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12500. RETURN instruction
  12501. END Asm;
  12502. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12503. VAR instruction: IntermediateCode.Instruction;
  12504. BEGIN
  12505. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12506. RETURN instruction
  12507. END Data;
  12508. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12509. VAR instruction: IntermediateCode.Instruction;
  12510. BEGIN
  12511. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12512. IntermediateCode.SetSubType(instruction, subtype);
  12513. RETURN instruction
  12514. END SpecialInstruction;
  12515. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12516. VAR op1: IntermediateCode.Operand;
  12517. VAR instruction: IntermediateCode.Instruction;
  12518. BEGIN
  12519. (*! generate a warning if size exceeds a certain limit *)
  12520. (*
  12521. ASSERT(bytes < 1000000); (* sanity check *)
  12522. *)
  12523. ASSERT(0 <= units); (* sanity check *)
  12524. IntermediateCode.InitNumber(op1,units);
  12525. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12526. RETURN instruction
  12527. END Reserve;
  12528. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12529. VAR op1: IntermediateCode.Operand;
  12530. VAR instruction: IntermediateCode.Instruction;
  12531. BEGIN
  12532. IntermediateCode.InitNumber(op1,position);
  12533. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12534. RETURN instruction
  12535. END LabelInstruction;
  12536. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12537. VAR pc: LONGINT;
  12538. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12539. BEGIN
  12540. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12541. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12542. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12543. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12544. IF instr.op1.type.form = IntermediateCode.Float THEN
  12545. RETURN instr.op1.floatValue = op.floatValue
  12546. ELSE
  12547. RETURN instr.op1.intValue = op.intValue
  12548. END;
  12549. END ProvidesValue;
  12550. BEGIN
  12551. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12552. pc := 0;
  12553. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12554. INC(pc);
  12555. END;
  12556. IF pc = data.pc THEN
  12557. data.Emit(Data(-1,vop));
  12558. END;
  12559. RETURN pc
  12560. END EnterImmediate;
  12561. PROCEDURE Init;
  12562. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12563. BEGIN
  12564. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12565. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12566. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12567. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12568. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12569. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12570. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12571. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12572. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12573. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12574. IntermediateCode.InitOperand(emptyOperand);
  12575. FOR i := 0 TO NumberSystemCalls-1 DO
  12576. name := "@SystemCall";
  12577. Basic.AppendNumber(name,i);
  12578. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12579. END;
  12580. END Init;
  12581. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12582. BEGIN
  12583. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12584. END IsExported;
  12585. BEGIN
  12586. Init;
  12587. END FoxIntermediateBackend.
  12588. Compiler.Compile FoxIntermediateBackend.Mod ~