FoxIntermediateBackend.Mod 547 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067
  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. registerParameter: Backend.Registers;
  522. registerParameters: LONGINT;
  523. registerClass: IntermediateCode.RegisterClass;
  524. type: IntermediateCode.Type;
  525. formalParameter: SyntaxTree.Parameter;
  526. recordType: SyntaxTree.RecordType;
  527. isModuleBody: BOOLEAN;
  528. PROCEDURE Signature;
  529. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  530. BEGIN
  531. procedureType := x.type(SyntaxTree.ProcedureType);
  532. returnType := procedureType.returnType;
  533. IF returnType # NIL THEN
  534. meta.CheckTypeDeclaration(returnType)
  535. END;
  536. parameter := procedureType.firstParameter;
  537. WHILE parameter # NIL DO
  538. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  539. parameter := parameter.nextParameter;
  540. END;
  541. END Signature;
  542. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  543. VAR result: BOOLEAN;
  544. BEGIN
  545. result := FALSE;
  546. IF x = SyntaxTree.invalidExpression THEN
  547. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  548. result := TRUE;
  549. value := x.resolved(SyntaxTree.IntegerValue).value;
  550. ELSE
  551. Error(x.position,"expression is not an integer constant");
  552. END;
  553. RETURN result;
  554. END CheckIntegerValue;
  555. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  556. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  557. BEGIN
  558. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  559. WHILE (this # NIL) & (this.identifier # id) DO
  560. this := this.nextModifier;
  561. END;
  562. IF this # NIL THEN
  563. IF this.expression = NIL THEN
  564. Error(this.position,"expected expression value");
  565. ELSIF CheckIntegerValue(this.expression,value) THEN
  566. END;
  567. RETURN TRUE
  568. ELSE RETURN FALSE
  569. END;
  570. END HasValue;
  571. CONST DefaultDataMemorySize=512;
  572. BEGIN
  573. IF x.externalName # NIL THEN RETURN END;
  574. (*
  575. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  576. *)
  577. (* code section for this procedure *)
  578. scope := x.procedureScope;
  579. prevScope := currentScope;
  580. currentScope := scope;
  581. procedureType := x.type(SyntaxTree.ProcedureType);
  582. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  583. implementationVisitor.temporaries.Init;
  584. implementationVisitor.usedRegisters := NIL;
  585. implementationVisitor.registerUsageCount.Init;
  586. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  587. IF (scope.body # NIL) & (x.isInline) THEN
  588. inline := TRUE;
  589. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  590. ir.SetExported(IsExported(x));
  591. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  592. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  593. IF backend.cellsAreObjects THEN
  594. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  595. ir.SetExported(IsExported(x));
  596. ELSE
  597. RETURN; (* cellnet cannot be compiled for final static hardware *)
  598. END;
  599. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  600. inline := FALSE;
  601. AddBodyCallStub(x);
  602. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  603. ir.SetExported(IsExported(x));
  604. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  605. inline := FALSE;
  606. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  607. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  608. AddBodyCallStub(x);
  609. AddStackAllocation(x,stackSize);
  610. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  611. ir.SetExported(IsExported(x));
  612. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  613. inline := FALSE;
  614. Parameters(procedureType.firstParameter);
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  616. ir.SetExported(IsExported(x));
  617. ELSE
  618. inline := FALSE;
  619. IF x.isEntry OR x.isExit THEN
  620. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  621. ir.SetExported(TRUE);
  622. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  623. ELSE
  624. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  625. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  626. END;
  627. END;
  628. cc := procedureType.callingConvention;
  629. IF scope.body # NIL THEN
  630. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  631. registerNumber := 0;
  632. IF ~inline THEN
  633. IF scope.lastVariable = NIL THEN
  634. stackSize := 0
  635. ELSE
  636. stackSize := scope.lastVariable.offsetInBits;
  637. IF stackSize <0 THEN stackSize := -stackSize END;
  638. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  639. END;
  640. (*
  641. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  642. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  643. *)
  644. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  645. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  646. END;
  647. pc := ir.pc-1;
  648. (*
  649. ir.Emit(Nop(position)); (* placeholder for fill *)
  650. *)
  651. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  652. registerParameter := backend.GetParameterRegisters(procedureType.callingConvention);
  653. IF registerParameter = NIL THEN registerParameters := 0
  654. ELSE registerParameters := LEN(registerParameter)
  655. END;
  656. formalParameter := procedureType.lastParameter;
  657. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  658. IF ~PassInRegister(formalParameter) THEN
  659. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  660. ELSE
  661. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, registerParameter[registerNumber]);
  662. type := GetType(system, formalParameter.type);
  663. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  664. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  665. ir.Emit(Mov(-1,dest, src));
  666. implementationVisitor.ReleaseIntermediateOperand(src);
  667. INC(registerNumber);
  668. formalParameter := formalParameter.prevParameter;
  669. END;
  670. END;
  671. END;
  672. ir.EnterValidPAF;
  673. END;
  674. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  675. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  676. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  677. IF scope.lastVariable # NIL THEN
  678. stackSize := scope.lastVariable.offsetInBits;
  679. IF stackSize <0 THEN stackSize := -stackSize END;
  680. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  681. END;
  682. END;
  683. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  684. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  685. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  686. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  687. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  688. ir.EmitAt(pc,Push(size));
  689. implementationVisitor.StaticCallOperand(result,procedure);
  690. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  691. END;
  692. *)
  693. END;
  694. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  695. IF stackSize > 0 THEN
  696. IF (stackSize MOD system.addressSize = 0) THEN
  697. null := IntermediateCode.Immediate(addressType,0);
  698. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  699. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  700. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  701. ELSE
  702. null := IntermediateCode.Immediate(int8,0);
  703. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  704. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  705. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  706. END;
  707. (*! should potentially be called by backend -- enter might initialize
  708. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  709. *)
  710. END;
  711. ir.ExitValidPAF;
  712. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  713. finalizer := FALSE;
  714. IF backend.cooperative & x.isFinalizer THEN
  715. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  716. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  717. GetRecordTypeName(recordType,name);
  718. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  719. END;
  720. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  721. IF backend.cooperative THEN
  722. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  723. IF implementationVisitor.profile & ~isModuleBody THEN
  724. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  725. END;
  726. END;
  727. implementationVisitor.EmitLeave(ir, x.position,cc);
  728. IF finalizer THEN
  729. IF backend.hasLinkRegister THEN
  730. ir.Emit(Pop(-1, implementationVisitor.lr));
  731. END;
  732. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  733. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  734. ir.Emit(Br(x.position,dest));
  735. ELSE
  736. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  737. END;
  738. ELSE
  739. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  740. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  741. END;
  742. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  743. IF backend.cooperative THEN
  744. IF HasPointers (scope) THEN
  745. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  746. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  747. ir.Emit(Result(x.position, res));
  748. ir.Emit(Push(x.position, res));
  749. implementationVisitor.ResetVariables(scope);
  750. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  751. ir.Emit(Pop(x.position, res));
  752. ir.Emit(Return(x.position, res));
  753. ELSE
  754. implementationVisitor.ResetVariables(scope);
  755. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  756. END;
  757. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  758. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  759. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  760. ir.Emit(Result(x.position, res));
  761. ir.Emit(Push(x.position, res));
  762. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  763. ir.Emit(Pop(x.position, res));
  764. ir.Emit(Return(x.position, res));
  765. ELSE
  766. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  767. END;
  768. END;
  769. implementationVisitor.EmitLeave(ir,x.position,cc);
  770. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  771. ELSE
  772. ir.Emit(Nop(x.position));
  773. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  774. implementationVisitor.EmitLeave(ir,x.position,cc);
  775. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  776. END;
  777. END;
  778. END
  779. END;
  780. ELSE (* force body for procedures *)
  781. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  782. ir.EnterValidPAF;
  783. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  784. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  785. ir.ExitValidPAF;
  786. implementationVisitor.EmitLeave(ir,x.position,cc);
  787. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  788. END;
  789. Scope(scope);
  790. Signature;
  791. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  792. currentScope := prevScope;
  793. END Procedure;
  794. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  795. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  796. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  797. BEGIN
  798. ASSERT (bodyProcedure # NIL);
  799. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  800. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  801. procedure.SetScope(bodyProcedure.scope);
  802. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  803. procedure.SetAccess(SyntaxTree.Hidden);
  804. Global.GetSymbolSegmentedName (procedure,name);
  805. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  806. ir.SetExported(TRUE);
  807. ir.SetPriority(InitPriority);
  808. Global.GetSymbolSegmentedName (bodyProcedure,name);
  809. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  810. implementationVisitor.currentScope := module.module.moduleScope;
  811. implementationVisitor.section := ir;
  812. implementationVisitor.PushSelfPointer();
  813. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  814. ELSIF backend.preregisterStatic THEN
  815. implementationVisitor.currentScope := module.module.moduleScope;
  816. implementationVisitor.section := ir;
  817. implementationVisitor.PushSelfPointer();
  818. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  819. ELSE
  820. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  821. ir.Emit(Call(bodyProcedure.position,op, 0));
  822. END;
  823. END AddBodyCallStub;
  824. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  825. VAR name: Basic.SegmentedName;
  826. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  827. BEGIN
  828. Global.GetSymbolSegmentedName (symbol,name);
  829. Basic.RemoveSuffix(name);
  830. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  831. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  832. ir.SetExported(TRUE);
  833. ir.SetPriority(FirstPriority);
  834. IntermediateCode.InitImmediate(op,addressType,initStack);
  835. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  836. END AddStackAllocation;
  837. (** entry function to visit a complete module *)
  838. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  839. VAR
  840. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  841. hasDynamicOperatorDeclarations: BOOLEAN;
  842. operator: SyntaxTree.Operator;
  843. import: SyntaxTree.Import;
  844. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  845. BEGIN
  846. type := type.resolved;
  847. IF type IS SyntaxTree.RecordType THEN
  848. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  849. ELSIF (type IS SyntaxTree.ArrayType) THEN
  850. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  851. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  852. END;
  853. ELSIF type IS SyntaxTree.MathArrayType THEN
  854. WITH type: SyntaxTree.MathArrayType DO
  855. IF type.form = SyntaxTree.Open THEN
  856. RETURN TRUE
  857. ELSIF type.form = SyntaxTree.Static THEN
  858. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  859. END;
  860. END;
  861. END;
  862. RETURN FALSE
  863. END TypeNeedsInitialization;
  864. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  865. VAR variable: SyntaxTree.Variable;
  866. BEGIN
  867. variable := scope.firstVariable;
  868. WHILE variable # NIL DO
  869. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  870. IF variable.initializer # NIL THEN RETURN TRUE END;
  871. variable := variable.nextVariable;
  872. END;
  873. RETURN FALSE
  874. END ScopeNeedsInitialization;
  875. BEGIN
  876. ASSERT(x # NIL); ASSERT(module # NIL);
  877. SELF.module := module;
  878. (* add import names to the generated Sections.Module *)
  879. import := x.moduleScope.firstImport;
  880. WHILE import # NIL DO
  881. import.module.GetName(idstr);
  882. module.imports.AddName(idstr);
  883. import := import.nextImport
  884. END;
  885. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  886. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  887. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  888. moduleSelf.SetType(system.anyType);
  889. moduleSelf.SetScope(x.moduleScope);
  890. moduleSelf.SetUntraced(TRUE);
  891. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  892. ir.SetExported(TRUE);
  893. IntermediateCode.InitImmediate(op,addressType,0);
  894. ir.Emit(Data(-1,op));
  895. END;
  896. implementationVisitor.module := module;
  897. implementationVisitor.moduleScope := x.moduleScope;
  898. implementationVisitor.moduleSelf := moduleSelf;
  899. implementationVisitor.canBeLoaded := TRUE;
  900. meta.SetModule(module);
  901. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  902. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  903. END;
  904. IF backend.profile THEN
  905. EnsureBodyProcedure(x.moduleScope);
  906. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  907. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  908. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  909. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  910. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  911. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  912. Global.GetModuleName(module.module,idstr);
  913. implementationVisitor.ProfilerAddModule(idstr);
  914. implementationVisitor.numberProcedures := 0;
  915. END;
  916. implementationVisitor.profile := backend.profile;
  917. (* check if there is at least one dynamic operator locally defined *)
  918. hasDynamicOperatorDeclarations := FALSE;
  919. operator := x.moduleScope.firstOperator;
  920. WHILE operator # NIL DO
  921. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  922. operator := operator.nextOperator
  923. END;
  924. (* add operator initialization code section *)
  925. IF hasDynamicOperatorDeclarations THEN
  926. EnsureBodyProcedure(x.moduleScope);
  927. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  928. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  929. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  930. END;
  931. Scope(x.moduleScope);
  932. IF hasDynamicOperatorDeclarations THEN
  933. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  934. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  935. END;
  936. IF backend.profile THEN
  937. implementationVisitor.ProfilerPatchInit;
  938. END;
  939. END Module;
  940. END DeclarationVisitor;
  941. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  942. RegisterUsageCount*=OBJECT
  943. VAR used: UsedArray; count: LONGINT;
  944. PROCEDURE &Init;
  945. VAR i: LONGINT;
  946. BEGIN
  947. count := 0;
  948. IF used = NIL THEN NEW(used,64); END;
  949. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  950. END Init;
  951. PROCEDURE Grow;
  952. VAR new: UsedArray; size,i: LONGINT;
  953. BEGIN
  954. size := LEN(used)*2;
  955. NEW(new,size);
  956. FOR i := 0 TO LEN(used)-1 DO
  957. new[i].count := used[i].count;
  958. new[i].type := used[i].type;
  959. new[i].map := used[i].map
  960. END;
  961. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  962. used := new
  963. END Grow;
  964. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  965. BEGIN
  966. INC(count);
  967. IF count = LEN(used) THEN Grow END;
  968. used[count].type := type;
  969. used[count].class := class;
  970. used[count].map := count;
  971. RETURN count;
  972. END Next;
  973. PROCEDURE IncUse(register: LONGINT);
  974. BEGIN
  975. INC(used[register].count);
  976. (*
  977. IF (register = 1) & (count > 30) THEN
  978. D.TraceBack;
  979. END;
  980. *)
  981. END IncUse;
  982. PROCEDURE DecUse(register: LONGINT);
  983. BEGIN
  984. DEC(used[register].count);
  985. END DecUse;
  986. PROCEDURE Map(register: LONGINT): LONGINT;
  987. VAR map : LONGINT;
  988. BEGIN
  989. IF register > 0 THEN
  990. map := used[register].map;
  991. WHILE register # map DO register := map; map := used[register].map END;
  992. END;
  993. RETURN register
  994. END Map;
  995. PROCEDURE Use(register: LONGINT): LONGINT;
  996. BEGIN
  997. IF register< LEN(used) THEN
  998. RETURN used[register].count
  999. ELSE
  1000. RETURN 0
  1001. END
  1002. END Use;
  1003. END RegisterUsageCount;
  1004. RegisterEntry = POINTER TO RECORD
  1005. prev,next: RegisterEntry;
  1006. register: LONGINT;
  1007. registerClass: IntermediateCode.RegisterClass;
  1008. type: IntermediateCode.Type;
  1009. END;
  1010. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1011. Variables = OBJECT (Basic.List)
  1012. VAR
  1013. inUse: VariableUse;
  1014. registerIndex: LONGINT;
  1015. PROCEDURE & Init;
  1016. VAR i: LONGINT;
  1017. BEGIN
  1018. InitList(16);
  1019. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1020. registerIndex := 1024;
  1021. END Init;
  1022. PROCEDURE GetUsage(VAR use: VariableUse);
  1023. BEGIN
  1024. use := inUse;
  1025. END GetUsage;
  1026. PROCEDURE SetUsage(CONST use: VariableUse);
  1027. BEGIN
  1028. inUse := use;
  1029. END SetUsage;
  1030. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1031. VAR any: ANY;
  1032. BEGIN
  1033. any := Get(i);;
  1034. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1035. END GetVariable;
  1036. PROCEDURE Occupy(pos: LONGINT);
  1037. BEGIN
  1038. INCL(inUse[pos DIV 32], pos MOD 32);
  1039. END Occupy;
  1040. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1041. BEGIN
  1042. Occupy(Length());
  1043. Add(v);
  1044. END AddVariable;
  1045. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  1046. VAR var : SyntaxTree.Variable;
  1047. BEGIN
  1048. FOR pos := 0 TO Length()-1 DO
  1049. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  1050. var := GetVariable(pos);
  1051. IF type.SameType(var.type) THEN
  1052. Occupy(pos); RETURN var
  1053. END;
  1054. END;
  1055. END;
  1056. pos := Length();
  1057. RETURN NIL
  1058. END GetFreeVariable;
  1059. END Variables;
  1060. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  1061. SymbolMapper = OBJECT
  1062. VAR
  1063. first: SymbolMap;
  1064. PROCEDURE & Init;
  1065. BEGIN
  1066. first := NIL;
  1067. END Init;
  1068. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  1069. VAR new: SymbolMap;
  1070. BEGIN
  1071. NEW(new); new.this := this; new.to := to; new.tag := tag;
  1072. new.next := first; first := new;
  1073. END Add;
  1074. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1075. VAR s: SymbolMap;
  1076. BEGIN
  1077. s := first;
  1078. WHILE (s # NIL) & (s.this # this) DO
  1079. s := s.next
  1080. END;
  1081. RETURN s
  1082. END Get;
  1083. END SymbolMapper;
  1084. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1085. VAR
  1086. system: Global.System;
  1087. section: IntermediateCode.Section;
  1088. module: Sections.Module;
  1089. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1090. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1091. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1092. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1093. checker: SemanticChecker.Checker;
  1094. backend: IntermediateBackend;
  1095. meta: MetaDataGenerator;
  1096. position: LONGINT;
  1097. moduleSelf: SyntaxTree.Variable;
  1098. (* variables for hand over of variables / temporary state *)
  1099. currentScope: SyntaxTree.Scope;
  1100. constantDeclaration : SyntaxTree.Symbol;
  1101. result: Operand; (* result of the most recent expression / statement *)
  1102. destination: IntermediateCode.Operand;
  1103. arrayDestinationTag: IntermediateCode.Operand;
  1104. arrayDestinationDimension:LONGINT;
  1105. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1106. conditional: BOOLEAN;
  1107. trueLabel, falseLabel, exitLabel: Label;
  1108. locked: BOOLEAN;
  1109. (*
  1110. usedRegisters: Registers;
  1111. *)
  1112. registerUsageCount: RegisterUsageCount;
  1113. usedRegisters: RegisterEntry;
  1114. (* useful operands and types *)
  1115. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1116. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1117. commentPrintout: Printout.Printer;
  1118. dump: Streams.Writer;
  1119. tagsAvailable : BOOLEAN;
  1120. supportedInstruction: SupportedInstructionProcedure;
  1121. supportedImmediate: SupportedImmediateProcedure;
  1122. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1123. emitLabels: BOOLEAN;
  1124. runtimeModuleName : SyntaxTree.IdentifierString;
  1125. newObjectFile: BOOLEAN;
  1126. indexCounter: LONGINT;
  1127. profile: BOOLEAN;
  1128. profileId, profileInit: IntermediateCode.Section;
  1129. profileInitPatchPosition: LONGINT;
  1130. numberProcedures: LONGINT;
  1131. procedureResultDesignator : SyntaxTree.Designator;
  1132. operatorInitializationCodeSection: IntermediateCode.Section;
  1133. fingerPrinter: FingerPrinter.FingerPrinter;
  1134. temporaries: Variables;
  1135. canBeLoaded : BOOLEAN;
  1136. currentIsInline: BOOLEAN;
  1137. currentMapper: SymbolMapper;
  1138. currentInlineExit: Label;
  1139. moduleBodySection: IntermediateCode.Section;
  1140. NeedDescriptor : BOOLEAN;
  1141. cooperativeSwitches: BOOLEAN;
  1142. lastSwitchPC: LONGINT;
  1143. isUnchecked: BOOLEAN;
  1144. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1145. newObjectFile: BOOLEAN);
  1146. BEGIN
  1147. SELF.system := system;
  1148. SELF.runtimeModuleName := runtime;
  1149. currentScope := NIL;
  1150. hiddenPointerType := NIL;
  1151. delegatePointerType := NIL;
  1152. awaitProcCounter := 0;
  1153. labelId := 0; constId := 0; labelId := 0;
  1154. SELF.checker := checker;
  1155. SELF.backend := backend;
  1156. position := Diagnostics.Invalid;
  1157. conditional := FALSE;
  1158. locked := FALSE;
  1159. InitOperand(result,ModeUndefined);
  1160. addressType := IntermediateCode.GetType(system,system.addressType);
  1161. setType := IntermediateCode.GetType(system,system.setType);
  1162. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1163. byteType := IntermediateCode.GetType(system, system.byteType);
  1164. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1165. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1166. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1167. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1168. nil := IntermediateCode.Immediate(addressType,0);
  1169. IntermediateCode.InitOperand(destination);
  1170. tagsAvailable := TRUE;
  1171. supportedInstruction := supportedInstructionProcedure;
  1172. supportedImmediate := supportedImmediateProcedure;
  1173. inData := FALSE;
  1174. SELF.emitLabels := emitLabels;
  1175. IntermediateCode.InitOperand(arrayDestinationTag);
  1176. bool := IntermediateCode.GetType(system,system.booleanType);
  1177. IntermediateCode.InitImmediate(false,bool,0);
  1178. IntermediateCode.InitImmediate(true,bool,1);
  1179. SELF.newObjectFile := newObjectFile;
  1180. indexCounter := 0;
  1181. NEW(registerUsageCount);
  1182. usedRegisters := NIL;
  1183. procedureResultDesignator := NIL;
  1184. NEW(fingerPrinter, system);
  1185. NEW(temporaries);
  1186. currentIsInline := FALSE;
  1187. NeedDescriptor := FALSE;
  1188. isUnchecked := backend.noRuntimeChecks;
  1189. END Init;
  1190. TYPE Context = RECORD
  1191. section: IntermediateCode.Section;
  1192. registerUsageCount: RegisterUsageCount;
  1193. usedRegisters: RegisterEntry;
  1194. END;
  1195. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1196. VAR context: Context;
  1197. BEGIN
  1198. context.section := section;
  1199. context.registerUsageCount := registerUsageCount;
  1200. context.usedRegisters := usedRegisters;
  1201. section := new;
  1202. NEW(registerUsageCount);
  1203. usedRegisters := NIL;
  1204. RETURN context;
  1205. END SwitchContext;
  1206. PROCEDURE ReturnToContext(context: Context);
  1207. BEGIN
  1208. section := context.section;
  1209. registerUsageCount := context.registerUsageCount;
  1210. usedRegisters := context.usedRegisters;
  1211. END ReturnToContext;
  1212. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1213. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1214. BEGIN
  1215. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1216. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1217. END;
  1218. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1219. section.SetExported(IsExported(syntaxTreeSymbol));
  1220. RETURN section
  1221. END NewSection;
  1222. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1223. VAR new: LONGINT;
  1224. BEGIN
  1225. new := registerUsageCount.Next(type,class);
  1226. UseRegister(new);
  1227. RETURN new
  1228. END AcquireRegister;
  1229. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1230. VAR
  1231. fingerPrint: SyntaxTree.FingerPrint;
  1232. fingerPrintString: ARRAY 32 OF CHAR;
  1233. BEGIN
  1234. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1235. string := "[";
  1236. Strings.IntToHexStr(fingerPrint.shallow, 8, fingerPrintString);
  1237. Strings.Append(string, fingerPrintString);
  1238. Strings.Append(string, "]");
  1239. END GetFingerprintString;
  1240. (** get the name for the code section that represens a certain symbol
  1241. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1242. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1243. VAR string: ARRAY 32 OF CHAR;
  1244. BEGIN
  1245. Global.GetSymbolSegmentedName(symbol, name);
  1246. (* if the symbol is an operator, then append the fingerprint to the name *)
  1247. IF symbol IS SyntaxTree.Operator THEN
  1248. GetFingerprintString(symbol, string);
  1249. Basic.AppendToSegmentedName(name,string);
  1250. END
  1251. END GetCodeSectionNameForSymbol;
  1252. (** get the name for the code section that represens a certain symbol
  1253. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1254. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1255. VAR string: ARRAY 32 OF CHAR;
  1256. BEGIN
  1257. Global.GetSymbolNameInScope(symbol, scope, name);
  1258. (* if the symbol is an operator, then append the fingerprint to the name *)
  1259. IF symbol IS SyntaxTree.Operator THEN
  1260. GetFingerprintString(symbol, string);
  1261. Strings.Append(name, string);
  1262. END
  1263. END GetCodeSectionNameForSymbolInScope;
  1264. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1265. BEGIN
  1266. IF dump # NIL THEN
  1267. dump.String("enter "); dump.String(s); dump.Ln;
  1268. END;
  1269. END TraceEnter;
  1270. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1271. BEGIN
  1272. IF dump # NIL THEN
  1273. dump.String("exit "); dump.String(s); dump.Ln;
  1274. END;
  1275. END TraceExit;
  1276. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1277. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1278. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1279. VAR i: LONGINT;
  1280. BEGIN
  1281. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1282. IF op.rule # NIL THEN
  1283. FOR i := 0 TO LEN(op.rule)-1 DO
  1284. CheckRegister(op.rule[i])
  1285. END;
  1286. END;
  1287. END CheckRegister;
  1288. BEGIN
  1289. CheckRegister(instruction.op1);
  1290. CheckRegister(instruction.op2);
  1291. CheckRegister(instruction.op3);
  1292. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1293. ELSE section.Emit(instruction);
  1294. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1295. END;
  1296. END Emit;
  1297. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1298. BEGIN
  1299. IF backend.cooperative THEN
  1300. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1301. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1302. ELSE
  1303. Emit(Trap(position,trapNo));
  1304. END;
  1305. END EmitTrap;
  1306. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1307. VAR name: Basic.SegmentedName;
  1308. VAR op1, op2, reg: IntermediateCode.Operand;
  1309. VAR call, nocall: Label;
  1310. VAR parametersSize: LONGINT;
  1311. VAR prevSection: IntermediateCode.Section;
  1312. VAR prevDump: Streams.Writer;
  1313. VAR body: SyntaxTree.Body;
  1314. BEGIN
  1315. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1316. prevSection := SELF.section;
  1317. SELF.section := section;
  1318. prevDump := dump;
  1319. dump := section.comments;
  1320. IF backend.hasLinkRegister THEN
  1321. Emit(Push(-1, lr));
  1322. END;
  1323. Emit(Push(-1,fp));
  1324. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1325. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1326. GetCodeSectionNameForSymbol(procedure, name);
  1327. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1328. ELSE
  1329. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1330. END;
  1331. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1332. Emit(Push(-1,op1));
  1333. Emit(Mov(-1,fp, sp));
  1334. body := procedure.procedureScope.body;
  1335. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1336. NEW(call, section);
  1337. NEW(nocall, section);
  1338. reg := NewRegisterOperand(addressType);
  1339. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1340. Emit(Sub(-1,reg, sp, op1));
  1341. BrltL(call, sp, reg);
  1342. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1343. BrgeL(nocall, sp, op2);
  1344. call.Resolve(section.pc);
  1345. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1346. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1347. Emit(Push(-1, op2));
  1348. Emit(Push(-1, reg));
  1349. ReleaseIntermediateOperand(reg);
  1350. CallThis(position, "Activities","ExpandStack",2);
  1351. Emit(Result(-1, sp));
  1352. nocall.Resolve(section.pc);
  1353. END;
  1354. ELSE
  1355. Emit(Mov(-1, fp, sp));
  1356. END;
  1357. Emit(Enter(-1, callconv, varSize));
  1358. SELF.section := prevSection;
  1359. dump := prevDump;
  1360. END EmitEnter;
  1361. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1362. VAR op1,op2: IntermediateCode.Operand;
  1363. VAR instruction: IntermediateCode.Instruction;
  1364. BEGIN
  1365. IntermediateCode.InitNumber(op1,callconv);
  1366. IntermediateCode.InitNumber(op2,varSize);
  1367. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1368. RETURN instruction
  1369. END Enter;
  1370. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1371. VAR op1: IntermediateCode.Operand;
  1372. VAR instruction: IntermediateCode.Instruction;
  1373. BEGIN
  1374. IntermediateCode.InitNumber(op1,callconv);
  1375. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1376. RETURN instruction
  1377. END Leave;
  1378. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1379. VAR prevSection: IntermediateCode.Section;
  1380. VAR op2: IntermediateCode.Operand;
  1381. BEGIN
  1382. prevSection := SELF.section;
  1383. SELF.section := section;
  1384. Emit(Leave(position, callconv));
  1385. IF backend.cooperative THEN
  1386. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1387. Emit(Add(position, sp, fp, op2));
  1388. ELSE
  1389. Emit(Mov(position, sp, fp));
  1390. END;
  1391. Emit(Pop(position, fp));
  1392. SELF.section := prevSection;
  1393. END EmitLeave;
  1394. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1395. VAR m: SymbolMap;
  1396. BEGIN
  1397. position := x.position;
  1398. IF currentIsInline THEN
  1399. m := currentMapper.Get(x);
  1400. IF m # NIL THEN
  1401. (*
  1402. Printout.Info("mapping from", x);
  1403. Printout.Info("mapping to ", m.to);
  1404. *)
  1405. m.to.Accept(SELF);
  1406. op := result;
  1407. IF m.tag # NIL THEN
  1408. ReleaseIntermediateOperand(result.tag);
  1409. m.tag.Accept(SELF);
  1410. op.tag := result.op;
  1411. ReleaseIntermediateOperand(result.tag);
  1412. END;
  1413. RETURN
  1414. END;
  1415. END;
  1416. x.Accept(SELF);
  1417. op := result;
  1418. END Symbol;
  1419. PROCEDURE Expression(x: SyntaxTree.Expression);
  1420. BEGIN
  1421. position := x.position;
  1422. constantDeclaration := NIL;
  1423. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1424. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1425. END;
  1426. IF x.resolved # NIL THEN
  1427. x.resolved.Accept(SELF)
  1428. ELSE
  1429. x.Accept(SELF)
  1430. END;
  1431. (* check this, was commented out in ActiveCells3 *)
  1432. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1433. Error(x.position, "unsupported modifier");
  1434. END;
  1435. END Expression;
  1436. (*
  1437. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1438. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1439. BEGIN
  1440. temporaries.GetUsage(current);
  1441. FOR i := 0 TO LEN(current)-1 DO
  1442. set := current[i] - previous[i];
  1443. IF set # {} THEN
  1444. FOR j := 0 TO MAX(SET)-1 DO
  1445. IF j IN set THEN
  1446. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1447. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1448. Symbol(variable, op);
  1449. MakeMemory(tmp,op.op,addressType,0);
  1450. ReleaseOperand(op);
  1451. Emit(Mov(position,tmp, nil ) );
  1452. ReleaseIntermediateOperand(tmp);
  1453. END;
  1454. END;
  1455. END;
  1456. END;
  1457. END;
  1458. END ResetUsedTemporaries;
  1459. *)
  1460. PROCEDURE Statement(x: SyntaxTree.Statement);
  1461. VAR use: VariableUse;
  1462. BEGIN
  1463. temporaries.GetUsage(use);
  1464. position := x.position;
  1465. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1466. IF commentPrintout # NIL THEN
  1467. commentPrintout.Statement(x);
  1468. dump.Ln;
  1469. (*dump.Update;*)
  1470. END;
  1471. x.Accept(SELF);
  1472. (*
  1473. CheckRegistersFree();
  1474. *)
  1475. (*ResetUsedTemporaries(use);*)
  1476. temporaries.SetUsage(use);
  1477. END Statement;
  1478. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1479. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1480. *)
  1481. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1482. BEGIN
  1483. IF op.mode = IntermediateCode.ModeMemory THEN
  1484. ReuseCopy(res,op);
  1485. ELSE
  1486. res := op;
  1487. UseIntermediateOperand(res);
  1488. END;
  1489. IntermediateCode.AddOffset(res,offset);
  1490. IntermediateCode.MakeMemory(res,type);
  1491. END MakeMemory;
  1492. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1493. VAR mem: IntermediateCode.Operand;
  1494. BEGIN
  1495. MakeMemory(mem,res,type,offset);
  1496. ReleaseIntermediateOperand(res);
  1497. res := mem;
  1498. END ToMemory;
  1499. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1500. VAR mem: IntermediateCode.Operand;
  1501. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1502. componentType: SyntaxTree.Type;
  1503. BEGIN
  1504. type := type.resolved;
  1505. IF operand.mode = ModeReference THEN
  1506. IF type IS SyntaxTree.RangeType THEN
  1507. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1508. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1509. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1510. ReleaseOperand(operand);
  1511. operand.op := firstOp;
  1512. operand.tag := lastOp;
  1513. operand.extra := stepOp;
  1514. ELSIF type IS SyntaxTree.ComplexType THEN
  1515. componentType := type(SyntaxTree.ComplexType).componentType;
  1516. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1517. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1518. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1519. ReleaseOperand(operand);
  1520. operand.op := firstOp;
  1521. operand.tag := lastOp
  1522. ELSE
  1523. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1524. ReleaseIntermediateOperand(operand.op);
  1525. operand.op := mem;
  1526. END;
  1527. operand.mode := ModeValue;
  1528. END;
  1529. ASSERT(operand.mode = ModeValue);
  1530. END LoadValue;
  1531. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1532. VAR prevConditional: BOOLEAN;
  1533. BEGIN
  1534. prevConditional := conditional;
  1535. conditional := FALSE;
  1536. InitOperand(result, ModeUndefined);
  1537. Expression(x);
  1538. op := result;
  1539. LoadValue(op,x.type.resolved);
  1540. conditional := prevConditional;
  1541. END Evaluate;
  1542. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1543. VAR prevConditional: BOOLEAN;
  1544. BEGIN
  1545. prevConditional := conditional;
  1546. conditional := FALSE;
  1547. InitOperand(result,ModeUndefined);
  1548. Expression(x);
  1549. op := result;
  1550. (*
  1551. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1552. *)
  1553. conditional := prevConditional;
  1554. END Designate;
  1555. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1556. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1557. BEGIN
  1558. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1559. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1560. conditional := TRUE;
  1561. trueLabel := trueL; falseLabel := falseL;
  1562. Expression(x);
  1563. trueL := trueLabel; falseL := falseLabel;
  1564. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1565. END Condition;
  1566. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1567. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1568. BEGIN
  1569. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1570. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1571. RETURN op
  1572. END NewRegisterOperand;
  1573. PROCEDURE UnuseRegister(register: LONGINT);
  1574. BEGIN
  1575. IF (register > 0) THEN
  1576. register := registerUsageCount.Map(register);
  1577. registerUsageCount.DecUse(register);
  1578. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1579. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1580. END;
  1581. IF registerUsageCount.Use(register)=0 THEN
  1582. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1583. Warning(position, "register cannot be removed");
  1584. END;
  1585. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1586. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1587. END;
  1588. ELSIF registerUsageCount.Use(register)<0 THEN
  1589. Warning(position, "register removed too often");
  1590. IF dump # NIL THEN
  1591. dump.String("register removed too often"); dump.Ln; dump.Update;
  1592. END;
  1593. D.TraceBack;
  1594. END;
  1595. END;
  1596. END UnuseRegister;
  1597. PROCEDURE UseRegister(register: LONGINT);
  1598. BEGIN
  1599. IF (register > 0) THEN
  1600. register := registerUsageCount.Map(register);
  1601. registerUsageCount.IncUse(register);
  1602. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1603. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1604. END;
  1605. IF registerUsageCount.Use(register)=1 THEN
  1606. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1607. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1608. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1609. END;
  1610. END;
  1611. END;
  1612. END UseRegister;
  1613. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1614. BEGIN
  1615. UnuseRegister(op.register)
  1616. END ReleaseIntermediateOperand;
  1617. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1618. BEGIN
  1619. UseRegister(op.register)
  1620. END UseIntermediateOperand;
  1621. PROCEDURE ReleaseOperand(CONST op: Operand);
  1622. BEGIN
  1623. UnuseRegister(op.op.register);
  1624. UnuseRegister(op.tag.register);
  1625. UnuseRegister(op.extra.register);
  1626. END ReleaseOperand;
  1627. (* save registers marked in array "markedRegisters" to the stack
  1628. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1629. *)
  1630. PROCEDURE SaveRegisters();
  1631. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1632. BEGIN
  1633. entry := usedRegisters;
  1634. WHILE entry # NIL DO
  1635. type := registerUsageCount.used[entry.register].type;
  1636. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1637. Emit(Push(position,op));
  1638. entry := entry.next;
  1639. END;
  1640. END SaveRegisters;
  1641. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1642. BEGIN
  1643. saved := usedRegisters;
  1644. usedRegisters := NIL;
  1645. END ReleaseUsedRegisters;
  1646. (** remove parameter registers from used queue *)
  1647. PROCEDURE ReleaseParameterRegisters;
  1648. VAR entry,prev,next: RegisterEntry;
  1649. BEGIN
  1650. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1651. WHILE entry # NIL DO
  1652. next := entry.next;
  1653. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1654. registerUsageCount.DecUse(entry.register);
  1655. ASSERT(registerUsageCount.Use(entry.register)=0);
  1656. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1657. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1658. END;
  1659. ELSIF prev = NIL THEN
  1660. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1661. ELSE
  1662. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1663. END;
  1664. entry := next;
  1665. END;
  1666. END ReleaseParameterRegisters;
  1667. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1668. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1669. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1670. BEGIN
  1671. entry := saved;
  1672. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1673. entry := prev;
  1674. WHILE entry # NIL DO
  1675. prev := entry.prev;
  1676. type := entry.type;
  1677. class := entry.registerClass;
  1678. IntermediateCode.InitRegister(op,type,class,entry.register);
  1679. (*
  1680. new := registerUsageCount.Next(type,class);
  1681. registerUsageCount.Remap(entry.register,new);
  1682. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1683. dump.String("remap register "); dump.Int(entry.register,1);
  1684. dump.String("to "); dump.Int(new,1);
  1685. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1686. END;
  1687. entry.register := new;
  1688. *)
  1689. Emit(Pop(position,op));
  1690. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1691. entry := prev;
  1692. END;
  1693. (*
  1694. usedRegisters := saved;
  1695. *)
  1696. END RestoreRegisters;
  1697. PROCEDURE CheckRegistersFree;
  1698. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1699. BEGIN
  1700. IF usedRegisters # NIL THEN
  1701. r := usedRegisters;
  1702. WHILE r # NIL DO
  1703. warning := "register ";
  1704. Strings.AppendInt(warning, r.register);
  1705. Strings.Append(warning, " not released.");
  1706. Warning(position,warning);
  1707. r := r .next;
  1708. END;
  1709. END;
  1710. FOR i := 0 TO registerUsageCount.count-1 DO
  1711. IF registerUsageCount.used[i].count < 0 THEN
  1712. warning := "register ";
  1713. Strings.AppendInt(warning, i);
  1714. Strings.Append(warning, " unused too often.");
  1715. Warning(position,warning);
  1716. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1717. warning := "register ";
  1718. Strings.AppendInt(warning, i);
  1719. Strings.Append(warning, " not unused often enough.");
  1720. Warning(position,warning);
  1721. END;
  1722. END;
  1723. END CheckRegistersFree;
  1724. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1725. Otherwise allocate a new register.
  1726. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1727. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1728. BEGIN
  1729. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1730. UseIntermediateOperand(result);
  1731. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1732. UseIntermediateOperand(result);
  1733. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1734. END;
  1735. END Reuse2;
  1736. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1737. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1738. If not then allocate a new register.
  1739. Does NOT necessarily keep the content of src1 or src2 in result!
  1740. *)
  1741. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1742. BEGIN
  1743. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1744. UseIntermediateOperand(result);
  1745. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1746. UseIntermediateOperand(result);
  1747. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1748. result := alternative; alternative := emptyOperand;
  1749. UseIntermediateOperand(result);
  1750. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1751. END;
  1752. END Reuse2a;
  1753. (* like reuse2 but only one source *)
  1754. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1755. BEGIN
  1756. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1757. UseIntermediateOperand(result);
  1758. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1759. END;
  1760. END Reuse1;
  1761. (* like reuse2a but only one source *)
  1762. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1763. BEGIN
  1764. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1765. UseIntermediateOperand(result);
  1766. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1767. UseIntermediateOperand(result);
  1768. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1769. END;
  1770. END Reuse1a;
  1771. (* like reuse1 but guarantees that content of src1 is in result *)
  1772. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1773. BEGIN
  1774. IF ReusableRegister(src1) THEN
  1775. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1776. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1777. UseIntermediateOperand(result);
  1778. ELSE
  1779. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1780. Emit(Mov(position,result,src1));
  1781. END
  1782. END ReuseCopy;
  1783. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1784. BEGIN
  1785. IF ReusableRegister(src) THEN
  1786. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1787. ELSE
  1788. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1789. Emit(Mov(position,result,src));
  1790. ReleaseIntermediateOperand(src);
  1791. END
  1792. END TransferToRegister;
  1793. (** labels and branches **)
  1794. PROCEDURE NewLabel(): Label;
  1795. VAR label: Label;
  1796. BEGIN
  1797. NEW(label,section); RETURN label;
  1798. END NewLabel;
  1799. PROCEDURE SetLabel(label: Label);
  1800. BEGIN label.Resolve(section.pc);
  1801. END SetLabel;
  1802. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1803. BEGIN
  1804. ASSERT(label # NIL);
  1805. IF label.pc < 0 THEN (* label not yet set *)
  1806. label.AddFixup(section.pc);
  1807. END;
  1808. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1809. END LabelOperand;
  1810. PROCEDURE BrL(label: Label);
  1811. BEGIN
  1812. Emit(Br(position,LabelOperand(label)));
  1813. END BrL;
  1814. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1815. BEGIN
  1816. Emit(Brge(position,LabelOperand(label),left,right));
  1817. END BrgeL;
  1818. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1819. BEGIN
  1820. Emit(Brlt(position,LabelOperand(label),left,right));
  1821. END BrltL;
  1822. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1823. BEGIN
  1824. Emit(Breq(position,LabelOperand(label),left,right));
  1825. END BreqL;
  1826. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1827. BEGIN
  1828. Emit(Brne(position,LabelOperand(label),left,right));
  1829. END BrneL;
  1830. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1831. VAR new: IntermediateCode.Operand;
  1832. BEGIN
  1833. IF Trace THEN TraceEnter("Convert") END;
  1834. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1835. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1836. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1837. & (operand.offset = 0)
  1838. THEN
  1839. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1840. Emit(Conv(position,new,operand));
  1841. ELSE
  1842. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1843. Emit(Conv(position,new,operand));
  1844. ReleaseIntermediateOperand(operand);
  1845. END;
  1846. operand := new;
  1847. 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
  1848. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1849. ELSE
  1850. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1851. Emit(Conv(position,new,operand));
  1852. ReleaseIntermediateOperand(operand);
  1853. operand := new;
  1854. END;
  1855. IF Trace THEN TraceExit("Convert") END;
  1856. END Convert;
  1857. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1858. VAR exit: Label;
  1859. BEGIN
  1860. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1861. exit := NewLabel();
  1862. br(exit,left,right);
  1863. EmitTrap(position,trapNo);
  1864. SetLabel(exit);
  1865. END TrapC;
  1866. (** expressions *)
  1867. (** emit necessary runtime check for set elements **)
  1868. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1869. VAR max: IntermediateCode.Operand;
  1870. BEGIN
  1871. IF isUnchecked THEN RETURN END;
  1872. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1873. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1874. TrapC(BrgeL, max, o, SetElementTrap);
  1875. END;
  1876. END CheckSetElement;
  1877. (** the set that a range represents **)
  1878. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1879. VAR
  1880. operand: Operand;
  1881. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1882. BEGIN
  1883. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1884. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1885. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1886. one := IntermediateCode.Immediate(setType, 1);
  1887. Evaluate(x, operand);
  1888. Convert(operand.op, setType);
  1889. Convert(operand.tag, setType);
  1890. CheckSetElement(operand.op);
  1891. CheckSetElement(operand.tag);
  1892. (* create mask for lower bound
  1893. i.e. shift 11111111 to the left by the value of the lower bound
  1894. *)
  1895. Reuse1(temp, operand.op);
  1896. Emit(Shl(position,temp, allBits, operand.op));
  1897. ReleaseIntermediateOperand(operand.op);
  1898. operand.op := temp;
  1899. (* create mask for upper bound
  1900. i.e. shift 11111111 to the right by the difference between the
  1901. upper bound and the maximum number of set elements
  1902. *)
  1903. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1904. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1905. Reuse1(temp, operand.tag);
  1906. ELSE
  1907. Reuse1(temp, operand.tag);
  1908. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1909. Emit(Sub(position,temp, size, operand.tag));
  1910. END;
  1911. Emit(Shr(position,temp, allBits, operand.tag));
  1912. ReleaseIntermediateOperand(operand.tag);
  1913. operand.tag := temp;
  1914. Reuse2(resultingSet, operand.op, operand.tag);
  1915. (* intersect the two masks *)
  1916. Emit(And(position,resultingSet, operand.op, operand.tag));
  1917. ReleaseOperand(operand);
  1918. RETURN resultingSet
  1919. END SetFromRange;
  1920. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1921. VAR
  1922. res, operand: Operand;
  1923. temp, one, noBits, dest: IntermediateCode.Operand;
  1924. expression: SyntaxTree.Expression;
  1925. i: LONGINT;
  1926. BEGIN
  1927. IF Trace THEN TraceEnter("VisitSet") END;
  1928. dest := destination;
  1929. destination := emptyOperand;
  1930. noBits := IntermediateCode.Immediate(setType, 0);
  1931. one := IntermediateCode.Immediate(setType, 1);
  1932. (* start off with the empty set *)
  1933. InitOperand(res, ModeValue);
  1934. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1935. Emit(Mov(position,res.op, noBits));
  1936. FOR i := 0 TO x.elements.Length() - 1 DO
  1937. expression := x.elements.GetExpression(i);
  1938. IF expression IS SyntaxTree.RangeExpression THEN
  1939. (* range of set elements *)
  1940. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1941. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1942. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1943. ReleaseIntermediateOperand(temp)
  1944. ELSE
  1945. (* singelton element *)
  1946. Evaluate(expression, operand);
  1947. Convert(operand.op, setType);
  1948. CheckSetElement(operand.op);
  1949. (* create subset containing single element *)
  1950. Reuse1(temp, operand.op);
  1951. Emit(Shl(position,temp, one, operand.op));
  1952. ReleaseOperand(operand);
  1953. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1954. ReleaseIntermediateOperand(temp);
  1955. END
  1956. END;
  1957. result := res;
  1958. destination := dest;
  1959. IF Trace THEN TraceExit("VisitSet") END;
  1960. END VisitSet;
  1961. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1962. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1963. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1964. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1965. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1966. element: SyntaxTree.IntegerValue;
  1967. BEGIN
  1968. numberElements := x.elements.Length();
  1969. expression := index.parameters.GetExpression(dim);
  1970. element := expression(SyntaxTree.IntegerValue);
  1971. FOR i := 0 TO numberElements-1 DO
  1972. expression := x.elements.GetExpression(i);
  1973. element.SetValue(i);
  1974. IF expression IS SyntaxTree.MathArrayExpression THEN
  1975. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1976. ELSE
  1977. Assign(index,expression);
  1978. END;
  1979. END;
  1980. END RecursiveAssignment;
  1981. BEGIN
  1982. variable := GetTemporaryVariable(x.type, FALSE);
  1983. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1984. designator.SetType(variable.type);
  1985. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1986. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1987. FOR i := 0 TO dim-1 DO
  1988. element := SyntaxTree.NewIntegerValue(x.position,0);
  1989. element.SetType(system.longintType);
  1990. index.parameters.AddExpression(element);
  1991. END;
  1992. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1993. RecursiveAssignment(x,0);
  1994. Expression(designator);
  1995. END VisitMathArrayExpression;
  1996. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1997. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1998. BEGIN
  1999. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2000. dest := destination; destination := emptyOperand;
  2001. IF x.operator = Scanner.Not THEN
  2002. IF conditional THEN
  2003. Condition(x.left,falseLabel,trueLabel)
  2004. ELSE
  2005. Evaluate(x.left,operand);
  2006. InitOperand(result,ModeValue);
  2007. Reuse1a(result.op,operand.op,dest);
  2008. Emit(Xor(position,result.op,operand.op,true));
  2009. ReleaseOperand(operand);
  2010. END;
  2011. ELSIF x.operator = Scanner.Minus THEN
  2012. Evaluate(x.left,operand);
  2013. InitOperand(result,ModeValue);
  2014. Reuse1a(result.op,operand.op,dest);
  2015. type := x.left.type.resolved;
  2016. IF type IS SyntaxTree.SetType THEN
  2017. Emit(Not(position,result.op,operand.op));
  2018. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2019. Reuse1(result.tag,operand.tag);
  2020. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2021. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2022. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2023. Emit(Neg(position,result.op,operand.op));
  2024. ELSE HALT(200)
  2025. END;
  2026. ReleaseOperand(operand);
  2027. ELSIF x.operator = Scanner.Address THEN
  2028. Designate(x.left,operand);
  2029. operand.mode := ModeValue;
  2030. t0 := x.left.type.resolved;
  2031. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2032. ReleaseIntermediateOperand(operand.op);
  2033. operand.op := operand.tag;
  2034. IntermediateCode.InitOperand(operand.tag);
  2035. END;
  2036. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2037. result := operand;
  2038. ELSE HALT(100)
  2039. END;
  2040. destination := dest;
  2041. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2042. END VisitUnaryExpression;
  2043. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2044. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2045. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2046. BEGIN
  2047. type := type.resolved;
  2048. originalType := type;
  2049. IF type IS SyntaxTree.PointerType THEN
  2050. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2051. END;
  2052. IF type IS SyntaxTree.ObjectType THEN
  2053. BrL(trueL);
  2054. ELSE
  2055. ASSERT(type IS SyntaxTree.RecordType);
  2056. (*
  2057. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2058. *)
  2059. ReuseCopy(left,tag);
  2060. right := TypeDescriptorAdr(type);
  2061. IF ~newObjectFile THEN
  2062. IntermediateCode.MakeMemory(right,addressType);
  2063. END;
  2064. IF backend.cooperative THEN
  2065. repeatL := NewLabel();
  2066. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2067. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2068. END;
  2069. SetLabel(repeatL);
  2070. BreqL(trueL,left,right);
  2071. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2072. BrneL(repeatL,left,nil);
  2073. ELSIF meta.simple THEN
  2074. level := type(SyntaxTree.RecordType).Level();
  2075. (* get type desc tag of level relative to base tag *)
  2076. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2077. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2078. IntermediateCode.MakeMemory(left,addressType);
  2079. BreqL(trueL,left,right);
  2080. ELSE
  2081. level := type(SyntaxTree.RecordType).Level();
  2082. (* get type desc tag of level relative to base tag *)
  2083. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2084. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2085. IntermediateCode.MakeMemory(left,addressType);
  2086. BreqL(trueL,left,right);
  2087. END;
  2088. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2089. BrL(falseL);
  2090. END;
  2091. END TypeTest;
  2092. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  2093. BEGIN
  2094. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2095. IF dump # NIL THEN
  2096. dump.String(s); dump.Ln;
  2097. END;
  2098. END Error;
  2099. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  2100. BEGIN
  2101. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  2102. IF dump # NIL THEN
  2103. dump.String(s); dump.Ln; dump.Update;
  2104. END;
  2105. END Warning;
  2106. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2107. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2108. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2109. operand:Operand;
  2110. BEGIN
  2111. previousSection := section;
  2112. Global.GetModuleName(mod,name);
  2113. Strings.Append(name,".@Trace");
  2114. Basic.ToSegmentedName(name, pooledName);
  2115. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2116. IF dump # NIL THEN dump := section.comments END;
  2117. IF backend.hasLinkRegister THEN
  2118. Emit(Push(-1, lr));
  2119. END;
  2120. variable := mod.moduleScope.firstVariable;
  2121. WHILE variable # NIL DO
  2122. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2123. Symbol(variable, operand);
  2124. register := operand.op;
  2125. CallTraceMethod(register, variable.type);
  2126. ReleaseIntermediateOperand(register);
  2127. END;
  2128. variable := variable.nextVariable;
  2129. END;
  2130. IF backend.hasLinkRegister THEN
  2131. Emit(Pop(-1, lr));
  2132. END;
  2133. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2134. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2135. Emit(Br(position,op));
  2136. INC(statCoopTraceModule, section.pc);
  2137. section := previousSection;
  2138. IF dump # NIL THEN dump := section.comments END;
  2139. END CreateTraceModuleMethod;
  2140. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2141. BEGIN
  2142. Emit (Push(position, dst));
  2143. Emit (Push(position, src));
  2144. CallThis(position,"GarbageCollector","Assign", 2);
  2145. END CallAssignPointer;
  2146. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2147. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2148. BEGIN
  2149. IF SemanticChecker.IsPointerType (type) THEN
  2150. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2151. ELSIF type.IsRecordType() THEN
  2152. Emit (Push(position,dst));
  2153. Emit (Push(position,src));
  2154. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2155. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2156. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2157. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2158. ELSIF IsStaticArray(type) THEN
  2159. size := StaticArrayNumElements(type);
  2160. base := StaticArrayBaseType(type);
  2161. IF base.IsRecordType() THEN
  2162. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2163. Emit (Push(position, dst));
  2164. Emit (Push(position, src));
  2165. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2166. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2167. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2168. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2169. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2170. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2171. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2172. Emit (Push(position, dst));
  2173. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2174. Emit (Push(position, src));
  2175. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2176. ELSE
  2177. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2178. Emit (Push(position, dst));
  2179. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2180. Emit (Push(position, src));
  2181. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2182. ASSERT(StaticArrayBaseType(type).IsPointer());
  2183. END;
  2184. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2185. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2186. Emit (Push(position, dst));
  2187. Emit (Push(position, src));
  2188. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2189. ELSE HALT(100); (* missing ? *)
  2190. END;
  2191. END CallAssignMethod;
  2192. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2193. VAR name: Basic.SegmentedName;
  2194. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2195. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2196. context: Context;
  2197. BEGIN
  2198. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2199. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2200. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2201. GetRecordTypeName (recordType,name);
  2202. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2203. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2204. IF dump # NIL THEN dump := section.comments END;
  2205. IF backend.hasLinkRegister THEN
  2206. Emit(Push(-1, lr));
  2207. END;
  2208. variable := recordType.recordScope.firstVariable;
  2209. WHILE variable # NIL DO
  2210. IF variable.NeedsTrace() THEN
  2211. dst := NewRegisterOperand (addressType);
  2212. src := NewRegisterOperand (addressType);
  2213. Emit (Mov(position, dst, parameter1));
  2214. Emit (Mov(position, src, parameter2));
  2215. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2216. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2217. CallAssignMethod(dst, src, variable.type);
  2218. ReleaseIntermediateOperand(src);
  2219. ReleaseIntermediateOperand(dst);
  2220. END;
  2221. variable := variable.nextVariable;
  2222. END;
  2223. recordBase := recordType.GetBaseRecord();
  2224. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2225. IF backend.hasLinkRegister THEN
  2226. Emit(Pop(-1, lr));
  2227. END;
  2228. GetRecordTypeName (recordBase,name);
  2229. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2230. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2231. Emit(Br(position,op));
  2232. ELSE
  2233. Emit(Exit(position,0,0));
  2234. END;
  2235. IF ~recordType.isObject THEN
  2236. GetRecordTypeName (recordType,name);
  2237. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2238. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2239. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2240. NEW(registerUsageCount);
  2241. usedRegisters := NIL;
  2242. dst := NewRegisterOperand (addressType);
  2243. src := NewRegisterOperand (addressType);
  2244. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2245. Emit(Mov(position, dst, parameter1));
  2246. Emit(Mov(position, src, parameter2));
  2247. label := NewLabel();
  2248. SetLabel(label);
  2249. Emit(Push(position, dst));
  2250. Emit(Push(position, src));
  2251. GetRecordTypeName (recordType,name);
  2252. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2253. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2254. Emit(Call(position, op, 0));
  2255. Emit(Pop(position, src));
  2256. Emit(Pop(position, dst));
  2257. Emit(Add(position, dst, dst, ofs));
  2258. Emit(Add(position, src, src, ofs));
  2259. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2260. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2261. Emit(Exit(position,0,0));
  2262. END;
  2263. INC(statCoopAssignProcedure, section.pc);
  2264. ReturnToContext(context);
  2265. IF dump # NIL THEN dump := section.comments END;
  2266. END CreateAssignProcedure;
  2267. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2268. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2269. BEGIN
  2270. IF IsUnsafePointer (type) THEN
  2271. skip := NewLabel();
  2272. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2273. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2274. BreqL (skip, op, nil);
  2275. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2276. SetLabel (skip);
  2277. ELSIF SemanticChecker.IsPointerType (type) THEN
  2278. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2279. CallThis(position,"GarbageCollector","Mark", 1);
  2280. ELSIF type.IsRecordType() THEN
  2281. Emit (Push(position,register));
  2282. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2283. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2284. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2285. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2286. ELSIF IsStaticArray(type) THEN
  2287. size := StaticArrayNumElements(type);
  2288. base := StaticArrayBaseType(type);
  2289. IF base.IsRecordType() THEN
  2290. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2291. Emit (Push(position, register));
  2292. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2293. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2294. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2295. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2296. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2297. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2298. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2299. Emit (Push(position, register));
  2300. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2301. ELSE
  2302. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2303. Emit (Push(position, register));
  2304. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2305. ASSERT(base.IsPointer());
  2306. END;
  2307. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2308. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2309. CallThis(position,"GarbageCollector","Mark", 1);
  2310. ELSE HALT(100); (* missing ? *)
  2311. END;
  2312. END CallTraceMethod;
  2313. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2314. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2315. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2316. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2317. BEGIN
  2318. previousSection := section;
  2319. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2320. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2321. GetRecordTypeName (recordType,name);
  2322. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2323. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2324. IF dump # NIL THEN dump := section.comments END;
  2325. IF backend.hasLinkRegister THEN
  2326. Emit(Push(-1, lr));
  2327. END;
  2328. variable := recordType.recordScope.firstVariable;
  2329. WHILE variable # NIL DO
  2330. IF variable.NeedsTrace() THEN
  2331. register := NewRegisterOperand (addressType);
  2332. Emit (Mov(position,register,parameter1));
  2333. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2334. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2335. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2336. END;
  2337. CallTraceMethod(register, variable.type);
  2338. ReleaseIntermediateOperand(register);
  2339. END;
  2340. variable := variable.nextVariable;
  2341. END;
  2342. recordBase := recordType.GetBaseRecord();
  2343. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2344. recordBase := recordBase.GetBaseRecord();
  2345. END;
  2346. IF recordBase # NIL THEN
  2347. IF backend.hasLinkRegister THEN
  2348. Emit(Pop(-1, lr));
  2349. END;
  2350. GetRecordTypeName (recordBase,name);
  2351. IF HasExplicitTraceMethod (recordBase) THEN
  2352. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2353. ELSE
  2354. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2355. END;
  2356. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2357. Emit(Br(position,op));
  2358. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2359. Emit(Exit(position,0,0));
  2360. ELSE
  2361. IF backend.hasLinkRegister THEN
  2362. Emit(Pop(-1, lr));
  2363. END;
  2364. IF recordType.isObject THEN
  2365. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2366. ELSE
  2367. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2368. END;
  2369. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2370. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2371. Emit(Br(position,op));
  2372. END;
  2373. IF ~recordType.isObject THEN
  2374. GetRecordTypeName (recordType,name);
  2375. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2376. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2377. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2378. NEW(registerUsageCount);
  2379. usedRegisters := NIL;
  2380. IF dump # NIL THEN dump := section.comments END;
  2381. register := NewRegisterOperand (addressType);
  2382. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2383. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2384. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2385. END;
  2386. Emit (Push(position,register));
  2387. GetRecordTypeName (recordType,name);
  2388. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2389. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2390. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2391. ReleaseIntermediateOperand(register);
  2392. Emit(Exit(position,0,0));
  2393. GetRecordTypeName (recordType,name);
  2394. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2395. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2396. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2397. NEW(registerUsageCount);
  2398. usedRegisters := NIL;
  2399. register := NewRegisterOperand (addressType);
  2400. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2401. Emit(Mov(position, register, parameter1));
  2402. label := NewLabel();
  2403. SetLabel(label);
  2404. Emit(Push(position, register));
  2405. GetRecordTypeName (recordType,name);
  2406. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2407. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2408. Emit(Call(position, op, 0));
  2409. Emit(Pop(position, register));
  2410. Emit(Add(position, register, register, ofs));
  2411. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2412. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2413. Emit(Exit(position,0,0));
  2414. END;
  2415. INC(statCoopTraceMethod, section.pc);
  2416. ReturnToContext(context);
  2417. IF dump # NIL THEN dump := section.comments END;
  2418. END CreateTraceMethod;
  2419. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2420. VAR name: Basic.SegmentedName;
  2421. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2422. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2423. context: Context;
  2424. BEGIN
  2425. IF recordType.isObject THEN RETURN END;
  2426. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2427. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2428. GetRecordTypeName (recordType,name);
  2429. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2430. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2431. IF dump # NIL THEN dump := section.comments END;
  2432. IF backend.hasLinkRegister THEN
  2433. Emit(Push(-1, lr));
  2434. END;
  2435. variable := recordType.recordScope.firstVariable;
  2436. WHILE variable # NIL DO
  2437. IF variable.NeedsTrace() THEN
  2438. dst := NewRegisterOperand (addressType);
  2439. Emit (Mov(position, dst, parameter1));
  2440. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2441. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2442. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2443. END;
  2444. CallResetProcedure(dst, nil, variable.type);
  2445. ReleaseIntermediateOperand(dst);
  2446. END;
  2447. variable := variable.nextVariable;
  2448. END;
  2449. recordBase := recordType.GetBaseRecord();
  2450. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2451. IF backend.hasLinkRegister THEN
  2452. Emit(Pop(-1, lr));
  2453. END;
  2454. GetRecordTypeName (recordBase,name);
  2455. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2456. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2457. Emit(Br(position,op));
  2458. ELSE
  2459. Emit(Exit(position,0,0));
  2460. END;
  2461. GetRecordTypeName (recordType,name);
  2462. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2463. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2464. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2465. NEW(registerUsageCount);
  2466. usedRegisters := NIL;
  2467. dst := NewRegisterOperand (addressType);
  2468. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2469. Emit(Mov(position, dst, parameter1));
  2470. label := NewLabel();
  2471. SetLabel(label);
  2472. Emit(Push(position, dst));
  2473. GetRecordTypeName (recordType,name);
  2474. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2475. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2476. Emit(Call(position, op, 0));
  2477. Emit(Pop(position, dst));
  2478. Emit(Add(position, dst, dst, ofs));
  2479. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2480. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2481. Emit(Exit(position,0,0));
  2482. INC(statCoopResetProcedure, section.pc);
  2483. ReturnToContext(context);
  2484. IF dump # NIL THEN dump := section.comments END;
  2485. END CreateResetProcedure;
  2486. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2487. VAR name: Basic.SegmentedName; context: Context;
  2488. BEGIN
  2489. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2490. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2491. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2492. IF dump # NIL THEN dump := section.comments END;
  2493. IF backend.hasLinkRegister THEN
  2494. Emit(Push(-1, lr));
  2495. END;
  2496. Emit(Push(position,fp));
  2497. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2498. ResetVariables(scope);
  2499. Emit(Pop(position,fp));
  2500. Emit(Exit(position,0,0));
  2501. ReturnToContext(context);
  2502. IF dump # NIL THEN dump := section.comments END;
  2503. END CreateResetMethod;
  2504. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2505. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2506. BEGIN
  2507. IF SemanticChecker.IsPointerType (type) THEN
  2508. Emit (Push(position, dest));
  2509. CallThis(position,"GarbageCollector","Reset", 1);
  2510. ELSIF type.IsRecordType() THEN
  2511. Emit (Push(position, dest));
  2512. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2513. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2514. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2515. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2516. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2517. size := GetArrayLength(type, tag);
  2518. base := ArrayBaseType(type);
  2519. IF base.IsRecordType() THEN
  2520. Emit (Push(position, size));
  2521. Emit (Push(position, dest));
  2522. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2523. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2524. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2525. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2526. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2527. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2528. Emit (Push(position, size));
  2529. Emit (Push(position, dest));
  2530. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2531. ELSE
  2532. Emit (Push(position, size));
  2533. Emit (Push(position, dest));
  2534. CallThis(position,"GarbageCollector","ResetArray", 2);
  2535. ASSERT(ArrayBaseType(type).IsPointer());
  2536. END;
  2537. ReleaseIntermediateOperand(size);
  2538. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2539. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2540. Emit (Push(position, dest));
  2541. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2542. ELSE HALT(100); (* missing ? *)
  2543. END;
  2544. END CallResetProcedure;
  2545. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2546. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2547. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2548. VAR operand: Operand;
  2549. BEGIN
  2550. Symbol (symbol, operand);
  2551. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2552. ReleaseOperand(operand);
  2553. END Reset;
  2554. BEGIN
  2555. previousScope := currentScope;
  2556. currentScope := scope;
  2557. pc := section.pc;
  2558. variable := scope.firstVariable;
  2559. WHILE variable # NIL DO
  2560. IF variable.NeedsTrace() THEN
  2561. Reset (variable);
  2562. END;
  2563. variable := variable.nextVariable;
  2564. END;
  2565. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2566. WHILE parameter # NIL DO
  2567. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2568. Reset (parameter);
  2569. END;
  2570. parameter := parameter.nextParameter;
  2571. END;
  2572. INC(statCoopResetVariables, section.pc - pc);
  2573. currentScope := previousScope;
  2574. END ResetVariables;
  2575. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2576. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2577. VAR op: IntermediateCode.Operand; context: Context;
  2578. BEGIN
  2579. previousSection := section;
  2580. GetCodeSectionNameForSymbol(procedure, name);
  2581. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2582. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2583. IF dump # NIL THEN dump := section.comments END;
  2584. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2585. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2586. Emit(Data(position,op));
  2587. Emit(Data(position,nil));
  2588. IF HasPointers (procedure.procedureScope) THEN
  2589. GetCodeSectionNameForSymbol(procedure, name);
  2590. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2591. ELSE
  2592. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2593. END;
  2594. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2595. Emit(Data(position,op));
  2596. ReturnToContext(context);
  2597. IF dump # NIL THEN dump := section.comments END;
  2598. END CreateProcedureDescriptor;
  2599. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2600. VAR import: SyntaxTree.Import;
  2601. s: Basic.MessageString;
  2602. selfName: SyntaxTree.IdentifierString;
  2603. BEGIN
  2604. moduleScope.ownerModule.GetName(selfName);
  2605. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2606. module := moduleScope.ownerModule
  2607. ELSE
  2608. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2609. IF import = NIL THEN
  2610. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2611. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2612. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2613. s := "Module ";
  2614. Strings.Append(s,moduleName);
  2615. Strings.Append(s," cannot be imported.");
  2616. IF force THEN
  2617. Error(position,s);
  2618. ELSIF canBeLoaded THEN
  2619. Strings.Append(s, "=> no dynamic linking.");
  2620. Warning(position, s);
  2621. canBeLoaded := FALSE;
  2622. END;
  2623. RETURN FALSE
  2624. ELSE
  2625. SELF.module.imports.AddName(moduleName)
  2626. END;
  2627. ELSIF import.module = NIL THEN (* already tried *)
  2628. RETURN FALSE
  2629. END;
  2630. module := import.module;
  2631. END;
  2632. RETURN TRUE
  2633. END AddImport;
  2634. (* needed for old binary object file format*)
  2635. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2636. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2637. BEGIN
  2638. IF AddImport(moduleName,module,TRUE) THEN
  2639. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2640. IF procedure = NIL THEN
  2641. s := "Instruction not supported on target, emulation procedure ";
  2642. Strings.Append(s,moduleName);
  2643. Strings.Append(s,".");
  2644. Strings.Append(s,procedureName);
  2645. Strings.Append(s," not present");
  2646. Error(position,s);
  2647. ELSE
  2648. StaticCallOperand(r,procedure);
  2649. ReleaseOperand(r);
  2650. fp := GetFingerprint(procedure);
  2651. END;
  2652. END;
  2653. END EnsureSymbol;
  2654. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2655. VAR exit: Label; trueL,falseL: Label;
  2656. BEGIN
  2657. trueL := NewLabel();
  2658. falseL := NewLabel();
  2659. exit := NewLabel();
  2660. Condition(x,trueL,falseL);
  2661. InitOperand(result,ModeValue);
  2662. SetLabel(trueL);
  2663. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2664. Emit(Mov(position,result.op,true));
  2665. BrL(exit);
  2666. SetLabel(falseL);
  2667. Emit(MovReplace(position,result.op,false));
  2668. SetLabel(exit);
  2669. END ConditionToValue;
  2670. PROCEDURE ValueToCondition(VAR op: Operand);
  2671. BEGIN
  2672. LoadValue(op,system.booleanType);
  2673. BrneL(trueLabel,op.op, false);
  2674. ReleaseOperand(op);
  2675. BrL(falseLabel);
  2676. END ValueToCondition;
  2677. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2678. VAR size: LONGINT;
  2679. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2680. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2681. BEGIN
  2682. ASSERT(type.form = SyntaxTree.Open);
  2683. baseType := type.arrayBase.resolved;
  2684. IF IsOpenArray(baseType) THEN
  2685. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2686. ELSE
  2687. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2688. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2689. END;
  2690. len := tag;
  2691. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2692. IntermediateCode.MakeMemory(len,addressType);
  2693. UseIntermediateOperand(len);
  2694. Reuse2(res,sizeOperand,len);
  2695. Emit(Mul(position,res,sizeOperand,len));
  2696. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2697. RETURN res
  2698. END GetArraySize;
  2699. BEGIN
  2700. type := type.resolved;
  2701. IF IsOpenArray(type) THEN
  2702. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2703. RETURN tag
  2704. ELSE
  2705. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2706. END;
  2707. ELSE
  2708. size := ToMemoryUnits(system,system.SizeOf(type));
  2709. RETURN IntermediateCode.Immediate(addressType,size)
  2710. END;
  2711. END GetDynamicSize;
  2712. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2713. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2714. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2715. BEGIN
  2716. ASSERT(type.form = SyntaxTree.Open);
  2717. baseType := type.arrayBase.resolved;
  2718. IF IsOpenArray(baseType) THEN
  2719. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2720. ELSE
  2721. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2722. END;
  2723. len := tag;
  2724. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2725. IntermediateCode.MakeMemory(len,addressType);
  2726. UseIntermediateOperand(len);
  2727. Reuse2(res,sizeOperand,len);
  2728. Emit(Mul(position,res,sizeOperand,len));
  2729. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2730. RETURN res
  2731. END GetLength;
  2732. BEGIN
  2733. type := type.resolved;
  2734. IF IsOpenArray(type) THEN
  2735. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2736. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2737. ELSE
  2738. RETURN IntermediateCode.Immediate(addressType,1)
  2739. END;
  2740. END GetArrayLength;
  2741. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2742. VAR result: IntermediateCode.Operand;
  2743. BEGIN
  2744. IF backend.cooperative THEN
  2745. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2746. ELSE
  2747. MakeMemory(result, tag, addressType, 0);
  2748. END;
  2749. RETURN result
  2750. END GetSizeFromTag;
  2751. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2752. VAR parameter: SyntaxTree.Parameter;
  2753. BEGIN
  2754. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2755. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2756. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2757. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2758. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2759. END;
  2760. RETURN GetDynamicSize(e.type, tag);
  2761. END GetArrayOfBytesSize;
  2762. (*
  2763. to find imported symbol. not needed ?
  2764. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2765. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2766. BEGIN
  2767. IF AddImport(moduleName,importedModule,FALSE) THEN
  2768. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2769. RETURN symbol
  2770. ELSE
  2771. RETURN NIL
  2772. END
  2773. END SymbolByName;
  2774. *)
  2775. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2776. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2777. BEGIN
  2778. IF AddImport(moduleName,runtimeModule,force) THEN
  2779. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2780. IF procedure = NIL THEN
  2781. s := "Procedure ";
  2782. Strings.Append(s,moduleName);
  2783. Strings.Append(s,".");
  2784. Strings.Append(s,procedureName);
  2785. Strings.Append(s," not present");
  2786. Error(position,s);
  2787. RETURN FALSE
  2788. ELSE
  2789. RETURN TRUE
  2790. END;
  2791. ELSE RETURN FALSE
  2792. END;
  2793. END GetRuntimeProcedure;
  2794. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2795. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2796. s: Basic.MessageString;
  2797. BEGIN
  2798. Basic.InitSegmentedName(name);
  2799. name[0] := Basic.MakeString(moduleName);
  2800. name[1] := Basic.MakeString(typeName);
  2801. name[2] := -1;
  2802. IF AddImport(moduleName,importedModule, FALSE) THEN
  2803. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2804. IF symbol = NIL THEN
  2805. s := "type ";
  2806. Strings.Append(s,moduleName);
  2807. Strings.Append(s,".");
  2808. Strings.Append(s,typeName);
  2809. Strings.Append(s," not present");
  2810. Error(position,s);
  2811. END;
  2812. ELSE symbol := NIL;
  2813. END;
  2814. IF importedModule = moduleScope.ownerModule THEN
  2815. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2816. ELSE
  2817. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2818. END;
  2819. RETURN symbol
  2820. END GetTypeDescriptor;
  2821. (* 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. *)
  2822. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2823. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2824. pooledName: Basic.SegmentedName; size: LONGINT;
  2825. BEGIN
  2826. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2827. StaticCallOperand(result,procedure);
  2828. IF numberParameters < 0 THEN
  2829. size := ProcedureParametersSize(system,procedure);
  2830. ELSE
  2831. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2832. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2833. Error(position,"runtime call parameter count mismatch");
  2834. END;
  2835. END;
  2836. Emit(Call(position, result.op, size));
  2837. ReleaseOperand(result);
  2838. ELSE (* only static linking possible *)
  2839. ASSERT(numberParameters >= 0);
  2840. Basic.InitSegmentedName(pooledName);
  2841. pooledName[0] := Basic.MakeString(moduleName);
  2842. pooledName[1] := Basic.MakeString(procedureName);
  2843. pooledName[2] := -1;
  2844. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2845. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2846. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2847. END;
  2848. END CallThisChecked;
  2849. (* 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. *)
  2850. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2851. BEGIN
  2852. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2853. END CallThis;
  2854. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2855. VAR
  2856. left,right: Operand;
  2857. leftSize, rightSize: IntermediateCode.Operand;
  2858. saved: RegisterEntry;
  2859. reg: IntermediateCode.Operand;
  2860. procedureName: SyntaxTree.IdentifierString;
  2861. BEGIN
  2862. procedureName := "CompareString";
  2863. SaveRegisters();ReleaseUsedRegisters(saved);
  2864. Designate(leftExpression,left);
  2865. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2866. Emit(Push(position,leftSize));
  2867. ReleaseIntermediateOperand(leftSize);
  2868. Emit(Push(position,left.op));
  2869. ReleaseOperand(left);
  2870. Designate(rightExpression,right);
  2871. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2872. Emit(Push(position,rightSize));
  2873. ReleaseIntermediateOperand(rightSize);
  2874. Emit(Push(position,right.op));
  2875. ReleaseOperand(right);
  2876. IF backend.cooperative THEN
  2877. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2878. ELSE
  2879. CallThis(position,runtimeModuleName,procedureName, 4);
  2880. END;
  2881. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2882. Emit(Result(position,reg));
  2883. (*
  2884. AcquireThisRegister(int8,IntermediateCode.Result);
  2885. *)
  2886. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2887. (*
  2888. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2889. *)
  2890. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2891. ReleaseIntermediateOperand(reg);
  2892. BrL(falseLabel);
  2893. END CompareString;
  2894. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2895. VAR
  2896. left,right: Operand;
  2897. leftSize, rightSize: IntermediateCode.Operand;
  2898. saved: RegisterEntry;
  2899. procedureName: SyntaxTree.IdentifierString;
  2900. BEGIN
  2901. procedureName := "CopyString";
  2902. SaveRegisters();ReleaseUsedRegisters(saved);
  2903. Designate(leftExpression,left);
  2904. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2905. Emit(Push(position,leftSize));
  2906. ReleaseIntermediateOperand(leftSize);
  2907. Emit(Push(position,left.op));
  2908. ReleaseOperand(left);
  2909. Designate(rightExpression,right);
  2910. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2911. Emit(Push(position,rightSize));
  2912. ReleaseIntermediateOperand(rightSize);
  2913. Emit(Push(position,right.op));
  2914. ReleaseOperand(right);
  2915. IF backend.cooperative THEN
  2916. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2917. ELSE
  2918. CallThis(position,runtimeModuleName,procedureName,4);
  2919. END;
  2920. RestoreRegisters(saved);
  2921. END CopyString;
  2922. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2923. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2924. leftType,rightType: SyntaxTree.Type;
  2925. leftExpression,rightExpression : SyntaxTree.Expression;
  2926. componentType: IntermediateCode.Type;
  2927. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2928. size: LONGINT;
  2929. BEGIN
  2930. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2931. dest := destination; destination := emptyOperand;
  2932. leftType := x.left.type.resolved;
  2933. rightType := x.right.type.resolved;
  2934. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2935. CASE x.operator OF
  2936. Scanner.Or:
  2937. (* shortcut evaluation of left OR right *)
  2938. IF ~conditional THEN ConditionToValue(x);
  2939. ELSE
  2940. next := NewLabel();
  2941. Condition(x.left,trueLabel,next);
  2942. SetLabel(next);
  2943. Condition(x.right,trueLabel,falseLabel);
  2944. END;
  2945. |Scanner.And:
  2946. (* shortcut evaluation of left & right *)
  2947. IF ~conditional THEN ConditionToValue(x);
  2948. ELSE
  2949. next := NewLabel();
  2950. Condition(x.left,next,falseLabel);
  2951. SetLabel(next);
  2952. Condition(x.right,trueLabel,falseLabel);
  2953. END;
  2954. |Scanner.Is:
  2955. IF ~conditional THEN ConditionToValue(x);
  2956. ELSE
  2957. (* get type desc tag *)
  2958. IF IsPointerToRecord(leftType,recordType) THEN
  2959. Evaluate(x.left,left);
  2960. Dereference(left,recordType,IsUnsafePointer(leftType))
  2961. ELSE
  2962. Designate(x.left,left);
  2963. END;
  2964. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2965. ReleaseOperand(left);
  2966. END;
  2967. |Scanner.Plus:
  2968. Evaluate(x.left,left);
  2969. Evaluate(x.right,right);
  2970. IF leftType IS SyntaxTree.SetType THEN
  2971. InitOperand(result,ModeValue);
  2972. Reuse2a(result.op,left.op,right.op,dest);
  2973. Emit(Or(position,result.op,left.op,right.op));
  2974. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2975. InitOperand(result,ModeValue);
  2976. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2977. Reuse2(result.tag,left.tag,right.tag);
  2978. Emit(Add(position,result.op,left.op,right.op));
  2979. Emit(Add(position,result.tag,left.tag,right.tag))
  2980. ELSE
  2981. InitOperand(result,ModeValue);
  2982. Reuse2a(result.op,left.op,right.op,dest);
  2983. Emit(Add(position,result.op,left.op,right.op));
  2984. END;
  2985. ReleaseOperand(left); ReleaseOperand(right);
  2986. |Scanner.Minus:
  2987. Evaluate(x.left,left);
  2988. Evaluate(x.right,right);
  2989. IF leftType IS SyntaxTree.SetType THEN
  2990. InitOperand(result,ModeValue);
  2991. Reuse1(result.op,right.op);
  2992. Emit(Not(position,result.op,right.op));
  2993. ReleaseOperand(right);
  2994. Emit(And(position,result.op,result.op,left.op));
  2995. ReleaseOperand(left);
  2996. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2997. InitOperand(result,ModeValue);
  2998. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2999. Reuse2(result.tag,left.tag,right.tag);
  3000. Emit(Sub(position,result.op,left.op,right.op));
  3001. Emit(Sub(position,result.tag,left.tag,right.tag));
  3002. ReleaseOperand(left); ReleaseOperand(right)
  3003. ELSE
  3004. InitOperand(result,ModeValue);
  3005. Reuse2a(result.op,left.op,right.op,dest);
  3006. Emit(Sub(position,result.op,left.op,right.op));
  3007. ReleaseOperand(left); ReleaseOperand(right);
  3008. END;
  3009. |Scanner.Times:
  3010. Evaluate(x.left,left);
  3011. Evaluate(x.right,right);
  3012. IF leftType IS SyntaxTree.SetType THEN
  3013. InitOperand(result,ModeValue);
  3014. Reuse2a(result.op,left.op,right.op,dest);
  3015. Emit(And(position,result.op,left.op,right.op));
  3016. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3017. InitOperand(result,ModeValue);
  3018. Reuse1a(result.op,left.op,dest);
  3019. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  3020. Emit(Shl(position,result.op,left.op,right.op));
  3021. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3022. InitOperand(result, ModeValue);
  3023. componentType := left.op.type;
  3024. (* TODO: review this *)
  3025. (*
  3026. result.op = left.op * right.op - left.tag * right.tag
  3027. result.tag = left.tag * right.op + left.op * right.tag
  3028. *)
  3029. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3030. Emit(Mul(position,result.op, left.op, right.op));
  3031. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3032. Emit(Mul(position,tempReg, left.tag, right.tag));
  3033. Emit(Sub(position,result.op, result.op, tempReg));
  3034. Reuse2(result.tag, left.tag, right.op);
  3035. Emit(Mul(position,result.tag, left.tag, right.op));
  3036. Emit(Mul(position,tempReg, left.op, right.tag));
  3037. Emit(Add(position,result.tag, result.tag, tempReg));
  3038. ReleaseIntermediateOperand(tempReg)
  3039. ELSE
  3040. InitOperand(result,ModeValue);
  3041. Reuse2a(result.op,left.op,right.op,dest);
  3042. Emit(Mul(position,result.op,left.op,right.op));
  3043. END;
  3044. ReleaseOperand(left); ReleaseOperand(right);
  3045. |Scanner.Div:
  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. InitOperand(result,ModeValue);
  3050. Reuse1a(result.op,left.op,dest);
  3051. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  3052. Emit(Shr(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(Div(position,result.op,left.op,right.op));
  3066. END;
  3067. ReleaseOperand(left); ReleaseOperand(right);
  3068. |Scanner.Mod:
  3069. Evaluate(x.left,left);
  3070. Evaluate(x.right,right);
  3071. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3072. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  3073. InitOperand(result,ModeValue);
  3074. Reuse1a(result.op,left.op,dest);
  3075. Emit(And(position,result.op,left.op,right.op));
  3076. ELSE
  3077. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3078. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3079. IF ~isUnchecked THEN
  3080. exit := NewLabel();
  3081. BrltL(exit,zero,right.op);
  3082. EmitTrap(position,NegativeDivisorTrap);
  3083. SetLabel(exit);
  3084. END;
  3085. END;
  3086. InitOperand(result,ModeValue);
  3087. Reuse2a(result.op,left.op,right.op,dest);
  3088. Emit(Mod(position,result.op,left.op,right.op));
  3089. END;
  3090. ReleaseOperand(left); ReleaseOperand(right);
  3091. |Scanner.Slash:
  3092. Evaluate(x.left,left);
  3093. Evaluate(x.right,right);
  3094. IF leftType IS SyntaxTree.SetType THEN
  3095. InitOperand(result,ModeValue);
  3096. Reuse2a(result.op,left.op,right.op,dest);
  3097. Emit(Xor(position,result.op,left.op,right.op));
  3098. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3099. InitOperand(result,ModeValue);
  3100. componentType := left.op.type;
  3101. (* review this *)
  3102. (*
  3103. divisor = right.op * right.op + right.tag * right.tag
  3104. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3105. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3106. *)
  3107. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3108. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3109. Emit(Mul(position,tempReg, right.op, right.op));
  3110. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3111. Emit(Add(position,tempReg, tempReg, tempReg2));
  3112. result.op := tempReg2;
  3113. Emit(Mul(position,result.op, left.op, right.op));
  3114. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3115. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3116. Emit(Add(position,result.op, result.op, tempReg2));
  3117. Emit(Div(position,result.op, result.op, tempReg));
  3118. Reuse2(result.tag, left.tag, right.op);
  3119. Emit(Mul(position,result.tag, left.tag, right.op));
  3120. Emit(Mul(position,tempReg2, left.op, right.tag));
  3121. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3122. Emit(Div(position,result.tag, result.tag, tempReg));
  3123. ReleaseIntermediateOperand(tempReg);
  3124. ReleaseIntermediateOperand(tempReg2)
  3125. ELSE
  3126. InitOperand(result,ModeValue);
  3127. Reuse2a(result.op,left.op,right.op,dest);
  3128. Emit(Div(position,result.op,left.op,right.op));
  3129. END;
  3130. ReleaseOperand(left); ReleaseOperand(right);
  3131. |Scanner.Equal:
  3132. IF ~conditional THEN ConditionToValue(x);
  3133. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3134. CompareString(BreqL,x.left,x.right);
  3135. ELSE
  3136. Evaluate(x.left,left);
  3137. Evaluate(x.right,right);
  3138. IF leftType IS SyntaxTree.RangeType THEN
  3139. ASSERT(rightType IS SyntaxTree.RangeType);
  3140. BrneL(falseLabel, left.op, right.op); (* first *)
  3141. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3142. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3143. ReleaseOperand(left); ReleaseOperand(right);
  3144. BrL(trueLabel)
  3145. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3146. BrneL(falseLabel, left.op, right.op); (* first *)
  3147. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3148. ReleaseOperand(left); ReleaseOperand(right);
  3149. BrL(trueLabel)
  3150. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3151. (* TODO: review this *)
  3152. BrneL(falseLabel, left.op, right.op); (* real part *)
  3153. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3154. ReleaseOperand(left); ReleaseOperand(right);
  3155. BrL(trueLabel)
  3156. ELSE
  3157. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3158. ReleaseOperand(left); ReleaseOperand(right);
  3159. BrL(trueLabel);
  3160. END;
  3161. END;
  3162. |Scanner.LessEqual:
  3163. IF ~conditional THEN ConditionToValue(x);
  3164. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3165. CompareString(BrgeL,x.right,x.left);
  3166. ELSE
  3167. Evaluate(x.left,left);
  3168. Evaluate(x.right,right);
  3169. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3170. Reuse1(temp.op,right.op);
  3171. Emit(And(position,temp.op,left.op,right.op));
  3172. ReleaseOperand(right);
  3173. BreqL(trueLabel,temp.op,left.op);
  3174. BrL(falseLabel);
  3175. ReleaseOperand(temp);ReleaseOperand(left);
  3176. ELSE
  3177. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3178. ReleaseOperand(left); ReleaseOperand(right);
  3179. BrL(trueLabel);
  3180. END;
  3181. END;
  3182. |Scanner.Less:
  3183. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3184. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3185. leftExpression.SetType(system.booleanType);
  3186. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3187. rightExpression.SetType(system.booleanType);
  3188. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3189. leftExpression.SetType(system.booleanType);
  3190. Expression(leftExpression);
  3191. ELSIF ~conditional THEN ConditionToValue(x);
  3192. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3193. CompareString(BrltL,x.left,x.right);
  3194. ELSE
  3195. Evaluate(x.left,left);
  3196. Evaluate(x.right,right);
  3197. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3198. ReleaseOperand(left); ReleaseOperand(right);
  3199. BrL(trueLabel);
  3200. END;
  3201. |Scanner.Greater:
  3202. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3203. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3204. leftExpression.SetType(system.booleanType);
  3205. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3206. rightExpression.SetType(system.booleanType);
  3207. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3208. leftExpression.SetType(system.booleanType);
  3209. Expression(leftExpression);
  3210. ELSIF ~conditional THEN ConditionToValue(x);
  3211. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3212. CompareString(BrltL,x.right,x.left);
  3213. ELSE
  3214. Evaluate(x.left,left);
  3215. Evaluate(x.right,right);
  3216. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3217. ReleaseOperand(left); ReleaseOperand(right);
  3218. BrL(trueLabel);
  3219. END;
  3220. |Scanner.GreaterEqual:
  3221. IF ~conditional THEN ConditionToValue(x);
  3222. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3223. CompareString(BrgeL,x.left,x.right);
  3224. ELSE
  3225. Evaluate(x.left,left);
  3226. Evaluate(x.right,right);
  3227. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3228. Reuse1(temp.op,left.op);
  3229. Emit(And(position,temp.op,left.op,right.op));
  3230. ReleaseOperand(left);
  3231. BreqL(trueLabel, temp.op,right.op);
  3232. ReleaseOperand(temp); ReleaseOperand(right);
  3233. BrL(falseLabel);
  3234. ELSE
  3235. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3236. ReleaseOperand(left); ReleaseOperand(right);
  3237. BrL(trueLabel);
  3238. END;
  3239. END;
  3240. |Scanner.Unequal:
  3241. IF ~conditional THEN ConditionToValue(x);
  3242. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3243. CompareString(BrneL,x.left,x.right);
  3244. ELSE
  3245. Evaluate(x.left,left);
  3246. Evaluate(x.right,right);
  3247. IF leftType IS SyntaxTree.RangeType THEN
  3248. ASSERT(rightType IS SyntaxTree.RangeType);
  3249. BrneL(trueLabel, left.op, right.op); (* first *)
  3250. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3251. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3252. ReleaseOperand(left); ReleaseOperand(right);
  3253. BrL(falseLabel)
  3254. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3255. BrneL(trueLabel, left.op, right.op); (* first *)
  3256. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3257. ReleaseOperand(left); ReleaseOperand(right);
  3258. BrL(falseLabel)
  3259. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3260. (* TODO: review this *)
  3261. BrneL(trueLabel, left.op, right.op); (* real part *)
  3262. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3263. ReleaseOperand(left); ReleaseOperand(right);
  3264. BrL(falseLabel)
  3265. ELSE
  3266. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3267. ReleaseOperand(left); ReleaseOperand(right);
  3268. BrL(trueLabel);
  3269. END;
  3270. END;
  3271. |Scanner.In:
  3272. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3273. Evaluate(x.left,left);
  3274. Evaluate(x.right,right);
  3275. Convert(left.op,setType);
  3276. ReuseCopy(temp.op,right.op);
  3277. Emit(Shr(position,temp.op,temp.op,left.op));
  3278. ReleaseOperand(right); ReleaseOperand(left);
  3279. IntermediateCode.InitImmediate(one,setType,1);
  3280. Emit(And(position,temp.op,temp.op,one));
  3281. IF conditional THEN
  3282. IntermediateCode.InitImmediate(zero,setType,0);
  3283. BrneL(trueLabel,temp.op,zero);
  3284. ReleaseOperand(temp);
  3285. BrL(falseLabel);
  3286. ELSE
  3287. Convert(temp.op,bool);
  3288. result.mode := ModeValue;
  3289. result.op := temp.op;
  3290. result.tag := nil; (* may be left over from calls to evaluate *)
  3291. END;
  3292. ELSE
  3293. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3294. IF x.operator = Scanner.Questionmarks THEN
  3295. leftExpression := x.left;
  3296. rightExpression := x.right;
  3297. ELSE
  3298. leftExpression := x.right;
  3299. rightExpression := x.left;
  3300. END;
  3301. Evaluate(leftExpression, left);
  3302. Emit(Push(position,left.op));
  3303. ReleaseOperand(left);
  3304. Designate(rightExpression, right);
  3305. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3306. IF ~backend.cellsAreObjects THEN
  3307. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3308. END;
  3309. Emit(Push(position,right.op));
  3310. ReleaseOperand(right);
  3311. IF backend.cellsAreObjects THEN
  3312. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3313. ELSE
  3314. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3315. END;
  3316. InitOperand(result, ModeValue);
  3317. result.op := NewRegisterOperand(bool);
  3318. Emit(Result(position,result.op));
  3319. IF conditional THEN
  3320. IntermediateCode.InitImmediate(zero,setType,0);
  3321. BrneL(trueLabel,result.op,zero);
  3322. ReleaseOperand(result);
  3323. BrL(falseLabel);
  3324. END;
  3325. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3326. leftExpression := x.left;
  3327. rightExpression := x.right;
  3328. Evaluate(leftExpression, left);
  3329. Emit(Push(position,left.op));
  3330. ReleaseOperand(left);
  3331. Evaluate(rightExpression, right);
  3332. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3333. IF ~backend.cellsAreObjects THEN
  3334. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3335. END;
  3336. Emit(Push(position,right.op));
  3337. ReleaseOperand(right);
  3338. IF backend.cellsAreObjects THEN
  3339. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3340. ELSE
  3341. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3342. END;
  3343. InitOperand(result, ModeValue);
  3344. result.op := NewRegisterOperand(bool);
  3345. Emit(Result(position,result.op));
  3346. IF conditional THEN
  3347. IntermediateCode.InitImmediate(zero,setType,0);
  3348. BrneL(trueLabel,result.op,zero);
  3349. ReleaseOperand(result);
  3350. BrL(falseLabel);
  3351. END;
  3352. ELSE
  3353. HALT(100);
  3354. END;
  3355. END;
  3356. destination := dest;
  3357. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3358. END VisitBinaryExpression;
  3359. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3360. VAR localResult, operand: Operand;
  3361. BEGIN
  3362. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3363. InitOperand(localResult, ModeValue);
  3364. ASSERT(x.first # NIL);
  3365. Evaluate(x.first, operand);
  3366. localResult.op := operand.op;
  3367. ReleaseOperand(operand);
  3368. UseIntermediateOperand(localResult.op);
  3369. ASSERT(x.last # NIL);
  3370. Evaluate(x.last, operand);
  3371. localResult.tag := operand.op;
  3372. ReleaseOperand(operand);
  3373. UseIntermediateOperand(localResult.tag);
  3374. IF x.step # NIL THEN
  3375. Evaluate(x.step, operand);
  3376. localResult.extra := operand.op;
  3377. ReleaseOperand(operand);
  3378. UseIntermediateOperand(localResult.extra);
  3379. END;
  3380. result := localResult;
  3381. IF Trace THEN TraceExit("VisitRangeExpression") END
  3382. END VisitRangeExpression;
  3383. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3384. BEGIN
  3385. HALT(100); (* should never be evaluated *)
  3386. END VisitTensorRangeExpression;
  3387. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3388. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3389. BEGIN
  3390. IF Trace THEN TraceEnter("VisitConversion") END;
  3391. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3392. dest := destination; destination := emptyOperand;
  3393. Evaluate(x.expression,old);
  3394. InitOperand(result,ModeValue);
  3395. result.op := old.op;
  3396. ASSERT(result.op.mode # 0);
  3397. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3398. (* convert TO a complex number *)
  3399. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3400. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3401. ASSERT(result.op.mode # 0);
  3402. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3403. (* convert FROM a complex number TO a complex number*)
  3404. result.tag := old.tag;
  3405. ASSERT(result.tag.mode # 0);
  3406. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3407. ASSERT(result.tag.mode # 0)
  3408. ELSE
  3409. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3410. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3411. END
  3412. ELSE
  3413. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3414. ASSERT(result.op.mode # 0);
  3415. result.tag := old.tag; (*! probably never used *)
  3416. END;
  3417. destination := dest;
  3418. IF Trace THEN TraceExit("VisitConversion") END;
  3419. END VisitConversion;
  3420. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3421. BEGIN
  3422. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3423. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3424. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3425. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3426. END VisitTypeDeclaration;
  3427. (** designators (expressions) *)
  3428. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3429. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3430. BEGIN
  3431. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3432. IF x.left # NIL THEN Expression(x.left) END;
  3433. Symbol(x.symbol,result);
  3434. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3435. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3436. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3437. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3438. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3439. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3440. END;
  3441. END;
  3442. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3443. END VisitSymbolDesignator;
  3444. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3445. BEGIN
  3446. IF isUnchecked THEN RETURN END;
  3447. IF tagsAvailable THEN
  3448. TrapC(BrltL,index,length,IndexCheckTrap);
  3449. END;
  3450. END BoundCheck;
  3451. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3452. VAR d: IntermediateCode.Operand;
  3453. BEGIN
  3454. IF isUnchecked THEN RETURN END;
  3455. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3456. TrapC(op,dim,d,ArraySizeTrap);
  3457. ReleaseIntermediateOperand(d);
  3458. END DimensionCheck;
  3459. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3460. VAR
  3461. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3462. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3463. expression: SyntaxTree.Expression;
  3464. resultingType, leftType, baseType: SyntaxTree.Type;
  3465. skipLabel1: Label;
  3466. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3467. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3468. variableOp: Operand;
  3469. variable: SyntaxTree.Variable;
  3470. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3471. VAR expression: SyntaxTree.Expression;
  3472. BEGIN
  3473. (* count the number of indices, ranges and tensorRanges in the index list *)
  3474. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3475. FOR i := 0 TO parameters.Length() - 1 DO
  3476. expression := parameters.GetExpression(i);
  3477. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3478. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3479. ELSE INC(indexCount)
  3480. END
  3481. END;
  3482. END CountIndices;
  3483. BEGIN
  3484. ASSERT(tagsAvailable);
  3485. resultingType := x.type.resolved; (* resulting type *)
  3486. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3487. InitOperand(localResult, ModeReference);
  3488. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3489. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3490. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3491. (* a globally defined array destination tag is available -> use and invalidate it*)
  3492. localResult.tag := arrayDestinationTag;
  3493. IntermediateCode.InitOperand(arrayDestinationTag)
  3494. ELSE
  3495. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3496. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3497. Symbol(variable, variableOp);
  3498. ReuseCopy(localResult.tag, variableOp.op);
  3499. ReleaseOperand(variableOp);
  3500. END
  3501. END;
  3502. indexListSize := x.parameters.Length();
  3503. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3504. ASSERT(tensorRangeCount <= 1);
  3505. (* designate the array to be indexed over, perform tensor range check if known *)
  3506. Designate(x.left, array);
  3507. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3508. Dereference(array, leftType,FALSE);
  3509. IF tensorRangeCount=0 THEN
  3510. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3511. END
  3512. END;
  3513. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3514. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3515. srcDimOffset := -indexListSize;
  3516. destDimOffset := -rangeCount
  3517. ELSE
  3518. srcDimOffset := 0;
  3519. destDimOffset := 0
  3520. END;
  3521. indexDim := 0;
  3522. (* use address of source array as basis *)
  3523. (*
  3524. ReuseCopy(localResult.op, array.op);
  3525. *)
  3526. localResult.op := array.op;
  3527. UseIntermediateOperand(localResult.op);
  3528. (* go through the index list *)
  3529. FOR i := 0 TO indexListSize - 1 DO
  3530. expression := x.parameters.GetExpression(i);
  3531. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3532. (* nothing to do *)
  3533. ELSE
  3534. (* determine which dimension of source array is currently looked at *)
  3535. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3536. (* get the memory operand pointing to array descriptor dimension *)
  3537. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3538. (* make a reusable register from it *)
  3539. ReuseCopy(srcDim, tmp);
  3540. ReleaseIntermediateOperand(tmp);
  3541. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3542. ELSE
  3543. srcDim := IntermediateCode.Immediate(int32, i)
  3544. END;
  3545. (* get length and increment of source array for current dimension *)
  3546. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3547. Convert(sourceLength.op, sizeType);
  3548. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3549. Convert(sourceIncrement.op, sizeType);
  3550. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3551. ReleaseIntermediateOperand(srcDim);
  3552. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3553. (* SINGLE INDEX *)
  3554. Evaluate(expression, index);
  3555. ReleaseIntermediateOperand(index.tag);
  3556. index.tag := emptyOperand;
  3557. Convert(index.op, sizeType);
  3558. (* lower bound check *)
  3559. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3560. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3561. ELSIF isUnchecked THEN (* do nothing *)
  3562. ELSE
  3563. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3564. END;
  3565. (* upper bound check *)
  3566. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3567. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3568. ELSIF isUnchecked THEN (* do nothing *)
  3569. ELSE
  3570. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3571. END;
  3572. ReleaseOperand(sourceLength);
  3573. Convert(index.op, addressType);
  3574. summand := index.op;
  3575. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3576. (* RANGE OF INDICES *)
  3577. Evaluate(expression, range);
  3578. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3579. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3580. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3581. ReleaseOperand(range);
  3582. Convert(firstIndex, sizeType);
  3583. Convert(lastIndex, sizeType);
  3584. Convert(stepSize, sizeType);
  3585. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3586. if it is 'MAX(LONGINT)' *)
  3587. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3588. TransferToRegister(lastIndex, lastIndex);
  3589. skipLabel1 := NewLabel();
  3590. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3591. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3592. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3593. SetLabel(skipLabel1)
  3594. END;
  3595. (* check if step size is valid *)
  3596. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3597. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3598. ELSIF isUnchecked THEN (* do nothing *)
  3599. ELSE
  3600. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3601. END;
  3602. (* check lower bound check *)
  3603. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3604. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3605. ELSIF isUnchecked THEN (* do nothing *)
  3606. ELSE
  3607. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3608. END;
  3609. (* check upper bound check *)
  3610. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3611. (* statically open range: nothing to do *)
  3612. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3613. ASSERT(staticLastIndex < staticSourceLength)
  3614. ELSIF isUnchecked THEN (* do nothing *)
  3615. ELSE
  3616. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3617. END;
  3618. (* determine length of target array for current dimension *)
  3619. (* 1. incorporate last index: *)
  3620. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3621. (* last index is static *)
  3622. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3623. targetLength := sourceLength.op
  3624. ELSE
  3625. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3626. END;
  3627. UseIntermediateOperand(targetLength);
  3628. ELSE
  3629. (* targetLength := lastIndex + 1
  3630. Reuse1(targetLength, lastIndex);
  3631. *)
  3632. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3633. END;
  3634. ReleaseOperand(sourceLength);
  3635. ReleaseIntermediateOperand(lastIndex);
  3636. (* 2. incorporate first index: *)
  3637. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3638. (* first index and current target length are static *)
  3639. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3640. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3641. (* first index = 0: nothing to do *)
  3642. ELSE
  3643. (* targetLength := targetLength - firstIndex *)
  3644. TransferToRegister(targetLength, targetLength);
  3645. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3646. END;
  3647. (* clip negative lengths to 0 *)
  3648. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3649. IF staticTargetLength < 0 THEN
  3650. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3651. END
  3652. ELSE
  3653. skipLabel1 := NewLabel();
  3654. TransferToRegister(targetLength, targetLength);
  3655. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3656. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3657. SetLabel(skipLabel1)
  3658. END;
  3659. (* 3. incorporate index step size: *)
  3660. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3661. (*step size and current target length are static *)
  3662. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3663. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3664. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3665. (* step size = 1: nothing to do *)
  3666. ELSE
  3667. (* emit code for this:
  3668. targetLength := (targetLength-1) DIV stepSize +1;
  3669. *)
  3670. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3671. DivInt(targetLength, targetLength, stepSize);
  3672. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3673. END;
  3674. (* determine increment of target array for current dimension *)
  3675. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3676. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3677. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3678. (* step size = 1 *)
  3679. targetIncrement := sourceIncrement.op;
  3680. UseIntermediateOperand(targetIncrement)
  3681. ELSE
  3682. (* targetIncrement := sourceIncrement * stepSize *)
  3683. Reuse1(targetIncrement, stepSize);
  3684. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3685. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3686. END;
  3687. ReleaseIntermediateOperand(stepSize);
  3688. (* write length and increment of target array to descriptor *)
  3689. IF destDimOffset < 0 THEN
  3690. (* determine which dimension of target array is currently looked at *)
  3691. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3692. TransferToRegister(destDim, tmp);
  3693. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3694. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3695. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3696. ReleaseIntermediateOperand(destDim)
  3697. ELSE
  3698. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3699. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3700. END;
  3701. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3702. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3703. INC(indexDim);
  3704. Convert(firstIndex, addressType);
  3705. TransferToRegister(summand, firstIndex);
  3706. ELSE HALT(100);
  3707. END;
  3708. (*
  3709. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3710. *)
  3711. Convert(sourceIncrement.op, addressType);
  3712. Convert(summand, addressType);
  3713. MulInt(summand, summand, sourceIncrement.op);
  3714. ReleaseIntermediateOperand(sourceIncrement.op);
  3715. AddInt(localResult.op, localResult.op, summand);
  3716. ReleaseIntermediateOperand(summand);
  3717. END
  3718. END;
  3719. result := localResult;
  3720. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3721. ReleaseIntermediateOperand(result.tag);
  3722. result.tag := TypeDescriptorAdr(resultingType);
  3723. IF ~newObjectFile THEN
  3724. IntermediateCode.MakeMemory(result.tag,addressType);
  3725. END;
  3726. ELSIF IsDelegate(resultingType) THEN
  3727. ReleaseIntermediateOperand(result.tag);
  3728. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3729. UseIntermediateOperand(result.tag);
  3730. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3731. ReleaseIntermediateOperand(result.tag);
  3732. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3733. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3734. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3735. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3736. (* finalize target array descriptor *)
  3737. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3738. (* write lengths and increments of target array for remaining dimensions *)
  3739. i := indexListSize;
  3740. WHILE indexDim < targetArrayDimensionality DO
  3741. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3742. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3743. ReleaseOperand(sourceLength);
  3744. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3745. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3746. ReleaseOperand(sourceIncrement);
  3747. INC(i); INC(indexDim);
  3748. END;
  3749. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3750. tmp := nil;
  3751. ELSE
  3752. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3753. END;
  3754. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3755. ReleaseIntermediateOperand(tmp);
  3756. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3757. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3758. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3759. ELSE
  3760. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3761. END;
  3762. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3763. ReleaseIntermediateOperand(tmp);
  3764. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3765. (* write dimensionality *)
  3766. IF targetArrayDimensionality # 0 THEN
  3767. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3768. END;
  3769. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3770. END;
  3771. ReleaseOperand(array);
  3772. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3773. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3774. END;
  3775. END MathIndexDesignator;
  3776. (* TENTATIVE *)
  3777. PROCEDURE DumpOperand(operand: Operand);
  3778. BEGIN
  3779. D.Log.String(" op = ");
  3780. IntermediateCode.DumpOperand(D.Log, operand.op );
  3781. D.Log.Ln;
  3782. D.Log.String(" tag = ");
  3783. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3784. D.Log.Ln;
  3785. D.Log.String(" extra = ");
  3786. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3787. D.Log.Ln;
  3788. D.Log.Update
  3789. END DumpOperand;
  3790. (* get the length of an array , trying to make use of static information *)
  3791. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3792. VAR res: IntermediateCode.Operand; size: LONGINT;
  3793. BEGIN
  3794. type := type.resolved;
  3795. IF type IS SyntaxTree.ArrayType THEN
  3796. WITH type: SyntaxTree.ArrayType DO
  3797. IF type.form = SyntaxTree.Static THEN
  3798. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3799. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3800. Evaluate(type.length, op);
  3801. ReleaseIntermediateOperand(op.tag);
  3802. RETURN op.op;*)
  3803. ELSE
  3804. res := tag;
  3805. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3806. IntermediateCode.MakeMemory(res,addressType);
  3807. UseIntermediateOperand(res);
  3808. RETURN res
  3809. END
  3810. END;
  3811. ELSE
  3812. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3813. RETURN IntermediateCode.Immediate(addressType,size);
  3814. END;
  3815. END ArrayLength;
  3816. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3817. BEGIN
  3818. ReleaseIntermediateOperand(res);
  3819. IF IsImmediate(x) & IsImmediate(y) THEN
  3820. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3821. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3822. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3823. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3824. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3825. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3826. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3827. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3828. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3829. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3830. UseIntermediateOperand(res);
  3831. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3832. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3833. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3834. UseIntermediateOperand(res);
  3835. ELSE
  3836. IF ~ReusableRegister(res) THEN
  3837. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3838. ELSE
  3839. UseIntermediateOperand(res);
  3840. END;
  3841. IF IsImmediate(x) & (x.intValue = 0) THEN
  3842. Emit(Mov(position,res,y))
  3843. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3844. Emit(Mov(position,res,x))
  3845. ELSE
  3846. Emit(Add(position,res, x, y));
  3847. END;
  3848. END;
  3849. END AddInt;
  3850. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3851. BEGIN
  3852. ReleaseIntermediateOperand(res);
  3853. IF IsImmediate(x) & IsImmediate(y) THEN
  3854. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3855. ELSE
  3856. IF ~ReusableRegister(res) THEN
  3857. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3858. ELSE UseIntermediateOperand(res);
  3859. END;
  3860. IF IsImmediate(x) & (x.intValue = 1) THEN
  3861. Emit(Mov(position,res,y))
  3862. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3863. Emit(Mov(position,res,x))
  3864. ELSE
  3865. Emit(Mul(position,res, x, y));
  3866. END;
  3867. END;
  3868. END MulInt;
  3869. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3870. BEGIN
  3871. ReleaseIntermediateOperand(res);
  3872. IF IsImmediate(x) & IsImmediate(y) THEN
  3873. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3874. ELSE
  3875. IF ~ReusableRegister(res) THEN
  3876. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3877. ELSE UseIntermediateOperand(res);
  3878. END;
  3879. IF IsImmediate(x) & (x.intValue = 1) THEN
  3880. Emit(Mov(position,res,y))
  3881. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3882. Emit(Mov(position,res,x))
  3883. ELSE
  3884. Emit(Div(position,res, x, y));
  3885. END;
  3886. END;
  3887. END DivInt;
  3888. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3889. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3890. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3891. BEGIN
  3892. type := x.left.type.resolved;
  3893. IF type IS SyntaxTree.StringType THEN
  3894. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3895. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3896. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3897. type := atype;
  3898. x.left.SetType(type);
  3899. END;
  3900. IntermediateCode.InitImmediate(res,addressType,0);
  3901. maxDim := x.parameters.Length()-1;
  3902. FOR i := 0 TO maxDim DO
  3903. e := x.parameters.GetExpression(i);
  3904. Evaluate(e,index);
  3905. Convert(index.op,addressType);
  3906. AddInt(res, res, index.op);
  3907. IF i = 0 THEN
  3908. (*
  3909. ReuseCopy(res, index.op);
  3910. *)
  3911. Designate(x.left,array);
  3912. type := x.left.type.resolved;
  3913. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3914. Dereference(array, type, FALSE);
  3915. END;
  3916. (*
  3917. ELSE AddInt(res, res, index.op);
  3918. *)
  3919. END;
  3920. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3921. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3922. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3923. BoundCheck(index.op, length);
  3924. END;
  3925. ReleaseIntermediateOperand(length);
  3926. END;
  3927. ReleaseOperand(index);
  3928. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3929. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3930. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3931. MulInt(res,res,length);
  3932. END;
  3933. ReleaseIntermediateOperand(length);
  3934. END;
  3935. IF (type IS SyntaxTree.ArrayType) THEN
  3936. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3937. size := StaticSize(system, type);
  3938. IF size # 1 THEN
  3939. length := IntermediateCode.Immediate(addressType,size);
  3940. MulInt(res,res,length);
  3941. END;
  3942. ELSE
  3943. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3944. IF size # 1 THEN
  3945. length := IntermediateCode.Immediate(addressType,size);
  3946. MulInt(res,res,length);
  3947. END;
  3948. END;
  3949. END;
  3950. AddInt(res,res,array.op);
  3951. InitOperand(result,ModeReference);
  3952. result.op := res;
  3953. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3954. ReleaseIntermediateOperand(result.tag);
  3955. result.tag := TypeDescriptorAdr(type);
  3956. IF ~newObjectFile THEN
  3957. IntermediateCode.MakeMemory(result.tag,addressType);
  3958. END
  3959. ELSIF IsDelegate(type) THEN
  3960. ReleaseIntermediateOperand(result.tag);
  3961. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3962. UseIntermediateOperand(result.tag);
  3963. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3964. ReleaseIntermediateOperand(result.tag);
  3965. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3966. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3967. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3968. END;
  3969. ReleaseOperand(array);
  3970. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3971. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3972. END;
  3973. END IndexDesignator;
  3974. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3975. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3976. BEGIN
  3977. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3978. dest := destination; destination := emptyOperand;
  3979. type := x.left.type.resolved;
  3980. IF type IS SyntaxTree.MathArrayType THEN
  3981. MathIndexDesignator(x);
  3982. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3983. IndexDesignator(x);
  3984. END;
  3985. destination := dest;
  3986. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3987. END VisitIndexDesignator;
  3988. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3989. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3990. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3991. procedure: SyntaxTree.Procedure;
  3992. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3993. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3994. BEGIN
  3995. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3996. parameters := expression.parameters;
  3997. moduleName := "FoxArrayBase";
  3998. procedureName := "CopyDescriptor";
  3999. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4000. SaveRegisters();ReleaseUsedRegisters(saved);
  4001. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4002. IF procedure = NIL THEN
  4003. s := "procedure ";
  4004. Strings.Append(s,moduleName);
  4005. Strings.Append(s,".");
  4006. Strings.Append(s,procedureName);
  4007. Strings.Append(s," not present");
  4008. Error(position,s);
  4009. ELSE
  4010. (* push address of temporary variable *)
  4011. Symbol(variable,destOperand);
  4012. Emit(Push(position,destOperand.op));
  4013. ReleaseOperand(destOperand);
  4014. (* push src *)
  4015. Evaluate(expression.left,srcOperand);
  4016. (*
  4017. Dereference(srcOperand,expression.type.resolved);
  4018. Emit(Push(position,srcOperand.tag));
  4019. *)
  4020. Emit(Push(position,srcOperand.op));
  4021. ReleaseOperand(srcOperand);
  4022. tensorFound := FALSE;
  4023. FOR i := 0 TO parameters.Length()-1 DO
  4024. e := parameters.GetExpression(i);
  4025. IF e IS SyntaxTree.TensorRangeExpression THEN
  4026. tensorFound := TRUE;
  4027. ELSIF e IS SyntaxTree.RangeExpression THEN
  4028. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4029. ELSE
  4030. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4031. END;
  4032. END;
  4033. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  4034. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  4035. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  4036. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  4037. StaticCallOperand(procOp,procedure);
  4038. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4039. ReleaseOperand(procOp);
  4040. END;
  4041. RestoreRegisters(saved);
  4042. END;
  4043. RETURN variable
  4044. END PrepareTensorDescriptor;
  4045. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4046. VAR
  4047. type, descriptorType, baseType: SyntaxTree.Type;
  4048. operand, tmpOperand, variableOp, variable2Op: Operand;
  4049. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4050. variable, variable2: SyntaxTree.Variable;
  4051. dim, i, size: LONGINT;
  4052. (* TODO: needed? *)
  4053. oldArrayDestinationTag: IntermediateCode.Operand;
  4054. oldArrayDestinationDimension: LONGINT;
  4055. position: LONGINT;
  4056. saved: RegisterEntry;
  4057. arrayFlags: SET;
  4058. m, n: LONGINT;
  4059. PROCEDURE Pass(op: IntermediateCode.Operand);
  4060. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4061. BEGIN
  4062. IF numberRegister >= 0 THEN
  4063. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4064. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4065. Emit(Mov(position,parameterRegister, op));
  4066. ELSE
  4067. Emit(Push(position,op))
  4068. END
  4069. END Pass;
  4070. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4071. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4072. BEGIN
  4073. formalType := formalType.resolved; actualType := actualType.resolved;
  4074. IF IsOpenArray(formalType)THEN
  4075. IF actualType IS SyntaxTree.StringType THEN
  4076. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4077. RETURN;
  4078. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4079. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4080. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4081. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4082. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4083. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4084. ELSE
  4085. tmp := baseReg;
  4086. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4087. IntermediateCode.MakeMemory(tmp,addressType);
  4088. Pass((tmp));
  4089. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4090. END;
  4091. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4092. END;
  4093. END PushArrayLens;
  4094. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4095. BEGIN
  4096. CASE size OF
  4097. |2: INCL(flags,Size2Flag);
  4098. |3: INCL(flags,Size3Flag);
  4099. |4: INCL(flags,Size4Flag);
  4100. |5: INCL(flags,Size5Flag);
  4101. |6: INCL(flags,Size6Flag);
  4102. |7: INCL(flags,Size7Flag);
  4103. |8: INCL(flags,Size8Flag);
  4104. END;
  4105. END SetSmallArraySizeFlag;
  4106. BEGIN
  4107. IF Trace THEN TraceEnter("PushParameter") END;
  4108. position := expression.position;
  4109. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4110. type := expression.type.resolved;
  4111. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4112. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4113. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4114. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4115. );
  4116. (* TODO: needed? *)
  4117. oldArrayDestinationTag := arrayDestinationTag;
  4118. oldArrayDestinationDimension := arrayDestinationDimension;
  4119. IF IsArrayOfSystemByte(parameter.type) THEN
  4120. Designate(expression,operand);
  4121. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4122. ReleaseIntermediateOperand(operand.tag);
  4123. operand.tag := tmp;
  4124. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4125. Pass((operand.tag));
  4126. END;
  4127. Pass((operand.op));
  4128. ELSIF IsOpenArray(parameter.type) THEN
  4129. Designate(expression,operand);
  4130. baseReg := operand.tag;
  4131. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4132. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4133. END;
  4134. Pass((operand.op)); (* address of the array *)
  4135. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4136. (* case 1 *)
  4137. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4138. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4139. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4140. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4141. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4142. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4143. arrayDestinationTag := sp;
  4144. (* case 1b *)
  4145. IF expression IS SyntaxTree.IndexDesignator THEN
  4146. (*
  4147. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4148. descriptorType := GetMathArrayDescriptorType(dim);
  4149. variable := GetTemporaryVariable(descriptorType,expression.position);
  4150. Symbol(variable,variableOp);
  4151. arrayDestinationTag := variableOp.op;
  4152. *)
  4153. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4154. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4155. arrayDestinationDimension := dim;
  4156. Designate(expression,operand);
  4157. (* case 1a *)
  4158. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4159. Designate(expression,operand);
  4160. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4161. i := 0;
  4162. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4163. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4164. INC(i);
  4165. END;
  4166. type := expression.type.resolved;
  4167. WHILE (i<dim) DO (* remaining static dimensions *)
  4168. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4169. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4170. ReleaseOperand(tmpOperand);
  4171. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4172. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4173. ReleaseOperand(tmpOperand);
  4174. INC(i);
  4175. END;
  4176. dimOp := IntermediateCode.Immediate(addressType,dim);
  4177. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4178. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4179. (* case 1d *)
  4180. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4181. Designate(expression,operand);
  4182. Dereference(operand,type.resolved,FALSE);
  4183. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4184. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4185. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4186. (* case 1f *)
  4187. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4188. Designate(expression,operand);
  4189. FOR i := 0 TO dim-1 DO
  4190. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4191. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4192. ReleaseOperand(tmpOperand);
  4193. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4194. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4195. ReleaseOperand(tmpOperand);
  4196. END;
  4197. (*******
  4198. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4199. *)
  4200. arrayFlags := {StaticFlag};
  4201. IF dim = 1 THEN
  4202. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4203. ReleaseOperand(tmpOperand);
  4204. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4205. m := LONGINT(tmpOperand.op.intValue);
  4206. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4207. ELSIF dim = 2 THEN
  4208. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4209. ReleaseOperand(tmpOperand);
  4210. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4211. m := LONGINT(tmpOperand.op.intValue);
  4212. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4213. ReleaseOperand(tmpOperand);
  4214. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4215. n := LONGINT(tmpOperand.op.intValue);
  4216. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4217. INCL(arrayFlags,SmallMatrixFlag);
  4218. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4219. END;
  4220. END;
  4221. (*******)
  4222. dimOp := IntermediateCode.Immediate(addressType,dim);
  4223. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4224. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4225. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4226. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4227. baseType := SemanticChecker.ArrayBase(type,dim);
  4228. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4229. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4230. ELSE HALT(100);
  4231. END;
  4232. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4233. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4234. (* case 2b *)
  4235. IF expression IS SyntaxTree.IndexDesignator THEN
  4236. descriptorType := GetMathArrayDescriptorType(dim);
  4237. variable := GetTemporaryVariable(descriptorType, FALSE);
  4238. Symbol(variable,variableOp);
  4239. arrayDestinationTag := variableOp.op;
  4240. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4241. arrayDestinationDimension := dim;
  4242. NeedDescriptor := TRUE;
  4243. Designate(expression,operand);
  4244. Pass((operand.tag));
  4245. NeedDescriptor := FALSE;
  4246. (* case 2a *)
  4247. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4248. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4249. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4250. INC(i);
  4251. END;
  4252. IF i = dim THEN
  4253. Designate(expression,operand);
  4254. Pass((operand.tag));
  4255. ELSE (* open-static *)
  4256. type := expression.type.resolved;
  4257. descriptorType := GetMathArrayDescriptorType(dim);
  4258. variable := GetTemporaryVariable(descriptorType, FALSE);
  4259. Symbol(variable,variableOp);
  4260. arrayDestinationTag := variableOp.op;
  4261. Designate(expression,operand);
  4262. FOR i := 0 TO dim-1 DO
  4263. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4264. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4265. ReleaseOperand(tmpOperand);
  4266. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4267. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4268. ReleaseOperand(tmpOperand);
  4269. END;
  4270. dimOp := IntermediateCode.Immediate(addressType,dim);
  4271. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4272. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4273. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4274. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4275. baseType := SemanticChecker.ArrayBase(type,dim);
  4276. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4277. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4278. Pass((arrayDestinationTag));
  4279. END;
  4280. (* case 2d *)
  4281. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4282. Designate(expression,operand);
  4283. Dereference(operand,type.resolved,FALSE);
  4284. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4285. Pass((operand.tag));
  4286. (* case 2f *)
  4287. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4288. descriptorType := GetMathArrayDescriptorType(dim);
  4289. variable := GetTemporaryVariable(descriptorType, FALSE);
  4290. Symbol(variable,variableOp);
  4291. arrayDestinationTag := variableOp.op;
  4292. Designate(expression,operand);
  4293. FOR i := 0 TO dim-1 DO
  4294. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4295. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4296. ReleaseOperand(tmpOperand);
  4297. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4298. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4299. ReleaseOperand(tmpOperand);
  4300. END;
  4301. (*
  4302. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4303. *)
  4304. arrayFlags := {StaticFlag};
  4305. IF dim = 1 THEN
  4306. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4307. ReleaseOperand(tmpOperand);
  4308. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4309. m := LONGINT(tmpOperand.op.intValue);
  4310. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4311. ELSIF dim = 2 THEN
  4312. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4313. ReleaseOperand(tmpOperand);
  4314. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4315. m := LONGINT(tmpOperand.op.intValue);
  4316. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4317. ReleaseOperand(tmpOperand);
  4318. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4319. n := LONGINT(tmpOperand.op.intValue);
  4320. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4321. INCL(arrayFlags,SmallMatrixFlag);
  4322. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4323. END;
  4324. END;
  4325. (*******)
  4326. dimOp := IntermediateCode.Immediate(addressType,dim);
  4327. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4328. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4329. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4330. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4331. baseType := SemanticChecker.ArrayBase(type,dim);
  4332. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4333. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4334. Pass((arrayDestinationTag));
  4335. ELSE HALT(100);
  4336. END;
  4337. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4338. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4339. (* case 3b *)
  4340. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4341. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4342. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4343. Symbol(variable,variableOp);
  4344. LoadValue(variableOp,system.addressType);
  4345. ELSE
  4346. descriptorType := GetMathArrayDescriptorType(dim);
  4347. variable := GetTemporaryVariable(descriptorType, FALSE);
  4348. Symbol(variable,variableOp);
  4349. END;
  4350. arrayDestinationTag := variableOp.op;
  4351. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4352. arrayDestinationDimension := 0;
  4353. Designate(expression,operand);
  4354. Pass((operand.tag));
  4355. (* case 3a *)
  4356. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4357. i := 0;
  4358. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4359. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4360. INC(i);
  4361. END;
  4362. IF i = dim THEN
  4363. Designate(expression,operand);
  4364. Pass((operand.tag));
  4365. ELSE (* open-static *)
  4366. type := expression.type.resolved;
  4367. descriptorType := GetMathArrayDescriptorType(dim);
  4368. variable := GetTemporaryVariable(descriptorType, FALSE);
  4369. Symbol(variable,variableOp);
  4370. arrayDestinationTag := variableOp.op;
  4371. Designate(expression,operand);
  4372. FOR i := 0 TO dim-1 DO
  4373. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4374. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4375. ReleaseOperand(tmpOperand);
  4376. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4377. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4378. ReleaseOperand(tmpOperand);
  4379. END;
  4380. dimOp := IntermediateCode.Immediate(addressType,dim);
  4381. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4382. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4383. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4384. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4385. baseType := SemanticChecker.ArrayBase(type,dim);
  4386. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4387. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4388. Pass((arrayDestinationTag));
  4389. END;
  4390. (* case 3d *)
  4391. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4392. Designate(expression,operand);
  4393. Dereference(operand,type.resolved,FALSE);
  4394. (*
  4395. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4396. *)
  4397. Pass((operand.tag));
  4398. (* case 3f *)
  4399. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4400. descriptorType := GetMathArrayDescriptorType(dim);
  4401. variable := GetTemporaryVariable(descriptorType, FALSE);
  4402. Symbol(variable,variableOp);
  4403. arrayDestinationTag := variableOp.op;
  4404. Designate(expression,operand);
  4405. IF operand.op.type.length >1 THEN (* vector register *)
  4406. variable2 := GetTemporaryVariable(type, FALSE);
  4407. Symbol(variable2, variable2Op);
  4408. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4409. Emit(Mov(position,tmp, operand.op));
  4410. ReleaseOperand(operand);
  4411. Symbol(variable2, operand);
  4412. END;
  4413. FOR i := 0 TO dim-1 DO
  4414. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4415. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4416. ReleaseOperand(tmpOperand);
  4417. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4418. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4419. ReleaseOperand(tmpOperand);
  4420. END;
  4421. dimOp := IntermediateCode.Immediate(addressType,dim);
  4422. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4423. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4424. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4425. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4426. baseType := SemanticChecker.ArrayBase(type,dim);
  4427. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4428. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4429. Pass((arrayDestinationTag));
  4430. ELSE HALT(100);
  4431. END;
  4432. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4433. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4434. (* case 4b *)
  4435. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4436. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4437. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4438. Symbol(variable,variableOp);
  4439. LoadValue(variableOp,system.addressType);
  4440. ELSE
  4441. descriptorType := GetMathArrayDescriptorType(dim);
  4442. variable := GetTemporaryVariable(descriptorType, FALSE);
  4443. Symbol(variable,variableOp);
  4444. END;
  4445. arrayDestinationTag := variableOp.op;
  4446. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4447. arrayDestinationDimension := 0;
  4448. Designate(expression,operand);
  4449. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4450. Symbol(variable,variableOp);
  4451. ELSE
  4452. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4453. Symbol(variable,variableOp);
  4454. MakeMemory(tmp,variableOp.op,addressType,0);
  4455. Emit(Mov(position,tmp,operand.tag));
  4456. ReleaseIntermediateOperand(tmp);
  4457. END;
  4458. Pass((variableOp.op));
  4459. ReleaseOperand(variableOp);
  4460. (* case 4a *)
  4461. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4462. i := 0;
  4463. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4464. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4465. INC(i);
  4466. END;
  4467. IF i = dim THEN
  4468. Designate(expression,operand);
  4469. arrayDestinationTag := operand.tag;
  4470. ELSE (* open-static *)
  4471. type := expression.type.resolved;
  4472. descriptorType := GetMathArrayDescriptorType(dim);
  4473. variable := GetTemporaryVariable(descriptorType, FALSE);
  4474. Symbol(variable,variableOp);
  4475. arrayDestinationTag := variableOp.op;
  4476. Designate(expression,operand);
  4477. FOR i := 0 TO dim-1 DO
  4478. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4479. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4480. ReleaseOperand(tmpOperand);
  4481. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4482. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4483. ReleaseOperand(tmpOperand);
  4484. END;
  4485. dimOp := IntermediateCode.Immediate(addressType,dim);
  4486. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4487. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4488. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4489. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4490. baseType := SemanticChecker.ArrayBase(type,dim);
  4491. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4492. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4493. END;
  4494. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4495. Symbol(variable,variableOp);
  4496. MakeMemory(tmp,variableOp.op,addressType,0);
  4497. Emit(Mov(position,tmp,arrayDestinationTag));
  4498. ReleaseIntermediateOperand(tmp);
  4499. Pass((variableOp.op));
  4500. ReleaseOperand(variableOp);
  4501. (* case 4d *)
  4502. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4503. Designate(expression,operand);
  4504. (*
  4505. Dereference(operand,type.resolved,FALSE);
  4506. *)
  4507. (*
  4508. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4509. *)
  4510. Pass((operand.op));
  4511. (* case 4f *)
  4512. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4513. descriptorType := GetMathArrayDescriptorType(dim);
  4514. variable := GetTemporaryVariable(descriptorType, FALSE);
  4515. Symbol(variable,variableOp);
  4516. arrayDestinationTag := variableOp.op;
  4517. Designate(expression,operand);
  4518. FOR i := 0 TO dim-1 DO
  4519. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4520. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4521. ReleaseOperand(tmpOperand);
  4522. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4523. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4524. ReleaseOperand(tmpOperand);
  4525. END;
  4526. dimOp := IntermediateCode.Immediate(addressType,dim);
  4527. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4528. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4529. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4530. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4531. baseType := SemanticChecker.ArrayBase(type,dim);
  4532. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4533. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4534. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4535. Symbol(variable,variableOp);
  4536. MakeMemory(tmp,variableOp.op,addressType,0);
  4537. Emit(Mov(position,tmp,arrayDestinationTag));
  4538. ReleaseIntermediateOperand(tmp);
  4539. Pass((variableOp.op));
  4540. ReleaseOperand(variableOp);
  4541. ELSE HALT(100);
  4542. END;
  4543. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4544. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4545. Designate(expression,operand);
  4546. IF operand.op.type.length > 1 THEN
  4547. Emit(Push(position, operand.op));
  4548. ReleaseOperand(operand);
  4549. ELSE
  4550. size := system.SizeOf(type);
  4551. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4552. size := ToMemoryUnits(system,size);
  4553. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4554. arrayDestinationTag := sp;
  4555. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4556. END;
  4557. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4558. Designate(expression,operand);
  4559. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4560. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4561. Symbol(variable,variableOp);
  4562. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4563. Emit(Mov(position,tmp,operand.op));
  4564. Emit(Push(position,variableOp.op));
  4565. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4566. Pass((operand.op));
  4567. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4568. END;
  4569. ELSE HALT(200)
  4570. END;
  4571. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4572. IF parameter.kind = SyntaxTree.VarParameter THEN
  4573. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4574. Designate(expression, operand);
  4575. Pass((operand.op));
  4576. ELSE
  4577. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4578. Evaluate(expression, operand);
  4579. Pass((operand.extra)); (* step *)
  4580. Pass((operand.tag)); (* last *)
  4581. Pass((operand.op)) (* first *)
  4582. END
  4583. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4584. IF parameter.kind = SyntaxTree.VarParameter THEN
  4585. Designate(expression, operand);
  4586. Pass((operand.op));
  4587. ELSE
  4588. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4589. Evaluate(expression, operand);
  4590. Pass((operand.tag)); (* real part *)
  4591. Pass((operand.op)) (* imaginary part *)
  4592. END
  4593. ELSE
  4594. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4595. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4596. Designate(expression,operand);
  4597. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4598. (* stack allocation *)
  4599. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4600. (*! parameter alignment to be discussed ... *)
  4601. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4602. size := type(SyntaxTree.StringType).length;
  4603. END;
  4604. IF backend.cooperative & parameter.NeedsTrace() THEN
  4605. dst := NewRegisterOperand (addressType);
  4606. Emit(Mov(position,dst, sp));
  4607. IntermediateCode.InitImmediate(null, byteType, 0);
  4608. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4609. ReleaseIntermediateOperand(dst);
  4610. SaveRegisters();ReleaseUsedRegisters(saved);
  4611. (* register dst has been freed before SaveRegisters already *)
  4612. CallAssignMethod(dst, operand.op, parameter.type);
  4613. RestoreRegisters(saved);
  4614. END;
  4615. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4616. ELSIF IsOpenArray(parameter.type) THEN
  4617. Designate(expression,operand);
  4618. baseReg := operand.tag;
  4619. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4620. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4621. END;
  4622. Pass((operand.op)); (* address of the array *)
  4623. ELSIF IsDelegate(parameter.type) THEN
  4624. Evaluate(expression,operand);
  4625. IF backend.cooperative & parameter.NeedsTrace() THEN
  4626. Emit(Push(position, nil));
  4627. dst := NewRegisterOperand (addressType);
  4628. Emit(Mov(position,dst, sp));
  4629. ReleaseIntermediateOperand(dst);
  4630. SaveRegisters();ReleaseUsedRegisters(saved);
  4631. Emit(Push(position, dst));
  4632. (* register dst has been freed before SaveRegisters already *)
  4633. Emit(Push(position, operand.tag));
  4634. CallThis(position,"GarbageCollector","Assign",2);
  4635. RestoreRegisters(saved);
  4636. ELSE
  4637. Pass((operand.tag));
  4638. END;
  4639. Pass((operand.op));
  4640. ELSE
  4641. Evaluate(expression,operand);
  4642. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4643. Emit(Push(position, nil));
  4644. dst := NewRegisterOperand (addressType);
  4645. Emit(Mov(position,dst, sp));
  4646. ReleaseIntermediateOperand(dst);
  4647. SaveRegisters();ReleaseUsedRegisters(saved);
  4648. Emit(Push(position, dst));
  4649. (* register dst has been freed before SaveRegisters already *)
  4650. Emit(Push(position, operand.op));
  4651. CallThis(position,"GarbageCollector","Assign",2);
  4652. RestoreRegisters(saved);
  4653. ELSE
  4654. Pass((operand.op));
  4655. END;
  4656. END;
  4657. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4658. Evaluate(expression,operand);
  4659. Pass((operand.op));
  4660. ELSE (* var parameter *)
  4661. Designate(expression,operand);
  4662. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4663. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4664. Pass((operand.tag));
  4665. END;
  4666. END;
  4667. Pass((operand.op));
  4668. END;
  4669. END;
  4670. (* TODO: needed? *)
  4671. arrayDestinationTag := oldArrayDestinationTag;
  4672. arrayDestinationDimension := oldArrayDestinationDimension;
  4673. IF needsParameterBackup THEN
  4674. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4675. ReuseCopy(parameterBackup, operand.op)
  4676. END;
  4677. ReleaseOperand(operand);
  4678. IF Trace THEN TraceExit("PushParameter") END;
  4679. END PushParameter;
  4680. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4681. VAR prevConditional: BOOLEAN;
  4682. BEGIN
  4683. prevConditional := conditional;
  4684. conditional := FALSE;
  4685. 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
  4686. Expression(x.result); (* use register *)
  4687. END;
  4688. Statement(x.statement);
  4689. conditional := prevConditional;
  4690. IF x.result # NIL THEN Expression(x.result) END;
  4691. 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
  4692. ReleaseIntermediateOperand(result.op);
  4693. END;
  4694. END VisitStatementDesignator;
  4695. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4696. VAR
  4697. procedure: SyntaxTree.Procedure;
  4698. procedureType: SyntaxTree.ProcedureType;
  4699. wasInline: BOOLEAN;
  4700. actualParameters: SyntaxTree.ExpressionList;
  4701. formalParameter: SyntaxTree.Parameter;
  4702. actualParameter: SyntaxTree.Expression;
  4703. i: LONGINT;
  4704. localVariable: SyntaxTree.Variable;
  4705. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4706. src, dest: Operand;
  4707. prevInlineExit : Label;
  4708. prevMapper: SymbolMapper;
  4709. tooComplex: BOOLEAN;
  4710. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4711. BEGIN
  4712. IF e = NIL THEN RETURN TRUE
  4713. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4714. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4715. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4716. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4717. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4718. ELSE RETURN FALSE
  4719. END;
  4720. END SimpleExpression;
  4721. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4722. BEGIN
  4723. RETURN checker.CanPassInRegister(type)
  4724. END FitsInRegister;
  4725. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4726. VAR
  4727. variable: SyntaxTree.Variable;
  4728. variableDesignator: SyntaxTree.Designator;
  4729. BEGIN
  4730. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4731. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4732. variableDesignator.SetType(type);
  4733. RETURN variableDesignator
  4734. END GetTemp;
  4735. BEGIN
  4736. wasInline := currentIsInline;
  4737. prevInlineExit := currentInlineExit;
  4738. prevMapper := currentMapper;
  4739. currentInlineExit := NewLabel();
  4740. tooComplex := FALSE;
  4741. NEW(currentMapper);
  4742. currentIsInline := TRUE;
  4743. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4744. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4745. formalParameter := procedureType.firstParameter;
  4746. actualParameters := x.parameters;
  4747. i := 0;
  4748. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4749. actualParameter := actualParameters.GetExpression(i);
  4750. IF actualParameter.resolved # NIL THEN
  4751. actualParameter := actualParameter.resolved
  4752. END;
  4753. (*
  4754. if expression is simple and can be passed immediately
  4755. or if type fits in register then we can proceed
  4756. otherwise we escape to ordinary procedure call.
  4757. *)
  4758. (* cases where the expression can be mapped identically *)
  4759. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4760. currentMapper.Add(formalParameter, actualParameter, NIL);
  4761. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4762. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4763. (*
  4764. Assign(variableDesignator, actualParameter);
  4765. *)
  4766. Evaluate(actualParameter, src);
  4767. Designate(variableDesignator, dest);
  4768. Emit(Mov(x.position, dest.op, src.op));
  4769. ReleaseOperand(dest);
  4770. ReleaseOperand(src);
  4771. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4772. ELSE tooComplex := TRUE
  4773. END;
  4774. (*
  4775. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4776. currentMapper.Add(formalParameter, actualParameter, NIL);
  4777. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4778. variableDesignator := GetTemp(system.addressType, FALSE);
  4779. Designate(actualParameter, src);
  4780. Designate(variableDesignator, dest);
  4781. IntermediateCode.MakeMemory(dest.op,addressType);
  4782. Emit(Mov(x.position, dest.op, src.op));
  4783. ReleaseOperand(dest);
  4784. IF src.tag.mode # IntermediateCode.Undefined THEN
  4785. tagDesignator := GetTemp(system.addressType, FALSE);
  4786. Designate(tagDesignator, dest);
  4787. IntermediateCode.MakeMemory(dest.op,addressType);
  4788. Emit(Mov(x.position, dest.op, src.op));
  4789. END;
  4790. ReleaseOperand(dest); ReleaseOperand(src);
  4791. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4792. END;
  4793. *)
  4794. formalParameter := formalParameter.nextParameter;
  4795. INC(i);
  4796. END;
  4797. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4798. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4799. currentMapper.Add(NIL, returnDesignator, NIL);
  4800. END;
  4801. localVariable := procedure.procedureScope.firstVariable;
  4802. WHILE ~tooComplex & (localVariable # NIL) DO
  4803. variableDesignator := GetTemp(localVariable.type, FALSE);
  4804. currentMapper.Add(localVariable, variableDesignator, NIL);
  4805. localVariable := localVariable.nextVariable;
  4806. END;
  4807. IF ~tooComplex THEN
  4808. VisitStatementBlock(procedure.procedureScope.body);
  4809. SetLabel(currentInlineExit);
  4810. IF procedureType.returnType # NIL THEN
  4811. Designate(returnDesignator, result);
  4812. IF conditional THEN
  4813. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4814. ValueToCondition(result)
  4815. END;
  4816. END;
  4817. END;
  4818. currentMapper := prevMapper;
  4819. currentInlineExit := prevInlineExit;
  4820. currentIsInline := wasInline;
  4821. RETURN ~tooComplex
  4822. END InlineProcedureCall;
  4823. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4824. VAR
  4825. parameters: SyntaxTree.ExpressionList;
  4826. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4827. designator: SyntaxTree.Designator;
  4828. procedureType: SyntaxTree.ProcedureType;
  4829. formalParameter: SyntaxTree.Parameter;
  4830. operand, returnValue: Operand;
  4831. reg, size, mask, dest: IntermediateCode.Operand;
  4832. saved: RegisterEntry;
  4833. symbol: SyntaxTree.Symbol;
  4834. variable: SyntaxTree.Variable;
  4835. i, parametersSize, returnTypeSize : LONGINT;
  4836. structuredReturnType: BOOLEAN;
  4837. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4838. tempVariableDesignator: SyntaxTree.Designator;
  4839. gap, alignment: LONGINT; (*fld*)
  4840. (* TODO: remove unnecessary backup variables *)
  4841. oldResult: Operand;
  4842. oldCurrentScope: SyntaxTree.Scope;
  4843. oldArrayDestinationTag: IntermediateCode.Operand;
  4844. oldArrayDestinationDimension: LONGINT;
  4845. oldConstantDeclaration: SyntaxTree.Symbol;
  4846. oldDestination: IntermediateCode.Operand;
  4847. oldCurrentLoop: Label;
  4848. oldConditional: BOOLEAN;
  4849. oldTrueLabel, oldFalseLabel: Label;
  4850. oldLocked: BOOLEAN;
  4851. usedRegisters,oldUsedRegisters: RegisterEntry;
  4852. return: IntermediateCode.Operand;
  4853. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4854. arg: IntermediateCode.Operand;
  4855. dummy: IntermediateCode.Operand;
  4856. recordType: SyntaxTree.RecordType;
  4857. operatorSelectionProcedureOperand: Operand;
  4858. operatorSelectionProcedure: SyntaxTree.Procedure;
  4859. fingerPrint: SyntaxTree.FingerPrint;
  4860. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4861. identifierNumber: LONGINT;
  4862. parameterRegister: Backend.Registers;
  4863. parameterRegisters: LONGINT;
  4864. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4865. procedure: SyntaxTree.Procedure;
  4866. PROCEDURE BackupGlobalState;
  4867. BEGIN
  4868. oldResult := result;
  4869. oldCurrentScope := currentScope;
  4870. oldArrayDestinationTag := arrayDestinationTag;
  4871. oldArrayDestinationDimension := arrayDestinationDimension;
  4872. oldConstantDeclaration := constantDeclaration;
  4873. oldDestination := destination;
  4874. oldCurrentLoop := currentLoop;
  4875. oldConditional := conditional;
  4876. oldTrueLabel := trueLabel;
  4877. oldFalseLabel := falseLabel;
  4878. oldLocked := locked;
  4879. oldUsedRegisters := usedRegisters
  4880. END BackupGlobalState;
  4881. PROCEDURE RestoreGlobalState;
  4882. BEGIN
  4883. result := oldResult;
  4884. currentScope := oldCurrentScope;
  4885. arrayDestinationTag := oldArrayDestinationTag;
  4886. arrayDestinationDimension := oldArrayDestinationDimension;
  4887. constantDeclaration := oldConstantDeclaration;
  4888. destination := oldDestination;
  4889. currentLoop := oldCurrentLoop;
  4890. conditional := oldConditional;
  4891. trueLabel := oldTrueLabel;
  4892. falseLabel := oldFalseLabel;
  4893. locked := oldLocked;
  4894. usedRegisters := oldUsedRegisters
  4895. END RestoreGlobalState;
  4896. (** do preparations before parameter push for array-structured object types (ASOTs):
  4897. if ASOT is passed as VAR parameter:
  4898. - allocate temporary variable of math array type
  4899. - copy contents of ASOT to be passed to temporary variable
  4900. - use temporary variable as the actual parameter instead
  4901. - 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)
  4902. **)
  4903. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4904. VAR
  4905. expression: SyntaxTree.Expression;
  4906. BEGIN
  4907. IF actualParameter IS SyntaxTree.Designator THEN
  4908. designator := actualParameter(SyntaxTree.Designator);
  4909. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4910. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4911. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4912. ASSERT(checker # NIL);
  4913. checker.SetCurrentScope(currentScope);
  4914. (* allocate temporary variable *)
  4915. ASSERT(actualParameter.type # NIL);
  4916. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4917. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4918. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4919. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4920. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4921. ASSERT(tempVariableDesignator.type # NIL);
  4922. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4923. (* copy math array stored in actual parameter to temporary variable *)
  4924. BackupGlobalState;
  4925. AssignMathArray(tempVariableDesignator, actualParameter);
  4926. RestoreGlobalState;
  4927. (* use temporary variable as actual parameter instead of the original one *)
  4928. actualParameter := tempVariableDesignator;
  4929. (* create write-back call and store it in linked list *)
  4930. (* create new list entry *)
  4931. IF firstWriteBackCall = NIL THEN
  4932. NEW(firstWriteBackCall);
  4933. currentWriteBackCall := firstWriteBackCall
  4934. ELSE
  4935. ASSERT(currentWriteBackCall # NIL);
  4936. NEW(currentWriteBackCall.next);
  4937. currentWriteBackCall := currentWriteBackCall.next
  4938. END;
  4939. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4940. ASSERT(expression.type = NIL);
  4941. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4942. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4943. (* prepare writeback for any other "normal" indexer *)
  4944. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4945. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4946. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4947. Assign(tempVariableDesignator, actualParameter);
  4948. actualParameter := tempVariableDesignator;
  4949. IF firstWriteBackCall = NIL THEN
  4950. NEW(firstWriteBackCall);
  4951. currentWriteBackCall := firstWriteBackCall
  4952. ELSE
  4953. ASSERT(currentWriteBackCall # NIL);
  4954. NEW(currentWriteBackCall.next);
  4955. currentWriteBackCall := currentWriteBackCall.next
  4956. END;
  4957. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4958. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4959. END
  4960. END
  4961. END PrepareParameter;
  4962. BEGIN
  4963. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4964. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4965. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4966. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4967. IF InlineProcedureCall(x) THEN
  4968. RETURN
  4969. ELSE
  4970. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4971. END
  4972. END;
  4973. END;
  4974. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4975. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4976. dest := destination; destination := emptyOperand;
  4977. SaveRegisters();ReleaseUsedRegisters(saved);
  4978. parameters := x.parameters;
  4979. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4980. (* an operator is called *)
  4981. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4982. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4983. (* check if a dynamic operator call should be performed *)
  4984. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  4985. ELSE
  4986. isCallOfDynamicOperator := FALSE
  4987. END;
  4988. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4989. Emit(Push(position, ap));
  4990. END;
  4991. alignment := procedureType.stackAlignment;
  4992. IF alignment > 1 THEN
  4993. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4994. Emit(Mov(position,reg, sp));
  4995. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4996. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4997. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4998. Emit(And(position,sp, sp, mask));
  4999. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5000. Emit(Push(position,reg));
  5001. (*
  5002. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5003. Emit(Mov(position,mem,reg));
  5004. *)
  5005. ReleaseIntermediateOperand(reg);
  5006. END;
  5007. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 32) THEN
  5008. (* align stack to 16-byte boundary *)
  5009. IntermediateCode.InitImmediate(mask,addressType,-16);
  5010. Emit(And(position,sp, sp, mask));
  5011. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5012. IF gap # 0 THEN
  5013. IntermediateCode.InitImmediate(size,addressType,gap);
  5014. Emit(Sub(position,sp,sp,size))
  5015. END;
  5016. END;
  5017. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5018. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5019. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5020. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5021. ELSE
  5022. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5023. END;
  5024. Evaluate(x.left, operand);
  5025. IF symbol IS SyntaxTree.Procedure THEN
  5026. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5027. Emit(Push(position,operand.tag));
  5028. ELSIF (procedureType.isDelegate) THEN
  5029. Emit(Push(position,operand.tag));
  5030. END;
  5031. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5032. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5033. Emit(Push(position,operand.tag));
  5034. END;
  5035. ELSE HALT(200);
  5036. END;
  5037. ReleaseIntermediateOperand(operand.tag);
  5038. operand.tag := emptyOperand;
  5039. (* determine if a structured return type is needed *)
  5040. structuredReturnType := StructuredReturnType(procedureType);
  5041. IF structuredReturnType THEN
  5042. IF resultDesignator # NIL THEN
  5043. d := resultDesignator;
  5044. ELSE
  5045. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  5046. variable.SetUntraced(procedureType.hasUntracedReturn);
  5047. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  5048. d.SetType(variable.type);
  5049. END;
  5050. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5051. Designate(d,returnValue);
  5052. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5053. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5054. Emit(Push(position,size));
  5055. Emit(Push(position,returnValue.op));
  5056. ReleaseOperand(returnValue);
  5057. ELSE
  5058. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5059. END;
  5060. END;
  5061. firstWriteBackCall := NIL; (* reset write-back call list *)
  5062. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5063. parameterRegister := backend.GetParameterRegisters(procedureType.callingConvention);
  5064. IF parameterRegister = NIL THEN parameterRegisters := 0
  5065. ELSE parameterRegisters := LEN(parameterRegister)
  5066. END;
  5067. passByRegister := parameterRegisters > 0;
  5068. registerNumber := 0;
  5069. formalParameter := procedureType.lastParameter;
  5070. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5071. actualParameter := parameters.GetExpression(i);
  5072. PrepareParameter(actualParameter, formalParameter);
  5073. IF passByRegister & (i < parameterRegisters) THEN
  5074. IF ~PassInRegister(formalParameter) THEN
  5075. Error(actualParameter.position,"cannot be passed by register")
  5076. ELSE
  5077. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,parameterRegister[i]);
  5078. END;
  5079. INC(registerNumber);
  5080. ELSE
  5081. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5082. END;
  5083. formalParameter := formalParameter.prevParameter;
  5084. END;
  5085. IF passByRegister & (registerNumber > 0) & ~SysvABI(procedureType.callingConvention) THEN
  5086. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5087. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5088. END;
  5089. ELSE
  5090. hasDynamicOperands := FALSE;
  5091. formalParameter := procedureType.firstParameter;
  5092. FOR i := 0 TO parameters.Length() - 1 DO
  5093. actualParameter := parameters.GetExpression(i);
  5094. IF formalParameter # NIL THEN (* TENTATIVE *)
  5095. PrepareParameter(actualParameter, formalParameter);
  5096. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5097. ASSERT(i < 2);
  5098. hasDynamicOperands := TRUE;
  5099. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5100. ELSE
  5101. IF passByRegister & (registerNumber > 0) THEN
  5102. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5103. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5104. END;
  5105. passByRegister := FALSE;
  5106. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5107. END;
  5108. formalParameter := formalParameter.nextParameter;
  5109. END;
  5110. END;
  5111. END;
  5112. IF symbol IS SyntaxTree.Procedure THEN
  5113. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5114. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5115. Emit(Push(position,reg));
  5116. ReleaseIntermediateOperand(reg);
  5117. END;
  5118. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5119. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5120. parametersSize := ParametersSize(system,procedureType,FALSE);
  5121. END;
  5122. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5123. (*
  5124. dynamic operator overloading:
  5125. first push parameters, regularly:
  5126. [self]
  5127. par1
  5128. par2
  5129. then push parameters for GetOperator
  5130. identifier
  5131. ptr1
  5132. tag
  5133. ptr2
  5134. tag
  5135. call GetOperatorRuntimeProc
  5136. call Operator
  5137. *)
  5138. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5139. (* push ID *)
  5140. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5141. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5142. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5143. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5144. formalParameter := procedureType.firstParameter;
  5145. FOR i := 0 TO parameters.Length() - 1 DO
  5146. IF formalParameter.access # SyntaxTree.Hidden THEN
  5147. ASSERT(i < 2);
  5148. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5149. (* push pointer *)
  5150. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5151. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5152. (* add dereference *)
  5153. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5154. (*! better: do refer to stack above than using parameter backups !!*)
  5155. ReleaseIntermediateOperand(parameterBackups[i]);
  5156. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5157. END;
  5158. Emit(Push(position,parameterBackups[i]));
  5159. ReleaseIntermediateOperand(parameterBackups[i]);
  5160. (* push typetag *)
  5161. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5162. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5163. arg := TypeDescriptorAdr(recordType);
  5164. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5165. Emit(Push(position,arg));
  5166. ELSE
  5167. (* push 'NonPointer' *)
  5168. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5169. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5170. (* push fingerprint *)
  5171. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5172. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5173. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  5174. END
  5175. END;
  5176. formalParameter := formalParameter.nextParameter
  5177. END;
  5178. (* for unary operators: complete the information for the second parameter *)
  5179. IF procedureType.numberParameters < 2 THEN
  5180. (* push 'NonPointer' *)
  5181. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5182. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5183. (* push 'NoType' *)
  5184. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5185. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5186. END;
  5187. (* call operator selection procedure *)
  5188. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5189. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5190. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5191. ReleaseOperand(operatorSelectionProcedureOperand);
  5192. (* use the address that the operator selection procedure returned as the target address of the call *)
  5193. InitOperand(operand, ModeValue);
  5194. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5195. Emit(Result(position,operand.op))
  5196. END
  5197. END;
  5198. ReleaseParameterRegisters();
  5199. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5200. Emit(Call(position,operand.op,0));
  5201. ELSE
  5202. Emit(Call(position,operand.op,parametersSize));
  5203. END;
  5204. ReleaseOperand(operand);
  5205. IF procedureType.noReturn THEN
  5206. EmitTrap(position,NoReturnTrap);
  5207. END;
  5208. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5209. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5210. Emit(Result(position,return));
  5211. END;
  5212. (* === return parameter space === *)
  5213. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister THEN
  5214. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5215. IF parametersSize < 32 THEN
  5216. (* allocated space for all parameter registers *)
  5217. parametersSize := 32
  5218. END;
  5219. size := IntermediateCode.Immediate(addressType,parametersSize);
  5220. Emit(Add(position,sp,sp,size))
  5221. END;
  5222. IF SysvABI(procedureType.callingConvention) THEN
  5223. IF passByRegister THEN
  5224. IF parameters.Length() > parameterRegisters THEN
  5225. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5226. ELSE
  5227. parametersSize := 0
  5228. END;
  5229. ELSE
  5230. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5231. INC( parametersSize, (-parametersSize) MOD 16 )
  5232. END;
  5233. IF parametersSize > 0 THEN
  5234. size := IntermediateCode.Immediate(addressType,parametersSize);
  5235. Emit(Add(position,sp,sp,size))
  5236. END;
  5237. END;
  5238. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5239. IF structuredReturnType THEN
  5240. (* stack pointer rewinding done by callee
  5241. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5242. Emit(Add(position,sp,sp,size));
  5243. *)
  5244. RestoreRegisters(saved);
  5245. InitOperand(result,ModeReference);
  5246. Symbol(variable,result);
  5247. ELSE
  5248. RestoreRegisters(saved);
  5249. InitOperand(result,ModeValue);
  5250. result.op := return;
  5251. END;
  5252. END;
  5253. IF alignment > 1 THEN
  5254. Emit(Pop(position,sp));
  5255. END;
  5256. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5257. Emit(Pop(position, ap));
  5258. END;
  5259. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5260. ValueToCondition(result);
  5261. END;
  5262. destination := dest;
  5263. (* perform all write-back calls in the list *)
  5264. BackupGlobalState;
  5265. currentWriteBackCall := firstWriteBackCall;
  5266. WHILE currentWriteBackCall # NIL DO
  5267. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5268. currentWriteBackCall := currentWriteBackCall.next
  5269. END;
  5270. RestoreGlobalState;
  5271. (* TENATIVE *)
  5272. (*
  5273. IF isOperatorCall THEN
  5274. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5275. END;
  5276. *)
  5277. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5278. END VisitProcedureCallDesignator;
  5279. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5280. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5281. td: SyntaxTree.Symbol;
  5282. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5283. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5284. BEGIN
  5285. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5286. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5287. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5288. variable.SetType(system.anyType);
  5289. scope.AddVariable(variable);
  5290. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5291. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5292. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5293. typeDeclaration.SetScope(module.module.moduleScope);
  5294. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5295. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5296. END;
  5297. RETURN hiddenPointerType;
  5298. END GetHiddenPointerType;
  5299. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5300. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5301. BEGIN
  5302. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5303. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5304. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5305. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5306. scope.AddVariable(variable);
  5307. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5308. variable.SetType(system.anyType);
  5309. scope.AddVariable(variable);
  5310. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5311. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5312. typeDeclaration.SetDeclaredType(delegatePointerType);
  5313. typeDeclaration.SetScope(module.module.moduleScope);
  5314. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5315. delegatePointerType.SetState(SyntaxTree.Resolved);
  5316. END;
  5317. RETURN delegatePointerType
  5318. END GetDelegateType;
  5319. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5320. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5321. such as in VAR a: RECORD ... END;
  5322. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5323. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5324. *)
  5325. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5326. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5327. BEGIN (* no code emission *)
  5328. source := NIL;
  5329. x := x.resolved;
  5330. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5331. x := GetHiddenPointerType();
  5332. ELSIF IsDelegate(x) THEN
  5333. x := GetDelegateType();
  5334. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5335. ELSE HALT(200);
  5336. END;
  5337. td := x.typeDeclaration;
  5338. IF td = NIL THEN
  5339. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5340. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5341. ASSERT(td # NIL);
  5342. END;
  5343. IF newObjectFile THEN
  5344. GetCodeSectionNameForSymbol(td,name);
  5345. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5346. meta.CheckTypeDeclaration(x);
  5347. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5348. ELSE
  5349. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5350. END;
  5351. IF backend.cooperative OR meta.simple THEN
  5352. offset := 0;
  5353. ELSE
  5354. IF x IS SyntaxTree.CellType THEN
  5355. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5356. IF baseRecord = NIL THEN
  5357. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5358. ELSE
  5359. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5360. END;
  5361. ELSE
  5362. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5363. END;
  5364. END;
  5365. ELSE
  5366. offset := 0;
  5367. source := module.allSections.FindBySymbol(td); (*TODO*)
  5368. IF source = NIL THEN
  5369. null := 0;
  5370. GetCodeSectionNameForSymbol(td,name);
  5371. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5372. Basic.SuffixSegmentedName (name, module.module.name);
  5373. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5374. IntermediateCode.InitImmediate(op,addressType,0);
  5375. source(IntermediateCode.Section).Emit(Data(position,op));
  5376. source.SetReferenced(FALSE)
  5377. ELSE
  5378. name := source.name;
  5379. END;
  5380. END;
  5381. RETURN td
  5382. END GetBackendType;
  5383. BEGIN
  5384. (*td := t.typeDeclaration;*)
  5385. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5386. (*
  5387. IF t IS SyntaxTree.PointerType THEN
  5388. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5389. ELSE
  5390. source := GetBackendType(t);
  5391. END;
  5392. *)
  5393. IF newObjectFile THEN
  5394. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5395. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5396. IntermediateCode.SetOffset(res,offset);
  5397. ELSE
  5398. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5399. END;
  5400. (*
  5401. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5402. make memory should be used when tag is used, not earlier
  5403. *)
  5404. RETURN res
  5405. END TypeDescriptorAdr;
  5406. (*
  5407. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5408. VAR result: IntermediateCode.Operand;
  5409. BEGIN
  5410. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5411. operand.tag := TypeDescriptorAdr(operand.type);
  5412. IntermediateCode.MakeMemory(operand.tag,addressType);
  5413. UseIntermediateOperand(operand.tag);
  5414. END;
  5415. END MakeTypeTag;
  5416. *)
  5417. PROCEDURE ProfilerInit;
  5418. VAR reg: IntermediateCode.Operand;
  5419. BEGIN
  5420. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5421. Emit(Call(position,reg,0));
  5422. END ProfilerInit;
  5423. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5424. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5425. BEGIN
  5426. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5427. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5428. THEN
  5429. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5430. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5431. Emit(Push(position,reg));
  5432. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5433. Emit(Push(position,reg));
  5434. StaticCallOperand(result,procedure);
  5435. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5436. ReleaseOperand(result);
  5437. END;
  5438. END ProfilerEnterExit;
  5439. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5440. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5441. BEGIN
  5442. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5443. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5444. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5445. profileInit.Emit(Push(position,reg));
  5446. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5447. profileInit.Emit(Push(position,reg));
  5448. NEW(string, LEN(name)); COPY(name, string^);
  5449. sv := SyntaxTree.NewStringValue(-1,string);
  5450. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5451. sv.SetType(type);
  5452. Designate(sv,result);
  5453. profileInit.Emit(Push(position,result.tag));
  5454. profileInit.Emit(Push(position,result.op));
  5455. StaticCallOperand(result,procedure);
  5456. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5457. ReleaseOperand(result);
  5458. END;
  5459. END ProfilerAddProcedure;
  5460. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5461. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5462. BEGIN
  5463. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5464. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5465. profileInit.Emit(Push(position,reg));
  5466. profileInitPatchPosition := profileInit.pc;
  5467. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5468. NEW(string, LEN(name)); COPY(name, string^);
  5469. sv := SyntaxTree.NewStringValue(-1,string);
  5470. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5471. sv.SetType(type);
  5472. Designate(sv,result);
  5473. profileInit.Emit(Push(position,result.tag));
  5474. profileInit.Emit(Push(position,result.op));
  5475. StaticCallOperand(result,procedure);
  5476. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5477. ReleaseOperand(result);
  5478. END;
  5479. END ProfilerAddModule;
  5480. PROCEDURE ProfilerPatchInit;
  5481. VAR reg: IntermediateCode.Operand;
  5482. BEGIN
  5483. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5484. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5485. EmitLeave(profileInit,position,0);
  5486. profileInit.Emit(Exit(position,0,0));
  5487. END ProfilerPatchInit;
  5488. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5489. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5490. VAR
  5491. id: LONGINT;
  5492. leftType, rightType: SyntaxTree.Type;
  5493. procedureType: SyntaxTree.ProcedureType;
  5494. runtimeProcedure: SyntaxTree.Procedure;
  5495. runtimeProcedureOperand, operatorOperand: Operand;
  5496. kind: SET;
  5497. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5498. VAR
  5499. arg: IntermediateCode.Operand;
  5500. recordType: SyntaxTree.RecordType;
  5501. fingerPrint: SyntaxTree.FingerPrint;
  5502. BEGIN
  5503. IF type = NIL THEN
  5504. (* no type: push 'NoType' *)
  5505. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5506. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5507. ELSIF IsStrictlyPointerToRecord(type) THEN
  5508. (* pointer to record type: push typetag *)
  5509. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5510. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5511. arg := TypeDescriptorAdr(recordType);
  5512. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5513. ELSE
  5514. (* non-pointer to record type: push fingerprint *)
  5515. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5516. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5517. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5518. END;
  5519. operatorInitializationCodeSection.Emit(Push(position,arg))
  5520. END PushTypeInfo;
  5521. BEGIN
  5522. ASSERT(operatorInitializationCodeSection # NIL);
  5523. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5524. procedureType := operator.type(SyntaxTree.ProcedureType);
  5525. (* determine types *)
  5526. leftType := procedureType.firstParameter.type;
  5527. IF procedureType.numberParameters = 2 THEN
  5528. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5529. rightType := procedureType.firstParameter.nextParameter.type;
  5530. ELSE
  5531. rightType := NIL
  5532. END;
  5533. (* determine operator kind *)
  5534. IF IsStrictlyPointerToRecord(leftType) THEN
  5535. kind := {LhsIsPointer}
  5536. ELSE
  5537. kind := {}
  5538. END;
  5539. IF IsStrictlyPointerToRecord(rightType) THEN
  5540. kind := kind + {RhsIsPointer}
  5541. END;
  5542. IF kind # {} THEN (* TODO: to be removed later on *)
  5543. (* at least one of the types is a pointer to record *)
  5544. (* emit a code that registers this specific operator in the runtime *)
  5545. dump := operatorInitializationCodeSection.comments;
  5546. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5547. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5548. (* push ID *)
  5549. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5550. id := Global.GetSymbol(module.module.case, operator.name);
  5551. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5552. (* push kind *)
  5553. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5554. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5555. (* push type infos *)
  5556. PushTypeInfo(leftType);
  5557. PushTypeInfo(rightType);
  5558. (* push operator address *)
  5559. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5560. StaticCallOperand(operatorOperand, operator);
  5561. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5562. ReleaseOperand(operatorOperand);
  5563. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5564. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5565. ReleaseOperand(runtimeProcedureOperand)
  5566. END
  5567. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5568. END
  5569. END RegisterDynamicOperator;
  5570. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5571. VAR
  5572. traceModule: SyntaxTree.Module;
  5573. procedure: SyntaxTree.Procedure;
  5574. procedureVariable: SyntaxTree.Variable;
  5575. s,msg: Basic.MessageString;
  5576. res: Operand;
  5577. i: LONGINT;
  5578. sv: SyntaxTree.StringValue;
  5579. type: SyntaxTree.Type;
  5580. recordType: SyntaxTree.RecordType;
  5581. printout: Printout.Printer;
  5582. stringWriter: Streams.StringWriter;
  5583. expression: SyntaxTree.Expression;
  5584. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5585. BEGIN
  5586. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5587. IF procedure = NIL THEN
  5588. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5589. END;
  5590. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5591. s := "procedure ";
  5592. Strings.Append(s,backend.traceModuleName);
  5593. Strings.Append(s,".");
  5594. Strings.Append(s,procedureName);
  5595. Strings.Append(s," not present");
  5596. Error(position,s);
  5597. RETURN FALSE
  5598. ELSE
  5599. RETURN TRUE
  5600. END;
  5601. END GetProcedure;
  5602. PROCEDURE CallProcedure;
  5603. VAR size: LONGINT;
  5604. BEGIN
  5605. IF procedure # NIL THEN
  5606. StaticCallOperand(result,procedure);
  5607. size := ProcedureParametersSize(system,procedure);
  5608. ELSE
  5609. Symbol(procedureVariable, result);
  5610. LoadValue(result, procedureVariable.type.resolved);
  5611. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5612. END;
  5613. Emit(Call(position,result.op,size));
  5614. END CallProcedure;
  5615. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5616. VAR res: Operand; string: SyntaxTree.String;
  5617. BEGIN
  5618. IF GetProcedure("String") THEN
  5619. NEW(string, LEN(s)); COPY(s, string^);
  5620. sv := SyntaxTree.NewStringValue(-1,string);
  5621. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5622. sv.SetType(type);
  5623. Designate(sv,res);
  5624. Emit(Push(position,res.tag));
  5625. Emit(Push(position,res.op));
  5626. ReleaseOperand(res);
  5627. CallProcedure;
  5628. END;
  5629. END String;
  5630. PROCEDURE Integer(op: IntermediateCode.Operand);
  5631. BEGIN
  5632. IF GetProcedure("Int") THEN
  5633. Emit(Push(position,op));
  5634. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5635. CallProcedure;
  5636. END;
  5637. END Integer;
  5638. PROCEDURE Float(op: IntermediateCode.Operand);
  5639. BEGIN
  5640. IF GetProcedure("HIntHex") THEN
  5641. Emit(Push(position,op));
  5642. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5643. CallProcedure;
  5644. END;
  5645. END Float;
  5646. PROCEDURE Set(op: IntermediateCode.Operand);
  5647. BEGIN
  5648. IF GetProcedure("Set") THEN
  5649. Emit(Push(position,op));
  5650. (*
  5651. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5652. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5653. *)
  5654. CallProcedure;
  5655. END;
  5656. END Set;
  5657. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5658. BEGIN
  5659. IF GetProcedure("Boolean") THEN
  5660. Emit(Push(position,op));
  5661. CallProcedure;
  5662. END;
  5663. END Boolean;
  5664. PROCEDURE Char(op: IntermediateCode.Operand);
  5665. BEGIN
  5666. IF GetProcedure("Char") THEN
  5667. Emit(Push(position,op));
  5668. CallProcedure;
  5669. END;
  5670. END Char;
  5671. PROCEDURE Address(op: IntermediateCode.Operand);
  5672. BEGIN
  5673. IF GetProcedure("Address") THEN
  5674. Emit(Push(position,op));
  5675. CallProcedure;
  5676. END;
  5677. END Address;
  5678. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5679. BEGIN
  5680. IF GetProcedure("String") THEN
  5681. Emit(Push(position,tag));
  5682. Emit(Push(position,op));
  5683. CallProcedure;
  5684. END;
  5685. END StringOperand;
  5686. PROCEDURE Ln;
  5687. BEGIN
  5688. IF GetProcedure("Ln") THEN
  5689. CallProcedure;
  5690. END;
  5691. END Ln;
  5692. BEGIN
  5693. IF backend.traceModuleName = "" THEN RETURN END;
  5694. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5695. IF GetProcedure("Enter") THEN
  5696. CallProcedure
  5697. END;
  5698. NEW(stringWriter,LEN(s));
  5699. FOR i := 0 TO x.Length()-1 DO
  5700. msg := "";
  5701. expression := x.GetExpression(i);
  5702. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5703. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5704. ELSE
  5705. Global.GetModuleName(module.module, s);
  5706. END;
  5707. IF i = 0 THEN
  5708. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5709. stringWriter.String(":");
  5710. END;
  5711. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5712. IF ~(expression IS SyntaxTree.StringValue) THEN
  5713. printout.Expression(expression);
  5714. stringWriter.Get(s);
  5715. Strings.Append(msg,s);
  5716. Strings.Append(msg,"= ");
  5717. ELSE stringWriter.Get(s); (* remove from string writer *)
  5718. Strings.Append(msg, s);
  5719. END;
  5720. String(msg);
  5721. IF SemanticChecker.IsStringType(expression.type) THEN
  5722. Designate(expression,res);
  5723. StringOperand(res.op,res.tag);
  5724. ELSE
  5725. Evaluate(expression,res);
  5726. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5727. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5728. Convert(res.op,int64);
  5729. END;
  5730. Integer(res.op);
  5731. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5732. Boolean(res.op);
  5733. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5734. Set(res.op);
  5735. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5736. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5737. Convert(res.op,float64);
  5738. END;
  5739. Float(res.op);
  5740. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5741. Char(res.op);
  5742. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5743. Address(res.op);String("H");
  5744. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5745. Address(res.op);String("H");
  5746. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5747. Address(res.op);String("H");
  5748. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5749. Address(res.op);String("H");
  5750. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5751. String("NIL");
  5752. ELSE HALT(200);
  5753. END;
  5754. END;
  5755. ReleaseOperand(res);
  5756. String("; ");
  5757. END;
  5758. IF GetProcedure("Exit") THEN
  5759. CallProcedure
  5760. ELSE
  5761. Ln;
  5762. END;
  5763. END;
  5764. END SystemTrace;
  5765. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5766. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5767. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5768. BEGIN
  5769. type := type.resolved;
  5770. IF type IS SyntaxTree.RecordType THEN
  5771. WITH type: SyntaxTree.RecordType DO
  5772. baseType := type.baseType;
  5773. IF baseType # NIL THEN
  5774. baseType := baseType.resolved;
  5775. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5776. InitFields(baseType,adr,offset);
  5777. END;
  5778. variable := type.recordScope.firstVariable;
  5779. WHILE variable # NIL DO
  5780. IF variable.initializer # NIL THEN
  5781. Evaluate(variable.initializer,initializerOp);
  5782. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5783. Emit(Mov(position,mem,initializerOp.op));
  5784. ReleaseOperand(initializerOp);
  5785. ReleaseIntermediateOperand(mem);
  5786. END;
  5787. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5788. variable := variable.nextVariable
  5789. END;
  5790. END;
  5791. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5792. WITH type: SyntaxTree.ArrayType DO
  5793. IF type.form = SyntaxTree.Static THEN
  5794. baseType := type.arrayBase;
  5795. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5796. FOR i := 0 TO type.staticLength-1 DO
  5797. InitFields(baseType,adr,offset+i*size);
  5798. END;
  5799. END;
  5800. END;
  5801. ELSIF type IS SyntaxTree.MathArrayType THEN
  5802. WITH type: SyntaxTree.MathArrayType DO
  5803. IF type.form = SyntaxTree.Open THEN
  5804. dim := DynamicDim(type);
  5805. imm := IntermediateCode.Immediate(addressType,dim);
  5806. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5807. baseType := SemanticChecker.ArrayBase(type,dim);
  5808. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5809. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5810. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5811. ReleaseIntermediateOperand(imm);
  5812. (* flags remain empty (=0) for open array *)
  5813. ELSIF type.form = SyntaxTree.Static THEN
  5814. baseType := type.arrayBase;
  5815. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5816. ASSERT(type.staticLength < 1024*1024*1024);
  5817. FOR i := 0 TO type.staticLength-1 DO
  5818. InitFields(baseType,adr,offset+i*size);
  5819. END;
  5820. END;
  5821. END;
  5822. END;
  5823. END InitFields;
  5824. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5825. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5826. BEGIN
  5827. type := variable.type.resolved;
  5828. IF (type IS SyntaxTree.MathArrayType) THEN
  5829. WITH type: SyntaxTree.MathArrayType DO
  5830. IF type.form = SyntaxTree.Open THEN
  5831. Symbol(variable,operand);
  5832. InitFields(type, operand.tag,0);
  5833. ELSIF type.form = SyntaxTree.Tensor THEN
  5834. Symbol(variable, operand);
  5835. MakeMemory(tmp,operand.op,addressType,0);
  5836. ReleaseOperand(operand);
  5837. Emit(Mov(position,tmp, nil ) );
  5838. ReleaseIntermediateOperand(tmp);
  5839. END;
  5840. END;
  5841. ELSE
  5842. Symbol(variable,operand);
  5843. IF variable.initializer # NIL THEN
  5844. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5845. reference.SetType(variable.type.resolved);
  5846. reference.SetAssignable(TRUE);
  5847. Assign(reference,variable.initializer);
  5848. END;
  5849. InitFields(type, operand.op,0);
  5850. ReleaseOperand(operand);
  5851. END;
  5852. END InitVariable;
  5853. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5854. VAR end: Label;
  5855. BEGIN
  5856. IF type.form = SyntaxTree.Tensor THEN
  5857. InitOperand(result,ModeValue);
  5858. ReuseCopy(result.op,base);
  5859. end := NewLabel();
  5860. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5861. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5862. SetLabel(end);
  5863. Convert(result.op,int32);
  5864. ELSE
  5865. InitOperand(result,ModeValue);
  5866. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5867. END
  5868. END MathArrayDim;
  5869. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5870. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5871. BEGIN
  5872. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5873. MakeMemory(mem,base,addressType,offset);
  5874. Emit(Mov(position,mem,value));
  5875. ReleaseIntermediateOperand(mem);
  5876. END PutMathArrayField;
  5877. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5878. VAR mem: IntermediateCode.Operand;
  5879. BEGIN
  5880. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5881. MakeMemory(mem,base,addressType,offset);
  5882. Emit(Mov(position,mem,value));
  5883. ReleaseIntermediateOperand(mem);
  5884. END PutMathArrayFieldOffset;
  5885. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5886. BEGIN
  5887. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5888. MakeMemory(value,base,addressType,offset);
  5889. END GetMathArrayField;
  5890. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5891. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5892. BEGIN
  5893. IF incr THEN
  5894. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5895. ELSE
  5896. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5897. END;
  5898. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5899. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5900. ELSE
  5901. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5902. Emit(Mov(position,reg,dim));
  5903. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5904. Emit(Add(position,reg,reg,base));
  5905. MakeMemory(mem, reg, addressType, offset);
  5906. ReleaseIntermediateOperand(reg);
  5907. Emit(Mov(position,mem,value));
  5908. ReleaseIntermediateOperand(mem);
  5909. END;
  5910. END PutMathArrayLenOrIncr;
  5911. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5912. BEGIN
  5913. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5914. END PutMathArrayLength;
  5915. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5916. BEGIN
  5917. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5918. END PutMathArrayIncrement;
  5919. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5920. BEGIN
  5921. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5922. END GetMathArrayIncrement;
  5923. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5924. BEGIN
  5925. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5926. END GetMathArrayLength;
  5927. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5928. VAR dimOp: IntermediateCode.Operand;
  5929. BEGIN
  5930. dimOp := IntermediateCode.Immediate(int32, dim);
  5931. GetMathArrayLength(type, operand, dimOp, check, result);
  5932. END GetMathArrayLengthAt;
  5933. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5934. VAR dimOp: IntermediateCode.Operand;
  5935. BEGIN
  5936. dimOp := IntermediateCode.Immediate(int32, dim);
  5937. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5938. END GetMathArrayIncrementAt;
  5939. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5940. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5941. offset: LONGINT;
  5942. BEGIN
  5943. IF increment THEN
  5944. offset := MathIncrOffset;
  5945. ELSE
  5946. offset := MathLenOffset;
  5947. END;
  5948. INC(offset,operand.dimOffset*2);
  5949. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5950. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5951. END;
  5952. (* static dimension *)
  5953. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5954. IF check & (type.form = SyntaxTree.Tensor) THEN
  5955. DimensionCheck(operand.tag,dim,BrltL);
  5956. END;
  5957. val := SHORT(dim.intValue);
  5958. IF type.form # SyntaxTree.Tensor THEN
  5959. t := SemanticChecker.ArrayBase(type,val);
  5960. type := t.resolved(SyntaxTree.MathArrayType);
  5961. IF type.form = SyntaxTree.Static THEN
  5962. IF increment THEN
  5963. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5964. ELSE
  5965. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5966. END;
  5967. InitOperand(result,ModeValue);
  5968. result.op := res;
  5969. RETURN;
  5970. END;
  5971. END;
  5972. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5973. MakeMemory(res,operand.tag,addressType,offset);
  5974. (*
  5975. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5976. *)
  5977. InitOperand(result,ModeValue);
  5978. result.op := res;
  5979. ELSE
  5980. Convert(dim,addressType);
  5981. IF check THEN
  5982. IF type.form = SyntaxTree.Tensor THEN
  5983. DimensionCheck(operand.tag,dim,BrltL);
  5984. ELSIF isUnchecked THEN (* do nothing *)
  5985. ELSE
  5986. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5987. END;
  5988. END;
  5989. end := NewLabel(); next := NIL;
  5990. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5991. Emit(Mov(position,res,dim));
  5992. Convert(res,int32);
  5993. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5994. WHILE t IS SyntaxTree.MathArrayType DO
  5995. type := t(SyntaxTree.MathArrayType);
  5996. IF type.form = SyntaxTree.Static THEN
  5997. imm := IntermediateCode.Immediate(int32,val);
  5998. next := NewLabel();
  5999. BrneL(next,imm,res);
  6000. IF increment THEN
  6001. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  6002. ELSE
  6003. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6004. END;
  6005. Emit(MovReplace(position,res,imm));
  6006. BrL(end);
  6007. ELSE hasDynamicPart := TRUE;
  6008. END;
  6009. t := type.arrayBase.resolved;
  6010. val := val + 1;
  6011. IF next # NIL THEN SetLabel(next) END;
  6012. END;
  6013. IF hasDynamicPart THEN
  6014. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6015. Emit(Mov(position,res2,dim));
  6016. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6017. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6018. Emit(Add(position,res2,res2,imm));
  6019. Emit(Add(position,res2,res2,operand.tag));
  6020. IntermediateCode.MakeMemory(res2,int32);
  6021. Emit(MovReplace(position,res,res2));
  6022. ReleaseIntermediateOperand(res2);
  6023. END;
  6024. SetLabel(end);
  6025. Convert(res,int32);
  6026. InitOperand(result,ModeValue);
  6027. result.op := res;
  6028. END;
  6029. END MathArrayLenOrIncr;
  6030. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6031. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6032. offset: LONGINT;
  6033. BEGIN
  6034. offset := operand.dimOffset+DynamicDim(type)-1;
  6035. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6036. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6037. val := SHORT(dim.intValue);
  6038. t := SemanticChecker.ArrayBase(type,val);
  6039. type := t.resolved(SyntaxTree.ArrayType);
  6040. IF type.form = SyntaxTree.Static THEN
  6041. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6042. ELSE
  6043. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6044. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6045. END;
  6046. UseIntermediateOperand(res);
  6047. InitOperand(result,ModeValue);
  6048. result.op := res;
  6049. ELSE
  6050. Convert(dim,addressType);
  6051. IF ~isUnchecked THEN
  6052. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6053. END;
  6054. end := NewLabel(); next := NIL;
  6055. (* ReuseCopy(dim,res); *)
  6056. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6057. Emit(Mov(position,res,dim));
  6058. Convert(res,int32);
  6059. Convert(res,int32);
  6060. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6061. WHILE t IS SyntaxTree.ArrayType DO
  6062. type := t(SyntaxTree.ArrayType);
  6063. IF type.form = SyntaxTree.Static THEN
  6064. imm := IntermediateCode.Immediate(int32,val);
  6065. next := NewLabel();
  6066. BrneL(next,imm,res);
  6067. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6068. Emit(MovReplace(position,res,imm));
  6069. BrL(end);
  6070. ELSE hasDynamicPart := TRUE;
  6071. END;
  6072. t := type.arrayBase.resolved;
  6073. val := val + 1;
  6074. IF next # NIL THEN SetLabel(next) END;
  6075. END;
  6076. IF hasDynamicPart THEN
  6077. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6078. Convert(res2,addressType);
  6079. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6080. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6081. Emit(Sub(position,res2,imm,res2));
  6082. Emit(Add(position,res2,res2,operand.tag));
  6083. IntermediateCode.MakeMemory(res2,int32);
  6084. Emit(MovReplace(position,res,res2));
  6085. ReleaseIntermediateOperand(res2);
  6086. END;
  6087. SetLabel(end);
  6088. Convert(res,int32);
  6089. InitOperand(result,ModeValue);
  6090. result.op := res;
  6091. END;
  6092. END ArrayLen;
  6093. (**
  6094. create a temporary variable in current scope
  6095. **)
  6096. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  6097. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  6098. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6099. BEGIN
  6100. IF ~register THEN
  6101. variable := temporaries.GetFreeVariable(type, index);
  6102. ELSE
  6103. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6104. END;
  6105. scope := currentScope;
  6106. IF variable = NIL THEN
  6107. COPY("@hiddenIRVar",string);
  6108. Basic.AppendNumber(string,index);
  6109. name := SyntaxTree.NewIdentifier(string);
  6110. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  6111. variable.SetType(type);
  6112. variable.SetAccess(SyntaxTree.Hidden);
  6113. IF ~register THEN
  6114. temporaries.AddVariable(variable);
  6115. IF scope.lastVariable # NIL THEN
  6116. offset := scope.lastVariable.offsetInBits;
  6117. ELSE
  6118. offset := 0;
  6119. END;
  6120. DEC(offset,system.SizeOf(variable.type));
  6121. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6122. variable(SyntaxTree.Variable).SetOffset(offset);
  6123. scope.AddVariable(variable(SyntaxTree.Variable));
  6124. scope.EnterSymbol(variable, duplicate);
  6125. ASSERT(~duplicate);
  6126. InitVariable(variable(SyntaxTree.Variable));
  6127. ELSE
  6128. variable.SetUseRegister(TRUE);
  6129. variable(SyntaxTree.Variable).SetOffset(0);
  6130. END;
  6131. ELSE
  6132. InitVariable(variable(SyntaxTree.Variable));
  6133. (*
  6134. ASSERT(variable.type.resolved = type.resolved)
  6135. *)
  6136. END;
  6137. RETURN variable(SyntaxTree.Variable)
  6138. END GetTemporaryVariable;
  6139. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6140. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6141. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6142. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6143. i: LONGINT; duplicate: BOOLEAN;
  6144. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6145. VAR variable: SyntaxTree.Variable;
  6146. BEGIN
  6147. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  6148. variable.SetType(type);
  6149. recordScope.AddVariable(variable);
  6150. END AddVariable;
  6151. BEGIN
  6152. name := "@ArrayDescriptor";
  6153. Basic.AppendNumber(name,dimensions);
  6154. identifier := SyntaxTree.NewIdentifier(name);
  6155. parentScope := module.module.moduleScope;
  6156. symbol := parentScope.FindSymbol(identifier);
  6157. IF symbol # NIL THEN
  6158. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6159. type := typeDeclaration.declaredType;
  6160. ELSE
  6161. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  6162. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6163. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6164. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  6165. recordType.SetTypeDeclaration(typeDeclaration);
  6166. recordType.SetState(SyntaxTree.Resolved);
  6167. typeDeclaration.SetDeclaredType(recordType);
  6168. AddVariable("@ptr",system.anyType);
  6169. AddVariable("@adr",system.addressType);
  6170. AddVariable("@flags",system.addressType);
  6171. AddVariable("@dim",system.addressType);
  6172. AddVariable("@elementSize",system.addressType);
  6173. FOR i := 0 TO dimensions-1 DO
  6174. name := "@len";
  6175. Basic.AppendNumber(name,i);
  6176. AddVariable(name,system.addressType);
  6177. name := "@incr";
  6178. Basic.AppendNumber(name,i);
  6179. AddVariable(name,system.addressType);
  6180. END;
  6181. parentScope.AddTypeDeclaration(typeDeclaration);
  6182. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6183. ASSERT(~duplicate);
  6184. type := recordType;
  6185. END;
  6186. RETURN type
  6187. END GetMathArrayDescriptorType;
  6188. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6189. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6190. BEGIN
  6191. type := GetMathArrayDescriptorType(dimensions);
  6192. Emit(Push(position,op.op));
  6193. (* push type descriptor *)
  6194. reg := TypeDescriptorAdr(type);
  6195. IF ~newObjectFile THEN
  6196. IntermediateCode.MakeMemory(reg,addressType);
  6197. END;
  6198. Emit(Push(position,reg));
  6199. ReleaseIntermediateOperand(reg);
  6200. (* push realtime flag: false by default *)
  6201. Emit(Push(position,false));
  6202. CallThis(position,"Heaps","NewRec",3);
  6203. END NewMathArrayDescriptor;
  6204. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6205. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6206. BEGIN
  6207. NEW(string, LEN(s)); COPY(s, string^);
  6208. sv := SyntaxTree.NewStringValue(-1,string);
  6209. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6210. sv.SetType(type);
  6211. Designate(sv,res);
  6212. Emit(Push(position,res.tag));
  6213. Emit(Push(position,res.op));
  6214. ReleaseOperand(res);
  6215. END PushConstString;
  6216. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6217. BEGIN
  6218. IF b THEN
  6219. Emit(Push(-1, true));
  6220. ELSE
  6221. Emit(Push(-1, false));
  6222. END;
  6223. END PushConstBoolean;
  6224. PROCEDURE PushConstSet(v: SET);
  6225. VAR value: SyntaxTree.Value; op: Operand;
  6226. BEGIN
  6227. value := SyntaxTree.NewSetValue(-1, v);
  6228. value.SetType(system.setType);
  6229. Evaluate(value, op);
  6230. Emit(Push(-1, op.op));
  6231. ReleaseOperand(op);
  6232. END PushConstSet;
  6233. PROCEDURE PushConstInteger(v: LONGINT);
  6234. VAR value: SyntaxTree.Value; op: Operand;
  6235. BEGIN
  6236. value := SyntaxTree.NewIntegerValue(-1, v);
  6237. value.SetType(system.longintType);
  6238. Evaluate(value, op);
  6239. Emit(Push(-1, op.op));
  6240. ReleaseOperand(op);
  6241. END PushConstInteger;
  6242. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6243. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6244. section: IntermediateCode.Section;
  6245. BEGIN
  6246. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6247. Global.GetSymbolSegmentedName(symbol, name);
  6248. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6249. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6250. procedure.SetScope(moduleScope);
  6251. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6252. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6253. procedure.SetAccess(SyntaxTree.Hidden);
  6254. currentScope := procedureScope;
  6255. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6256. EmitEnter(section, -1,NIL,0,0,0);
  6257. RETURN section;
  6258. END OpenInitializer;
  6259. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6260. BEGIN
  6261. EmitLeave(section, 0, 0 );
  6262. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6263. section := prev;
  6264. END CloseInitializer;
  6265. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6266. VAR name: SyntaxTree.IdentifierString;
  6267. variable: SyntaxTree.Variable;
  6268. type: SyntaxTree.Type;
  6269. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6270. BEGIN
  6271. InitOperand(op,ModeReference);
  6272. op.op := fp;
  6273. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6274. Dereference(op, x, FALSE);
  6275. result := op;
  6276. Symbol(symbol, op);
  6277. END Field;
  6278. PROCEDURE Direction(direction: LONGINT): SET;
  6279. BEGIN
  6280. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6281. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6282. ELSE HALT(100);
  6283. END;
  6284. END Direction;
  6285. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6286. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6287. BEGIN
  6288. Field(port, op);
  6289. ToMemory(op.op,addressType,0);
  6290. Emit(Push(-1, op.op));
  6291. ReleaseOperand(op);
  6292. Basic.GetString(modifier.identifier, name);
  6293. PushConstString(name);
  6294. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6295. ASSERT(SemanticChecker.IsStringType(value.type));
  6296. Designate(value, op);
  6297. Emit(Push(modifier.position, op.tag));
  6298. Emit(Push(modifier.position, op.op));
  6299. ReleaseOperand(op);
  6300. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6301. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6302. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6303. Evaluate(value, op);
  6304. Emit(Push(modifier.position, op.op));
  6305. ReleaseOperand(op);
  6306. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6307. ELSE
  6308. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6309. END;
  6310. END AddPortProperty;
  6311. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6312. VAR modifier: SyntaxTree.Modifier;
  6313. BEGIN
  6314. modifier := variable.modifiers;
  6315. WHILE modifier # NIL DO
  6316. AddPortProperty(variable,modifier, modifier.expression);
  6317. modifier := modifier.nextModifier;
  6318. END;
  6319. END AddPortProperties;
  6320. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6321. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6322. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6323. PROCEDURE PushLens(type: SyntaxTree.Type);
  6324. BEGIN
  6325. IF IsSemiDynamicArray(type) THEN
  6326. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6327. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6328. Emit(Push(-1, op.op));
  6329. ReleaseOperand(op);
  6330. INC(dim);
  6331. ELSIF IsStaticArray(type) THEN
  6332. len := len * type(SyntaxTree.ArrayType).staticLength;
  6333. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6334. INC(dim);
  6335. ELSE
  6336. baseType := type;
  6337. END;
  6338. END PushLens;
  6339. BEGIN
  6340. (* cell *)
  6341. IF variable.type IS SyntaxTree.ArrayType THEN
  6342. type := variable.type;
  6343. dim := 0;
  6344. len := 1;
  6345. PushLens(type);
  6346. portType := baseType.resolved(SyntaxTree.PortType);
  6347. ELSE
  6348. portType := variable.type(SyntaxTree.PortType);
  6349. END;
  6350. PushSelfPointer();
  6351. (* port / array of ports *)
  6352. IF IsStaticArray(type) THEN
  6353. PushConstInteger(len);
  6354. END;
  6355. Field(variable, op);
  6356. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6357. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6358. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6359. Designate(d, op);*)
  6360. Emit(Push(-1, op.op));
  6361. ReleaseOperand(op);
  6362. (* name *)
  6363. PushConstString(name);
  6364. (* inout *)
  6365. PushConstSet(Direction(portType.direction));
  6366. (* width *)
  6367. PushConstInteger(portType.sizeInBits);
  6368. IF variable.type IS SyntaxTree.PortType THEN
  6369. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6370. AddPortProperties(variable);
  6371. ELSIF IsStaticArray(type)THEN
  6372. CallThis(variable.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6373. ELSIF IsSemiDynamicArray(type) THEN
  6374. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6375. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6376. Emit(Add(position,reg, sp, size));
  6377. (* dim *)
  6378. PushConstInteger(dim);
  6379. (* len array *)
  6380. Emit(Push(position, reg));
  6381. ReleaseIntermediateOperand(reg);
  6382. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6383. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6384. Emit(Add(position, sp,sp, size));
  6385. ELSE
  6386. HALT(100);
  6387. END;
  6388. END Variable;
  6389. BEGIN
  6390. IF backend.cellsAreObjects THEN
  6391. variable := x.cellScope.firstVariable;
  6392. WHILE (variable # NIL) DO
  6393. type := variable.type.resolved;
  6394. WHILE (type IS SyntaxTree.ArrayType) DO
  6395. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6396. END;
  6397. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6398. Global.GetSymbolNameInScope(variable,x.cellScope,name);
  6399. Variable(name,variable);
  6400. END;
  6401. variable := variable.nextVariable;
  6402. END;
  6403. ELSE HALT(200)
  6404. END;
  6405. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6406. (*
  6407. x.typeDeclaration.GetName(componentName);
  6408. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6409. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6410. instanceType.SetDataMemorySize(dataMemorySize);
  6411. END;
  6412. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6413. instanceType.SetInstructionMemorySize(codeMemorySize)
  6414. END;
  6415. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6416. instanceType.AddCapability(ActiveCells.VectorCapability)
  6417. END;
  6418. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6419. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6420. END;
  6421. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6422. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6423. END;
  6424. AddDevices(instanceType, x);
  6425. *)
  6426. (*
  6427. IF x.isCellNet THEN
  6428. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6429. END;
  6430. *)
  6431. (*currentActiveCellsScope := instanceType;*)
  6432. (*
  6433. parameter := x.firstParameter;
  6434. portIndex := 0;
  6435. WHILE parameter # NIL DO
  6436. parameter.GetName(parameterName);
  6437. parameterType := parameter.type.resolved;
  6438. Parameter(parameterName, parameterType);
  6439. (*
  6440. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6441. ParameterArray(parameterType);
  6442. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6443. FOR i := 0 TO len-1 DO
  6444. COPY(parameterName,name);
  6445. AppendIndex(name,i);
  6446. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6447. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6448. INC(portIndex);
  6449. END;
  6450. ELSE
  6451. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6452. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6453. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6454. INC(portIndex);
  6455. END;
  6456. *)
  6457. parameter := parameter.nextParameter;
  6458. END;
  6459. *)
  6460. (*
  6461. Scope(x.cellScope);
  6462. currentActiveCellsScope := prevActiveCellsScope;
  6463. AddModules(instanceType,x.cellScope);
  6464. *)
  6465. END AddPorts;
  6466. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6467. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6468. BEGIN
  6469. Symbol(cell,op);
  6470. ToMemory(op.op,addressType,0);
  6471. Emit(Push(position,op.op));
  6472. ReleaseOperand(op);
  6473. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6474. PushConstString(name);
  6475. IF (value # NIL) THEN
  6476. ASSERT(
  6477. SemanticChecker.IsStringType(property.type)
  6478. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6479. OR (property.type.resolved IS SyntaxTree.FloatType)
  6480. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6481. OR (property.type.resolved IS SyntaxTree.SetType)
  6482. );
  6483. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6484. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6485. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6486. Designate(d, op);
  6487. IF SemanticChecker.IsStringType(property.type) THEN
  6488. Emit(Push(-1, op.tag))
  6489. END;
  6490. Emit(Push(-1, op.op));
  6491. ReleaseOperand(op);
  6492. END;
  6493. IF value = NIL THEN
  6494. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6495. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6496. ASSERT(SemanticChecker.IsStringType(value.type));
  6497. Designate(value, op);
  6498. Emit(Push(property.position, op.tag));
  6499. Emit(Push(property.position, op.op));
  6500. ReleaseOperand(op);
  6501. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6502. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6503. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6504. Evaluate(value, op);
  6505. Emit(Push(property.position, op.op));
  6506. ReleaseOperand(op);
  6507. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6508. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6509. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6510. Evaluate(value, op);
  6511. Emit(Push(property.position, op.op));
  6512. ReleaseOperand(op);
  6513. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6514. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6515. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6516. Evaluate(value, op);
  6517. Emit(Push(property.position, op.op));
  6518. ReleaseOperand(op);
  6519. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6520. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6521. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6522. Evaluate(value, op);
  6523. Emit(Push(property.position, op.op));
  6524. ReleaseOperand(op);
  6525. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6526. ELSE
  6527. HALT(200);
  6528. END;
  6529. END AddProperty;
  6530. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6531. VAR symbol: SyntaxTree.Symbol;
  6532. BEGIN
  6533. WHILE modifier # NIL DO
  6534. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6535. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6536. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6537. ELSE
  6538. (*! move this check to checker *)
  6539. Error(modifier.position, "undefined property");
  6540. END;
  6541. modifier := modifier.nextModifier;
  6542. END;
  6543. END AddModifiers;
  6544. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6545. VAR last: SyntaxTree.Modifier;
  6546. BEGIN
  6547. IF to = NIL THEN
  6548. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6549. ELSE
  6550. last := to;
  6551. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6552. last := last.nextModifier;
  6553. END;
  6554. IF last.identifier # this.identifier THEN
  6555. ASSERT(last.nextModifier = NIL);
  6556. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6557. END;
  6558. END;
  6559. END AppendModifier;
  6560. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6561. BEGIN
  6562. WHILE this # NIL DO
  6563. AppendModifier(to, this);
  6564. this := this.nextModifier;
  6565. END;
  6566. END AppendModifiers;
  6567. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6568. VAR base: SyntaxTree.Type;
  6569. BEGIN
  6570. AppendModifiers(to, c.modifiers);
  6571. base := c.GetBaseValueType();
  6572. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6573. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6574. END;
  6575. END AppendCellTypeModifiers;
  6576. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6577. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6578. BEGIN
  6579. Basic.GetString(modifier.identifier, name);
  6580. PushConstString(name);
  6581. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6582. ASSERT(SemanticChecker.IsStringType(value.type));
  6583. Designate(value, op);
  6584. Emit(Push(modifier.position, op.tag));
  6585. Emit(Push(modifier.position, op.op));
  6586. ReleaseOperand(op);
  6587. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6588. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6589. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6590. Evaluate(value, op);
  6591. Emit(Push(modifier.position, op.op));
  6592. ReleaseOperand(op);
  6593. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6594. ELSE
  6595. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6596. END;
  6597. END AddPortProperty;
  6598. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6599. BEGIN
  6600. WHILE modifier # NIL DO
  6601. AddPortProperty(modifier, modifier.expression);
  6602. modifier := modifier.nextModifier;
  6603. END;
  6604. END AddPortProperties;
  6605. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6606. VAR op: Operand;
  6607. BEGIN
  6608. Evaluate(p, op);
  6609. Emit(Push(p.position, op.op));
  6610. ReleaseOperand(op);
  6611. IF p IS SyntaxTree.Designator THEN
  6612. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6613. END;
  6614. END PushPort;
  6615. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6616. VAR
  6617. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6618. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6619. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6620. tmp:IntermediateCode.Operand;
  6621. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6622. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6623. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6624. dest: IntermediateCode.Operand;
  6625. staticLength: LONGINT; itype: IntermediateCode.Type;
  6626. convert,isTensor: BOOLEAN;
  6627. recordType: SyntaxTree.RecordType;
  6628. baseType: SyntaxTree.Type;
  6629. flags: SET;
  6630. left: SyntaxTree.Expression;
  6631. call: SyntaxTree.Designator;
  6632. procedure: SyntaxTree.Procedure;
  6633. temporaryVariable: SyntaxTree.Variable;
  6634. dummy: IntermediateCode.Operand;
  6635. customBuiltin: SyntaxTree.CustomBuiltin;
  6636. isVarPar: ARRAY 3 OF BOOLEAN;
  6637. callsection: Sections.Section;
  6638. segmentedName: Basic.SegmentedName;
  6639. needsTrace: BOOLEAN;
  6640. n: ARRAY 256 OF CHAR;
  6641. modifier: SyntaxTree.Modifier;
  6642. previous, init: IntermediateCode.Section;
  6643. prevScope: SyntaxTree.Scope;
  6644. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6645. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6646. priority: IntermediateCode.Operand;
  6647. op,callop: Operand;
  6648. BEGIN
  6649. IF type = NIL THEN RETURN END;
  6650. type := type.resolved;
  6651. IF type IS SyntaxTree.PointerType THEN
  6652. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6653. END;
  6654. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6655. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6656. recordScope := type(SyntaxTree.RecordType).recordScope;
  6657. IF recordScope.bodyProcedure # NIL THEN
  6658. procedure := recordScope.bodyProcedure;
  6659. body := procedure.procedureScope.body;
  6660. Emit(Push(position,self));
  6661. IF body.isActive THEN
  6662. StaticCallOperand(callop,procedure);
  6663. Emit(Push(position,callop.op));
  6664. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6665. Convert(priority,sizeType);
  6666. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6667. END;
  6668. Emit(Push(position,priority));
  6669. ReleaseIntermediateOperand(priority);
  6670. IF backend.cooperative THEN
  6671. Emit(Push(position,self));
  6672. CallThis(position,"Activities","Create",3)
  6673. ELSE
  6674. flags := 0;
  6675. IF body.isSafe THEN
  6676. flags := 1;
  6677. END;
  6678. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6679. Emit(Push(position,self));
  6680. CallThis(position,"Objects","CreateProcess",4)
  6681. END;
  6682. ELSE
  6683. Emit(Push(position,self));
  6684. StaticCallOperand(callop,procedure);
  6685. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6686. END;
  6687. Emit(Pop(position,self));
  6688. END;
  6689. END CallBodies;
  6690. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6691. BEGIN
  6692. actualType := actualType.resolved;
  6693. IF actualType IS SyntaxTree.StringType THEN
  6694. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6695. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6696. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6697. ELSE
  6698. tmp := op.tag;
  6699. IntermediateCode.MakeMemory(tmp,addressType);
  6700. Emit(Push(position,tmp));
  6701. END;
  6702. Emit(Push(position,op.op))
  6703. END PushString;
  6704. PROCEDURE PushTD(type: SyntaxTree.Type);
  6705. VAR op: IntermediateCode.Operand;
  6706. BEGIN
  6707. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6708. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6709. ELSE
  6710. IF type.resolved IS SyntaxTree.PointerType THEN
  6711. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6712. END;
  6713. op := TypeDescriptorAdr(type.resolved);
  6714. IF ~newObjectFile THEN
  6715. IntermediateCode.MakeMemory(op,addressType);
  6716. END;
  6717. Emit(Push(position,op));
  6718. END
  6719. END PushTD;
  6720. BEGIN
  6721. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6722. dest := destination; destination := emptyOperand;
  6723. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6724. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6725. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6726. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6727. CASE x.id OF
  6728. (* ---- COPY ----- *)
  6729. |Global.Copy:
  6730. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6731. (* ---- EXCL, INCL----- *)
  6732. |Global.Excl,Global.Incl:
  6733. Evaluate(p0,s0);
  6734. Evaluate(p1,s1);
  6735. Convert(s1.op,setType);
  6736. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6737. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6738. END;
  6739. ReuseCopy(res,s0.op);
  6740. ReleaseOperand(s0);
  6741. Reuse1(tmp,s1.op);
  6742. ReleaseOperand(s1);
  6743. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6744. IF x.id = Global.Excl THEN
  6745. Emit(Not(position,tmp,tmp));
  6746. Emit(And(position,res,res,tmp));
  6747. ELSE
  6748. Emit(Or(position,res,res,tmp));
  6749. END;
  6750. ReleaseIntermediateOperand(tmp);
  6751. Designate(p0,s0);
  6752. ToMemory(s0.op,setType,0);
  6753. Emit(Mov(position,s0.op,res));
  6754. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6755. (* ---- DISPOSE ----- *)
  6756. |Global.Dispose:
  6757. Designate(p0,s0);
  6758. Emit(Push(position,s0.op));
  6759. ReleaseOperand(s0);
  6760. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6761. (* ---- GETPROCEDURE ----- *)
  6762. |Global.GetProcedure:
  6763. Designate(p0,s0);
  6764. PushString(s0,p0.type);
  6765. Designate(p1,s1);
  6766. PushString(s1,p1.type);
  6767. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6768. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6769. ELSE PushTD(procedureType.firstParameter.type)
  6770. END;
  6771. PushTD(procedureType.returnType);
  6772. Designate(p2,s2);
  6773. Emit(Push(position,s2.op));
  6774. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6775. CallThis(position,"Modules","GetProcedure", 7);
  6776. (* ---- ASH, LSH, ROT ----- *)
  6777. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6778. Evaluate(p0,s0);
  6779. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6780. (* make unsigned arguments in order to produced a logical shift *)
  6781. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6782. convert:= TRUE;
  6783. itype := s0.op.type;
  6784. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6785. Convert(s0.op,itype);
  6786. ELSE
  6787. convert := FALSE;
  6788. END;
  6789. END;
  6790. Evaluate(p1,s1);
  6791. IF IsIntegerConstant(p1,hint) THEN
  6792. ReuseCopy(reg,s0.op);
  6793. IF hint > 0 THEN
  6794. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6795. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6796. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6797. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6798. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6799. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6800. END;
  6801. ELSIF hint < 0 THEN
  6802. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6803. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6804. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6805. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6806. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6807. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6808. END;
  6809. END;
  6810. ReleaseOperand(s0); ReleaseOperand(s1);
  6811. ELSE
  6812. exit := NewLabel();
  6813. end := NewLabel();
  6814. ReuseCopy(reg,s0.op);
  6815. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6816. Reuse1(tmp,s1.op);
  6817. Emit(Neg(position,tmp,s1.op));
  6818. Convert(tmp,s1.op.type);
  6819. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6820. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6821. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6822. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6823. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6824. END;
  6825. ReleaseIntermediateOperand(tmp);
  6826. BrL(end);
  6827. SetLabel(exit);
  6828. ReuseCopy(tmp,s1.op);
  6829. Convert(tmp,s1.op.type);
  6830. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6831. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6832. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6833. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6834. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6835. END;
  6836. ReleaseIntermediateOperand(tmp);
  6837. SetLabel(end);
  6838. ReleaseOperand(s0); ReleaseOperand(s1);
  6839. END;
  6840. InitOperand(result,ModeValue);
  6841. IF convert THEN
  6842. itype := reg.type;
  6843. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6844. Convert(reg,itype);
  6845. END;
  6846. result.op := reg;
  6847. (* ---- CAP ----- *)
  6848. |Global.Cap:
  6849. Evaluate(p0,result);
  6850. ReuseCopy(reg,result.op);
  6851. ReleaseIntermediateOperand(result.op);
  6852. ignore := NewLabel();
  6853. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6854. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6855. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6856. SetLabel(ignore);
  6857. result.op := reg;
  6858. (* ---- CHR ----- *)
  6859. |Global.Chr, Global.Chr32:
  6860. Evaluate(p0,result);
  6861. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6862. |Global.Entier, Global.EntierH:
  6863. Evaluate(p0,result);
  6864. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6865. (* ---- MIN and MAX ----- *)
  6866. |Global.Max,Global.Min:
  6867. Evaluate(p0,s0);
  6868. Evaluate(p1,s1);
  6869. Reuse2(res,s0.op,s1.op);
  6870. else := NewLabel();
  6871. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6872. ELSE BrltL(else,s1.op,s0.op) END;
  6873. Emit(Mov(position,res,s0.op));
  6874. ReleaseOperand(s0);
  6875. end := NewLabel();
  6876. BrL(end);
  6877. SetLabel(else);
  6878. Emit(MovReplace(position,res,s1.op));
  6879. SetLabel(end);
  6880. ReleaseOperand(s1);
  6881. InitOperand(result,ModeValue);
  6882. result.op := res;
  6883. (* ---- ODD ----- *)
  6884. |Global.Odd:
  6885. IF ~conditional THEN
  6886. ConditionToValue(x)
  6887. ELSE
  6888. Evaluate(p0,result);
  6889. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6890. Reuse1(res,result.op);
  6891. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6892. ReleaseIntermediateOperand(result.op);
  6893. result.op := res;
  6894. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6895. ReleaseOperand(result);
  6896. BrL(falseLabel);
  6897. END;
  6898. (* ---- ORD ----- *)
  6899. |Global.Ord, Global.Ord32:
  6900. Evaluate(p0,result);
  6901. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6902. (* ---- SHORT, LONG ----- *)
  6903. |Global.Short, Global.Long:
  6904. Evaluate(p0,result);
  6905. IF x.type IS SyntaxTree.ComplexType THEN
  6906. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6907. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6908. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6909. ELSE
  6910. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6911. END
  6912. (* ---- HALT, SYSTEM.HALT----- *)
  6913. |Global.Halt, Global.systemHalt:
  6914. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6915. EmitTrap (position, val);
  6916. (* ---- ASSERT ----- *)
  6917. |Global.Assert:
  6918. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6919. trueL := NewLabel();
  6920. falseL := NewLabel();
  6921. Condition(p0,trueL,falseL);
  6922. IF p1 = NIL THEN val := AssertTrap
  6923. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6924. END;
  6925. SetLabel(falseL);
  6926. EmitTrap(position,val);
  6927. SetLabel(trueL);
  6928. END;
  6929. (*
  6930. Emit(TrapC(result.op,val);
  6931. *)
  6932. (* ---- INC, DEC----- *)
  6933. |Global.Inc,Global.Dec:
  6934. Expression(p0); adr := result.op;
  6935. LoadValue(result,p0.type); l := result;
  6936. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6937. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6938. END;
  6939. IF x.id = Global.Inc THEN
  6940. Emit(Add(position,l.op,l.op,r.op));
  6941. ELSE
  6942. Emit(Sub(position,l.op,l.op,r.op));
  6943. END;
  6944. ReleaseOperand(l); ReleaseOperand(r);
  6945. (* ---- LEN ----- *)
  6946. |Global.Len: (* dynamic length, static length done by checker *)
  6947. Designate(p0,operand);
  6948. IF p1 = NIL THEN
  6949. InitOperand(l,ModeValue);
  6950. l.op := IntermediateCode.Immediate(int32,0);
  6951. ELSE
  6952. Evaluate(p1,l);
  6953. END;
  6954. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6955. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6956. Dereference(operand, p0.type.resolved, FALSE);
  6957. END;
  6958. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6959. ReleaseOperand(operand); ReleaseOperand(l);
  6960. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6961. ASSERT(p1 # NIL);
  6962. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6963. Dereference(operand,p0.type.resolved,FALSE);
  6964. END;
  6965. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6966. ReleaseOperand(operand); ReleaseOperand(l);
  6967. ELSE HALT(100);
  6968. END;
  6969. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6970. (* ---- FIRST ---- *)
  6971. |Global.First:
  6972. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6973. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6974. ELSE
  6975. Designate(p0, result)
  6976. END
  6977. (* ---- LAST ---- *)
  6978. |Global.Last:
  6979. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6980. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6981. ELSE
  6982. Designate(p0, result);
  6983. (* make sure result.op is a register *)
  6984. tmp := result.op;
  6985. ReuseCopy(result.op, result.op);
  6986. ReleaseIntermediateOperand(tmp);
  6987. (* add offset to result.op *)
  6988. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6989. END
  6990. (* ---- STEP ---- *)
  6991. |Global.Step:
  6992. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6993. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6994. ELSE
  6995. Designate(p0, result);
  6996. (* make sure result.op is a register *)
  6997. tmp := result.op;
  6998. ReuseCopy(result.op, result.op);
  6999. ReleaseIntermediateOperand(tmp);
  7000. (* add offset to result.op *)
  7001. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7002. END
  7003. (* ---- RE ---- *)
  7004. |Global.Re:
  7005. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7006. Designate(p0, result)
  7007. ELSE
  7008. Evaluate(p0, result)
  7009. END
  7010. (* ---- IM ---- *)
  7011. |Global.Im:
  7012. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7013. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7014. Designate(p0, result);
  7015. (* make sure result.op is a register *)
  7016. tmp := result.op;
  7017. ReuseCopy(result.op, result.op);
  7018. ReleaseIntermediateOperand(tmp);
  7019. (* add offset to result.op *)
  7020. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7021. (* ---- ABS ----- *)
  7022. |Global.Abs:
  7023. Evaluate(p0,operand);
  7024. type := p0.type.resolved;
  7025. InitOperand(result,ModeValue);
  7026. Reuse1a(result.op,operand.op,dest);
  7027. Emit(Abs(position,result.op,operand.op));
  7028. ReleaseOperand(operand);
  7029. (* ---- WAIT ----- *)
  7030. |Global.Wait:
  7031. Evaluate(p0,operand);
  7032. Emit(Push(position,operand.op));
  7033. ReleaseOperand(operand);
  7034. CallThis(position,"Activities","Wait", 1);
  7035. (* ---- NEW ----- *)
  7036. |Global.New:
  7037. (*! the following code is only correct for "standard" Oberon calling convention *)
  7038. type := p0.type.resolved;
  7039. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7040. THEN
  7041. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7042. IF backend.cooperative THEN
  7043. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7044. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7045. IF recordType.isObject THEN
  7046. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7047. IF recordType.IsActive() THEN
  7048. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7049. END;
  7050. IF recordType.IsProtected() THEN
  7051. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7052. END;
  7053. ELSE
  7054. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7055. END;
  7056. END;
  7057. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7058. CallThis(position,"Runtime","New", 1);
  7059. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7060. Emit(Result(position, pointer));
  7061. exit := NewLabel();
  7062. BreqL(exit,pointer,nil);
  7063. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7064. GetRecordTypeName (recordType,name);
  7065. IF ~recordType.isObject THEN
  7066. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7067. END;
  7068. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7069. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7070. IF recordType.isObject THEN
  7071. IF recordType.IsProtected() THEN
  7072. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7073. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7074. END;
  7075. IF recordType.IsActive() THEN
  7076. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7077. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7078. END;
  7079. END;
  7080. END;
  7081. (* initialize fields *)
  7082. IF type(SyntaxTree.PointerType).isPlain THEN
  7083. size := 0;
  7084. ELSIF recordType.isObject THEN
  7085. size := BaseObjectTypeSize;
  7086. ELSE
  7087. size := BaseRecordTypeSize;
  7088. END;
  7089. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7090. (* call initializer *)
  7091. constructor := GetConstructor(recordType);
  7092. IF constructor # NIL THEN
  7093. (*! should be unified with ProcedureCallDesignator *)
  7094. Emit(Push(position,pointer));
  7095. ReleaseIntermediateOperand(pointer);
  7096. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7097. FOR i := 1 TO x.parameters.Length()-1 DO
  7098. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7099. formalParameter := formalParameter.nextParameter;
  7100. END;
  7101. (* static call of the constructor *)
  7102. GetCodeSectionNameForSymbol(constructor,name);
  7103. ASSERT(~constructor.isInline);
  7104. IF constructor.scope.ownerModule # module.module THEN
  7105. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7106. ELSE
  7107. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7108. END;
  7109. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7110. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7111. Emit(Pop(position,pointer));
  7112. END;
  7113. (* call bodies *)
  7114. CallBodies(pointer,p0.type);
  7115. SetLabel(exit);
  7116. needsTrace := p0.NeedsTrace();
  7117. IF needsTrace THEN ModifyAssignments(true) END;
  7118. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7119. Emit(Push(position, pointer));
  7120. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7121. Emit(Pop(position, pointer));
  7122. END;
  7123. Designate(p0,l);
  7124. IF needsTrace THEN
  7125. CallAssignPointer(l.op, pointer);
  7126. ELSE
  7127. ToMemory(l.op,addressType,0);
  7128. Emit(Mov(position,l.op,pointer));
  7129. END;
  7130. ReleaseIntermediateOperand(pointer);
  7131. ReleaseOperand(l);
  7132. IF needsTrace THEN ModifyAssignments(false) END;
  7133. ELSE
  7134. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7135. IF temporaryVariable # NIL THEN
  7136. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7137. ELSE
  7138. Designate(p0,l);
  7139. END;
  7140. (* l.op contains address of pointer to record *)
  7141. Emit(Push(position,l.op)); (* address for use after syscall *)
  7142. Emit(Push(position,l.op));
  7143. ReleaseOperand(l);
  7144. (* push type descriptor *)
  7145. reg := TypeDescriptorAdr(recordType);
  7146. IF ~newObjectFile THEN
  7147. IntermediateCode.MakeMemory(reg,addressType);
  7148. END;
  7149. Emit(Push(position,reg));
  7150. ReleaseIntermediateOperand(reg);
  7151. (* push realtime flag *)
  7152. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7153. ELSE Emit(Push(position,false));
  7154. END;
  7155. CallThis(position,"Heaps","NewRec", 3);
  7156. (* check allocation success, if not successful then do not call initializers and bodies *)
  7157. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7158. Emit(Pop(position,pointer));
  7159. MakeMemory(reg,pointer,addressType,0);
  7160. ReleaseIntermediateOperand(pointer);
  7161. pointer := reg;
  7162. exit := NewLabel();
  7163. BreqL(exit,pointer,nil);
  7164. Emit(Push(position,pointer));
  7165. (* initialize fields *)
  7166. InitFields(recordType, pointer,0);
  7167. (* call initializer *)
  7168. constructor := GetConstructor(recordType);
  7169. IF constructor # NIL THEN
  7170. (*! should be unified with ProcedureCallDesignator *)
  7171. Emit(Push(position,pointer));
  7172. ReleaseIntermediateOperand(pointer);
  7173. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7174. FOR i := 1 TO x.parameters.Length()-1 DO
  7175. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7176. formalParameter := formalParameter.nextParameter;
  7177. END;
  7178. (* static call of the constructor *)
  7179. GetCodeSectionNameForSymbol(constructor,name);
  7180. ASSERT(~constructor.isInline);
  7181. IF constructor.scope.ownerModule # module.module THEN
  7182. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7183. ELSE
  7184. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7185. END;
  7186. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7187. ELSE
  7188. ReleaseIntermediateOperand(pointer);
  7189. END;
  7190. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7191. Emit(Pop(position,pointer));
  7192. IF temporaryVariable # NIL THEN
  7193. Designate(p0,l);
  7194. ToMemory(l.op,addressType,0);
  7195. Emit(Mov(position,l.op,pointer));
  7196. ReleaseOperand(l);
  7197. result.tag := emptyOperand;
  7198. END;
  7199. (* call bodies *)
  7200. CallBodies(pointer,p0.type);
  7201. ReleaseIntermediateOperand(pointer);
  7202. IF temporaryVariable # NIL THEN
  7203. end := NewLabel();
  7204. BrL(end);
  7205. SetLabel(exit);
  7206. Designate(p0,l);
  7207. ToMemory(l.op,addressType,0);
  7208. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7209. ReleaseOperand(l);
  7210. SetLabel(end);
  7211. ELSE
  7212. SetLabel(exit);
  7213. END;
  7214. END;
  7215. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7216. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7217. dim := 0;
  7218. IF p1 # NIL THEN
  7219. FOR i := 1 TO x.parameters.Length()-1 DO
  7220. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7221. parameter := x.parameters.GetExpression(i);
  7222. Evaluate(parameter,r);
  7223. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7224. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7225. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7226. END;
  7227. Emit(Push(position,r.op));
  7228. IF i=1 THEN
  7229. ReuseCopy(reg,r.op);
  7230. ELSE
  7231. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7232. END;
  7233. ReleaseOperand(r);
  7234. INC(dim);
  7235. END;
  7236. Convert(reg,addressType);
  7237. ELSE
  7238. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7239. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7240. END;
  7241. openDim := dim;
  7242. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7243. IF backend.cooperative THEN
  7244. size := ToMemoryUnits(system,system.SizeOf(type));
  7245. WHILE type IS SyntaxTree.ArrayType DO
  7246. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7247. END;
  7248. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7249. IF (size # 1) THEN
  7250. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7251. END;
  7252. Emit(Push(position,reg));
  7253. size := ToMemoryUnits(system,system.SizeOf(type));
  7254. IF (size # 1) THEN
  7255. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7256. END;
  7257. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7258. Emit(Push(position,reg));
  7259. ReleaseIntermediateOperand(reg);
  7260. CallThis(position,"Runtime","New", 1);
  7261. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7262. Emit(Result(position, pointer));
  7263. exit := NewLabel();
  7264. else := NewLabel();
  7265. BreqL(else,pointer,nil);
  7266. IF ~type.hasPointers THEN
  7267. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7268. ELSIF type IS SyntaxTree.RecordType THEN
  7269. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7270. ELSIF type IS SyntaxTree.ProcedureType THEN
  7271. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7272. ELSE
  7273. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7274. END;
  7275. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7276. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7277. 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))));
  7278. IF type IS SyntaxTree.RecordType THEN
  7279. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7280. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7281. ELSE
  7282. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7283. END;
  7284. i := openDim;
  7285. WHILE i > 0 DO
  7286. DEC (i);
  7287. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7288. END;
  7289. needsTrace := p0.NeedsTrace();
  7290. IF needsTrace THEN ModifyAssignments(true) END;
  7291. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7292. Emit(Push(position, pointer));
  7293. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7294. Emit(Pop(position, pointer));
  7295. END;
  7296. Designate(p0,l);
  7297. IF needsTrace THEN
  7298. CallAssignPointer(l.op, pointer);
  7299. ModifyAssignments(false);
  7300. ELSE
  7301. ToMemory(l.op,addressType,0);
  7302. Emit(Mov(position,l.op,pointer));
  7303. END;
  7304. ReleaseIntermediateOperand(pointer);
  7305. ReleaseOperand(l);
  7306. BrL(exit);
  7307. SetLabel(else);
  7308. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7309. Designate(p0,l);
  7310. IF needsTrace THEN
  7311. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7312. ELSE
  7313. ToMemory(l.op,addressType,0);
  7314. Emit(Mov(position,l.op,pointer));
  7315. END;
  7316. ReleaseOperand(l);
  7317. SetLabel(exit);
  7318. ELSE
  7319. (*! the following code is only correct for "standard" Oberon calling convention *)
  7320. IF SemanticChecker.ContainsPointer(type) THEN
  7321. IF type IS SyntaxTree.ArrayType THEN
  7322. staticLength := 1;
  7323. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7324. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7325. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7326. END;
  7327. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7328. Emit(Mul(position,reg,reg,tmp));
  7329. END;
  7330. Designate(p0,l);
  7331. IF openDim > 0 THEN
  7332. Emit(Push(position,l.op)); (* address for use after syscall *)
  7333. END;
  7334. Emit(Push(position,l.op)); (* address *)
  7335. ReleaseOperand(l);
  7336. tmp := TypeDescriptorAdr(type);
  7337. IF ~newObjectFile THEN
  7338. IntermediateCode.MakeMemory(tmp,addressType);
  7339. END;
  7340. Emit(Push(position,tmp)); (* type descriptor *)
  7341. ReleaseIntermediateOperand(tmp);
  7342. Emit(Push(position,reg)); (* number Elements *)
  7343. ReleaseIntermediateOperand(reg);
  7344. tmp := IntermediateCode.Immediate(addressType,dim);
  7345. Emit(Push(position,tmp)); (* dimensions *)
  7346. (* push realtime flag *)
  7347. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7348. ELSE Emit(Push(position,false));
  7349. END;
  7350. CallThis(position,"Heaps","NewArr",5)
  7351. ELSE
  7352. size := ToMemoryUnits(system,system.SizeOf(type));
  7353. IF (size # 1) THEN
  7354. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7355. END;
  7356. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7357. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7358. Emit(Add(position,reg,reg,tmp));
  7359. Designate(p0,l);
  7360. IF openDim >0 THEN
  7361. Emit(Push(position,l.op)); (* address for use after syscall *)
  7362. END;
  7363. Emit(Push(position,l.op)); (* address for syscall *)
  7364. ReleaseOperand(l); (* pointer address *)
  7365. Emit(Push(position,reg)); (* size *)
  7366. ReleaseIntermediateOperand(reg);
  7367. (* push realtime flag *)
  7368. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7369. ELSE Emit(Push(position,false));
  7370. END;
  7371. CallThis(position,"Heaps","NewSys", 3)
  7372. END;
  7373. IF openDim > 0 THEN
  7374. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7375. Emit(Pop(position,adr));
  7376. ToMemory(adr,addressType,0);
  7377. ReuseCopy(tmp,adr);
  7378. ReleaseIntermediateOperand(adr);
  7379. adr := tmp;
  7380. else := NewLabel();
  7381. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7382. i := openDim-1;
  7383. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7384. WHILE (i >= 0) DO
  7385. Emit(Pop(position,reg));
  7386. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7387. Emit(Mov(position,res,reg));
  7388. DEC(i);
  7389. END;
  7390. ReleaseIntermediateOperand(adr);
  7391. ReleaseIntermediateOperand(reg);
  7392. exit := NewLabel();
  7393. BrL(exit);
  7394. SetLabel(else);
  7395. (* else part: array could not be allocated *)
  7396. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7397. Emit(Add(position,sp,sp,tmp));
  7398. SetLabel(exit);
  7399. END;
  7400. END;
  7401. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7402. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7403. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7404. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7405. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7406. left.SetType(procedure.type);
  7407. formalParameter := procedureType.firstParameter;
  7408. (* push array to allocate *)
  7409. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7410. formalParameter :=formalParameter.nextParameter;
  7411. (* push length array *)
  7412. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7413. (* push size *)
  7414. type := t0;
  7415. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7416. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7417. END;
  7418. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7419. Emit(Push(position,tmp));
  7420. (* *)
  7421. IF SemanticChecker.ContainsPointer(type) THEN
  7422. tmp := TypeDescriptorAdr(type);
  7423. IF ~newObjectFile THEN
  7424. IntermediateCode.MakeMemory(tmp,addressType);
  7425. END;
  7426. ELSE
  7427. tmp := IntermediateCode.Immediate(addressType, 0);
  7428. END;
  7429. Emit(Push(position,tmp)); (* type descriptor *)
  7430. StaticCallOperand(result,procedure);
  7431. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7432. ReleaseOperand(result);
  7433. END;
  7434. (*
  7435. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7436. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7437. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7438. *)
  7439. ELSE
  7440. dim := 0;
  7441. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7442. (* generate geometry descriptor *)
  7443. Designate(p0,l);
  7444. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7445. ReleaseOperand(l);
  7446. isTensor := TRUE;
  7447. ELSE
  7448. isTensor := FALSE;
  7449. END;
  7450. FOR i := 1 TO x.parameters.Length()-1 DO
  7451. IF ~isTensor THEN
  7452. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7453. END;
  7454. parameter := x.parameters.GetExpression(i);
  7455. Evaluate(parameter,r);
  7456. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7457. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7458. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7459. END;
  7460. Emit(Push(position,r.op));
  7461. IF i=1 THEN
  7462. ReuseCopy(reg,r.op);
  7463. ELSE
  7464. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7465. END;
  7466. ReleaseOperand(r);
  7467. INC(dim);
  7468. END;
  7469. Convert(reg,addressType);
  7470. openDim := dim;
  7471. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7472. (*! the following code is only correct for "standard" Oberon calling convention *)
  7473. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7474. t := type;
  7475. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7476. staticLength := 1;
  7477. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7478. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7479. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7480. END;
  7481. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7482. Emit(Mul(position,reg,reg,tmp));
  7483. END;
  7484. Designate(p0,l);
  7485. IF isTensor THEN
  7486. Dereference(l,type,FALSE);
  7487. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7488. END;
  7489. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7490. Emit(Push(position,l.tag)); (* address *)
  7491. ReleaseOperand(l);
  7492. tmp := TypeDescriptorAdr(t);
  7493. IF ~newObjectFile THEN
  7494. IntermediateCode.MakeMemory(tmp,addressType);
  7495. END;
  7496. Emit(Push(position,tmp)); (* type descriptor *)
  7497. ReleaseIntermediateOperand(tmp);
  7498. Emit(Push(position,reg)); (* number Elements *)
  7499. ReleaseIntermediateOperand(reg);
  7500. tmp := IntermediateCode.Immediate(addressType,0);
  7501. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7502. (* push realtime flag: false by default *)
  7503. Emit(Push(position,false));
  7504. CallThis(position,"Heaps","NewArr",5);
  7505. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7506. Emit(Pop(position,adr));
  7507. GetMathArrayField(tmp,adr,MathPtrOffset);
  7508. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7509. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7510. PutMathArrayField(adr,reg,MathAdrOffset);
  7511. ReleaseIntermediateOperand(tmp);
  7512. ReleaseIntermediateOperand(reg);
  7513. ELSE
  7514. IF isTensor THEN
  7515. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7516. ELSE
  7517. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7518. END;
  7519. IF (size # 1) THEN
  7520. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7521. END;
  7522. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7523. Emit(Add(position,reg,reg,tmp));
  7524. Designate(p0,l);
  7525. IF isTensor THEN
  7526. Dereference(l,type,FALSE);
  7527. END;
  7528. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7529. Emit(Push(position,l.tag)); (* address for syscall *)
  7530. ReleaseOperand(l); (* pointer address *)
  7531. Emit(Push(position,reg)); (* size *)
  7532. ReleaseIntermediateOperand(reg);
  7533. (* push realtime flag: false by default *)
  7534. Emit(Push(position,false));
  7535. CallThis(position,"Heaps","NewSys",3);
  7536. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7537. Emit(Pop(position,adr));
  7538. GetMathArrayField(tmp,adr,MathPtrOffset);
  7539. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7540. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7541. PutMathArrayField(adr,reg,MathAdrOffset);
  7542. ReleaseIntermediateOperand(tmp);
  7543. ReleaseIntermediateOperand(reg);
  7544. END;
  7545. flags := {};
  7546. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7547. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7548. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7549. PutMathArrayField(adr,tmp,MathDimOffset);
  7550. else := NewLabel();
  7551. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7552. i := openDim-1;
  7553. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7554. IF isTensor THEN
  7555. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7556. ELSE
  7557. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7558. END;
  7559. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7560. WHILE (i >= 0) DO
  7561. Emit(Pop(position,reg));
  7562. PutMathArrayLength(adr,reg,i);
  7563. PutMathArrayIncrement(adr,tmp,i);
  7564. IF i > 0 THEN
  7565. IF i=openDim-1 THEN
  7566. ReuseCopy(tmp,tmp);
  7567. END;
  7568. Emit(Mul(position,tmp,tmp,reg));
  7569. END;
  7570. DEC(i);
  7571. END;
  7572. ReleaseIntermediateOperand(adr);
  7573. ReleaseIntermediateOperand(reg);
  7574. ReleaseIntermediateOperand(tmp);
  7575. exit := NewLabel();
  7576. BrL(exit);
  7577. SetLabel(else);
  7578. (* else part: array could not be allocated *)
  7579. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7580. Emit(Add(position,sp,sp,tmp));
  7581. SetLabel(exit);
  7582. END;
  7583. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7584. THEN
  7585. IF ~backend.cellsAreObjects THEN RETURN END;
  7586. IF InCellScope(currentScope) THEN
  7587. PushSelfPointer()
  7588. ELSE
  7589. Emit(Push(position, nil));
  7590. END;
  7591. (* push temp address *)
  7592. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7593. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7594. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7595. (* l.op contains address of pointer to record *)
  7596. Emit(Push(position,l.op)); (* address for use after syscall *)
  7597. ReleaseOperand(l);
  7598. (* push type descriptor *)
  7599. reg := TypeDescriptorAdr(baseType);
  7600. IF ~newObjectFile THEN
  7601. IntermediateCode.MakeMemory(reg,addressType);
  7602. END;
  7603. Emit(Push(position,reg));
  7604. ReleaseIntermediateOperand(reg);
  7605. (* push name *)
  7606. (*Global.GetSymbolName(p0, n);*)
  7607. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7608. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7609. ELSE
  7610. Global.GetModuleName(module.module, n);
  7611. END;
  7612. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7613. (*type.typeDeclaration.GetName(n);*)
  7614. PushConstString(n);
  7615. (* push cellnet boolean *)
  7616. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7617. (* push engine boolean *)
  7618. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7619. (* allocate *)
  7620. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7621. (* add capabilities *)
  7622. modifier := p0(SyntaxTree.Designator).modifiers;
  7623. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7624. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7625. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7626. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7627. END;
  7628. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7629. (*
  7630. modifier := baseType(SyntaxTree.CellType).modifiers;
  7631. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7632. modifier := p0(SyntaxTree.Designator).modifiers;
  7633. *)
  7634. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7635. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7636. (* l.op contains address of pointer to record *)
  7637. ToMemory(l.op,addressType,0);
  7638. (* l.op contains value of pointer to record *)
  7639. Emit(Push(position,l.op)); (* address for use after syscall *)
  7640. ReleaseOperand(l);
  7641. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7642. prevScope := currentScope;
  7643. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7644. previous := section;
  7645. section := init;
  7646. (* add ports *)
  7647. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7648. CloseInitializer(previous);
  7649. currentScope := prevScope;
  7650. Symbol(temporaryVariable,l);
  7651. ToMemory(l.op,addressType,0);
  7652. Emit(Push(position,l.op));
  7653. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7654. (*
  7655. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7656. IF constructor # NIL THEN
  7657. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7658. FOR i := 1 TO x.parameters.Length()-1 DO
  7659. p := x.parameters.GetExpression(i);
  7660. Global.GetSymbolName(parameter,name);
  7661. Evaluate(p, value);
  7662. ASSERT(value.type # NIL);
  7663. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7664. par := instance.AddParameter(name);
  7665. par.SetInteger(value.integer);
  7666. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7667. par := instance.AddParameter(name);
  7668. par.SetBoolean(value.boolean);
  7669. ELSE Error(x.position,NotYetImplemented)
  7670. END;
  7671. parameter := parameter.nextParameter
  7672. END;
  7673. END;
  7674. *)
  7675. (* call initializer *)
  7676. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7677. IF constructor # NIL THEN
  7678. (*! should be unified with ProcedureCallDesignator *)
  7679. IF backend.cellsAreObjects THEN
  7680. Symbol(temporaryVariable,l);
  7681. ToMemory(l.op,addressType,0);
  7682. Emit(Push(position,l.op));
  7683. ReleaseOperand(l);
  7684. END;
  7685. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7686. FOR i := 1 TO x.parameters.Length()-1 DO
  7687. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7688. formalParameter := formalParameter.nextParameter;
  7689. END;
  7690. (* static call of the constructor *)
  7691. Global.GetSymbolSegmentedName(constructor,name);
  7692. ASSERT(~constructor.isInline);
  7693. IF constructor.scope.ownerModule # module.module THEN
  7694. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7695. ELSE
  7696. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7697. END;
  7698. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7699. (*ELSE
  7700. ReleaseIntermediateOperand(pointer);*)
  7701. END;
  7702. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7703. ToMemory(l.op, addressType, 0);
  7704. Designate(p0,s0);
  7705. ToMemory(s0.op,addressType,0);
  7706. Emit(Mov(position,s0.op,l.op));
  7707. ReleaseOperand(l);
  7708. ReleaseOperand(s0);
  7709. result.tag := emptyOperand;
  7710. (* start *)
  7711. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7712. (* push cell *)
  7713. Symbol(temporaryVariable, l);
  7714. ToMemory(l.op,addressType,0);
  7715. Emit(Push(-1,l.op));
  7716. (* push delegate *)
  7717. Emit(Push(-1,l.op));
  7718. ReleaseOperand(l);
  7719. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7720. Emit(Push(position, s1.op));
  7721. ReleaseOperand(s1);
  7722. CallThis(position,"ActiveCellsRuntime","Start",3);
  7723. END;
  7724. (*IF temporaryVariable # NIL THEN
  7725. end := NewLabel();
  7726. BrL(end);
  7727. SetLabel(exit);
  7728. Designate(p0,l);
  7729. ToMemory(l.op,addressType,0);
  7730. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7731. ReleaseOperand(l);
  7732. SetLabel(end);
  7733. ELSE
  7734. SetLabel(exit);
  7735. END;
  7736. *)
  7737. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7738. ELSE (* no pointer to record, no pointer to array *)
  7739. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7740. (* ignore new statement *)
  7741. Warning(p0.position, "cannot run on final hardware");
  7742. ELSE
  7743. HALT(200);
  7744. END;
  7745. END;
  7746. (* ---- ADDRESSOF----- *)
  7747. |Global.systemAdr:
  7748. Designate(p0,s0);
  7749. s0.mode := ModeValue;
  7750. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7751. ReleaseIntermediateOperand(s0.op);
  7752. s0.op := s0.tag;
  7753. IntermediateCode.InitOperand(s0.tag);
  7754. END;
  7755. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7756. result := s0;
  7757. (* ---- BIT ----- *)
  7758. |Global.systemBit:
  7759. Evaluate(p0,s0);
  7760. ToMemory(s0.op,addressType,0);
  7761. ReuseCopy(res,s0.op);
  7762. ReleaseOperand(s0);
  7763. Evaluate(p1,s1);
  7764. Emit(Ror(position,res,res,s1.op));
  7765. ReleaseOperand(s1);
  7766. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7767. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7768. IF ~conditional THEN
  7769. InitOperand(result,ModeValue); result.op := res;
  7770. ELSE
  7771. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7772. BrL(falseLabel);
  7773. ReleaseIntermediateOperand(res);
  7774. END;
  7775. (* --- MSK ----*)
  7776. |Global.systemMsk:
  7777. Evaluate(p0,s0);
  7778. Evaluate(p1,s1);
  7779. ReuseCopy(res,s0.op);
  7780. ReleaseOperand(s0);
  7781. Emit(And(position,res,res,s1.op));
  7782. ReleaseOperand(s1);
  7783. InitOperand(result,ModeValue);
  7784. result.op := res;
  7785. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7786. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7787. Evaluate(p0,s0);
  7788. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7789. ReleaseOperand(s0);
  7790. InitOperand(result,ModeValue);
  7791. result.op := res;
  7792. (* ---- SYSTEM.GetStackPointer ----- *)
  7793. |Global.systemGetStackPointer:
  7794. InitOperand(result,ModeValue);
  7795. result.op := sp;
  7796. (* ---- SYSTEM.GetFramePointer ----- *)
  7797. |Global.systemGetFramePointer:
  7798. InitOperand(result,ModeValue);
  7799. result.op := fp;
  7800. (* ---- SYSTEM.GetActivity ----- *)
  7801. |Global.systemGetActivity:
  7802. ASSERT(backend.cooperative);
  7803. InitOperand(result,ModeValue);
  7804. result.op := ap;
  7805. (* ---- SYSTEM.SetStackPointer ----- *)
  7806. |Global.systemSetStackPointer:
  7807. Evaluate(p0,s0); (* *)
  7808. Emit(Mov(position,sp,s0.op));
  7809. ReleaseOperand(s0);
  7810. (* ---- SYSTEM.SetFramePointer ----- *)
  7811. |Global.systemSetFramePointer:
  7812. Evaluate(p0,s0); (* *)
  7813. Emit(Mov(position,fp,s0.op));
  7814. ReleaseOperand(s0);
  7815. (* ---- SYSTEM.Activity ----- *)
  7816. |Global.systemSetActivity:
  7817. ASSERT(backend.cooperative);
  7818. Evaluate(p0,s0); (* *)
  7819. Emit(Mov(position,ap,s0.op));
  7820. ReleaseOperand(s0);
  7821. (* ---- SYSTEM.VAL ----- *)
  7822. |Global.systemVal:
  7823. Expression(p1);
  7824. s1 := result;
  7825. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7826. IF s1.mode = ModeReference THEN
  7827. (* nothing to be done if not record type, just take over new type *)
  7828. IF (type IS SyntaxTree.RecordType) THEN
  7829. ReleaseIntermediateOperand(s1.tag);
  7830. s1.tag := TypeDescriptorAdr(type);
  7831. IF ~newObjectFile THEN
  7832. IntermediateCode.MakeMemory(s1.tag,addressType);
  7833. END;
  7834. UseIntermediateOperand(s1.tag);
  7835. END;
  7836. result := s1;
  7837. ELSE (* copy over result to different type, may not use convert *)
  7838. itype := IntermediateCode.GetType(system,type);
  7839. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7840. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7841. Emit(Mov(position,s0.op,s1.op));
  7842. ReleaseOperand(s1);
  7843. InitOperand(result,ModeValue);
  7844. result.op := s0.op;
  7845. ELSE (* different size, must convert *)
  7846. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7847. Convert(s1.op, IntermediateCode.GetType(system,type));
  7848. result := s1;
  7849. END;
  7850. END;
  7851. (* ---- SYSTEM.GET ----- *)
  7852. |Global.systemGet:
  7853. Evaluate(p0,s0); (* adr *)
  7854. Designate(p1,s1); (* variable *)
  7855. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7856. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7857. Emit(Mov(position,s1.op,s0.op));
  7858. ReleaseOperand(s1);
  7859. ReleaseOperand(s0);
  7860. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7861. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7862. Evaluate(p0,s0); (* *)
  7863. Evaluate(p1,s1); (* variable *)
  7864. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7865. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7866. (* real part *)
  7867. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7868. Emit(Mov(position,res, s1.op));
  7869. ReleaseIntermediateOperand(res);
  7870. (* imaginary part *)
  7871. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7872. Emit(Mov(position,res, s1.tag));
  7873. ReleaseIntermediateOperand(res);
  7874. ReleaseOperand(s1);
  7875. ReleaseOperand(s0);
  7876. ELSE
  7877. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7878. ReleaseOperand(s0);
  7879. Emit(Mov(position,res,s1.op));
  7880. ReleaseIntermediateOperand(res);
  7881. ReleaseOperand(s1);
  7882. END;
  7883. (* ---- SYSTEM.MOVE ----- *)
  7884. |Global.systemMove:
  7885. Evaluate(p0,s0);
  7886. Evaluate(p1,s1);
  7887. Evaluate(p2,s2);
  7888. Emit(Copy(position,s1.op,s0.op,s2.op));
  7889. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7890. (* ---- SYSTEM.NEW ----- *)
  7891. |Global.systemNew:
  7892. Designate(p0,s0);
  7893. Emit(Push(position,s0.op));
  7894. ReleaseOperand(s0);
  7895. Evaluate(p1,s1);
  7896. Emit(Push(position,s1.op));
  7897. ReleaseOperand(s1);
  7898. (* push realtime flag: false by default *)
  7899. Emit(Push(position,false));
  7900. CallThis(position,"Heaps","NewSys",3);
  7901. (* ---- SYSTEM.CALL ----- *)
  7902. |Global.systemRef:
  7903. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7904. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7905. s0.mode := ModeValue;
  7906. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7907. result := s0
  7908. (* ---- INCR ----- *)
  7909. |Global.Incr:
  7910. Designate(p0,operand);
  7911. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7912. Dereference(operand,p0.type.resolved,FALSE);
  7913. END;
  7914. ASSERT(p1 # NIL);
  7915. Evaluate(p1,l);
  7916. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7917. ReleaseOperand(operand); ReleaseOperand(l);
  7918. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7919. (* ---- SUM ----- *)
  7920. |Global.Sum: HALT(200);
  7921. (* ---- ALL ----- *)
  7922. |Global.All: HALT(200);
  7923. (* ---- CAS ----- *)
  7924. |Global.Cas:
  7925. needsTrace := p0.NeedsTrace();
  7926. IF needsTrace THEN ModifyAssignments(true) END;
  7927. Designate(p0,s0);
  7928. Evaluate(p1,s1);
  7929. Evaluate(p2,s2);
  7930. IF needsTrace THEN
  7931. Emit(Push(position, s0.op));
  7932. Emit(Push(position, s1.op));
  7933. Emit(Push(position, s2.op));
  7934. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7935. ELSE
  7936. Emit(Cas(position,s0.op,s1.op,s2.op));
  7937. END;
  7938. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7939. IF needsTrace THEN ModifyAssignments(false) END;
  7940. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7941. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7942. IF conditional THEN
  7943. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7944. BrL(falseLabel);
  7945. ReleaseIntermediateOperand(res);
  7946. END;
  7947. (* ---- DIM ----- *)
  7948. |Global.Dim:
  7949. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7950. Designate(p0,s0);
  7951. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7952. Dereference(s0,p0.type.resolved,FALSE);
  7953. END;
  7954. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7955. ReleaseOperand(s0);
  7956. (* ---- RESHAPE ----- *)
  7957. |Global.Reshape:
  7958. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7959. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7960. left.SetType(procedure.type);
  7961. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7962. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7963. END;
  7964. (* ---- SYSTEM.TYPECODE ----- *)
  7965. |Global.systemTypeCode:
  7966. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7967. IF type.resolved IS SyntaxTree.PointerType THEN
  7968. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7969. END;
  7970. result.op := TypeDescriptorAdr(type);
  7971. IF ~newObjectFile THEN
  7972. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7973. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7974. END;
  7975. result.mode := ModeValue;
  7976. (* ---- SYSTEM.TRACE ----- *)
  7977. |Global.systemTrace:
  7978. SystemTrace(x.parameters, x.position);
  7979. (* ----- CONNECT ------*)
  7980. |Global.Connect:
  7981. IF backend.cellsAreObjects THEN
  7982. PushPort(p0);
  7983. PushPort(p1);
  7984. IF p2 # NIL THEN
  7985. Evaluate(p2, s2);
  7986. Emit(Push(p2.position, s2.op));
  7987. ReleaseOperand(s2);
  7988. ELSE
  7989. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7990. END;
  7991. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7992. ELSE
  7993. Warning(x.position, "cannot run on final hardware");
  7994. END;
  7995. (* ----- DELEGATE ------*)
  7996. |Global.Delegate:
  7997. IF backend.cellsAreObjects THEN
  7998. PushPort(p0);
  7999. PushPort(p1);
  8000. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8001. ELSE
  8002. Warning(x.position, "cannot run on final hardware");
  8003. END;
  8004. (* ----- SEND ------*)
  8005. |Global.Send:
  8006. Evaluate(p0,s0);
  8007. Evaluate(p1,s1);
  8008. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8009. Emit(Push(position,s0.op));
  8010. Emit(Push(position,s1.op));
  8011. (*
  8012. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8013. *)
  8014. IF ~backend.cellsAreObjects THEN
  8015. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8016. END;
  8017. ReleaseOperand(s0);
  8018. ReleaseOperand(s1);
  8019. IF backend.cellsAreObjects THEN
  8020. CallThis(position,"ActiveCellsRuntime","Send",2);
  8021. ELSE
  8022. CallThis(position,ChannelModuleName,"Send",2);
  8023. END;
  8024. (* ----- RECEIVE ------*)
  8025. |Global.Receive:
  8026. Evaluate(p0,s0);
  8027. Emit(Push(position,s0.op));
  8028. Designate(p1,s1);
  8029. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8030. Emit(Push(position,s1.op));
  8031. IF p2 # NIL THEN
  8032. Designate(p2,s2);
  8033. Emit(Push(position,s2.op));
  8034. END;
  8035. (*
  8036. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8037. *)
  8038. IF ~backend.cellsAreObjects THEN
  8039. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8040. END;
  8041. ReleaseOperand(s0);
  8042. ReleaseOperand(s1);
  8043. ReleaseOperand(s2);
  8044. IF backend.cellsAreObjects THEN
  8045. IF p2 = NIL THEN
  8046. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8047. ELSE
  8048. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8049. END;
  8050. ELSE
  8051. IF p2 = NIL THEN
  8052. CallThis(position,ChannelModuleName,"Receive",2)
  8053. ELSE
  8054. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8055. END;
  8056. END;
  8057. | Global.systemSpecial:
  8058. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8059. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8060. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8061. (* determine if parameters are of the VAR kind *)
  8062. ASSERT(x.parameters.Length() <= 3);
  8063. formalParameter := procedureType.firstParameter;
  8064. FOR i := 0 TO x.parameters.Length() - 1 DO
  8065. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8066. formalParameter := formalParameter.nextParameter
  8067. END;
  8068. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8069. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8070. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8071. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8072. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8073. IF procedureType.returnType # NIL THEN
  8074. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8075. Emit(Result(position, res));
  8076. (*InitOperand(result,ModeValue);
  8077. result.op := res;
  8078. *)
  8079. IF ~conditional THEN
  8080. InitOperand(result,ModeValue); result.op := res;
  8081. ELSE
  8082. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8083. BrL(falseLabel);
  8084. ReleaseIntermediateOperand(res);
  8085. END;
  8086. END
  8087. ELSE (* function not yet implemented *)
  8088. Error(position,"not yet implemented");
  8089. END;
  8090. destination := dest;
  8091. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8092. END VisitBuiltinCallDesignator;
  8093. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8094. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8095. BEGIN
  8096. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8097. dest := destination; destination := emptyOperand;
  8098. Expression(x.left);
  8099. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8100. ELSIF isUnchecked THEN (* no check *)
  8101. ELSE
  8102. trueL := NewLabel();
  8103. falseL := NewLabel();
  8104. IF IsPointerToRecord(x.left.type,recordType) THEN
  8105. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8106. Emit(Mov(position,tag, result.op));
  8107. IF result.mode # ModeValue THEN
  8108. ptr := tag;
  8109. IntermediateCode.MakeMemory(ptr,addressType);
  8110. Emit(Mov(position,tag, ptr));
  8111. END;
  8112. IF ~backend.cooperative THEN
  8113. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8114. END;
  8115. IntermediateCode.MakeMemory(tag,addressType);
  8116. ELSE
  8117. tag := result.tag;
  8118. END;
  8119. TypeTest(tag,x.type,trueL,falseL);
  8120. ReleaseIntermediateOperand(tag);
  8121. SetLabel(falseL);
  8122. EmitTrap(position,TypeCheckTrap);
  8123. SetLabel(trueL);
  8124. END;
  8125. destination := dest;
  8126. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8127. END VisitTypeGuardDesignator;
  8128. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8129. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8130. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8131. VAR label: Label; pc: LONGINT;
  8132. BEGIN
  8133. IF backend.cooperative & ~isUnchecked THEN
  8134. pc := section.pc;
  8135. label := NewLabel();
  8136. BrneL(label, operand.op, nil);
  8137. EmitTrap(position, NilPointerTrap);
  8138. SetLabel(label);
  8139. INC(statCoopNilCheck, section.pc - pc);
  8140. END;
  8141. END NilCheck;
  8142. BEGIN
  8143. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8144. ReuseCopy(dereferenced,operand.op);
  8145. ReleaseOperand(operand);
  8146. operand.mode := ModeReference;
  8147. operand.op := dereferenced;
  8148. operand.tag := dereferenced;
  8149. UseIntermediateOperand(operand.tag);
  8150. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8151. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8152. ReleaseIntermediateOperand(operand.tag);
  8153. operand.tag := TypeDescriptorAdr(type);
  8154. IF ~newObjectFile THEN
  8155. IntermediateCode.MakeMemory(operand.tag,addressType);
  8156. END;
  8157. ELSE
  8158. IF ~backend.cooperative THEN
  8159. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8160. END;
  8161. IntermediateCode.MakeMemory(operand.tag,addressType);
  8162. END;
  8163. NilCheck(operand.op);
  8164. ELSIF type IS SyntaxTree.ArrayType THEN
  8165. IF isUnsafe THEN
  8166. NilCheck(operand.op);
  8167. ReleaseIntermediateOperand(operand.tag);
  8168. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8169. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8170. ELSE
  8171. operand.tag := emptyOperand;
  8172. END;
  8173. ELSE
  8174. NilCheck(operand.op);
  8175. IF backend.cooperative THEN
  8176. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8177. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8178. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8179. ELSE
  8180. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8181. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8182. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8183. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8184. END;
  8185. END;
  8186. ELSIF type IS SyntaxTree.MathArrayType THEN
  8187. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8188. IntermediateCode.MakeMemory(operand.op,addressType);
  8189. ELSE HALT(100);
  8190. END;
  8191. END Dereference;
  8192. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8193. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8194. BEGIN
  8195. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8196. dest := destination; destination := emptyOperand;
  8197. Evaluate(x.left,d);
  8198. type := x.type.resolved;
  8199. prevIsUnchecked := isUnchecked;
  8200. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8201. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8202. END;
  8203. Dereference(d,type,IsUnsafePointer(x.left.type));
  8204. isUnchecked := prevIsUnchecked;
  8205. result := d;
  8206. 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
  8207. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8208. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8209. END;
  8210. END;
  8211. destination := dest;
  8212. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8213. END VisitDereferenceDesignator;
  8214. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8215. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8216. BEGIN
  8217. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8218. dest := destination; destination := emptyOperand;
  8219. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8220. tag := result.op;
  8221. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8222. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8223. StaticCallOperand(result,procedure.super);
  8224. ReleaseIntermediateOperand(result.tag);
  8225. UseIntermediateOperand(tag); (* necessary ? *)
  8226. result.tag := tag;
  8227. destination := dest;
  8228. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8229. END VisitSupercallDesignator;
  8230. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8231. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8232. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8233. name: Basic.SegmentedName;
  8234. BEGIN
  8235. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8236. dest := destination; destination := emptyOperand;
  8237. scope := currentScope;
  8238. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8239. scope := scope.outerScope;
  8240. END;
  8241. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8242. IF newObjectFile THEN
  8243. moduleSection := meta.ModuleSection();
  8244. IF backend.cooperative THEN
  8245. moduleOffset := 0;
  8246. ELSE
  8247. moduleOffset := moduleSection.pc;
  8248. END;
  8249. result.mode := ModeValue;
  8250. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8251. ELSE
  8252. Symbol(moduleSelf,result);
  8253. IntermediateCode.MakeMemory(result.op,addressType);
  8254. END
  8255. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8256. result.mode := ModeValue;
  8257. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8258. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8259. ELSE
  8260. GetBaseRegister(basereg,currentScope,scope);
  8261. InitOperand(result,ModeReference);
  8262. result.op := basereg;
  8263. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  8264. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  8265. IF backend.cooperative THEN
  8266. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8267. END;
  8268. (* tag must be loaded when dereferencing SELF pointer *)
  8269. END;
  8270. destination := dest;
  8271. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8272. END VisitSelfDesignator;
  8273. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8274. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8275. BEGIN
  8276. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8277. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8278. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8279. parameter := procedureType.returnParameter;
  8280. VisitParameter(parameter);
  8281. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8282. END VisitResultDesignator;
  8283. (** values *)
  8284. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8285. BEGIN
  8286. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8287. IF conditional THEN
  8288. IF x.value THEN BrL(trueLabel)
  8289. ELSE BrL(falseLabel)
  8290. END;
  8291. ELSE
  8292. InitOperand(result,ModeValue);
  8293. IF x.value THEN result.op := true ELSE result.op := false END;
  8294. END;
  8295. END VisitBooleanValue;
  8296. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8297. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8298. BEGIN
  8299. Global.GetModuleSegmentedName(module.module, name);
  8300. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8301. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8302. RETURN section
  8303. END GetDataSection;
  8304. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8305. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8306. BEGIN
  8307. type := vop.type;
  8308. data := GetDataSection();
  8309. pc := EnterImmediate(data,vop);
  8310. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8311. IntermediateCode.MakeMemory(vop, type);
  8312. END GetImmediateMem;
  8313. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8314. BEGIN
  8315. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8316. InitOperand(result,ModeValue);
  8317. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8318. IF ~supportedImmediate(result.op) &~inData THEN
  8319. GetImmediateMem(result.op)
  8320. END;
  8321. END VisitIntegerValue;
  8322. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8323. BEGIN
  8324. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8325. InitOperand(result,ModeValue);
  8326. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8327. END VisitCharacterValue;
  8328. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8329. BEGIN
  8330. IF Trace THEN TraceEnter("VisitSetValue") END;
  8331. InitOperand(result,ModeValue);
  8332. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8333. END VisitSetValue;
  8334. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8335. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8336. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8337. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8338. BEGIN
  8339. numberElements := x.elements.Length();
  8340. FOR i := 0 TO numberElements-1 DO
  8341. expression := x.elements.GetExpression(i);
  8342. IF expression IS SyntaxTree.MathArrayExpression THEN
  8343. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8344. ELSE
  8345. inData := TRUE;
  8346. Evaluate(expression,op);
  8347. irv.Emit(Data(position,op.op));
  8348. inData := FALSE;
  8349. ReleaseOperand(op);
  8350. END;
  8351. END;
  8352. END RecursiveData;
  8353. BEGIN
  8354. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8355. IF ~TryConstantDeclaration() THEN
  8356. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8357. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8358. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8359. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8360. ELSE
  8361. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8362. END;
  8363. RecursiveData(x.array);
  8364. InitOperand(result,ModeReference);
  8365. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8366. END
  8367. END VisitMathArrayValue;
  8368. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8369. VAR constant: Sections.Section;
  8370. BEGIN
  8371. IF constantDeclaration = NIL THEN
  8372. RETURN FALSE
  8373. ELSE
  8374. (* Is a constant in this module: did we generate it already? *)
  8375. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8376. IF constant # NIL THEN
  8377. InitOperand(result,ModeReference);
  8378. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8379. RETURN TRUE;
  8380. END;
  8381. END;
  8382. RETURN FALSE
  8383. END TryConstantDeclaration;
  8384. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8385. BEGIN
  8386. constantDeclaration := x;
  8387. x.value.resolved.Accept(SELF);
  8388. END VisitConstant;
  8389. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8390. BEGIN
  8391. IF Trace THEN TraceEnter("VisitRealValue") END;
  8392. InitOperand(result,ModeValue);
  8393. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8394. END VisitRealValue;
  8395. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8396. VAR
  8397. componentType: SyntaxTree.Type;
  8398. BEGIN
  8399. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8400. ASSERT(x.type IS SyntaxTree.ComplexType);
  8401. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8402. InitOperand(result,ModeValue);
  8403. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8404. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8405. END VisitComplexValue;
  8406. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8407. VAR i: LONGINT; name: Basic.SegmentedName;
  8408. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8409. BEGIN
  8410. IF Trace THEN TraceEnter("VisitStringValue") END;
  8411. IF ~TryConstantDeclaration() THEN
  8412. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8413. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8414. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8415. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8416. ELSE
  8417. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8418. END;
  8419. FOR i := 0 TO x.length-1 DO
  8420. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8421. irv.Emit(Data(position,op));
  8422. END;
  8423. InitOperand(result,ModeReference);
  8424. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8425. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8426. END
  8427. END VisitStringValue;
  8428. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8429. BEGIN
  8430. IF Trace THEN TraceEnter("VisitNilValue") END;
  8431. InitOperand(result,ModeValue);
  8432. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8433. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8434. END VisitNilValue;
  8435. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8436. BEGIN
  8437. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8438. InitOperand(result,ModeValue);
  8439. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8440. END VisitEnumerationValue;
  8441. (** symbols *)
  8442. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8443. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8444. END VisitImport;
  8445. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8446. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8447. BEGIN
  8448. IF scope # baseScope THEN
  8449. (* left := [fp+8] *)
  8450. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8451. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8452. ReuseCopy(left,right);
  8453. ReleaseIntermediateOperand(right);
  8454. scope := scope.outerScope; DEC(level);
  8455. (* { left := [left+8] } *)
  8456. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8457. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8458. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8459. Emit(Mov(position,left,right));
  8460. scope := scope.outerScope; DEC(level);
  8461. END;
  8462. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8463. result := left;
  8464. ELSE
  8465. result := fp;
  8466. END;
  8467. END GetBaseRegister;
  8468. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8469. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8470. BEGIN
  8471. IF Trace THEN TraceEnter("VisitVariable"); END;
  8472. type := x.type.resolved;
  8473. IF (x.useRegister) THEN
  8474. InitOperand(result, ModeValue);
  8475. IF x.registerNumber < 0 THEN
  8476. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8477. reg := x.registerNumber;
  8478. ELSE
  8479. reg := registerUsageCount.Map(x.registerNumber);
  8480. UseRegister(reg);
  8481. END;
  8482. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8483. ELSIF x.externalName # NIL THEN
  8484. InitOperand(result,ModeReference);
  8485. Basic.ToSegmentedName(x.externalName^, name);
  8486. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8487. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8488. InitOperand(result,ModeReference);
  8489. GetBaseRegister(result.op,currentScope,x.scope);
  8490. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8491. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8492. InitOperand(result,ModeReference);
  8493. GetCodeSectionNameForSymbol(x,name);
  8494. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8495. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8496. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8497. InitOperand(result,ModeReference);
  8498. GetCodeSectionNameForSymbol(x,name);
  8499. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8500. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8501. ELSE (* field, left designator must have been emitted *)
  8502. ASSERT(result.mode = ModeReference);
  8503. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8504. ReuseCopy(temp,result.op);
  8505. ReleaseIntermediateOperand(result.op);
  8506. result.op := temp;
  8507. END;
  8508. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8509. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8510. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8511. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8512. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8513. END;
  8514. END;
  8515. END;
  8516. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8517. ValueToCondition(result);
  8518. ELSIF type IS SyntaxTree.ProcedureType THEN
  8519. ReleaseIntermediateOperand(result.tag);
  8520. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8521. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8522. UseIntermediateOperand(result.tag);
  8523. ELSE
  8524. result.tag := nil; (* nil *)
  8525. END;
  8526. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8527. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8528. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8529. ReleaseIntermediateOperand(result.tag);
  8530. Global.GetSymbolSegmentedName(x,name);
  8531. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8532. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8533. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8534. ELSE
  8535. END;
  8536. ELSE
  8537. ReleaseIntermediateOperand(result.tag);
  8538. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8539. END;
  8540. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8541. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8542. ReleaseIntermediateOperand(result.tag);
  8543. result.tag := result.op;
  8544. UseIntermediateOperand(result.tag);
  8545. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8546. IntermediateCode.MakeMemory(result.op,addressType);
  8547. END;
  8548. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8549. ReleaseIntermediateOperand(result.tag);
  8550. result.tag := TypeDescriptorAdr(type);
  8551. IF ~newObjectFile THEN
  8552. IntermediateCode.MakeMemory(result.tag,addressType);
  8553. END;
  8554. UseIntermediateOperand(result.tag);
  8555. (* tag for pointer type computed not here but during dereferencing *)
  8556. END;
  8557. IF Trace THEN TraceExit("VisitVariable") END;
  8558. END VisitVariable;
  8559. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8560. BEGIN
  8561. VisitVariable(property);
  8562. END VisitProperty;
  8563. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8564. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8565. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8566. BEGIN
  8567. type := x.type.resolved;
  8568. IF Trace THEN TraceEnter("VisitParameter") END;
  8569. IF x.ownerType IS SyntaxTree.CellType THEN
  8570. ptype := x.type.resolved;
  8571. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8572. IF ~(ptype IS SyntaxTree.PortType) THEN
  8573. InitOperand(result,ModeReference);
  8574. GetCodeSectionNameForSymbol(x,name);
  8575. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8576. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8577. RETURN
  8578. ELSE
  8579. InitOperand(result, ModeValue);
  8580. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8581. adr := 0;
  8582. WHILE parameter # x DO
  8583. parameterType := parameter.type;
  8584. inc := 1;
  8585. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8586. INC(adr, inc);
  8587. parameter := parameter.nextParameter
  8588. END;
  8589. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8590. RETURN
  8591. END;
  8592. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8593. InitOperand(result,ModeReference);
  8594. GetCodeSectionNameForSymbol(x,name);
  8595. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8596. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8597. RETURN
  8598. ELSE
  8599. GetBaseRegister(basereg,currentScope,x.scope);
  8600. InitOperand(result,ModeReference);
  8601. result.op := basereg;
  8602. END;
  8603. IF IsOpenArray(type) THEN
  8604. result.tag := basereg;
  8605. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8606. IntermediateCode.MakeMemory(result.op,addressType);
  8607. IF Global.IsOberonProcedure(x.ownerType) THEN
  8608. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8609. UseIntermediateOperand(result.tag);
  8610. ELSE
  8611. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8612. END;
  8613. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8614. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8615. ELSIF IsStaticArray(type) THEN
  8616. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8617. IntermediateCode.MakeMemory(result.op,addressType);
  8618. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8619. ELSIF type IS SyntaxTree.MathArrayType THEN
  8620. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8621. WITH type: SyntaxTree.MathArrayType DO
  8622. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8623. IF type.form = SyntaxTree.Tensor THEN
  8624. ELSIF type.form = SyntaxTree.Open THEN
  8625. result.tag := result.op;
  8626. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8627. IntermediateCode.MakeMemory(result.op,addressType);
  8628. UseIntermediateOperand(result.tag);
  8629. ELSIF type.form = SyntaxTree.Static THEN
  8630. IF x.kind = SyntaxTree.ConstParameter THEN
  8631. IntermediateCode.MakeMemory(result.op,addressType);
  8632. END;
  8633. ELSE HALT(100)
  8634. END;
  8635. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8636. IF type.form = SyntaxTree.Tensor THEN
  8637. ToMemory(result.op,addressType,0);
  8638. ELSIF type.form = SyntaxTree.Open THEN
  8639. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8640. ReuseCopy(result.tag, mem);
  8641. ReleaseIntermediateOperand(mem);
  8642. ReleaseIntermediateOperand(result.op);
  8643. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8644. ELSIF type.form = SyntaxTree.Static THEN
  8645. IntermediateCode.MakeMemory(result.op,addressType);
  8646. ELSE HALT(100)
  8647. END;
  8648. ELSE HALT(100)
  8649. END;
  8650. END;
  8651. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8652. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8653. IntermediateCode.MakeMemory(result.op,addressType);
  8654. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8655. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8656. END;
  8657. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8658. ValueToCondition(result);
  8659. ELSIF type IS SyntaxTree.ProcedureType THEN
  8660. ReleaseIntermediateOperand(result.tag);
  8661. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8662. IF x.kind = SyntaxTree.VarParameter THEN
  8663. ReuseCopy(result.tag,result.op);
  8664. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8665. IntermediateCode.MakeMemory(result.tag,addressType);
  8666. ELSE
  8667. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8668. UseIntermediateOperand(result.tag);
  8669. END;
  8670. ELSE
  8671. result.tag := nil;
  8672. END;
  8673. (* tag for pointer type computed not here but during dereferencing *)
  8674. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8675. ReleaseIntermediateOperand(result.tag);
  8676. result.tag := basereg;
  8677. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8678. IntermediateCode.MakeMemory(result.tag,addressType);
  8679. UseIntermediateOperand(result.tag);
  8680. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8681. ReleaseIntermediateOperand(result.tag);
  8682. result.tag := TypeDescriptorAdr(type);
  8683. IF ~newObjectFile THEN
  8684. IntermediateCode.MakeMemory(result.tag,addressType);
  8685. END;
  8686. UseIntermediateOperand(result.tag);
  8687. END;
  8688. IF Trace THEN TraceExit("VisitParameter") END;
  8689. END VisitParameter;
  8690. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8691. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8692. BEGIN
  8693. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8694. (* left.p: left already emitted *)
  8695. tag := result.op; (* value of pointer to left *)
  8696. (* get type desc *)
  8697. tmp := result.tag;
  8698. IntermediateCode.MakeMemory(tmp,addressType);
  8699. (* get method adr *)
  8700. Reuse1(reg,tmp);
  8701. ReleaseIntermediateOperand(tmp);
  8702. IF backend.cooperative THEN
  8703. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8704. WHILE recordType.baseType # NIL DO
  8705. recordType := recordType.GetBaseRecord ();
  8706. END;
  8707. GetRecordTypeName (recordType,name);
  8708. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8709. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8710. offset := 0;
  8711. ELSE
  8712. offset := 2;
  8713. END;
  8714. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8715. ELSE
  8716. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8717. END;
  8718. InitOperand(operand,ModeReference);
  8719. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8720. operand.op := reg;
  8721. operand.tag := tag;
  8722. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8723. END DynamicCallOperand;
  8724. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8725. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8726. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8727. BEGIN
  8728. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8729. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8730. tag := operand.op;
  8731. ReleaseIntermediateOperand(operand.tag);
  8732. ELSE tag := nil
  8733. END;
  8734. IF x.isInline THEN
  8735. sectionType := Sections.InlineCodeSection;
  8736. ELSE
  8737. sectionType := Sections.CodeSection;
  8738. END;
  8739. IF x.externalName # NIL THEN
  8740. Basic.ToSegmentedName(x.externalName^, name);
  8741. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8742. ELSE
  8743. GetCodeSectionNameForSymbol(x, name);
  8744. IF (x.scope.ownerModule = module.module) THEN
  8745. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8746. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8747. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8748. IF source.pc = 0 THEN (* no code yet *)
  8749. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8750. END;
  8751. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8752. bits := x.procedureScope.body.code.inlineCode;
  8753. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8754. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8755. binary.CopyBits(bits, 0, bits.GetSize());
  8756. source.SetResolved(binary);
  8757. ELSE
  8758. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8759. END;
  8760. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8761. END;
  8762. InitOperand(operand,ModeValue);
  8763. operand.op := reg;
  8764. operand.tag := tag;
  8765. IF Trace THEN TraceExit("StaticCallOperand") END;
  8766. END StaticCallOperand;
  8767. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8768. (* handle expressions of the form designator.procedure or procedure *)
  8769. BEGIN
  8770. IF Trace THEN TraceEnter("VisitProcedure") END;
  8771. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8772. DynamicCallOperand(result,x);
  8773. ELSIF x.isInline THEN
  8774. StaticCallOperand(result,x);
  8775. ELSE
  8776. StaticCallOperand(result,x);
  8777. END;
  8778. IF Trace THEN TraceExit("VisitProcedure") END;
  8779. END VisitProcedure;
  8780. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8781. BEGIN
  8782. VisitProcedure(x);
  8783. END VisitOperator;
  8784. (** statements *)
  8785. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8786. BEGIN
  8787. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8788. Expression(x.call);
  8789. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8790. ReleaseOperand(result)
  8791. END;
  8792. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8793. END VisitProcedureCallStatement;
  8794. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8795. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8796. leftBase, rightBase: SyntaxTree.Type;
  8797. procedureName,s: SyntaxTree.IdentifierString;
  8798. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8799. size: LONGINT; rightKind: LONGINT;
  8800. dummy: IntermediateCode.Operand;
  8801. CONST moduleName = "FoxArrayBase";
  8802. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8803. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8804. BEGIN
  8805. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8806. IF base IS SyntaxTree.MathArrayType THEN
  8807. base := OpenArray(base(SyntaxTree.MathArrayType));
  8808. END;
  8809. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8810. result.SetArrayBase(base);
  8811. RETURN result
  8812. END OpenArray;
  8813. BEGIN
  8814. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8815. SaveRegisters();ReleaseUsedRegisters(saved);
  8816. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8817. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8818. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8819. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8820. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8821. IF leftType.form = SyntaxTree.Tensor THEN
  8822. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8823. ELSIF leftType.form = SyntaxTree.Open THEN
  8824. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8825. ELSIF leftType.form = SyntaxTree.Static THEN
  8826. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8827. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8828. END;
  8829. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8830. IF procedure = NIL THEN
  8831. s := "Instruction not supported on target, emulation procedure ";
  8832. Strings.Append(s,moduleName);
  8833. Strings.Append(s,".");
  8834. Strings.Append(s,procedureName);
  8835. Strings.Append(s," not present");
  8836. Error(position,s);
  8837. ELSE
  8838. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8839. parameter.SetType(leftType);
  8840. parameter.SetAccess(SyntaxTree.Internal);
  8841. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8842. parameter.SetKind(rightKind);
  8843. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8844. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8845. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8846. StaticCallOperand(result,procedure);
  8847. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8848. ReleaseOperand(result);
  8849. END;
  8850. RestoreRegisters(saved);
  8851. END;
  8852. END AssignMathArray;
  8853. VAR modifyAssignmentCounter := 0: LONGINT;
  8854. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8855. VAR processor,mem,dst: IntermediateCode.Operand;
  8856. BEGIN
  8857. IF value.intValue = true.intValue THEN
  8858. INC(modifyAssignmentCounter);
  8859. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8860. modifyAssignmentsPC := section.pc;
  8861. ELSE
  8862. DEC(modifyAssignmentCounter);
  8863. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8864. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8865. END;
  8866. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8867. dst := NewRegisterOperand (addressType);
  8868. Emit(Mov(position,dst, processor));
  8869. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8870. Emit(Mov(position,mem, value));
  8871. ReleaseIntermediateOperand(dst);
  8872. END ModifyAssignments;
  8873. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8874. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8875. BEGIN
  8876. type := left.type.resolved;
  8877. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8878. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8879. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8880. IF procedureType.returnParameter = parameter THEN
  8881. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8882. END;
  8883. END;
  8884. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8885. END CopySize;
  8886. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8887. VAR
  8888. leftO, rightO: Operand;
  8889. mem, sizeOp: IntermediateCode.Operand;
  8890. leftType, rightType, componentType: SyntaxTree.Type;
  8891. size: LONGINT;
  8892. parameters: SyntaxTree.ExpressionList;
  8893. procedure: SyntaxTree.Procedure;
  8894. call: SyntaxTree.ProcedureCallDesignator;
  8895. designator: SyntaxTree.Designator;
  8896. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8897. VAR procedureType: SyntaxTree.ProcedureType;
  8898. BEGIN
  8899. IF ReturnedAsParameter(right.type) THEN
  8900. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8901. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8902. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8903. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8904. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8905. IF right.id = Global.Reshape THEN RETURN TRUE
  8906. END;
  8907. END;
  8908. END;
  8909. END;
  8910. RETURN FALSE
  8911. END CanPassAsResultParameter;
  8912. BEGIN
  8913. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8914. leftType := left.type.resolved; rightType:= right.type.resolved;
  8915. IF backend.cooperative & left.NeedsTrace() THEN
  8916. ModifyAssignments(true);
  8917. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8918. Designate(right, rightO);
  8919. Designate(left, leftO);
  8920. ASSERT(leftO.mode = ModeReference);
  8921. TransferToRegister(leftO.op, leftO.op);
  8922. TransferToRegister(rightO.op, rightO.op);
  8923. Emit(Push(position, leftO.op));
  8924. Emit(Push(position, rightO.op));
  8925. CallAssignMethod(leftO.op, rightO.op, left.type);
  8926. Emit(Pop(position, rightO.op));
  8927. Emit(Pop(position, leftO.op));
  8928. sizeOp := CopySize(left);
  8929. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8930. ReleaseOperand(leftO);
  8931. ReleaseOperand(rightO);
  8932. ELSE
  8933. Evaluate(right,rightO);
  8934. Designate(left,leftO);
  8935. ASSERT(leftO.mode = ModeReference);
  8936. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8937. (* copy procedure address first *)
  8938. MakeMemory(mem,leftO.op,addressType,0);
  8939. Emit(Mov(position,mem,rightO.op));
  8940. ReleaseIntermediateOperand(mem);
  8941. (* copy pointer address *)
  8942. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8943. CallAssignPointer(leftO.tag, rightO.tag);
  8944. ELSE
  8945. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8946. CallAssignPointer(leftO.op, rightO.op);
  8947. END;
  8948. ReleaseOperand(leftO);
  8949. ReleaseOperand(rightO);
  8950. END;
  8951. ModifyAssignments(false);
  8952. RETURN;
  8953. END;
  8954. IF CanPassAsResultParameter(right) THEN
  8955. procedureResultDesignator := left(SyntaxTree.Designator);
  8956. Expression(right);
  8957. procedureResultDesignator := NIL;
  8958. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8959. (* left <-- ALIAS OF right: zerocopy *)
  8960. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8961. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8962. designator.SetType(procedure.type);
  8963. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8964. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8965. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8966. END;
  8967. ELSIF leftType IS SyntaxTree.RangeType THEN
  8968. (* LHS is of array range type *)
  8969. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8970. Evaluate(right, rightO);
  8971. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8972. (* first *)
  8973. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8974. Emit(Mov(position,mem, rightO.op));
  8975. ReleaseIntermediateOperand(mem);
  8976. (* last *)
  8977. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8978. Emit(Mov(position,mem, rightO.tag));
  8979. ReleaseIntermediateOperand(mem);
  8980. (* step *)
  8981. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8982. Emit(Mov(position,mem, rightO.extra));
  8983. ReleaseIntermediateOperand(mem);
  8984. ReleaseOperand(rightO);
  8985. ReleaseOperand(leftO)
  8986. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8987. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8988. Evaluate(right, rightO);
  8989. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8990. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8991. (* real part *)
  8992. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8993. Emit(Mov(position,mem, rightO.op));
  8994. ReleaseIntermediateOperand(mem);
  8995. (* imaginary part *)
  8996. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8997. Emit(Mov(position,mem, rightO.tag));
  8998. ReleaseIntermediateOperand(mem);
  8999. ReleaseOperand(rightO);
  9000. ReleaseOperand(leftO)
  9001. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9002. OR (leftType IS SyntaxTree.PortType) THEN
  9003. (* rightO := leftO;*)
  9004. Evaluate(right,rightO);
  9005. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9006. Designate(left,leftO);
  9007. IF leftO.mode = ModeReference THEN
  9008. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9009. destination := mem;
  9010. ELSE
  9011. destination := leftO.op;
  9012. END;
  9013. ReleaseOperand(leftO);
  9014. IF destination.mode # IntermediateCode.Undefined THEN
  9015. Emit(Mov(position,destination,rightO.op));
  9016. END;
  9017. ReleaseOperand(rightO);
  9018. ReleaseIntermediateOperand(mem);
  9019. IntermediateCode.InitOperand(destination);
  9020. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9021. Evaluate(right,rightO);
  9022. Designate(left,leftO);
  9023. MakeMemory(mem,leftO.op,addressType,0);
  9024. Emit(Mov(position,mem,rightO.op));
  9025. ReleaseIntermediateOperand(mem);
  9026. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9027. (* delegate *)
  9028. (*
  9029. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9030. *)
  9031. Emit(Mov(position,leftO.tag,rightO.tag));
  9032. END;
  9033. ReleaseOperand(leftO);
  9034. ReleaseOperand(rightO);
  9035. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9036. Designate(right,rightO);
  9037. Designate(left,leftO);
  9038. sizeOp := CopySize(left);
  9039. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9040. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9041. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9042. IF (rightType IS SyntaxTree.StringType) THEN
  9043. CopyString(left,right);
  9044. 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
  9045. Designate(right,rightO);
  9046. Designate(left,leftO);
  9047. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9048. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9049. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9050. ELSE
  9051. HALT(201)
  9052. END;
  9053. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9054. AssignMathArray(left,right);
  9055. ELSE
  9056. HALT(200);
  9057. END;
  9058. END Assign;
  9059. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9060. BEGIN
  9061. IF Trace THEN TraceEnter("VisitAssignment") END;
  9062. Assign(x.left,x.right);
  9063. IF Trace THEN TraceExit("VisitAssignment") END;
  9064. END VisitAssignment;
  9065. PROCEDURE EmitCooperativeSwitch;
  9066. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9067. BEGIN
  9068. ASSERT (cooperativeSwitches);
  9069. pc := section.pc;
  9070. IF lastSwitchPC = section.pc THEN RETURN END;
  9071. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9072. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9073. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9074. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9075. INC(statCoopSwitch, section.pc - pc);
  9076. END EmitCooperativeSwitch;
  9077. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9078. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9079. BEGIN
  9080. p0 := communication.left; p1 := communication.right;
  9081. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9082. Evaluate(p0,s0);
  9083. Evaluate(p1,s1);
  9084. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9085. Emit(Push(position,s0.op));
  9086. Emit(Push(position,s1.op));
  9087. (*
  9088. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9089. *)
  9090. IF ~backend.cellsAreObjects THEN
  9091. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9092. END;
  9093. ReleaseOperand(s0);
  9094. ReleaseOperand(s1);
  9095. IF backend.cellsAreObjects THEN
  9096. CallThis(position,"ActiveCellsRuntime","Send",2);
  9097. ELSE
  9098. CallThis(position,ChannelModuleName,"Send",2);
  9099. END;
  9100. (* ----- RECEIVE ------*)
  9101. ELSE
  9102. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9103. tmp := p0; p0 := p1; p1 := tmp;
  9104. END;
  9105. Evaluate(p0,s0);
  9106. Emit(Push(position,s0.op));
  9107. Designate(p1,s1);
  9108. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9109. Emit(Push(position,s1.op));
  9110. (*
  9111. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9112. *)
  9113. IF ~backend.cellsAreObjects THEN
  9114. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9115. END;
  9116. ReleaseOperand(s0);
  9117. ReleaseOperand(s1);
  9118. IF backend.cellsAreObjects THEN
  9119. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9120. ELSE
  9121. CallThis(position,ChannelModuleName,"Receive",2)
  9122. END;
  9123. END;
  9124. END VisitCommunicationStatement;
  9125. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9126. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9127. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9128. VAR true, false: Label; condition, value: BOOLEAN;
  9129. BEGIN
  9130. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9131. IF condition THEN
  9132. true := NewLabel();
  9133. false := NewLabel();
  9134. Condition(if.condition,true,false);
  9135. SetLabel(true);
  9136. StatementSequence(if.statements);
  9137. BrL(end);
  9138. SetLabel(false);
  9139. ELSE
  9140. IF value THEN (* always true *)
  9141. escape := TRUE;
  9142. StatementSequence(if.statements);
  9143. (* no branch necessary -- rest skipped *)
  9144. END;
  9145. END;
  9146. END IfPart;
  9147. BEGIN
  9148. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9149. end := NewLabel();
  9150. elsifs := x.ElsifParts();
  9151. IfPart(x.ifPart);
  9152. FOR i := 0 TO elsifs-1 DO
  9153. IF ~escape THEN
  9154. elsif := x.GetElsifPart(i);
  9155. IfPart(elsif);
  9156. END;
  9157. END;
  9158. IF (x.elsePart # NIL) & ~escape THEN
  9159. StatementSequence(x.elsePart);
  9160. END;
  9161. SetLabel(end);
  9162. IF Trace THEN TraceExit("VisitIfStatement") END;
  9163. END VisitIfStatement;
  9164. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9165. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9166. BEGIN
  9167. (*IF x.variable.type.resolved = x.type.resolved THEN
  9168. (* always true, do nothing *)
  9169. ELSE*)
  9170. Designate(x.variable,res);
  9171. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9172. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9173. END;
  9174. trueL := NewLabel();
  9175. TypeTest(res.tag,x.type,trueL,falseL);
  9176. ReleaseOperand(res);
  9177. SetLabel(trueL);
  9178. StatementSequence(x.statements);
  9179. BrL(endL);
  9180. END WithPart;
  9181. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9182. VAR endL,falseL: Label;i: LONGINT;
  9183. BEGIN
  9184. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9185. endL := NewLabel();
  9186. FOR i := 0 TO x.WithParts()-1 DO
  9187. falseL := NewLabel();
  9188. WithPart(x.GetWithPart(i),falseL,endL);
  9189. SetLabel(falseL);
  9190. END;
  9191. IF x.elsePart = NIL THEN
  9192. IF ~isUnchecked THEN
  9193. EmitTrap(position,WithTrap);
  9194. END;
  9195. ELSE
  9196. StatementSequence(x.elsePart)
  9197. END;
  9198. SetLabel(endL);
  9199. IF Trace THEN TraceExit("VisitWithStatement") END;
  9200. END VisitWithStatement;
  9201. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9202. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9203. out,else: Label; label: Label;
  9204. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9205. symbol: SyntaxTree.Symbol;
  9206. BEGIN
  9207. (*! split case statement into if-elsif statements for large case label lists *)
  9208. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9209. size := x.max-x.min+1;
  9210. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9211. END;
  9212. Evaluate(x.variable,var);
  9213. ReuseCopy(tmp,var.op);
  9214. ReleaseIntermediateOperand(var.op);
  9215. var.op := tmp;
  9216. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9217. Convert(var.op,addressType);
  9218. size := x.max-x.min+1;
  9219. else := NewLabel();
  9220. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9221. (*
  9222. UniqueId(name,module.module,"case",caseId);
  9223. *)
  9224. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9225. Global.GetModuleSegmentedName(module.module, name);
  9226. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9227. symbol := SyntaxTree.NewSymbol(name[1]);
  9228. symbol.SetScope(moduleScope);
  9229. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9230. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9231. section.isCaseTable := TRUE;
  9232. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9233. ReuseCopy(res,var.op);
  9234. ReleaseOperand(var);
  9235. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9236. Emit(Add(position,res,res,jmp));
  9237. IntermediateCode.MakeMemory(res,addressType);
  9238. Emit(Br(position,res));
  9239. ReleaseIntermediateOperand(res);
  9240. out := NewLabel();
  9241. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9242. part := x.GetCasePart(i);
  9243. constant := part.firstConstant;
  9244. label := NewLabel();
  9245. SetLabel(label);
  9246. WHILE(constant # NIL) DO (* case labels for this case part *)
  9247. FOR j := constant.min TO constant.max DO
  9248. fixups[j-x.min] := label;
  9249. END;
  9250. constant := constant.next;
  9251. END;
  9252. StatementSequence(part.statements);
  9253. BrL(out);
  9254. END;
  9255. SetLabel(else);
  9256. FOR i := 0 TO size-1 DO
  9257. IF fixups[i] = NIL THEN
  9258. fixups[i] := else;
  9259. END;
  9260. END;
  9261. IF x.elsePart # NIL THEN
  9262. StatementSequence(x.elsePart);
  9263. ELSIF ~isUnchecked THEN
  9264. EmitTrap(position,CaseTrap);
  9265. END;
  9266. SetLabel(out);
  9267. FOR i := 0 TO size-1 DO
  9268. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9269. section.Emit(Data(position,op));
  9270. END;
  9271. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9272. END VisitCaseStatement;
  9273. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9274. VAR start: Label; true,false: Label;
  9275. BEGIN
  9276. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9277. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9278. start := NewLabel();
  9279. true := NewLabel();
  9280. false := NewLabel();
  9281. SetLabel(start);
  9282. Condition(x.condition,true,false);
  9283. SetLabel(true);
  9284. StatementSequence(x.statements);
  9285. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9286. BrL(start);
  9287. SetLabel(false);
  9288. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9289. END VisitWhileStatement;
  9290. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9291. VAR false,true: Label;
  9292. BEGIN
  9293. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9294. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9295. true := NewLabel();
  9296. false := NewLabel();
  9297. SetLabel(false);
  9298. StatementSequence(x.statements);
  9299. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9300. Condition(x.condition,true,false);
  9301. SetLabel(true);
  9302. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9303. END VisitRepeatStatement;
  9304. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9305. VAR
  9306. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9307. temporaryVariable: SyntaxTree.Variable;
  9308. temporaryVariableDesignator : SyntaxTree.Designator;
  9309. BEGIN
  9310. IF Trace THEN TraceEnter("VisitForStatement") END;
  9311. true := NewLabel();
  9312. false := NewLabel();
  9313. start := NewLabel();
  9314. Assign(x.variable,x.from);
  9315. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9316. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9317. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9318. Assign(temporaryVariableDesignator,x.to);
  9319. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9320. IF by > 0 THEN
  9321. cmp := Scanner.LessEqual
  9322. ELSE
  9323. cmp := Scanner.GreaterEqual
  9324. END;
  9325. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9326. binary.SetType(system.booleanType);
  9327. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9328. SetLabel(start);
  9329. Condition(binary,true,false);
  9330. SetLabel(true);
  9331. StatementSequence(x.statements);
  9332. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9333. binary.SetType(x.variable.type);
  9334. Assign(x.variable,binary);
  9335. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9336. BrL(start);
  9337. SetLabel(false);
  9338. IF Trace THEN TraceExit("VisitForStatement") END;
  9339. END VisitForStatement;
  9340. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9341. VAR prevLoop: Label;
  9342. BEGIN
  9343. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9344. prevLoop := currentLoop;
  9345. currentLoop := NewLabel();
  9346. StatementSequence(x.statements);
  9347. SetLabel(currentLoop);
  9348. currentLoop := prevLoop;
  9349. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9350. END VisitExitableBlock;
  9351. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9352. VAR prevLoop,start: Label;
  9353. BEGIN
  9354. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9355. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9356. start := NewLabel();
  9357. prevLoop := currentLoop;
  9358. SetLabel(start);
  9359. currentLoop := NewLabel();
  9360. StatementSequence(x.statements);
  9361. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9362. BrL(start);
  9363. SetLabel(currentLoop);
  9364. currentLoop := prevLoop;
  9365. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9366. END VisitLoopStatement;
  9367. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9368. VAR outer: SyntaxTree.Statement;
  9369. BEGIN
  9370. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9371. IF locked THEN (* r if we jump out of an exclusive block *)
  9372. outer := x.outer;
  9373. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9374. outer := outer.outer;
  9375. END;
  9376. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9377. Lock(FALSE);
  9378. END;
  9379. END;
  9380. BrL(currentLoop);
  9381. IF Trace THEN TraceExit("VisitExitStatement") END;
  9382. END VisitExitStatement;
  9383. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9384. VAR
  9385. expression, parameterDesignator: SyntaxTree.Expression;
  9386. type, componentType: SyntaxTree.Type;
  9387. res, right: Operand;
  9388. left, mem, reg: IntermediateCode.Operand;
  9389. parameter: SyntaxTree.Parameter;
  9390. procedure: SyntaxTree.Procedure;
  9391. procedureType: SyntaxTree.ProcedureType;
  9392. returnTypeOffset: LONGINT;
  9393. delegate: BOOLEAN;
  9394. map: SymbolMap;
  9395. BEGIN
  9396. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9397. expression := x.returnValue;
  9398. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9399. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9400. IF currentIsInline THEN
  9401. IF expression # NIL THEN
  9402. map := currentMapper.Get(NIL);
  9403. IF map # NIL THEN
  9404. Assign(map.to, expression);
  9405. END;
  9406. END;
  9407. BrL(currentInlineExit);
  9408. RETURN;
  9409. END;
  9410. IF expression # NIL THEN
  9411. type := expression.type.resolved;
  9412. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9413. IF locked THEN Lock(FALSE) END;
  9414. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9415. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9416. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9417. (* return without structured return parameter *)
  9418. Evaluate(expression,res);
  9419. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9420. IF locked OR profile THEN
  9421. Emit(Push(position,res.op));
  9422. IF delegate THEN HALT(200) END;
  9423. ReleaseOperand(res);
  9424. IF locked THEN Lock(FALSE) END;
  9425. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9426. reg := NewRegisterOperand(res.op.type);
  9427. Emit(Pop(position,reg));
  9428. Emit(Return(position,reg));
  9429. ReleaseIntermediateOperand(reg);
  9430. ELSE
  9431. Emit(Return(position,res.op));
  9432. ReleaseOperand(res);
  9433. END;
  9434. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9435. THEN
  9436. (* return using structured return parameter *)
  9437. 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)
  9438. OR SemanticChecker.IsPointerType(type));
  9439. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9440. parameter :=procedureType.returnParameter;
  9441. ASSERT(parameter # NIL);
  9442. returnTypeOffset := parameter.offsetInBits;
  9443. (*
  9444. IF parameter# NIL THEN
  9445. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9446. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9447. ELSE
  9448. returnTypeOffset := system.offsetFirstParameter
  9449. END;
  9450. *)
  9451. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9452. IF type IS SyntaxTree.RangeType THEN
  9453. (* array range type *)
  9454. Evaluate(expression, right);
  9455. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9456. Emit(Mov(position,mem, right.op)); (* first *)
  9457. ReleaseIntermediateOperand(mem);
  9458. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9459. Emit(Mov(position,mem, right.tag)); (* last *)
  9460. ReleaseIntermediateOperand(mem);
  9461. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9462. Emit(Mov(position,mem, right.extra)); (* step *)
  9463. ReleaseIntermediateOperand(mem);
  9464. ReleaseOperand(right);
  9465. ELSIF type IS SyntaxTree.ComplexType THEN
  9466. Evaluate(expression, right);
  9467. componentType := type(SyntaxTree.ComplexType).componentType;
  9468. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9469. Emit(Mov(position,mem, right.op)); (* real part *)
  9470. ReleaseIntermediateOperand(mem);
  9471. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9472. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9473. ReleaseIntermediateOperand(mem);
  9474. ReleaseOperand(right);
  9475. ELSE (* covers cases: pointer / record / array *)
  9476. parameter := procedureType.returnParameter;
  9477. checker.SetCurrentScope(currentScope);
  9478. ASSERT(parameter # NIL);
  9479. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9480. Assign(parameterDesignator,expression);
  9481. END;
  9482. ReleaseIntermediateOperand(left);
  9483. IF locked THEN Lock(FALSE) END;
  9484. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9485. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9486. parameter := procedureType.returnParameter;
  9487. checker.SetCurrentScope(currentScope);
  9488. IF parameter = NIL THEN
  9489. Error(procedure.position, "structured return of parameter of procedure not found");
  9490. ELSE
  9491. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9492. Assign(parameterDesignator,expression);
  9493. END;
  9494. IF locked THEN Lock(FALSE) END;
  9495. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9496. ELSE
  9497. HALT(200);
  9498. END;
  9499. ELSE
  9500. IF locked THEN Lock(FALSE) END;
  9501. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9502. END;
  9503. IF backend.cooperative THEN
  9504. BrL(exitLabel);
  9505. ELSE
  9506. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9507. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9508. END;
  9509. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9510. END VisitReturnStatement;
  9511. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9512. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9513. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9514. statements: SyntaxTree.StatementSequence;
  9515. name, suffix: SyntaxTree.IdentifierString;
  9516. BEGIN
  9517. Strings.IntToStr(awaitProcCounter,suffix);
  9518. Strings.Concat("@AwaitProcedure",suffix,name);
  9519. identifier := SyntaxTree.NewIdentifier(name);
  9520. INC(awaitProcCounter);
  9521. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9522. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9523. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9524. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9525. procedure.SetAccess(SyntaxTree.Hidden);
  9526. procedure.SetScope(currentScope);
  9527. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9528. procedureType.SetReturnType(system.booleanType);
  9529. procedure.SetType(procedureType);
  9530. body := SyntaxTree.NewBody(x.position,procedureScope);
  9531. procedureScope.SetBody(body);
  9532. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9533. returnStatement.SetReturnValue(x.condition);
  9534. statements := SyntaxTree.NewStatementSequence();
  9535. statements.AddStatement(returnStatement);
  9536. body.SetStatementSequence(statements);
  9537. currentScope.AddProcedure(procedure);
  9538. RETURN procedure
  9539. END MakeAwaitProcedure;
  9540. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9541. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9542. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9543. BEGIN
  9544. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9545. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9546. IF backend.cooperative THEN
  9547. start := NewLabel();
  9548. true := NewLabel();
  9549. false := NewLabel();
  9550. SetLabel(start);
  9551. Condition(x.condition,true,false);
  9552. SetLabel(false);
  9553. PushSelfPointer();
  9554. CallThis(position,"ExclusiveBlocks","Await",1);
  9555. BrL(start);
  9556. SetLabel(true);
  9557. PushSelfPointer();
  9558. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9559. ELSE
  9560. proc := MakeAwaitProcedure(x);
  9561. Emit(Push(position,fp));
  9562. GetCodeSectionNameForSymbol(proc,name);
  9563. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9564. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9565. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9566. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9567. Emit(Result(position,res));
  9568. (*
  9569. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9570. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9571. *)
  9572. InitOperand(result,ModeValue);
  9573. result.op := res;
  9574. label := NewLabel();
  9575. BreqL(label, result.op, SELF.true);
  9576. ReleaseOperand(result);
  9577. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9578. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9579. Emit(Push(position,res));
  9580. Emit(Push(position,fp));
  9581. PushSelfPointer();
  9582. Emit(Push(position,nil));
  9583. CallThis(position,"Objects","Await",4);
  9584. SetLabel(label);
  9585. END;
  9586. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9587. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9588. END VisitAwaitStatement;
  9589. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9590. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9591. BEGIN
  9592. FOR i := 0 TO x.Length() - 1 DO
  9593. statement := x.GetStatement( i );
  9594. Statement(statement);
  9595. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9596. END;
  9597. END StatementSequence;
  9598. PROCEDURE PushSelfPointer;
  9599. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9600. BEGIN
  9601. scope := currentScope;
  9602. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9603. scope := scope.outerScope;
  9604. END;
  9605. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9606. IF ~newObjectFile THEN
  9607. Symbol(moduleSelf,op);
  9608. IntermediateCode.MakeMemory(op.op,addressType);
  9609. ELSE
  9610. moduleSection := meta.ModuleSection();
  9611. IF backend.cooperative THEN
  9612. moduleOffset := 0;
  9613. ELSE
  9614. moduleOffset := moduleSection.pc;
  9615. END;
  9616. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9617. END;
  9618. ELSE
  9619. GetBaseRegister(op.op,currentScope,scope);
  9620. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9621. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9622. IF backend.cooperative THEN
  9623. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9624. END;
  9625. IntermediateCode.MakeMemory(op.op,addressType);
  9626. END;
  9627. Emit(Push(position,op.op));
  9628. ReleaseOperand(op);
  9629. END PushSelfPointer;
  9630. PROCEDURE Lock(lock: BOOLEAN);
  9631. BEGIN
  9632. IF Trace THEN TraceEnter("Lock") END;
  9633. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9634. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9635. ASSERT(modifyAssignmentCounter = 0);
  9636. IF dump # NIL THEN
  9637. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9638. dump.Ln;dump.Update;
  9639. END;
  9640. PushSelfPointer;
  9641. IF backend.cooperative THEN
  9642. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9643. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9644. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9645. END;
  9646. ELSE
  9647. Emit(Push(position,true));
  9648. IF lock THEN CallThis(position,"Objects","Lock",2)
  9649. ELSE CallThis(position,"Objects","Unlock",2);
  9650. END;
  9651. END;
  9652. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9653. IF Trace THEN TraceExit("Lock") END;
  9654. END Lock;
  9655. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9656. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9657. BEGIN
  9658. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9659. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9660. previouslyUnchecked := isUnchecked;
  9661. isUnchecked := isUnchecked OR x.isUnchecked;
  9662. previouslyCooperativeSwitches := cooperativeSwitches;
  9663. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9664. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9665. IF x.statements # NIL THEN
  9666. StatementSequence(x.statements);
  9667. END;
  9668. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9669. isUnchecked := previouslyUnchecked;
  9670. cooperativeSwitches := previouslyCooperativeSwitches;
  9671. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9672. END VisitStatementBlock;
  9673. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9674. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9675. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9676. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9677. procedure: SyntaxTree.Procedure;
  9678. map: SymbolMap;
  9679. BEGIN
  9680. scope := currentScope;
  9681. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9682. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9683. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9684. return := emptyOperand;
  9685. IF Trace THEN TraceEnter("VisitCode") END;
  9686. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9687. NEW(in, x.inRules.Length());
  9688. FOR i := 0 TO LEN(in)-1 DO
  9689. statement := x.inRules.GetStatement(i);
  9690. WITH statement: SyntaxTree.Assignment DO
  9691. Evaluate(statement.right, operand);
  9692. result := operand.op;
  9693. NEW(str, 64);
  9694. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9695. in[i] := result; IntermediateCode.SetString(in[i], str);
  9696. ReleaseIntermediateOperand(operand.tag);
  9697. END;
  9698. END;
  9699. ELSE in := NIL
  9700. END;
  9701. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9702. NEW(out, x.outRules.Length());
  9703. FOR i := 0 TO LEN(out)-1 DO
  9704. statement := x.outRules.GetStatement(i);
  9705. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9706. WITH statement: SyntaxTree.Assignment DO
  9707. Evaluate(statement.left, operand); (*?? or designate *)
  9708. result := operand.op;
  9709. NEW(str, 64);
  9710. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9711. out[i] := result; IntermediateCode.SetString(out[i], str);
  9712. ReleaseIntermediateOperand(operand.tag);
  9713. |statement: SyntaxTree.ReturnStatement DO
  9714. NEW(str, 64);
  9715. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9716. IF currentIsInline THEN
  9717. map := currentMapper.Get(NIL);
  9718. Evaluate(map.to, operand);
  9719. out[i] := operand.op;
  9720. ELSE
  9721. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9722. END;
  9723. IntermediateCode.SetString(out[i], str);
  9724. ReleaseIntermediateOperand(operand.tag);
  9725. return := out[i];
  9726. ELSE
  9727. END;
  9728. END;
  9729. ELSE out := NIL
  9730. END;
  9731. Emit(Asm(x.position,x.sourceCode, in, out));
  9732. IF in # NIL THEN
  9733. FOR i := 0 TO LEN(in)-1 DO
  9734. ReleaseIntermediateOperand(in[i]);
  9735. END;
  9736. END;
  9737. IF out # NIL THEN
  9738. FOR i := 0 TO LEN(out)-1 DO
  9739. WITH statement: SyntaxTree.Assignment DO
  9740. ReleaseIntermediateOperand(out[i]);
  9741. ELSE
  9742. IF currentIsInline THEN
  9743. ReleaseIntermediateOperand(out[i]);
  9744. END;
  9745. END;
  9746. statement := x.outRules.GetStatement(i);
  9747. END;
  9748. END;
  9749. IF return.mode # IntermediateCode.Undefined THEN
  9750. IF currentIsInline THEN
  9751. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9752. Symbol(procedureType.returnParameter, par);
  9753. MakeMemory(mem, par.op, return.type, 0);
  9754. ReleaseOperand(par);
  9755. Emit(Mov(position, mem, return));
  9756. ReleaseIntermediateOperand(mem);
  9757. ELSE
  9758. Emit(Return(position,return));
  9759. END;
  9760. IF currentIsInline THEN RETURN END;
  9761. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9762. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9763. ReleaseIntermediateOperand(return);
  9764. END;
  9765. IF Trace THEN TraceExit("VisitCode") END;
  9766. END VisitCode;
  9767. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9768. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9769. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9770. const, call: IntermediateCode.Operand;
  9771. parameterDesignator: SyntaxTree.Expression;
  9772. saved: RegisterEntry;
  9773. name: Basic.SegmentedName;
  9774. BEGIN
  9775. IF Trace THEN TraceEnter("ParameterCopies") END;
  9776. parameter := x.firstParameter;
  9777. WHILE parameter # NIL DO
  9778. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9779. type := parameter.type.resolved;
  9780. IF IsOpenArray(type) THEN
  9781. VisitParameter(parameter);
  9782. op := result;
  9783. IF backend.cooperative & parameter.NeedsTrace() THEN
  9784. length := GetArrayLength(type, op.tag);
  9785. size := NewRegisterOperand(addressType);
  9786. base := ArrayBaseType(type);
  9787. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9788. Emit(Mul(position, size, length, const));
  9789. dst := NewRegisterOperand (addressType);
  9790. Emit(Mov(position, dst, size));
  9791. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9792. Emit(Sub(position,dst,sp,dst));
  9793. Emit(And(position,dst,dst,const));
  9794. Emit(Mov(position,sp,dst));
  9795. par := fp;
  9796. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9797. IntermediateCode.InitImmediate(null, byteType, 0);
  9798. Emit(Fill(position, dst, size, null));
  9799. ReleaseIntermediateOperand(dst);
  9800. ReleaseIntermediateOperand(length);
  9801. SaveRegisters();ReleaseUsedRegisters(saved);
  9802. (* register dst has been freed before SaveRegisters already *)
  9803. base := ArrayBaseType(type);
  9804. (* assign method of open array *)
  9805. IF base.IsRecordType() THEN
  9806. Emit (Push(position, length));
  9807. Emit (Push(position, dst));
  9808. Emit (Push(position, op.op));
  9809. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9810. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9811. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9812. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9813. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9814. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9815. Emit (Push(position,length));
  9816. Emit (Push(position, dst));
  9817. Emit (Push(position, length));
  9818. Emit (Push(position, op.op));
  9819. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9820. ELSE
  9821. Emit (Push(position, length));
  9822. Emit (Push(position, dst));
  9823. Emit (Push(position, length));
  9824. Emit (Push(position, op.op));
  9825. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9826. ASSERT(ArrayBaseType(type).IsPointer());
  9827. END;
  9828. RestoreRegisters(saved);
  9829. ELSE
  9830. temp := GetDynamicSize(type,op.tag);
  9831. ReuseCopy(size,temp);
  9832. ReleaseIntermediateOperand(temp);
  9833. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9834. Emit(Sub(position,size,sp,size));
  9835. Emit(And(position,size,size,const));
  9836. Emit(Mov(position,sp,size));
  9837. par := fp;
  9838. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9839. ReleaseIntermediateOperand(size);
  9840. size := GetDynamicSize(type,op.tag);
  9841. END;
  9842. Emit(Copy(position,sp,op.op,size));
  9843. ReleaseIntermediateOperand(size);
  9844. ReleaseOperand(op);
  9845. IntermediateCode.MakeMemory(par,addressType);
  9846. Emit(Mov(position,par,sp));
  9847. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9848. checker.SetCurrentScope(currentScope);
  9849. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9850. Assign(parameterDesignator,parameterDesignator);
  9851. END;
  9852. END;
  9853. parameter := parameter.nextParameter;
  9854. END;
  9855. IF Trace THEN TraceExit("ParameterCopies") END;
  9856. END ParameterCopies;
  9857. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9858. VAR x: SyntaxTree.Variable;
  9859. BEGIN
  9860. x := scope.firstVariable;
  9861. WHILE x # NIL DO
  9862. InitVariable(x);
  9863. x := x.nextVariable;
  9864. END;
  9865. END InitVariables;
  9866. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9867. BEGIN
  9868. IF (symbol # NIL) THEN
  9869. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9870. ELSE
  9871. RETURN 0
  9872. END;
  9873. END GetFingerprint;
  9874. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9875. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9876. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9877. saved: RegisterEntry;
  9878. BEGIN
  9879. IF Trace THEN TraceEnter("Body") END;
  9880. ReleaseUsedRegisters(saved); (* just in case ... *)
  9881. section := ir;
  9882. exitLabel := NewLabel ();
  9883. IF moduleBody THEN moduleBodySection := section END;
  9884. IF ir.comments # NIL THEN
  9885. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9886. commentPrintout.SingleStatement(TRUE);
  9887. dump := ir.comments;
  9888. ELSE
  9889. commentPrintout := NIL;
  9890. dump := NIL;
  9891. END;
  9892. prevScope := currentScope;
  9893. currentScope := scope;
  9894. lastSwitchPC := 0;
  9895. cooperativeSwitches := backend.cooperative;
  9896. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9897. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9898. IF x # NIL THEN
  9899. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9900. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9901. IF moduleBody THEN
  9902. ProfilerInit();
  9903. ELSE
  9904. Basic.SegmentedNameToString(ir.name, string);
  9905. ProfilerAddProcedure(numberProcedures,string);
  9906. ProfilerEnterExit(numberProcedures,TRUE);
  9907. END;
  9908. END;
  9909. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9910. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9911. END;
  9912. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9913. IF moduleBody & ~newObjectFile THEN
  9914. InitVariables(moduleScope)
  9915. END;
  9916. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9917. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9918. IF procedure = cellScope.bodyProcedure THEN
  9919. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9920. StaticCallOperand(op, cellScope.constructor);
  9921. Emit(Call(position,op.op,0));
  9922. END;
  9923. END;
  9924. END;
  9925. ParameterCopies(procedureType);
  9926. InitVariables(scope);
  9927. IF x.code = NIL THEN
  9928. VisitStatementBlock(x);
  9929. ELSE
  9930. VisitCode(x.code)
  9931. END;
  9932. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9933. ir.SetFinally(ir.pc);
  9934. StatementSequence(x.finally)
  9935. END;
  9936. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9937. IF ~backend.cooperative THEN
  9938. ProfilerEnterExit(numberProcedures,FALSE);
  9939. END;
  9940. INC(numberProcedures);
  9941. END;
  9942. END;
  9943. IF backend.cooperative THEN
  9944. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9945. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9946. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9947. (*! not required any more? check and delete!
  9948. PushSelfPointer();
  9949. CallThis(position,"Modules","SetInitialized",1);
  9950. *)
  9951. (*
  9952. SetLabel(end);
  9953. *)
  9954. END;
  9955. IF x # NIL THEN
  9956. SELF.position := x.position;
  9957. END;
  9958. CheckRegistersFree();
  9959. ASSERT(modifyAssignmentCounter = 0);
  9960. currentScope := prevScope;
  9961. IF Trace THEN TraceExit("Body") END;
  9962. END Body;
  9963. END ImplementationVisitor;
  9964. MetaDataGenerator=OBJECT
  9965. VAR
  9966. implementationVisitor: ImplementationVisitor;
  9967. declarationVisitor: DeclarationVisitor;
  9968. module: Sections.Module;
  9969. moduleName: ARRAY 128 OF CHAR;
  9970. moduleNamePool: Basic.HashTableInt;
  9971. moduleNamePoolSection: IntermediateCode.Section;
  9972. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9973. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9974. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9975. TypeTags: LONGINT; (* type extension level support *)
  9976. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9977. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9978. BEGIN
  9979. IF implementationVisitor.backend.cooperative THEN
  9980. TypeTags := MAX(LONGINT);
  9981. BaseTypesTableOffset := 0;
  9982. MethodTableOffset := 2;
  9983. TypeRecordBaseOffset := 0;
  9984. ELSIF simple THEN
  9985. TypeTags := 3; (* only 3 extensions allowed *)
  9986. BaseTypesTableOffset := 1;
  9987. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9988. TypeRecordBaseOffset := 0;
  9989. ELSE
  9990. TypeTags := 16;
  9991. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9992. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9993. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9994. END;
  9995. SELF.simple := simple;
  9996. SELF.implementationVisitor := implementationVisitor;
  9997. SELF.declarationVisitor := declarationVisitor;
  9998. implementationVisitor.meta := SELF;
  9999. declarationVisitor.meta := SELF;
  10000. END InitMetaDataGenerator;
  10001. PROCEDURE SetModule(module: Sections.Module);
  10002. VAR namePoolOffset: LONGINT;
  10003. BEGIN
  10004. SELF.module := module;
  10005. Global.GetModuleName(module.module,moduleName);
  10006. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  10007. NEW(moduleNamePool, 32);
  10008. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10009. END;
  10010. END SetModule;
  10011. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10012. BEGIN
  10013. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10014. END GetTypeRecordBaseOffset;
  10015. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10016. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10017. BEGIN
  10018. INC(dataAdrOffset,6);
  10019. Info(section,"headerAdr");
  10020. Address(section,0);
  10021. Info(section,"typeDesc");
  10022. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10023. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10024. NamedSymbol(section, name, symbol, 0, offset);
  10025. Info(section,"mark: LONGINT;");
  10026. Longint(section,-1);
  10027. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0);END;
  10028. Info(section,"dataAdr-: ADDRESS");
  10029. Symbol(section,section, dataAdrOffset,0);
  10030. Info(section,"size-: SIZE");
  10031. Address(section,0);
  10032. Info(section,"nextRealtime: HeapBlock;");
  10033. Address(section,0);
  10034. END HeapBlock;
  10035. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10036. VAR i: LONGINT;
  10037. BEGIN
  10038. INC(dataAdrOffset,14);
  10039. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10040. Info(section,"count*: LONGINT");
  10041. Longint(section,0);
  10042. Info(section,"locked*: BOOLEAN");
  10043. Longint(section,0);
  10044. Info(section,"awaitingLock*: ProcessQueue");
  10045. Address(section,0);
  10046. Address(section,0);
  10047. Info(section,"awaitingCond*: ProcessQueue");
  10048. Address(section,0);
  10049. Address(section,0);
  10050. Info(section,"lockedBy*: ANY");
  10051. Address(section,0);
  10052. Info(section,"lock*: ANY");
  10053. Address(section,0);
  10054. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10055. Longint(section,1);
  10056. FOR i := 2 TO 6 DO
  10057. Longint(section,0);
  10058. END;
  10059. END ProtectedHeapBlock;
  10060. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10061. BEGIN
  10062. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10063. END Info;
  10064. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  10065. VAR op: IntermediateCode.Operand;
  10066. BEGIN
  10067. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10068. section.Emit(Data(-11,op));
  10069. END Address;
  10070. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  10071. VAR op: IntermediateCode.Operand;
  10072. BEGIN
  10073. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10074. section.Emit(Data(-12,op));
  10075. END Size;
  10076. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10077. VAR op: IntermediateCode.Operand;
  10078. BEGIN
  10079. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10080. section.Emit(Data(-1,op));
  10081. END Set;
  10082. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10083. VAR op: IntermediateCode.Operand;
  10084. BEGIN
  10085. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10086. section.Emit(Data(-1,op));
  10087. END Longint;
  10088. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10089. VAR op,noOperand: IntermediateCode.Operand;
  10090. BEGIN
  10091. IntermediateCode.InitOperand(noOperand);
  10092. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10093. section.PatchOperands(pc,op,noOperand,noOperand);
  10094. END PatchAddress;
  10095. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10096. VAR op,noOperand: IntermediateCode.Operand;
  10097. BEGIN
  10098. IntermediateCode.InitOperand(noOperand);
  10099. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10100. section.PatchOperands(pc,op,noOperand,noOperand);
  10101. END PatchSize;
  10102. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10103. VAR op,noOperand: IntermediateCode.Operand;
  10104. BEGIN
  10105. IntermediateCode.InitOperand(noOperand);
  10106. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10107. section.PatchOperands(pc,op,noOperand,noOperand);
  10108. END PatchLongint;
  10109. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10110. VAR op, noOperand: IntermediateCode.Operand;
  10111. BEGIN
  10112. IntermediateCode.InitOperand(noOperand);
  10113. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10114. section.PatchOperands(pc,op,noOperand,noOperand);
  10115. END PatchSymbol;
  10116. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10117. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10118. BEGIN
  10119. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10120. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10121. section.Emit(Data(-1,op));
  10122. END Boolean;
  10123. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10124. VAR op: IntermediateCode.Operand;
  10125. BEGIN
  10126. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10127. section.Emit(Data(-1,op));
  10128. END Char;
  10129. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10130. VAR i: LONGINT;
  10131. BEGIN
  10132. Info(section,str);
  10133. i := 0;
  10134. WHILE(str[i] # 0X) DO
  10135. Char(section,str[i]);
  10136. INC(i);
  10137. END;
  10138. Char(section,0X);
  10139. END String;
  10140. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10141. VAR op: IntermediateCode.Operand;
  10142. BEGIN
  10143. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10144. IntermediateCode.SetOffset(op,realOffset);
  10145. section.Emit(Data(-1,op));
  10146. END NamedSymbol;
  10147. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10148. BEGIN
  10149. IF symbol= NIL THEN
  10150. Address( section, realOffset);
  10151. ASSERT(virtualOffset = 0);
  10152. ELSE
  10153. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10154. END;
  10155. END Symbol;
  10156. (* OutPointers delivers
  10157. {pointerOffset}
  10158. *)
  10159. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10160. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  10161. BEGIN
  10162. type := type.resolved;
  10163. IF type IS SyntaxTree.AnyType THEN
  10164. Symbol(section, symbol, 0, (offset ));
  10165. INC(numberPointers);
  10166. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10167. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10168. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10169. ELSIF type IS SyntaxTree.PointerType THEN
  10170. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10171. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10172. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10173. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10174. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10175. ELSIF (type IS SyntaxTree.RecordType) THEN
  10176. (* never treat a record like a pointer, even if the pointer field is set! *)
  10177. WITH type: SyntaxTree.RecordType DO
  10178. base := type.GetBaseRecord();
  10179. IF base # NIL THEN
  10180. Pointers(offset,symbol,section, base,numberPointers);
  10181. END;
  10182. variable := type.recordScope.firstVariable;
  10183. WHILE(variable # NIL) DO
  10184. IF ~(variable.untraced) THEN
  10185. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10186. END;
  10187. variable := variable.nextVariable;
  10188. END;
  10189. END;
  10190. ELSIF (type IS SyntaxTree.CellType) THEN
  10191. WITH type: SyntaxTree.CellType DO
  10192. base := type.GetBaseRecord();
  10193. IF base # NIL THEN
  10194. Pointers(offset,symbol,section, base,numberPointers);
  10195. END;
  10196. variable := type.cellScope.firstVariable;
  10197. WHILE(variable # NIL) DO
  10198. IF ~(variable.untraced) THEN
  10199. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10200. END;
  10201. variable := variable.nextVariable;
  10202. END;
  10203. END;
  10204. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10205. WITH type: SyntaxTree.ArrayType DO
  10206. IF type.form= SyntaxTree.Static THEN
  10207. n := type.staticLength;
  10208. base := type.arrayBase.resolved;
  10209. WHILE(base IS SyntaxTree.ArrayType) DO
  10210. type := base(SyntaxTree.ArrayType);
  10211. n := n* type.staticLength;
  10212. base := type.arrayBase.resolved;
  10213. END;
  10214. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10215. IF SemanticChecker.ContainsPointer(base) THEN
  10216. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10217. FOR i := 0 TO n-1 DO
  10218. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10219. END;
  10220. END;
  10221. ELSE
  10222. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10223. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10224. END;
  10225. END;
  10226. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10227. WITH type: SyntaxTree.MathArrayType DO
  10228. IF type.form = SyntaxTree.Static THEN
  10229. n := type.staticLength;
  10230. base := type.arrayBase.resolved;
  10231. WHILE(base IS SyntaxTree.MathArrayType) DO
  10232. type := base(SyntaxTree.MathArrayType);
  10233. n := n* type.staticLength;
  10234. base := type.arrayBase.resolved;
  10235. END;
  10236. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10237. IF SemanticChecker.ContainsPointer(base) THEN
  10238. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10239. FOR i := 0 TO n-1 DO
  10240. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10241. END;
  10242. END;
  10243. ELSE
  10244. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10245. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10246. END
  10247. END;
  10248. (* ELSE no pointers in type *)
  10249. END;
  10250. END Pointers;
  10251. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10252. VAR position,i: LONGINT; ch: CHAR;
  10253. BEGIN
  10254. IF pool.Has(index) THEN
  10255. RETURN pool.GetInt(index)
  10256. ELSE
  10257. position := source.pc;
  10258. pool.PutInt(index, position);
  10259. Info(source, name);
  10260. i := 0;
  10261. REPEAT
  10262. ch := name[i]; INC(i);
  10263. Char( source, ch);
  10264. UNTIL ch = 0X;
  10265. END;
  10266. RETURN position;
  10267. END EnterDynamicName;
  10268. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10269. VAR name: Basic.SectionName; position: LONGINT;
  10270. BEGIN
  10271. IF pool.Has(index) THEN
  10272. RETURN pool.GetInt(index)
  10273. ELSE
  10274. StringPool.GetString(index, name);
  10275. position := EnterDynamicName(source,name,index, pool);
  10276. END;
  10277. RETURN position;
  10278. END DynamicName;
  10279. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10280. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10281. BEGIN
  10282. COPY(moduleName,name);
  10283. Strings.Append(name,suffix);
  10284. Basic.ToSegmentedName(name, pooledName);
  10285. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10286. IF implementationVisitor.backend.cooperative THEN
  10287. Info(section, "TypeDescriptor");
  10288. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10289. NamedSymbol(section, pooledName,NIL, 0, 0);
  10290. BasePointer(section);
  10291. offset := 0;
  10292. ELSE
  10293. HeapBlock(mName,typeName,section,2);
  10294. Info(section, "HeapBlock");
  10295. (*
  10296. Symbol(section,section,2,0);
  10297. *)
  10298. Address(section,0); (* empty such that GC does not go on traversing *)
  10299. Info(section, "TypeDescriptor");
  10300. Address(section,0);
  10301. offset := section.pc;
  10302. END;
  10303. RETURN section
  10304. END Block;
  10305. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10306. VAR name: Basic.SegmentedName;
  10307. BEGIN
  10308. Info(source,"ArrayHeader");
  10309. IF implementationVisitor.backend.cooperative THEN
  10310. sizePC := source.pc;
  10311. Address(source,0);
  10312. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10313. IF baseType # "" THEN
  10314. Basic.ToSegmentedName(baseType, name);
  10315. NamedSymbol(source, name,NIL, 0, 0);
  10316. ELSE
  10317. Address(source,0);
  10318. END;
  10319. Address(source,0);
  10320. ELSE
  10321. Address(source,0);
  10322. Address(source,0);
  10323. Address(source,0);
  10324. sizePC := source.pc;
  10325. Address(source,0);
  10326. Info(source,"array data");
  10327. END;
  10328. END Array;
  10329. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10330. BEGIN
  10331. IF implementationVisitor.backend.cooperative THEN
  10332. PatchSize(section, pc, size);
  10333. PatchSize(section, pc + 3, size);
  10334. ELSE
  10335. PatchSize(section, pc, size);
  10336. END;
  10337. END PatchArray;
  10338. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10339. VAR
  10340. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10341. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10342. poolMap: Basic.HashTableInt;
  10343. namePool: IntermediateCode.Section;
  10344. namePoolOffset: LONGINT;
  10345. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10346. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10347. BEGIN
  10348. Basic.SegmentedNameToString(s1.name,n1);
  10349. Basic.SegmentedNameToString(s2.name,n2);
  10350. index := 0;
  10351. ch1 := n1[index];
  10352. ch2 := n2[index];
  10353. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10354. INC(index);
  10355. ch1 := n1[index];
  10356. ch2 := n2[index];
  10357. END;
  10358. RETURN ch1 < ch2;
  10359. END Compare;
  10360. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10361. VAR
  10362. i, j: LONGINT;
  10363. x, t: Sections.Section;
  10364. BEGIN
  10365. IF lo < hi THEN
  10366. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10367. WHILE i <= j DO
  10368. WHILE Compare(list[i], x) DO INC(i) END;
  10369. WHILE Compare(x, list[j]) DO DEC(j) END;
  10370. IF i <= j THEN
  10371. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10372. INC(i); DEC(j)
  10373. END
  10374. END;
  10375. IF lo < j THEN QuickSort(list, lo, j) END;
  10376. IF i < hi THEN QuickSort(list, i, hi) END
  10377. END;
  10378. END QuickSort;
  10379. (*
  10380. ExportDesc* = RECORD
  10381. fp*: ADDRESS;
  10382. name* {UNTRACED}: DynamicName;
  10383. adr*: ADDRESS;
  10384. exports*: LONGINT;
  10385. dsc* {UNTRACED}: ExportArray
  10386. END;
  10387. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10388. *)
  10389. PROCEDURE ExportDesc2(
  10390. source: IntermediateCode.Section;
  10391. namePool: IntermediateCode.Section;
  10392. fingerPrinter: FingerPrinter.FingerPrinter;
  10393. symbol: Sections.Section;
  10394. name: StringPool.Index;
  10395. VAR patchAdr: LONGINT
  10396. ): BOOLEAN;
  10397. VAR fingerPrint: SyntaxTree.FingerPrint;
  10398. BEGIN
  10399. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10400. & (symbol.type # Sections.InlineCodeSection)
  10401. THEN
  10402. *)
  10403. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10404. & (symbol.type # Sections.InlineCodeSection))
  10405. THEN
  10406. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10407. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10408. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10409. Longint(source,fingerPrint.shallow);
  10410. ELSE
  10411. Longint(source, 0);
  10412. END;
  10413. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10414. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10415. Symbol(source, symbol,0,0);
  10416. patchAdr := source.pc;
  10417. Longint(source, 0);
  10418. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10419. Address(source,0);
  10420. END;
  10421. RETURN TRUE
  10422. ELSE
  10423. RETURN FALSE
  10424. END;
  10425. END ExportDesc2;
  10426. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10427. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10428. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10429. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10430. nextPatch: LONGINT;
  10431. TYPE
  10432. Scope = RECORD
  10433. elements: LONGINT;
  10434. gelements: LONGINT;
  10435. section: IntermediateCode.Section;
  10436. patchAdr: LONGINT;
  10437. arraySizePC: LONGINT;
  10438. beginPC: LONGINT; (* current scope start pc *)
  10439. END;
  10440. BEGIN
  10441. Basic.InitSegmentedName(prev);
  10442. olevel := -1;
  10443. scopes[0].section := source;
  10444. scopes[0].arraySizePC := MIN(LONGINT);
  10445. FOR s := 0 TO LEN(sections)-1 DO
  10446. symbol := sections[s];
  10447. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10448. this := sections[s].name;
  10449. level := 0;
  10450. WHILE (this[level] > 0) DO
  10451. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10452. INC(level);
  10453. END;
  10454. WHILE level < olevel DO
  10455. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10456. IF olevel > 0 THEN
  10457. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10458. nextPatch := scopes[olevel-1].patchAdr+1;
  10459. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10460. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10461. END;
  10462. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10463. DEC(olevel);
  10464. END;
  10465. IF (this[level] > 0) THEN
  10466. IF level > olevel THEN
  10467. (*TRACE("opening",level); *)
  10468. IF scopes[level].section = NIL THEN
  10469. arrayName := ".@ExportArray";
  10470. Strings.AppendInt(arrayName, level);
  10471. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10472. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10473. END;
  10474. scopes[level].beginPC := scopes[level].section.pc;
  10475. olevel := level;
  10476. scopes[olevel].elements := 0;
  10477. END;
  10478. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10479. sym := sections[s];
  10480. ELSE
  10481. sym := NIL;
  10482. END;
  10483. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10484. THEN
  10485. INC(scopes[olevel].elements);
  10486. END;
  10487. (*StringPool.GetString(this[level], name);*)
  10488. (*TRACE(level, name);*)
  10489. (* enter string in scope *)
  10490. INC(level);
  10491. END;
  10492. END;
  10493. Basic.SegmentedNameToString(this, name);
  10494. (*TRACE(level, "enter", name);*)
  10495. prev := this;
  10496. END;
  10497. END;
  10498. WHILE 0 <= olevel DO
  10499. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10500. IF olevel > 0 THEN
  10501. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10502. nextPatch := scopes[olevel-1].patchAdr+1;
  10503. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10504. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10505. END;
  10506. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10507. DEC(olevel);
  10508. END;
  10509. level := 0;
  10510. WHILE (level < LEN(scopes)) DO
  10511. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10512. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10513. END;
  10514. INC(level);
  10515. END;
  10516. END Export;
  10517. BEGIN
  10518. NEW(fingerPrinter, module.system);
  10519. NEW(poolMap, 64);
  10520. (* 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 *)
  10521. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10522. NEW(sectionArray, module.allSections.Length());
  10523. FOR i := 0 TO module.allSections.Length() - 1 DO
  10524. section := module.allSections.GetSection(i);
  10525. sectionArray[i] := section;
  10526. END;
  10527. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10528. Export(sectionArray^);
  10529. END ExportDesc;
  10530. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10531. VAR
  10532. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10533. BEGIN
  10534. Info(source, "exception table offsets array descriptor");
  10535. size := 0;
  10536. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10537. Info(source, "exception table content");
  10538. FOR i := 0 TO module.allSections.Length() - 1 DO
  10539. p := module.allSections.GetSection(i);
  10540. IF p.type = Sections.CodeSection THEN
  10541. finallyPC := p(IntermediateCode.Section).finally;
  10542. IF finallyPC>=0 THEN
  10543. Symbol( source, p, 0,0);
  10544. Symbol( source, p, finallyPC, 0);
  10545. Symbol( source, p, finallyPC,0);
  10546. INC(size);
  10547. END;
  10548. END
  10549. END;
  10550. PatchArray(source,sizePC,size);
  10551. END ExceptionArray;
  10552. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10553. VAR i: LONGINT; ch: CHAR;
  10554. BEGIN
  10555. i := 0;
  10556. REPEAT
  10557. ch := name[i]; INC(i);
  10558. Char( section, ch);
  10559. UNTIL ch = 0X;
  10560. WHILE i < 32 DO
  10561. Char( section, 0X); INC(i);
  10562. END;
  10563. END Name;
  10564. PROCEDURE References(section: IntermediateCode.Section);
  10565. CONST
  10566. rfDirect = 1X; rfIndirect = 3X;
  10567. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10568. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10569. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10570. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10571. rfPort = 19X;
  10572. rfRecordPointer=1DX;
  10573. rfArrayFlag = 80X;
  10574. VAR
  10575. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10576. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10577. VAR char: CHAR;
  10578. BEGIN
  10579. IF type = NIL THEN char := rfLongint
  10580. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10581. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10582. ELSIF type IS SyntaxTree.CharacterType THEN
  10583. IF type.sizeInBits = 8 THEN char := rfChar8
  10584. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10585. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10586. END;
  10587. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10588. IF type.sizeInBits = 8 THEN char := rfShortint
  10589. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10590. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10591. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10592. END;
  10593. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10594. ELSIF type IS SyntaxTree.FloatType THEN
  10595. IF type.sizeInBits = 32 THEN char := rfReal
  10596. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10597. END;
  10598. ELSIF type IS SyntaxTree.ComplexType THEN
  10599. IF type.sizeInBits = 64 THEN char := rfComplex
  10600. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10601. END;
  10602. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10603. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10604. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10605. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10606. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10607. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10608. ELSIF type IS SyntaxTree.PortType THEN char := rfPort
  10609. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10610. END;
  10611. RETURN char
  10612. END BaseType;
  10613. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10614. VAR destination: Sections.Section;
  10615. BEGIN
  10616. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10617. IF type.pointerType # NIL THEN
  10618. Char(section,rfRecordPointer)
  10619. ELSE
  10620. Char(section,rfRecord);
  10621. END;
  10622. IF destination = NIL THEN
  10623. Longint(section,0);
  10624. ELSE
  10625. Longint(section,destination.offset); (* used for ? *)
  10626. END;
  10627. END RecordType;
  10628. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10629. BEGIN
  10630. baseType := type.arrayBase.resolved;
  10631. IF type.form = SyntaxTree.Static THEN
  10632. IF baseType IS SyntaxTree.ArrayType THEN
  10633. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10634. ELSE
  10635. RETURN type.staticLength
  10636. END
  10637. ELSE
  10638. RETURN 0
  10639. END;
  10640. END StaticArrayLength;
  10641. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10642. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10643. BEGIN
  10644. length := StaticArrayLength(type, baseType);
  10645. char := BaseType(baseType);
  10646. IF type.form # SyntaxTree.Open THEN
  10647. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10648. Longint(section, length)
  10649. ELSE
  10650. length :=0;
  10651. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10652. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10653. Longint(section, length)
  10654. END;
  10655. END ArrayType;
  10656. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10657. BEGIN
  10658. baseType := type.arrayBase;
  10659. IF baseType # NIL THEN
  10660. baseType := baseType.resolved;
  10661. END;
  10662. IF type.form = SyntaxTree.Static THEN
  10663. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10664. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10665. ELSE
  10666. RETURN type.staticLength
  10667. END
  10668. ELSE
  10669. RETURN 0
  10670. END;
  10671. END StaticMathArrayLength;
  10672. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10673. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10674. BEGIN
  10675. length := StaticMathArrayLength(type, baseType);
  10676. char := BaseType(baseType);
  10677. IF type.form = SyntaxTree.Open THEN
  10678. char := BaseType(module.system.addressType);
  10679. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10680. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10681. Longint(section, length)
  10682. ELSIF type.form=SyntaxTree.Tensor THEN
  10683. char := BaseType(module.system.addressType);
  10684. Char(section, CHR(ORD(char)));
  10685. ELSE
  10686. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10687. Longint(section, length)
  10688. END;
  10689. END MathArrayType;
  10690. PROCEDURE Type(type: SyntaxTree.Type);
  10691. BEGIN
  10692. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10693. IF type IS SyntaxTree.BasicType THEN
  10694. Char(section, BaseType(type));
  10695. ELSIF type IS SyntaxTree.RecordType THEN
  10696. RecordType(type(SyntaxTree.RecordType));
  10697. ELSIF type IS SyntaxTree.ArrayType THEN
  10698. ArrayType(type(SyntaxTree.ArrayType))
  10699. ELSIF type IS SyntaxTree.EnumerationType THEN
  10700. Char(section, BaseType(module.system.longintType))
  10701. ELSIF type IS SyntaxTree.PointerType THEN
  10702. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10703. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10704. ELSE
  10705. Char(section, BaseType(type))
  10706. END;
  10707. ELSIF type IS SyntaxTree.ProcedureType THEN
  10708. Char(section, BaseType(type));
  10709. ELSIF type IS SyntaxTree.MathArrayType THEN
  10710. MathArrayType(type(SyntaxTree.MathArrayType));
  10711. ELSIF type IS SyntaxTree.CellType THEN
  10712. Char(section, BaseType(module.system.anyType));
  10713. ELSIF type IS SyntaxTree.PortType THEN
  10714. Char(section, rfPort);
  10715. ELSE HALT(200)
  10716. END;
  10717. END Type;
  10718. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10719. VAR name: ARRAY 256 OF CHAR;
  10720. BEGIN
  10721. IF variable.externalName # NIL THEN RETURN END;
  10722. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10723. variable.GetName(name);
  10724. Type(variable.type);
  10725. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10726. String(section,name);
  10727. END WriteVariable;
  10728. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10729. VAR name: ARRAY 256 OF CHAR;
  10730. BEGIN
  10731. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10732. variable.GetName(name);
  10733. Type(variable.type);
  10734. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10735. variable.GetName(name);
  10736. String(section,name);
  10737. END WriteParameter;
  10738. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10739. BEGIN
  10740. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10741. IF type IS SyntaxTree.ArrayType THEN
  10742. WITH type: SyntaxTree.ArrayType DO
  10743. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10744. ELSE Char(section,rfOpenArray)
  10745. END;
  10746. END
  10747. ELSIF type IS SyntaxTree.MathArrayType THEN
  10748. WITH type: SyntaxTree.MathArrayType DO
  10749. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10750. ELSE Char(section,rfOpenArray)
  10751. END;
  10752. END
  10753. ELSIF type IS SyntaxTree.RecordType THEN
  10754. Char(section,rfRecord);
  10755. ELSE
  10756. Char(section, BaseType(type));
  10757. END;
  10758. END ReturnType;
  10759. PROCEDURE Procedure(s: Sections.Section);
  10760. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10761. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10762. segmentedName: Basic.SegmentedName;
  10763. name: ARRAY 256 OF CHAR;
  10764. BEGIN
  10765. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10766. (*procedure.name,name);*)
  10767. implementationVisitor.GetCodeSectionNameForSymbolInScope(procedure,module.module.moduleScope, name);
  10768. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10769. Char(section,0F9X);
  10770. Symbol(section,s,0,0);
  10771. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10772. Longint(section,procedureType.numberParameters);
  10773. ReturnType(procedureType.returnType);
  10774. Longint(section,0); (*! level *)
  10775. Longint(section,0);
  10776. (*
  10777. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10778. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10779. recordName := "";
  10780. IF record.pointerType # NIL THEN
  10781. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10782. ELSE
  10783. DeclarationName(record.typeDeclaration,recordName);
  10784. END;
  10785. i := 0;
  10786. Info(section,recordName);
  10787. WHILE recordName[i] # 0X DO
  10788. Char(section,recordName[i]); INC(i);
  10789. INC(size);
  10790. END;
  10791. Char(section,".");
  10792. INC(size);
  10793. END;
  10794. *)
  10795. String(section,name);
  10796. parameter := procedureType.firstParameter;
  10797. WHILE(parameter # NIL) DO
  10798. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10799. parameter := parameter.nextParameter;
  10800. END;
  10801. variable := procedure.procedureScope.firstVariable;
  10802. WHILE(variable # NIL) DO
  10803. WriteVariable(variable,FALSE);
  10804. variable := variable.nextVariable;
  10805. END;
  10806. END Procedure;
  10807. PROCEDURE Scope(s: Sections.Section);
  10808. BEGIN
  10809. Char(section,0F8X);
  10810. Symbol(section,s,0,0); (* start *)
  10811. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10812. String(section,"$$");
  10813. (* removed variables -- wrongly interpreted by Reflection
  10814. variable := module.module.moduleScope.firstVariable;
  10815. WHILE(variable # NIL) DO
  10816. WriteVariable(variable,FALSE);
  10817. variable := variable.nextVariable;
  10818. END;
  10819. *)
  10820. END Scope;
  10821. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10822. VAR result, i: LONGINT;
  10823. BEGIN
  10824. FOR i := startPC TO endPC -1 DO
  10825. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10826. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10827. END;
  10828. RETURN result;
  10829. END ComputeSize;
  10830. BEGIN
  10831. Array(section,sizePC,"");
  10832. startPC := section.pc;
  10833. Char(section,0FFX); (* sign for trap writer *)
  10834. FOR i := 0 TO module.allSections.Length() - 1 DO
  10835. s := module.allSections.GetSection(i);
  10836. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10837. Scope(s) (*! must be first procedure in ref section *)
  10838. END
  10839. END;
  10840. FOR i := 0 TO module.allSections.Length() - 1 DO
  10841. s := module.allSections.GetSection(i);
  10842. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10843. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10844. Procedure(s)
  10845. END
  10846. END;
  10847. endPC := section.pc;
  10848. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10849. END References;
  10850. (*
  10851. Command* = RECORD
  10852. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10853. name*: Name; (* name of the procedure *)
  10854. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10855. entryAdr* : ADDRESS; (* entry address of procedure *)
  10856. END;
  10857. *)
  10858. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10859. VAR
  10860. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10861. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10862. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  10863. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10864. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10865. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10866. BEGIN
  10867. RETURN
  10868. (type = NIL) OR
  10869. (type.resolved IS SyntaxTree.RecordType) OR
  10870. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10871. (type.resolved IS SyntaxTree.AnyType);
  10872. END TypeAllowed;
  10873. BEGIN
  10874. numberParameters := procedureType.numberParameters;
  10875. RETURN
  10876. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10877. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10878. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10879. END GetProcedureAllowed;
  10880. PROCEDURE WriteType(type : SyntaxTree.Type);
  10881. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10882. name: Basic.SegmentedName; offset: LONGINT;
  10883. BEGIN
  10884. IF type = NIL THEN
  10885. Address(source,0);
  10886. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10887. Address(source,1);
  10888. ELSE
  10889. type := type.resolved;
  10890. IF type IS SyntaxTree.PointerType THEN
  10891. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10892. END;
  10893. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10894. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10895. name[0] := typeDeclaration.name; name[1] := -1;
  10896. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10897. ASSERT(section # NIL);
  10898. ELSE
  10899. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10900. (* TODO *)
  10901. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10902. END;
  10903. IF implementationVisitor.backend.cooperative THEN
  10904. offset := 0;
  10905. ELSE
  10906. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10907. END;
  10908. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10909. END;
  10910. END WriteType;
  10911. BEGIN
  10912. Info(source, "command array descriptor");
  10913. Array(source,sizePC,"Modules.Command");
  10914. numberCommands := 0;
  10915. Info(source, "command array content");
  10916. FOR i := 0 TO module.allSections.Length() - 1 DO
  10917. p := module.allSections.GetSection(i);
  10918. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10919. procedure := p.symbol(SyntaxTree.Procedure);
  10920. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10921. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10922. procedure.GetName(name);
  10923. Name(source,name);
  10924. numberParameters := procedureType.numberParameters;
  10925. (* offset of type of first parameter *)
  10926. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10927. ELSE WriteType(procedureType.firstParameter.type)
  10928. END;
  10929. (* offset of type of return parameter *)
  10930. WriteType(procedureType.returnType);
  10931. (* command name *)
  10932. (* command code offset *)
  10933. Symbol(source,p,0,0);
  10934. INC(numberCommands);
  10935. IF Trace THEN
  10936. D.Ln;
  10937. END;
  10938. END;
  10939. END
  10940. END;
  10941. PatchArray(source,sizePC,numberCommands);
  10942. END CommandArray;
  10943. (* to prevent from double import of different module aliases *)
  10944. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10945. VAR i: SyntaxTree.Import;
  10946. BEGIN
  10947. i := module.module.moduleScope.firstImport;
  10948. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10949. i := i.nextImport;
  10950. END;
  10951. RETURN i = import
  10952. END IsFirstDirectOccurence;
  10953. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10954. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10955. BEGIN
  10956. Array(source,pc,"");
  10957. Info(source, "import module array data");
  10958. IF implementationVisitor.backend.cooperative THEN
  10959. offset := 0;
  10960. ELSE
  10961. IF module.system.addressType.sizeInBits = 64 THEN
  10962. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10963. ELSE
  10964. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10965. END;
  10966. END;
  10967. import := module.module.moduleScope.firstImport;
  10968. numberImports := 0;
  10969. WHILE import # NIL DO
  10970. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10971. Global.GetModuleSegmentedName(import.module,name);
  10972. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10973. NamedSymbol(source, name, NIL, 0, offset);
  10974. INC(numberImports);
  10975. END;
  10976. import := import.nextImport
  10977. END;
  10978. PatchArray(source,pc,numberImports);
  10979. END ImportsArray;
  10980. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10981. VAR
  10982. p: Sections.Section; sizePC, size, i: LONGINT;
  10983. BEGIN
  10984. Info(source, "Type info section");
  10985. size := 0;
  10986. Array(source,sizePC,"Modules.TypeDesc");
  10987. FOR i := 0 TO module.allSections.Length() - 1 DO
  10988. p := module.allSections.GetSection(i);
  10989. WITH p: IntermediateCode.Section DO
  10990. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10991. Symbol(source,p,0,0);
  10992. INC(size);
  10993. END;
  10994. END
  10995. END;
  10996. PatchArray(source,sizePC,size);
  10997. END TypeInfoSection;
  10998. (*
  10999. ProcTableEntry* = RECORD
  11000. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11001. noPtr*: LONGINT;
  11002. END;
  11003. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11004. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11005. *)
  11006. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  11007. VAR
  11008. destination: Sections.Section;
  11009. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  11010. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  11011. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11012. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  11013. BEGIN
  11014. Info(procArray,"pcFrom");
  11015. Symbol(procArray,destination,0,0);
  11016. Info(procArray,"pcTo");
  11017. Symbol(procArray,destination,destination.pc,0);
  11018. Info(procArray,"pcStatementBegin");
  11019. Symbol(procArray,destination,destination.validPAFEnter,0);
  11020. Info(procArray,"pcStatementEnd");
  11021. Symbol(procArray,destination,destination.validPAFExit,0);
  11022. IF ~implementationVisitor.backend.cooperative THEN
  11023. Basic.SegmentedNameToString(destination.name, string);
  11024. Info(pointerArray,string);
  11025. procedure := destination.symbol(SyntaxTree.Procedure);
  11026. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11027. variable := procedure.procedureScope.firstVariable;
  11028. WHILE(variable # NIL) DO
  11029. IF ~(variable.untraced) THEN
  11030. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  11031. END;
  11032. variable := variable.nextVariable
  11033. END;
  11034. parameter := procedureType.firstParameter;
  11035. WHILE(parameter # NIL) DO
  11036. IF ~(parameter.untraced) THEN
  11037. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  11038. END;
  11039. parameter := parameter.nextParameter;
  11040. END;
  11041. END;
  11042. Info(procArray,"numberPointers");
  11043. Longint(procArray,numberPointers);
  11044. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  11045. INC(pointerArraySize, numberPointers);
  11046. END PointerOffsets;
  11047. BEGIN
  11048. maxPointers := 0;
  11049. Info(procArray, "proc array descriptor");
  11050. Address(procArray,0);
  11051. Address(procArray,0);
  11052. Address(procArray,0);
  11053. procArraySizePC := procArray.pc;
  11054. Address(procArray,0);
  11055. procArraySize := 0;
  11056. IF ~implementationVisitor.backend.cooperative THEN
  11057. Info(pointerArray, "pointer array descriptor");
  11058. Address(pointerArray,0);
  11059. Address(pointerArray,0);
  11060. Address(pointerArray,0);
  11061. pointerArraySizePC := pointerArray.pc;
  11062. Address(pointerArray,0);
  11063. pointerArraySize := 0;
  11064. END;
  11065. procArraySize := 0;
  11066. FOR i := 0 TO module.allSections.Length() - 1 DO
  11067. destination := module.allSections.GetSection(i);
  11068. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11069. PointerOffsets(destination(IntermediateCode.Section));
  11070. INC(procArraySize);
  11071. END
  11072. END;
  11073. PatchLongint(procArray,procArraySizePC,procArraySize);
  11074. IF ~implementationVisitor.backend.cooperative THEN
  11075. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  11076. END;
  11077. END PointersInProcTables;
  11078. (*
  11079. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11080. VAR
  11081. next*: Module; (** once a module is published, all fields are read-only *)
  11082. name*: Name;
  11083. init, published: BOOLEAN;
  11084. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11085. sb*: ADDRESS; <- set to beginning of data section by loader
  11086. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11087. command*: POINTER TO ARRAY OF Command;
  11088. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11089. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11090. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11091. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11092. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11093. data*, code*: Bytes;
  11094. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11095. export*: ExportDesc;
  11096. term*: TerminationHandler;
  11097. exTable*: ExceptionTable;
  11098. noProcs*: LONGINT;
  11099. firstProc*: ADDRESS; <- done by loader
  11100. maxPtrs*: LONGINT;
  11101. crc*: LONGINT;
  11102. *)
  11103. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11104. BEGIN
  11105. Info(section, "cycle");
  11106. Size(section,0);
  11107. Info(section, "references");
  11108. Size(section,0);
  11109. Info(section, "nextMarked");
  11110. Address(section,0);
  11111. Info(section, "nextWatched");
  11112. Address(section,0);
  11113. END BasePointer;
  11114. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11115. BEGIN
  11116. BasePointer(section);
  11117. Info(section, "action");
  11118. Address(section,0);
  11119. Info(section, "monitor");
  11120. Address(section,0);
  11121. END BaseObject;
  11122. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11123. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11124. pooledName: Basic.SegmentedName;
  11125. symbol: SyntaxTree.Symbol;
  11126. BEGIN
  11127. Global.GetModuleName(module.module,name);
  11128. Strings.Append(name,".@Module.@Descriptor");
  11129. Basic.ToSegmentedName(name, pooledName);
  11130. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  11131. Symbol(section,descriptorSection,0,0);
  11132. Info(descriptorSection, "descriptor");
  11133. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11134. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11135. Address(descriptorSection,0);
  11136. Global.GetModuleName(module.module,name);
  11137. Strings.Append(name,".@Trace");
  11138. Basic.ToSegmentedName(name, pooledName);
  11139. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11140. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11141. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11142. END ModuleDescriptor;
  11143. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11144. VAR name: ARRAY 128 OF CHAR;
  11145. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11146. symbol: SyntaxTree.Symbol;
  11147. BEGIN
  11148. Global.GetModuleName(module.module,name);
  11149. Strings.Append(name,".@Module");
  11150. Basic.ToSegmentedName(name, pooledName);
  11151. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  11152. moduleSection.SetExported(TRUE);
  11153. IF moduleSection.pc = 0 THEN
  11154. IF implementationVisitor.backend.cooperative THEN
  11155. Info(moduleSection, "descriptor");
  11156. ModuleDescriptor(moduleSection);
  11157. BaseObject(moduleSection);
  11158. implementationVisitor.CreateTraceModuleMethod(module.module);
  11159. ELSE
  11160. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11161. Info(moduleSection, "HeapBlock");
  11162. Symbol(moduleSection,moduleSection,2,0);
  11163. Info(moduleSection, "TypeDescriptor");
  11164. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11165. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11166. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11167. END;
  11168. END;
  11169. RETURN moduleSection;
  11170. END ModuleSection;
  11171. PROCEDURE NewModuleInfo();
  11172. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11173. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11174. sectionName: Basic.SectionName;
  11175. CONST MPO=-40000000H;
  11176. BEGIN
  11177. (*
  11178. TypeDesc* = POINTER TO RECORD
  11179. descSize: LONGINT;
  11180. sentinel: LONGINT; (* = MPO-4 *)
  11181. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11182. flags*: SET;
  11183. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11184. name*: Name;
  11185. END;
  11186. *)
  11187. Global.GetSymbolSegmentedName(module.module,name);
  11188. Basic.AppendToSegmentedName(name,".@Info");
  11189. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11190. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11191. Address(source,MPO-4);
  11192. Info(source, "type tag pointer");
  11193. Address( source,0);
  11194. Info(source, "type flags");
  11195. flags := {};
  11196. Set( source, flags);
  11197. Info(source, "pointer to module");
  11198. moduleSection := ModuleSection();
  11199. Symbol( source, moduleSection, moduleSection.pc,0);
  11200. Info(source, "type name");
  11201. i := 0;
  11202. sectionName := "@Self";
  11203. (*
  11204. Global.GetSymbolSegmentedName(td,name);
  11205. Basic.SegmentedNameToString(name, sectionName);
  11206. *)
  11207. Name(source,sectionName);
  11208. source.SetReferenced(FALSE);
  11209. ReflectVariables(source, module.module);
  11210. ReflectProcedures(source, module.module);
  11211. END NewModuleInfo;
  11212. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11213. VAR
  11214. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11215. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  11216. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11217. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  11218. referenceSectionOffset : LONGINT;
  11219. BEGIN
  11220. NewModuleInfo();
  11221. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11222. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11223. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11224. ImportsArray(importSection);
  11225. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11226. CommandArray(commandsSection);
  11227. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11228. ExceptionArray(exceptionSection);
  11229. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11230. TypeInfoSection(typeInfoSection);
  11231. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11232. References(referenceSection);
  11233. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11234. IF ~implementationVisitor.backend.cooperative THEN
  11235. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  11236. ELSE
  11237. ptrTableSection := NIL;
  11238. END;
  11239. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  11240. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11241. Array(emptyArraySection,temp,"");
  11242. moduleSection := ModuleSection();
  11243. Info(moduleSection, "nextRoot*: RootObject");
  11244. Address(moduleSection,0);
  11245. Info(moduleSection, "next*: Module");
  11246. Address(moduleSection,0);
  11247. Info(moduleSection, "name*: Name");
  11248. Name(moduleSection,moduleName);
  11249. Info(moduleSection, "init, published: BOOLEAN");
  11250. Boolean(moduleSection,FALSE);
  11251. Boolean(moduleSection,FALSE);
  11252. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11253. Boolean(moduleSection,FALSE);
  11254. Boolean(moduleSection,FALSE);
  11255. Info(moduleSection, "refcnt*: LONGINT");
  11256. Longint(moduleSection,0);
  11257. Info(moduleSection, "sb*: ADDRESS");
  11258. Address(moduleSection,0);
  11259. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11260. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11261. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11262. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11263. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11264. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11265. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11266. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11267. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11268. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  11269. Info(moduleSection, "procTable*: ProcTable");
  11270. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11271. Info(moduleSection, "ptrTable*: PtrTable");
  11272. IF ~implementationVisitor.backend.cooperative THEN
  11273. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  11274. ELSE
  11275. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11276. END;
  11277. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11278. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11279. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11280. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11281. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11282. Info(moduleSection, "export*: ExportDesc");
  11283. ExportDesc(moduleSection);
  11284. Info(moduleSection, "term*: TerminationHandler");
  11285. Address(moduleSection,0);
  11286. Info(moduleSection, "exTable*: ExceptionTable");
  11287. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11288. Info(moduleSection, "noProcs*: LONGINT");
  11289. Longint(moduleSection,numberProcs);
  11290. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END;
  11291. Info(moduleSection, "firstProc*: ADDRESS");
  11292. Address(moduleSection,0);
  11293. Info(moduleSection, "maxPtrs*: LONGINT");
  11294. Longint(moduleSection,maxPointers);
  11295. Info(moduleSection, "crc*: LONGINT");
  11296. Longint(moduleSection, 0); (*! must be implemented *)
  11297. Info(moduleSection, "body*: ADDRESS");
  11298. Symbol(moduleSection, bodyProc, 0,0);
  11299. IF implementationVisitor.backend.cooperative THEN
  11300. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11301. Info(moduleSection, "monitor.owner");
  11302. Address(moduleSection,0);
  11303. Info(moduleSection, "monitor.nestingLevel");
  11304. Address(moduleSection,0);
  11305. Info(moduleSection, "monitor.blockedQueue");
  11306. Address(moduleSection,0); Address(moduleSection,0);
  11307. Info(moduleSection, "monitor.waitingQueue");
  11308. Address(moduleSection,0); Address(moduleSection,0);
  11309. Info(moduleSection, "monitor.waitingSentinel");
  11310. Address(moduleSection,0);
  11311. END;
  11312. END Module;
  11313. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11314. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  11315. BEGIN
  11316. Array(source,pc,"");
  11317. Info(source, "pointer offsets array data");
  11318. IF scope IS SyntaxTree.RecordScope THEN
  11319. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11320. ELSIF scope IS SyntaxTree.CellScope THEN
  11321. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11322. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11323. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11324. WHILE variable # NIL DO
  11325. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11326. symbol := module.allSections.FindBySymbol(variable);
  11327. ASSERT(symbol # NIL);
  11328. Pointers(0,symbol, source,variable.type,numberPointers);
  11329. END;
  11330. variable := variable.nextVariable;
  11331. END;
  11332. END;
  11333. PatchArray(source,pc,numberPointers);
  11334. END PointerArray;
  11335. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11336. VAR
  11337. name: Basic.SegmentedName;
  11338. section: IntermediateCode.Section;
  11339. BEGIN
  11340. ASSERT(implementationVisitor.newObjectFile);
  11341. Global.GetSymbolSegmentedName(symbol,name);
  11342. Basic.AppendToSegmentedName(name,suffix);
  11343. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11344. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11345. Info(section, "HeapBlock");
  11346. Address(section,0); (* empty such that GC does not go on traversing *)
  11347. Info(section, suffix);
  11348. Address(section,0);
  11349. pc := section.pc;
  11350. RETURN section;
  11351. END SymbolSection;
  11352. PROCEDURE ReflectParameters(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11353. VAR type: SyntaxTree.Type; variable: SyntaxTree.Parameter; pc: LONGINT; section: IntermediateCode.Section;
  11354. BEGIN
  11355. ASSERT(implementationVisitor.newObjectFile);
  11356. IF ~ReflectionSupport OR simple THEN variable := NIL
  11357. ELSIF symbol IS SyntaxTree.Procedure THEN
  11358. variable := symbol(SyntaxTree.Procedure).type(SyntaxTree.ProcedureType).firstParameter;
  11359. END;
  11360. Info(in, "parameters");
  11361. IF variable # NIL THEN
  11362. section := SymbolSection(symbol, ".@Parameters",pc);
  11363. ParameterArray(section, variable);
  11364. Symbol(in, section, pc, 0);
  11365. ELSE
  11366. Address(in, 0);
  11367. END;
  11368. END ReflectParameters;
  11369. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11370. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11371. BEGIN
  11372. ASSERT(implementationVisitor.newObjectFile);
  11373. IF ~ReflectionSupport OR simple THEN variable := NIL
  11374. ELSIF symbol IS SyntaxTree.Module THEN
  11375. variable := symbol(SyntaxTree.Module).moduleScope.firstVariable;
  11376. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11377. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11378. IF type IS SyntaxTree.PointerType THEN
  11379. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11380. END;
  11381. IF type IS SyntaxTree.RecordType THEN
  11382. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11383. ELSIF type IS SyntaxTree.CellType THEN
  11384. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11385. END;
  11386. ELSIF symbol IS SyntaxTree.Procedure THEN
  11387. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11388. END;
  11389. Info(in, "variables");
  11390. IF variable # NIL THEN
  11391. section := SymbolSection(symbol, ".@Variables",pc);
  11392. VariableArray(section, variable);
  11393. Symbol(in, section, pc, 0);
  11394. ELSE
  11395. Address(in, 0);
  11396. END;
  11397. END ReflectVariables;
  11398. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11399. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11400. BEGIN
  11401. ASSERT(implementationVisitor.newObjectFile);
  11402. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11403. ELSIF symbol IS SyntaxTree.Module THEN
  11404. procedure := symbol(SyntaxTree.Module).moduleScope.firstProcedure;
  11405. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11406. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11407. IF type IS SyntaxTree.PointerType THEN
  11408. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11409. END;
  11410. IF type IS SyntaxTree.RecordType THEN
  11411. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11412. ELSIF type IS SyntaxTree.CellType THEN
  11413. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11414. END;
  11415. ELSIF symbol IS SyntaxTree.Procedure THEN
  11416. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11417. END;
  11418. Info(in, "procedures");
  11419. IF procedure # NIL THEN
  11420. section := SymbolSection(symbol, ".@Procedures",pc);
  11421. ProcedureArray(section, procedure);
  11422. Symbol(in, section, pc, 0);
  11423. ELSE
  11424. Address(in, 0);
  11425. END;
  11426. END ReflectProcedures;
  11427. PROCEDURE ParameterArray(source: IntermediateCode.Section; parameter: SyntaxTree.Parameter);
  11428. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11429. segmentedName, name: Basic.SegmentedName;
  11430. td: SyntaxTree.TypeDeclaration;
  11431. type: SyntaxTree.Type;
  11432. BEGIN
  11433. Array(source,pc,"Modules.FieldEntry");
  11434. Info(source, "FieldArray");
  11435. size :=0;
  11436. WHILE parameter # NIL DO
  11437. Info(source,"name");
  11438. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, parameter.name, moduleNamePool), 0); (* reference to dynamic name *)
  11439. Info(source,"offset");
  11440. IF (parameter.scope # NIL) & (parameter.scope IS SyntaxTree.ModuleScope) THEN
  11441. implementationVisitor.GetCodeSectionNameForSymbol(parameter, name);
  11442. NamedSymbol(source, name,parameter, 0,0);
  11443. ELSE
  11444. Size(source, ToMemoryUnits(module.system,parameter.offsetInBits));
  11445. END;
  11446. TypeEntry(source, parameter.type);
  11447. Info(source,"flags");
  11448. IF parameter.kind = SyntaxTree.VarParameter THEN
  11449. Set(source, {1});
  11450. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11451. Set(source,{2});
  11452. ELSE
  11453. Set(source, {});
  11454. END;
  11455. parameter := parameter.nextParameter;
  11456. INC(size);
  11457. END;
  11458. PatchArray(source,pc,size);
  11459. END ParameterArray;
  11460. PROCEDURE TypeEntry(source: IntermediateCode.Section; type: SyntaxTree.Type);
  11461. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11462. segmentedName, name: Basic.SegmentedName;
  11463. td: SyntaxTree.TypeDeclaration;
  11464. BEGIN
  11465. IF type # NIL THEN
  11466. type := type.resolved;
  11467. Info(source,"type class");
  11468. IF type IS SyntaxTree.PointerType THEN
  11469. Size(source, 1);
  11470. ELSIF type IS SyntaxTree.RecordType THEN
  11471. Size(source, 2);
  11472. ELSIF type IS SyntaxTree.NumberType THEN
  11473. Size(source, 3);
  11474. ELSE
  11475. Size(source, 0);
  11476. END;
  11477. Info(source, "type desc");
  11478. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).typeDeclaration # NIL) THEN
  11479. td := type(SyntaxTree.RecordType).typeDeclaration;
  11480. Global.GetSymbolSegmentedName(td,segmentedName);
  11481. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11482. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11483. ELSE
  11484. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11485. END;
  11486. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11487. Symbol(source, tir, 0, offset);
  11488. ELSE
  11489. Address(source, 0);
  11490. END;
  11491. ELSE
  11492. Size(source, 0);
  11493. Address(source, 0);
  11494. END;
  11495. END TypeEntry;
  11496. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11497. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11498. name: Basic.SegmentedName;
  11499. BEGIN
  11500. Array(source,pc,"Modules.FieldEntry");
  11501. Info(source, "FieldArray");
  11502. size :=0;
  11503. WHILE variable # NIL DO
  11504. Info(source,"name");
  11505. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11506. Info(source,"offset");
  11507. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11508. implementationVisitor.GetCodeSectionNameForSymbol(variable, name);
  11509. NamedSymbol(source, name,variable, 0,0);
  11510. ELSE
  11511. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11512. END;
  11513. TypeEntry(source, variable.type);
  11514. Info(source,"flags");
  11515. Set(source, {});
  11516. variable := variable.nextVariable;
  11517. INC(size);
  11518. END;
  11519. PatchArray(source,pc,size);
  11520. END VariableArray;
  11521. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11522. VAR pc: LONGINT; size: LONGINT;
  11523. segmentedName: Basic.SegmentedName;
  11524. BEGIN
  11525. Array(source,pc,"Modules.ProcedureEntry");
  11526. Info(source, "ProcedureArray");
  11527. size :=0;
  11528. WHILE procedure # NIL DO
  11529. IF ~procedure.isInline THEN
  11530. Info(source,"name");
  11531. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11532. implementationVisitor.GetCodeSectionNameForSymbol(procedure, segmentedName);
  11533. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11534. (* size *)
  11535. Size(source, 0);
  11536. (* parameters *)
  11537. ReflectParameters(source, procedure);
  11538. (* variables *)
  11539. ReflectVariables(source, procedure);
  11540. ReflectProcedures(source, procedure);
  11541. (* return type entry *)
  11542. TypeEntry(source, procedure.type(SyntaxTree.ProcedureType).returnType);
  11543. INC(size);
  11544. END;
  11545. procedure := procedure.nextProcedure;
  11546. END;
  11547. PatchArray(source,pc,size);
  11548. END ProcedureArray;
  11549. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11550. VAR recordType: SyntaxTree.RecordType;
  11551. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11552. section: Sections.Section; cellType: SyntaxTree.CellType;
  11553. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11554. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11555. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11556. sectionName: Basic.SectionName;
  11557. CONST MPO=-40000000H;
  11558. BEGIN
  11559. (*
  11560. TypeDesc* = POINTER TO RECORD
  11561. descSize: LONGINT;
  11562. sentinel: LONGINT; (* = MPO-4 *)
  11563. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11564. flags*: SET;
  11565. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11566. name*: Name;
  11567. END;
  11568. *)
  11569. (* source := module.sections.FindByName(...) *)
  11570. Global.GetSymbolSegmentedName(td,name);
  11571. Basic.AppendToSegmentedName(name,".@Info");
  11572. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11573. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11574. Address(source,MPO-4);
  11575. Info(source, "type tag pointer");
  11576. Symbol( source, tag, offset, 0);
  11577. Info(source, "type flags");
  11578. flags := {};
  11579. IF isProtected THEN INCL(flags,31) END;
  11580. Set( source, flags);
  11581. Info(source, "pointer to module");
  11582. moduleSection := ModuleSection();
  11583. Symbol( source, moduleSection, moduleSection.pc,0);
  11584. Info(source, "type name");
  11585. i := 0;
  11586. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11587. (*
  11588. Global.GetSymbolSegmentedName(td,name);
  11589. Basic.SegmentedNameToString(name, sectionName);
  11590. *)
  11591. Name(source,sectionName);
  11592. source.SetReferenced(FALSE);
  11593. ReflectVariables(source, td);
  11594. ReflectProcedures(source, td);
  11595. RETURN source;
  11596. END NewTypeDescriptorInfo;
  11597. PROCEDURE NewTypeDescriptor;
  11598. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11599. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11600. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11601. numberPointers: LONGINT; padding, i: LONGINT;
  11602. CONST MPO=-40000000H;
  11603. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11604. VAR i: LONGINT;
  11605. PROCEDURE Td(record: SyntaxTree.RecordType);
  11606. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11607. BEGIN
  11608. IF record # NIL THEN
  11609. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11610. baseTD := record.typeDeclaration;
  11611. Global.GetSymbolSegmentedName(baseTD,name);
  11612. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11613. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11614. ELSE
  11615. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11616. END;
  11617. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11618. Symbol(source, tir, 0, offset);
  11619. IF reverse THEN Td(record.GetBaseRecord()) END;
  11620. END;
  11621. END Td;
  11622. BEGIN
  11623. Info(source, "tag table");
  11624. baseRecord := recordType;
  11625. i := 0;
  11626. WHILE baseRecord # NIL DO
  11627. INC(i);
  11628. baseRecord := baseRecord.GetBaseRecord();
  11629. END;
  11630. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11631. IF ~reverse THEN Td(recordType) END;
  11632. WHILE i < size DO
  11633. Address(source,0);
  11634. INC(i);
  11635. END;
  11636. IF reverse THEN Td(recordType) END;
  11637. END TdTable;
  11638. PROCEDURE MethodTable(reverse: BOOLEAN);
  11639. VAR i,methods: LONGINT;
  11640. BEGIN
  11641. Info(source, "method table");
  11642. IF recordType # NIL THEN
  11643. methods := recordType.recordScope.numberMethods;
  11644. IF reverse THEN
  11645. FOR i := methods-1 TO 0 BY -1 DO
  11646. procedure := recordType.recordScope.FindMethod(i);
  11647. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  11648. NamedSymbol(source, name,procedure, 0,0);
  11649. END;
  11650. ELSE
  11651. FOR i := 0 TO methods-1 DO
  11652. procedure := recordType.recordScope.FindMethod(i);
  11653. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  11654. NamedSymbol(source, name,procedure, 0,0);
  11655. END;
  11656. END;
  11657. END;
  11658. END MethodTable;
  11659. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11660. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11661. BEGIN
  11662. Info(source, "method table");
  11663. baseRecord := recordType;
  11664. WHILE baseRecord.baseType # NIL DO
  11665. baseRecord := baseRecord.GetBaseRecord ();
  11666. END;
  11667. GetRecordTypeName (baseRecord, name);
  11668. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11669. IF name = stackFrame THEN
  11670. start := 0;
  11671. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11672. baseRecord := recordType;
  11673. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11674. baseRecord := baseRecord.GetBaseRecord ();
  11675. END;
  11676. IF baseRecord # NIL THEN
  11677. GetRecordTypeName (baseRecord, name);
  11678. IF pointer & ~baseRecord.isObject THEN
  11679. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11680. END;
  11681. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11682. ELSIF recordType.isObject THEN
  11683. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11684. ELSIF pointer THEN
  11685. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11686. ELSE
  11687. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11688. END;
  11689. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11690. Symbol(source, tir, 0, 0);
  11691. start := 0;
  11692. baseRecord := recordType;
  11693. WHILE (baseRecord # NIL) DO
  11694. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11695. baseRecord := baseRecord.GetBaseRecord ();
  11696. END;
  11697. ELSE
  11698. (* explicit trace method: *)
  11699. procedure := recordType.recordScope.FindMethod(0);
  11700. IF ~procedure.isFinalizer THEN
  11701. Global.GetSymbolSegmentedName(procedure, name);
  11702. NamedSymbol(source, name,procedure, 0,0);
  11703. END;
  11704. start := 1;
  11705. END;
  11706. IF (name # stackFrame) & recordType.isObject THEN
  11707. baseRecord := recordType;
  11708. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11709. baseRecord := baseRecord.GetBaseRecord ();
  11710. END;
  11711. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11712. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11713. ELSE
  11714. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11715. END;
  11716. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11717. Symbol(source, tir, 0, 0);
  11718. END;
  11719. methods := recordType.recordScope.numberMethods;
  11720. FOR i := start TO methods-1 DO
  11721. procedure := recordType.recordScope.FindMethod(i);
  11722. IF ~procedure.isFinalizer THEN
  11723. Global.GetSymbolSegmentedName(procedure, name);
  11724. NamedSymbol(source, name,procedure, 0,0);
  11725. END;
  11726. END;
  11727. END CooperativeMethodTable;
  11728. BEGIN
  11729. Global.GetSymbolSegmentedName(td,name);
  11730. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11731. source.SetExported(IsExported(td));
  11732. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11733. IF implementationVisitor.backend.cooperative THEN
  11734. base := NIL;
  11735. baseRecord := recordType.GetBaseRecord();
  11736. IF baseRecord # NIL THEN
  11737. baseTD := baseRecord.typeDeclaration;
  11738. END;
  11739. IF ~recordType.isObject THEN
  11740. Info(source, "parent");
  11741. IF baseRecord # NIL THEN
  11742. Global.GetSymbolSegmentedName(baseTD,name);
  11743. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11744. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11745. ELSE
  11746. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11747. END;
  11748. Symbol(source, tir, 0, 0);
  11749. ELSE
  11750. Address(source,0);
  11751. END;
  11752. Info(source, "record size");
  11753. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11754. source.SetReferenced(FALSE);
  11755. CooperativeMethodTable(FALSE);
  11756. base := source;
  11757. Global.GetSymbolSegmentedName(td,name);
  11758. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11759. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11760. source.SetExported(IsExported(td));
  11761. source.SetReferenced(FALSE);
  11762. END;
  11763. Info(source, "parent");
  11764. IF baseRecord # NIL THEN
  11765. Global.GetSymbolSegmentedName(baseTD,name);
  11766. sym := baseTD;
  11767. IF ~recordType.isObject THEN
  11768. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11769. sym := NIL;
  11770. END;
  11771. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11772. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11773. ELSE
  11774. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11775. END;
  11776. Symbol(source, tir, 0, 0);
  11777. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11778. Address(source,0);
  11779. ELSE
  11780. IF recordType.isObject THEN
  11781. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11782. ELSE
  11783. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11784. END;
  11785. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11786. Symbol(source, tir, 0, 0);
  11787. END;
  11788. Info(source, "base record descriptor");
  11789. Symbol(source, base, 0, 0);
  11790. CooperativeMethodTable(TRUE);
  11791. source.SetReferenced(FALSE);
  11792. IF recordType.hasPointers THEN
  11793. IF ~HasExplicitTraceMethod (recordType) THEN
  11794. implementationVisitor.CreateTraceMethod(recordType);
  11795. END;
  11796. implementationVisitor.CreateResetProcedure(recordType);
  11797. implementationVisitor.CreateAssignProcedure(recordType);
  11798. END;
  11799. ELSIF ~simple THEN
  11800. (*
  11801. MethodEnd = MPO
  11802. ---
  11803. methods (# methods)
  11804. ---
  11805. tags (16)
  11806. ---
  11807. TypeDesc = TypeInfoAdr
  11808. ---
  11809. td adr ---> rec size
  11810. ----
  11811. pointer offsets
  11812. ----
  11813. (padding)
  11814. -----
  11815. empty [2 addresses aligned]
  11816. empty
  11817. empty
  11818. numPtrs
  11819. ---
  11820. pointer offsets
  11821. ---
  11822. *)
  11823. Info(source, "MethodEnd = MPO");
  11824. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11825. source(IntermediateCode.Section).Emit(Data(-1,op));
  11826. MethodTable(TRUE);
  11827. TdTable(TypeTags, TRUE);
  11828. Info(source, "type descriptor info pointer");
  11829. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11830. IF (cellType # NIL) THEN
  11831. IF cellType.sizeInBits < 0 THEN
  11832. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11833. END;
  11834. Info(source, "cell size");
  11835. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11836. ELSE
  11837. Info(source, "record size");
  11838. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11839. END;
  11840. Info(source, "pointer offsets pointer");
  11841. padding := 1- source.pc MOD 2;
  11842. Symbol(source, source, source.pc+1+padding,0);
  11843. IF padding >0 THEN
  11844. Info(source, "padding");
  11845. FOR i := 1 TO padding DO Address(source,0) END;
  11846. END;
  11847. IF cellType # NIL THEN
  11848. PointerArray(source, cellType.cellScope, numberPointers);
  11849. ELSE
  11850. PointerArray(source, recordType.recordScope, numberPointers);
  11851. END;
  11852. ELSE
  11853. (*
  11854. simple:
  11855. td adr --> size
  11856. tag(1)
  11857. tag(2)
  11858. tag(3)
  11859. methods ->
  11860. *)
  11861. Info(source, "record size");
  11862. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11863. TdTable(TypeTags, FALSE);
  11864. MethodTable(FALSE);
  11865. source.SetReferenced(FALSE);
  11866. END;
  11867. END NewTypeDescriptor;
  11868. BEGIN
  11869. x := x.resolved;
  11870. IF (x IS SyntaxTree.PointerType) THEN
  11871. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11872. END;
  11873. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11874. recordType := x(SyntaxTree.RecordType);
  11875. td := x.typeDeclaration;
  11876. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11877. ASSERT(td # NIL);
  11878. section := module.allSections.FindBySymbol(td); (* TODO *)
  11879. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11880. IF implementationVisitor.newObjectFile THEN
  11881. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11882. NewTypeDescriptor
  11883. END;
  11884. ELSE
  11885. (* data section in intermediate code *)
  11886. Global.GetSymbolSegmentedName(td,name);
  11887. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  11888. Basic.SuffixSegmentedName (name, module.module.name);
  11889. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11890. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11891. tir.Emit(Data(-1,op));
  11892. END;
  11893. END;
  11894. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11895. cellType := x(SyntaxTree.CellType);
  11896. td := x.typeDeclaration;
  11897. section := module.allSections.FindBySymbol(td); (* TODO *)
  11898. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11899. IF implementationVisitor.newObjectFile THEN
  11900. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11901. NewTypeDescriptor
  11902. END;
  11903. END;
  11904. END;
  11905. END
  11906. END CheckTypeDeclaration
  11907. END MetaDataGenerator;
  11908. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11909. VAR
  11910. trace-: BOOLEAN;
  11911. traceString-: SyntaxTree.IdentifierString;
  11912. traceModuleName-: SyntaxTree.IdentifierString;
  11913. newObjectFile-: BOOLEAN;
  11914. profile-: BOOLEAN;
  11915. noRuntimeChecks: BOOLEAN;
  11916. simpleMetaData-: BOOLEAN;
  11917. noAsserts: BOOLEAN;
  11918. optimize-: BOOLEAN;
  11919. cooperative-: BOOLEAN;
  11920. preregisterStatic-: BOOLEAN;
  11921. dump-: Basic.Writer;
  11922. cellsAreObjects: BOOLEAN;
  11923. PROCEDURE &InitIntermediateBackend*;
  11924. BEGIN
  11925. simpleMetaData := FALSE;
  11926. newObjectFile := FALSE;
  11927. InitBackend;
  11928. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11929. SetTraceModuleName(DefaultTraceModuleName);
  11930. END InitIntermediateBackend;
  11931. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11932. VAR
  11933. declarationVisitor: DeclarationVisitor;
  11934. implementationVisitor: ImplementationVisitor;
  11935. module: Sections.Module;
  11936. name, platformName: SyntaxTree.IdentifierString;
  11937. meta: MetaDataGenerator;
  11938. BEGIN
  11939. ResetError;
  11940. Global.GetSymbolName(x,name);
  11941. NEW(module,x,system); (* backend structures *)
  11942. Global.GetModuleName(x, name);
  11943. module.SetModuleName(name);
  11944. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11945. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11946. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11947. declarationVisitor.Module(x,module);
  11948. IF newObjectFile & ~meta.simple THEN
  11949. meta.Module(implementationVisitor.moduleBodySection);
  11950. END;
  11951. GetDescription(platformName);
  11952. module.SetPlatformName(platformName);
  11953. RETURN module
  11954. END GenerateIntermediate;
  11955. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11956. BEGIN RETURN TRUE
  11957. END SupportedImmediate;
  11958. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11959. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11960. END ProcessSyntaxTreeModule;
  11961. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11962. VAR
  11963. result: Sections.Module;
  11964. traceName: Basic.MessageString;
  11965. BEGIN
  11966. ASSERT(intermediateCodeModule IS Sections.Module);
  11967. result := intermediateCodeModule(Sections.Module);
  11968. IF trace THEN
  11969. traceName := "intermediate code trace: ";
  11970. Strings.Append(traceName,traceString);
  11971. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11972. IF (traceString="") OR (traceString="*") THEN
  11973. result.Dump(dump);
  11974. dump.Update
  11975. ELSE
  11976. Sections.DumpFiltered(dump, result, traceString);
  11977. END
  11978. END;
  11979. RETURN result
  11980. END ProcessIntermediateCodeModule;
  11981. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11982. BEGIN instructionSet := "Intermediate";
  11983. END GetDescription;
  11984. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11985. BEGIN
  11986. SELF.newObjectFile := newObjectFile;
  11987. SELF.simpleMetaData := simpleMetaData;
  11988. END SetNewObjectFile;
  11989. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11990. BEGIN COPY(name, traceModuleName)
  11991. END SetTraceModuleName;
  11992. PROCEDURE DefineOptions(options: Options.Options);
  11993. BEGIN
  11994. DefineOptions^(options);
  11995. options.Add(0X,"trace",Options.String);
  11996. options.Add(0X,"runtime",Options.String);
  11997. options.Add(0X,"newObjectFile",Options.Flag);
  11998. options.Add(0X,"traceModule",Options.String);
  11999. options.Add(0X,"profile",Options.Flag);
  12000. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12001. options.Add(0X,"noAsserts",Options.Flag);
  12002. options.Add(0X,"metaData",Options.String);
  12003. options.Add('o',"optimize", Options.Flag);
  12004. options.Add(0X,"preregisterStatic", Options.Flag);
  12005. options.Add(0X,"cellsAreObjects", Options.Flag);
  12006. END DefineOptions;
  12007. PROCEDURE GetOptions(options: Options.Options);
  12008. VAR name,string: SyntaxTree.IdentifierString;
  12009. BEGIN
  12010. GetOptions^(options);
  12011. trace := options.GetString("trace",traceString);
  12012. profile := options.GetFlag("profile");
  12013. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12014. noAsserts := options.GetFlag("noAsserts");
  12015. cooperative := options.GetFlag("cooperative");
  12016. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  12017. IF cooperative THEN
  12018. SetRuntimeModuleName("CPU") END
  12019. END;
  12020. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12021. simpleMetaData := TRUE
  12022. END;
  12023. IF options.GetString("metaData",string) THEN
  12024. IF string = "simple" THEN simpleMetaData := TRUE
  12025. ELSIF string ="full" THEN simpleMetaData := FALSE
  12026. END;
  12027. END;
  12028. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  12029. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12030. optimize := options.GetFlag("optimize");
  12031. preregisterStatic := options.GetFlag("preregisterStatic");
  12032. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12033. END GetOptions;
  12034. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  12035. BEGIN RETURN SymbolFileFormat.Get()
  12036. END DefaultSymbolFileFormat;
  12037. END IntermediateBackend;
  12038. (* ----------------------------------- register allocation ------------------------------------- *)
  12039. (* register mapping scheme
  12040. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12041. spill offset
  12042. part(n) --> ticket <--> physical register
  12043. spill offset
  12044. *)
  12045. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12046. emptyOperand: IntermediateCode.Operand;
  12047. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12048. statCoopResetVariables: LONGINT;
  12049. statCoopModifyAssignments: LONGINT;
  12050. modifyAssignmentsPC : LONGINT;
  12051. statCoopNilCheck: LONGINT;
  12052. statCoopSwitch: LONGINT;
  12053. statCoopAssignProcedure: LONGINT;
  12054. statCoopTraceMethod: LONGINT;
  12055. statCoopResetProcedure: LONGINT;
  12056. statCoopTraceModule: LONGINT;
  12057. PROCEDURE ResetStatistics*;
  12058. BEGIN
  12059. statCoopResetVariables := 0;
  12060. statCoopModifyAssignments := 0;
  12061. statCoopNilCheck:= 0;
  12062. statCoopSwitch:= 0;
  12063. statCoopAssignProcedure:= 0;
  12064. statCoopTraceMethod:= 0;
  12065. statCoopResetProcedure:= 0;
  12066. statCoopTraceModule:= 0;
  12067. END ResetStatistics;
  12068. PROCEDURE Statistics*;
  12069. BEGIN
  12070. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12071. TRACE(statCoopNilCheck, statCoopSwitch);
  12072. TRACE(statCoopAssignProcedure,
  12073. statCoopTraceMethod,
  12074. statCoopResetProcedure,
  12075. statCoopTraceModule)
  12076. END Statistics;
  12077. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12078. VAR h: LONGINT;
  12079. BEGIN
  12080. WHILE b # 0 DO
  12081. h := a MOD b;
  12082. a := b;
  12083. b := h;
  12084. END;
  12085. RETURN a
  12086. END GCD;
  12087. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12088. BEGIN
  12089. RETURN a*b DIV GCD(a,b)
  12090. END SCM;
  12091. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12092. BEGIN
  12093. (*TRACE(a,b);*)
  12094. IF a = 0 THEN RETURN b
  12095. ELSIF b = 0 THEN RETURN a
  12096. ELSE RETURN SCM(a,b)
  12097. END;
  12098. END CommonAlignment;
  12099. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12100. BEGIN
  12101. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12102. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12103. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12104. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12105. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12106. END
  12107. END PassBySingleReference;
  12108. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12109. BEGIN
  12110. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12111. END PassInRegister;
  12112. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12113. VAR new: RegisterEntry;
  12114. BEGIN
  12115. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12116. IF queue = NIL THEN
  12117. queue := new
  12118. ELSE
  12119. new.next := queue;
  12120. IF queue#NIL THEN queue.prev := new END;
  12121. queue := new
  12122. END;
  12123. END AddRegisterEntry;
  12124. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12125. VAR this: RegisterEntry;
  12126. BEGIN
  12127. this := queue;
  12128. WHILE (this # NIL) & (this.register # register) DO
  12129. this := this.next;
  12130. END;
  12131. IF this = NIL THEN
  12132. RETURN FALSE
  12133. END;
  12134. ASSERT(this # NIL);
  12135. IF this = queue THEN queue := queue.next END;
  12136. IF this.prev # NIL THEN this.prev.next := this.next END;
  12137. IF this.next # NIL THEN this.next.prev := this.prev END;
  12138. RETURN TRUE
  12139. END RemoveRegisterEntry;
  12140. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12141. BEGIN ASSERT(cond);
  12142. END Assert;
  12143. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12144. BEGIN
  12145. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12146. END ReusableRegister;
  12147. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12148. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12149. BEGIN
  12150. procedure := moduleScope.bodyProcedure;
  12151. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12152. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12153. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  12154. procedure.SetScope(moduleScope);
  12155. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  12156. procedure.SetAccess(SyntaxTree.Hidden);
  12157. moduleScope.SetBodyProcedure(procedure);
  12158. moduleScope.AddProcedure(procedure);
  12159. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  12160. END;
  12161. END EnsureBodyProcedure;
  12162. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12163. VAR import: SyntaxTree.Import;
  12164. selfName: SyntaxTree.IdentifierString;
  12165. module: SyntaxTree.Module;
  12166. BEGIN
  12167. scope.ownerModule.GetName(selfName);
  12168. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12169. module := scope.ownerModule
  12170. ELSE
  12171. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12172. IF import = NIL THEN
  12173. RETURN NIL
  12174. ELSIF import.module = NIL THEN
  12175. RETURN NIL
  12176. ELSE module := import.module
  12177. END;
  12178. END;
  12179. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12180. END GetSymbol;
  12181. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12182. BEGIN
  12183. op.mode := mode;
  12184. IntermediateCode.InitOperand(op.op);
  12185. IntermediateCode.InitOperand(op.tag);
  12186. IntermediateCode.InitOperand(op.extra);
  12187. op.dimOffset := 0;
  12188. END InitOperand;
  12189. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12190. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12191. BEGIN RETURN IntermediateCode.GetType(system, type)
  12192. END GetType;
  12193. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12194. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12195. BEGIN
  12196. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12197. (*
  12198. UniqueId(name,module,name,adr);
  12199. *)
  12200. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  12201. constant.SetValue(value);
  12202. constant.SetAccess(SyntaxTree.Hidden);
  12203. module.moduleScope.AddConstant(constant);
  12204. constant.SetScope(module.moduleScope);
  12205. RETURN constant
  12206. END BuildConstant;
  12207. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12208. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12209. BEGIN
  12210. variable := scope.firstVariable;
  12211. WHILE variable # NIL DO
  12212. IF variable.NeedsTrace() THEN
  12213. RETURN TRUE;
  12214. END;
  12215. variable := variable.nextVariable;
  12216. END;
  12217. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12218. WHILE parameter # NIL DO
  12219. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12220. RETURN TRUE;
  12221. END;
  12222. parameter := parameter.nextParameter;
  12223. END;
  12224. RETURN FALSE;
  12225. END HasPointers;
  12226. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12227. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  12228. END IsVariableParameter;
  12229. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12230. VAR parameter: SyntaxTree.Parameter;
  12231. BEGIN
  12232. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12233. WHILE parameter # NIL DO
  12234. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12235. IF parameter.movable THEN RETURN TRUE END;
  12236. parameter := parameter.nextParameter;
  12237. END;
  12238. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12239. END HasVariableParameters;
  12240. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12241. BEGIN
  12242. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12243. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12244. END HasExplicitTraceMethod;
  12245. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12246. BEGIN
  12247. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12248. IF (expression IS SyntaxTree.IntegerValue) THEN
  12249. val := expression(SyntaxTree.IntegerValue).value;
  12250. RETURN TRUE
  12251. ELSE
  12252. RETURN FALSE
  12253. END;
  12254. END IsIntegerConstant;
  12255. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12256. BEGIN
  12257. IF val <= 0 THEN RETURN FALSE END;
  12258. exp := 0;
  12259. WHILE ~ODD(val) DO
  12260. val := val DIV 2;
  12261. INC(exp)
  12262. END;
  12263. RETURN val = 1
  12264. END PowerOf2;
  12265. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12266. VAR procedure: SyntaxTree.Procedure;
  12267. BEGIN
  12268. procedure := record.recordScope.constructor;
  12269. IF procedure = NIL THEN
  12270. record := record.GetBaseRecord();
  12271. IF record # NIL THEN
  12272. procedure := GetConstructor(record)
  12273. END;
  12274. END;
  12275. RETURN procedure;
  12276. END GetConstructor;
  12277. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12278. BEGIN
  12279. value := SHORT(op.intValue);
  12280. RETURN op.mode = IntermediateCode.ModeImmediate;
  12281. END IsIntegerImmediate;
  12282. (** whether a type strictily is a pointer to record or object type
  12283. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12284. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12285. BEGIN
  12286. IF type = NIL THEN
  12287. RETURN FALSE
  12288. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12289. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12290. ELSE
  12291. RETURN FALSE
  12292. END
  12293. END IsStrictlyPointerToRecord;
  12294. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12295. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12296. END IsUnsafePointer;
  12297. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12298. BEGIN type := type.resolved;
  12299. IF type IS SyntaxTree.PointerType THEN
  12300. type := type(SyntaxTree.PointerType).pointerBase;
  12301. type := type.resolved;
  12302. IF type IS SyntaxTree.RecordType THEN
  12303. recordType := type(SyntaxTree.RecordType);
  12304. RETURN TRUE
  12305. ELSE
  12306. RETURN FALSE
  12307. END
  12308. ELSIF type IS SyntaxTree.RecordType THEN
  12309. recordType := type(SyntaxTree.RecordType);
  12310. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12311. ELSIF type IS SyntaxTree.ObjectType THEN
  12312. RETURN TRUE
  12313. ELSIF type IS SyntaxTree.AnyType THEN
  12314. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12315. ELSE
  12316. RETURN FALSE
  12317. END;
  12318. END IsPointerToRecord;
  12319. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12320. BEGIN
  12321. type := type.resolved;
  12322. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12323. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12324. END IsArrayOfSystemByte;
  12325. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12326. BEGIN
  12327. IF type = NIL THEN RETURN FALSE END;
  12328. type := type.resolved;
  12329. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12330. END IsOpenArray;
  12331. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12332. BEGIN
  12333. IF type = NIL THEN RETURN FALSE END;
  12334. type := type.resolved;
  12335. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12336. END IsSemiDynamicArray;
  12337. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12338. BEGIN
  12339. IF type = NIL THEN RETURN FALSE END;
  12340. type := type.resolved;
  12341. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12342. END IsStaticArray;
  12343. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12344. VAR size: LONGINT;
  12345. BEGIN
  12346. size := 1;
  12347. WHILE (IsStaticArray(type)) DO
  12348. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12349. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12350. END;
  12351. RETURN size;
  12352. END StaticArrayNumElements;
  12353. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12354. BEGIN
  12355. WHILE (IsStaticArray(type)) DO
  12356. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12357. END;
  12358. RETURN type;
  12359. END StaticArrayBaseType;
  12360. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12361. BEGIN
  12362. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12363. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12364. END;
  12365. RETURN type;
  12366. END ArrayBaseType;
  12367. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12368. BEGIN
  12369. IF type = NIL THEN RETURN FALSE END;
  12370. type := type.resolved;
  12371. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12372. END IsDelegate;
  12373. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12374. VAR i: LONGINT;
  12375. BEGIN
  12376. i := 0; type := type.resolved;
  12377. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12378. INC(i);
  12379. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12380. END;
  12381. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12382. INC(i);
  12383. type := type(SyntaxTree.MathArrayType).arrayBase;
  12384. IF type # NIL THEN type := type.resolved END;
  12385. END;
  12386. RETURN i
  12387. END DynamicDim;
  12388. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12389. BEGIN
  12390. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12391. type := type(SyntaxTree.ArrayType).arrayBase;
  12392. END;
  12393. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12394. type := type(SyntaxTree.MathArrayType).arrayBase;
  12395. END;
  12396. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12397. END StaticSize;
  12398. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12399. BEGIN
  12400. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12401. END IsImmediate;
  12402. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12403. BEGIN
  12404. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12405. END IsAddress;
  12406. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12407. BEGIN
  12408. RETURN (x.mode = IntermediateCode.ModeRegister);
  12409. END IsRegister;
  12410. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12411. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12412. BEGIN
  12413. typeDeclaration := recordType.typeDeclaration;
  12414. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12415. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12416. END GetRecordTypeName;
  12417. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12418. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12419. BEGIN
  12420. parSize := 0;
  12421. IF StructuredReturnType(procedureType) THEN
  12422. parameter := procedureType.returnParameter;
  12423. INC(parSize,system.SizeOfParameter(parameter));
  12424. parSize := parSize + (-parSize) MOD system.addressSize;
  12425. END;
  12426. parameter :=procedureType.lastParameter;
  12427. WHILE (parameter # NIL) DO
  12428. INC(parSize,system.SizeOfParameter(parameter));
  12429. parSize := parSize + (-parSize) MOD system.addressSize;
  12430. parameter := parameter.prevParameter;
  12431. END;
  12432. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12433. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12434. RETURN ToMemoryUnits(system,parSize)
  12435. END ParametersSize;
  12436. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12437. BEGIN
  12438. IF type = NIL THEN RETURN FALSE
  12439. ELSE
  12440. type := type.resolved;
  12441. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12442. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12443. END
  12444. END ReturnedAsParameter;
  12445. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12446. BEGIN
  12447. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12448. END StructuredReturnType;
  12449. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12450. BEGIN
  12451. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12452. END IsNested;
  12453. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12454. BEGIN
  12455. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12456. scope := scope.outerScope;
  12457. END;
  12458. RETURN scope # NIL;
  12459. END InCellScope;
  12460. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12461. BEGIN
  12462. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12463. RETURN 0
  12464. ELSE
  12465. *)
  12466. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12467. (*END;*)
  12468. END ProcedureParametersSize;
  12469. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12470. VAR dataUnit: LONGINT;
  12471. BEGIN dataUnit := system.dataUnit;
  12472. ASSERT(size MOD system.dataUnit = 0);
  12473. RETURN size DIV system.dataUnit
  12474. END ToMemoryUnits;
  12475. PROCEDURE Get*(): Backend.Backend;
  12476. VAR backend: IntermediateBackend;
  12477. BEGIN NEW(backend); RETURN backend
  12478. END Get;
  12479. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12480. VAR instruction: IntermediateCode.Instruction;
  12481. BEGIN
  12482. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12483. RETURN instruction
  12484. END Nop;
  12485. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12486. VAR instruction: IntermediateCode.Instruction;
  12487. BEGIN
  12488. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12489. RETURN instruction
  12490. END Mov;
  12491. (* like Mov but ensures that no new register will be allocated for dest *)
  12492. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12493. VAR instruction: IntermediateCode.Instruction;
  12494. BEGIN
  12495. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12496. RETURN instruction
  12497. END MovReplace;
  12498. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12499. VAR instruction: IntermediateCode.Instruction;
  12500. BEGIN
  12501. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12502. RETURN instruction
  12503. END Conv;
  12504. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  12505. BEGIN
  12506. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  12507. END SysvABI;
  12508. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  12509. BEGIN
  12510. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  12511. END SysvABIorWINAPI;
  12512. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12513. VAR instruction: IntermediateCode.Instruction;
  12514. BEGIN
  12515. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12516. RETURN instruction
  12517. END Call;
  12518. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12519. VAR op1, op2: IntermediateCode.Operand;
  12520. VAR instruction: IntermediateCode.Instruction;
  12521. BEGIN
  12522. IntermediateCode.InitNumber(op1,pcOffset);
  12523. IntermediateCode.InitNumber(op2,callingConvention);
  12524. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12525. RETURN instruction
  12526. END Exit;
  12527. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12528. VAR instruction: IntermediateCode.Instruction;
  12529. BEGIN
  12530. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12531. RETURN instruction
  12532. END Return;
  12533. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12534. VAR instruction: IntermediateCode.Instruction;
  12535. BEGIN
  12536. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12537. RETURN instruction
  12538. END Result;
  12539. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12540. VAR op1: IntermediateCode.Operand;
  12541. VAR instruction: IntermediateCode.Instruction;
  12542. BEGIN
  12543. IntermediateCode.InitNumber(op1,nr);
  12544. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12545. RETURN instruction
  12546. END Trap;
  12547. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12548. VAR instruction: IntermediateCode.Instruction;
  12549. BEGIN
  12550. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12551. RETURN instruction
  12552. END Br;
  12553. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12554. VAR instruction: IntermediateCode.Instruction;
  12555. BEGIN
  12556. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12557. RETURN instruction
  12558. END Breq;
  12559. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12560. VAR instruction: IntermediateCode.Instruction;
  12561. BEGIN
  12562. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12563. RETURN instruction
  12564. END Brne;
  12565. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12566. VAR instruction: IntermediateCode.Instruction;
  12567. BEGIN
  12568. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12569. RETURN instruction
  12570. END Brge;
  12571. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12572. VAR instruction: IntermediateCode.Instruction;
  12573. BEGIN
  12574. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12575. RETURN instruction
  12576. END Brlt;
  12577. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12578. VAR instruction: IntermediateCode.Instruction;
  12579. BEGIN
  12580. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12581. RETURN instruction
  12582. END Pop;
  12583. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12584. VAR instruction: IntermediateCode.Instruction;
  12585. BEGIN
  12586. ASSERT(op.mode # IntermediateCode.Undefined);
  12587. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12588. RETURN instruction
  12589. END Push;
  12590. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12591. VAR instruction: IntermediateCode.Instruction;
  12592. BEGIN
  12593. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12594. RETURN instruction
  12595. END Neg;
  12596. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12597. VAR instruction: IntermediateCode.Instruction;
  12598. BEGIN
  12599. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12600. RETURN instruction
  12601. END Not;
  12602. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12603. VAR instruction: IntermediateCode.Instruction;
  12604. BEGIN
  12605. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12606. RETURN instruction
  12607. END Abs;
  12608. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12609. VAR instruction: IntermediateCode.Instruction;
  12610. BEGIN
  12611. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12612. RETURN instruction
  12613. END Mul;
  12614. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12615. VAR instruction: IntermediateCode.Instruction;
  12616. BEGIN
  12617. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12618. RETURN instruction
  12619. END Div;
  12620. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12621. VAR instruction: IntermediateCode.Instruction;
  12622. BEGIN
  12623. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12624. RETURN instruction
  12625. END Mod;
  12626. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12627. VAR instruction: IntermediateCode.Instruction;
  12628. BEGIN
  12629. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12630. RETURN instruction
  12631. END Sub;
  12632. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12633. VAR instruction: IntermediateCode.Instruction;
  12634. BEGIN
  12635. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12636. RETURN instruction
  12637. END Add;
  12638. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12639. VAR instruction: IntermediateCode.Instruction;
  12640. BEGIN
  12641. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12642. RETURN instruction
  12643. END And;
  12644. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12645. VAR instruction: IntermediateCode.Instruction;
  12646. BEGIN
  12647. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12648. RETURN instruction
  12649. END Or;
  12650. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12651. VAR instruction: IntermediateCode.Instruction;
  12652. BEGIN
  12653. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12654. RETURN instruction
  12655. END Xor;
  12656. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12657. VAR instruction: IntermediateCode.Instruction;
  12658. BEGIN
  12659. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12660. RETURN instruction
  12661. END Shl;
  12662. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12663. VAR instruction: IntermediateCode.Instruction;
  12664. BEGIN
  12665. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12666. RETURN instruction
  12667. END Shr;
  12668. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12669. VAR instruction: IntermediateCode.Instruction;
  12670. BEGIN
  12671. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12672. RETURN instruction
  12673. END Rol;
  12674. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12675. VAR instruction: IntermediateCode.Instruction;
  12676. BEGIN
  12677. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12678. RETURN instruction
  12679. END Ror;
  12680. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12681. VAR instruction: IntermediateCode.Instruction;
  12682. BEGIN
  12683. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12684. RETURN instruction
  12685. END Cas;
  12686. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12687. VAR instruction: IntermediateCode.Instruction;
  12688. BEGIN
  12689. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12690. RETURN instruction
  12691. END Copy;
  12692. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12693. VAR instruction: IntermediateCode.Instruction;
  12694. BEGIN
  12695. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12696. RETURN instruction
  12697. END Fill;
  12698. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12699. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12700. BEGIN
  12701. string := IntermediateCode.String(s);
  12702. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12703. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12704. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12705. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12706. RETURN instruction
  12707. END Asm;
  12708. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12709. VAR instruction: IntermediateCode.Instruction;
  12710. BEGIN
  12711. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12712. RETURN instruction
  12713. END Data;
  12714. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12715. VAR instruction: IntermediateCode.Instruction;
  12716. BEGIN
  12717. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12718. IntermediateCode.SetSubType(instruction, subtype);
  12719. RETURN instruction
  12720. END SpecialInstruction;
  12721. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12722. VAR op1: IntermediateCode.Operand;
  12723. VAR instruction: IntermediateCode.Instruction;
  12724. BEGIN
  12725. (*! generate a warning if size exceeds a certain limit *)
  12726. (*
  12727. ASSERT(bytes < 1000000); (* sanity check *)
  12728. *)
  12729. ASSERT(0 <= units); (* sanity check *)
  12730. IntermediateCode.InitNumber(op1,units);
  12731. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12732. RETURN instruction
  12733. END Reserve;
  12734. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12735. VAR op1: IntermediateCode.Operand;
  12736. VAR instruction: IntermediateCode.Instruction;
  12737. BEGIN
  12738. IntermediateCode.InitNumber(op1,position);
  12739. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12740. RETURN instruction
  12741. END LabelInstruction;
  12742. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12743. VAR pc: LONGINT;
  12744. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12745. BEGIN
  12746. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12747. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12748. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12749. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12750. IF instr.op1.type.form = IntermediateCode.Float THEN
  12751. RETURN instr.op1.floatValue = op.floatValue
  12752. ELSE
  12753. RETURN instr.op1.intValue = op.intValue
  12754. END;
  12755. END ProvidesValue;
  12756. BEGIN
  12757. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12758. pc := 0;
  12759. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12760. INC(pc);
  12761. END;
  12762. IF pc = data.pc THEN
  12763. data.Emit(Data(-1,vop));
  12764. END;
  12765. RETURN pc
  12766. END EnterImmediate;
  12767. PROCEDURE Init;
  12768. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12769. BEGIN
  12770. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12771. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12772. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12773. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12774. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12775. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12776. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12777. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12778. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12779. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12780. IntermediateCode.InitOperand(emptyOperand);
  12781. FOR i := 0 TO NumberSystemCalls-1 DO
  12782. name := "@SystemCall";
  12783. Basic.AppendNumber(name,i);
  12784. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12785. END;
  12786. END Init;
  12787. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12788. BEGIN
  12789. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12790. END IsExported;
  12791. BEGIN
  12792. Init;
  12793. END FoxIntermediateBackend.
  12794. Compiler.Compile FoxIntermediateBackend.Mod ~