FoxIntermediateBackend.Mod 584 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685146861468714688146891469014691146921469314694146951469614697146981469914700147011470214703147041470514706147071470814709147101471114712147131471414715147161471714718147191472014721147221472314724147251472614727147281472914730147311473214733147341473514736147371473814739147401474114742147431474414745147461474714748147491475014751147521475314754147551475614757147581475914760147611476214763147641476514766147671476814769147701477114772147731477414775147761477714778147791478014781147821478314784147851478614787147881478914790147911479214793147941479514796147971479814799148001480114802148031480414805148061480714808148091481014811148121481314814148151481614817148181481914820148211482214823148241482514826148271482814829148301483114832148331483414835148361483714838148391484014841148421484314844148451484614847148481484914850148511485214853148541485514856148571485814859148601486114862148631486414865148661486714868148691487014871148721487314874148751487614877148781487914880148811488214883148841488514886148871488814889148901489114892148931489414895148961489714898148991490014901149021490314904149051490614907149081490914910149111491214913149141491514916149171491814919149201492114922149231492414925149261492714928149291493014931149321493314934149351493614937149381493914940149411494214943149441494514946149471494814949149501495114952149531495414955149561495714958149591496014961149621496314964149651496614967149681496914970149711497214973
  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, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, CRC;
  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. RethrowTrap* = 18; (* rethrow exception after unlock *)
  42. Trace = FALSE;
  43. TraceRegisterUsageCount=TRUE;
  44. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  45. (** system call numbers *)
  46. NumberSystemCalls* = 12;
  47. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  48. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  49. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  50. DefaultBuiltinsModuleName ="Builtins";
  51. DefaultTraceModuleName ="KernelLog";
  52. ChannelModuleName = "Channels";
  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. BasePointerTypeSize = 5;
  63. BaseArrayTypeSize = BasePointerTypeSize + 3;
  64. LengthOffset = BasePointerTypeSize + 0;
  65. DataOffset = BasePointerTypeSize + 1;
  66. DescriptorOffset = BasePointerTypeSize + 2;
  67. BaseRecordTypeSize = BasePointerTypeSize + 2;
  68. ActionOffset = BasePointerTypeSize + 0;
  69. MonitorOffset = BasePointerTypeSize + 1;
  70. BaseObjectTypeSize = BaseRecordTypeSize;
  71. ActionTypeSize = 3;
  72. MonitorTypeSize = 7;
  73. ProcessorOffset = BaseObjectTypeSize + 1;
  74. StackLimitOffset* = BaseObjectTypeSize + 3;
  75. QuantumOffset = BaseObjectTypeSize + 4;
  76. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  77. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  78. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  79. Size2Flag = 4; (* size = 2 *)
  80. Size3Flag = 5; (* size = 3 *)
  81. Size4Flag = 6; (* size = 4 *)
  82. Size5Flag = 7; (* size = 5 *)
  83. Size6Flag = 8; (* size = 6 *)
  84. Size7Flag = 9; (* size = 7 *)
  85. Size8Flag = 10; (* size = 8 *)
  86. ReflectionSupport = TRUE;
  87. (* Solution for identifying procedure descriptors on the stack and for being able to differentiate "old school" stack frames from the underlying operating system stack frames:
  88. push a procedure desriptor plus one to where the BP pointer would be located. The misalignment of the procedure descriptor makes it possible to identify that it is not
  89. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  90. *)
  91. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  92. ProtectModulesPointers = FALSE;
  93. CreateProcedureDescInfo = TRUE;
  94. WarningDynamicLoading = FALSE;
  95. SysvABI = {SyntaxTree.CCallingConvention};
  96. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.WinAPICallingConvention};
  97. TYPE
  98. Position=SyntaxTree.Position;
  99. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  100. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  101. Operand = RECORD
  102. mode: SHORTINT;
  103. op: IntermediateCode.Operand;
  104. tag: IntermediateCode.Operand;
  105. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  106. dimOffset: LONGINT;
  107. END;
  108. Fixup= POINTER TO RECORD
  109. pc: LONGINT;
  110. nextFixup: Fixup;
  111. END;
  112. WriteBackCall = POINTER TO RECORD
  113. call: SyntaxTree.ProcedureCallDesignator;
  114. next: WriteBackCall;
  115. END;
  116. Label= OBJECT
  117. VAR
  118. fixups: Fixup;
  119. section: IntermediateCode.Section;
  120. pc: LONGINT;
  121. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  122. BEGIN
  123. SELF.section := section; pc := -1;
  124. END InitLabel;
  125. PROCEDURE Resolve(pc: LONGINT);
  126. VAR at: LONGINT;
  127. BEGIN
  128. SELF.pc := pc;
  129. WHILE(fixups # NIL) DO
  130. at := fixups.pc;
  131. section.PatchAddress(at,pc);
  132. fixups := fixups.nextFixup;
  133. END;
  134. END Resolve;
  135. PROCEDURE AddFixup(at: LONGINT);
  136. VAR fixup: Fixup;
  137. BEGIN
  138. ASSERT(pc=-1);
  139. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  140. END AddFixup;
  141. END Label;
  142. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  143. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  144. VAR
  145. backend: IntermediateBackend;
  146. implementationVisitor: ImplementationVisitor;
  147. meta: MetaDataGenerator;
  148. system: Global.System;
  149. currentScope: SyntaxTree.Scope;
  150. module: Sections.Module;
  151. moduleSelf: SyntaxTree.Variable;
  152. dump: BOOLEAN;
  153. forceModuleBody: BOOLEAN;
  154. addressType: IntermediateCode.Type;
  155. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  156. BEGIN
  157. currentScope := NIL; module := NIL; moduleSelf := NIL;
  158. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  159. SELF.dump := dump;
  160. SELF.backend := backend;
  161. SELF.forceModuleBody := forceModuleBody;
  162. addressType := IntermediateCode.GetType(system,system.addressType)
  163. END Init;
  164. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  165. BEGIN
  166. backend.Error(module.module.sourceName, position, Streams.Invalid, s);
  167. END Error;
  168. PROCEDURE Type(x: SyntaxTree.Type);
  169. BEGIN
  170. VType(x);
  171. END Type;
  172. (** types **)
  173. PROCEDURE VisitBasicType*(x: SyntaxTree.BasicType);
  174. BEGIN (* no code emission *) END VisitBasicType;
  175. PROCEDURE VisitCharacterType*(x: SyntaxTree.CharacterType);
  176. BEGIN (* no code emission *) END VisitCharacterType;
  177. PROCEDURE VisitIntegerType*(x: SyntaxTree.IntegerType);
  178. BEGIN (* no code emission *) END VisitIntegerType;
  179. PROCEDURE VisitFloatType*(x: SyntaxTree.FloatType);
  180. BEGIN (* no code emission *) END VisitFloatType;
  181. PROCEDURE VisitComplexType*(x: SyntaxTree.ComplexType);
  182. BEGIN (* no code emission *) END VisitComplexType;
  183. PROCEDURE VisitQualifiedType*(x: SyntaxTree.QualifiedType);
  184. VAR type: SyntaxTree.Type;
  185. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  186. type := x.resolved;
  187. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  188. meta.CheckTypeDeclaration(type);
  189. END;
  190. END VisitQualifiedType;
  191. PROCEDURE VisitStringType*(x: SyntaxTree.StringType);
  192. BEGIN (* no code emission *) END VisitStringType;
  193. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  194. BEGIN (* no code emission *)
  195. END VisitArrayRangeType;
  196. PROCEDURE VisitArrayType*(x: SyntaxTree.ArrayType);
  197. BEGIN (* no code emission *) END VisitArrayType;
  198. PROCEDURE VisitPortType*(x: SyntaxTree.PortType);
  199. BEGIN (* no code emission *) END VisitPortType;
  200. PROCEDURE VisitMathArrayType*(x: SyntaxTree.MathArrayType);
  201. BEGIN
  202. meta.CheckTypeDeclaration(x);
  203. END VisitMathArrayType;
  204. PROCEDURE VisitPointerType*(x: SyntaxTree.PointerType);
  205. BEGIN
  206. meta.CheckTypeDeclaration(x);
  207. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  208. END VisitPointerType;
  209. PROCEDURE VisitRecordType*(x: SyntaxTree.RecordType);
  210. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  211. BEGIN (* no code emission *)
  212. meta.CheckTypeDeclaration(x);
  213. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  214. IF x.pointerType.typeDeclaration # NIL THEN
  215. td := x.pointerType.typeDeclaration
  216. ELSE
  217. td := x.typeDeclaration
  218. END;
  219. Global.GetSymbolName(td,name);
  220. (* code section for object *)
  221. END;
  222. Scope(x.recordScope);
  223. END VisitRecordType;
  224. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  225. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  226. BEGIN
  227. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  228. WHILE (this # NIL) & (this.identifier# id) DO
  229. this := this.nextModifier;
  230. END;
  231. RETURN this # NIL
  232. END HasFlag;
  233. PROCEDURE VisitCellType*(x: SyntaxTree.CellType);
  234. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  235. BEGIN
  236. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  237. capabilities := {};
  238. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  239. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  240. backend.SetCapabilities(capabilities);
  241. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  242. Scope(x.cellScope);
  243. END;
  244. END VisitCellType;
  245. PROCEDURE VisitProcedureType*(x: SyntaxTree.ProcedureType);
  246. BEGIN (* no code emission *) END VisitProcedureType;
  247. PROCEDURE VisitEnumerationType*(x: SyntaxTree.EnumerationType);
  248. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  249. END VisitEnumerationType;
  250. (* symbols *)
  251. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  252. BEGIN
  253. Procedure(x);
  254. END VisitProcedure;
  255. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  256. BEGIN
  257. Procedure(x);
  258. END VisitOperator;
  259. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  260. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  261. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  262. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  263. BEGIN
  264. type := type.resolved;
  265. IF type IS SyntaxTree.RecordType THEN
  266. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  267. ELSIF (type IS SyntaxTree.ArrayType) THEN
  268. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  269. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  270. END;
  271. ELSIF type IS SyntaxTree.MathArrayType THEN
  272. WITH type: SyntaxTree.MathArrayType DO
  273. IF type.form = SyntaxTree.Open THEN
  274. RETURN TRUE
  275. ELSIF type.form = SyntaxTree.Static THEN
  276. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  277. END;
  278. END;
  279. END;
  280. RETURN FALSE
  281. END TypeNeedsInitialization;
  282. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  283. VAR variable: SyntaxTree.Variable;
  284. BEGIN
  285. variable := scope.firstVariable;
  286. WHILE variable # NIL DO
  287. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  288. IF variable.initializer # NIL THEN RETURN TRUE END;
  289. variable := variable.nextVariable;
  290. END;
  291. RETURN FALSE
  292. END ScopeNeedsInitialization;
  293. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  294. VAR size: LONGINT;
  295. BEGIN
  296. size := offset - lastUpdated;
  297. IF size > 0 THEN
  298. irv.Emit(Reserve(x.position,size));
  299. END;
  300. irv.Emit(Data(x.position, op));
  301. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  302. END SingleInitialize;
  303. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  304. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  305. BEGIN
  306. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  307. WITH type: SyntaxTree.RecordType DO
  308. baseType := type.baseType;
  309. IF baseType # NIL THEN
  310. baseType := baseType.resolved;
  311. IF baseType IS SyntaxTree.PointerType THEN
  312. baseType := baseType(SyntaxTree.PointerType).pointerBase
  313. END;
  314. Initialize(baseType,NIL, offset);
  315. END;
  316. variable := type.recordScope.firstVariable;
  317. WHILE variable # NIL DO
  318. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  319. variable := variable.nextVariable
  320. END;
  321. | type: SyntaxTree.ArrayType DO
  322. IF type.form = SyntaxTree.Static THEN
  323. baseType := type.arrayBase;
  324. IF TypeNeedsInitialization(baseType) THEN
  325. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  326. FOR i := 0 TO type.staticLength-1 DO
  327. Initialize(baseType,NIL,offset+i*size);
  328. END;
  329. END;
  330. END;
  331. | type: SyntaxTree.MathArrayType DO
  332. IF type.form = SyntaxTree.Open THEN
  333. dim := DynamicDim(type);
  334. baseType := SemanticChecker.ArrayBase(type,dim);
  335. imm := IntermediateCode.Immediate(addressType,dim);
  336. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  337. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  338. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  339. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  340. (* flags remain empty (=0) for open array *)
  341. ELSIF type.form = SyntaxTree.Static THEN
  342. baseType := type.arrayBase;
  343. IF TypeNeedsInitialization(baseType) THEN
  344. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  345. ASSERT(type.staticLength < 1024*1024*1024);
  346. FOR i := 0 TO type.staticLength-1 DO
  347. Initialize(baseType,NIL,offset+i*size);
  348. END;
  349. END;
  350. END;
  351. ELSE
  352. IF initializer # NIL THEN
  353. implementationVisitor.Evaluate(initializer, op);
  354. SingleInitialize(op.op, offset);
  355. END;
  356. END;
  357. END Initialize;
  358. BEGIN
  359. IF x.externalName # NIL THEN RETURN END;
  360. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  361. (* code section for variable *)
  362. Global.GetSymbolSegmentedName(x,name);
  363. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  364. irv.SetExported(IsExported(x));
  365. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  366. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  367. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  369. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  370. FOR i := 0 TO DynamicDim(x.type)-1 DO
  371. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  372. END;
  373. ELSE
  374. lastUpdated:= 0;
  375. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  376. Initialize(x.type, x.initializer, 0);
  377. END;
  378. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  379. IF size > 0 THEN
  380. irv.Emit(Reserve(x.position,size));
  381. END;
  382. IF ~x.fixed THEN
  383. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  384. ELSE
  385. align := x.alignment;
  386. END;
  387. irv.SetPositionOrAlignment(x.fixed, align);
  388. meta.CheckTypeDeclaration(x.type);
  389. END;
  390. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  391. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  392. END;
  393. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  394. END VisitVariable;
  395. PROCEDURE VisitProperty*(x: SyntaxTree.Property);
  396. BEGIN
  397. VisitVariable(x)
  398. END VisitProperty;
  399. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  400. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  401. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  402. BEGIN
  403. ASSERT(currentScope IS SyntaxTree.CellScope);
  404. Global.GetSymbolSegmentedName(x,name);
  405. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  406. irv.SetExported(IsExported(x));
  407. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  408. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  409. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  410. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  411. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  412. FOR i := 0 TO DynamicDim(x.type)-1 DO
  413. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  414. END;
  415. ELSE
  416. lastUpdated:= 0;
  417. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  418. IF size > 0 THEN
  419. irv.Emit(Reserve(x.position,size));
  420. END;
  421. IF ~x.fixed THEN
  422. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  423. ELSE
  424. align := x.alignment;
  425. END;
  426. irv.SetPositionOrAlignment(x.fixed, align);
  427. meta.CheckTypeDeclaration(x.type);
  428. END;
  429. END VisitParameter;
  430. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  431. BEGIN
  432. Type(x.declaredType); (* => code in objects *)
  433. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  434. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  435. END;
  436. END VisitTypeDeclaration;
  437. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  438. BEGIN
  439. IF (SyntaxTree.Public * x.access # {}) THEN
  440. implementationVisitor.VisitConstant(x);
  441. END;
  442. END VisitConstant;
  443. PROCEDURE Scope(x: SyntaxTree.Scope);
  444. VAR procedure: SyntaxTree.Procedure;
  445. constant: SyntaxTree.Constant;
  446. variable: SyntaxTree.Variable;
  447. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  448. cell: SyntaxTree.CellType;
  449. parameter: SyntaxTree.Parameter;
  450. property: SyntaxTree.Property;
  451. BEGIN
  452. prevScope := currentScope;
  453. currentScope := x;
  454. (* constants treated in implementation visitor *)
  455. WITH x: SyntaxTree.CellScope DO
  456. cell := x.ownerCell;
  457. parameter := cell.firstParameter;
  458. WHILE parameter # NIL DO
  459. VisitParameter(parameter);
  460. parameter := parameter.nextParameter;
  461. END;
  462. property := cell.firstProperty;
  463. WHILE property # NIL DO
  464. VisitProperty(property);
  465. property := property.nextProperty;
  466. END;
  467. ELSE
  468. END;
  469. typeDeclaration := x.firstTypeDeclaration;
  470. WHILE typeDeclaration # NIL DO
  471. VisitTypeDeclaration(typeDeclaration);
  472. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  473. END;
  474. variable := x.firstVariable;
  475. WHILE variable # NIL DO
  476. VisitVariable(variable);
  477. variable := variable.nextVariable;
  478. END;
  479. procedure := x.firstProcedure;
  480. WHILE procedure # NIL DO
  481. VisitProcedure(procedure);
  482. procedure := procedure.nextProcedure;
  483. END;
  484. constant := x.firstConstant;
  485. WHILE constant # NIL DO
  486. VisitConstant(constant);
  487. constant := constant.nextConstant;
  488. END;
  489. currentScope := prevScope;
  490. END Scope;
  491. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  492. VAR parameter: SyntaxTree.Parameter;
  493. BEGIN
  494. parameter := first;
  495. WHILE parameter # NIL DO
  496. VisitParameter(parameter);
  497. parameter := parameter.nextParameter;
  498. END;
  499. END Parameters;
  500. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  501. VAR scope: SyntaxTree.ProcedureScope;
  502. prevScope: SyntaxTree.Scope;
  503. inline, finalizer: BOOLEAN;
  504. procedureType: SyntaxTree.ProcedureType;
  505. pc: LONGINT;
  506. memorySize: Basic.Integer; stackSize: LONGINT;
  507. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  508. null,size,src,dest,fp,res: IntermediateCode.Operand;
  509. callingConvention: LONGINT;
  510. cellType: SyntaxTree.CellType;
  511. register: WORD;
  512. registerParameters: SIZE;
  513. registerClass: IntermediateCode.RegisterClass;
  514. type: IntermediateCode.Type;
  515. formalParameter: SyntaxTree.Parameter;
  516. recordType: SyntaxTree.RecordType;
  517. isModuleBody: BOOLEAN;
  518. parametersSize: LONGINT;
  519. position: LONGINT;
  520. variable: SyntaxTree.Variable;
  521. nonParameterRegisters: WORD;
  522. PROCEDURE Signature;
  523. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  524. BEGIN
  525. procedureType := x.type(SyntaxTree.ProcedureType);
  526. returnType := procedureType.returnType;
  527. IF returnType # NIL THEN
  528. meta.CheckTypeDeclaration(returnType)
  529. END;
  530. parameter := procedureType.firstParameter;
  531. WHILE parameter # NIL DO
  532. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  533. parameter := parameter.nextParameter;
  534. END;
  535. END Signature;
  536. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  537. VAR result: BOOLEAN;
  538. BEGIN
  539. result := FALSE;
  540. IF x = SyntaxTree.invalidExpression THEN
  541. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  542. result := TRUE;
  543. value := x.resolved(SyntaxTree.IntegerValue).value;
  544. ELSE
  545. Error(x.position,"expression is not an integer constant");
  546. END;
  547. RETURN result;
  548. END CheckIntegerValue;
  549. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  550. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  551. BEGIN
  552. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  553. WHILE (this # NIL) & (this.identifier # id) DO
  554. this := this.nextModifier;
  555. END;
  556. IF this # NIL THEN
  557. IF this.expression = NIL THEN
  558. Error(this.position,"expected expression value");
  559. ELSIF CheckIntegerValue(this.expression,value) THEN
  560. END;
  561. RETURN TRUE
  562. ELSE RETURN FALSE
  563. END;
  564. END HasValue;
  565. CONST DefaultDataMemorySize=512;
  566. BEGIN
  567. IF x.externalName # NIL THEN RETURN END;
  568. (*
  569. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  570. *)
  571. (* code section for this procedure *)
  572. position := x.position.start;
  573. scope := x.procedureScope;
  574. prevScope := currentScope;
  575. currentScope := scope;
  576. procedureType := x.type(SyntaxTree.ProcedureType);
  577. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  578. implementationVisitor.temporaries.Clear;
  579. implementationVisitor.usedRegisters := NIL;
  580. implementationVisitor.registerUsageCount.Init;
  581. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  582. IF (scope.body # NIL) & (x.isInline) THEN
  583. inline := TRUE;
  584. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  585. ir.SetExported(IsExported(x));
  586. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  587. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  588. IF backend.cellsAreObjects THEN
  589. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  590. ir.SetExported(IsExported(x));
  591. ELSE
  592. RETURN; (* cellnet cannot be compiled for final static hardware *)
  593. END;
  594. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  595. inline := FALSE;
  596. AddBodyCallStub(x);
  597. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  598. ir.SetExported(IsExported(x));
  599. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  600. inline := FALSE;
  601. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  602. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  603. AddBodyCallStub(x);
  604. AddStackAllocation(x,memorySize);
  605. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  606. ir.SetExported(IsExported(x));
  607. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  608. inline := FALSE;
  609. Parameters(procedureType.firstParameter);
  610. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  611. ir.SetExported(IsExported(x));
  612. ELSE
  613. inline := FALSE;
  614. IF x.isEntry OR x.isExit THEN
  615. IF x.isEntry THEN
  616. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  617. ELSE
  618. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  619. END;
  620. ir.SetExported(TRUE);
  621. ELSE
  622. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  623. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  624. END;
  625. END;
  626. callingConvention := procedureType.callingConvention;
  627. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  628. parametersSize := ProcedureParametersSize(backend.system,x);
  629. ELSE
  630. parametersSize := 0;
  631. END;
  632. IF scope.body # NIL THEN
  633. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  634. IF ~inline THEN
  635. IF scope.lastVariable = NIL THEN
  636. stackSize := 0
  637. ELSE
  638. stackSize := scope.lastVariable.offsetInBits;
  639. IF stackSize <0 THEN stackSize := -stackSize END;
  640. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  641. END;
  642. (*
  643. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  644. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  645. *)
  646. (*
  647. ir.Emit(Nop(position)); (* placeholder for fill *)
  648. *)
  649. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  650. backend.ResetParameterRegisters();
  651. (* assumption: registers are passed left to right and left parameters are in registers *)
  652. formalParameter := procedureType.firstParameter;
  653. WHILE (formalParameter # NIL) DO
  654. IF PassInRegister(formalParameter, callingConvention) THEN
  655. IF formalParameter.type.IsRecordType() THEN
  656. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  657. type := addressType;
  658. ELSE
  659. type := GetType(system, formalParameter.type);
  660. END;
  661. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  662. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  663. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  664. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  665. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  666. implementationVisitor.ReleaseIntermediateOperand(src);
  667. END;
  668. END;
  669. formalParameter := formalParameter.nextParameter;
  670. END;
  671. END;
  672. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  673. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize));
  674. END;
  675. pc := ir.pc-1;
  676. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  677. backend.ResetParameterRegisters();
  678. nonParameterRegisters := 0;
  679. (* assumption: registers are passed left to right and left parameters are in registers *)
  680. formalParameter := procedureType.firstParameter;
  681. WHILE (formalParameter # NIL) DO
  682. IF PassInRegister(formalParameter, callingConvention) THEN
  683. IF formalParameter.type.IsRecordType() THEN
  684. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  685. type := addressType;
  686. ELSE
  687. type := GetType(system, formalParameter.type);
  688. END;
  689. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  690. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  691. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  692. implementationVisitor.currentScope := currentScope;
  693. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  694. formalParameter.SetOffset(variable.offsetInBits);
  695. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  696. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  697. implementationVisitor.ReleaseIntermediateOperand(src);
  698. ELSE
  699. INC(nonParameterRegisters);
  700. formalParameter.SetOffset(nonParameterRegisters * addressType.sizeInBits);
  701. END;
  702. END;
  703. formalParameter := formalParameter.nextParameter;
  704. END;
  705. END;
  706. END;
  707. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  708. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  709. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  710. IF scope.lastVariable # NIL THEN
  711. stackSize := scope.lastVariable.offsetInBits;
  712. IF stackSize <0 THEN stackSize := -stackSize END;
  713. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  714. END;
  715. END;
  716. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  717. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  718. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  719. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  720. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  721. ir.EmitAt(pc,Push(size));
  722. implementationVisitor.StaticCallOperand(result,procedure);
  723. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  724. END;
  725. *)
  726. END;
  727. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  728. IF stackSize > 0 THEN
  729. IF (stackSize MOD system.addressSize = 0) THEN
  730. null := IntermediateCode.Immediate(addressType,0);
  731. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  732. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  733. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  734. ELSE
  735. null := IntermediateCode.Immediate(int8,0);
  736. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  737. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  738. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  739. END;
  740. (*! should potentially be called by backend -- enter might initialize
  741. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  742. *)
  743. END;
  744. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  745. parametersSize := ProcedureParametersSize(backend.system,x);
  746. ELSE
  747. parametersSize := 0;
  748. END;
  749. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  750. finalizer := FALSE;
  751. IF backend.cooperative & x.isFinalizer THEN
  752. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  753. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  754. GetRecordTypeName(recordType,name);
  755. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  756. END;
  757. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  758. IF backend.cooperative THEN
  759. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  760. IF implementationVisitor.profile & ~isModuleBody THEN
  761. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  762. END;
  763. ELSE
  764. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  765. END;
  766. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  767. IF finalizer THEN
  768. IF backend.hasLinkRegister THEN
  769. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  770. END;
  771. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  772. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  773. ir.Emit(Br(x.position,dest));
  774. ELSE
  775. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  776. END;
  777. ELSE
  778. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  779. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  780. END;
  781. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  782. IF backend.cooperative THEN
  783. IF HasPointers (scope) THEN
  784. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  785. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  786. ir.Emit(Result(x.position, res));
  787. ir.Emit(Push(x.position, res));
  788. implementationVisitor.ResetVariables(scope);
  789. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  790. ir.Emit(Pop(x.position, res));
  791. ir.Emit(Return(x.position, res));
  792. ELSE
  793. implementationVisitor.ResetVariables(scope);
  794. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  795. END;
  796. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  797. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  798. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  799. ir.Emit(Result(x.position, res));
  800. ir.Emit(Push(x.position, res));
  801. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  802. ir.Emit(Pop(x.position, res));
  803. ir.Emit(Return(x.position, res));
  804. ELSE
  805. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  806. END;
  807. END;
  808. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  809. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  810. ELSE
  811. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  812. ir.Emit(Nop(x.position));
  813. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  814. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  815. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  816. END;
  817. END;
  818. END
  819. END;
  820. ELSE (* force body for procedures *)
  821. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0);
  822. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  823. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  824. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  825. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  826. END;
  827. Scope(scope);
  828. Signature;
  829. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  830. currentScope := prevScope;
  831. END Procedure;
  832. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  833. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  834. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  835. BEGIN
  836. ASSERT (bodyProcedure # NIL);
  837. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  838. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  839. procedure.SetScope(bodyProcedure.scope);
  840. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  841. procedure.SetAccess(SyntaxTree.Hidden);
  842. Global.GetSymbolSegmentedName (procedure,name);
  843. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  844. ir.SetExported(TRUE);
  845. Global.GetSymbolSegmentedName (bodyProcedure,name);
  846. IF ~meta.simple THEN
  847. implementationVisitor.currentScope := module.module.moduleScope;
  848. implementationVisitor.section := ir;
  849. implementationVisitor.PushSelfPointer();
  850. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  851. ELSIF backend.preregisterStatic THEN
  852. implementationVisitor.currentScope := module.module.moduleScope;
  853. implementationVisitor.section := ir;
  854. implementationVisitor.PushSelfPointer();
  855. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  856. ELSE
  857. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  858. ir.Emit(Call(bodyProcedure.position,op, 0));
  859. END;
  860. END AddBodyCallStub;
  861. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  862. VAR name: Basic.SegmentedName;
  863. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  864. BEGIN
  865. Global.GetSymbolSegmentedName (symbol,name);
  866. Basic.RemoveSuffix(name);
  867. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  868. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  869. ir.SetExported(TRUE);
  870. IntermediateCode.InitImmediate(op,addressType,initStack);
  871. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  872. END AddStackAllocation;
  873. (** entry function to visit a complete module *)
  874. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  875. VAR
  876. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  877. hasDynamicOperatorDeclarations: BOOLEAN;
  878. operator: SyntaxTree.Operator;
  879. import: SyntaxTree.Import;
  880. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  881. BEGIN
  882. type := type.resolved;
  883. IF type IS SyntaxTree.RecordType THEN
  884. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  885. ELSIF (type IS SyntaxTree.ArrayType) THEN
  886. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  887. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  888. END;
  889. ELSIF type IS SyntaxTree.MathArrayType THEN
  890. WITH type: SyntaxTree.MathArrayType DO
  891. IF type.form = SyntaxTree.Open THEN
  892. RETURN TRUE
  893. ELSIF type.form = SyntaxTree.Static THEN
  894. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  895. END;
  896. END;
  897. END;
  898. RETURN FALSE
  899. END TypeNeedsInitialization;
  900. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  901. VAR variable: SyntaxTree.Variable;
  902. BEGIN
  903. variable := scope.firstVariable;
  904. WHILE variable # NIL DO
  905. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  906. IF variable.initializer # NIL THEN RETURN TRUE END;
  907. variable := variable.nextVariable;
  908. END;
  909. RETURN FALSE
  910. END ScopeNeedsInitialization;
  911. BEGIN
  912. ASSERT(x # NIL); ASSERT(module # NIL);
  913. SELF.module := module;
  914. (* add import names to the generated Sections.Module *)
  915. import := x.moduleScope.firstImport;
  916. WHILE import # NIL DO
  917. import.module.GetName(idstr);
  918. module.imports.AddName(idstr);
  919. import := import.nextImport
  920. END;
  921. implementationVisitor.module := module;
  922. implementationVisitor.moduleScope := x.moduleScope;
  923. implementationVisitor.moduleSelf := moduleSelf;
  924. implementationVisitor.canBeLoaded := TRUE;
  925. meta.SetModule(module);
  926. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  927. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  928. END;
  929. IF backend.profile THEN
  930. EnsureBodyProcedure(x.moduleScope);
  931. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  932. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  933. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  934. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  935. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  936. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0);
  937. Global.GetModuleName(module.module,idstr);
  938. implementationVisitor.ProfilerAddModule(idstr);
  939. implementationVisitor.numberProcedures := 0;
  940. END;
  941. implementationVisitor.profile := backend.profile;
  942. (* check if there is at least one dynamic operator locally defined *)
  943. hasDynamicOperatorDeclarations := FALSE;
  944. operator := x.moduleScope.firstOperator;
  945. WHILE operator # NIL DO
  946. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  947. operator := operator.nextOperator
  948. END;
  949. (* add operator initialization code section *)
  950. IF hasDynamicOperatorDeclarations THEN
  951. EnsureBodyProcedure(x.moduleScope);
  952. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  953. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  954. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0);
  955. END;
  956. Scope(x.moduleScope);
  957. IF hasDynamicOperatorDeclarations THEN
  958. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  959. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  960. END;
  961. IF backend.profile THEN
  962. implementationVisitor.ProfilerPatchInit;
  963. END;
  964. END Module;
  965. END DeclarationVisitor;
  966. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  967. RegisterUsageCount*=OBJECT
  968. VAR used: UsedArray; count: LONGINT;
  969. PROCEDURE &Init;
  970. VAR i: LONGINT;
  971. BEGIN
  972. count := 0;
  973. IF used = NIL THEN NEW(used,64); END;
  974. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  975. END Init;
  976. PROCEDURE Grow;
  977. VAR new: UsedArray; size,i: LONGINT;
  978. BEGIN
  979. size := LEN(used)*2;
  980. NEW(new,size);
  981. FOR i := 0 TO LEN(used)-1 DO
  982. new[i].count := used[i].count;
  983. new[i].type := used[i].type;
  984. new[i].map := used[i].map
  985. END;
  986. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  987. used := new
  988. END Grow;
  989. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  990. BEGIN
  991. INC(count);
  992. IF count = LEN(used) THEN Grow END;
  993. used[count].type := type;
  994. used[count].class := class;
  995. used[count].map := count;
  996. RETURN count;
  997. END Next;
  998. PROCEDURE IncUse(register: LONGINT);
  999. BEGIN
  1000. INC(used[register].count);
  1001. (*
  1002. IF (register = 1) & (count > 30) THEN
  1003. D.TraceBack;
  1004. END;
  1005. *)
  1006. END IncUse;
  1007. PROCEDURE DecUse(register: LONGINT);
  1008. BEGIN
  1009. DEC(used[register].count);
  1010. END DecUse;
  1011. PROCEDURE Map(register: LONGINT): LONGINT;
  1012. VAR map : LONGINT;
  1013. BEGIN
  1014. IF register > 0 THEN
  1015. map := used[register].map;
  1016. WHILE register # map DO register := map; map := used[register].map END;
  1017. END;
  1018. RETURN register
  1019. END Map;
  1020. PROCEDURE Use(register: LONGINT): LONGINT;
  1021. BEGIN
  1022. IF register< LEN(used) THEN
  1023. RETURN used[register].count
  1024. ELSE
  1025. RETURN 0
  1026. END
  1027. END Use;
  1028. END RegisterUsageCount;
  1029. RegisterEntry = POINTER TO RECORD
  1030. prev,next: RegisterEntry;
  1031. register: LONGINT;
  1032. registerClass: IntermediateCode.RegisterClass;
  1033. type: IntermediateCode.Type;
  1034. END;
  1035. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1036. Variables = OBJECT (Basic.List)
  1037. VAR
  1038. inUse: VariableUse;
  1039. registerIndex: LONGINT;
  1040. nameIndex: LONGINT;
  1041. PROCEDURE & Init;
  1042. VAR i: LONGINT;
  1043. BEGIN
  1044. InitList(16);
  1045. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1046. registerIndex := 1024;
  1047. nameIndex := 0;
  1048. END Init;
  1049. PROCEDURE Clear*;
  1050. VAR i: LONGINT;
  1051. BEGIN
  1052. Clear^;
  1053. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1054. registerIndex := 1024;
  1055. nameIndex := 0;
  1056. END Clear;
  1057. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1058. VAR string: SyntaxTree.IdentifierString ;
  1059. BEGIN
  1060. COPY("@hiddenIRVar",string);
  1061. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1062. RETURN SyntaxTree.NewIdentifier(string);
  1063. END GetUID;
  1064. PROCEDURE GetUsage(VAR use: VariableUse);
  1065. BEGIN
  1066. use := inUse;
  1067. END GetUsage;
  1068. PROCEDURE SetUsage(CONST use: VariableUse);
  1069. BEGIN
  1070. inUse := use;
  1071. END SetUsage;
  1072. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1073. VAR any: ANY;
  1074. BEGIN
  1075. any := Get(i);
  1076. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1077. END GetVariable;
  1078. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1079. BEGIN
  1080. Set(pos, v);
  1081. END SetVariable;
  1082. PROCEDURE Occupy(pos: LONGINT);
  1083. BEGIN
  1084. INCL(inUse[pos DIV 32], pos MOD 32);
  1085. END Occupy;
  1086. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1087. BEGIN
  1088. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1089. END Occupied;
  1090. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1091. BEGIN
  1092. Occupy(Length());
  1093. Add(v);
  1094. END AddVariable;
  1095. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1096. BEGIN
  1097. t1 := t1.resolved;
  1098. t2 := t2.resolved;
  1099. (*RETURN t1.SameType(t2); *)
  1100. RETURN
  1101. (t1.SameType(t2))
  1102. OR
  1103. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1104. OR
  1105. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1106. OR
  1107. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1108. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1109. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1110. OR
  1111. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1112. (DynamicDim(t1) = DynamicDim(t2))
  1113. );
  1114. END CompatibleType;
  1115. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1116. VAR var : SyntaxTree.Variable; i: LONGINT;
  1117. BEGIN
  1118. pos := Length();
  1119. FOR i := 0 TO pos-1 DO
  1120. IF ~(Occupied(i)) THEN
  1121. var := GetVariable(i);
  1122. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1123. pos := i;
  1124. Occupy(i);
  1125. RETURN var;
  1126. END;
  1127. END;
  1128. END;
  1129. RETURN NIL
  1130. END GetFreeVariable;
  1131. END Variables;
  1132. SymbolMap = POINTER TO RECORD
  1133. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1134. isAddress: BOOLEAN;
  1135. END;
  1136. SymbolMapper = OBJECT
  1137. VAR
  1138. first: SymbolMap;
  1139. PROCEDURE & Init;
  1140. BEGIN
  1141. first := NIL;
  1142. END Init;
  1143. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1144. VAR new: SymbolMap;
  1145. BEGIN
  1146. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1147. new.next := first; first := new;
  1148. END Add;
  1149. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1150. VAR s: SymbolMap;
  1151. BEGIN
  1152. s := first;
  1153. WHILE (s # NIL) & (s.this # this) DO
  1154. s := s.next
  1155. END;
  1156. RETURN s
  1157. END Get;
  1158. END SymbolMapper;
  1159. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1160. VAR
  1161. system: Global.System;
  1162. section: IntermediateCode.Section;
  1163. module: Sections.Module;
  1164. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1165. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1166. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1167. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1168. checker: SemanticChecker.Checker;
  1169. backend: IntermediateBackend;
  1170. meta: MetaDataGenerator;
  1171. position: Position;
  1172. moduleSelf: SyntaxTree.Variable;
  1173. (* variables for hand over of variables / temporary state *)
  1174. currentScope: SyntaxTree.Scope;
  1175. constantDeclaration : SyntaxTree.Symbol;
  1176. result: Operand; (* result of the most recent expression / statement *)
  1177. destination: IntermediateCode.Operand;
  1178. arrayDestinationTag: IntermediateCode.Operand;
  1179. arrayDestinationDimension:LONGINT;
  1180. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1181. conditional: BOOLEAN;
  1182. trueLabel, falseLabel, exitLabel: Label;
  1183. locked: BOOLEAN;
  1184. (*
  1185. usedRegisters: Registers;
  1186. *)
  1187. registerUsageCount: RegisterUsageCount;
  1188. usedRegisters: RegisterEntry;
  1189. (* useful operands and types *)
  1190. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1191. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1192. commentPrintout: Printout.Printer;
  1193. dump: Streams.Writer;
  1194. tagsAvailable : BOOLEAN;
  1195. supportedInstruction: SupportedInstructionProcedure;
  1196. supportedImmediate: SupportedImmediateProcedure;
  1197. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1198. emitLabels: BOOLEAN;
  1199. builtinsModuleName : SyntaxTree.IdentifierString;
  1200. indexCounter: LONGINT;
  1201. profile: BOOLEAN;
  1202. profileId, profileInit: IntermediateCode.Section;
  1203. profileInitPatchPosition: LONGINT;
  1204. numberProcedures: LONGINT;
  1205. procedureResultDesignator : SyntaxTree.Designator;
  1206. operatorInitializationCodeSection: IntermediateCode.Section;
  1207. fingerPrinter: FingerPrinter.FingerPrinter;
  1208. temporaries: Variables;
  1209. canBeLoaded : BOOLEAN;
  1210. currentIsInline: BOOLEAN;
  1211. currentMapper: SymbolMapper;
  1212. currentInlineExit: Label;
  1213. moduleBodySection: IntermediateCode.Section;
  1214. NeedDescriptor : BOOLEAN;
  1215. cooperativeSwitches: BOOLEAN;
  1216. lastSwitchPC: LONGINT;
  1217. isUnchecked: BOOLEAN;
  1218. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1219. BEGIN
  1220. SELF.system := system;
  1221. SELF.builtinsModuleName := runtime;
  1222. currentScope := NIL;
  1223. hiddenPointerType := NIL;
  1224. delegatePointerType := NIL;
  1225. awaitProcCounter := 0;
  1226. labelId := 0; constId := 0; labelId := 0;
  1227. SELF.checker := checker;
  1228. SELF.backend := backend;
  1229. position := Basic.invalidPosition;
  1230. conditional := FALSE;
  1231. locked := FALSE;
  1232. InitOperand(result,ModeUndefined);
  1233. addressType := IntermediateCode.GetType(system,system.addressType);
  1234. setType := IntermediateCode.GetType(system,system.setType);
  1235. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1236. lenType := IntermediateCode.GetType(system, system.lenType);
  1237. byteType := IntermediateCode.GetType(system, system.byteType);
  1238. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1239. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1240. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1241. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1242. nil := IntermediateCode.Immediate(addressType,0);
  1243. one := IntermediateCode.Immediate(addressType,1);
  1244. IntermediateCode.InitOperand(destination);
  1245. tagsAvailable := TRUE;
  1246. supportedInstruction := supportedInstructionProcedure;
  1247. supportedImmediate := supportedImmediateProcedure;
  1248. inData := FALSE;
  1249. SELF.emitLabels := emitLabels;
  1250. IntermediateCode.InitOperand(arrayDestinationTag);
  1251. bool := IntermediateCode.GetType(system,system.booleanType);
  1252. IntermediateCode.InitImmediate(false,bool,0);
  1253. IntermediateCode.InitImmediate(true,bool,1);
  1254. indexCounter := 0;
  1255. NEW(registerUsageCount);
  1256. usedRegisters := NIL;
  1257. procedureResultDesignator := NIL;
  1258. NEW(fingerPrinter);
  1259. NEW(temporaries);
  1260. currentIsInline := FALSE;
  1261. NeedDescriptor := FALSE;
  1262. isUnchecked := backend.noRuntimeChecks;
  1263. END Init;
  1264. TYPE Context = RECORD
  1265. section: IntermediateCode.Section;
  1266. registerUsageCount: RegisterUsageCount;
  1267. usedRegisters: RegisterEntry;
  1268. temporaries: Variables;
  1269. END;
  1270. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1271. VAR context: Context;
  1272. BEGIN
  1273. context.section := section;
  1274. context.registerUsageCount := registerUsageCount;
  1275. context.usedRegisters := usedRegisters;
  1276. context.temporaries := temporaries;
  1277. section := new;
  1278. NEW(registerUsageCount);
  1279. NEW(temporaries);
  1280. usedRegisters := NIL;
  1281. RETURN context;
  1282. END SwitchContext;
  1283. PROCEDURE ReturnToContext(context: Context);
  1284. BEGIN
  1285. section := context.section;
  1286. registerUsageCount := context.registerUsageCount;
  1287. usedRegisters := context.usedRegisters;
  1288. temporaries := context.temporaries;
  1289. END ReturnToContext;
  1290. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1291. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1292. BEGIN
  1293. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1294. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1295. END;
  1296. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1297. section.SetExported(IsExported(syntaxTreeSymbol));
  1298. RETURN section
  1299. END NewSection;
  1300. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1301. VAR new: LONGINT;
  1302. BEGIN
  1303. new := registerUsageCount.Next(type,class);
  1304. UseRegister(new);
  1305. RETURN new
  1306. END AcquireRegister;
  1307. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1308. VAR
  1309. fingerPrint: SyntaxTree.FingerPrint;
  1310. fingerPrintString: ARRAY 32 OF CHAR;
  1311. BEGIN
  1312. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1313. string := "[";
  1314. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1315. Strings.Append(string, fingerPrintString);
  1316. Strings.Append(string, "]");
  1317. END GetFingerprintString;
  1318. (** get the name for the code section that represens a certain symbol
  1319. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1320. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1321. VAR string: ARRAY 32 OF CHAR;
  1322. BEGIN
  1323. Global.GetSymbolSegmentedName(symbol, name);
  1324. (* if the symbol is an operator, then append the fingerprint to the name *)
  1325. IF symbol IS SyntaxTree.Operator THEN
  1326. GetFingerprintString(symbol, string);
  1327. Basic.AppendToSegmentedName(name,string);
  1328. END
  1329. END GetCodeSectionNameForSymbol;
  1330. (** get the name for the code section that represens a certain symbol
  1331. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1332. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1333. VAR string: ARRAY 32 OF CHAR;
  1334. BEGIN
  1335. Global.GetSymbolNameInScope(symbol, scope, name);
  1336. (* if the symbol is an operator, then append the fingerprint to the name *)
  1337. IF symbol IS SyntaxTree.Operator THEN
  1338. GetFingerprintString(symbol, string);
  1339. Strings.Append(name, string);
  1340. END
  1341. END GetCodeSectionNameForSymbolInScope;
  1342. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1343. BEGIN
  1344. IF dump # NIL THEN
  1345. dump.String("enter "); dump.String(s); dump.Ln;
  1346. END;
  1347. END TraceEnter;
  1348. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1349. BEGIN
  1350. IF dump # NIL THEN
  1351. dump.String("exit "); dump.String(s); dump.Ln;
  1352. END;
  1353. END TraceExit;
  1354. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1355. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1356. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1357. VAR i: LONGINT;
  1358. BEGIN
  1359. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1360. IF op.rule # NIL THEN
  1361. FOR i := 0 TO LEN(op.rule)-1 DO
  1362. CheckRegister(op.rule[i])
  1363. END;
  1364. END;
  1365. END CheckRegister;
  1366. BEGIN
  1367. CheckRegister(instruction.op1);
  1368. CheckRegister(instruction.op2);
  1369. CheckRegister(instruction.op3);
  1370. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1371. ELSE section.Emit(instruction);
  1372. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1373. END;
  1374. END Emit;
  1375. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1376. VAR saved: RegisterEntry;
  1377. BEGIN
  1378. IF backend.cooperative THEN
  1379. ReleaseUsedRegisters(saved);
  1380. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1381. CallThis(position,"Runtime","Trap",1);
  1382. RestoreRegisterUse(saved);
  1383. ELSE
  1384. Emit(Trap(position,trapNo));
  1385. END;
  1386. END EmitTrap;
  1387. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT);
  1388. VAR name: Basic.SegmentedName;
  1389. VAR op1, op2, reg: IntermediateCode.Operand;
  1390. VAR call, nocall: Label;
  1391. VAR parametersSize: LONGINT;
  1392. VAR prevSection: IntermediateCode.Section;
  1393. VAR prevDump: Streams.Writer;
  1394. VAR body: SyntaxTree.Body;
  1395. VAR procedureType: SyntaxTree.ProcedureType;
  1396. BEGIN
  1397. IF procedure # NIL THEN
  1398. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1399. ELSE procedureType := NIL;
  1400. END;
  1401. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1402. prevSection := SELF.section;
  1403. SELF.section := section;
  1404. prevDump := dump;
  1405. dump := section.comments;
  1406. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1407. IF backend.hasLinkRegister THEN
  1408. Emit(Push(Basic.invalidPosition, lr));
  1409. END;
  1410. Emit(Push(Basic.invalidPosition,fp));
  1411. IF procedure # NIL THEN
  1412. body := procedure.procedureScope.body;
  1413. ELSE
  1414. body := NIL;
  1415. END;
  1416. IF backend.cooperative THEN
  1417. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1418. GetCodeSectionNameForSymbol(procedure, name);
  1419. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1420. ELSE
  1421. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1422. END;
  1423. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1424. IntermediateCode.AddOffset(op1, 1);
  1425. Emit(Push(Basic.invalidPosition,op1));
  1426. Emit(Mov(Basic.invalidPosition,fp, sp));
  1427. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1428. NEW(call, section);
  1429. NEW(nocall, section);
  1430. reg := NewRegisterOperand(addressType);
  1431. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1432. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1433. BrltL(call, sp, reg);
  1434. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1435. BrgeL(nocall, sp, op2);
  1436. call.Resolve(section.pc);
  1437. Emit(Push(Basic.invalidPosition, reg));
  1438. ReleaseIntermediateOperand(reg);
  1439. parametersSize := ProcParametersSize(procedure);
  1440. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1441. Emit(Push(Basic.invalidPosition, op2));
  1442. CallThis(position, "Activities","ExpandStack",2);
  1443. Emit(Result(Basic.invalidPosition, sp));
  1444. nocall.Resolve(section.pc);
  1445. END;
  1446. ELSE
  1447. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1448. Emit(Push(Basic.invalidPosition, one)) ;
  1449. procedureType.SetParametersOffset(1);
  1450. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1451. END;
  1452. Emit(Mov(Basic.invalidPosition, fp, sp));
  1453. END;
  1454. END;
  1455. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1456. SELF.section := prevSection;
  1457. dump := prevDump;
  1458. END EmitEnter;
  1459. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1460. VAR op1,op2: IntermediateCode.Operand;
  1461. VAR instruction: IntermediateCode.Instruction;
  1462. BEGIN
  1463. IntermediateCode.InitNumber(op1,callconv);
  1464. IntermediateCode.InitNumber(op2,varSize);
  1465. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1466. RETURN instruction
  1467. END Enter;
  1468. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1469. VAR op1: IntermediateCode.Operand;
  1470. VAR instruction: IntermediateCode.Instruction;
  1471. BEGIN
  1472. IntermediateCode.InitNumber(op1,callconv);
  1473. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1474. RETURN instruction
  1475. END Leave;
  1476. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1477. VAR prevSection: IntermediateCode.Section;
  1478. VAR op2, size: IntermediateCode.Operand;
  1479. VAR body: SyntaxTree.Body;
  1480. BEGIN
  1481. prevSection := SELF.section;
  1482. SELF.section := section;
  1483. Emit(Leave(position, callconv));
  1484. IF procedure # NIL THEN
  1485. body := procedure.procedureScope.body;
  1486. ELSE
  1487. body := NIL;
  1488. END;
  1489. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1490. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1491. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1492. Emit(Add(position, sp, fp, op2));
  1493. ELSE
  1494. Emit(Mov(position, sp, fp));
  1495. END;
  1496. Emit(Pop(position, fp));
  1497. END;
  1498. SELF.section := prevSection;
  1499. END EmitLeave;
  1500. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1501. VAR m: SymbolMap;
  1502. BEGIN
  1503. position := x.position;
  1504. IF currentIsInline THEN
  1505. m := currentMapper.Get(x);
  1506. IF m # NIL THEN
  1507. (*
  1508. Printout.Info("mapping from", x);
  1509. Printout.Info("mapping to ", m.to);
  1510. *)
  1511. m.to.Accept(SELF);
  1512. op := result;
  1513. IF m.tag # NIL THEN
  1514. ReleaseIntermediateOperand(result.tag);
  1515. m.tag.Accept(SELF);
  1516. op.tag := result.op;
  1517. ReleaseIntermediateOperand(result.tag);
  1518. END;
  1519. RETURN
  1520. END;
  1521. END;
  1522. x.Accept(SELF);
  1523. op := result;
  1524. END Symbol;
  1525. PROCEDURE Expression(x: SyntaxTree.Expression);
  1526. BEGIN
  1527. position := x.position;
  1528. constantDeclaration := NIL;
  1529. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1530. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1531. END;
  1532. IF x.resolved # NIL THEN
  1533. x.resolved.Accept(SELF)
  1534. ELSE
  1535. x.Accept(SELF)
  1536. END;
  1537. (* check this, was commented out in ActiveCells3 *)
  1538. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1539. Error(x.position, "unsupported modifier");
  1540. END;
  1541. END Expression;
  1542. (*
  1543. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1544. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1545. BEGIN
  1546. temporaries.GetUsage(current);
  1547. FOR i := 0 TO LEN(current)-1 DO
  1548. set := current[i] - previous[i];
  1549. IF set # {} THEN
  1550. FOR j := 0 TO MAX(SET)-1 DO
  1551. IF j IN set THEN
  1552. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1553. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1554. Symbol(variable, op);
  1555. MakeMemory(tmp,op.op,addressType,0);
  1556. ReleaseOperand(op);
  1557. Emit(Mov(position,tmp, nil ) );
  1558. ReleaseIntermediateOperand(tmp);
  1559. END;
  1560. END;
  1561. END;
  1562. END;
  1563. END;
  1564. END ResetUsedTemporaries;
  1565. *)
  1566. PROCEDURE Statement(x: SyntaxTree.Statement);
  1567. VAR use: VariableUse;
  1568. BEGIN
  1569. temporaries.GetUsage(use);
  1570. position := x.position;
  1571. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1572. IF commentPrintout # NIL THEN
  1573. commentPrintout.Statement(x);
  1574. dump.Ln;
  1575. (*dump.Update;*)
  1576. END;
  1577. x.Accept(SELF);
  1578. (*
  1579. CheckRegistersFree();
  1580. *)
  1581. (*ResetUsedTemporaries(use);*)
  1582. temporaries.SetUsage(use);
  1583. END Statement;
  1584. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1585. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1586. *)
  1587. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1588. BEGIN
  1589. ASSERT(op.mode # IntermediateCode.Undefined);
  1590. IF op.mode = IntermediateCode.ModeMemory THEN
  1591. ReuseCopy(res,op);
  1592. ELSE
  1593. res := op;
  1594. UseIntermediateOperand(res);
  1595. END;
  1596. IntermediateCode.AddOffset(res,offset);
  1597. IntermediateCode.MakeMemory(res,type);
  1598. END MakeMemory;
  1599. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1600. VAR mem: IntermediateCode.Operand;
  1601. BEGIN
  1602. MakeMemory(mem,res,type,offset);
  1603. ReleaseIntermediateOperand(res);
  1604. res := mem;
  1605. END ToMemory;
  1606. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1607. VAR mem: IntermediateCode.Operand;
  1608. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1609. componentType: SyntaxTree.Type;
  1610. BEGIN
  1611. type := type.resolved;
  1612. IF operand.mode = ModeReference THEN
  1613. IF type IS SyntaxTree.RangeType THEN
  1614. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1615. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1616. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1617. ReleaseOperand(operand);
  1618. operand.op := firstOp;
  1619. operand.tag := lastOp;
  1620. operand.extra := stepOp;
  1621. ELSIF type IS SyntaxTree.ComplexType THEN
  1622. componentType := type(SyntaxTree.ComplexType).componentType;
  1623. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1624. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1625. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1626. ReleaseOperand(operand);
  1627. operand.op := firstOp;
  1628. operand.tag := lastOp
  1629. ELSE
  1630. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1631. ReleaseIntermediateOperand(operand.op);
  1632. operand.op := mem;
  1633. END;
  1634. operand.mode := ModeValue;
  1635. END;
  1636. ASSERT(operand.mode = ModeValue);
  1637. END LoadValue;
  1638. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1639. VAR prevConditional: BOOLEAN;
  1640. BEGIN
  1641. prevConditional := conditional;
  1642. conditional := FALSE;
  1643. InitOperand(result, ModeUndefined);
  1644. Expression(x);
  1645. op := result;
  1646. LoadValue(op,x.type.resolved);
  1647. conditional := prevConditional;
  1648. END Evaluate;
  1649. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1650. VAR prevConditional: BOOLEAN;
  1651. BEGIN
  1652. prevConditional := conditional;
  1653. conditional := FALSE;
  1654. InitOperand(result,ModeUndefined);
  1655. Expression(x);
  1656. op := result;
  1657. (*
  1658. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1659. *)
  1660. conditional := prevConditional;
  1661. END Designate;
  1662. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1663. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1664. BEGIN
  1665. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1666. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1667. conditional := TRUE;
  1668. trueLabel := trueL; falseLabel := falseL;
  1669. Expression(x);
  1670. trueL := trueLabel; falseL := falseLabel;
  1671. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1672. END Condition;
  1673. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1674. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1675. BEGIN
  1676. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1677. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1678. RETURN op
  1679. END NewRegisterOperand;
  1680. PROCEDURE UnuseRegister(register: LONGINT);
  1681. BEGIN
  1682. IF (register > 0) THEN
  1683. register := registerUsageCount.Map(register);
  1684. registerUsageCount.DecUse(register);
  1685. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1686. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1687. END;
  1688. IF registerUsageCount.Use(register)=0 THEN
  1689. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1690. Warning(position, "register cannot be removed");
  1691. END;
  1692. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1693. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1694. END;
  1695. ELSIF registerUsageCount.Use(register)<0 THEN
  1696. Warning(position, "register removed too often");
  1697. IF dump # NIL THEN
  1698. dump.String("register removed too often"); dump.Ln; dump.Update;
  1699. END;
  1700. END;
  1701. END;
  1702. END UnuseRegister;
  1703. PROCEDURE UseRegister(register: LONGINT);
  1704. BEGIN
  1705. IF (register > 0) THEN
  1706. register := registerUsageCount.Map(register);
  1707. registerUsageCount.IncUse(register);
  1708. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1709. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1710. END;
  1711. IF registerUsageCount.Use(register)=1 THEN
  1712. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1713. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1714. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1715. END;
  1716. END;
  1717. END;
  1718. END UseRegister;
  1719. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1720. BEGIN
  1721. UnuseRegister(op.register)
  1722. END ReleaseIntermediateOperand;
  1723. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1724. BEGIN
  1725. UseRegister(op.register)
  1726. END UseIntermediateOperand;
  1727. PROCEDURE ReleaseOperand(CONST op: Operand);
  1728. BEGIN
  1729. UnuseRegister(op.op.register);
  1730. UnuseRegister(op.tag.register);
  1731. UnuseRegister(op.extra.register);
  1732. END ReleaseOperand;
  1733. (* save registers marked in array "markedRegisters" to the stack
  1734. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1735. *)
  1736. PROCEDURE SaveRegisters();
  1737. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1738. BEGIN
  1739. entry := usedRegisters;
  1740. WHILE entry # NIL DO
  1741. type := registerUsageCount.used[entry.register].type;
  1742. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1743. Emit(Push(position,op));
  1744. entry := entry.next;
  1745. END;
  1746. END SaveRegisters;
  1747. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1748. BEGIN
  1749. saved := usedRegisters;
  1750. usedRegisters := NIL;
  1751. END ReleaseUsedRegisters;
  1752. (** remove parameter registers from used queue *)
  1753. PROCEDURE ReleaseParameterRegisters;
  1754. VAR entry,prev,next: RegisterEntry;
  1755. BEGIN
  1756. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1757. WHILE entry # NIL DO
  1758. next := entry.next;
  1759. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1760. registerUsageCount.DecUse(entry.register);
  1761. ASSERT(registerUsageCount.Use(entry.register)=0);
  1762. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1763. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1764. END;
  1765. ELSIF prev = NIL THEN
  1766. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1767. ELSE
  1768. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1769. END;
  1770. entry := next;
  1771. END;
  1772. END ReleaseParameterRegisters;
  1773. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1774. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1775. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1776. BEGIN
  1777. entry := saved;
  1778. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1779. entry := prev;
  1780. WHILE entry # NIL DO
  1781. prev := entry.prev;
  1782. type := entry.type;
  1783. class := entry.registerClass;
  1784. IntermediateCode.InitRegister(op,type,class,entry.register);
  1785. Emit(Pop(position,op));
  1786. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1787. entry := prev;
  1788. END;
  1789. END RestoreRegisters;
  1790. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  1791. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  1792. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1793. BEGIN
  1794. entry := saved;
  1795. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1796. entry := prev;
  1797. WHILE entry # NIL DO
  1798. prev := entry.prev;
  1799. type := entry.type;
  1800. class := entry.registerClass;
  1801. IntermediateCode.InitRegister(op,type,class,entry.register);
  1802. Emit(Mov(position,op,op));
  1803. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1804. entry := prev;
  1805. END;
  1806. END RestoreRegisterUse;
  1807. PROCEDURE CheckRegistersFree;
  1808. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1809. BEGIN
  1810. IF usedRegisters # NIL THEN
  1811. r := usedRegisters;
  1812. WHILE r # NIL DO
  1813. warning := "register ";
  1814. Strings.AppendInt(warning, r.register);
  1815. Strings.Append(warning, " not released.");
  1816. Warning(position,warning);
  1817. r := r .next;
  1818. END;
  1819. END;
  1820. FOR i := 0 TO registerUsageCount.count-1 DO
  1821. IF registerUsageCount.used[i].count < 0 THEN
  1822. warning := "register ";
  1823. Strings.AppendInt(warning, i);
  1824. Strings.Append(warning, " unused too often.");
  1825. Warning(position,warning);
  1826. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1827. warning := "register ";
  1828. Strings.AppendInt(warning, i);
  1829. Strings.Append(warning, " not unused often enough.");
  1830. Warning(position,warning);
  1831. END;
  1832. END;
  1833. END CheckRegistersFree;
  1834. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1835. Otherwise allocate a new register.
  1836. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1837. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1838. BEGIN
  1839. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1840. UseIntermediateOperand(result);
  1841. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1842. UseIntermediateOperand(result);
  1843. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1844. END;
  1845. END Reuse2;
  1846. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1847. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1848. If not then allocate a new register.
  1849. Does NOT necessarily keep the content of src1 or src2 in result!
  1850. *)
  1851. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1852. BEGIN
  1853. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1854. UseIntermediateOperand(result);
  1855. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1856. UseIntermediateOperand(result);
  1857. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1858. result := alternative; alternative := emptyOperand;
  1859. UseIntermediateOperand(result);
  1860. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1861. END;
  1862. END Reuse2a;
  1863. (* like reuse2 but only one source *)
  1864. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1865. BEGIN
  1866. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1867. UseIntermediateOperand(result);
  1868. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1869. END;
  1870. END Reuse1;
  1871. (* like reuse2a but only one source *)
  1872. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1873. BEGIN
  1874. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1875. UseIntermediateOperand(result);
  1876. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1877. UseIntermediateOperand(result);
  1878. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1879. END;
  1880. END Reuse1a;
  1881. (* like reuse1 but guarantees that content of src1 is in result *)
  1882. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1883. BEGIN
  1884. IF ReusableRegister(src1) THEN
  1885. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1886. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1887. UseIntermediateOperand(result);
  1888. ELSE
  1889. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1890. Emit(Mov(position,result,src1));
  1891. END
  1892. END ReuseCopy;
  1893. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1894. BEGIN
  1895. IF ReusableRegister(src) THEN
  1896. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1897. ELSE
  1898. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1899. Emit(Mov(position,result,src));
  1900. ReleaseIntermediateOperand(src);
  1901. END
  1902. END TransferToRegister;
  1903. (** labels and branches **)
  1904. PROCEDURE NewLabel(): Label;
  1905. VAR label: Label;
  1906. BEGIN
  1907. NEW(label,section); RETURN label;
  1908. END NewLabel;
  1909. PROCEDURE SetLabel(label: Label);
  1910. BEGIN label.Resolve(section.pc);
  1911. END SetLabel;
  1912. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1913. BEGIN
  1914. ASSERT(label # NIL);
  1915. IF label.pc < 0 THEN (* label not yet set *)
  1916. label.AddFixup(section.pc);
  1917. END;
  1918. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1919. END LabelOperand;
  1920. PROCEDURE BrL(label: Label);
  1921. BEGIN
  1922. Emit(Br(position,LabelOperand(label)));
  1923. END BrL;
  1924. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1925. BEGIN
  1926. Emit(Brge(position,LabelOperand(label),left,right));
  1927. END BrgeL;
  1928. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1929. BEGIN
  1930. Emit(Brlt(position,LabelOperand(label),left,right));
  1931. END BrltL;
  1932. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1933. BEGIN
  1934. Emit(Breq(position,LabelOperand(label),left,right));
  1935. END BreqL;
  1936. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1937. BEGIN
  1938. Emit(Brne(position,LabelOperand(label),left,right));
  1939. END BrneL;
  1940. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1941. VAR new: IntermediateCode.Operand;
  1942. BEGIN
  1943. IF Trace THEN TraceEnter("Convert") END;
  1944. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1945. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1946. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1947. & (operand.offset = 0)
  1948. THEN
  1949. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1950. Emit(Conv(position,new,operand));
  1951. ELSE
  1952. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1953. Emit(Conv(position,new,operand));
  1954. ReleaseIntermediateOperand(operand);
  1955. END;
  1956. operand := new;
  1957. 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
  1958. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1959. ELSE
  1960. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1961. Emit(Conv(position,new,operand));
  1962. ReleaseIntermediateOperand(operand);
  1963. operand := new;
  1964. END;
  1965. IF Trace THEN TraceExit("Convert") END;
  1966. END Convert;
  1967. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1968. VAR exit: Label;
  1969. BEGIN
  1970. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1971. exit := NewLabel();
  1972. br(exit,left,right);
  1973. EmitTrap(position,trapNo);
  1974. SetLabel(exit);
  1975. END TrapC;
  1976. (** expressions *)
  1977. (** emit necessary runtime check for set elements **)
  1978. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1979. VAR max: IntermediateCode.Operand;
  1980. BEGIN
  1981. IF isUnchecked THEN RETURN END;
  1982. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1983. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1984. TrapC(BrgeL, max, o, SetElementTrap);
  1985. END;
  1986. END CheckSetElement;
  1987. (** the set that a range represents **)
  1988. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1989. VAR
  1990. operand: Operand;
  1991. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1992. BEGIN
  1993. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1994. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1995. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1996. one := IntermediateCode.Immediate(setType, 1);
  1997. Evaluate(x, operand);
  1998. Convert(operand.op, setType);
  1999. Convert(operand.tag, setType);
  2000. CheckSetElement(operand.op);
  2001. CheckSetElement(operand.tag);
  2002. (* create mask for lower bound
  2003. i.e. shift 11111111 to the left by the value of the lower bound
  2004. *)
  2005. Reuse1(temp, operand.op);
  2006. Emit(Shl(position,temp, allBits, operand.op));
  2007. ReleaseIntermediateOperand(operand.op);
  2008. operand.op := temp;
  2009. (* create mask for upper bound
  2010. i.e. shift 11111111 to the right by the difference between the
  2011. upper bound and the maximum number of set elements
  2012. *)
  2013. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2014. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2015. Reuse1(temp, operand.tag);
  2016. ELSE
  2017. Reuse1(temp, operand.tag);
  2018. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2019. Emit(Sub(position,temp, size, operand.tag));
  2020. END;
  2021. Emit(Shr(position,temp, allBits, operand.tag));
  2022. ReleaseIntermediateOperand(operand.tag);
  2023. operand.tag := temp;
  2024. Reuse2(resultingSet, operand.op, operand.tag);
  2025. (* intersect the two masks *)
  2026. Emit(And(position,resultingSet, operand.op, operand.tag));
  2027. ReleaseOperand(operand);
  2028. RETURN resultingSet
  2029. END SetFromRange;
  2030. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2031. VAR
  2032. res, operand: Operand;
  2033. temp, one, noBits, dest: IntermediateCode.Operand;
  2034. expression: SyntaxTree.Expression;
  2035. i: LONGINT;
  2036. BEGIN
  2037. IF Trace THEN TraceEnter("VisitSet") END;
  2038. dest := destination;
  2039. destination := emptyOperand;
  2040. noBits := IntermediateCode.Immediate(setType, 0);
  2041. one := IntermediateCode.Immediate(setType, 1);
  2042. (* start off with the empty set *)
  2043. InitOperand(res, ModeValue);
  2044. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2045. Emit(Mov(position,res.op, noBits));
  2046. FOR i := 0 TO x.elements.Length() - 1 DO
  2047. expression := x.elements.GetExpression(i);
  2048. IF expression IS SyntaxTree.RangeExpression THEN
  2049. (* range of set elements *)
  2050. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2051. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2052. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2053. ReleaseIntermediateOperand(temp)
  2054. ELSE
  2055. (* singelton element *)
  2056. Evaluate(expression, operand);
  2057. Convert(operand.op, setType);
  2058. CheckSetElement(operand.op);
  2059. (* create subset containing single element *)
  2060. Reuse1(temp, operand.op);
  2061. Emit(Shl(position,temp, one, operand.op));
  2062. ReleaseOperand(operand);
  2063. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2064. ReleaseIntermediateOperand(temp);
  2065. END
  2066. END;
  2067. result := res;
  2068. destination := dest;
  2069. IF Trace THEN TraceExit("VisitSet") END;
  2070. END VisitSet;
  2071. (* math arrays of the form [a,b,c]
  2072. x is a static array and thus does not provide any pointers
  2073. *)
  2074. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2075. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2076. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2077. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2078. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2079. element: SyntaxTree.IntegerValue;
  2080. BEGIN
  2081. numberElements := x.elements.Length();
  2082. expression := index.parameters.GetExpression(dim);
  2083. element := expression(SyntaxTree.IntegerValue);
  2084. FOR i := 0 TO numberElements-1 DO
  2085. expression := x.elements.GetExpression(i);
  2086. element.SetValue(i);
  2087. IF expression IS SyntaxTree.MathArrayExpression THEN
  2088. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2089. ELSE
  2090. Assign(index,expression);
  2091. END;
  2092. END;
  2093. END RecursiveAssignment;
  2094. PROCEDURE Dimension(): LONGINT;
  2095. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2096. BEGIN
  2097. dim := 0;
  2098. expression := x;
  2099. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2100. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2101. INC(dim);
  2102. END;
  2103. RETURN dim;
  2104. END Dimension;
  2105. BEGIN
  2106. (*static math array not providing pointers anyway *)
  2107. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2108. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2109. designator.SetType(variable.type);
  2110. dim := Dimension();
  2111. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2112. FOR i := 0 TO dim-1 DO
  2113. element := SyntaxTree.NewIntegerValue(x.position,0);
  2114. element.SetType(system.longintType);
  2115. index.parameters.AddExpression(element);
  2116. END;
  2117. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2118. RecursiveAssignment(x,0);
  2119. Expression(designator);
  2120. END VisitMathArrayExpression;
  2121. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2122. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2123. BEGIN
  2124. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2125. dest := destination; destination := emptyOperand;
  2126. IF x.operator = Scanner.Not THEN
  2127. IF conditional THEN
  2128. Condition(x.left,falseLabel,trueLabel)
  2129. ELSE
  2130. Evaluate(x.left,operand);
  2131. InitOperand(result,ModeValue);
  2132. Reuse1a(result.op,operand.op,dest);
  2133. Emit(Xor(position,result.op,operand.op,true));
  2134. ReleaseOperand(operand);
  2135. END;
  2136. ELSIF x.operator = Scanner.Minus THEN
  2137. Evaluate(x.left,operand);
  2138. InitOperand(result,ModeValue);
  2139. Reuse1a(result.op,operand.op,dest);
  2140. type := x.left.type.resolved;
  2141. IF type IS SyntaxTree.SetType THEN
  2142. Emit(Not(position,result.op,operand.op));
  2143. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2144. Reuse1(result.tag,operand.tag);
  2145. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2146. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2147. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2148. Emit(Neg(position,result.op,operand.op));
  2149. ELSE HALT(200)
  2150. END;
  2151. ReleaseOperand(operand);
  2152. ELSIF x.operator = Scanner.Address THEN
  2153. Designate(x.left,operand);
  2154. operand.mode := ModeValue;
  2155. t0 := x.left.type.resolved;
  2156. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2157. ReleaseIntermediateOperand(operand.op);
  2158. operand.op := operand.tag;
  2159. IntermediateCode.InitOperand(operand.tag);
  2160. END;
  2161. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2162. result := operand;
  2163. ELSE HALT(100)
  2164. END;
  2165. destination := dest;
  2166. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2167. END VisitUnaryExpression;
  2168. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2169. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label; withPart: BOOLEAN);
  2170. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2171. BEGIN
  2172. type := type.resolved;
  2173. originalType := type;
  2174. IF type IS SyntaxTree.PointerType THEN
  2175. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2176. END;
  2177. IF type IS SyntaxTree.ObjectType THEN
  2178. BrL(trueL);
  2179. ELSE
  2180. ASSERT(type IS SyntaxTree.RecordType);
  2181. (*
  2182. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2183. *)
  2184. IF withPart THEN
  2185. left := tag;
  2186. ELSE
  2187. ReuseCopy(left,tag);
  2188. END;
  2189. right := TypeDescriptorAdr(type);
  2190. IF backend.cooperative THEN
  2191. repeatL := NewLabel();
  2192. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2193. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2194. END;
  2195. SetLabel(repeatL);
  2196. BreqL(trueL,left,right);
  2197. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2198. BrneL(repeatL,left,nil);
  2199. ELSIF meta.simple THEN
  2200. level := type(SyntaxTree.RecordType).Level();
  2201. (* get type desc tag of level relative to base tag *)
  2202. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2203. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2204. IntermediateCode.MakeMemory(left,addressType);
  2205. BreqL(trueL,left,right);
  2206. ELSE
  2207. level := type(SyntaxTree.RecordType).Level();
  2208. (* get type desc tag of level relative to base tag *)
  2209. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2210. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2211. IntermediateCode.MakeMemory(left,addressType);
  2212. BreqL(trueL,left,right);
  2213. END;
  2214. IF ~withPart THEN
  2215. ReleaseIntermediateOperand(left);
  2216. END;
  2217. ReleaseIntermediateOperand(right);
  2218. IF falseL # NIL THEN BrL(falseL) END;
  2219. END;
  2220. END TypeTest;
  2221. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2222. BEGIN
  2223. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2224. IF dump # NIL THEN
  2225. dump.String(s); dump.Ln;
  2226. END;
  2227. END Error;
  2228. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2229. BEGIN
  2230. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2231. IF dump # NIL THEN
  2232. dump.String(s); dump.Ln; dump.Update;
  2233. END;
  2234. END Warning;
  2235. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2236. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2237. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2238. operand:Operand;
  2239. BEGIN
  2240. previousSection := section;
  2241. Global.GetModuleName(mod,name);
  2242. Strings.Append(name,".@Trace");
  2243. Basic.ToSegmentedName(name, pooledName);
  2244. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2245. IF dump # NIL THEN dump := section.comments END;
  2246. IF backend.hasLinkRegister THEN
  2247. Emit(Push(Basic.invalidPosition, lr));
  2248. END;
  2249. variable := mod.moduleScope.firstVariable;
  2250. WHILE variable # NIL DO
  2251. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2252. Symbol(variable, operand);
  2253. register := operand.op;
  2254. CallTraceMethod(register, variable.type);
  2255. ReleaseIntermediateOperand(register);
  2256. END;
  2257. variable := variable.nextVariable;
  2258. END;
  2259. IF backend.hasLinkRegister THEN
  2260. Emit(Pop(Basic.invalidPosition, lr));
  2261. END;
  2262. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2263. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2264. Emit(Br(position,op));
  2265. INC(statCoopTraceModule, section.pc);
  2266. section := previousSection;
  2267. IF dump # NIL THEN dump := section.comments END;
  2268. END CreateTraceModuleMethod;
  2269. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2270. BEGIN
  2271. Emit (Push(position, dst));
  2272. Emit (Push(position, src));
  2273. CallThis(position,"GarbageCollector","Assign", 2);
  2274. END CallAssignPointer;
  2275. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2276. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2277. BEGIN
  2278. IF SemanticChecker.IsPointerType (type) THEN
  2279. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2280. ELSIF type.IsRecordType() THEN
  2281. Emit (Push(position,dst));
  2282. Emit (Push(position,src));
  2283. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2284. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2285. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2286. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2287. ELSIF IsStaticArray(type) THEN
  2288. size := StaticArrayNumElements(type);
  2289. base := StaticArrayBaseType(type);
  2290. IF base.IsRecordType() THEN
  2291. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2292. Emit (Push(position, dst));
  2293. Emit (Push(position, src));
  2294. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2295. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2296. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2297. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2298. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2299. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2300. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2301. Emit (Push(position, dst));
  2302. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2303. Emit (Push(position, src));
  2304. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2305. ELSE
  2306. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2307. Emit (Push(position, dst));
  2308. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2309. Emit (Push(position, src));
  2310. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2311. ASSERT(StaticArrayBaseType(type).IsPointer());
  2312. END;
  2313. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2314. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2315. Emit (Push(position, dst));
  2316. Emit (Push(position, src));
  2317. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2318. ELSE HALT(100); (* missing ? *)
  2319. END;
  2320. END CallAssignMethod;
  2321. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2322. VAR name: Basic.SegmentedName;
  2323. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2324. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2325. context: Context;
  2326. BEGIN
  2327. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2328. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2329. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2330. GetRecordTypeName (recordType,name);
  2331. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2332. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2333. section.SetExported (TRUE);
  2334. IF dump # NIL THEN dump := section.comments END;
  2335. IF backend.hasLinkRegister THEN
  2336. Emit(Push(Basic.invalidPosition, lr));
  2337. END;
  2338. variable := recordType.recordScope.firstVariable;
  2339. WHILE variable # NIL DO
  2340. IF variable.NeedsTrace() THEN
  2341. dst := NewRegisterOperand (addressType);
  2342. src := NewRegisterOperand (addressType);
  2343. Emit (Mov(position, dst, parameter1));
  2344. Emit (Mov(position, src, parameter2));
  2345. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2346. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2347. CallAssignMethod(dst, src, variable.type);
  2348. ReleaseIntermediateOperand(src);
  2349. ReleaseIntermediateOperand(dst);
  2350. END;
  2351. variable := variable.nextVariable;
  2352. END;
  2353. recordBase := recordType.GetBaseRecord();
  2354. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2355. IF backend.hasLinkRegister THEN
  2356. Emit(Pop(Basic.invalidPosition, lr));
  2357. END;
  2358. GetRecordTypeName (recordBase,name);
  2359. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2360. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2361. Emit(Br(position,op));
  2362. ELSE
  2363. Emit(Exit(position,0,0, 0));
  2364. END;
  2365. IF ~recordType.isObject THEN
  2366. GetRecordTypeName (recordType,name);
  2367. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2369. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2370. section.SetExported (TRUE);
  2371. NEW(registerUsageCount);
  2372. usedRegisters := NIL;
  2373. dst := NewRegisterOperand (addressType);
  2374. src := NewRegisterOperand (addressType);
  2375. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2376. Emit(Mov(position, dst, parameter1));
  2377. Emit(Mov(position, src, parameter2));
  2378. label := NewLabel();
  2379. SetLabel(label);
  2380. Emit(Push(position, dst));
  2381. Emit(Push(position, src));
  2382. GetRecordTypeName (recordType,name);
  2383. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2384. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2385. Emit(Call(position, op, 0));
  2386. Emit(Pop(position, src));
  2387. Emit(Pop(position, dst));
  2388. Emit(Add(position, dst, dst, ofs));
  2389. Emit(Add(position, src, src, ofs));
  2390. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2391. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2392. Emit(Exit(position,0,0, 0));
  2393. END;
  2394. INC(statCoopAssignProcedure, section.pc);
  2395. ReturnToContext(context);
  2396. IF dump # NIL THEN dump := section.comments END;
  2397. END CreateAssignProcedure;
  2398. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2399. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2400. BEGIN
  2401. IF IsUnsafePointer (type) THEN
  2402. skip := NewLabel();
  2403. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2404. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2405. BreqL (skip, op, nil);
  2406. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2407. SetLabel (skip);
  2408. ELSIF SemanticChecker.IsPointerType (type) THEN
  2409. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2410. CallThis(position,"GarbageCollector","Mark", 1);
  2411. ELSIF type.IsRecordType() THEN
  2412. Emit (Push(position,register));
  2413. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2414. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2415. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2416. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2417. ELSIF IsStaticArray(type) THEN
  2418. size := StaticArrayNumElements(type);
  2419. base := StaticArrayBaseType(type);
  2420. IF base.IsRecordType() THEN
  2421. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2422. Emit (Push(position, register));
  2423. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2424. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2425. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2426. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2427. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2428. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2429. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2430. Emit (Push(position, register));
  2431. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2432. ELSE
  2433. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2434. Emit (Push(position, register));
  2435. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2436. ASSERT(base.IsPointer());
  2437. END;
  2438. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2439. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2440. CallThis(position,"GarbageCollector","Mark", 1);
  2441. ELSE HALT(100); (* missing ? *)
  2442. END;
  2443. END CallTraceMethod;
  2444. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2445. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2446. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2447. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2448. BEGIN
  2449. previousSection := section;
  2450. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2451. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2452. GetRecordTypeName (recordType,name);
  2453. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2454. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2455. section.SetExported (TRUE);
  2456. IF dump # NIL THEN dump := section.comments END;
  2457. IF backend.hasLinkRegister THEN
  2458. Emit(Push(Basic.invalidPosition, lr));
  2459. END;
  2460. variable := recordType.recordScope.firstVariable;
  2461. WHILE variable # NIL DO
  2462. IF variable.NeedsTrace() THEN
  2463. register := NewRegisterOperand (addressType);
  2464. Emit (Mov(position,register,parameter1));
  2465. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2466. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2467. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2468. END;
  2469. CallTraceMethod(register, variable.type);
  2470. ReleaseIntermediateOperand(register);
  2471. END;
  2472. variable := variable.nextVariable;
  2473. END;
  2474. recordBase := recordType.GetBaseRecord();
  2475. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2476. recordBase := recordBase.GetBaseRecord();
  2477. END;
  2478. IF recordBase # NIL THEN
  2479. IF backend.hasLinkRegister THEN
  2480. Emit(Pop(Basic.invalidPosition, lr));
  2481. END;
  2482. GetRecordTypeName (recordBase,name);
  2483. IF HasExplicitTraceMethod (recordBase) THEN
  2484. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2485. ELSE
  2486. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2487. END;
  2488. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2489. Emit(Br(position,op));
  2490. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2491. Emit(Exit(position,0,0,0));
  2492. ELSE
  2493. IF backend.hasLinkRegister THEN
  2494. Emit(Pop(Basic.invalidPosition, lr));
  2495. END;
  2496. IF recordType.isObject THEN
  2497. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2498. ELSE
  2499. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2500. END;
  2501. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2502. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2503. Emit(Br(position,op));
  2504. END;
  2505. IF ~recordType.isObject THEN
  2506. GetRecordTypeName (recordType,name);
  2507. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2508. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2509. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2510. section.SetExported (TRUE);
  2511. NEW(registerUsageCount);
  2512. usedRegisters := NIL;
  2513. IF dump # NIL THEN dump := section.comments END;
  2514. register := NewRegisterOperand (addressType);
  2515. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2516. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2517. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2518. END;
  2519. Emit (Push(position,register));
  2520. GetRecordTypeName (recordType,name);
  2521. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2522. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2523. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2524. ReleaseIntermediateOperand(register);
  2525. Emit(Exit(position,0,0,0));
  2526. GetRecordTypeName (recordType,name);
  2527. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2528. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2529. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2530. section.SetExported (TRUE);
  2531. NEW(registerUsageCount);
  2532. usedRegisters := NIL;
  2533. register := NewRegisterOperand (addressType);
  2534. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2535. Emit(Mov(position, register, parameter1));
  2536. label := NewLabel();
  2537. SetLabel(label);
  2538. Emit(Push(position, register));
  2539. GetRecordTypeName (recordType,name);
  2540. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2541. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2542. Emit(Call(position, op, 0));
  2543. Emit(Pop(position, register));
  2544. Emit(Add(position, register, register, ofs));
  2545. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2546. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2547. Emit(Exit(position,0,0,0));
  2548. END;
  2549. INC(statCoopTraceMethod, section.pc);
  2550. ReturnToContext(context);
  2551. IF dump # NIL THEN dump := section.comments END;
  2552. END CreateTraceMethod;
  2553. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2554. VAR name: Basic.SegmentedName;
  2555. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2556. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2557. context: Context;
  2558. BEGIN
  2559. IF recordType.isObject THEN RETURN END;
  2560. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2561. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2562. GetRecordTypeName (recordType,name);
  2563. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2564. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2565. section.SetExported (TRUE);
  2566. IF dump # NIL THEN dump := section.comments END;
  2567. IF backend.hasLinkRegister THEN
  2568. Emit(Push(Basic.invalidPosition, lr));
  2569. END;
  2570. variable := recordType.recordScope.firstVariable;
  2571. WHILE variable # NIL DO
  2572. IF variable.NeedsTrace() THEN
  2573. dst := NewRegisterOperand (addressType);
  2574. Emit (Mov(position, dst, parameter1));
  2575. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2576. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2577. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2578. END;
  2579. CallResetProcedure(dst, nil, variable.type);
  2580. ReleaseIntermediateOperand(dst);
  2581. END;
  2582. variable := variable.nextVariable;
  2583. END;
  2584. recordBase := recordType.GetBaseRecord();
  2585. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2586. IF backend.hasLinkRegister THEN
  2587. Emit(Pop(Basic.invalidPosition, lr));
  2588. END;
  2589. GetRecordTypeName (recordBase,name);
  2590. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2591. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2592. Emit(Br(position,op));
  2593. ELSE
  2594. Emit(Exit(position,0,0, 0));
  2595. END;
  2596. GetRecordTypeName (recordType,name);
  2597. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2598. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2599. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2600. section.SetExported (TRUE);
  2601. NEW(registerUsageCount);
  2602. usedRegisters := NIL;
  2603. dst := NewRegisterOperand (addressType);
  2604. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2605. Emit(Mov(position, dst, parameter1));
  2606. label := NewLabel();
  2607. SetLabel(label);
  2608. Emit(Push(position, dst));
  2609. GetRecordTypeName (recordType,name);
  2610. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2611. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2612. Emit(Call(position, op, 0));
  2613. Emit(Pop(position, dst));
  2614. Emit(Add(position, dst, dst, ofs));
  2615. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2616. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2617. Emit(Exit(position,0,0, 0));
  2618. INC(statCoopResetProcedure, section.pc);
  2619. ReturnToContext(context);
  2620. IF dump # NIL THEN dump := section.comments END;
  2621. END CreateResetProcedure;
  2622. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2623. VAR name: Basic.SegmentedName; context: Context;
  2624. BEGIN
  2625. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2626. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2627. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2628. IF dump # NIL THEN dump := section.comments END;
  2629. IF backend.hasLinkRegister THEN
  2630. Emit(Push(Basic.invalidPosition, lr));
  2631. END;
  2632. Emit(Push(position,fp));
  2633. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2634. ResetVariables(scope);
  2635. Emit(Pop(position,fp));
  2636. Emit(Exit(position,0,0, 0));
  2637. ReturnToContext(context);
  2638. IF dump # NIL THEN dump := section.comments END;
  2639. END CreateResetMethod;
  2640. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2641. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2642. BEGIN
  2643. IF SemanticChecker.IsPointerType (type) THEN
  2644. Emit (Push(position, dest));
  2645. CallThis(position,"GarbageCollector","Reset", 1);
  2646. ELSIF type.IsRecordType() THEN
  2647. Emit (Push(position, dest));
  2648. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2649. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2650. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2651. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2652. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2653. size := GetArrayLength(type, tag);
  2654. base := ArrayBaseType(type);
  2655. IF base.IsRecordType() THEN
  2656. Emit (Push(position, size));
  2657. Emit (Push(position, dest));
  2658. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2659. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2660. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2661. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2662. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2663. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2664. Emit (Push(position, size));
  2665. Emit (Push(position, dest));
  2666. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2667. ELSE
  2668. Emit (Push(position, size));
  2669. Emit (Push(position, dest));
  2670. CallThis(position,"GarbageCollector","ResetArray", 2);
  2671. ASSERT(ArrayBaseType(type).IsPointer());
  2672. END;
  2673. ReleaseIntermediateOperand(size);
  2674. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2675. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2676. Emit (Push(position, dest));
  2677. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2678. ELSE HALT(100); (* missing ? *)
  2679. END;
  2680. END CallResetProcedure;
  2681. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2682. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  2683. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2684. VAR operand: Operand;
  2685. BEGIN
  2686. Symbol (symbol, operand);
  2687. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2688. ReleaseOperand(operand);
  2689. END Reset;
  2690. BEGIN
  2691. previousScope := currentScope;
  2692. currentScope := scope;
  2693. pc := section.pc;
  2694. prevOffset := MAX(SIZE);
  2695. variable := scope.firstVariable;
  2696. WHILE variable # NIL DO
  2697. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2698. Reset (variable);
  2699. prevOffset := variable.offsetInBits;
  2700. END;
  2701. variable := variable.nextVariable;
  2702. END;
  2703. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2704. WHILE parameter # NIL DO
  2705. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2706. Reset (parameter);
  2707. END;
  2708. parameter := parameter.nextParameter;
  2709. END;
  2710. INC(statCoopResetVariables, section.pc - pc);
  2711. currentScope := previousScope;
  2712. END ResetVariables;
  2713. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2714. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2715. BEGIN
  2716. type := symbol.type.resolved;
  2717. SaveRegisters();ReleaseUsedRegisters(saved);
  2718. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2719. Symbol(symbol, operand);
  2720. ToMemory(operand.op,addressType,0);
  2721. Emit(Push(position,operand.op));
  2722. IF refer THEN
  2723. CallThis(position,"Heaps","Refer",1);
  2724. ELSE
  2725. CallThis(position,"Heaps","Reset",1);
  2726. END;
  2727. ELSIF type.IsRecordType() THEN
  2728. Symbol(symbol, operand);
  2729. Emit(Push(position,operand.op));
  2730. Emit(Push(position,operand.tag)); (* type desc *)
  2731. IF refer THEN
  2732. CallThis(position,"Heaps","ReferRecord",2);
  2733. ELSE
  2734. CallThis(position,"Heaps","ResetRecord",2);
  2735. END;
  2736. ELSIF IsStaticArray(type) THEN
  2737. size := StaticArrayNumElements(type);
  2738. base := StaticArrayBaseType(type);
  2739. Symbol(symbol, operand);
  2740. arg := TypeDescriptorAdr(base);
  2741. Emit(Push(position,operand.op));
  2742. Emit(Push(position,arg));
  2743. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2744. ReleaseIntermediateOperand(arg);
  2745. IF refer THEN
  2746. CallThis(position,"Heaps","ReferArray",3);
  2747. ELSE
  2748. CallThis(position,"Heaps","ResetArray",3);
  2749. END;
  2750. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  2751. size := StaticMathArrayNumElements(type);
  2752. base := StaticMathArrayBaseType(type);
  2753. Symbol(symbol, operand);
  2754. arg := TypeDescriptorAdr(base);
  2755. Emit(Push(position,operand.op));
  2756. Emit(Push(position,arg));
  2757. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2758. ReleaseIntermediateOperand(arg);
  2759. IF refer THEN
  2760. CallThis(position,"Heaps","ReferArray",3);
  2761. ELSE
  2762. CallThis(position,"Heaps","ResetArray",3);
  2763. END;
  2764. ELSIF type IS SyntaxTree.MathArrayType THEN
  2765. Symbol(symbol, operand);
  2766. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  2767. Emit (Push(position, operand.op));
  2768. ELSE
  2769. Emit (Push(position, operand.tag));
  2770. END;
  2771. IF refer THEN
  2772. CallThis(position,"Heaps","ReferMathArray", 1);
  2773. ELSE
  2774. CallThis(position,"Heaps","ResetMathArray", 1);
  2775. END;
  2776. ELSIF type IS SyntaxTree.ProcedureType THEN
  2777. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  2778. Symbol(symbol, operand);
  2779. Emit (Push(position, operand.tag));
  2780. IF refer THEN
  2781. CallThis(position,"Heaps","Refer", 1);
  2782. ELSE
  2783. CallThis(position,"Heaps","Reset", 1);
  2784. END;
  2785. ELSE HALT(100); (* missing ? *)
  2786. END;
  2787. ReleaseOperand(operand);
  2788. RestoreRegisters(saved);
  2789. END Reset;
  2790. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  2791. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  2792. BEGIN
  2793. previousScope := currentScope;
  2794. currentScope := scope;
  2795. pc := section.pc;
  2796. IF ~ refer THEN
  2797. variable := scope.firstVariable;
  2798. prevOffset := MAX(SIZE);
  2799. WHILE variable # NIL DO
  2800. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2801. Reset (variable,refer);
  2802. prevOffset := variable.offsetInBits;
  2803. END;
  2804. variable := variable.nextVariable;
  2805. END;
  2806. END;
  2807. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2808. WHILE parameter # NIL DO
  2809. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  2810. Reset (parameter,refer);
  2811. END;
  2812. parameter := parameter.nextParameter;
  2813. END;
  2814. INC(statCoopResetVariables, section.pc - pc);
  2815. currentScope := previousScope;
  2816. END ResetVariables2;
  2817. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2818. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2819. VAR op: IntermediateCode.Operand; context: Context;
  2820. BEGIN
  2821. previousSection := section;
  2822. GetCodeSectionNameForSymbol(procedure, name);
  2823. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2824. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2825. IF dump # NIL THEN dump := section.comments END;
  2826. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2827. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2828. Emit(Data(position,op));
  2829. Emit(Data(position,nil));
  2830. IF HasPointers (procedure.procedureScope) THEN
  2831. GetCodeSectionNameForSymbol(procedure, name);
  2832. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2833. ELSE
  2834. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2835. END;
  2836. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2837. Emit(Data(position,op));
  2838. ReturnToContext(context);
  2839. IF dump # NIL THEN dump := section.comments END;
  2840. END CreateProcedureDescriptor;
  2841. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2842. VAR import: SyntaxTree.Import;
  2843. s: Basic.MessageString;
  2844. selfName: SyntaxTree.IdentifierString;
  2845. BEGIN
  2846. moduleScope.ownerModule.GetName(selfName);
  2847. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2848. module := moduleScope.ownerModule
  2849. ELSE
  2850. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2851. IF import = NIL THEN
  2852. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2853. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2854. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2855. s := "Module ";
  2856. Strings.Append(s,moduleName);
  2857. Strings.Append(s," cannot be imported.");
  2858. IF force THEN
  2859. Error(position,s);
  2860. ELSIF canBeLoaded THEN
  2861. IF WarningDynamicLoading THEN
  2862. Strings.Append(s, "=> no dynamic linking.");
  2863. Warning(position, s);
  2864. END;
  2865. canBeLoaded := FALSE;
  2866. END;
  2867. RETURN FALSE
  2868. ELSE
  2869. SELF.module.imports.AddName(moduleName)
  2870. END;
  2871. ELSIF import.module = NIL THEN (* already tried *)
  2872. RETURN FALSE
  2873. END;
  2874. module := import.module;
  2875. END;
  2876. RETURN TRUE
  2877. END AddImport;
  2878. (* needed for old binary object file format*)
  2879. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2880. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2881. BEGIN
  2882. IF AddImport(moduleName,module,TRUE) THEN
  2883. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2884. IF procedure = NIL THEN
  2885. s := "Instruction not supported on target, emulation procedure ";
  2886. Strings.Append(s,moduleName);
  2887. Strings.Append(s,".");
  2888. Strings.Append(s,procedureName);
  2889. Strings.Append(s," not present");
  2890. Error(position,s);
  2891. ELSE
  2892. StaticCallOperand(r,procedure);
  2893. ReleaseOperand(r);
  2894. fp := GetFingerprint(procedure);
  2895. END;
  2896. END;
  2897. END EnsureSymbol;
  2898. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2899. VAR exit: Label; trueL,falseL: Label;
  2900. BEGIN
  2901. trueL := NewLabel();
  2902. falseL := NewLabel();
  2903. exit := NewLabel();
  2904. Condition(x,trueL,falseL);
  2905. InitOperand(result,ModeValue);
  2906. SetLabel(trueL);
  2907. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2908. Emit(Mov(position,result.op,true));
  2909. BrL(exit);
  2910. SetLabel(falseL);
  2911. Emit(MovReplace(position,result.op,false));
  2912. SetLabel(exit);
  2913. END ConditionToValue;
  2914. PROCEDURE ValueToCondition(VAR op: Operand);
  2915. BEGIN
  2916. LoadValue(op,system.booleanType);
  2917. BrneL(trueLabel,op.op, false);
  2918. ReleaseOperand(op);
  2919. BrL(falseLabel);
  2920. END ValueToCondition;
  2921. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2922. VAR size: LONGINT;
  2923. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2924. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2925. BEGIN
  2926. ASSERT(type.form = SyntaxTree.Open);
  2927. baseType := type.arrayBase.resolved;
  2928. IF IsOpenArray(baseType) THEN
  2929. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2930. ELSE
  2931. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2932. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2933. END;
  2934. len := tag;
  2935. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2936. IntermediateCode.MakeMemory(len,addressType);
  2937. UseIntermediateOperand(len);
  2938. Reuse2(res,sizeOperand,len);
  2939. Emit(Mul(position,res,sizeOperand,len));
  2940. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2941. RETURN res
  2942. END GetArraySize;
  2943. BEGIN
  2944. type := type.resolved;
  2945. IF IsOpenArray(type) THEN
  2946. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2947. RETURN tag
  2948. ELSE
  2949. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2950. END;
  2951. ELSE
  2952. size := ToMemoryUnits(system,system.SizeOf(type));
  2953. RETURN IntermediateCode.Immediate(addressType,size)
  2954. END;
  2955. END GetDynamicSize;
  2956. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2957. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2958. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2959. BEGIN
  2960. ASSERT(type.form = SyntaxTree.Open);
  2961. baseType := type.arrayBase.resolved;
  2962. IF IsOpenArray(baseType) THEN
  2963. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2964. ELSE
  2965. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2966. END;
  2967. len := tag;
  2968. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2969. IntermediateCode.MakeMemory(len,addressType);
  2970. UseIntermediateOperand(len);
  2971. Reuse2(res,sizeOperand,len);
  2972. Emit(Mul(position,res,sizeOperand,len));
  2973. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2974. RETURN res
  2975. END GetLength;
  2976. BEGIN
  2977. type := type.resolved;
  2978. IF IsOpenArray(type) THEN
  2979. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2980. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2981. ELSIF type IS SyntaxTree.StringType THEN
  2982. RETURN tag;
  2983. ELSE
  2984. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2985. END;
  2986. END GetArrayLength;
  2987. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2988. VAR result: IntermediateCode.Operand;
  2989. BEGIN
  2990. IF backend.cooperative THEN
  2991. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2992. ELSE
  2993. MakeMemory(result, tag, addressType, 0);
  2994. END;
  2995. RETURN result
  2996. END GetSizeFromTag;
  2997. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2998. VAR parameter: SyntaxTree.Parameter;
  2999. BEGIN
  3000. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  3001. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  3002. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3003. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  3004. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3005. END;
  3006. RETURN GetDynamicSize(e.type, tag);
  3007. END GetArrayOfBytesSize;
  3008. (*
  3009. to find imported symbol. not needed ?
  3010. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  3011. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  3012. BEGIN
  3013. IF AddImport(moduleName,importedModule,FALSE) THEN
  3014. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  3015. RETURN symbol
  3016. ELSE
  3017. RETURN NIL
  3018. END
  3019. END SymbolByName;
  3020. *)
  3021. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3022. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3023. BEGIN
  3024. IF AddImport(moduleName,runtimeModule,force) THEN
  3025. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3026. IF procedure = NIL THEN
  3027. s := "Procedure ";
  3028. Strings.Append(s,moduleName);
  3029. Strings.Append(s,".");
  3030. Strings.Append(s,procedureName);
  3031. Strings.Append(s," not present");
  3032. Error(position,s);
  3033. RETURN FALSE
  3034. ELSE
  3035. RETURN TRUE
  3036. END;
  3037. ELSE RETURN FALSE
  3038. END;
  3039. END GetRuntimeProcedure;
  3040. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3041. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3042. s: Basic.MessageString;
  3043. BEGIN
  3044. Basic.InitSegmentedName(name);
  3045. name[0] := Basic.MakeString(moduleName);
  3046. name[1] := Basic.MakeString(typeName);
  3047. name[2] := -1;
  3048. IF AddImport(moduleName,importedModule, FALSE) THEN
  3049. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3050. IF symbol = NIL THEN
  3051. s := "type ";
  3052. Strings.Append(s,moduleName);
  3053. Strings.Append(s,".");
  3054. Strings.Append(s,typeName);
  3055. Strings.Append(s," not present");
  3056. Error(position,s);
  3057. END;
  3058. ELSE symbol := NIL;
  3059. END;
  3060. IF importedModule = moduleScope.ownerModule THEN
  3061. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3062. ELSE
  3063. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3064. END;
  3065. RETURN symbol
  3066. END GetTypeDescriptor;
  3067. (* 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. *)
  3068. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3069. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3070. pooledName: Basic.SegmentedName; size: LONGINT;
  3071. BEGIN
  3072. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3073. StaticCallOperand(result,procedure);
  3074. IF numberParameters < 0 THEN
  3075. size := ProcParametersSize(procedure);
  3076. ELSE
  3077. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3078. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3079. Error(position,"runtime call parameter count mismatch");
  3080. END;
  3081. END;
  3082. Emit(Call(position, result.op, size));
  3083. ReleaseOperand(result);
  3084. ELSE (* only static linking possible *)
  3085. ASSERT(numberParameters >= 0);
  3086. Basic.InitSegmentedName(pooledName);
  3087. pooledName[0] := Basic.MakeString(moduleName);
  3088. pooledName[1] := Basic.MakeString(procedureName);
  3089. pooledName[2] := -1;
  3090. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3091. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3092. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3093. END;
  3094. END CallThisChecked;
  3095. (* 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. *)
  3096. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3097. BEGIN
  3098. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3099. END CallThis;
  3100. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  3101. VAR
  3102. left,right: Operand;
  3103. leftSize, rightSize: IntermediateCode.Operand;
  3104. saved: RegisterEntry;
  3105. reg: IntermediateCode.Operand;
  3106. procedureName: SyntaxTree.IdentifierString;
  3107. BEGIN
  3108. procedureName := "CompareString";
  3109. SaveRegisters();ReleaseUsedRegisters(saved);
  3110. Designate(leftExpression,left);
  3111. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3112. Emit(Push(position,leftSize));
  3113. ReleaseIntermediateOperand(leftSize);
  3114. Emit(Push(position,left.op));
  3115. ReleaseOperand(left);
  3116. Designate(rightExpression,right);
  3117. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3118. Emit(Push(position,rightSize));
  3119. ReleaseIntermediateOperand(rightSize);
  3120. Emit(Push(position,right.op));
  3121. ReleaseOperand(right);
  3122. CallThis(position,builtinsModuleName,procedureName, 4);
  3123. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3124. Emit(Result(position,reg));
  3125. (*
  3126. AcquireThisRegister(int8,IntermediateCode.Result);
  3127. *)
  3128. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3129. (*
  3130. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3131. *)
  3132. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3133. ReleaseIntermediateOperand(reg);
  3134. BrL(falseLabel);
  3135. END CompareString;
  3136. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3137. VAR
  3138. left,right: Operand;
  3139. leftSize, rightSize: IntermediateCode.Operand;
  3140. saved: RegisterEntry;
  3141. procedureName: SyntaxTree.IdentifierString;
  3142. BEGIN
  3143. procedureName := "CopyString";
  3144. SaveRegisters();ReleaseUsedRegisters(saved);
  3145. Designate(leftExpression,left);
  3146. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3147. Emit(Push(position,leftSize));
  3148. ReleaseIntermediateOperand(leftSize);
  3149. Emit(Push(position,left.op));
  3150. ReleaseOperand(left);
  3151. Designate(rightExpression,right);
  3152. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3153. Emit(Push(position,rightSize));
  3154. ReleaseIntermediateOperand(rightSize);
  3155. Emit(Push(position,right.op));
  3156. ReleaseOperand(right);
  3157. CallThis(position,builtinsModuleName,procedureName,4);
  3158. RestoreRegisters(saved);
  3159. END CopyString;
  3160. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3161. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3162. leftType,rightType: SyntaxTree.Type;
  3163. leftExpression,rightExpression : SyntaxTree.Expression;
  3164. componentType: IntermediateCode.Type;
  3165. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3166. size: LONGINT;
  3167. BEGIN
  3168. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3169. dest := destination; destination := emptyOperand;
  3170. leftType := x.left.type.resolved;
  3171. rightType := x.right.type.resolved;
  3172. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3173. CASE x.operator OF
  3174. Scanner.Or:
  3175. (* shortcut evaluation of left OR right *)
  3176. IF ~conditional THEN ConditionToValue(x);
  3177. ELSE
  3178. next := NewLabel();
  3179. Condition(x.left,trueLabel,next);
  3180. SetLabel(next);
  3181. Condition(x.right,trueLabel,falseLabel);
  3182. END;
  3183. |Scanner.And:
  3184. (* shortcut evaluation of left & right *)
  3185. IF ~conditional THEN ConditionToValue(x);
  3186. ELSE
  3187. next := NewLabel();
  3188. Condition(x.left,next,falseLabel);
  3189. SetLabel(next);
  3190. Condition(x.right,trueLabel,falseLabel);
  3191. END;
  3192. |Scanner.Is:
  3193. IF ~conditional THEN ConditionToValue(x);
  3194. ELSE
  3195. (* get type desc tag *)
  3196. IF IsPointerToRecord(leftType,recordType) THEN
  3197. Evaluate(x.left,left);
  3198. Dereference(left,recordType,IsUnsafePointer(leftType))
  3199. ELSE
  3200. Designate(x.left,left);
  3201. END;
  3202. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel,FALSE);
  3203. ReleaseOperand(left);
  3204. END;
  3205. |Scanner.Plus:
  3206. Evaluate(x.left,left);
  3207. Evaluate(x.right,right);
  3208. IF leftType IS SyntaxTree.SetType THEN
  3209. InitOperand(result,ModeValue);
  3210. Reuse2a(result.op,left.op,right.op,dest);
  3211. Emit(Or(position,result.op,left.op,right.op));
  3212. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3213. InitOperand(result,ModeValue);
  3214. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3215. Reuse2(result.tag,left.tag,right.tag);
  3216. Emit(Add(position,result.op,left.op,right.op));
  3217. Emit(Add(position,result.tag,left.tag,right.tag))
  3218. ELSE
  3219. InitOperand(result,ModeValue);
  3220. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3221. AddInt(result.op, left.op, right.op) ;
  3222. ELSE
  3223. *)
  3224. Reuse2a(result.op,left.op,right.op,dest);
  3225. Emit(Add(position,result.op,left.op,right.op));
  3226. (*
  3227. END;
  3228. *)
  3229. END;
  3230. ReleaseOperand(left); ReleaseOperand(right);
  3231. |Scanner.Minus:
  3232. Evaluate(x.left,left);
  3233. Evaluate(x.right,right);
  3234. IF leftType IS SyntaxTree.SetType THEN
  3235. InitOperand(result,ModeValue);
  3236. Reuse1(result.op,right.op);
  3237. Emit(Not(position,result.op,right.op));
  3238. ReleaseOperand(right);
  3239. Emit(And(position,result.op,result.op,left.op));
  3240. ReleaseOperand(left);
  3241. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3242. InitOperand(result,ModeValue);
  3243. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3244. Reuse2(result.tag,left.tag,right.tag);
  3245. Emit(Sub(position,result.op,left.op,right.op));
  3246. Emit(Sub(position,result.tag,left.tag,right.tag));
  3247. ReleaseOperand(left); ReleaseOperand(right)
  3248. ELSE
  3249. InitOperand(result,ModeValue);
  3250. Reuse2a(result.op,left.op,right.op,dest);
  3251. Emit(Sub(position,result.op,left.op,right.op));
  3252. ReleaseOperand(left); ReleaseOperand(right);
  3253. END;
  3254. |Scanner.Times:
  3255. Evaluate(x.left,left);
  3256. Evaluate(x.right,right);
  3257. IF leftType IS SyntaxTree.SetType THEN
  3258. InitOperand(result,ModeValue);
  3259. Reuse2a(result.op,left.op,right.op,dest);
  3260. Emit(And(position,result.op,left.op,right.op));
  3261. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3262. InitOperand(result, ModeValue);
  3263. componentType := left.op.type;
  3264. (* TODO: review this *)
  3265. (*
  3266. result.op = left.op * right.op - left.tag * right.tag
  3267. result.tag = left.tag * right.op + left.op * right.tag
  3268. *)
  3269. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3270. Emit(Mul(position,result.op, left.op, right.op));
  3271. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3272. Emit(Mul(position,tempReg, left.tag, right.tag));
  3273. Emit(Sub(position,result.op, result.op, tempReg));
  3274. Reuse2(result.tag, left.tag, right.op);
  3275. Emit(Mul(position,result.tag, left.tag, right.op));
  3276. Emit(Mul(position,tempReg, left.op, right.tag));
  3277. Emit(Add(position,result.tag, result.tag, tempReg));
  3278. ReleaseIntermediateOperand(tempReg)
  3279. ELSE
  3280. InitOperand(result,ModeValue);
  3281. Reuse2a(result.op,left.op,right.op,dest);
  3282. Emit(Mul(position,result.op,left.op,right.op));
  3283. END;
  3284. ReleaseOperand(left); ReleaseOperand(right);
  3285. |Scanner.Div:
  3286. Evaluate(x.left,left);
  3287. Evaluate(x.right,right);
  3288. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3289. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3290. IF ~isUnchecked THEN
  3291. exit := NewLabel();
  3292. BrltL(exit,zero,right.op);
  3293. EmitTrap(position,NegativeDivisorTrap);
  3294. SetLabel(exit);
  3295. END;
  3296. END;
  3297. InitOperand(result,ModeValue);
  3298. Reuse2a(result.op,left.op,right.op,dest);
  3299. Emit(Div(position,result.op,left.op,right.op));
  3300. ReleaseOperand(left); ReleaseOperand(right);
  3301. |Scanner.Mod:
  3302. Evaluate(x.left,left);
  3303. Evaluate(x.right,right);
  3304. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3305. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3306. IF ~isUnchecked THEN
  3307. exit := NewLabel();
  3308. BrltL(exit,zero,right.op);
  3309. EmitTrap(position,NegativeDivisorTrap);
  3310. SetLabel(exit);
  3311. END;
  3312. END;
  3313. InitOperand(result,ModeValue);
  3314. Reuse2a(result.op,left.op,right.op,dest);
  3315. Emit(Mod(position,result.op,left.op,right.op));
  3316. ReleaseOperand(left); ReleaseOperand(right);
  3317. |Scanner.Slash:
  3318. Evaluate(x.left,left);
  3319. Evaluate(x.right,right);
  3320. IF leftType IS SyntaxTree.SetType THEN
  3321. InitOperand(result,ModeValue);
  3322. Reuse2a(result.op,left.op,right.op,dest);
  3323. Emit(Xor(position,result.op,left.op,right.op));
  3324. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3325. InitOperand(result,ModeValue);
  3326. componentType := left.op.type;
  3327. (* review this *)
  3328. (*
  3329. divisor = right.op * right.op + right.tag * right.tag
  3330. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3331. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3332. *)
  3333. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3334. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3335. Emit(Mul(position,tempReg, right.op, right.op));
  3336. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3337. Emit(Add(position,tempReg, tempReg, tempReg2));
  3338. result.op := tempReg2;
  3339. Emit(Mul(position,result.op, left.op, right.op));
  3340. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3341. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3342. Emit(Add(position,result.op, result.op, tempReg2));
  3343. Emit(Div(position,result.op, result.op, tempReg));
  3344. Reuse2(result.tag, left.tag, right.op);
  3345. Emit(Mul(position,result.tag, left.tag, right.op));
  3346. Emit(Mul(position,tempReg2, left.op, right.tag));
  3347. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3348. Emit(Div(position,result.tag, result.tag, tempReg));
  3349. ReleaseIntermediateOperand(tempReg);
  3350. ReleaseIntermediateOperand(tempReg2)
  3351. ELSE
  3352. InitOperand(result,ModeValue);
  3353. Reuse2a(result.op,left.op,right.op,dest);
  3354. Emit(Div(position,result.op,left.op,right.op));
  3355. END;
  3356. ReleaseOperand(left); ReleaseOperand(right);
  3357. |Scanner.Equal:
  3358. IF ~conditional THEN ConditionToValue(x);
  3359. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3360. CompareString(BreqL,x.left,x.right);
  3361. ELSE
  3362. Evaluate(x.left,left);
  3363. Evaluate(x.right,right);
  3364. IF leftType IS SyntaxTree.RangeType THEN
  3365. ASSERT(rightType IS SyntaxTree.RangeType);
  3366. BrneL(falseLabel, left.op, right.op); (* first *)
  3367. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3368. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3369. ReleaseOperand(left); ReleaseOperand(right);
  3370. BrL(trueLabel)
  3371. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3372. BrneL(falseLabel, left.op, right.op); (* first *)
  3373. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3374. ReleaseOperand(left); ReleaseOperand(right);
  3375. BrL(trueLabel)
  3376. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3377. (* TODO: review this *)
  3378. BrneL(falseLabel, left.op, right.op); (* real part *)
  3379. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3380. ReleaseOperand(left); ReleaseOperand(right);
  3381. BrL(trueLabel)
  3382. ELSE
  3383. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3384. ReleaseOperand(left); ReleaseOperand(right);
  3385. BrL(trueLabel);
  3386. END;
  3387. END;
  3388. |Scanner.LessEqual:
  3389. IF ~conditional THEN ConditionToValue(x);
  3390. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3391. CompareString(BrgeL,x.right,x.left);
  3392. ELSE
  3393. Evaluate(x.left,left);
  3394. Evaluate(x.right,right);
  3395. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3396. Reuse1(temp.op,right.op);
  3397. Emit(And(position,temp.op,left.op,right.op));
  3398. ReleaseOperand(right);
  3399. BreqL(trueLabel,temp.op,left.op);
  3400. BrL(falseLabel);
  3401. ReleaseOperand(temp);ReleaseOperand(left);
  3402. ELSE
  3403. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3404. ReleaseOperand(left); ReleaseOperand(right);
  3405. BrL(trueLabel);
  3406. END;
  3407. END;
  3408. |Scanner.Less:
  3409. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3410. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3411. leftExpression.SetType(system.booleanType);
  3412. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3413. rightExpression.SetType(system.booleanType);
  3414. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3415. leftExpression.SetType(system.booleanType);
  3416. Expression(leftExpression);
  3417. ELSIF ~conditional THEN ConditionToValue(x);
  3418. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3419. CompareString(BrltL,x.left,x.right);
  3420. ELSE
  3421. Evaluate(x.left,left);
  3422. Evaluate(x.right,right);
  3423. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3424. ReleaseOperand(left); ReleaseOperand(right);
  3425. BrL(trueLabel);
  3426. END;
  3427. |Scanner.Greater:
  3428. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3429. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3430. leftExpression.SetType(system.booleanType);
  3431. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3432. rightExpression.SetType(system.booleanType);
  3433. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3434. leftExpression.SetType(system.booleanType);
  3435. Expression(leftExpression);
  3436. ELSIF ~conditional THEN ConditionToValue(x);
  3437. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3438. CompareString(BrltL,x.right,x.left);
  3439. ELSE
  3440. Evaluate(x.left,left);
  3441. Evaluate(x.right,right);
  3442. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3443. ReleaseOperand(left); ReleaseOperand(right);
  3444. BrL(trueLabel);
  3445. END;
  3446. |Scanner.GreaterEqual:
  3447. IF ~conditional THEN ConditionToValue(x);
  3448. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3449. CompareString(BrgeL,x.left,x.right);
  3450. ELSE
  3451. Evaluate(x.left,left);
  3452. Evaluate(x.right,right);
  3453. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3454. Reuse1(temp.op,left.op);
  3455. Emit(And(position,temp.op,left.op,right.op));
  3456. ReleaseOperand(left);
  3457. BreqL(trueLabel, temp.op,right.op);
  3458. ReleaseOperand(temp); ReleaseOperand(right);
  3459. BrL(falseLabel);
  3460. ELSE
  3461. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3462. ReleaseOperand(left); ReleaseOperand(right);
  3463. BrL(trueLabel);
  3464. END;
  3465. END;
  3466. |Scanner.Unequal:
  3467. IF ~conditional THEN ConditionToValue(x);
  3468. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3469. CompareString(BrneL,x.left,x.right);
  3470. ELSE
  3471. Evaluate(x.left,left);
  3472. Evaluate(x.right,right);
  3473. IF leftType IS SyntaxTree.RangeType THEN
  3474. ASSERT(rightType IS SyntaxTree.RangeType);
  3475. BrneL(trueLabel, left.op, right.op); (* first *)
  3476. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3477. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3478. ReleaseOperand(left); ReleaseOperand(right);
  3479. BrL(falseLabel)
  3480. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3481. BrneL(trueLabel, left.op, right.op); (* first *)
  3482. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3483. ReleaseOperand(left); ReleaseOperand(right);
  3484. BrL(falseLabel)
  3485. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3486. (* TODO: review this *)
  3487. BrneL(trueLabel, left.op, right.op); (* real part *)
  3488. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3489. ReleaseOperand(left); ReleaseOperand(right);
  3490. BrL(falseLabel)
  3491. ELSE
  3492. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3493. ReleaseOperand(left); ReleaseOperand(right);
  3494. BrL(trueLabel);
  3495. END;
  3496. END;
  3497. |Scanner.In:
  3498. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3499. Evaluate(x.left,left);
  3500. Evaluate(x.right,right);
  3501. Convert(left.op,setType);
  3502. Convert(right.op,setType);
  3503. ReuseCopy(temp.op,right.op);
  3504. Emit(Shr(position,temp.op,temp.op,left.op));
  3505. ReleaseOperand(right); ReleaseOperand(left);
  3506. IntermediateCode.InitImmediate(one,setType,1);
  3507. Emit(And(position,temp.op,temp.op,one));
  3508. IF conditional THEN
  3509. IntermediateCode.InitImmediate(zero,setType,0);
  3510. BrneL(trueLabel,temp.op,zero);
  3511. ReleaseOperand(temp);
  3512. BrL(falseLabel);
  3513. ELSE
  3514. Convert(temp.op,bool);
  3515. result.mode := ModeValue;
  3516. result.op := temp.op;
  3517. result.tag := nil; (* may be left over from calls to evaluate *)
  3518. END;
  3519. ELSE
  3520. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3521. IF x.operator = Scanner.Questionmarks THEN
  3522. leftExpression := x.left;
  3523. rightExpression := x.right;
  3524. ELSE
  3525. leftExpression := x.right;
  3526. rightExpression := x.left;
  3527. END;
  3528. Evaluate(leftExpression, left);
  3529. Emit(Push(position,left.op));
  3530. ReleaseOperand(left);
  3531. Designate(rightExpression, right);
  3532. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3533. IF ~backend.cellsAreObjects THEN
  3534. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3535. END;
  3536. Emit(Push(position,right.op));
  3537. ReleaseOperand(right);
  3538. IF backend.cellsAreObjects THEN
  3539. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3540. ELSE
  3541. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3542. END;
  3543. InitOperand(result, ModeValue);
  3544. result.op := NewRegisterOperand(bool);
  3545. Emit(Result(position,result.op));
  3546. IF conditional THEN
  3547. IntermediateCode.InitImmediate(zero,setType,0);
  3548. BrneL(trueLabel,result.op,zero);
  3549. ReleaseOperand(result);
  3550. BrL(falseLabel);
  3551. END;
  3552. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3553. leftExpression := x.left;
  3554. rightExpression := x.right;
  3555. Evaluate(leftExpression, left);
  3556. Emit(Push(position,left.op));
  3557. ReleaseOperand(left);
  3558. Evaluate(rightExpression, right);
  3559. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3560. IF ~backend.cellsAreObjects THEN
  3561. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3562. END;
  3563. Emit(Push(position,right.op));
  3564. ReleaseOperand(right);
  3565. IF backend.cellsAreObjects THEN
  3566. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3567. ELSE
  3568. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3569. END;
  3570. InitOperand(result, ModeValue);
  3571. result.op := NewRegisterOperand(bool);
  3572. Emit(Result(position,result.op));
  3573. IF conditional THEN
  3574. IntermediateCode.InitImmediate(zero,setType,0);
  3575. BrneL(trueLabel,result.op,zero);
  3576. ReleaseOperand(result);
  3577. BrL(falseLabel);
  3578. END;
  3579. ELSE
  3580. HALT(100);
  3581. END;
  3582. END;
  3583. destination := dest;
  3584. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3585. END VisitBinaryExpression;
  3586. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3587. VAR localResult, operand: Operand;
  3588. BEGIN
  3589. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3590. InitOperand(localResult, ModeValue);
  3591. ASSERT(x.first # NIL);
  3592. Evaluate(x.first, operand);
  3593. localResult.op := operand.op;
  3594. ReleaseOperand(operand);
  3595. UseIntermediateOperand(localResult.op);
  3596. ASSERT(x.last # NIL);
  3597. Evaluate(x.last, operand);
  3598. localResult.tag := operand.op;
  3599. ReleaseOperand(operand);
  3600. UseIntermediateOperand(localResult.tag);
  3601. IF x.step # NIL THEN
  3602. Evaluate(x.step, operand);
  3603. localResult.extra := operand.op;
  3604. ReleaseOperand(operand);
  3605. UseIntermediateOperand(localResult.extra);
  3606. END;
  3607. result := localResult;
  3608. IF Trace THEN TraceExit("VisitRangeExpression") END
  3609. END VisitRangeExpression;
  3610. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3611. BEGIN
  3612. HALT(100); (* should never be evaluated *)
  3613. END VisitTensorRangeExpression;
  3614. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3615. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3616. BEGIN
  3617. IF Trace THEN TraceEnter("VisitConversion") END;
  3618. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3619. dest := destination; destination := emptyOperand;
  3620. Evaluate(x.expression,old);
  3621. InitOperand(result,ModeValue);
  3622. result.op := old.op;
  3623. ASSERT(result.op.mode # 0);
  3624. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3625. (* convert TO a complex number *)
  3626. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3627. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3628. ASSERT(result.op.mode # 0);
  3629. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3630. (* convert FROM a complex number TO a complex number*)
  3631. result.tag := old.tag;
  3632. ASSERT(result.tag.mode # 0);
  3633. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3634. ASSERT(result.tag.mode # 0)
  3635. ELSE
  3636. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3637. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3638. END
  3639. ELSE
  3640. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3641. ASSERT(result.op.mode # 0);
  3642. result.tag := old.tag; (*! probably never used *)
  3643. END;
  3644. destination := dest;
  3645. IF Trace THEN TraceExit("VisitConversion") END;
  3646. END VisitConversion;
  3647. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3648. BEGIN
  3649. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3650. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3651. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3652. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3653. END VisitTypeDeclaration;
  3654. (** designators (expressions) *)
  3655. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3656. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3657. BEGIN
  3658. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3659. IF x.left # NIL THEN Expression(x.left) END;
  3660. Symbol(x.symbol,result);
  3661. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3662. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3663. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3664. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3665. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3666. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3667. END;
  3668. END;
  3669. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3670. END VisitSymbolDesignator;
  3671. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3672. BEGIN
  3673. IF isUnchecked THEN RETURN END;
  3674. IF tagsAvailable THEN
  3675. TrapC(BrltL,index,length,IndexCheckTrap);
  3676. END;
  3677. END BoundCheck;
  3678. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3679. VAR d: IntermediateCode.Operand;
  3680. BEGIN
  3681. IF isUnchecked THEN RETURN END;
  3682. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3683. TrapC(op,dim,d,ArraySizeTrap);
  3684. ReleaseIntermediateOperand(d);
  3685. END DimensionCheck;
  3686. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3687. VAR
  3688. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3689. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3690. expression: SyntaxTree.Expression;
  3691. resultingType, leftType, baseType: SyntaxTree.Type;
  3692. skipLabel1: Label;
  3693. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3694. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3695. variableOp: Operand;
  3696. variable: SyntaxTree.Variable;
  3697. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3698. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3699. VAR e: SyntaxTree.Expression; i: LONGINT;
  3700. BEGIN
  3701. tensorFound := FALSE;
  3702. FOR i := 0 TO parameters.Length()-1 DO
  3703. e := parameters.GetExpression(i);
  3704. IF e IS SyntaxTree.TensorRangeExpression THEN
  3705. ASSERT(~tensorFound);
  3706. tensorFound := TRUE;
  3707. ELSIF e IS SyntaxTree.RangeExpression THEN
  3708. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3709. ELSE
  3710. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3711. END;
  3712. END;
  3713. END CountIndices;
  3714. BEGIN
  3715. ASSERT(tagsAvailable);
  3716. resultingType := x.type.resolved; (* resulting type *)
  3717. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3718. InitOperand(localResult, ModeReference);
  3719. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3720. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3721. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3722. (* a globally defined array destination tag is available -> use and invalidate it*)
  3723. localResult.tag := arrayDestinationTag;
  3724. IntermediateCode.InitOperand(arrayDestinationTag)
  3725. ELSE
  3726. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3727. (* the result is of array range type and thus does not provide any collectable pointers *)
  3728. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3729. Symbol(variable, variableOp);
  3730. ReuseCopy(localResult.tag, variableOp.op);
  3731. ReleaseOperand(variableOp);
  3732. END
  3733. END;
  3734. indexListSize := x.parameters.Length();
  3735. CountIndices(x.parameters);
  3736. (*ASSERT(tensorRangeCount <= 1);*)
  3737. (* designate the array to be indexed over, perform tensor range check if known *)
  3738. Designate(x.left, array);
  3739. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3740. Dereference(array, leftType,FALSE);
  3741. IF ~tensorFound THEN
  3742. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3743. END
  3744. END;
  3745. (* default base offset *)
  3746. srcDimOffset := 0;
  3747. destDimOffset := 0;
  3748. indexDim := 0;
  3749. (* use address of source array as basis *)
  3750. localResult.op := array.op;
  3751. UseIntermediateOperand(localResult.op);
  3752. (* go through the index list *)
  3753. FOR i := 0 TO indexListSize - 1 DO
  3754. expression := x.parameters.GetExpression(i);
  3755. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3756. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3757. srcDimOffset := -indexListSize;
  3758. destDimOffset := -suffixRanges;
  3759. ELSE
  3760. (* determine which dimension of source array is currently looked at *)
  3761. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3762. (* get the memory operand pointing to array descriptor dimension *)
  3763. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3764. (* make a reusable register from it *)
  3765. ReuseCopy(srcDim, tmp);
  3766. ReleaseIntermediateOperand(tmp);
  3767. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3768. ELSE
  3769. srcDim := IntermediateCode.Immediate(sizeType, i);
  3770. END;
  3771. (* get length and increment of source array for current dimension *)
  3772. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3773. Convert(sourceLength.op, sizeType);
  3774. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3775. Convert(sourceIncrement.op, sizeType);
  3776. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3777. ReleaseIntermediateOperand(srcDim);
  3778. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3779. (* SINGLE INDEX *)
  3780. Evaluate(expression, index);
  3781. ReleaseIntermediateOperand(index.tag);
  3782. index.tag := emptyOperand;
  3783. Convert(index.op, sizeType);
  3784. (* lower bound check *)
  3785. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3786. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3787. ELSIF isUnchecked THEN (* do nothing *)
  3788. ELSE
  3789. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3790. END;
  3791. (* upper bound check *)
  3792. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3793. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3794. ELSIF isUnchecked THEN (* do nothing *)
  3795. ELSE
  3796. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3797. END;
  3798. ReleaseOperand(sourceLength);
  3799. Convert(index.op, addressType);
  3800. summand := index.op;
  3801. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3802. (* RANGE OF INDICES *)
  3803. Evaluate(expression, range);
  3804. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3805. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3806. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3807. ReleaseOperand(range);
  3808. Convert(firstIndex, sizeType);
  3809. Convert(lastIndex, sizeType);
  3810. Convert(stepSize, sizeType);
  3811. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3812. if it is 'MAX(LONGINT)' *)
  3813. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3814. TransferToRegister(lastIndex, lastIndex);
  3815. skipLabel1 := NewLabel();
  3816. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3817. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3818. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3819. SetLabel(skipLabel1)
  3820. END;
  3821. (* check if step size is valid *)
  3822. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3823. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3824. ELSIF isUnchecked THEN (* do nothing *)
  3825. ELSE
  3826. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3827. END;
  3828. (* check lower bound check *)
  3829. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3830. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3831. ELSIF isUnchecked THEN (* do nothing *)
  3832. ELSE
  3833. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3834. END;
  3835. (* check upper bound check *)
  3836. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3837. (* statically open range: nothing to do *)
  3838. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3839. ASSERT(staticLastIndex < staticSourceLength)
  3840. ELSIF isUnchecked THEN (* do nothing *)
  3841. ELSE
  3842. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3843. END;
  3844. (* determine length of target array for current dimension *)
  3845. (* 1. incorporate last index: *)
  3846. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3847. (* last index is static *)
  3848. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3849. targetLength := sourceLength.op
  3850. ELSE
  3851. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3852. END;
  3853. UseIntermediateOperand(targetLength);
  3854. ELSE
  3855. (* targetLength := lastIndex + 1
  3856. Reuse1(targetLength, lastIndex);
  3857. *)
  3858. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3859. END;
  3860. ReleaseOperand(sourceLength);
  3861. ReleaseIntermediateOperand(lastIndex);
  3862. (* 2. incorporate first index: *)
  3863. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3864. (* first index and current target length are static *)
  3865. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3866. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3867. (* first index = 0: nothing to do *)
  3868. ELSE
  3869. (* targetLength := targetLength - firstIndex *)
  3870. TransferToRegister(targetLength, targetLength);
  3871. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3872. END;
  3873. (* clip negative lengths to 0 *)
  3874. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3875. IF staticTargetLength < 0 THEN
  3876. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3877. END
  3878. ELSE
  3879. skipLabel1 := NewLabel();
  3880. TransferToRegister(targetLength, targetLength);
  3881. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3882. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3883. SetLabel(skipLabel1)
  3884. END;
  3885. (* 3. incorporate index step size: *)
  3886. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3887. (*step size and current target length are static *)
  3888. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3889. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3890. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3891. (* step size = 1: nothing to do *)
  3892. ELSE
  3893. (* emit code for this:
  3894. targetLength := (targetLength-1) DIV stepSize +1;
  3895. *)
  3896. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3897. DivInt(targetLength, targetLength, stepSize);
  3898. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3899. END;
  3900. (* determine increment of target array for current dimension *)
  3901. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3902. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3903. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3904. (* step size = 1 *)
  3905. targetIncrement := sourceIncrement.op;
  3906. UseIntermediateOperand(targetIncrement)
  3907. ELSE
  3908. (* targetIncrement := sourceIncrement * stepSize *)
  3909. Reuse1(targetIncrement, stepSize);
  3910. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3911. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3912. END;
  3913. ReleaseIntermediateOperand(stepSize);
  3914. (* write length and increment of target array to descriptor *)
  3915. IF destDimOffset < 0 THEN
  3916. (* determine which dimension of target array is currently looked at *)
  3917. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3918. TransferToRegister(destDim, tmp);
  3919. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3920. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3921. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3922. ReleaseIntermediateOperand(destDim);
  3923. INC(destDimOffset);
  3924. ELSE
  3925. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3926. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3927. END;
  3928. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3929. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3930. INC(indexDim);
  3931. Convert(firstIndex, addressType);
  3932. TransferToRegister(summand, firstIndex);
  3933. ELSE HALT(100);
  3934. END;
  3935. (*
  3936. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3937. *)
  3938. Convert(sourceIncrement.op, addressType);
  3939. Convert(summand, addressType);
  3940. MulInt(summand, summand, sourceIncrement.op);
  3941. ReleaseIntermediateOperand(sourceIncrement.op);
  3942. AddInt(localResult.op, localResult.op, summand);
  3943. ReleaseIntermediateOperand(summand);
  3944. END
  3945. END;
  3946. result := localResult;
  3947. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3948. ReleaseIntermediateOperand(result.tag);
  3949. result.tag := TypeDescriptorAdr(resultingType);
  3950. ELSIF IsDelegate(resultingType) THEN
  3951. ReleaseIntermediateOperand(result.tag);
  3952. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3953. UseIntermediateOperand(result.tag);
  3954. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3955. ReleaseIntermediateOperand(result.tag);
  3956. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3957. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3958. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3959. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3960. (* finalize target array descriptor *)
  3961. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3962. (* write lengths and increments of target array for remaining dimensions *)
  3963. i := indexListSize;
  3964. WHILE indexDim < targetArrayDimensionality DO
  3965. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3966. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3967. ReleaseOperand(sourceLength);
  3968. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3969. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3970. ReleaseOperand(sourceIncrement);
  3971. INC(i); INC(indexDim);
  3972. END;
  3973. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3974. tmp := nil;
  3975. ELSE
  3976. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3977. END;
  3978. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3979. ReleaseIntermediateOperand(tmp);
  3980. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3981. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3982. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3983. ELSE
  3984. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3985. END;
  3986. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3987. ReleaseIntermediateOperand(tmp);
  3988. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3989. (* write dimensionality *)
  3990. IF targetArrayDimensionality # 0 THEN
  3991. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3992. END;
  3993. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3994. END;
  3995. ReleaseOperand(array);
  3996. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3997. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3998. END;
  3999. END MathIndexDesignator;
  4000. (* get the length of an array , trying to make use of static information *)
  4001. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  4002. VAR res: IntermediateCode.Operand; size: LONGINT;
  4003. BEGIN
  4004. type := type.resolved;
  4005. IF type IS SyntaxTree.ArrayType THEN
  4006. WITH type: SyntaxTree.ArrayType DO
  4007. IF type.form = SyntaxTree.Static THEN
  4008. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  4009. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4010. Evaluate(type.length, op);
  4011. ReleaseIntermediateOperand(op.tag);
  4012. RETURN op.op;*)
  4013. ELSE
  4014. res := tag;
  4015. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4016. IntermediateCode.MakeMemory(res,addressType);
  4017. UseIntermediateOperand(res);
  4018. RETURN res
  4019. END
  4020. END;
  4021. ELSE
  4022. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4023. RETURN IntermediateCode.Immediate(addressType,size);
  4024. END;
  4025. END ArrayLength;
  4026. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4027. BEGIN
  4028. IF IsImmediate(x) THEN
  4029. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4030. ELSE
  4031. IF ~ReusableRegister(res) THEN
  4032. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4033. ELSE
  4034. UseIntermediateOperand(res);
  4035. END;
  4036. Emit(Mov(position,res,x))
  4037. END;
  4038. END CopyInt;
  4039. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4040. BEGIN
  4041. ReleaseIntermediateOperand(res);
  4042. IF IsImmediate(x) & IsImmediate(y) THEN
  4043. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4044. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4045. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4046. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4047. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4048. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4049. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4050. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4051. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4052. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4053. UseIntermediateOperand(res);
  4054. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4055. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4056. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4057. UseIntermediateOperand(res);
  4058. ELSE
  4059. IF ~ReusableRegister(res) THEN
  4060. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4061. ELSE
  4062. UseIntermediateOperand(res);
  4063. END;
  4064. IF IsImmediate(x) & (x.intValue = 0) THEN
  4065. Emit(Mov(position,res,y))
  4066. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4067. Emit(Mov(position,res,x))
  4068. ELSE
  4069. Emit(Add(position,res, x, y));
  4070. END;
  4071. END;
  4072. END AddInt;
  4073. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4074. BEGIN
  4075. ReleaseIntermediateOperand(res);
  4076. IF IsImmediate(x) & IsImmediate(y) THEN
  4077. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4078. ELSE
  4079. IF ~ReusableRegister(res) THEN
  4080. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4081. ELSE UseIntermediateOperand(res);
  4082. END;
  4083. IF IsImmediate(x) & (x.intValue = 1) THEN
  4084. Emit(Mov(position,res,y))
  4085. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4086. Emit(Mov(position,res,x))
  4087. ELSE
  4088. Emit(Mul(position,res, x, y));
  4089. END;
  4090. END;
  4091. END MulInt;
  4092. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4093. BEGIN
  4094. ReleaseIntermediateOperand(res);
  4095. IF IsImmediate(x) & IsImmediate(y) THEN
  4096. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4097. ELSE
  4098. IF ~ReusableRegister(res) THEN
  4099. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4100. ELSE UseIntermediateOperand(res);
  4101. END;
  4102. IF IsImmediate(x) & (x.intValue = 1) THEN
  4103. Emit(Mov(position,res,y))
  4104. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4105. Emit(Mov(position,res,x))
  4106. ELSE
  4107. Emit(Div(position,res, x, y));
  4108. END;
  4109. END;
  4110. END DivInt;
  4111. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4112. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4113. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4114. BEGIN
  4115. type := x.left.type.resolved;
  4116. IF type IS SyntaxTree.StringType THEN
  4117. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4118. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4119. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4120. type := atype;
  4121. x.left.SetType(type);
  4122. END;
  4123. IntermediateCode.InitImmediate(res,addressType,0);
  4124. maxDim := x.parameters.Length()-1;
  4125. (*
  4126. computation rule:
  4127. a: ARRAY X,Y,Z OF Element with size S
  4128. a[i,j,k] -->
  4129. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4130. *)
  4131. FOR i := 0 TO maxDim DO
  4132. e := x.parameters.GetExpression(i);
  4133. Evaluate(e,index);
  4134. Convert(index.op,addressType);
  4135. AddInt(res, res, index.op);
  4136. IF i = 0 THEN
  4137. (*
  4138. ReuseCopy(res, index.op);
  4139. *)
  4140. Designate(x.left,array);
  4141. type := x.left.type.resolved;
  4142. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4143. Dereference(array, type, FALSE);
  4144. END;
  4145. (*
  4146. ELSE AddInt(res, res, index.op);
  4147. *)
  4148. END;
  4149. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4150. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4151. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4152. BoundCheck(index.op, length);
  4153. END;
  4154. ReleaseIntermediateOperand(length);
  4155. END;
  4156. ReleaseOperand(index);
  4157. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4158. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4159. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4160. MulInt(res,res,length);
  4161. END;
  4162. ReleaseIntermediateOperand(length);
  4163. END;
  4164. (* remaining open dimensions -- compute address *)
  4165. i := maxDim+1;
  4166. IF type IS SyntaxTree.ArrayType THEN
  4167. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4168. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4169. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4170. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4171. MulInt(res,res,length);
  4172. END;
  4173. ReleaseIntermediateOperand(length);
  4174. INC(i);
  4175. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4176. END;
  4177. END;
  4178. IF (type IS SyntaxTree.ArrayType) THEN
  4179. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4180. size := StaticSize(system, type);
  4181. IF size # 1 THEN
  4182. length := IntermediateCode.Immediate(addressType,size);
  4183. MulInt(res,res,length);
  4184. END;
  4185. ELSE
  4186. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4187. IF size # 1 THEN
  4188. length := IntermediateCode.Immediate(addressType,size);
  4189. MulInt(res,res,length);
  4190. END;
  4191. END;
  4192. END;
  4193. AddInt(res,res,array.op);
  4194. InitOperand(result,ModeReference);
  4195. result.op := res;
  4196. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4197. ReleaseIntermediateOperand(result.tag);
  4198. result.tag := TypeDescriptorAdr(type);
  4199. ELSIF IsDelegate(type) THEN
  4200. ReleaseIntermediateOperand(result.tag);
  4201. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4202. UseIntermediateOperand(result.tag);
  4203. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4204. ReleaseIntermediateOperand(result.tag);
  4205. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4206. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4207. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4208. END;
  4209. ReleaseOperand(array);
  4210. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4211. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4212. END;
  4213. END IndexDesignator;
  4214. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4215. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4216. BEGIN
  4217. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4218. dest := destination; destination := emptyOperand;
  4219. type := x.left.type.resolved;
  4220. IF type IS SyntaxTree.MathArrayType THEN
  4221. MathIndexDesignator(x);
  4222. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4223. IndexDesignator(x);
  4224. END;
  4225. destination := dest;
  4226. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4227. END VisitIndexDesignator;
  4228. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4229. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4230. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4231. procedure: SyntaxTree.Procedure;
  4232. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4233. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4234. BEGIN
  4235. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4236. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4237. parameters := expression.parameters;
  4238. moduleName := "FoxArrayBase";
  4239. procedureName := "CopyDescriptor";
  4240. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4241. SaveRegisters();ReleaseUsedRegisters(saved);
  4242. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4243. IF procedure = NIL THEN
  4244. s := "procedure ";
  4245. Strings.Append(s,moduleName);
  4246. Strings.Append(s,".");
  4247. Strings.Append(s,procedureName);
  4248. Strings.Append(s," not present");
  4249. Error(position,s);
  4250. ELSE
  4251. (* push address of temporary variable *)
  4252. Symbol(variable,destOperand);
  4253. Emit(Push(position,destOperand.op));
  4254. ReleaseOperand(destOperand);
  4255. (* push src *)
  4256. Evaluate(expression.left,srcOperand);
  4257. (*
  4258. Dereference(srcOperand,expression.type.resolved);
  4259. Emit(Push(position,srcOperand.tag));
  4260. *)
  4261. Emit(Push(position,srcOperand.op));
  4262. ReleaseOperand(srcOperand);
  4263. tensorFound := FALSE;
  4264. FOR i := 0 TO parameters.Length()-1 DO
  4265. e := parameters.GetExpression(i);
  4266. IF e IS SyntaxTree.TensorRangeExpression THEN
  4267. tensorFound := TRUE;
  4268. ELSIF e IS SyntaxTree.RangeExpression THEN
  4269. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4270. ELSE
  4271. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4272. END;
  4273. END;
  4274. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4275. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4276. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4277. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4278. StaticCallOperand(procOp,procedure);
  4279. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4280. ReleaseOperand(procOp);
  4281. END;
  4282. RestoreRegisters(saved);
  4283. END;
  4284. RETURN variable
  4285. END PrepareTensorDescriptor;
  4286. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; register: WORD);
  4287. VAR
  4288. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4289. operand, tmpOperand, variableOp, variable2Op: Operand;
  4290. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4291. variable, variable2: SyntaxTree.Variable;
  4292. dim, i, size: LONGINT;
  4293. (* TODO: needed? *)
  4294. oldArrayDestinationTag: IntermediateCode.Operand;
  4295. oldArrayDestinationDimension: LONGINT;
  4296. position: Position;
  4297. saved: RegisterEntry;
  4298. arrayFlags: SET;
  4299. m, n: LONGINT;
  4300. PROCEDURE Pass(op: IntermediateCode.Operand);
  4301. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4302. BEGIN
  4303. IF register >= 0 THEN
  4304. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  4305. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4306. Emit(Mov(position,parameterRegister, op));
  4307. ELSE
  4308. Emit(Push(position,op))
  4309. END
  4310. END Pass;
  4311. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4312. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4313. BEGIN
  4314. formalType := formalType.resolved; actualType := actualType.resolved;
  4315. IF IsOpenArray(formalType)THEN
  4316. IF actualType IS SyntaxTree.StringType THEN
  4317. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4318. RETURN;
  4319. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4320. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4321. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4322. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4323. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4324. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4325. ELSE
  4326. tmp := baseReg;
  4327. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4328. IntermediateCode.MakeMemory(tmp,addressType);
  4329. Pass((tmp));
  4330. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4331. END;
  4332. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4333. END;
  4334. END PushArrayLens;
  4335. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4336. BEGIN
  4337. CASE size OF
  4338. |2: INCL(flags,Size2Flag);
  4339. |3: INCL(flags,Size3Flag);
  4340. |4: INCL(flags,Size4Flag);
  4341. |5: INCL(flags,Size5Flag);
  4342. |6: INCL(flags,Size6Flag);
  4343. |7: INCL(flags,Size7Flag);
  4344. |8: INCL(flags,Size8Flag);
  4345. END;
  4346. END SetSmallArraySizeFlag;
  4347. BEGIN
  4348. IF Trace THEN TraceEnter("PushParameter") END;
  4349. position := expression.position;
  4350. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4351. type := expression.type.resolved;
  4352. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4353. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4354. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4355. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4356. );
  4357. (* TODO: needed? *)
  4358. oldArrayDestinationTag := arrayDestinationTag;
  4359. oldArrayDestinationDimension := arrayDestinationDimension;
  4360. IF IsArrayOfSystemByte(parameter.type) THEN
  4361. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4362. Designate(expression,operand);
  4363. ELSE
  4364. Evaluate(expression, tmpOperand);
  4365. (* array of system byte does not provide any pointers *)
  4366. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4367. Symbol(variable, operand);
  4368. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4369. Emit(Mov(position,tmp, tmpOperand.op));
  4370. ReleaseOperand(tmpOperand);
  4371. END;
  4372. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4373. ReleaseIntermediateOperand(operand.tag);
  4374. operand.tag := tmp;
  4375. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4376. Pass((operand.tag));
  4377. END;
  4378. Pass((operand.op));
  4379. ELSIF IsOpenArray(parameter.type) THEN
  4380. Designate(expression,operand);
  4381. baseReg := operand.tag;
  4382. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4383. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4384. END;
  4385. Pass((operand.op)); (* address of the array *)
  4386. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4387. (* case 1
  4388. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4389. *)
  4390. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4391. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4392. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4393. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4394. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4395. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4396. arrayDestinationTag := sp;
  4397. (* case 1b
  4398. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4399. *)
  4400. IF expression IS SyntaxTree.IndexDesignator THEN
  4401. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4402. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4403. arrayDestinationDimension := dim;
  4404. Designate(expression,operand);
  4405. (* case 1a
  4406. P(...,A,...) push: push array descriptor to stack
  4407. *)
  4408. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4409. Designate(expression,operand);
  4410. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4411. i := 0;
  4412. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4413. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4414. INC(i);
  4415. END;
  4416. type := expression.type.resolved;
  4417. WHILE (i<dim) DO (* remaining static dimensions *)
  4418. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4419. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4420. ReleaseOperand(tmpOperand);
  4421. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4422. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4423. ReleaseOperand(tmpOperand);
  4424. INC(i);
  4425. END;
  4426. dimOp := IntermediateCode.Immediate(addressType,dim);
  4427. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4428. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4429. (* case 1d
  4430. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4431. + case 1e
  4432. P(.. PT() ... );
  4433. *)
  4434. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4435. Designate(expression,operand);
  4436. Dereference(operand,type.resolved,FALSE);
  4437. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4438. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4439. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4440. (* case 1f
  4441. P(...,S,...) push: create array descriptor to S on stack
  4442. case 1g
  4443. P(... PS()...)
  4444. *)
  4445. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4446. Designate(expression,operand);
  4447. FOR i := 0 TO dim-1 DO
  4448. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4449. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4450. ReleaseOperand(tmpOperand);
  4451. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4452. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4453. ReleaseOperand(tmpOperand);
  4454. END;
  4455. (*******
  4456. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4457. *)
  4458. arrayFlags := {StaticFlag};
  4459. IF dim = 1 THEN
  4460. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4461. ReleaseOperand(tmpOperand);
  4462. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4463. m := LONGINT(tmpOperand.op.intValue);
  4464. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4465. ELSIF dim = 2 THEN
  4466. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4467. ReleaseOperand(tmpOperand);
  4468. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4469. m := LONGINT(tmpOperand.op.intValue);
  4470. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4471. ReleaseOperand(tmpOperand);
  4472. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4473. n := LONGINT(tmpOperand.op.intValue);
  4474. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4475. INCL(arrayFlags,SmallMatrixFlag);
  4476. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4477. END;
  4478. END;
  4479. (*******)
  4480. dimOp := IntermediateCode.Immediate(addressType,dim);
  4481. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4482. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4483. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4484. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4485. baseType := SemanticChecker.ArrayBase(type,dim);
  4486. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4487. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4488. ELSE HALT(100);
  4489. END;
  4490. (* case 2
  4491. procedure P([left args], var A: array [*,*] of Type, [right args])
  4492. *)
  4493. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4494. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4495. (* case 2b
  4496. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4497. push: push reference to pushed array descriptor
  4498. post: remove array descriptor.
  4499. *)
  4500. IF expression IS SyntaxTree.IndexDesignator THEN
  4501. descriptorType := GetMathArrayDescriptorType(dim);
  4502. (* range type : no allocation possible, should be untraced *)
  4503. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4504. Symbol(variable,variableOp);
  4505. arrayDestinationTag := variableOp.op;
  4506. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4507. arrayDestinationDimension := dim;
  4508. NeedDescriptor := TRUE;
  4509. Designate(expression,operand);
  4510. Pass((operand.tag));
  4511. NeedDescriptor := FALSE;
  4512. (* case 2a
  4513. P(...,A,...)
  4514. push: push reference to array descriptor on stack
  4515. *)
  4516. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4517. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4518. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4519. INC(i);
  4520. END;
  4521. IF i = dim THEN
  4522. Designate(expression,operand);
  4523. Pass((operand.tag));
  4524. ELSE (* open-static *)
  4525. type := expression.type.resolved;
  4526. descriptorType := GetMathArrayDescriptorType(dim);
  4527. (* static array , cannot be reallocated, untraced !*)
  4528. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4529. Symbol(variable,variableOp);
  4530. arrayDestinationTag := variableOp.op;
  4531. Designate(expression,operand);
  4532. FOR i := 0 TO dim-1 DO
  4533. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4534. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4535. ReleaseOperand(tmpOperand);
  4536. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4537. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4538. ReleaseOperand(tmpOperand);
  4539. END;
  4540. dimOp := IntermediateCode.Immediate(addressType,dim);
  4541. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4542. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4543. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4544. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4545. baseType := SemanticChecker.ArrayBase(type,dim);
  4546. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4547. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4548. Pass((arrayDestinationTag));
  4549. END;
  4550. (* case 2d
  4551. P(...,T,...) push: emit dimension check, push T
  4552. *)
  4553. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4554. Designate(expression,operand);
  4555. Dereference(operand,type.resolved,FALSE);
  4556. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4557. Pass((operand.tag));
  4558. (* case 2f
  4559. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4560. push: push reference to pushed array descriptor
  4561. post: remove array descriptor
  4562. *)
  4563. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4564. descriptorType := GetMathArrayDescriptorType(dim);
  4565. (* static array -- cannot be reallocatated, untraced *)
  4566. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4567. Symbol(variable,variableOp);
  4568. arrayDestinationTag := variableOp.op;
  4569. Designate(expression,operand);
  4570. FOR i := 0 TO dim-1 DO
  4571. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4572. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4573. ReleaseOperand(tmpOperand);
  4574. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4575. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4576. ReleaseOperand(tmpOperand);
  4577. END;
  4578. (*
  4579. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4580. *)
  4581. arrayFlags := {StaticFlag};
  4582. IF dim = 1 THEN
  4583. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4584. ReleaseOperand(tmpOperand);
  4585. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4586. m := LONGINT(tmpOperand.op.intValue);
  4587. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4588. ELSIF dim = 2 THEN
  4589. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4590. ReleaseOperand(tmpOperand);
  4591. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4592. m := LONGINT(tmpOperand.op.intValue);
  4593. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4594. ReleaseOperand(tmpOperand);
  4595. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4596. n := LONGINT(tmpOperand.op.intValue);
  4597. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4598. INCL(arrayFlags,SmallMatrixFlag);
  4599. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4600. END;
  4601. END;
  4602. (*******)
  4603. dimOp := IntermediateCode.Immediate(addressType,dim);
  4604. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4605. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4606. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4607. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4608. baseType := SemanticChecker.ArrayBase(type,dim);
  4609. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4610. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4611. Pass((arrayDestinationTag));
  4612. ELSE HALT(100);
  4613. END;
  4614. (* case 3
  4615. procedure P([left args], [const] A: array [?] of Type, [right args])
  4616. *)
  4617. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4618. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4619. (* case 3b
  4620. P(...,A[a..b,c..d],...)
  4621. *)
  4622. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4623. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4624. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4625. Symbol(variable,variableOp);
  4626. LoadValue(variableOp,system.addressType);
  4627. ELSE
  4628. descriptorType := GetMathArrayDescriptorType(dim);
  4629. (* range -- cannot be reallocated *)
  4630. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4631. Symbol(variable,variableOp);
  4632. END;
  4633. arrayDestinationTag := variableOp.op;
  4634. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4635. arrayDestinationDimension := 0;
  4636. Designate(expression,operand);
  4637. Pass((operand.tag));
  4638. (* case 3a
  4639. P(...,A,...)
  4640. *)
  4641. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4642. i := 0;
  4643. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4644. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4645. INC(i);
  4646. END;
  4647. IF i = dim THEN
  4648. Designate(expression,operand);
  4649. Pass((operand.tag));
  4650. ELSE (* open-static *)
  4651. type := expression.type.resolved;
  4652. descriptorType := GetMathArrayDescriptorType(dim);
  4653. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4654. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4655. Symbol(variable,variableOp);
  4656. arrayDestinationTag := variableOp.op;
  4657. Designate(expression,operand);
  4658. FOR i := 0 TO dim-1 DO
  4659. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4660. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4661. ReleaseOperand(tmpOperand);
  4662. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4663. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4664. ReleaseOperand(tmpOperand);
  4665. END;
  4666. dimOp := IntermediateCode.Immediate(addressType,dim);
  4667. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4668. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4669. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4670. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4671. baseType := SemanticChecker.ArrayBase(type,dim);
  4672. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4673. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4674. Pass((arrayDestinationTag));
  4675. END;
  4676. (* case 3d
  4677. P(...,T,...)
  4678. case 3e
  4679. P(...,PT(...),...)
  4680. *)
  4681. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4682. Designate(expression,operand);
  4683. Dereference(operand,type.resolved,FALSE);
  4684. Pass((operand.tag));
  4685. (* case 3f
  4686. P(...,S,...)
  4687. case 3g
  4688. P(...,PS(...),...)
  4689. *)
  4690. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4691. descriptorType := GetMathArrayDescriptorType(dim);
  4692. (* static array does not need to be traced *)
  4693. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4694. Symbol(variable,variableOp);
  4695. arrayDestinationTag := variableOp.op;
  4696. Designate(expression,operand);
  4697. IF operand.op.type.length >1 THEN (* vector register *)
  4698. (* static array does not need to be traced *)
  4699. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4700. Symbol(variable2, variable2Op);
  4701. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4702. Emit(Mov(position,tmp, operand.op));
  4703. ReleaseOperand(operand);
  4704. Symbol(variable2, operand);
  4705. END;
  4706. FOR i := 0 TO dim-1 DO
  4707. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4708. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4709. ReleaseOperand(tmpOperand);
  4710. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4711. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4712. ReleaseOperand(tmpOperand);
  4713. END;
  4714. dimOp := IntermediateCode.Immediate(addressType,dim);
  4715. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4716. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4717. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4718. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4719. baseType := SemanticChecker.ArrayBase(type,dim);
  4720. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4721. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4722. Pass((arrayDestinationTag));
  4723. ELSE HALT(100);
  4724. END;
  4725. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4726. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4727. (* case 4b
  4728. P(...,A[a..b,c..d],...)
  4729. *)
  4730. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4731. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4732. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4733. Symbol(variable,variableOp);
  4734. LoadValue(variableOp,system.addressType);
  4735. ELSE
  4736. descriptorType := GetMathArrayDescriptorType(dim);
  4737. (* range array -- cannot be allocated *)
  4738. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4739. Symbol(variable,variableOp);
  4740. END;
  4741. arrayDestinationTag := variableOp.op;
  4742. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4743. arrayDestinationDimension := 0;
  4744. Designate(expression,operand);
  4745. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4746. Symbol(variable,variableOp);
  4747. ELSE
  4748. (* alias to range -- untraced *)
  4749. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4750. Symbol(variable,variableOp);
  4751. MakeMemory(tmp,variableOp.op,addressType,0);
  4752. Emit(Mov(position,tmp,operand.tag));
  4753. ReleaseIntermediateOperand(tmp);
  4754. END;
  4755. Pass((variableOp.op));
  4756. ReleaseOperand(variableOp);
  4757. (* case 4a
  4758. P(...,A,...)
  4759. *)
  4760. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4761. i := 0;
  4762. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4763. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4764. INC(i);
  4765. END;
  4766. IF i = dim THEN
  4767. Designate(expression,operand);
  4768. arrayDestinationTag := operand.tag;
  4769. ELSE (* open-static *)
  4770. type := expression.type.resolved;
  4771. descriptorType := GetMathArrayDescriptorType(dim);
  4772. (* static array -- untraced *)
  4773. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4774. Symbol(variable,variableOp);
  4775. arrayDestinationTag := variableOp.op;
  4776. Designate(expression,operand);
  4777. FOR i := 0 TO dim-1 DO
  4778. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4779. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4780. ReleaseOperand(tmpOperand);
  4781. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4782. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4783. ReleaseOperand(tmpOperand);
  4784. END;
  4785. dimOp := IntermediateCode.Immediate(addressType,dim);
  4786. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4787. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4788. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4789. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4790. baseType := SemanticChecker.ArrayBase(type,dim);
  4791. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4792. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4793. END;
  4794. (* tensor alias to open array -- untraced *)
  4795. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4796. Symbol(variable,variableOp);
  4797. MakeMemory(tmp,variableOp.op,addressType,0);
  4798. Emit(Mov(position,tmp,arrayDestinationTag));
  4799. ReleaseIntermediateOperand(tmp);
  4800. Pass((variableOp.op));
  4801. ReleaseOperand(variableOp);
  4802. (* case 4d
  4803. P(...,T,...)
  4804. *)
  4805. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4806. Designate(expression,operand);
  4807. Pass((operand.op));
  4808. (* case 4f
  4809. P(...,S,...)
  4810. *)
  4811. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4812. descriptorType := GetMathArrayDescriptorType(dim);
  4813. (* static array -- cannot be reallocated, untraced *)
  4814. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4815. Symbol(variable,variableOp);
  4816. arrayDestinationTag := variableOp.op;
  4817. Designate(expression,operand);
  4818. FOR i := 0 TO dim-1 DO
  4819. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4820. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4821. ReleaseOperand(tmpOperand);
  4822. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4823. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4824. ReleaseOperand(tmpOperand);
  4825. END;
  4826. dimOp := IntermediateCode.Immediate(addressType,dim);
  4827. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4828. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4829. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4830. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4831. baseType := SemanticChecker.ArrayBase(type,dim);
  4832. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4833. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4834. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4835. Symbol(variable,variableOp);
  4836. MakeMemory(tmp,variableOp.op,addressType,0);
  4837. Emit(Mov(position,tmp,arrayDestinationTag));
  4838. ReleaseIntermediateOperand(tmp);
  4839. Pass((variableOp.op));
  4840. ReleaseOperand(variableOp);
  4841. ELSE HALT(100);
  4842. END;
  4843. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4844. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4845. Designate(expression,operand);
  4846. IF operand.op.type.length > 1 THEN
  4847. Emit(Push(position, operand.op));
  4848. ELSE
  4849. size := system.SizeOf(type);
  4850. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4851. size := ToMemoryUnits(system,size);
  4852. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4853. arrayDestinationTag := sp;
  4854. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4855. END;
  4856. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4857. Designate(expression,operand);
  4858. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4859. (* static array no pointer *)
  4860. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4861. Symbol(variable,variableOp);
  4862. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4863. Emit(Mov(position,tmp,operand.op));
  4864. Emit(Push(position,variableOp.op));
  4865. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4866. Pass((operand.op));
  4867. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4868. END;
  4869. ELSE HALT(200)
  4870. END;
  4871. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4872. IF parameter.kind = SyntaxTree.VarParameter THEN
  4873. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4874. Designate(expression, operand);
  4875. Pass((operand.op));
  4876. ELSE
  4877. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4878. Evaluate(expression, operand);
  4879. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  4880. Pass((operand.extra)); (* step *)
  4881. Pass((operand.tag)); (* last *)
  4882. Pass((operand.op)); (* first *)
  4883. ELSE
  4884. (* pass range as structure in order to comply with the variable alignment of its components *)
  4885. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4886. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  4887. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4888. tmp := sp;
  4889. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4890. Emit(Mov(position,tmp,operand.op)); (* first *)
  4891. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  4892. IntermediateCode.AddOffset(tmp,size);
  4893. Emit(Mov(position,tmp,operand.tag)); (* last *)
  4894. IntermediateCode.AddOffset(tmp,size);
  4895. Emit(Mov(position,tmp,operand.extra)); (* step *)
  4896. END;
  4897. END
  4898. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4899. IF parameter.kind = SyntaxTree.VarParameter THEN
  4900. Designate(expression, operand);
  4901. Pass((operand.op));
  4902. ELSE
  4903. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4904. Evaluate(expression, operand);
  4905. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4906. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4907. Pass((operand.tag)); (* imaginary part *)
  4908. Pass((operand.op)) (* real part *)
  4909. ELSE
  4910. (* pass complex as structure in order to comply with the variable alignment of its components *)
  4911. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4912. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  4913. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4914. tmp := sp;
  4915. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4916. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4917. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  4918. IntermediateCode.AddOffset(tmp,size);
  4919. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4920. END
  4921. END
  4922. ELSE
  4923. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4924. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4925. Designate(expression,operand);
  4926. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4927. (* stack allocation *)
  4928. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4929. (*! parameter alignment to be discussed ... *)
  4930. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4931. size := type(SyntaxTree.StringType).length;
  4932. END;
  4933. IF backend.cooperative & parameter.NeedsTrace() THEN
  4934. dst := NewRegisterOperand (addressType);
  4935. Emit(Mov(position,dst, sp));
  4936. IntermediateCode.InitImmediate(null, byteType, 0);
  4937. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4938. ReleaseIntermediateOperand(dst);
  4939. SaveRegisters();ReleaseUsedRegisters(saved);
  4940. (* register dst has been freed before SaveRegisters already *)
  4941. CallAssignMethod(dst, operand.op, parameter.type);
  4942. RestoreRegisters(saved);
  4943. END;
  4944. IF operand.op.type.length > 1 THEN (* vector *)
  4945. MakeMemory(tmp,sp,operand.op.type,0);
  4946. Emit(Mov(position, tmp, operand.op));
  4947. ELSE
  4948. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4949. END;
  4950. ELSIF IsOpenArray(parameter.type) THEN
  4951. Designate(expression,operand);
  4952. baseReg := operand.tag;
  4953. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4954. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4955. END;
  4956. Pass((operand.op)); (* address of the array *)
  4957. ELSIF IsDelegate(parameter.type) THEN
  4958. Evaluate(expression,operand);
  4959. IF backend.cooperative & parameter.NeedsTrace() THEN
  4960. Emit(Push(position, nil));
  4961. dst := NewRegisterOperand (addressType);
  4962. Emit(Mov(position,dst, sp));
  4963. ReleaseIntermediateOperand(dst);
  4964. SaveRegisters();ReleaseUsedRegisters(saved);
  4965. Emit(Push(position, dst));
  4966. (* register dst has been freed before SaveRegisters already *)
  4967. Emit(Push(position, operand.tag));
  4968. CallThis(position,"GarbageCollector","Assign",2);
  4969. RestoreRegisters(saved);
  4970. ELSE
  4971. Pass((operand.tag));
  4972. END;
  4973. Pass((operand.op));
  4974. ELSE
  4975. Evaluate(expression,operand);
  4976. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4977. Emit(Push(position, nil));
  4978. dst := NewRegisterOperand (addressType);
  4979. Emit(Mov(position,dst, sp));
  4980. ReleaseIntermediateOperand(dst);
  4981. SaveRegisters();ReleaseUsedRegisters(saved);
  4982. Emit(Push(position, dst));
  4983. (* register dst has been freed before SaveRegisters already *)
  4984. Emit(Push(position, operand.op));
  4985. CallThis(position,"GarbageCollector","Assign",2);
  4986. RestoreRegisters(saved);
  4987. ELSE
  4988. Pass((operand.op));
  4989. END;
  4990. END;
  4991. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4992. Evaluate(expression,operand);
  4993. Pass((operand.op));
  4994. ELSE (* var parameter *)
  4995. Designate(expression,operand);
  4996. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4997. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4998. Pass((operand.tag));
  4999. END;
  5000. END;
  5001. Pass((operand.op));
  5002. END;
  5003. END;
  5004. (* TODO: needed? *)
  5005. arrayDestinationTag := oldArrayDestinationTag;
  5006. arrayDestinationDimension := oldArrayDestinationDimension;
  5007. IF needsParameterBackup THEN
  5008. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5009. ReuseCopy(parameterBackup, operand.op)
  5010. END;
  5011. ReleaseOperand(operand);
  5012. IF Trace THEN TraceExit("PushParameter") END;
  5013. END PushParameter;
  5014. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  5015. VAR prevConditional: BOOLEAN;
  5016. BEGIN
  5017. prevConditional := conditional;
  5018. conditional := FALSE;
  5019. 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
  5020. Expression(x.result); (* use register *)
  5021. END;
  5022. Statement(x.statement);
  5023. conditional := prevConditional;
  5024. IF x.result # NIL THEN Expression(x.result) END;
  5025. 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
  5026. ReleaseIntermediateOperand(result.op);
  5027. END;
  5028. END VisitStatementDesignator;
  5029. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  5030. VAR
  5031. procedure: SyntaxTree.Procedure;
  5032. procedureType: SyntaxTree.ProcedureType;
  5033. wasInline: BOOLEAN;
  5034. actualParameters: SyntaxTree.ExpressionList;
  5035. formalParameter: SyntaxTree.Parameter;
  5036. actualParameter: SyntaxTree.Expression;
  5037. i: LONGINT;
  5038. localVariable: SyntaxTree.Variable;
  5039. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5040. src, dest: Operand;
  5041. prevInlineExit : Label;
  5042. prevMapper: SymbolMapper;
  5043. tooComplex: BOOLEAN;
  5044. resultDesignator: SyntaxTree.Expression;
  5045. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5046. BEGIN
  5047. IF e = NIL THEN RETURN TRUE
  5048. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5049. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5050. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5051. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5052. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5053. ELSE RETURN FALSE
  5054. END;
  5055. END SimpleExpression;
  5056. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5057. BEGIN
  5058. RETURN checker.CanPassInRegister(type)
  5059. END FitsInRegister;
  5060. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5061. VAR
  5062. variable: SyntaxTree.Variable;
  5063. variableDesignator: SyntaxTree.Designator;
  5064. BEGIN
  5065. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5066. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5067. variableDesignator.SetType(type);
  5068. RETURN variableDesignator
  5069. END GetTemp;
  5070. BEGIN
  5071. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5072. wasInline := currentIsInline;
  5073. prevInlineExit := currentInlineExit;
  5074. prevMapper := currentMapper;
  5075. currentInlineExit := NewLabel();
  5076. tooComplex := FALSE;
  5077. NEW(currentMapper);
  5078. currentIsInline := TRUE;
  5079. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5080. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5081. formalParameter := procedureType.firstParameter;
  5082. actualParameters := x.parameters;
  5083. i := 0;
  5084. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5085. actualParameter := actualParameters.GetExpression(i);
  5086. IF actualParameter.resolved # NIL THEN
  5087. actualParameter := actualParameter.resolved
  5088. END;
  5089. (*
  5090. if expression is simple and can be passed immediately
  5091. or if type fits in register then we can proceed
  5092. otherwise we escape to ordinary procedure call.
  5093. *)
  5094. (* cases where the expression can be mapped identically *)
  5095. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5096. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5097. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5098. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5099. (*
  5100. Assign(variableDesignator, actualParameter);
  5101. *)
  5102. Evaluate(actualParameter, src);
  5103. Designate(variableDesignator, dest);
  5104. Emit(Mov(x.position, dest.op, src.op));
  5105. ReleaseOperand(dest);
  5106. ReleaseOperand(src);
  5107. (* the src operand should now have been completely released ! *)
  5108. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5109. ELSE tooComplex := TRUE
  5110. END;
  5111. (*
  5112. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5113. currentMapper.Add(formalParameter, actualParameter, NIL);
  5114. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5115. variableDesignator := GetTemp(system.addressType, FALSE);
  5116. Designate(actualParameter, src);
  5117. Designate(variableDesignator, dest);
  5118. IntermediateCode.MakeMemory(dest.op,addressType);
  5119. Emit(Mov(x.position, dest.op, src.op));
  5120. ReleaseOperand(dest);
  5121. IF src.tag.mode # IntermediateCode.Undefined THEN
  5122. tagDesignator := GetTemp(system.addressType, FALSE);
  5123. Designate(tagDesignator, dest);
  5124. IntermediateCode.MakeMemory(dest.op,addressType);
  5125. Emit(Mov(x.position, dest.op, src.op));
  5126. END;
  5127. ReleaseOperand(dest); ReleaseOperand(src);
  5128. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5129. END;
  5130. *)
  5131. formalParameter := formalParameter.nextParameter;
  5132. INC(i);
  5133. END;
  5134. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5135. IF resultDesignator # NIL THEN
  5136. returnDesignator := resultDesignator
  5137. ELSE
  5138. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5139. END;
  5140. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5141. END;
  5142. localVariable := procedure.procedureScope.firstVariable;
  5143. WHILE ~tooComplex & (localVariable # NIL) DO
  5144. variableDesignator := GetTemp(localVariable.type, FALSE);
  5145. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5146. localVariable := localVariable.nextVariable;
  5147. END;
  5148. IF ~tooComplex THEN
  5149. VisitStatementBlock(procedure.procedureScope.body);
  5150. SetLabel(currentInlineExit);
  5151. IF procedureType.returnType # NIL THEN
  5152. Designate(returnDesignator, result);
  5153. IF conditional THEN
  5154. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5155. ValueToCondition(result)
  5156. END;
  5157. END;
  5158. END;
  5159. currentMapper := prevMapper;
  5160. currentInlineExit := prevInlineExit;
  5161. currentIsInline := wasInline;
  5162. RETURN ~tooComplex
  5163. END InlineProcedureCall;
  5164. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5165. VAR
  5166. parameters: SyntaxTree.ExpressionList;
  5167. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5168. designator: SyntaxTree.Designator;
  5169. procedureType: SyntaxTree.ProcedureType;
  5170. formalParameter: SyntaxTree.Parameter;
  5171. operand, returnValue: Operand;
  5172. reg, size, mask, dest: IntermediateCode.Operand;
  5173. saved,saved2: RegisterEntry;
  5174. symbol: SyntaxTree.Symbol;
  5175. variable: SyntaxTree.Variable;
  5176. i, parametersSize, returnTypeSize : LONGINT;
  5177. structuredReturnType: BOOLEAN;
  5178. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5179. tempVariableDesignator: SyntaxTree.Designator;
  5180. gap, alignment: LONGINT; (*fld*)
  5181. (* TODO: remove unnecessary backup variables *)
  5182. oldResult: Operand;
  5183. oldCurrentScope: SyntaxTree.Scope;
  5184. oldArrayDestinationTag: IntermediateCode.Operand;
  5185. oldArrayDestinationDimension: LONGINT;
  5186. oldConstantDeclaration: SyntaxTree.Symbol;
  5187. oldDestination: IntermediateCode.Operand;
  5188. oldCurrentLoop: Label;
  5189. oldConditional: BOOLEAN;
  5190. oldTrueLabel, oldFalseLabel: Label;
  5191. oldLocked: BOOLEAN;
  5192. usedRegisters,oldUsedRegisters: RegisterEntry;
  5193. return: IntermediateCode.Operand;
  5194. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5195. arg: IntermediateCode.Operand;
  5196. dummy: IntermediateCode.Operand;
  5197. recordType: SyntaxTree.RecordType;
  5198. operatorSelectionProcedureOperand: Operand;
  5199. operatorSelectionProcedure: SyntaxTree.Procedure;
  5200. fingerPrint: SyntaxTree.FingerPrint;
  5201. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5202. identifierNumber: LONGINT;
  5203. parameterRegisters: SIZE;
  5204. registers: ARRAY 64 OF WORD;
  5205. procedure: SyntaxTree.Procedure;
  5206. callingConvention: SyntaxTree.CallingConvention;
  5207. type: IntermediateCode.Type;
  5208. PROCEDURE BackupGlobalState;
  5209. BEGIN
  5210. oldResult := result;
  5211. oldCurrentScope := currentScope;
  5212. oldArrayDestinationTag := arrayDestinationTag;
  5213. oldArrayDestinationDimension := arrayDestinationDimension;
  5214. oldConstantDeclaration := constantDeclaration;
  5215. oldDestination := destination;
  5216. oldCurrentLoop := currentLoop;
  5217. oldConditional := conditional;
  5218. oldTrueLabel := trueLabel;
  5219. oldFalseLabel := falseLabel;
  5220. oldLocked := locked;
  5221. oldUsedRegisters := usedRegisters
  5222. END BackupGlobalState;
  5223. PROCEDURE RestoreGlobalState;
  5224. BEGIN
  5225. result := oldResult;
  5226. currentScope := oldCurrentScope;
  5227. arrayDestinationTag := oldArrayDestinationTag;
  5228. arrayDestinationDimension := oldArrayDestinationDimension;
  5229. constantDeclaration := oldConstantDeclaration;
  5230. destination := oldDestination;
  5231. currentLoop := oldCurrentLoop;
  5232. conditional := oldConditional;
  5233. trueLabel := oldTrueLabel;
  5234. falseLabel := oldFalseLabel;
  5235. locked := oldLocked;
  5236. usedRegisters := oldUsedRegisters
  5237. END RestoreGlobalState;
  5238. (** do preparations before parameter push for array-structured object types (ASOTs):
  5239. if ASOT is passed as VAR parameter:
  5240. - allocate temporary variable of math array type
  5241. - copy contents of ASOT to be passed to temporary variable
  5242. - use temporary variable as the actual parameter instead
  5243. - 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)
  5244. **)
  5245. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5246. VAR
  5247. expression: SyntaxTree.Expression;
  5248. BEGIN
  5249. IF actualParameter IS SyntaxTree.Designator THEN
  5250. designator := actualParameter(SyntaxTree.Designator);
  5251. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5252. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5253. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5254. ASSERT(checker # NIL);
  5255. checker.SetCurrentScope(currentScope);
  5256. (* allocate temporary variable *)
  5257. ASSERT(actualParameter.type # NIL);
  5258. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5259. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5260. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5261. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5262. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5263. ASSERT(tempVariableDesignator.type # NIL);
  5264. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5265. (* copy math array stored in actual parameter to temporary variable *)
  5266. BackupGlobalState;
  5267. AssignMathArray(tempVariableDesignator, actualParameter);
  5268. RestoreGlobalState;
  5269. (* use temporary variable as actual parameter instead of the original one *)
  5270. actualParameter := tempVariableDesignator;
  5271. (* create write-back call and store it in linked list *)
  5272. (* create new list entry *)
  5273. IF firstWriteBackCall = NIL THEN
  5274. NEW(firstWriteBackCall);
  5275. currentWriteBackCall := firstWriteBackCall
  5276. ELSE
  5277. ASSERT(currentWriteBackCall # NIL);
  5278. NEW(currentWriteBackCall.next);
  5279. currentWriteBackCall := currentWriteBackCall.next
  5280. END;
  5281. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5282. ASSERT(expression.type = NIL);
  5283. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5284. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5285. (* prepare writeback for any other "normal" indexer *)
  5286. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5287. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5288. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5289. Assign(tempVariableDesignator, actualParameter);
  5290. actualParameter := tempVariableDesignator;
  5291. IF firstWriteBackCall = NIL THEN
  5292. NEW(firstWriteBackCall);
  5293. currentWriteBackCall := firstWriteBackCall
  5294. ELSE
  5295. ASSERT(currentWriteBackCall # NIL);
  5296. NEW(currentWriteBackCall.next);
  5297. currentWriteBackCall := currentWriteBackCall.next
  5298. END;
  5299. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5300. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5301. END
  5302. END
  5303. END PrepareParameter;
  5304. BEGIN
  5305. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5306. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5307. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5308. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5309. IF InlineProcedureCall(x) THEN
  5310. RETURN
  5311. ELSE
  5312. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5313. END
  5314. END;
  5315. END;
  5316. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5317. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5318. callingConvention := procedureType.callingConvention;
  5319. dest := destination; destination := emptyOperand;
  5320. SaveRegisters();ReleaseUsedRegisters(saved);
  5321. parameters := x.parameters;
  5322. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5323. (* an operator is called *)
  5324. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5325. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5326. (* check if a dynamic operator call should be performed *)
  5327. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5328. ELSE
  5329. isCallOfDynamicOperator := FALSE
  5330. END;
  5331. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5332. Emit(Push(position, ap));
  5333. END;
  5334. alignment := procedureType.stackAlignment;
  5335. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5336. alignment := 16 (* bytes *);
  5337. END;
  5338. IF alignment > 1 THEN
  5339. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5340. Emit(Mov(position,reg, sp));
  5341. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5342. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5343. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5344. gap := 4*ToMemoryUnits(system,system.addressSize);
  5345. END;
  5346. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5347. backend.ResetParameterRegisters();
  5348. formalParameter := procedureType.firstParameter;
  5349. FOR i := 0 TO parameters.Length()-1 DO
  5350. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5351. type := addressType;
  5352. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5353. type := addressType;
  5354. ELSE
  5355. type := GetType(system, formalParameter.type);
  5356. END;
  5357. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5358. DEC (gap, ToMemoryUnits(system,system.addressSize))
  5359. END;
  5360. formalParameter := formalParameter.nextParameter;
  5361. END;
  5362. IF gap < 0 THEN
  5363. gap := 0
  5364. END;
  5365. ELSE
  5366. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5367. END;
  5368. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5369. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5370. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5371. Emit(And(position,sp, sp, mask));
  5372. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5373. Emit(Push(position,reg));
  5374. ReleaseIntermediateOperand(reg);
  5375. END;
  5376. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5377. (* align stack to 16-byte boundary *)
  5378. IntermediateCode.InitImmediate(mask,addressType,-16);
  5379. Emit(And(position,sp, sp, mask));
  5380. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5381. IF gap # 0 THEN
  5382. IntermediateCode.InitImmediate(size,addressType,gap);
  5383. Emit(Sub(position,sp,sp,size))
  5384. END;
  5385. END;
  5386. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5387. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5388. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5389. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5390. ELSE
  5391. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5392. END;
  5393. Evaluate(x.left, operand);
  5394. IF symbol IS SyntaxTree.Procedure THEN
  5395. IF (procedureType.selfParameter # NIL) THEN
  5396. Emit(Push(position,operand.tag));
  5397. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5398. Emit(Push(position,operand.tag));
  5399. ELSIF (procedureType.isDelegate) THEN
  5400. Emit(Push(position,operand.tag));
  5401. END;
  5402. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5403. IF (procedureType.selfParameter # NIL) THEN
  5404. Emit(Push(position,operand.tag));
  5405. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5406. Emit(Push(position,operand.tag));
  5407. END;
  5408. ELSE HALT(200);
  5409. END;
  5410. ReleaseIntermediateOperand(operand.tag);
  5411. operand.tag := emptyOperand;
  5412. (* determine if a structured return type is needed *)
  5413. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5414. IF structuredReturnType THEN
  5415. IF resultDesignator # NIL THEN
  5416. d := resultDesignator;
  5417. ELSE
  5418. (* temporary result that might be allocated, must potentially be traced *)
  5419. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5420. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5421. d.SetType(variable.type);
  5422. END;
  5423. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5424. Designate(d,returnValue);
  5425. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5426. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5427. Emit(Push(position,size));
  5428. Emit(Push(position,returnValue.op));
  5429. ReleaseOperand(returnValue);
  5430. ELSE*)
  5431. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5432. (*
  5433. END;
  5434. *)
  5435. END;
  5436. firstWriteBackCall := NIL; (* reset write-back call list *)
  5437. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5438. parameterRegisters := 0;
  5439. backend.ResetParameterRegisters();
  5440. formalParameter := procedureType.firstParameter;
  5441. FOR i := 0 TO parameters.Length()-1 DO
  5442. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5443. type := addressType;
  5444. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5445. type := addressType;
  5446. ELSE
  5447. type := GetType(system, formalParameter.type);
  5448. END;
  5449. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5450. INC(parameterRegisters);
  5451. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5452. Error(actualParameter.position,"cannot be passed by register")
  5453. END;
  5454. ELSE
  5455. registers[i] := -1;
  5456. END;
  5457. formalParameter := formalParameter.nextParameter;
  5458. END;
  5459. formalParameter := procedureType.lastParameter;
  5460. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5461. actualParameter := parameters.GetExpression(i);
  5462. PrepareParameter(actualParameter, formalParameter);
  5463. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy, registers[i]);
  5464. formalParameter := formalParameter.prevParameter;
  5465. END;
  5466. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5467. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5468. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,32)));
  5469. END;
  5470. ELSE
  5471. hasDynamicOperands := FALSE;
  5472. formalParameter := procedureType.firstParameter;
  5473. FOR i := 0 TO parameters.Length() - 1 DO
  5474. actualParameter := parameters.GetExpression(i);
  5475. IF formalParameter # NIL THEN (* TENTATIVE *)
  5476. PrepareParameter(actualParameter, formalParameter);
  5477. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5478. ASSERT(i < 2);
  5479. hasDynamicOperands := TRUE;
  5480. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5481. ELSE
  5482. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5483. END;
  5484. formalParameter := formalParameter.nextParameter;
  5485. END;
  5486. END;
  5487. END;
  5488. IF symbol IS SyntaxTree.Procedure THEN
  5489. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5490. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5491. Emit(Push(position,reg));
  5492. ReleaseIntermediateOperand(reg);
  5493. END;
  5494. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5495. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5496. parametersSize := ParametersSize(system,procedureType, FALSE);
  5497. END;
  5498. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5499. (*
  5500. dynamic operator overloading:
  5501. first push parameters, regularly:
  5502. [self]
  5503. par1
  5504. par2
  5505. then push parameters for GetOperator
  5506. identifier
  5507. ptr1
  5508. tag
  5509. ptr2
  5510. tag
  5511. call GetOperatorRuntimeProc
  5512. call Operator
  5513. *)
  5514. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5515. (* push ID *)
  5516. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5517. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5518. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5519. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5520. formalParameter := procedureType.firstParameter;
  5521. FOR i := 0 TO parameters.Length() - 1 DO
  5522. IF formalParameter.access # SyntaxTree.Hidden THEN
  5523. ASSERT(i < 2);
  5524. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5525. (* push pointer *)
  5526. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5527. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5528. (* add dereference *)
  5529. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5530. (*! better: do refer to stack above than using parameter backups !!*)
  5531. ReleaseIntermediateOperand(parameterBackups[i]);
  5532. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5533. END;
  5534. Emit(Push(position,parameterBackups[i]));
  5535. ReleaseIntermediateOperand(parameterBackups[i]);
  5536. (* push typetag *)
  5537. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5538. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5539. arg := TypeDescriptorAdr(recordType);
  5540. Emit(Push(position,arg));
  5541. ELSE
  5542. (* push 'NonPointer' *)
  5543. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5544. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5545. (* push fingerprint *)
  5546. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5547. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5548. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5549. END
  5550. END;
  5551. formalParameter := formalParameter.nextParameter
  5552. END;
  5553. (* for unary operators: complete the information for the second parameter *)
  5554. IF procedureType.numberParameters < 2 THEN
  5555. (* push 'NonPointer' *)
  5556. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5557. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5558. (* push 'NoType' *)
  5559. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5560. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5561. END;
  5562. (* call operator selection procedure *)
  5563. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5564. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5565. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5566. ReleaseOperand(operatorSelectionProcedureOperand);
  5567. (* use the address that the operator selection procedure returned as the target address of the call *)
  5568. InitOperand(operand, ModeValue);
  5569. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5570. Emit(Result(position,operand.op))
  5571. END
  5572. END;
  5573. ReleaseParameterRegisters();
  5574. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5575. SaveRegisters();ReleaseUsedRegisters(saved2);
  5576. CallThis(position,"Objects","LeaveA2",0);
  5577. RestoreRegisters(saved2);
  5578. END;
  5579. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5580. Emit(Call(position,operand.op,0));
  5581. ELSE
  5582. Emit(Call(position,operand.op,parametersSize));
  5583. END;
  5584. ReleaseOperand(operand);
  5585. IF procedureType.noReturn THEN
  5586. EmitTrap(position,NoReturnTrap);
  5587. END;
  5588. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5589. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5590. Emit(Result(position,return));
  5591. END;
  5592. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5593. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5594. Emit(Push(position, return));
  5595. CallThis(position,"Objects","ReenterA2",0);
  5596. Emit(Pop(position, return));
  5597. ELSE
  5598. CallThis(position,"Objects","ReenterA2",0);
  5599. END;
  5600. END;
  5601. (* === return parameter space === *)
  5602. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5603. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5604. (* cleanup all space for all parameters *)
  5605. IF parametersSize < 32 THEN
  5606. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5607. parametersSize := 32
  5608. END;
  5609. size := IntermediateCode.Immediate(addressType,parametersSize);
  5610. Emit(Add(position,sp,sp,size))
  5611. END;
  5612. IF (callingConvention IN SysvABI) THEN
  5613. IF parameterRegisters > 0 THEN
  5614. IF parameters.Length() > parameterRegisters THEN
  5615. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5616. ELSE
  5617. parametersSize := 0
  5618. END;
  5619. ELSE
  5620. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5621. INC( parametersSize, (-parametersSize) MOD 16 )
  5622. END;
  5623. IF parametersSize > 0 THEN
  5624. size := IntermediateCode.Immediate(addressType,parametersSize);
  5625. Emit(Add(position,sp,sp,size))
  5626. END;
  5627. END;
  5628. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5629. IF structuredReturnType THEN
  5630. (* stack pointer rewinding done by callee
  5631. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5632. Emit(Add(position,sp,sp,size));
  5633. *)
  5634. RestoreRegisters(saved);
  5635. InitOperand(result,ModeReference);
  5636. Symbol(variable,result);
  5637. ELSE
  5638. RestoreRegisters(saved);
  5639. InitOperand(result,ModeValue);
  5640. result.op := return;
  5641. END;
  5642. END;
  5643. IF alignment > 1 THEN
  5644. Emit(Pop(position,sp));
  5645. END;
  5646. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5647. Emit(Pop(position, ap));
  5648. END;
  5649. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5650. ValueToCondition(result);
  5651. END;
  5652. destination := dest;
  5653. (* perform all write-back calls in the list *)
  5654. BackupGlobalState;
  5655. currentWriteBackCall := firstWriteBackCall;
  5656. WHILE currentWriteBackCall # NIL DO
  5657. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5658. currentWriteBackCall := currentWriteBackCall.next
  5659. END;
  5660. RestoreGlobalState;
  5661. (* TENATIVE *)
  5662. (*
  5663. IF isOperatorCall THEN
  5664. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5665. END;
  5666. *)
  5667. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5668. END VisitProcedureCallDesignator;
  5669. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5670. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5671. td: SyntaxTree.Symbol;
  5672. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5673. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5674. BEGIN
  5675. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5676. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5677. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5678. variable.SetType(system.anyType);
  5679. scope.AddVariable(variable);
  5680. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5681. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5682. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5683. typeDeclaration.SetScope(module.module.moduleScope);
  5684. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5685. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5686. END;
  5687. RETURN hiddenPointerType;
  5688. END GetHiddenPointerType;
  5689. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5690. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5691. BEGIN
  5692. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5693. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5694. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5695. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5696. scope.AddVariable(variable);
  5697. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5698. variable.SetType(system.anyType);
  5699. scope.AddVariable(variable);
  5700. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5701. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5702. typeDeclaration.SetDeclaredType(delegatePointerType);
  5703. typeDeclaration.SetScope(module.module.moduleScope);
  5704. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5705. delegatePointerType.SetState(SyntaxTree.Resolved);
  5706. END;
  5707. RETURN delegatePointerType
  5708. END GetDelegateType;
  5709. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5710. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5711. such as in VAR a: RECORD ... END;
  5712. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5713. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5714. *)
  5715. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5716. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5717. BEGIN (* no code emission *)
  5718. source := NIL;
  5719. x := x.resolved;
  5720. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5721. x := GetHiddenPointerType();
  5722. ELSIF IsDelegate(x) THEN
  5723. x := GetDelegateType();
  5724. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5725. ELSE HALT(200);
  5726. END;
  5727. td := x.typeDeclaration;
  5728. IF td = NIL THEN
  5729. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5730. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5731. ASSERT(td # NIL);
  5732. END;
  5733. GetCodeSectionNameForSymbol(td,name);
  5734. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5735. meta.CheckTypeDeclaration(x);
  5736. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5737. ELSE
  5738. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5739. END;
  5740. IF backend.cooperative OR meta.simple THEN
  5741. offset := 0;
  5742. ELSE
  5743. IF x IS SyntaxTree.CellType THEN
  5744. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5745. IF baseRecord = NIL THEN
  5746. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5747. ELSE
  5748. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5749. END;
  5750. ELSE
  5751. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5752. END;
  5753. END;
  5754. RETURN td
  5755. END GetBackendType;
  5756. BEGIN
  5757. (*td := t.typeDeclaration;*)
  5758. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5759. (*
  5760. IF t IS SyntaxTree.PointerType THEN
  5761. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5762. ELSE
  5763. source := GetBackendType(t);
  5764. END;
  5765. *)
  5766. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5767. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5768. IntermediateCode.SetOffset(res,offset);
  5769. (*
  5770. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5771. make memory should be used when tag is used, not earlier
  5772. *)
  5773. RETURN res
  5774. END TypeDescriptorAdr;
  5775. (*
  5776. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5777. VAR result: IntermediateCode.Operand;
  5778. BEGIN
  5779. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5780. operand.tag := TypeDescriptorAdr(operand.type);
  5781. IntermediateCode.MakeMemory(operand.tag,addressType);
  5782. UseIntermediateOperand(operand.tag);
  5783. END;
  5784. END MakeTypeTag;
  5785. *)
  5786. PROCEDURE ProfilerInit;
  5787. VAR reg: IntermediateCode.Operand;
  5788. BEGIN
  5789. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5790. Emit(Call(position,reg,0));
  5791. END ProfilerInit;
  5792. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5793. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5794. BEGIN
  5795. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5796. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5797. THEN
  5798. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5799. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5800. Emit(Push(position,reg));
  5801. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5802. Emit(Push(position,reg));
  5803. StaticCallOperand(result,procedure);
  5804. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5805. ReleaseOperand(result);
  5806. END;
  5807. END ProfilerEnterExit;
  5808. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5809. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5810. BEGIN
  5811. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5812. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5813. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5814. profileInit.Emit(Push(position,reg));
  5815. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5816. profileInit.Emit(Push(position,reg));
  5817. NEW(string, LEN(name)); COPY(name, string^);
  5818. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5819. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5820. sv.SetType(type);
  5821. Designate(sv,result);
  5822. profileInit.Emit(Push(position,result.tag));
  5823. profileInit.Emit(Push(position,result.op));
  5824. StaticCallOperand(result,procedure);
  5825. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5826. ReleaseOperand(result);
  5827. END;
  5828. END ProfilerAddProcedure;
  5829. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5830. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5831. BEGIN
  5832. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5833. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5834. profileInit.Emit(Push(position,reg));
  5835. profileInitPatchPosition := profileInit.pc;
  5836. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5837. NEW(string, LEN(name)); COPY(name, string^);
  5838. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5839. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5840. sv.SetType(type);
  5841. Designate(sv,result);
  5842. profileInit.Emit(Push(position,result.tag));
  5843. profileInit.Emit(Push(position,result.op));
  5844. StaticCallOperand(result,procedure);
  5845. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5846. ReleaseOperand(result);
  5847. END;
  5848. END ProfilerAddModule;
  5849. PROCEDURE ProfilerPatchInit;
  5850. VAR reg: IntermediateCode.Operand;
  5851. BEGIN
  5852. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5853. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5854. EmitLeave(profileInit,position,NIL,0);
  5855. profileInit.Emit(Exit(position,0,0,0));
  5856. END ProfilerPatchInit;
  5857. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5858. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5859. VAR
  5860. id: LONGINT;
  5861. leftType, rightType: SyntaxTree.Type;
  5862. procedureType: SyntaxTree.ProcedureType;
  5863. runtimeProcedure: SyntaxTree.Procedure;
  5864. runtimeProcedureOperand, operatorOperand: Operand;
  5865. kind: SET;
  5866. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5867. VAR
  5868. arg: IntermediateCode.Operand;
  5869. recordType: SyntaxTree.RecordType;
  5870. fingerPrint: SyntaxTree.FingerPrint;
  5871. BEGIN
  5872. IF type = NIL THEN
  5873. (* no type: push 'NoType' *)
  5874. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5875. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5876. ELSIF IsStrictlyPointerToRecord(type) THEN
  5877. (* pointer to record type: push typetag *)
  5878. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5879. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5880. arg := TypeDescriptorAdr(recordType);
  5881. ELSE
  5882. (* non-pointer to record type: push fingerprint *)
  5883. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5884. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5885. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5886. END;
  5887. operatorInitializationCodeSection.Emit(Push(position,arg))
  5888. END PushTypeInfo;
  5889. BEGIN
  5890. ASSERT(operatorInitializationCodeSection # NIL);
  5891. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5892. procedureType := operator.type(SyntaxTree.ProcedureType);
  5893. (* determine types *)
  5894. leftType := procedureType.firstParameter.type;
  5895. IF procedureType.numberParameters = 2 THEN
  5896. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5897. rightType := procedureType.firstParameter.nextParameter.type;
  5898. ELSE
  5899. rightType := NIL
  5900. END;
  5901. (* determine operator kind *)
  5902. IF IsStrictlyPointerToRecord(leftType) THEN
  5903. kind := {LhsIsPointer}
  5904. ELSE
  5905. kind := {}
  5906. END;
  5907. IF IsStrictlyPointerToRecord(rightType) THEN
  5908. kind := kind + {RhsIsPointer}
  5909. END;
  5910. IF kind # {} THEN (* TODO: to be removed later on *)
  5911. (* at least one of the types is a pointer to record *)
  5912. (* emit a code that registers this specific operator in the runtime *)
  5913. dump := operatorInitializationCodeSection.comments;
  5914. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5915. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5916. (* push ID *)
  5917. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5918. id := Global.GetSymbol(module.module.case, operator.name);
  5919. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5920. (* push kind *)
  5921. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5922. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5923. (* push type infos *)
  5924. PushTypeInfo(leftType);
  5925. PushTypeInfo(rightType);
  5926. (* push operator address *)
  5927. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5928. StaticCallOperand(operatorOperand, operator);
  5929. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5930. ReleaseOperand(operatorOperand);
  5931. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5932. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5933. ReleaseOperand(runtimeProcedureOperand)
  5934. END
  5935. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5936. END
  5937. END RegisterDynamicOperator;
  5938. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5939. VAR
  5940. traceModule: SyntaxTree.Module;
  5941. procedure: SyntaxTree.Procedure;
  5942. procedureVariable: SyntaxTree.Variable;
  5943. s,msg: Basic.MessageString;
  5944. res: Operand;
  5945. i: LONGINT;
  5946. sv: SyntaxTree.StringValue;
  5947. type: SyntaxTree.Type;
  5948. recordType: SyntaxTree.RecordType;
  5949. printout: Printout.Printer;
  5950. stringWriter: Streams.StringWriter;
  5951. expression: SyntaxTree.Expression;
  5952. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5953. BEGIN
  5954. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5955. IF procedure = NIL THEN
  5956. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5957. END;
  5958. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5959. s := "procedure ";
  5960. Strings.Append(s,backend.traceModuleName);
  5961. Strings.Append(s,".");
  5962. Strings.Append(s,procedureName);
  5963. Strings.Append(s," not present");
  5964. Error(position,s);
  5965. RETURN FALSE
  5966. ELSE
  5967. RETURN TRUE
  5968. END;
  5969. END GetProcedure;
  5970. PROCEDURE CallProcedure;
  5971. VAR size: LONGINT;
  5972. BEGIN
  5973. IF procedure # NIL THEN
  5974. StaticCallOperand(result,procedure);
  5975. size := ProcParametersSize(procedure);
  5976. ELSE
  5977. Symbol(procedureVariable, result);
  5978. LoadValue(result, procedureVariable.type.resolved);
  5979. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5980. END;
  5981. Emit(Call(position,result.op,size));
  5982. END CallProcedure;
  5983. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5984. VAR res: Operand; string: SyntaxTree.String;
  5985. BEGIN
  5986. IF GetProcedure("String") THEN
  5987. NEW(string, LEN(s)); COPY(s, string^);
  5988. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5989. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5990. sv.SetType(type);
  5991. Designate(sv,res);
  5992. Emit(Push(position,res.tag));
  5993. Emit(Push(position,res.op));
  5994. ReleaseOperand(res);
  5995. CallProcedure;
  5996. END;
  5997. END String;
  5998. PROCEDURE Integer(op: IntermediateCode.Operand);
  5999. BEGIN
  6000. IF GetProcedure("Int") THEN
  6001. Emit(Push(position,op));
  6002. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  6003. CallProcedure;
  6004. END;
  6005. END Integer;
  6006. PROCEDURE Float(op: IntermediateCode.Operand);
  6007. BEGIN
  6008. IF GetProcedure("HIntHex") THEN
  6009. Emit(Push(position,op));
  6010. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  6011. CallProcedure;
  6012. END;
  6013. END Float;
  6014. PROCEDURE Set(op: IntermediateCode.Operand);
  6015. BEGIN
  6016. IF GetProcedure("Set") THEN
  6017. Emit(Push(position,op));
  6018. (*
  6019. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  6020. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  6021. *)
  6022. CallProcedure;
  6023. END;
  6024. END Set;
  6025. PROCEDURE Boolean(op: IntermediateCode.Operand);
  6026. BEGIN
  6027. IF GetProcedure("Boolean") THEN
  6028. Emit(Push(position,op));
  6029. CallProcedure;
  6030. END;
  6031. END Boolean;
  6032. PROCEDURE Char(op: IntermediateCode.Operand);
  6033. BEGIN
  6034. IF GetProcedure("Char") THEN
  6035. Emit(Push(position,op));
  6036. CallProcedure;
  6037. END;
  6038. END Char;
  6039. PROCEDURE Address(op: IntermediateCode.Operand);
  6040. BEGIN
  6041. IF GetProcedure("Address") THEN
  6042. Emit(Push(position,op));
  6043. CallProcedure;
  6044. END;
  6045. END Address;
  6046. PROCEDURE Size(op: IntermediateCode.Operand);
  6047. BEGIN
  6048. IF GetProcedure("Size") THEN
  6049. Emit(Push(position,op));
  6050. CallProcedure;
  6051. END;
  6052. END Size;
  6053. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6054. VAR len: IntermediateCode.Operand;
  6055. BEGIN
  6056. IF GetProcedure("String") THEN
  6057. len := GetArrayLength(type, op.tag);
  6058. Emit(Push(position,len));
  6059. ReleaseIntermediateOperand(len);
  6060. Emit(Push(position,op.op));
  6061. CallProcedure;
  6062. END;
  6063. END StringOperand;
  6064. PROCEDURE Ln;
  6065. BEGIN
  6066. IF GetProcedure("Ln") THEN
  6067. CallProcedure;
  6068. END;
  6069. END Ln;
  6070. BEGIN
  6071. IF backend.traceModuleName = "" THEN RETURN END;
  6072. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6073. IF GetProcedure("Enter") THEN
  6074. CallProcedure
  6075. END;
  6076. NEW(stringWriter,LEN(s));
  6077. FOR i := 0 TO x.Length()-1 DO
  6078. msg := "";
  6079. expression := x.GetExpression(i);
  6080. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6081. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6082. ELSE
  6083. Global.GetModuleName(module.module, s);
  6084. END;
  6085. IF i = 0 THEN
  6086. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6087. stringWriter.String(":");
  6088. END;
  6089. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6090. IF ~(expression IS SyntaxTree.StringValue) THEN
  6091. printout.Expression(expression);
  6092. stringWriter.Get(s);
  6093. Strings.Append(msg,s);
  6094. Strings.Append(msg,"= ");
  6095. ELSE stringWriter.Get(s); (* remove from string writer *)
  6096. Strings.Append(msg, s);
  6097. END;
  6098. String(msg);
  6099. IF SemanticChecker.IsStringType(expression.type) THEN
  6100. Designate(expression,res);
  6101. StringOperand(res, expression.type);
  6102. ELSE
  6103. Evaluate(expression,res);
  6104. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6105. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6106. Convert(res.op,int64);
  6107. END;
  6108. Integer(res.op);
  6109. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6110. Boolean(res.op);
  6111. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6112. Set(res.op);
  6113. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6114. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6115. Convert(res.op,float64);
  6116. END;
  6117. Float(res.op);
  6118. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6119. Char(res.op);
  6120. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6121. Address(res.op);String("H");
  6122. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6123. Size(res.op);
  6124. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6125. Address(res.op);String("H");
  6126. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6127. Address(res.op);String("H");
  6128. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6129. String("NIL");
  6130. ELSE HALT(200);
  6131. END;
  6132. END;
  6133. ReleaseOperand(res);
  6134. String("; ");
  6135. END;
  6136. IF GetProcedure("Exit") THEN
  6137. CallProcedure
  6138. ELSE
  6139. Ln;
  6140. END;
  6141. END;
  6142. END SystemTrace;
  6143. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6144. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6145. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6146. BEGIN
  6147. type := type.resolved;
  6148. IF type IS SyntaxTree.RecordType THEN
  6149. WITH type: SyntaxTree.RecordType DO
  6150. baseType := type.baseType;
  6151. IF baseType # NIL THEN
  6152. baseType := baseType.resolved;
  6153. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6154. InitFields(baseType,adr,offset);
  6155. END;
  6156. variable := type.recordScope.firstVariable;
  6157. WHILE variable # NIL DO
  6158. IF variable.initializer # NIL THEN
  6159. Evaluate(variable.initializer,initializerOp);
  6160. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6161. Emit(Mov(position,mem,initializerOp.op));
  6162. ReleaseOperand(initializerOp);
  6163. ReleaseIntermediateOperand(mem);
  6164. END;
  6165. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6166. variable := variable.nextVariable
  6167. END;
  6168. END;
  6169. ELSIF type IS SyntaxTree.CellType THEN
  6170. WITH type: SyntaxTree.CellType DO
  6171. baseType := type.baseType;
  6172. IF baseType # NIL THEN
  6173. baseType := baseType.resolved;
  6174. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6175. InitFields(baseType,adr,offset);
  6176. END;
  6177. variable := type.cellScope.firstVariable;
  6178. WHILE variable # NIL DO
  6179. IF variable.initializer # NIL THEN
  6180. Evaluate(variable.initializer,initializerOp);
  6181. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6182. Emit(Mov(position,mem,initializerOp.op));
  6183. ReleaseOperand(initializerOp);
  6184. ReleaseIntermediateOperand(mem);
  6185. END;
  6186. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6187. variable := variable.nextVariable
  6188. END;
  6189. END;
  6190. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6191. WITH type: SyntaxTree.ArrayType DO
  6192. IF type.form = SyntaxTree.Static THEN
  6193. baseType := type.arrayBase;
  6194. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6195. FOR i := 0 TO type.staticLength-1 DO
  6196. InitFields(baseType,adr,offset+i*size);
  6197. END;
  6198. END;
  6199. END;
  6200. ELSIF type IS SyntaxTree.MathArrayType THEN
  6201. WITH type: SyntaxTree.MathArrayType DO
  6202. IF type.form = SyntaxTree.Open THEN
  6203. dim := DynamicDim(type);
  6204. imm := IntermediateCode.Immediate(addressType,dim);
  6205. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6206. baseType := SemanticChecker.ArrayBase(type,dim);
  6207. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6208. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6209. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6210. ReleaseIntermediateOperand(imm);
  6211. (* flags remain empty (=0) for open array *)
  6212. ELSIF type.form = SyntaxTree.Static THEN
  6213. baseType := type.arrayBase;
  6214. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6215. ASSERT(type.staticLength < 1024*1024*1024);
  6216. FOR i := 0 TO type.staticLength-1 DO
  6217. InitFields(baseType,adr,offset+i*size);
  6218. END;
  6219. END;
  6220. END;
  6221. END;
  6222. END InitFields;
  6223. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6224. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6225. saved: RegisterEntry;
  6226. BEGIN
  6227. type := variable.type.resolved;
  6228. IF (type IS SyntaxTree.MathArrayType) THEN
  6229. WITH type: SyntaxTree.MathArrayType DO
  6230. IF type.form = SyntaxTree.Open THEN
  6231. Symbol(variable,operand);
  6232. InitFields(type, operand.tag,0);
  6233. IF temporary THEN
  6234. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6235. END;
  6236. ELSIF type.form = SyntaxTree.Tensor THEN
  6237. IF temporary & backend.writeBarriers THEN
  6238. SaveRegisters();ReleaseUsedRegisters(saved);
  6239. Symbol(variable, operand);
  6240. Emit(Push(position,operand.op));
  6241. ReleaseOperand(operand);
  6242. Emit(Push(position,nil));
  6243. CallThis(position,"FoxArrayBase","Assign",2);
  6244. RestoreRegisters(saved);
  6245. ELSE
  6246. Symbol(variable, operand);
  6247. MakeMemory(tmp,operand.op,addressType,0);
  6248. ReleaseOperand(operand);
  6249. IF FALSE & temporary THEN
  6250. (* trick -- temporary object from array base *)
  6251. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6252. Symbol(symbol,operand);
  6253. MakeMemory(mem,operand.op,addressType,0);
  6254. ReleaseOperand(operand);
  6255. Emit(Mov(position,tmp, mem) );
  6256. ReleaseOperand(operand);
  6257. ELSE
  6258. Emit(Mov(position,tmp, nil ) );
  6259. END;
  6260. ReleaseIntermediateOperand(tmp)
  6261. END;
  6262. END;
  6263. END;
  6264. ELSE
  6265. Symbol(variable,operand);
  6266. IF variable.initializer # NIL THEN
  6267. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6268. reference.SetType(variable.type.resolved);
  6269. reference.SetAssignable(TRUE);
  6270. Assign(reference,variable.initializer);
  6271. ELSIF temporary THEN
  6272. IF SemanticChecker.IsPointerType(variable.type) THEN
  6273. IF backend.cooperative THEN
  6274. SaveRegisters();ReleaseUsedRegisters(saved);
  6275. Symbol(variable, operand);
  6276. CallAssignPointer(operand.op, nil);
  6277. ReleaseOperand(operand);
  6278. RestoreRegisters(saved);
  6279. ELSIF backend.writeBarriers THEN
  6280. SaveRegisters();ReleaseUsedRegisters(saved);
  6281. Symbol(variable, operand);
  6282. Emit(Push(position,operand.op));
  6283. ReleaseOperand(operand);
  6284. Emit(Push(position,nil));
  6285. CallThis(position,"Heaps","Assign",2);
  6286. RestoreRegisters(saved);
  6287. ELSE
  6288. Symbol(variable, operand);
  6289. MakeMemory(tmp,operand.op,addressType,0);
  6290. ReleaseOperand(operand);
  6291. Emit(Mov(position,tmp, nil ) );
  6292. ReleaseIntermediateOperand(tmp);
  6293. END;
  6294. END;
  6295. END;
  6296. InitFields(type, operand.op,0);
  6297. ReleaseOperand(operand);
  6298. END;
  6299. END InitVariable;
  6300. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6301. VAR end: Label;
  6302. BEGIN
  6303. IF type.form = SyntaxTree.Tensor THEN
  6304. InitOperand(result,ModeValue);
  6305. ReuseCopy(result.op,base);
  6306. end := NewLabel();
  6307. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6308. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6309. SetLabel(end);
  6310. Convert(result.op,lenType);
  6311. ELSE
  6312. InitOperand(result,ModeValue);
  6313. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6314. END
  6315. END MathArrayDim;
  6316. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6317. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6318. BEGIN
  6319. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6320. MakeMemory(mem,base,addressType,offset);
  6321. Emit(Mov(position,mem,value));
  6322. ReleaseIntermediateOperand(mem);
  6323. END PutMathArrayField;
  6324. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6325. VAR mem: IntermediateCode.Operand;
  6326. BEGIN
  6327. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6328. MakeMemory(mem,base,addressType,offset);
  6329. Emit(Mov(position,mem,value));
  6330. ReleaseIntermediateOperand(mem);
  6331. END PutMathArrayFieldOffset;
  6332. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6333. BEGIN
  6334. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6335. MakeMemory(value,base,addressType,offset);
  6336. END GetMathArrayField;
  6337. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6338. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6339. BEGIN
  6340. IF incr THEN
  6341. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6342. ELSE
  6343. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6344. END;
  6345. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6346. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6347. ELSE
  6348. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6349. Emit(Mov(position,reg,dim));
  6350. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6351. Emit(Add(position,reg,reg,base));
  6352. MakeMemory(mem, reg, addressType, offset);
  6353. ReleaseIntermediateOperand(reg);
  6354. Emit(Mov(position,mem,value));
  6355. ReleaseIntermediateOperand(mem);
  6356. END;
  6357. END PutMathArrayLenOrIncr;
  6358. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6359. BEGIN
  6360. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6361. END PutMathArrayLength;
  6362. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6363. BEGIN
  6364. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6365. END PutMathArrayIncrement;
  6366. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6367. BEGIN
  6368. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6369. END GetMathArrayIncrement;
  6370. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6371. BEGIN
  6372. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6373. END GetMathArrayLength;
  6374. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6375. VAR dimOp: IntermediateCode.Operand;
  6376. BEGIN
  6377. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6378. GetMathArrayLength(type, operand, dimOp, check, result);
  6379. END GetMathArrayLengthAt;
  6380. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6381. VAR dimOp: IntermediateCode.Operand;
  6382. BEGIN
  6383. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6384. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6385. END GetMathArrayIncrementAt;
  6386. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6387. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6388. offset: LONGINT;
  6389. BEGIN
  6390. IF increment THEN
  6391. offset := MathIncrOffset;
  6392. ELSE
  6393. offset := MathLenOffset;
  6394. END;
  6395. INC(offset,operand.dimOffset*2);
  6396. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6397. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6398. END;
  6399. (* static dimension *)
  6400. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6401. IF check & (type.form = SyntaxTree.Tensor) THEN
  6402. DimensionCheck(operand.tag,dim,BrltL);
  6403. END;
  6404. val := SHORT(dim.intValue);
  6405. IF type.form # SyntaxTree.Tensor THEN
  6406. t := SemanticChecker.ArrayBase(type,val);
  6407. type := t.resolved(SyntaxTree.MathArrayType);
  6408. IF type.form = SyntaxTree.Static THEN
  6409. IF increment THEN
  6410. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6411. ELSE
  6412. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6413. END;
  6414. InitOperand(result,ModeValue);
  6415. result.op := res;
  6416. RETURN;
  6417. END;
  6418. END;
  6419. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6420. MakeMemory(res,operand.tag,addressType,offset);
  6421. (*
  6422. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6423. *)
  6424. InitOperand(result,ModeValue);
  6425. result.op := res;
  6426. ELSE
  6427. Convert(dim,addressType);
  6428. IF check THEN
  6429. IF type.form = SyntaxTree.Tensor THEN
  6430. DimensionCheck(operand.tag,dim,BrltL);
  6431. ELSIF isUnchecked THEN (* do nothing *)
  6432. ELSE
  6433. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6434. END;
  6435. END;
  6436. end := NewLabel(); next := NIL;
  6437. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6438. Emit(Mov(position,res,dim));
  6439. Convert(res,sizeType);
  6440. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6441. WHILE t IS SyntaxTree.MathArrayType DO
  6442. type := t(SyntaxTree.MathArrayType);
  6443. IF type.form = SyntaxTree.Static THEN
  6444. imm := IntermediateCode.Immediate(sizeType,val);
  6445. next := NewLabel();
  6446. BrneL(next,imm,res);
  6447. IF increment THEN
  6448. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6449. ELSE
  6450. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6451. END;
  6452. Emit(MovReplace(position,res,imm));
  6453. BrL(end);
  6454. ELSE hasDynamicPart := TRUE;
  6455. END;
  6456. t := type.arrayBase.resolved;
  6457. val := val + 1;
  6458. IF next # NIL THEN SetLabel(next) END;
  6459. END;
  6460. IF hasDynamicPart THEN
  6461. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6462. Emit(Mov(position,res2,dim));
  6463. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6464. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6465. Emit(Add(position,res2,res2,imm));
  6466. Emit(Add(position,res2,res2,operand.tag));
  6467. IntermediateCode.MakeMemory(res2,sizeType);
  6468. Emit(MovReplace(position,res,res2));
  6469. ReleaseIntermediateOperand(res2);
  6470. END;
  6471. SetLabel(end);
  6472. Convert(res,sizeType);
  6473. InitOperand(result,ModeValue);
  6474. result.op := res;
  6475. END;
  6476. END MathArrayLenOrIncr;
  6477. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6478. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6479. offset: LONGINT;
  6480. BEGIN
  6481. offset := operand.dimOffset+DynamicDim(type)-1;
  6482. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6483. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6484. val := SHORT(dim.intValue);
  6485. t := SemanticChecker.ArrayBase(type,val);
  6486. type := t.resolved(SyntaxTree.ArrayType);
  6487. IF type.form = SyntaxTree.Static THEN
  6488. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6489. ELSE
  6490. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6491. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6492. END;
  6493. UseIntermediateOperand(res);
  6494. InitOperand(result,ModeValue);
  6495. result.op := res;
  6496. ELSE
  6497. Convert(dim,addressType);
  6498. IF ~isUnchecked THEN
  6499. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6500. END;
  6501. end := NewLabel(); next := NIL;
  6502. (* ReuseCopy(dim,res); *)
  6503. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6504. Emit(Mov(position,res,dim));
  6505. Convert(res,sizeType);
  6506. Convert(res,sizeType);
  6507. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6508. WHILE t IS SyntaxTree.ArrayType DO
  6509. type := t(SyntaxTree.ArrayType);
  6510. IF type.form = SyntaxTree.Static THEN
  6511. imm := IntermediateCode.Immediate(sizeType,val);
  6512. next := NewLabel();
  6513. BrneL(next,imm,res);
  6514. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6515. Emit(MovReplace(position,res,imm));
  6516. BrL(end);
  6517. ELSE hasDynamicPart := TRUE;
  6518. END;
  6519. t := type.arrayBase.resolved;
  6520. val := val + 1;
  6521. IF next # NIL THEN SetLabel(next) END;
  6522. END;
  6523. IF hasDynamicPart THEN
  6524. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6525. Convert(res2,addressType);
  6526. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6527. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6528. Emit(Sub(position,res2,imm,res2));
  6529. Emit(Add(position,res2,res2,operand.tag));
  6530. IntermediateCode.MakeMemory(res2,sizeType);
  6531. Emit(MovReplace(position,res,res2));
  6532. ReleaseIntermediateOperand(res2);
  6533. END;
  6534. SetLabel(end);
  6535. Convert(res,sizeType);
  6536. InitOperand(result,ModeValue);
  6537. result.op := res;
  6538. END;
  6539. END ArrayLen;
  6540. (**
  6541. create a temporary variable in current scope
  6542. **)
  6543. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6544. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6545. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6546. BEGIN
  6547. IF ~register THEN
  6548. v := temporaries.GetFreeVariable(type, untraced, index);
  6549. ELSE
  6550. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6551. END;
  6552. scope := currentScope;
  6553. (*
  6554. v := NIL; (* disable free variable managemenet for the time being *)
  6555. *)
  6556. name := temporaries.GetUID();
  6557. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6558. variable.SetType(type);
  6559. variable.SetAccess(SyntaxTree.Hidden);
  6560. variable.SetUntraced(untraced);
  6561. IF v = NIL THEN
  6562. temporaries.AddVariable(variable);
  6563. IF ~register THEN
  6564. IF scope.lastVariable # NIL THEN
  6565. offset := scope.lastVariable.offsetInBits;
  6566. ELSE
  6567. offset := 0;
  6568. END;
  6569. DEC(offset,system.SizeOf(variable.type));
  6570. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6571. variable(SyntaxTree.Variable).SetOffset(offset);
  6572. scope.AddVariable(variable(SyntaxTree.Variable));
  6573. scope.EnterSymbol(variable, duplicate);
  6574. ASSERT(~duplicate);
  6575. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6576. ELSE
  6577. variable.SetUseRegister(TRUE);
  6578. variable(SyntaxTree.Variable).SetOffset(0);
  6579. END;
  6580. ELSE (* v # NIL *)
  6581. (* reuse slot for new variable, do not create new slot ! *)
  6582. temporaries.SetVariable(index, variable);
  6583. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6584. ASSERT(~register);
  6585. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6586. ASSERT(v.offsetInBits # 0);
  6587. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6588. scope.EnterSymbol(variable, duplicate);
  6589. ASSERT(~duplicate);
  6590. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6591. END;
  6592. RETURN variable(SyntaxTree.Variable)
  6593. END GetTemporaryVariable;
  6594. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6595. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6596. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6597. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6598. i: LONGINT; duplicate: BOOLEAN;
  6599. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6600. VAR variable: SyntaxTree.Variable;
  6601. BEGIN
  6602. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6603. variable.SetType(type);
  6604. recordScope.AddVariable(variable);
  6605. END AddVariable;
  6606. BEGIN
  6607. name := "@ArrayDescriptor";
  6608. Basic.AppendNumber(name,dimensions);
  6609. identifier := SyntaxTree.NewIdentifier(name);
  6610. parentScope := module.module.moduleScope;
  6611. symbol := parentScope.FindSymbol(identifier);
  6612. IF symbol # NIL THEN
  6613. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6614. type := typeDeclaration.declaredType;
  6615. ELSE
  6616. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6617. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6618. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6619. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6620. recordType.SetTypeDeclaration(typeDeclaration);
  6621. recordType.SetState(SyntaxTree.Resolved);
  6622. typeDeclaration.SetDeclaredType(recordType);
  6623. AddVariable("@ptr",system.anyType);
  6624. AddVariable("@adr",system.addressType);
  6625. AddVariable("@flags",system.addressType);
  6626. AddVariable("@dim",system.addressType);
  6627. AddVariable("@elementSize",system.addressType);
  6628. FOR i := 0 TO dimensions-1 DO
  6629. name := "@len";
  6630. Basic.AppendNumber(name,i);
  6631. AddVariable(name,system.addressType);
  6632. name := "@incr";
  6633. Basic.AppendNumber(name,i);
  6634. AddVariable(name,system.addressType);
  6635. END;
  6636. parentScope.AddTypeDeclaration(typeDeclaration);
  6637. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6638. ASSERT(~duplicate);
  6639. type := recordType;
  6640. END;
  6641. RETURN type
  6642. END GetMathArrayDescriptorType;
  6643. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6644. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6645. BEGIN
  6646. type := GetMathArrayDescriptorType(dimensions);
  6647. Emit(Push(position,op.op));
  6648. (* push type descriptor *)
  6649. reg := TypeDescriptorAdr(type);
  6650. Emit(Push(position,reg));
  6651. ReleaseIntermediateOperand(reg);
  6652. (* push realtime flag: false by default *)
  6653. Emit(Push(position,false));
  6654. CallThis(position,"Heaps","NewRec",3);
  6655. END NewMathArrayDescriptor;
  6656. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6657. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6658. BEGIN
  6659. NEW(string, LEN(s)); COPY(s, string^);
  6660. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6661. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6662. sv.SetType(type);
  6663. Designate(sv,res);
  6664. Emit(Push(position,res.tag));
  6665. Emit(Push(position,res.op));
  6666. ReleaseOperand(res);
  6667. END PushConstString;
  6668. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6669. BEGIN
  6670. IF b THEN
  6671. Emit(Push(Basic.invalidPosition, true));
  6672. ELSE
  6673. Emit(Push(Basic.invalidPosition, false));
  6674. END;
  6675. END PushConstBoolean;
  6676. PROCEDURE PushConstSet(v: SET);
  6677. VAR value: SyntaxTree.Value; op: Operand;
  6678. BEGIN
  6679. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6680. value.SetType(system.setType);
  6681. Evaluate(value, op);
  6682. Emit(Push(Basic.invalidPosition, op.op));
  6683. ReleaseOperand(op);
  6684. END PushConstSet;
  6685. PROCEDURE PushConstInteger(v: LONGINT);
  6686. VAR value: SyntaxTree.Value; op: Operand;
  6687. BEGIN
  6688. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6689. value.SetType(system.longintType);
  6690. Evaluate(value, op);
  6691. Emit(Push(Basic.invalidPosition, op.op));
  6692. ReleaseOperand(op);
  6693. END PushConstInteger;
  6694. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6695. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6696. section: IntermediateCode.Section;
  6697. BEGIN
  6698. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6699. Global.GetSymbolSegmentedName(symbol, name);
  6700. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6701. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6702. procedure.SetScope(moduleScope);
  6703. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6704. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6705. procedure.SetAccess(SyntaxTree.Hidden);
  6706. currentScope := procedureScope;
  6707. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6708. EmitEnter(section, Basic.invalidPosition,procedure,0,0);
  6709. RETURN section;
  6710. END OpenInitializer;
  6711. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6712. BEGIN
  6713. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6714. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6715. section := prev;
  6716. END CloseInitializer;
  6717. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6718. VAR name: SyntaxTree.IdentifierString;
  6719. variable: SyntaxTree.Variable;
  6720. parameter: SyntaxTree.Parameter;
  6721. type: SyntaxTree.Type;
  6722. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6723. BEGIN
  6724. InitOperand(op,ModeReference);
  6725. op.op := fp;
  6726. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6727. Dereference(op, x, FALSE);
  6728. result := op;
  6729. Symbol(symbol, op);
  6730. END Field;
  6731. PROCEDURE Direction(direction: LONGINT): SET;
  6732. BEGIN
  6733. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6734. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6735. ELSE HALT(100);
  6736. END;
  6737. END Direction;
  6738. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6739. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6740. BEGIN
  6741. Field(port, op);
  6742. ToMemory(op.op,addressType,0);
  6743. Emit(Push(Basic.invalidPosition, op.op));
  6744. ReleaseOperand(op);
  6745. Basic.GetString(modifier.identifier, name);
  6746. PushConstString(name);
  6747. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6748. ASSERT(SemanticChecker.IsStringType(value.type));
  6749. Designate(value, op);
  6750. Emit(Push(modifier.position, op.tag));
  6751. Emit(Push(modifier.position, op.op));
  6752. ReleaseOperand(op);
  6753. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6754. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6755. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6756. Evaluate(value, op);
  6757. Emit(Push(modifier.position, op.op));
  6758. ReleaseOperand(op);
  6759. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6760. ELSE
  6761. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6762. END;
  6763. END AddPortProperty;
  6764. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6765. VAR modifier: SyntaxTree.Modifier;
  6766. BEGIN
  6767. modifier := parameter.modifiers;
  6768. WHILE modifier # NIL DO
  6769. AddPortProperty(parameter,modifier, modifier.expression);
  6770. modifier := modifier.nextModifier;
  6771. END;
  6772. END AddPortProperties;
  6773. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6774. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6775. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6776. PROCEDURE PushLens(type: SyntaxTree.Type);
  6777. BEGIN
  6778. IF IsSemiDynamicArray(type) THEN
  6779. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6780. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6781. Emit(Push(Basic.invalidPosition, op.op));
  6782. ReleaseOperand(op);
  6783. INC(dim);
  6784. ELSIF IsStaticArray(type) THEN
  6785. len := len * type(SyntaxTree.ArrayType).staticLength;
  6786. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6787. INC(dim);
  6788. ELSE
  6789. baseType := type;
  6790. END;
  6791. END PushLens;
  6792. BEGIN
  6793. (* cell *)
  6794. IF parameter.type IS SyntaxTree.ArrayType THEN
  6795. type := parameter.type;
  6796. dim := 0;
  6797. len := 1;
  6798. PushLens(type);
  6799. portType := baseType.resolved(SyntaxTree.PortType);
  6800. ELSE
  6801. portType := parameter.type(SyntaxTree.PortType);
  6802. END;
  6803. PushSelfPointer();
  6804. (* port / array of ports *)
  6805. IF IsStaticArray(type) THEN
  6806. PushConstInteger(len);
  6807. END;
  6808. Field(parameter, op);
  6809. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6810. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6811. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6812. Designate(d, op);*)
  6813. Emit(Push(Basic.invalidPosition, op.op));
  6814. ReleaseOperand(op);
  6815. (* name *)
  6816. PushConstString(name);
  6817. (* inout *)
  6818. PushConstSet(Direction(portType.direction));
  6819. (* width *)
  6820. PushConstInteger(portType.sizeInBits);
  6821. IF parameter.type IS SyntaxTree.PortType THEN
  6822. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6823. AddPortProperties(parameter);
  6824. ELSIF IsStaticArray(type)THEN
  6825. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6826. ELSIF IsSemiDynamicArray(type) THEN
  6827. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6828. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6829. Emit(Add(position,reg, sp, size));
  6830. (* dim *)
  6831. PushConstInteger(dim);
  6832. (* len array *)
  6833. Emit(Push(position, reg));
  6834. ReleaseIntermediateOperand(reg);
  6835. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6836. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6837. Emit(Add(position, sp,sp, size));
  6838. ELSE
  6839. HALT(100);
  6840. END;
  6841. END Parameter;
  6842. BEGIN
  6843. IF backend.cellsAreObjects THEN
  6844. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6845. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6846. END;
  6847. parameter := x.firstParameter;
  6848. WHILE (parameter # NIL) DO
  6849. type := parameter.type.resolved;
  6850. WHILE (type IS SyntaxTree.ArrayType) DO
  6851. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6852. END;
  6853. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6854. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6855. Parameter(name,parameter);
  6856. END;
  6857. parameter := parameter.nextParameter;
  6858. END;
  6859. ELSE HALT(200)
  6860. END;
  6861. END AddPorts;
  6862. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6863. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6864. BEGIN
  6865. Symbol(cell,op);
  6866. ToMemory(op.op,addressType,0);
  6867. Emit(Push(position,op.op));
  6868. ReleaseOperand(op);
  6869. property.GetName(name);
  6870. (* does not work when inheritance is used:
  6871. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6872. *)
  6873. PushConstString(name);
  6874. IF (value # NIL) THEN
  6875. ASSERT(
  6876. SemanticChecker.IsStringType(property.type)
  6877. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6878. OR (property.type.resolved IS SyntaxTree.FloatType)
  6879. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6880. OR (property.type.resolved IS SyntaxTree.SetType)
  6881. );
  6882. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6883. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6884. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6885. Designate(d, op);
  6886. IF SemanticChecker.IsStringType(property.type) THEN
  6887. Emit(Push(Basic.invalidPosition, op.tag))
  6888. END;
  6889. Emit(Push(Basic.invalidPosition, op.op));
  6890. ReleaseOperand(op);
  6891. END;
  6892. IF value = NIL THEN
  6893. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6894. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6895. ASSERT(SemanticChecker.IsStringType(value.type));
  6896. Designate(value, op);
  6897. PushString(op, value.type);
  6898. ReleaseOperand(op);
  6899. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6900. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6901. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6902. Evaluate(value, op);
  6903. Emit(Push(property.position, op.op));
  6904. ReleaseOperand(op);
  6905. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6906. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6907. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6908. Evaluate(value, op);
  6909. Emit(Push(property.position, op.op));
  6910. ReleaseOperand(op);
  6911. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6912. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6913. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6914. Evaluate(value, op);
  6915. Emit(Push(property.position, op.op));
  6916. ReleaseOperand(op);
  6917. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6918. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6919. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6920. Evaluate(value, op);
  6921. Emit(Push(property.position, op.op));
  6922. ReleaseOperand(op);
  6923. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6924. ELSE
  6925. HALT(200);
  6926. END;
  6927. END AddProperty;
  6928. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6929. VAR symbol: SyntaxTree.Symbol;
  6930. BEGIN
  6931. WHILE modifier # NIL DO
  6932. symbol := cellType.FindProperty(modifier.identifier);
  6933. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6934. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6935. modifier := modifier.nextModifier;
  6936. END;
  6937. END AddModifiers;
  6938. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6939. VAR last: SyntaxTree.Modifier;
  6940. BEGIN
  6941. IF to = NIL THEN
  6942. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6943. ELSE
  6944. last := to;
  6945. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6946. last := last.nextModifier;
  6947. END;
  6948. IF last.identifier # this.identifier THEN
  6949. ASSERT(last.nextModifier = NIL);
  6950. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6951. END;
  6952. END;
  6953. END AppendModifier;
  6954. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6955. BEGIN
  6956. WHILE this # NIL DO
  6957. AppendModifier(to, this);
  6958. this := this.nextModifier;
  6959. END;
  6960. END AppendModifiers;
  6961. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6962. VAR base: SyntaxTree.Type;
  6963. BEGIN
  6964. AppendModifiers(to, c.modifiers);
  6965. base := c.GetBaseValueType();
  6966. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6967. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6968. END;
  6969. END AppendCellTypeModifiers;
  6970. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6971. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6972. BEGIN
  6973. Basic.GetString(modifier.identifier, name);
  6974. PushConstString(name);
  6975. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6976. ASSERT(SemanticChecker.IsStringType(value.type));
  6977. Designate(value, op);
  6978. PushString(op, value.type);
  6979. ReleaseOperand(op);
  6980. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6981. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6982. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6983. Evaluate(value, op);
  6984. Emit(Push(modifier.position, op.op));
  6985. ReleaseOperand(op);
  6986. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6987. ELSE
  6988. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6989. END;
  6990. END AddPortProperty;
  6991. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6992. BEGIN
  6993. WHILE modifier # NIL DO
  6994. AddPortProperty(modifier, modifier.expression);
  6995. modifier := modifier.nextModifier;
  6996. END;
  6997. END AddPortProperties;
  6998. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6999. VAR op: Operand;
  7000. BEGIN
  7001. Evaluate(p, op);
  7002. Emit(Push(p.position, op.op));
  7003. ReleaseOperand(op);
  7004. IF p IS SyntaxTree.Designator THEN
  7005. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  7006. END;
  7007. END PushPort;
  7008. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  7009. VAR tmp: IntermediateCode.Operand;
  7010. BEGIN
  7011. actualType := actualType.resolved;
  7012. IF actualType IS SyntaxTree.StringType THEN
  7013. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  7014. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7015. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  7016. ELSE
  7017. tmp := op.tag;
  7018. IntermediateCode.MakeMemory(tmp,addressType);
  7019. Emit(Push(position,tmp));
  7020. END;
  7021. Emit(Push(position,op.op))
  7022. END PushString;
  7023. (* conservative check if x is potentially on the heap, excluding the module heap
  7024. required for generational garbage collector
  7025. *)
  7026. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  7027. VAR pos: LONGINT; y: SyntaxTree.Expression;
  7028. BEGIN
  7029. RETURN TRUE;
  7030. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  7031. passed by reference.
  7032. pos := x.position.start;
  7033. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  7034. x := x(SyntaxTree.Designator).left;
  7035. END;
  7036. RETURN x # NIL;
  7037. *)
  7038. END OnHeap;
  7039. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  7040. VAR
  7041. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  7042. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7043. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7044. tmp:IntermediateCode.Operand;
  7045. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  7046. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7047. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7048. dest: IntermediateCode.Operand;
  7049. staticLength: LONGINT; itype: IntermediateCode.Type;
  7050. convert,isTensor: BOOLEAN;
  7051. recordType: SyntaxTree.RecordType;
  7052. baseType: SyntaxTree.Type;
  7053. flags: SET;
  7054. left: SyntaxTree.Expression;
  7055. call: SyntaxTree.Designator;
  7056. procedure: SyntaxTree.Procedure;
  7057. temporaryVariable: SyntaxTree.Variable;
  7058. dummy: IntermediateCode.Operand;
  7059. customBuiltin: SyntaxTree.CustomBuiltin;
  7060. isVarPar: ARRAY 3 OF BOOLEAN;
  7061. callsection: Sections.Section;
  7062. segmentedName: Basic.SegmentedName;
  7063. needsTrace: BOOLEAN;
  7064. n: ARRAY 256 OF CHAR;
  7065. modifier: SyntaxTree.Modifier;
  7066. previous, init: IntermediateCode.Section;
  7067. prevScope: SyntaxTree.Scope;
  7068. firstPar: LONGINT;
  7069. saved: RegisterEntry;
  7070. callingConvention: SyntaxTree.CallingConvention;
  7071. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7072. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7073. priority: IntermediateCode.Operand;
  7074. op,callop: Operand;
  7075. BEGIN
  7076. IF type = NIL THEN RETURN END;
  7077. type := type.resolved;
  7078. IF type IS SyntaxTree.PointerType THEN
  7079. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7080. END;
  7081. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7082. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7083. recordScope := type(SyntaxTree.RecordType).recordScope;
  7084. IF recordScope.bodyProcedure # NIL THEN
  7085. procedure := recordScope.bodyProcedure;
  7086. body := procedure.procedureScope.body;
  7087. Emit(Push(position,self));
  7088. IF body.isActive THEN
  7089. StaticCallOperand(callop,procedure);
  7090. Emit(Push(position,callop.op));
  7091. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7092. Convert(priority,sizeType);
  7093. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7094. END;
  7095. Emit(Push(position,priority));
  7096. ReleaseIntermediateOperand(priority);
  7097. IF backend.cooperative THEN
  7098. Emit(Push(position,self));
  7099. CallThis(position,"Activities","Create",3)
  7100. ELSE
  7101. flags := 0;
  7102. IF body.isSafe THEN
  7103. flags := 1;
  7104. END;
  7105. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7106. Emit(Push(position,self));
  7107. CallThis(position,"Objects","CreateProcess",4)
  7108. END;
  7109. ELSE
  7110. Emit(Push(position,self));
  7111. StaticCallOperand(callop,procedure);
  7112. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7113. END;
  7114. Emit(Pop(position,self));
  7115. END;
  7116. END CallBodies;
  7117. PROCEDURE PushTD(type: SyntaxTree.Type);
  7118. VAR op: IntermediateCode.Operand;
  7119. BEGIN
  7120. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7121. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7122. ELSE
  7123. IF type.resolved IS SyntaxTree.PointerType THEN
  7124. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7125. END;
  7126. op := TypeDescriptorAdr(type.resolved);
  7127. Emit(Push(position,op));
  7128. END
  7129. END PushTD;
  7130. BEGIN
  7131. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7132. dest := destination; destination := emptyOperand;
  7133. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7134. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7135. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7136. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7137. CASE x.id OF
  7138. (* ---- COPY ----- *)
  7139. |Global.Copy:
  7140. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7141. (* ---- EXCL, INCL----- *)
  7142. |Global.Excl,Global.Incl:
  7143. Evaluate(p0,s0);
  7144. Evaluate(p1,s1);
  7145. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7146. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7147. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7148. END;
  7149. ReuseCopy(res,s0.op);
  7150. ReleaseOperand(s0);
  7151. Reuse1(tmp,s1.op);
  7152. ReleaseOperand(s1);
  7153. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7154. IF x.id = Global.Excl THEN
  7155. Emit(Not(position,tmp,tmp));
  7156. Emit(And(position,res,res,tmp));
  7157. ELSE
  7158. Emit(Or(position,res,res,tmp));
  7159. END;
  7160. ReleaseIntermediateOperand(tmp);
  7161. Designate(p0,s0);
  7162. ToMemory(s0.op,s1.op.type,0);
  7163. Emit(Mov(position,s0.op,res));
  7164. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7165. (* ---- DISPOSE ----- *)
  7166. |Global.Dispose:
  7167. Designate(p0,s0);
  7168. Emit(Push(position,s0.op));
  7169. ReleaseOperand(s0);
  7170. CallThis(position,"Runtime","Dispose", 1);
  7171. (* ---- GETPROCEDURE ----- *)
  7172. |Global.GetProcedure:
  7173. Designate(p0,s0);
  7174. PushString(s0,p0.type);
  7175. Designate(p1,s1);
  7176. PushString(s1,p1.type);
  7177. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7178. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7179. ELSE PushTD(procedureType.firstParameter.type)
  7180. END;
  7181. PushTD(procedureType.returnType);
  7182. Designate(p2,s2);
  7183. Emit(Push(position,s2.op));
  7184. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7185. CallThis(position,"Modules","GetProcedure", 7);
  7186. (* ---- ASH, LSH, ROT ----- *)
  7187. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7188. Evaluate(p0,s0);
  7189. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7190. (* make unsigned arguments in order to produced a logical shift *)
  7191. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7192. convert:= TRUE;
  7193. itype := s0.op.type;
  7194. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7195. Convert(s0.op,itype);
  7196. ELSE
  7197. convert := FALSE;
  7198. END;
  7199. END;
  7200. Evaluate(p1,s1);
  7201. IF IsIntegerConstant(p1,hint) THEN
  7202. ReuseCopy(reg,s0.op);
  7203. IF hint > 0 THEN
  7204. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7205. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7206. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7207. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7208. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7209. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7210. END;
  7211. ELSIF hint < 0 THEN
  7212. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7213. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7214. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7215. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7216. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7217. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7218. END;
  7219. END;
  7220. ReleaseOperand(s0); ReleaseOperand(s1);
  7221. ELSE
  7222. exit := NewLabel();
  7223. end := NewLabel();
  7224. ReuseCopy(reg,s0.op);
  7225. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7226. Reuse1(tmp,s1.op);
  7227. Emit(Neg(position,tmp,s1.op));
  7228. Convert(tmp,s1.op.type);
  7229. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7230. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7231. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7232. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7233. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7234. END;
  7235. ReleaseIntermediateOperand(tmp);
  7236. BrL(end);
  7237. SetLabel(exit);
  7238. ReuseCopy(tmp,s1.op);
  7239. Convert(tmp,s1.op.type);
  7240. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7241. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7242. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7243. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7244. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7245. END;
  7246. ReleaseIntermediateOperand(tmp);
  7247. SetLabel(end);
  7248. ReleaseOperand(s0); ReleaseOperand(s1);
  7249. END;
  7250. InitOperand(result,ModeValue);
  7251. IF convert THEN
  7252. itype := reg.type;
  7253. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7254. Convert(reg,itype);
  7255. END;
  7256. result.op := reg;
  7257. (* ---- CAP ----- *)
  7258. |Global.Cap:
  7259. Evaluate(p0,result);
  7260. ReuseCopy(reg,result.op);
  7261. ReleaseIntermediateOperand(result.op);
  7262. ignore := NewLabel();
  7263. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7264. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7265. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7266. SetLabel(ignore);
  7267. result.op := reg;
  7268. (* ---- CHR ----- *)
  7269. |Global.Chr, Global.Chr32:
  7270. Evaluate(p0,result);
  7271. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7272. |Global.Entier, Global.EntierH:
  7273. Evaluate(p0,result);
  7274. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7275. (* ---- MIN and MAX ----- *)
  7276. |Global.Max,Global.Min:
  7277. Evaluate(p0,s0);
  7278. Evaluate(p1,s1);
  7279. Reuse2(res,s0.op,s1.op);
  7280. else := NewLabel();
  7281. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7282. ELSE BrltL(else,s1.op,s0.op) END;
  7283. Emit(Mov(position,res,s0.op));
  7284. ReleaseOperand(s0);
  7285. end := NewLabel();
  7286. BrL(end);
  7287. SetLabel(else);
  7288. Emit(MovReplace(position,res,s1.op));
  7289. SetLabel(end);
  7290. ReleaseOperand(s1);
  7291. InitOperand(result,ModeValue);
  7292. result.op := res;
  7293. (* ---- ODD ----- *)
  7294. |Global.Odd:
  7295. IF ~conditional THEN
  7296. ConditionToValue(x)
  7297. ELSE
  7298. Evaluate(p0,result);
  7299. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7300. Reuse1(res,result.op);
  7301. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7302. ReleaseIntermediateOperand(result.op);
  7303. result.op := res;
  7304. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7305. ReleaseOperand(result);
  7306. BrL(falseLabel);
  7307. END;
  7308. (* ---- ORD ----- *)
  7309. |Global.Ord, Global.Ord32:
  7310. Evaluate(p0,result);
  7311. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7312. (* ---- SHORT, LONG ----- *)
  7313. |Global.Short, Global.Long:
  7314. Evaluate(p0,result);
  7315. IF x.type IS SyntaxTree.ComplexType THEN
  7316. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7317. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7318. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7319. ELSE
  7320. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7321. END
  7322. (* ---- HALT, SYSTEM.HALT----- *)
  7323. |Global.Halt, Global.systemHalt:
  7324. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7325. EmitTrap (position, val);
  7326. (* ---- ASSERT ----- *)
  7327. |Global.Assert:
  7328. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7329. trueL := NewLabel();
  7330. falseL := NewLabel();
  7331. Condition(p0,trueL,falseL);
  7332. IF p1 = NIL THEN val := AssertTrap
  7333. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7334. END;
  7335. SetLabel(falseL);
  7336. EmitTrap(position,val);
  7337. SetLabel(trueL);
  7338. END;
  7339. (*
  7340. Emit(TrapC(result.op,val);
  7341. *)
  7342. (* ---- INC, DEC----- *)
  7343. |Global.Inc,Global.Dec:
  7344. Expression(p0); adr := result.op;
  7345. LoadValue(result,p0.type); l := result;
  7346. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7347. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7348. END;
  7349. IF x.id = Global.Inc THEN
  7350. Emit(Add(position,l.op,l.op,r.op));
  7351. ELSE
  7352. Emit(Sub(position,l.op,l.op,r.op));
  7353. END;
  7354. ReleaseOperand(l); ReleaseOperand(r);
  7355. (* ---- LEN ----- *)
  7356. |Global.Len: (* dynamic length, static length done by checker *)
  7357. Designate(p0,operand);
  7358. IF p1 = NIL THEN
  7359. InitOperand(l,ModeValue);
  7360. l.op := IntermediateCode.Immediate(sizeType,0);
  7361. ELSE
  7362. Evaluate(p1,l);
  7363. END;
  7364. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7365. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7366. Dereference(operand, p0.type.resolved, FALSE);
  7367. END;
  7368. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7369. ReleaseOperand(operand); ReleaseOperand(l);
  7370. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7371. ASSERT(p1 # NIL);
  7372. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7373. Dereference(operand,p0.type.resolved,FALSE);
  7374. END;
  7375. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7376. ReleaseOperand(operand); ReleaseOperand(l);
  7377. ELSE HALT(100);
  7378. END;
  7379. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7380. (* ---- FIRST ---- *)
  7381. |Global.First:
  7382. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7383. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7384. ELSE
  7385. Designate(p0, result)
  7386. END
  7387. (* ---- LAST ---- *)
  7388. |Global.Last:
  7389. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7390. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7391. ELSE
  7392. Designate(p0, result);
  7393. (* make sure result.op is a register *)
  7394. tmp := result.op;
  7395. ReuseCopy(result.op, result.op);
  7396. ReleaseIntermediateOperand(tmp);
  7397. (* add offset to result.op *)
  7398. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7399. END
  7400. (* ---- STEP ---- *)
  7401. |Global.Step:
  7402. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7403. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7404. ELSE
  7405. Designate(p0, result);
  7406. (* make sure result.op is a register *)
  7407. tmp := result.op;
  7408. ReuseCopy(result.op, result.op);
  7409. ReleaseIntermediateOperand(tmp);
  7410. (* add offset to result.op *)
  7411. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7412. END
  7413. (* ---- RE ---- *)
  7414. |Global.Re:
  7415. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7416. Designate(p0, result)
  7417. ELSE
  7418. Evaluate(p0, result)
  7419. END
  7420. (* ---- IM ---- *)
  7421. |Global.Im:
  7422. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7423. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7424. Designate(p0, result);
  7425. (* make sure result.op is a register *)
  7426. tmp := result.op;
  7427. ReuseCopy(result.op, result.op);
  7428. ReleaseIntermediateOperand(tmp);
  7429. (* add offset to result.op *)
  7430. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7431. (* ---- ABS ----- *)
  7432. |Global.Abs:
  7433. Evaluate(p0,operand);
  7434. type := p0.type.resolved;
  7435. InitOperand(result,ModeValue);
  7436. Reuse1a(result.op,operand.op,dest);
  7437. Emit(Abs(position,result.op,operand.op));
  7438. ReleaseOperand(operand);
  7439. (* ---- WAIT ----- *)
  7440. |Global.Wait:
  7441. Evaluate(p0,operand);
  7442. Emit(Push(position,operand.op));
  7443. ReleaseOperand(operand);
  7444. CallThis(position,"Activities","Wait", 1);
  7445. (* ---- NEW ----- *)
  7446. |Global.New:
  7447. (*! the following code is only correct for "standard" Oberon calling convention *)
  7448. IF x.type # NIL THEN
  7449. type := x.type.resolved;
  7450. firstPar := 0;
  7451. ELSE
  7452. type := p0.type.resolved;
  7453. firstPar := 1;
  7454. END;
  7455. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7456. THEN
  7457. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7458. IF backend.cooperative THEN
  7459. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7460. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7461. IF recordType.isObject THEN
  7462. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7463. IF recordType.IsActive() THEN
  7464. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7465. END;
  7466. IF recordType.IsProtected() THEN
  7467. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7468. END;
  7469. ELSE
  7470. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7471. END;
  7472. END;
  7473. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7474. CallThis(position,"Runtime","New", 1);
  7475. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7476. Emit(Result(position, pointer));
  7477. exit := NewLabel();
  7478. BreqL(exit,pointer,nil);
  7479. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7480. GetRecordTypeName (recordType,name);
  7481. IF ~recordType.isObject THEN
  7482. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7483. END;
  7484. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7485. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7486. IF recordType.isObject THEN
  7487. IF recordType.IsProtected() THEN
  7488. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7489. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7490. END;
  7491. IF recordType.IsActive() THEN
  7492. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7493. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7494. END;
  7495. END;
  7496. END;
  7497. (* initialize fields *)
  7498. IF type(SyntaxTree.PointerType).isPlain THEN
  7499. size := 0;
  7500. ELSIF recordType.isObject THEN
  7501. size := BaseObjectTypeSize;
  7502. ELSE
  7503. size := BaseRecordTypeSize;
  7504. END;
  7505. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7506. (* call initializer *)
  7507. constructor := GetConstructor(recordType);
  7508. IF constructor # NIL THEN
  7509. (*! should be unified with ProcedureCallDesignator *)
  7510. Emit(Push(position,pointer));
  7511. ReleaseIntermediateOperand(pointer);
  7512. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7513. FOR i := firstPar TO x.parameters.Length()-1 DO
  7514. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7515. formalParameter := formalParameter.nextParameter;
  7516. END;
  7517. (* static call of the constructor *)
  7518. GetCodeSectionNameForSymbol(constructor,name);
  7519. ASSERT(~constructor.isInline);
  7520. IF constructor.scope.ownerModule # module.module THEN
  7521. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7522. ELSE
  7523. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7524. END;
  7525. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7526. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7527. Emit(Pop(position,pointer));
  7528. END;
  7529. (* call bodies *)
  7530. CallBodies(pointer,type);
  7531. SetLabel(exit);
  7532. needsTrace := p0.NeedsTrace();
  7533. IF needsTrace THEN ModifyAssignments(true) END;
  7534. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7535. Emit(Push(position, pointer));
  7536. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7537. Emit(Pop(position, pointer));
  7538. END;
  7539. Designate(p0,l);
  7540. IF needsTrace THEN
  7541. CallAssignPointer(l.op, pointer);
  7542. ELSE
  7543. ToMemory(l.op,addressType,0);
  7544. Emit(Mov(position,l.op,pointer));
  7545. END;
  7546. ReleaseIntermediateOperand(pointer);
  7547. ReleaseOperand(l);
  7548. IF needsTrace THEN ModifyAssignments(false) END;
  7549. ELSE (* not cooperative backend *)
  7550. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7551. IF temporaryVariable # NIL THEN
  7552. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7553. ELSE
  7554. Designate(p0,l);
  7555. END;
  7556. (* l.op contains address of pointer to record *)
  7557. Emit(Push(position,l.op)); (* address for use after syscall *)
  7558. Emit(Push(position,l.op));
  7559. ReleaseOperand(l);
  7560. (* push type descriptor *)
  7561. reg := TypeDescriptorAdr(recordType);
  7562. Emit(Push(position,reg));
  7563. ReleaseIntermediateOperand(reg);
  7564. (* push realtime flag *)
  7565. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7566. ELSE Emit(Push(position,false));
  7567. END;
  7568. CallThis(position,"Heaps","NewRec", 3);
  7569. (* check allocation success, if not successful then do not call initializers and bodies *)
  7570. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7571. Emit(Pop(position,pointer));
  7572. MakeMemory(reg,pointer,addressType,0);
  7573. ReleaseIntermediateOperand(pointer);
  7574. pointer := reg;
  7575. exit := NewLabel();
  7576. BreqL(exit,pointer,nil);
  7577. Emit(Push(position,pointer));
  7578. (* initialize fields *)
  7579. InitFields(recordType, pointer,0);
  7580. (* call initializer *)
  7581. constructor := GetConstructor(recordType);
  7582. IF constructor # NIL THEN
  7583. (*! should be unified with ProcedureCallDesignator *)
  7584. Emit(Push(position,pointer));
  7585. ReleaseIntermediateOperand(pointer);
  7586. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7587. FOR i := firstPar TO x.parameters.Length()-1 DO
  7588. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7589. formalParameter := formalParameter.nextParameter;
  7590. END;
  7591. (* static call of the constructor *)
  7592. GetCodeSectionNameForSymbol(constructor,name);
  7593. ASSERT(~constructor.isInline);
  7594. IF constructor.scope.ownerModule # module.module THEN
  7595. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7596. ELSE
  7597. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7598. END;
  7599. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7600. ELSE
  7601. ReleaseIntermediateOperand(pointer);
  7602. END;
  7603. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7604. Emit(Pop(position,pointer));
  7605. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7606. Designate(p0,l);
  7607. IF backend.writeBarriers & OnHeap(p0) THEN
  7608. SaveRegisters();ReleaseUsedRegisters(saved);
  7609. Emit(Push(position,l.op));
  7610. Emit(Push(position,pointer));
  7611. CallThis(position,"Heaps","Assign",2);
  7612. RestoreRegisters(saved);
  7613. ELSE
  7614. ToMemory(l.op,addressType,0);
  7615. Emit(Mov(position,l.op,pointer));
  7616. END;
  7617. ReleaseOperand(l);
  7618. result.tag := emptyOperand;
  7619. ELSIF (x.type # NIL) THEN
  7620. result := l; (* temporary variable is the result of NEW Type() *)
  7621. END;
  7622. (* call bodies *)
  7623. CallBodies(pointer,type);
  7624. ReleaseIntermediateOperand(pointer);
  7625. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7626. end := NewLabel();
  7627. BrL(end);
  7628. SetLabel(exit);
  7629. Designate(p0,l);
  7630. ToMemory(l.op,addressType,0);
  7631. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7632. ReleaseOperand(l);
  7633. SetLabel(end);
  7634. ELSE
  7635. SetLabel(exit);
  7636. END;
  7637. END;
  7638. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7639. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7640. IF ~backend.cooperative THEN (* simpler version *)
  7641. (*
  7642. push len0
  7643. push len1
  7644. push len2
  7645. push len_size
  7646. push len_adr
  7647. push tag
  7648. push static elements
  7649. push element size
  7650. push adr
  7651. *)
  7652. dim := 0;
  7653. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7654. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7655. parameter := x.parameters.GetExpression(i);
  7656. Evaluate(parameter,r);
  7657. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7658. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7659. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7660. END;
  7661. Emit(Push(position,r.op));
  7662. ReleaseOperand(r);
  7663. INC(dim);
  7664. END;
  7665. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7666. Emit(Mov(position, adr, sp));
  7667. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7668. Emit(Push(position, adr));
  7669. ReleaseIntermediateOperand(adr);
  7670. openDim := dim;
  7671. staticLength := 1;
  7672. IF type IS SyntaxTree.ArrayType THEN
  7673. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7674. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7675. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7676. END;
  7677. END;
  7678. IF SemanticChecker.ContainsPointer(type) THEN
  7679. tmp := TypeDescriptorAdr(type);
  7680. ELSE
  7681. tmp := nil;
  7682. END;
  7683. Emit(Push(position,tmp)); (* type descriptor *)
  7684. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7685. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7686. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7687. Designate(p0,l);
  7688. Emit(Push(position,l.op)); (* address *)
  7689. ReleaseOperand(l);
  7690. CallThis(position,"Heaps","NewArray", 6);
  7691. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7692. Emit(Add(position,sp,sp,tmp));
  7693. ELSE
  7694. dim := 0;
  7695. IntermediateCode.InitOperand(reg);
  7696. IF p1 # NIL THEN
  7697. FOR i := firstPar TO x.parameters.Length()-1 DO
  7698. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7699. parameter := x.parameters.GetExpression(i);
  7700. Evaluate(parameter,r);
  7701. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7702. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7703. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7704. END;
  7705. Emit(Push(position,r.op));
  7706. IF i=1 THEN
  7707. CopyInt(reg,r.op);
  7708. ELSE
  7709. MulInt(reg, reg, r.op);
  7710. END;
  7711. ReleaseOperand(r);
  7712. INC(dim);
  7713. END;
  7714. Convert(reg,addressType);
  7715. ELSE
  7716. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7717. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7718. END;
  7719. openDim := dim;
  7720. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7721. IF backend.cooperative THEN
  7722. size := ToMemoryUnits(system,system.SizeOf(type));
  7723. WHILE type IS SyntaxTree.ArrayType DO
  7724. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7725. END;
  7726. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7727. IF (size # 1) THEN
  7728. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7729. END;
  7730. Emit(Push(position,reg));
  7731. size := ToMemoryUnits(system,system.SizeOf(type));
  7732. IF (size # 1) THEN
  7733. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7734. END;
  7735. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7736. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7737. Emit(Push(position,reg));
  7738. ReleaseIntermediateOperand(reg);
  7739. CallThis(position,"Runtime","New", 1);
  7740. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7741. Emit(Result(position, pointer));
  7742. exit := NewLabel();
  7743. else := NewLabel();
  7744. BreqL(else,pointer,nil);
  7745. IF ~type.hasPointers THEN
  7746. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7747. ELSIF type IS SyntaxTree.RecordType THEN
  7748. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7749. ELSIF type IS SyntaxTree.ProcedureType THEN
  7750. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7751. ELSE
  7752. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7753. END;
  7754. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7755. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7756. 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))));
  7757. IF type IS SyntaxTree.RecordType THEN
  7758. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7759. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7760. ELSE
  7761. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7762. END;
  7763. i := openDim;
  7764. WHILE i > 0 DO
  7765. DEC (i);
  7766. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7767. END;
  7768. needsTrace := p0.NeedsTrace();
  7769. IF needsTrace THEN ModifyAssignments(true) END;
  7770. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7771. Emit(Push(position, pointer));
  7772. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7773. Emit(Pop(position, pointer));
  7774. END;
  7775. Designate(p0,l);
  7776. IF needsTrace THEN
  7777. CallAssignPointer(l.op, pointer);
  7778. ModifyAssignments(false);
  7779. ELSE
  7780. ToMemory(l.op,addressType,0);
  7781. Emit(Mov(position,l.op,pointer));
  7782. END;
  7783. ReleaseIntermediateOperand(pointer);
  7784. ReleaseOperand(l);
  7785. BrL(exit);
  7786. SetLabel(else);
  7787. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7788. Designate(p0,l);
  7789. IF needsTrace THEN
  7790. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7791. ELSE
  7792. ToMemory(l.op,addressType,0);
  7793. Emit(Mov(position,l.op,pointer));
  7794. END;
  7795. ReleaseOperand(l);
  7796. SetLabel(exit);
  7797. ELSE
  7798. (*! the following code is only correct for "standard" Oberon calling convention *)
  7799. IF SemanticChecker.ContainsPointer(type) THEN
  7800. IF type IS SyntaxTree.ArrayType THEN
  7801. staticLength := 1;
  7802. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7803. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7804. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7805. END;
  7806. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7807. MulInt(reg,reg,tmp);
  7808. END;
  7809. Designate(p0,l);
  7810. IF openDim > 0 THEN
  7811. Emit(Push(position,l.op)); (* address for use after syscall *)
  7812. END;
  7813. Emit(Push(position,l.op)); (* address *)
  7814. ReleaseOperand(l);
  7815. tmp := TypeDescriptorAdr(type);
  7816. Emit(Push(position,tmp)); (* type descriptor *)
  7817. ReleaseIntermediateOperand(tmp);
  7818. Emit(Push(position,reg)); (* number Elements *)
  7819. ReleaseIntermediateOperand(reg);
  7820. tmp := IntermediateCode.Immediate(addressType,dim);
  7821. Emit(Push(position,tmp)); (* dimensions *)
  7822. (* push realtime flag *)
  7823. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7824. ELSE Emit(Push(position,false));
  7825. END;
  7826. CallThis(position,"Heaps","NewArr",5)
  7827. ELSE
  7828. size := ToMemoryUnits(system,system.SizeOf(type));
  7829. IF (size # 1) THEN
  7830. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7831. (*
  7832. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7833. *)
  7834. END;
  7835. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7836. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7837. AddInt(reg, reg, tmp);
  7838. (*
  7839. Emit(Add(position,reg,reg,tmp));
  7840. *)
  7841. Designate(p0,l);
  7842. IF openDim >0 THEN
  7843. Emit(Push(position,l.op)); (* address for use after syscall *)
  7844. END;
  7845. Emit(Push(position,l.op)); (* address for syscall *)
  7846. ReleaseOperand(l); (* pointer address *)
  7847. Emit(Push(position,reg)); (* size *)
  7848. ReleaseIntermediateOperand(reg);
  7849. (* push realtime flag *)
  7850. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7851. ELSE Emit(Push(position,false));
  7852. END;
  7853. CallThis(position,"Heaps","NewSys", 3)
  7854. END;
  7855. IF openDim > 0 THEN
  7856. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7857. Emit(Pop(position,adr));
  7858. ToMemory(adr,addressType,0);
  7859. ReuseCopy(tmp,adr);
  7860. ReleaseIntermediateOperand(adr);
  7861. adr := tmp;
  7862. else := NewLabel();
  7863. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7864. i := openDim-1;
  7865. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7866. WHILE (i >= 0) DO
  7867. Emit(Pop(position,reg));
  7868. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7869. Emit(Mov(position,res,reg));
  7870. DEC(i);
  7871. END;
  7872. ReleaseIntermediateOperand(adr);
  7873. ReleaseIntermediateOperand(reg);
  7874. exit := NewLabel();
  7875. BrL(exit);
  7876. SetLabel(else);
  7877. (* else part: array could not be allocated *)
  7878. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7879. Emit(Add(position,sp,sp,tmp));
  7880. SetLabel(exit);
  7881. END;
  7882. END;
  7883. END;
  7884. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7885. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7886. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7887. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7888. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7889. callingConvention := procedureType.callingConvention;
  7890. left.SetType(procedure.type);
  7891. formalParameter := procedureType.firstParameter;
  7892. (* push array to allocate *)
  7893. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7894. formalParameter :=formalParameter.nextParameter;
  7895. (* push length array *)
  7896. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7897. (* push size *)
  7898. type := t0;
  7899. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7900. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7901. END;
  7902. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7903. Emit(Push(position,tmp));
  7904. (* *)
  7905. IF SemanticChecker.ContainsPointer(type) THEN
  7906. tmp := TypeDescriptorAdr(type);
  7907. ELSE
  7908. tmp := IntermediateCode.Immediate(addressType, 0);
  7909. END;
  7910. Emit(Push(position,tmp)); (* type descriptor *)
  7911. StaticCallOperand(result,procedure);
  7912. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7913. ReleaseOperand(result);
  7914. END;
  7915. (*
  7916. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7917. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7918. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7919. *)
  7920. ELSE
  7921. (*
  7922. push len0
  7923. push len1
  7924. push len2
  7925. push size
  7926. push len_adr
  7927. push element_size
  7928. push tag
  7929. push adr
  7930. *)
  7931. dim := 0;
  7932. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7933. isTensor := TRUE;
  7934. ELSE
  7935. isTensor := FALSE;
  7936. END;
  7937. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7938. IF ~isTensor THEN
  7939. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7940. END;
  7941. parameter := x.parameters.GetExpression(i);
  7942. Evaluate(parameter,r);
  7943. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7944. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7945. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7946. END;
  7947. Emit(Push(position,r.op));
  7948. ReleaseOperand(r);
  7949. INC(dim);
  7950. END;
  7951. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7952. Emit(Mov(position, adr, sp));
  7953. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7954. Emit(Push(position, adr));
  7955. ReleaseIntermediateOperand(adr);
  7956. openDim := dim;
  7957. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7958. IF isTensor THEN
  7959. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7960. ELSE
  7961. baseType := SemanticChecker.ArrayBase(type,openDim);
  7962. END;
  7963. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7964. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7965. IF SemanticChecker.ContainsPointer(baseType) THEN
  7966. tmp := TypeDescriptorAdr(baseType);
  7967. ELSE
  7968. tmp := nil;
  7969. END;
  7970. Emit(Push(position,tmp)); (* type descriptor *)
  7971. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7972. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7973. ELSE (* error message has already been emited *)
  7974. RETURN;
  7975. END;
  7976. Designate(p0,l);
  7977. IF isTensor THEN
  7978. Emit(Push(position,l.op)); (* address *)
  7979. ELSE
  7980. Emit(Push(position,l.tag)); (* address *)
  7981. END;
  7982. ReleaseOperand(l);
  7983. StaticCallOperand(result,procedure);
  7984. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7985. ReleaseOperand(result);
  7986. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7987. Emit(Add(position,sp,sp,tmp));
  7988. END;
  7989. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7990. THEN
  7991. IF ~backend.cellsAreObjects THEN RETURN END;
  7992. IF InCellScope(currentScope) THEN
  7993. PushSelfPointer()
  7994. ELSE
  7995. Emit(Push(position, nil));
  7996. END;
  7997. (* push temp address *)
  7998. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7999. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  8000. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8001. (* l.op contains address of pointer to record *)
  8002. Emit(Push(position,l.op)); (* address for use after syscall *)
  8003. ReleaseOperand(l);
  8004. (* push type descriptor *)
  8005. reg := TypeDescriptorAdr(baseType);
  8006. Emit(Push(position,reg));
  8007. ReleaseIntermediateOperand(reg);
  8008. (* push name *)
  8009. (*Global.GetSymbolName(p0, n);*)
  8010. IF currentScope IS SyntaxTree.ProcedureScope THEN
  8011. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  8012. ELSE
  8013. Global.GetModuleName(module.module, n);
  8014. END;
  8015. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  8016. (*type.typeDeclaration.GetName(n);*)
  8017. PushConstString(n);
  8018. (* push cellnet boolean *)
  8019. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  8020. (* push engine boolean *)
  8021. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  8022. (* allocate *)
  8023. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  8024. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8025. (* l.op contains address of pointer to record *)
  8026. ToMemory(l.op,addressType,0);
  8027. (* l.op contains value of pointer to record *)
  8028. InitFields(baseType, l.op,0);
  8029. (* add capabilities *)
  8030. modifier := p0(SyntaxTree.Designator).modifiers;
  8031. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  8032. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  8033. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  8034. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  8035. END;
  8036. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  8037. (*
  8038. modifier := baseType(SyntaxTree.CellType).modifiers;
  8039. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  8040. modifier := p0(SyntaxTree.Designator).modifiers;
  8041. *)
  8042. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8043. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8044. (* l.op contains address of pointer to record *)
  8045. ToMemory(l.op,addressType,0);
  8046. (* l.op contains value of pointer to record *)
  8047. Emit(Push(position,l.op)); (* address for use after syscall *)
  8048. ReleaseOperand(l);
  8049. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8050. prevScope := currentScope;
  8051. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8052. previous := section;
  8053. section := init;
  8054. (* add ports *)
  8055. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8056. CloseInitializer(previous);
  8057. currentScope := prevScope;
  8058. Symbol(temporaryVariable,l);
  8059. ToMemory(l.op,addressType,0);
  8060. Emit(Push(position,l.op));
  8061. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8062. (*
  8063. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8064. IF constructor # NIL THEN
  8065. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8066. FOR i := 1 TO x.parameters.Length()-1 DO
  8067. p := x.parameters.GetExpression(i);
  8068. Global.GetSymbolName(parameter,name);
  8069. Evaluate(p, value);
  8070. ASSERT(value.type # NIL);
  8071. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8072. par := instance.AddParameter(name);
  8073. par.SetInteger(value.integer);
  8074. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8075. par := instance.AddParameter(name);
  8076. par.SetBoolean(value.boolean);
  8077. ELSE Error(x.position,NotYetImplemented)
  8078. END;
  8079. parameter := parameter.nextParameter
  8080. END;
  8081. END;
  8082. *)
  8083. (* call initializer *)
  8084. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8085. IF constructor # NIL THEN
  8086. (*! should be unified with ProcedureCallDesignator *)
  8087. IF backend.cellsAreObjects THEN
  8088. Symbol(temporaryVariable,l);
  8089. ToMemory(l.op,addressType,0);
  8090. Emit(Push(position,l.op));
  8091. ReleaseOperand(l);
  8092. END;
  8093. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8094. FOR i := firstPar TO x.parameters.Length()-1 DO
  8095. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8096. formalParameter := formalParameter.nextParameter;
  8097. END;
  8098. (* static call of the constructor *)
  8099. Global.GetSymbolSegmentedName(constructor,name);
  8100. ASSERT(~constructor.isInline);
  8101. IF constructor.scope.ownerModule # module.module THEN
  8102. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8103. ELSE
  8104. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8105. END;
  8106. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8107. (*ELSE
  8108. ReleaseIntermediateOperand(pointer);*)
  8109. END;
  8110. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8111. ToMemory(l.op, addressType, 0);
  8112. Designate(p0,s0);
  8113. ToMemory(s0.op,addressType,0);
  8114. Emit(Mov(position,s0.op,l.op));
  8115. ReleaseOperand(l);
  8116. ReleaseOperand(s0);
  8117. result.tag := emptyOperand;
  8118. (* start *)
  8119. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8120. (* push cell *)
  8121. Symbol(temporaryVariable, l);
  8122. ToMemory(l.op,addressType,0);
  8123. Emit(Push(Basic.invalidPosition,l.op));
  8124. (* push delegate *)
  8125. Emit(Push(Basic.invalidPosition,l.op));
  8126. ReleaseOperand(l);
  8127. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8128. Emit(Push(position, s1.op));
  8129. ReleaseOperand(s1);
  8130. CallThis(position,"ActiveCellsRuntime","Start",3);
  8131. END;
  8132. (*IF temporaryVariable # NIL THEN
  8133. end := NewLabel();
  8134. BrL(end);
  8135. SetLabel(exit);
  8136. Designate(p0,l);
  8137. ToMemory(l.op,addressType,0);
  8138. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8139. ReleaseOperand(l);
  8140. SetLabel(end);
  8141. ELSE
  8142. SetLabel(exit);
  8143. END;
  8144. *)
  8145. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8146. ELSE (* no pointer to record, no pointer to array *)
  8147. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8148. (* ignore new statement *)
  8149. Warning(p0.position, "cannot run on final hardware");
  8150. ELSE
  8151. HALT(200);
  8152. END;
  8153. END;
  8154. (* ---- ADDRESSOF----- *)
  8155. |Global.systemAdr:
  8156. Designate(p0,s0);
  8157. s0.mode := ModeValue;
  8158. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8159. ReleaseIntermediateOperand(s0.op);
  8160. s0.op := s0.tag;
  8161. IntermediateCode.InitOperand(s0.tag);
  8162. END;
  8163. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8164. result := s0;
  8165. (* ---- BIT ----- *)
  8166. |Global.systemBit:
  8167. Evaluate(p0,s0);
  8168. ToMemory(s0.op,addressType,0);
  8169. ReuseCopy(res,s0.op);
  8170. ReleaseOperand(s0);
  8171. Evaluate(p1,s1);
  8172. Emit(Ror(position,res,res,s1.op));
  8173. ReleaseOperand(s1);
  8174. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8175. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8176. IF ~conditional THEN
  8177. InitOperand(result,ModeValue); result.op := res;
  8178. ELSE
  8179. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8180. BrL(falseLabel);
  8181. ReleaseIntermediateOperand(res);
  8182. END;
  8183. (* --- MSK ----*)
  8184. |Global.systemMsk:
  8185. Evaluate(p0,s0);
  8186. Evaluate(p1,s1);
  8187. ReuseCopy(res,s0.op);
  8188. ReleaseOperand(s0);
  8189. Emit(And(position,res,res,s1.op));
  8190. ReleaseOperand(s1);
  8191. InitOperand(result,ModeValue);
  8192. result.op := res;
  8193. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8194. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8195. Evaluate(p0,s0);
  8196. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8197. ReleaseOperand(s0);
  8198. InitOperand(result,ModeValue);
  8199. result.op := res;
  8200. (* ---- SYSTEM.GetStackPointer ----- *)
  8201. |Global.systemGetStackPointer:
  8202. InitOperand(result,ModeValue);
  8203. result.op := sp;
  8204. (* ---- SYSTEM.GetFramePointer ----- *)
  8205. |Global.systemGetFramePointer:
  8206. InitOperand(result,ModeValue);
  8207. result.op := fp;
  8208. (* ---- SYSTEM.GetActivity ----- *)
  8209. |Global.systemGetActivity:
  8210. ASSERT(backend.cooperative);
  8211. InitOperand(result,ModeValue);
  8212. result.op := ap;
  8213. (* ---- SYSTEM.SetStackPointer ----- *)
  8214. |Global.systemSetStackPointer:
  8215. Evaluate(p0,s0); (* *)
  8216. Emit(Mov(position,sp,s0.op));
  8217. ReleaseOperand(s0);
  8218. (* ---- SYSTEM.SetFramePointer ----- *)
  8219. |Global.systemSetFramePointer:
  8220. Evaluate(p0,s0); (* *)
  8221. Emit(Mov(position,fp,s0.op));
  8222. ReleaseOperand(s0);
  8223. (* ---- SYSTEM.Activity ----- *)
  8224. |Global.systemSetActivity:
  8225. ASSERT(backend.cooperative);
  8226. Evaluate(p0,s0); (* *)
  8227. Emit(Mov(position,ap,s0.op));
  8228. ReleaseOperand(s0);
  8229. (* ---- SYSTEM.VAL ----- *)
  8230. |Global.systemVal:
  8231. Expression(p1);
  8232. s1 := result;
  8233. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8234. IF s1.mode = ModeReference THEN
  8235. (* nothing to be done if not record type, just take over new type *)
  8236. IF (type IS SyntaxTree.RecordType) THEN
  8237. ReleaseIntermediateOperand(s1.tag);
  8238. s1.tag := TypeDescriptorAdr(type);
  8239. UseIntermediateOperand(s1.tag);
  8240. END;
  8241. result := s1;
  8242. ELSE (* copy over result to different type, may not use convert *)
  8243. itype := IntermediateCode.GetType(system,type);
  8244. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8245. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8246. Emit(Mov(position,s0.op,s1.op));
  8247. ReleaseOperand(s1);
  8248. InitOperand(result,ModeValue);
  8249. result.op := s0.op;
  8250. ELSE (* different size, must convert *)
  8251. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8252. Convert(s1.op, IntermediateCode.GetType(system,type));
  8253. result := s1;
  8254. END;
  8255. END;
  8256. (* ---- SYSTEM.GET ----- *)
  8257. |Global.systemGet:
  8258. Evaluate(p0,s0); (* adr *)
  8259. Designate(p1,s1); (* variable *)
  8260. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8261. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8262. Emit(Mov(position,s1.op,s0.op));
  8263. ReleaseOperand(s1);
  8264. ReleaseOperand(s0);
  8265. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8266. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8267. Evaluate(p0,s0); (* *)
  8268. Evaluate(p1,s1); (* variable *)
  8269. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8270. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8271. (* real part *)
  8272. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8273. Emit(Mov(position,res, s1.op));
  8274. ReleaseIntermediateOperand(res);
  8275. (* imaginary part *)
  8276. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8277. Emit(Mov(position,res, s1.tag));
  8278. ReleaseIntermediateOperand(res);
  8279. ReleaseOperand(s1);
  8280. ReleaseOperand(s0);
  8281. ELSE
  8282. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8283. ReleaseOperand(s0);
  8284. Emit(Mov(position,res,s1.op));
  8285. ReleaseIntermediateOperand(res);
  8286. ReleaseOperand(s1);
  8287. END;
  8288. (* ---- SYSTEM.MOVE ----- *)
  8289. |Global.systemMove:
  8290. Evaluate(p0,s0);
  8291. Evaluate(p1,s1);
  8292. Evaluate(p2,s2);
  8293. Emit(Copy(position,s1.op,s0.op,s2.op));
  8294. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8295. (* ---- SYSTEM.NEW ----- *)
  8296. |Global.systemNew:
  8297. Designate(p0,s0);
  8298. Emit(Push(position,s0.op));
  8299. ReleaseOperand(s0);
  8300. Evaluate(p1,s1);
  8301. Emit(Push(position,s1.op));
  8302. ReleaseOperand(s1);
  8303. (* push realtime flag: false by default *)
  8304. Emit(Push(position,false));
  8305. CallThis(position,"Heaps","NewSys",3);
  8306. (* ---- SYSTEM.CALL ----- *)
  8307. |Global.systemRef:
  8308. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8309. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8310. s0.mode := ModeValue;
  8311. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8312. result := s0
  8313. (* ---- INCR ----- *)
  8314. |Global.Incr:
  8315. Designate(p0,operand);
  8316. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8317. Dereference(operand,p0.type.resolved,FALSE);
  8318. END;
  8319. ASSERT(p1 # NIL);
  8320. Evaluate(p1,l);
  8321. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8322. ReleaseOperand(operand); ReleaseOperand(l);
  8323. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8324. (* ---- SUM ----- *)
  8325. |Global.Sum: HALT(200);
  8326. (* ---- ALL ----- *)
  8327. |Global.All: HALT(200);
  8328. (* ---- CAS ----- *)
  8329. |Global.Cas:
  8330. needsTrace := p0.NeedsTrace();
  8331. IF needsTrace THEN ModifyAssignments(true) END;
  8332. Designate(p0,s0);
  8333. Evaluate(p1,s1);
  8334. Evaluate(p2,s2);
  8335. IF needsTrace THEN
  8336. Emit(Push(position, s0.op));
  8337. Emit(Push(position, s1.op));
  8338. Emit(Push(position, s2.op));
  8339. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8340. ELSE
  8341. Emit(Cas(position,s0.op,s1.op,s2.op));
  8342. END;
  8343. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8344. IF needsTrace THEN ModifyAssignments(false) END;
  8345. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8346. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8347. IF conditional THEN
  8348. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8349. BrL(falseLabel);
  8350. ReleaseIntermediateOperand(res);
  8351. END;
  8352. (* ---- DIM ----- *)
  8353. |Global.Dim:
  8354. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8355. Designate(p0,s0);
  8356. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8357. Dereference(s0,p0.type.resolved,FALSE);
  8358. END;
  8359. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8360. ReleaseOperand(s0);
  8361. (* ---- RESHAPE ----- *)
  8362. |Global.Reshape:
  8363. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8364. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8365. left.SetType(procedure.type);
  8366. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8367. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8368. END;
  8369. (* ---- SYSTEM.TYPECODE ----- *)
  8370. |Global.systemTypeCode:
  8371. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8372. IF type.resolved IS SyntaxTree.PointerType THEN
  8373. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8374. END;
  8375. result.op := TypeDescriptorAdr(type);
  8376. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8377. result.mode := ModeValue;
  8378. (* ---- SYSTEM.TRACE ----- *)
  8379. |Global.systemTrace:
  8380. SystemTrace(x.parameters, x.position);
  8381. (* ----- CONNECT ------*)
  8382. |Global.Connect:
  8383. IF backend.cellsAreObjects THEN
  8384. PushPort(p0);
  8385. PushPort(p1);
  8386. IF p2 # NIL THEN
  8387. Evaluate(p2, s2);
  8388. Emit(Push(p2.position, s2.op));
  8389. ReleaseOperand(s2);
  8390. ELSE
  8391. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8392. END;
  8393. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8394. ELSE
  8395. Warning(x.position, "cannot run on final hardware");
  8396. END;
  8397. (* ----- DELEGATE ------*)
  8398. |Global.Delegate:
  8399. IF backend.cellsAreObjects THEN
  8400. PushPort(p0);
  8401. PushPort(p1);
  8402. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8403. ELSE
  8404. Warning(x.position, "cannot run on final hardware");
  8405. END;
  8406. (* ----- SEND ------*)
  8407. |Global.Send:
  8408. Evaluate(p0,s0);
  8409. Evaluate(p1,s1);
  8410. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8411. Emit(Push(position,s0.op));
  8412. Emit(Push(position,s1.op));
  8413. (*
  8414. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8415. *)
  8416. IF ~backend.cellsAreObjects THEN
  8417. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8418. END;
  8419. ReleaseOperand(s0);
  8420. ReleaseOperand(s1);
  8421. IF backend.cellsAreObjects THEN
  8422. CallThis(position,"ActiveCellsRuntime","Send",2);
  8423. ELSE
  8424. CallThis(position,ChannelModuleName,"Send",2);
  8425. END;
  8426. (* ----- RECEIVE ------*)
  8427. |Global.Receive:
  8428. Evaluate(p0,s0);
  8429. Emit(Push(position,s0.op));
  8430. Designate(p1,s1);
  8431. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8432. Emit(Push(position,s1.op));
  8433. IF p2 # NIL THEN
  8434. Designate(p2,s2);
  8435. Emit(Push(position,s2.op));
  8436. END;
  8437. (*
  8438. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8439. *)
  8440. IF ~backend.cellsAreObjects THEN
  8441. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8442. END;
  8443. ReleaseOperand(s0);
  8444. ReleaseOperand(s1);
  8445. ReleaseOperand(s2);
  8446. IF backend.cellsAreObjects THEN
  8447. IF p2 = NIL THEN
  8448. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8449. ELSE
  8450. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8451. END;
  8452. ELSE
  8453. IF p2 = NIL THEN
  8454. CallThis(position,ChannelModuleName,"Receive",2)
  8455. ELSE
  8456. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8457. END;
  8458. END;
  8459. | Global.systemSpecial:
  8460. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8461. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8462. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8463. (* determine if parameters are of the VAR kind *)
  8464. ASSERT(x.parameters.Length() <= 3);
  8465. formalParameter := procedureType.firstParameter;
  8466. FOR i := 0 TO x.parameters.Length() - 1 DO
  8467. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8468. formalParameter := formalParameter.nextParameter
  8469. END;
  8470. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8471. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8472. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8473. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8474. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8475. IF procedureType.returnType # NIL THEN
  8476. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8477. Emit(Result(position, res));
  8478. (*InitOperand(result,ModeValue);
  8479. result.op := res;
  8480. *)
  8481. IF ~conditional THEN
  8482. InitOperand(result,ModeValue); result.op := res;
  8483. ELSE
  8484. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8485. BrL(falseLabel);
  8486. ReleaseIntermediateOperand(res);
  8487. END;
  8488. END
  8489. ELSE (* function not yet implemented *)
  8490. Error(position,"not yet implemented");
  8491. END;
  8492. destination := dest;
  8493. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8494. END VisitBuiltinCallDesignator;
  8495. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8496. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8497. BEGIN
  8498. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8499. dest := destination; destination := emptyOperand;
  8500. Expression(x.left);
  8501. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8502. ELSIF isUnchecked THEN (* no check *)
  8503. ELSE
  8504. trueL := NewLabel();
  8505. falseL := NewLabel();
  8506. IF IsPointerToRecord(x.left.type,recordType) THEN
  8507. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8508. Emit(Mov(position,tag, result.op));
  8509. IF result.mode # ModeValue THEN
  8510. ptr := tag;
  8511. IntermediateCode.MakeMemory(ptr,addressType);
  8512. Emit(Mov(position,tag, ptr));
  8513. END;
  8514. IF ~backend.cooperative THEN
  8515. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8516. END;
  8517. IntermediateCode.MakeMemory(tag,addressType);
  8518. ELSE
  8519. tag := result.tag;
  8520. UseIntermediateOperand(tag);
  8521. END;
  8522. TypeTest(tag,x.type,trueL,falseL,FALSE);
  8523. ReleaseIntermediateOperand(tag);
  8524. SetLabel(falseL);
  8525. EmitTrap(position,TypeCheckTrap);
  8526. SetLabel(trueL);
  8527. END;
  8528. destination := dest;
  8529. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8530. END VisitTypeGuardDesignator;
  8531. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8532. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8533. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8534. VAR label: Label; pc: LONGINT;
  8535. BEGIN
  8536. IF backend.cooperative & ~isUnchecked THEN
  8537. pc := section.pc;
  8538. label := NewLabel();
  8539. BrneL(label, operand.op, nil);
  8540. EmitTrap(position, NilPointerTrap);
  8541. SetLabel(label);
  8542. INC(statCoopNilCheck, section.pc - pc);
  8543. END;
  8544. END NilCheck;
  8545. BEGIN
  8546. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8547. ReuseCopy(dereferenced,operand.op);
  8548. ReleaseOperand(operand);
  8549. operand.mode := ModeReference;
  8550. operand.op := dereferenced;
  8551. operand.tag := dereferenced;
  8552. UseIntermediateOperand(operand.tag);
  8553. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8554. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8555. ReleaseIntermediateOperand(operand.tag);
  8556. operand.tag := TypeDescriptorAdr(type);
  8557. ELSE
  8558. IF ~backend.cooperative THEN
  8559. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8560. END;
  8561. IntermediateCode.MakeMemory(operand.tag,addressType);
  8562. END;
  8563. NilCheck(operand.op);
  8564. ELSIF type IS SyntaxTree.ArrayType THEN
  8565. IF isUnsafe THEN
  8566. NilCheck(operand.op);
  8567. ReleaseIntermediateOperand(operand.tag);
  8568. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8569. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8570. ELSE
  8571. operand.tag := emptyOperand;
  8572. END;
  8573. ELSE
  8574. NilCheck(operand.op);
  8575. IF backend.cooperative THEN
  8576. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8577. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8578. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8579. ELSE
  8580. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8581. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8582. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8583. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8584. END;
  8585. END;
  8586. ELSIF type IS SyntaxTree.MathArrayType THEN
  8587. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8588. IntermediateCode.MakeMemory(operand.op,addressType);
  8589. ELSE HALT(100);
  8590. END;
  8591. END Dereference;
  8592. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8593. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8594. BEGIN
  8595. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8596. dest := destination; destination := emptyOperand;
  8597. Evaluate(x.left,d);
  8598. type := x.type.resolved;
  8599. prevIsUnchecked := isUnchecked;
  8600. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8601. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8602. END;
  8603. Dereference(d,type,IsUnsafePointer(x.left.type));
  8604. isUnchecked := prevIsUnchecked;
  8605. result := d;
  8606. 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
  8607. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8608. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8609. END;
  8610. END;
  8611. destination := dest;
  8612. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8613. END VisitDereferenceDesignator;
  8614. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8615. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8616. BEGIN
  8617. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8618. dest := destination; destination := emptyOperand;
  8619. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8620. tag := result.op;
  8621. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8622. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8623. StaticCallOperand(result,procedure.super);
  8624. ReleaseIntermediateOperand(result.tag);
  8625. UseIntermediateOperand(tag); (* necessary ? *)
  8626. result.tag := tag;
  8627. destination := dest;
  8628. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8629. END VisitSupercallDesignator;
  8630. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8631. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8632. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8633. name: Basic.SegmentedName;
  8634. procedure: SyntaxTree.Procedure;
  8635. procedureType: SyntaxTree.ProcedureType;
  8636. BEGIN
  8637. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8638. dest := destination; destination := emptyOperand;
  8639. scope := currentScope;
  8640. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8641. scope := scope.outerScope;
  8642. END;
  8643. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8644. moduleSection := meta.ModuleSection();
  8645. IF backend.cooperative THEN
  8646. moduleOffset := 0;
  8647. ELSE
  8648. moduleOffset := moduleSection.pc;
  8649. END;
  8650. result.mode := ModeValue;
  8651. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8652. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8653. result.mode := ModeValue;
  8654. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8655. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8656. ELSE
  8657. GetBaseRegister(basereg,currentScope,scope);
  8658. InitOperand(result,ModeReference);
  8659. result.op := basereg;
  8660. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8661. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8662. parametersSize := ProcParametersSize(procedure);
  8663. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8664. IF backend.cooperative THEN
  8665. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8666. END;
  8667. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8668. MakeMemory(result.op, result.op, addressType, 0);
  8669. END;
  8670. (* tag must be loaded when dereferencing SELF pointer *)
  8671. END;
  8672. destination := dest;
  8673. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8674. END VisitSelfDesignator;
  8675. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8676. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8677. BEGIN
  8678. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8679. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8680. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8681. parameter := procedureType.returnParameter;
  8682. IF currentIsInline THEN
  8683. map := currentMapper.Get(NIL);
  8684. IF map # NIL THEN
  8685. Designate(map.to, result);
  8686. ELSE
  8687. HALT(200);
  8688. END;
  8689. RETURN;
  8690. END;
  8691. VisitParameter(parameter);
  8692. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8693. END VisitResultDesignator;
  8694. (** values *)
  8695. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8696. BEGIN
  8697. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8698. IF conditional THEN
  8699. IF x.value THEN BrL(trueLabel)
  8700. ELSE BrL(falseLabel)
  8701. END;
  8702. ELSE
  8703. InitOperand(result,ModeValue);
  8704. IF x.value THEN result.op := true ELSE result.op := false END;
  8705. END;
  8706. END VisitBooleanValue;
  8707. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8708. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8709. BEGIN
  8710. Global.GetModuleSegmentedName(module.module, name);
  8711. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8712. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8713. RETURN section
  8714. END GetDataSection;
  8715. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8716. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8717. BEGIN
  8718. type := vop.type;
  8719. data := GetDataSection();
  8720. pc := EnterImmediate(data,vop);
  8721. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8722. IntermediateCode.MakeMemory(vop, type);
  8723. END GetImmediateMem;
  8724. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8725. BEGIN
  8726. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8727. InitOperand(result,ModeValue);
  8728. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8729. IF ~supportedImmediate(result.op) &~inData THEN
  8730. GetImmediateMem(result.op)
  8731. END;
  8732. END VisitIntegerValue;
  8733. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8734. BEGIN
  8735. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8736. InitOperand(result,ModeValue);
  8737. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8738. END VisitCharacterValue;
  8739. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8740. BEGIN
  8741. IF Trace THEN TraceEnter("VisitSetValue") END;
  8742. InitOperand(result,ModeValue);
  8743. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8744. END VisitSetValue;
  8745. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8746. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8747. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8748. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8749. BEGIN
  8750. numberElements := x.elements.Length();
  8751. FOR i := 0 TO numberElements-1 DO
  8752. expression := x.elements.GetExpression(i);
  8753. IF expression IS SyntaxTree.MathArrayExpression THEN
  8754. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8755. ELSE
  8756. inData := TRUE;
  8757. Evaluate(expression,op);
  8758. irv.Emit(Data(position,op.op));
  8759. inData := FALSE;
  8760. ReleaseOperand(op);
  8761. END;
  8762. END;
  8763. END RecursiveData;
  8764. BEGIN
  8765. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8766. IF ~TryConstantDeclaration() THEN
  8767. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8768. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8769. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8770. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8771. ELSE
  8772. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8773. END;
  8774. RecursiveData(x.array);
  8775. InitOperand(result,ModeReference);
  8776. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8777. END
  8778. END VisitMathArrayValue;
  8779. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8780. VAR constant: Sections.Section;
  8781. BEGIN
  8782. IF constantDeclaration = NIL THEN
  8783. RETURN FALSE
  8784. ELSE
  8785. (* Is a constant in this module: did we generate it already? *)
  8786. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8787. IF constant # NIL THEN
  8788. InitOperand(result,ModeReference);
  8789. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8790. RETURN TRUE;
  8791. END;
  8792. END;
  8793. RETURN FALSE
  8794. END TryConstantDeclaration;
  8795. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8796. BEGIN
  8797. constantDeclaration := x;
  8798. x.value.resolved.Accept(SELF);
  8799. END VisitConstant;
  8800. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8801. BEGIN
  8802. IF Trace THEN TraceEnter("VisitRealValue") END;
  8803. InitOperand(result,ModeValue);
  8804. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8805. END VisitRealValue;
  8806. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8807. VAR
  8808. componentType: SyntaxTree.Type;
  8809. BEGIN
  8810. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8811. ASSERT(x.type IS SyntaxTree.ComplexType);
  8812. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8813. InitOperand(result,ModeValue);
  8814. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8815. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8816. END VisitComplexValue;
  8817. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8818. VAR i: LONGINT; name: Basic.SegmentedName;
  8819. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8820. BEGIN
  8821. IF Trace THEN TraceEnter("VisitStringValue") END;
  8822. IF ~TryConstantDeclaration() THEN
  8823. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8824. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8825. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8826. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8827. ELSE
  8828. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8829. END;
  8830. FOR i := 0 TO x.length-1 DO
  8831. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8832. irv.Emit(Data(position,op));
  8833. END;
  8834. InitOperand(result,ModeReference);
  8835. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8836. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8837. END
  8838. END VisitStringValue;
  8839. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8840. BEGIN
  8841. IF Trace THEN TraceEnter("VisitNilValue") END;
  8842. InitOperand(result,ModeValue);
  8843. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8844. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8845. END VisitNilValue;
  8846. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8847. BEGIN
  8848. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8849. InitOperand(result,ModeValue);
  8850. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8851. END VisitEnumerationValue;
  8852. (** symbols *)
  8853. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8854. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8855. END VisitImport;
  8856. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8857. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8858. BEGIN
  8859. IF scope # baseScope THEN
  8860. (* left := [fp+8] *)
  8861. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8862. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8863. ReuseCopy(left,right);
  8864. ReleaseIntermediateOperand(right);
  8865. scope := scope.outerScope; DEC(level);
  8866. (* { left := [left+8] } *)
  8867. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8868. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8869. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8870. Emit(Mov(position,left,right));
  8871. scope := scope.outerScope; DEC(level);
  8872. END;
  8873. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8874. result := left;
  8875. ELSE
  8876. result := fp;
  8877. END;
  8878. END GetBaseRegister;
  8879. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8880. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8881. BEGIN
  8882. IF Trace THEN TraceEnter("VisitVariable"); END;
  8883. type := x.type.resolved;
  8884. IF (x.useRegister) THEN
  8885. InitOperand(result, ModeValue);
  8886. IF x.registerNumber < 0 THEN
  8887. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8888. reg := x.registerNumber;
  8889. ELSE
  8890. reg := registerUsageCount.Map(x.registerNumber);
  8891. UseRegister(reg);
  8892. END;
  8893. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8894. ELSIF x.externalName # NIL THEN
  8895. InitOperand(result,ModeReference);
  8896. Basic.ToSegmentedName(x.externalName^, name);
  8897. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8898. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8899. InitOperand(result,ModeReference);
  8900. GetBaseRegister(result.op,currentScope,x.scope);
  8901. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8902. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8903. InitOperand(result,ModeReference);
  8904. GetCodeSectionNameForSymbol(x,name);
  8905. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8906. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8907. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8908. InitOperand(result,ModeReference);
  8909. GetCodeSectionNameForSymbol(x,name);
  8910. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8911. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8912. ELSE (* field, left designator must have been emitted *)
  8913. ASSERT(result.mode = ModeReference);
  8914. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8915. ReuseCopy(temp,result.op);
  8916. ReleaseIntermediateOperand(result.op);
  8917. result.op := temp;
  8918. END;
  8919. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8920. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8921. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8922. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8923. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8924. END;
  8925. END;
  8926. END;
  8927. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8928. ValueToCondition(result);
  8929. ELSIF type IS SyntaxTree.ProcedureType THEN
  8930. ReleaseIntermediateOperand(result.tag);
  8931. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8932. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8933. UseIntermediateOperand(result.tag);
  8934. ELSE
  8935. result.tag := nil; (* nil *)
  8936. END;
  8937. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8938. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8939. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8940. ReleaseIntermediateOperand(result.tag);
  8941. Global.GetSymbolSegmentedName(x,name);
  8942. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8943. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8944. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8945. ELSE
  8946. END;
  8947. ELSE
  8948. ReleaseIntermediateOperand(result.tag);
  8949. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8950. END;
  8951. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8952. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8953. ReleaseIntermediateOperand(result.tag);
  8954. result.tag := result.op;
  8955. UseIntermediateOperand(result.tag);
  8956. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8957. IntermediateCode.MakeMemory(result.op,addressType);
  8958. END;
  8959. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8960. ReleaseIntermediateOperand(result.tag);
  8961. result.tag := TypeDescriptorAdr(type);
  8962. UseIntermediateOperand(result.tag);
  8963. (* tag for pointer type computed not here but during dereferencing *)
  8964. END;
  8965. IF Trace THEN TraceExit("VisitVariable") END;
  8966. END VisitVariable;
  8967. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8968. BEGIN
  8969. VisitVariable(property);
  8970. END VisitProperty;
  8971. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8972. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8973. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8974. BEGIN
  8975. type := x.type.resolved;
  8976. IF Trace THEN TraceEnter("VisitParameter") END;
  8977. IF x.ownerType IS SyntaxTree.CellType THEN
  8978. ptype := x.type.resolved;
  8979. IF backend.cellsAreObjects THEN
  8980. ASSERT(result.mode = ModeReference);
  8981. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8982. ReuseCopy(temp,result.op);
  8983. ReleaseIntermediateOperand(result.op);
  8984. result.op := temp;
  8985. END;
  8986. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8987. RETURN;
  8988. ELSE
  8989. InitOperand(result,ModeReference);
  8990. GetCodeSectionNameForSymbol(x,name);
  8991. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8992. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8993. RETURN;
  8994. END;
  8995. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8996. InitOperand(result,ModeReference);
  8997. GetCodeSectionNameForSymbol(x,name);
  8998. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8999. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9000. RETURN
  9001. ELSE
  9002. GetBaseRegister(basereg,currentScope,x.scope);
  9003. InitOperand(result,ModeReference);
  9004. result.op := basereg;
  9005. END;
  9006. IF IsOpenArray(type) THEN
  9007. result.tag := basereg;
  9008. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9009. IntermediateCode.MakeMemory(result.op,addressType);
  9010. IF Global.IsOberonProcedure(x.ownerType) THEN
  9011. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  9012. UseIntermediateOperand(result.tag);
  9013. ELSE
  9014. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  9015. END;
  9016. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  9017. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9018. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9019. ELSIF IsStaticArray(type) THEN
  9020. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9021. IntermediateCode.MakeMemory(result.op,addressType);
  9022. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9023. ELSIF type IS SyntaxTree.MathArrayType THEN
  9024. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9025. WITH type: SyntaxTree.MathArrayType DO
  9026. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9027. IF type.form = SyntaxTree.Tensor THEN
  9028. ELSIF type.form = SyntaxTree.Open THEN
  9029. result.tag := result.op;
  9030. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9031. IntermediateCode.MakeMemory(result.op,addressType);
  9032. UseIntermediateOperand(result.tag);
  9033. ELSIF type.form = SyntaxTree.Static THEN
  9034. IF x.kind = SyntaxTree.ConstParameter THEN
  9035. IntermediateCode.MakeMemory(result.op,addressType);
  9036. END;
  9037. ELSE HALT(100)
  9038. END;
  9039. ELSIF x.kind = SyntaxTree.VarParameter THEN
  9040. IF type.form = SyntaxTree.Tensor THEN
  9041. ToMemory(result.op,addressType,0);
  9042. ELSIF type.form = SyntaxTree.Open THEN
  9043. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9044. ReuseCopy(result.tag, mem);
  9045. ReleaseIntermediateOperand(mem);
  9046. ReleaseIntermediateOperand(result.op);
  9047. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9048. ELSIF type.form = SyntaxTree.Static THEN
  9049. IntermediateCode.MakeMemory(result.op,addressType);
  9050. ELSE HALT(100)
  9051. END;
  9052. ELSE HALT(100)
  9053. END;
  9054. END;
  9055. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9056. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9057. IntermediateCode.MakeMemory(result.op,addressType);
  9058. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9059. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9060. END;
  9061. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  9062. ValueToCondition(result);
  9063. ELSIF type IS SyntaxTree.ProcedureType THEN
  9064. ReleaseIntermediateOperand(result.tag);
  9065. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9066. IF x.kind = SyntaxTree.VarParameter THEN
  9067. ReuseCopy(result.tag,result.op);
  9068. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9069. IntermediateCode.MakeMemory(result.tag,addressType);
  9070. ELSE
  9071. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9072. UseIntermediateOperand(result.tag);
  9073. END;
  9074. ELSE
  9075. result.tag := nil;
  9076. END;
  9077. (* tag for pointer type computed not here but during dereferencing *)
  9078. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  9079. ReleaseIntermediateOperand(result.tag);
  9080. result.tag := basereg;
  9081. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9082. IntermediateCode.MakeMemory(result.tag,addressType);
  9083. UseIntermediateOperand(result.tag);
  9084. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9085. ReleaseIntermediateOperand(result.tag);
  9086. result.tag := TypeDescriptorAdr(type);
  9087. UseIntermediateOperand(result.tag);
  9088. END;
  9089. IF Trace THEN TraceExit("VisitParameter") END;
  9090. END VisitParameter;
  9091. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9092. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9093. BEGIN
  9094. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9095. (* left.p: left already emitted *)
  9096. tag := result.op; (* value of pointer to left *)
  9097. (* get type desc *)
  9098. tmp := result.tag;
  9099. IntermediateCode.MakeMemory(tmp,addressType);
  9100. (* get method adr *)
  9101. Reuse1(reg,tmp);
  9102. ReleaseIntermediateOperand(tmp);
  9103. IF backend.cooperative THEN
  9104. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9105. WHILE recordType.baseType # NIL DO
  9106. recordType := recordType.GetBaseRecord ();
  9107. END;
  9108. GetRecordTypeName (recordType,name);
  9109. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9110. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9111. offset := 0;
  9112. ELSE
  9113. offset := 2;
  9114. END;
  9115. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9116. ELSIF meta.simple THEN
  9117. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9118. ELSE
  9119. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9120. END;
  9121. InitOperand(operand,ModeReference);
  9122. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9123. operand.op := reg;
  9124. operand.tag := tag;
  9125. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9126. END DynamicCallOperand;
  9127. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9128. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9129. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9130. BEGIN
  9131. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9132. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9133. tag := operand.op;
  9134. ReleaseIntermediateOperand(operand.tag);
  9135. ELSE tag := nil
  9136. END;
  9137. IF x.isInline THEN
  9138. sectionType := Sections.InlineCodeSection;
  9139. ELSE
  9140. sectionType := Sections.CodeSection;
  9141. END;
  9142. IF x.externalName # NIL THEN
  9143. Basic.ToSegmentedName(x.externalName^, name);
  9144. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9145. ELSE
  9146. GetCodeSectionNameForSymbol(x, name);
  9147. IF (x.scope.ownerModule = module.module) THEN
  9148. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9149. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9150. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9151. IF source.pc = 0 THEN (* no code yet *)
  9152. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9153. END;
  9154. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9155. bits := x.procedureScope.body.code.inlineCode;
  9156. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9157. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9158. binary.CopyBits(bits, 0, bits.GetSize());
  9159. source.SetResolved(binary);
  9160. ELSE
  9161. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9162. END;
  9163. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9164. END;
  9165. InitOperand(operand,ModeValue);
  9166. operand.op := reg;
  9167. operand.tag := tag;
  9168. IF Trace THEN TraceExit("StaticCallOperand") END;
  9169. END StaticCallOperand;
  9170. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9171. (* handle expressions of the form designator.procedure or procedure *)
  9172. BEGIN
  9173. IF Trace THEN TraceEnter("VisitProcedure") END;
  9174. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9175. DynamicCallOperand(result,x);
  9176. ELSIF x.isInline THEN
  9177. StaticCallOperand(result,x);
  9178. ELSE
  9179. StaticCallOperand(result,x);
  9180. END;
  9181. IF Trace THEN TraceExit("VisitProcedure") END;
  9182. END VisitProcedure;
  9183. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9184. BEGIN
  9185. VisitProcedure(x);
  9186. END VisitOperator;
  9187. (** statements *)
  9188. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9189. BEGIN
  9190. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9191. Expression(x.call);
  9192. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9193. ReleaseOperand(result)
  9194. END;
  9195. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9196. END VisitProcedureCallStatement;
  9197. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9198. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9199. leftBase, rightBase: SyntaxTree.Type;
  9200. procedureName,s: SyntaxTree.IdentifierString;
  9201. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9202. size: LONGINT; rightKind: LONGINT;
  9203. dummy: IntermediateCode.Operand;
  9204. CONST moduleName = "FoxArrayBase";
  9205. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9206. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9207. BEGIN
  9208. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9209. IF base IS SyntaxTree.MathArrayType THEN
  9210. base := OpenArray(base(SyntaxTree.MathArrayType));
  9211. END;
  9212. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9213. result.SetArrayBase(base);
  9214. RETURN result
  9215. END OpenArray;
  9216. BEGIN
  9217. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9218. SaveRegisters();ReleaseUsedRegisters(saved);
  9219. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9220. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9221. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9222. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9223. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9224. IF leftType.form = SyntaxTree.Tensor THEN
  9225. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9226. ELSIF leftType.form = SyntaxTree.Open THEN
  9227. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9228. ELSIF leftType.form = SyntaxTree.Static THEN
  9229. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9230. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9231. END;
  9232. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9233. IF procedure = NIL THEN
  9234. s := "Instruction not supported on target, emulation procedure ";
  9235. Strings.Append(s,moduleName);
  9236. Strings.Append(s,".");
  9237. Strings.Append(s,procedureName);
  9238. Strings.Append(s," not present");
  9239. Error(position,s);
  9240. ELSE
  9241. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9242. parameter.SetType(leftType);
  9243. parameter.SetAccess(SyntaxTree.Internal);
  9244. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9245. parameter.SetKind(rightKind);
  9246. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9247. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9248. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9249. StaticCallOperand(result,procedure);
  9250. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9251. ReleaseOperand(result);
  9252. END;
  9253. RestoreRegisters(saved);
  9254. END;
  9255. END AssignMathArray;
  9256. VAR modifyAssignmentCounter := 0: LONGINT;
  9257. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9258. VAR processor,mem,dst: IntermediateCode.Operand;
  9259. BEGIN
  9260. IF value.intValue = true.intValue THEN
  9261. INC(modifyAssignmentCounter);
  9262. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9263. modifyAssignmentsPC := section.pc;
  9264. ELSE
  9265. DEC(modifyAssignmentCounter);
  9266. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9267. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9268. END;
  9269. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9270. dst := NewRegisterOperand (addressType);
  9271. Emit(Mov(position,dst, processor));
  9272. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9273. Emit(Mov(position,mem, value));
  9274. ReleaseIntermediateOperand(dst);
  9275. END ModifyAssignments;
  9276. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9277. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9278. BEGIN
  9279. type := left.type.resolved;
  9280. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9281. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9282. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9283. IF procedureType.returnParameter = parameter THEN
  9284. (* this is the only case where the destination can be dynamically smaller than the source
  9285. in all other cases the dynamic size has to be taken
  9286. *)
  9287. IF backend.cooperative THEN
  9288. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9289. ELSE
  9290. MakeMemory(mem, tag, addressType, 0);
  9291. END;
  9292. RETURN mem;
  9293. END;
  9294. END;
  9295. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9296. END CopySize;
  9297. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9298. VAR
  9299. leftO, rightO: Operand;
  9300. arg,mem, sizeOp: IntermediateCode.Operand;
  9301. leftType, rightType, componentType, base: SyntaxTree.Type;
  9302. size: LONGINT;
  9303. parameters: SyntaxTree.ExpressionList;
  9304. procedure: SyntaxTree.Procedure;
  9305. call: SyntaxTree.ProcedureCallDesignator;
  9306. designator: SyntaxTree.Designator;
  9307. saved: RegisterEntry;
  9308. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9309. VAR procedureType: SyntaxTree.ProcedureType;
  9310. BEGIN
  9311. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9312. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9313. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9314. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9315. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9316. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9317. IF right.id = Global.Reshape THEN RETURN TRUE
  9318. END;
  9319. END;
  9320. END;
  9321. END;
  9322. RETURN FALSE
  9323. END CanPassAsResultParameter;
  9324. BEGIN
  9325. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9326. leftType := left.type.resolved; rightType:= right.type.resolved;
  9327. IF backend.cooperative & left.NeedsTrace() THEN
  9328. ModifyAssignments(true);
  9329. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9330. Designate(right, rightO);
  9331. Designate(left, leftO);
  9332. ASSERT(leftO.mode = ModeReference);
  9333. TransferToRegister(leftO.op, leftO.op);
  9334. TransferToRegister(rightO.op, rightO.op);
  9335. Emit(Push(position, leftO.op));
  9336. Emit(Push(position, rightO.op));
  9337. CallAssignMethod(leftO.op, rightO.op, left.type);
  9338. Emit(Pop(position, rightO.op));
  9339. Emit(Pop(position, leftO.op));
  9340. sizeOp := CopySize(left, leftO.tag);
  9341. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9342. ReleaseIntermediateOperand(sizeOp);
  9343. ReleaseOperand(leftO);
  9344. ReleaseOperand(rightO);
  9345. ELSE
  9346. Evaluate(right,rightO);
  9347. Designate(left,leftO);
  9348. ASSERT(leftO.mode = ModeReference);
  9349. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9350. (* copy procedure address first *)
  9351. MakeMemory(mem,leftO.op,addressType,0);
  9352. Emit(Mov(position,mem,rightO.op));
  9353. ReleaseIntermediateOperand(mem);
  9354. (* copy pointer address *)
  9355. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9356. CallAssignPointer(leftO.tag, rightO.tag);
  9357. ELSE
  9358. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9359. CallAssignPointer(leftO.op, rightO.op);
  9360. END;
  9361. ReleaseOperand(leftO);
  9362. ReleaseOperand(rightO);
  9363. END;
  9364. ModifyAssignments(false);
  9365. RETURN;
  9366. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9367. SaveRegisters();ReleaseUsedRegisters(saved);
  9368. IF SemanticChecker.IsPointerType(leftType) THEN
  9369. Evaluate(right,rightO);
  9370. Designate(left,leftO);
  9371. Emit(Push(position,leftO.op));
  9372. ReleaseOperand(leftO);
  9373. Emit(Push(position,rightO.op));
  9374. ReleaseOperand(rightO);
  9375. CallThis(position,"Heaps","Assign",2);
  9376. ELSIF leftType.IsRecordType() THEN
  9377. Designate(right,rightO);
  9378. Designate(left,leftO);
  9379. Emit(Push(position,leftO.op));
  9380. Emit(Push(position,leftO.tag)); (* type desc *)
  9381. ReleaseOperand(leftO);
  9382. Emit(Push(position,rightO.op));
  9383. ReleaseOperand(rightO);
  9384. CallThis(position,"Heaps","AssignRecord",3);
  9385. ELSIF IsStaticArray(leftType) THEN
  9386. size := StaticArrayNumElements(leftType);
  9387. base := StaticArrayBaseType(leftType);
  9388. Designate(right,rightO);
  9389. Designate(left,leftO);
  9390. Emit(Push(position,leftO.op));
  9391. ReleaseOperand(leftO);
  9392. arg := TypeDescriptorAdr(base);
  9393. Emit(Push(position,arg));
  9394. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9395. Emit(Push(position,rightO.op));
  9396. ReleaseOperand(rightO);
  9397. CallThis(position,"Heaps","AssignArray",4);
  9398. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9399. size := StaticMathArrayNumElements(leftType);
  9400. base := StaticMathArrayBaseType(leftType);
  9401. Designate(right,rightO);
  9402. Designate(left,leftO);
  9403. Emit(Push(position,leftO.op));
  9404. ReleaseOperand(leftO);
  9405. arg := TypeDescriptorAdr(base);
  9406. Emit(Push(position,arg));
  9407. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9408. Emit(Push(position,rightO.op));
  9409. ReleaseOperand(rightO);
  9410. CallThis(position,"Heaps","AssignArray",4);
  9411. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9412. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9413. Evaluate(right,rightO);
  9414. Designate(left,leftO);
  9415. MakeMemory(mem,leftO.op,addressType,0);
  9416. Emit(Mov(position,mem,rightO.op));
  9417. ReleaseIntermediateOperand(mem);
  9418. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9419. Emit (Push(position, leftO.tag));
  9420. ReleaseOperand(leftO);
  9421. Emit (Push(position, rightO.tag));
  9422. ReleaseOperand(rightO);
  9423. CallThis(position,"Heaps","Assign", 2);
  9424. ELSE HALT(100); (* missing ? *)
  9425. END;
  9426. RestoreRegisters(saved);
  9427. RETURN;
  9428. END;
  9429. IF CanPassAsResultParameter(right) THEN
  9430. procedureResultDesignator := left(SyntaxTree.Designator);
  9431. Expression(right);
  9432. procedureResultDesignator := NIL;
  9433. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9434. (* left <-- ALIAS OF right: zerocopy *)
  9435. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9436. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9437. designator.SetType(procedure.type);
  9438. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9439. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9440. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9441. END;
  9442. ELSIF leftType IS SyntaxTree.RangeType THEN
  9443. (* LHS is of array range type *)
  9444. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9445. Evaluate(right, rightO);
  9446. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9447. (* first *)
  9448. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9449. Emit(Mov(position,mem, rightO.op));
  9450. ReleaseIntermediateOperand(mem);
  9451. (* last *)
  9452. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9453. Emit(Mov(position,mem, rightO.tag));
  9454. ReleaseIntermediateOperand(mem);
  9455. (* step *)
  9456. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9457. Emit(Mov(position,mem, rightO.extra));
  9458. ReleaseIntermediateOperand(mem);
  9459. ReleaseOperand(rightO);
  9460. ReleaseOperand(leftO)
  9461. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9462. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9463. Evaluate(right, rightO);
  9464. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9465. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9466. (* real part *)
  9467. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9468. Emit(Mov(position,mem, rightO.op));
  9469. ReleaseIntermediateOperand(mem);
  9470. (* imaginary part *)
  9471. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9472. Emit(Mov(position,mem, rightO.tag));
  9473. ReleaseIntermediateOperand(mem);
  9474. ReleaseOperand(rightO);
  9475. ReleaseOperand(leftO)
  9476. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9477. OR (leftType IS SyntaxTree.PortType) THEN
  9478. (* rightO := leftO;*)
  9479. Evaluate(right,rightO);
  9480. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9481. Designate(left,leftO);
  9482. IF leftO.mode = ModeReference THEN
  9483. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9484. destination := mem;
  9485. ELSE
  9486. destination := leftO.op;
  9487. END;
  9488. ReleaseOperand(leftO);
  9489. IF destination.mode # IntermediateCode.Undefined THEN
  9490. Emit(Mov(position,destination,rightO.op));
  9491. END;
  9492. ReleaseOperand(rightO);
  9493. ReleaseIntermediateOperand(mem);
  9494. IntermediateCode.InitOperand(destination);
  9495. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9496. Evaluate(right,rightO);
  9497. Designate(left,leftO);
  9498. MakeMemory(mem,leftO.op,addressType,0);
  9499. Emit(Mov(position,mem,rightO.op));
  9500. ReleaseIntermediateOperand(mem);
  9501. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9502. (* delegate *)
  9503. (*
  9504. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9505. *)
  9506. Emit(Mov(position,leftO.tag,rightO.tag));
  9507. END;
  9508. ReleaseOperand(leftO);
  9509. ReleaseOperand(rightO);
  9510. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9511. Designate(right,rightO);
  9512. Designate(left,leftO);
  9513. sizeOp := CopySize(left, leftO.tag);
  9514. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9515. ReleaseIntermediateOperand(sizeOp);
  9516. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9517. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9518. IF (rightType IS SyntaxTree.StringType) THEN
  9519. CopyString(left,right);
  9520. 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
  9521. Designate(right,rightO);
  9522. Designate(left,leftO);
  9523. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9524. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9525. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9526. ELSE
  9527. HALT(201)
  9528. END;
  9529. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9530. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9531. Designate(right,rightO);
  9532. Designate(left,leftO);
  9533. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9534. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  9535. MakeMemory(mem, rightO.op, leftO.op.type,0);
  9536. Emit(Mov(position, leftO.op, mem));
  9537. ReleaseIntermediateOperand(mem);
  9538. ELSE
  9539. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9540. END;
  9541. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9542. ELSE
  9543. AssignMathArray(left,right);
  9544. END;
  9545. ELSE
  9546. HALT(200);
  9547. END;
  9548. END Assign;
  9549. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9550. BEGIN
  9551. IF Trace THEN TraceEnter("VisitAssignment") END;
  9552. Assign(x.left,x.right);
  9553. IF Trace THEN TraceExit("VisitAssignment") END;
  9554. END VisitAssignment;
  9555. PROCEDURE EmitCooperativeSwitch;
  9556. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9557. BEGIN
  9558. ASSERT (cooperativeSwitches);
  9559. pc := section.pc;
  9560. IF lastSwitchPC = section.pc THEN RETURN END;
  9561. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9562. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9563. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9564. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9565. INC(statCoopSwitch, section.pc - pc);
  9566. END EmitCooperativeSwitch;
  9567. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9568. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9569. BEGIN
  9570. p0 := communication.left; p1 := communication.right;
  9571. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9572. Evaluate(p0,s0);
  9573. Evaluate(p1,s1);
  9574. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9575. Emit(Push(position,s0.op));
  9576. Emit(Push(position,s1.op));
  9577. (*
  9578. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9579. *)
  9580. IF ~backend.cellsAreObjects THEN
  9581. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9582. END;
  9583. ReleaseOperand(s0);
  9584. ReleaseOperand(s1);
  9585. IF backend.cellsAreObjects THEN
  9586. CallThis(position,"ActiveCellsRuntime","Send",2);
  9587. ELSE
  9588. CallThis(position,ChannelModuleName,"Send",2);
  9589. END;
  9590. (* ----- RECEIVE ------*)
  9591. ELSE
  9592. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9593. tmp := p0; p0 := p1; p1 := tmp;
  9594. END;
  9595. Evaluate(p0,s0);
  9596. Emit(Push(position,s0.op));
  9597. Designate(p1,s1);
  9598. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9599. Emit(Push(position,s1.op));
  9600. (*
  9601. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9602. *)
  9603. IF ~backend.cellsAreObjects THEN
  9604. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9605. END;
  9606. ReleaseOperand(s0);
  9607. ReleaseOperand(s1);
  9608. IF backend.cellsAreObjects THEN
  9609. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9610. ELSE
  9611. CallThis(position,ChannelModuleName,"Receive",2)
  9612. END;
  9613. END;
  9614. END VisitCommunicationStatement;
  9615. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9616. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9617. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9618. VAR true, false: Label; condition, value: BOOLEAN;
  9619. BEGIN
  9620. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9621. IF condition THEN
  9622. true := NewLabel();
  9623. false := NewLabel();
  9624. Condition(if.condition,true,false);
  9625. SetLabel(true);
  9626. StatementSequence(if.statements);
  9627. BrL(end);
  9628. SetLabel(false);
  9629. ELSE
  9630. IF value THEN (* always true *)
  9631. escape := TRUE;
  9632. StatementSequence(if.statements);
  9633. (* no branch necessary -- rest skipped *)
  9634. END;
  9635. END;
  9636. END IfPart;
  9637. BEGIN
  9638. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9639. end := NewLabel();
  9640. elsifs := x.ElsifParts();
  9641. IfPart(x.ifPart);
  9642. FOR i := 0 TO elsifs-1 DO
  9643. IF ~escape THEN
  9644. elsif := x.GetElsifPart(i);
  9645. IfPart(elsif);
  9646. END;
  9647. END;
  9648. IF (x.elsePart # NIL) & ~escape THEN
  9649. StatementSequence(x.elsePart);
  9650. END;
  9651. SetLabel(end);
  9652. IF Trace THEN TraceExit("VisitIfStatement") END;
  9653. END VisitIfStatement;
  9654. PROCEDURE BrWithPart(CONST tag: IntermediateCode.Operand; x: SyntaxTree.WithPart; VAR trueL: Label);
  9655. BEGIN
  9656. trueL := NewLabel();
  9657. TypeTest(tag, x.type, trueL, NIL,TRUE);
  9658. END BrWithPart;
  9659. PROCEDURE EmitWithPart(x: SyntaxTree.WithPart);
  9660. BEGIN
  9661. StatementSequence(x.statements);
  9662. END EmitWithPart;
  9663. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9664. VAR endL,elseL: Label;i: LONGINT; trueL: POINTER TO ARRAY OF Label; res: Operand; recordType: SyntaxTree.RecordType;
  9665. tag: IntermediateCode.Operand;
  9666. BEGIN
  9667. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9668. endL := NewLabel();
  9669. elseL := NewLabel();
  9670. Designate(x.variable,res);
  9671. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9672. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9673. END;
  9674. ReuseCopy(tag, res.tag);
  9675. ReleaseOperand(res);
  9676. NEW(trueL, x.WithParts());
  9677. FOR i := 0 TO x.WithParts()-1 DO
  9678. BrWithPart(tag, x.GetWithPart(i), trueL[i]);
  9679. END;
  9680. ReleaseIntermediateOperand(tag);
  9681. BrL(elseL);
  9682. FOR i := 0 TO x.WithParts()-1 DO
  9683. SetLabel(trueL[i]);
  9684. EmitWithPart(x.GetWithPart(i));
  9685. BrL(endL);
  9686. END;
  9687. SetLabel(elseL);
  9688. IF x.elsePart = NIL THEN
  9689. IF ~isUnchecked THEN
  9690. EmitTrap(position,WithTrap);
  9691. END;
  9692. ELSE
  9693. StatementSequence(x.elsePart)
  9694. END;
  9695. SetLabel(endL);
  9696. IF Trace THEN TraceExit("VisitWithStatement") END;
  9697. END VisitWithStatement;
  9698. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9699. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9700. out,else: Label; label: Label;
  9701. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9702. symbol: SyntaxTree.Symbol;
  9703. table: BOOLEAN;
  9704. BEGIN
  9705. (*! split case statement into if-elsif statements for large case label lists *)
  9706. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9707. range := x.max-x.min+1;
  9708. IF (range < 0) OR (range > 1024) & (range DIV x.caseParts.Length() >10) THEN
  9709. (* if case table is larger than 1024 elements and only sparsely used, then do not employ a table *)
  9710. table := FALSE;
  9711. size := x.caseParts.Length();
  9712. ELSE
  9713. table := TRUE;
  9714. size := LONGINT(range);
  9715. END;
  9716. Evaluate(x.variable,var);
  9717. ReuseCopy(tmp,var.op);
  9718. ReleaseIntermediateOperand(var.op);
  9719. var.op := tmp;
  9720. (*
  9721. UniqueId(name,module.module,"case",caseId);
  9722. *)
  9723. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9724. else := NewLabel();
  9725. IF table THEN
  9726. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9727. Convert(var.op,addressType);
  9728. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9729. ReuseCopy(res,var.op);
  9730. ReleaseOperand(var);
  9731. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9732. Global.GetModuleSegmentedName(module.module, name);
  9733. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9734. symbol := SyntaxTree.NewSymbol(name[1]);
  9735. symbol.SetScope(moduleScope);
  9736. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9737. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9738. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9739. Emit(Add(position,res,res,jmp));
  9740. IntermediateCode.MakeMemory(res,addressType);
  9741. Emit(Br(position,res));
  9742. ReleaseIntermediateOperand(res);
  9743. ELSE
  9744. ReuseCopy(res,var.op); (* make sure it is in a register *)
  9745. ReleaseOperand(var);
  9746. BrltL(else,res,IntermediateCode.Immediate(res.type,x.min));
  9747. BrltL(else,IntermediateCode.Immediate(res.type,x.max),res);
  9748. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9749. part := x.GetCasePart(i);
  9750. constant := part.firstConstant;
  9751. fixups[i] := NewLabel();
  9752. WHILE(constant # NIL) DO (* case labels for this case part *)
  9753. IF constant.min = constant.max THEN
  9754. BreqL(fixups[i], res,IntermediateCode.Immediate(res.type,constant.min));
  9755. ELSE
  9756. label := NewLabel();
  9757. BrltL(label, res, IntermediateCode.Immediate(res.type,constant.min));
  9758. BrltL(label, IntermediateCode.Immediate(res.type,constant.max),res);
  9759. BrL(fixups[i]);
  9760. SetLabel(label);
  9761. END;
  9762. constant := constant.next;
  9763. END;
  9764. END;
  9765. BrL(else);
  9766. ReleaseIntermediateOperand(res);
  9767. END;
  9768. out := NewLabel();
  9769. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9770. part := x.GetCasePart(i);
  9771. constant := part.firstConstant;
  9772. IF table THEN
  9773. label := NewLabel();
  9774. SetLabel(label);
  9775. WHILE(constant # NIL) DO (* case labels for this case part *)
  9776. FOR j := constant.min TO constant.max DO
  9777. fixups[j-x.min] := label;
  9778. END;
  9779. constant := constant.next;
  9780. END;
  9781. ELSE
  9782. SetLabel(fixups[i]);
  9783. END;
  9784. StatementSequence(part.statements);
  9785. BrL(out);
  9786. END;
  9787. SetLabel(else);
  9788. FOR i := 0 TO size-1 DO
  9789. IF fixups[i] = NIL THEN
  9790. fixups[i] := else;
  9791. END;
  9792. END;
  9793. IF x.elsePart # NIL THEN
  9794. StatementSequence(x.elsePart);
  9795. ELSIF ~isUnchecked THEN
  9796. EmitTrap(position,CaseTrap);
  9797. END;
  9798. SetLabel(out);
  9799. IF table THEN
  9800. FOR i := 0 TO size-1 DO
  9801. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9802. section.Emit(Data(position,op));
  9803. END;
  9804. END;
  9805. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9806. END VisitCaseStatement;
  9807. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9808. VAR start: Label; true,false: Label;
  9809. BEGIN
  9810. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9811. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9812. start := NewLabel();
  9813. true := NewLabel();
  9814. false := NewLabel();
  9815. SetLabel(start);
  9816. Condition(x.condition,true,false);
  9817. SetLabel(true);
  9818. StatementSequence(x.statements);
  9819. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9820. BrL(start);
  9821. SetLabel(false);
  9822. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9823. END VisitWhileStatement;
  9824. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9825. VAR false,true: Label;
  9826. BEGIN
  9827. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9828. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9829. true := NewLabel();
  9830. false := NewLabel();
  9831. SetLabel(false);
  9832. StatementSequence(x.statements);
  9833. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9834. Condition(x.condition,true,false);
  9835. SetLabel(true);
  9836. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9837. END VisitRepeatStatement;
  9838. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9839. VAR
  9840. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9841. temporaryVariable: SyntaxTree.Variable;
  9842. temporaryVariableDesignator : SyntaxTree.Designator;
  9843. BEGIN
  9844. IF Trace THEN TraceEnter("VisitForStatement") END;
  9845. true := NewLabel();
  9846. false := NewLabel();
  9847. start := NewLabel();
  9848. Assign(x.variable,x.from);
  9849. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9850. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9851. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9852. Assign(temporaryVariableDesignator,x.to);
  9853. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9854. IF by > 0 THEN
  9855. cmp := Scanner.LessEqual
  9856. ELSE
  9857. cmp := Scanner.GreaterEqual
  9858. END;
  9859. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9860. binary.SetType(system.booleanType);
  9861. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9862. SetLabel(start);
  9863. Condition(binary,true,false);
  9864. SetLabel(true);
  9865. StatementSequence(x.statements);
  9866. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9867. binary.SetType(x.variable.type);
  9868. Assign(x.variable,binary);
  9869. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9870. BrL(start);
  9871. SetLabel(false);
  9872. IF Trace THEN TraceExit("VisitForStatement") END;
  9873. END VisitForStatement;
  9874. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9875. VAR prevLoop: Label;
  9876. BEGIN
  9877. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9878. prevLoop := currentLoop;
  9879. currentLoop := NewLabel();
  9880. StatementSequence(x.statements);
  9881. SetLabel(currentLoop);
  9882. currentLoop := prevLoop;
  9883. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9884. END VisitExitableBlock;
  9885. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9886. VAR prevLoop,start: Label;
  9887. BEGIN
  9888. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9889. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9890. start := NewLabel();
  9891. prevLoop := currentLoop;
  9892. SetLabel(start);
  9893. currentLoop := NewLabel();
  9894. StatementSequence(x.statements);
  9895. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9896. BrL(start);
  9897. SetLabel(currentLoop);
  9898. currentLoop := prevLoop;
  9899. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9900. END VisitLoopStatement;
  9901. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9902. VAR outer: SyntaxTree.Statement;
  9903. BEGIN
  9904. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9905. IF locked THEN (* r if we jump out of an exclusive block *)
  9906. outer := x.outer;
  9907. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9908. outer := outer.outer;
  9909. END;
  9910. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9911. Lock(FALSE);
  9912. END;
  9913. END;
  9914. BrL(currentLoop);
  9915. IF Trace THEN TraceExit("VisitExitStatement") END;
  9916. END VisitExitStatement;
  9917. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9918. VAR
  9919. expression, parameterDesignator: SyntaxTree.Expression;
  9920. type, componentType: SyntaxTree.Type;
  9921. res, right: Operand;
  9922. left, mem, reg: IntermediateCode.Operand;
  9923. parameter: SyntaxTree.Parameter;
  9924. procedure: SyntaxTree.Procedure;
  9925. procedureType: SyntaxTree.ProcedureType;
  9926. returnTypeOffset: LONGINT;
  9927. delegate: BOOLEAN;
  9928. map: SymbolMap;
  9929. callingConvention, parametersSize: LONGINT;
  9930. BEGIN
  9931. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9932. expression := x.returnValue;
  9933. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9934. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9935. IF currentIsInline THEN
  9936. IF expression # NIL THEN
  9937. map := currentMapper.Get(NIL);
  9938. IF map # NIL THEN
  9939. Assign(map.to, expression);
  9940. ELSE
  9941. Evaluate(expression,res);
  9942. Emit(Return(position,res.op));
  9943. ReleaseOperand(res);
  9944. END;
  9945. END;
  9946. BrL(currentInlineExit);
  9947. RETURN;
  9948. END;
  9949. IF expression # NIL THEN
  9950. type := expression.type.resolved;
  9951. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9952. IF locked THEN Lock(FALSE) END;
  9953. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9954. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9955. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9956. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (type IS SyntaxTree.EnumerationType) OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9957. (* return without structured return parameter *)
  9958. Evaluate(expression,res);
  9959. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9960. IF locked OR profile THEN
  9961. Emit(Push(position,res.op));
  9962. IF delegate THEN HALT(200) END;
  9963. ReleaseOperand(res);
  9964. IF locked THEN Lock(FALSE) END;
  9965. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9966. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9967. reg := NewRegisterOperand(res.op.type);
  9968. Emit(Pop(position,reg));
  9969. Emit(Return(position,reg));
  9970. ReleaseIntermediateOperand(reg);
  9971. ELSE
  9972. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9973. Emit(Return(position,res.op));
  9974. ReleaseOperand(res);
  9975. END;
  9976. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9977. THEN
  9978. (* return using structured return parameter *)
  9979. 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)
  9980. OR SemanticChecker.IsPointerType(type));
  9981. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9982. parameter :=procedureType.returnParameter;
  9983. ASSERT(parameter # NIL);
  9984. returnTypeOffset := parameter.offsetInBits;
  9985. (*
  9986. IF parameter# NIL THEN
  9987. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9988. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9989. ELSE
  9990. returnTypeOffset := system.offsetFirstParameter
  9991. END;
  9992. *)
  9993. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9994. IF type IS SyntaxTree.RangeType THEN
  9995. (* array range type *)
  9996. Evaluate(expression, right);
  9997. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9998. Emit(Mov(position,mem, right.op)); (* first *)
  9999. ReleaseIntermediateOperand(mem);
  10000. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10001. Emit(Mov(position,mem, right.tag)); (* last *)
  10002. ReleaseIntermediateOperand(mem);
  10003. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10004. Emit(Mov(position,mem, right.extra)); (* step *)
  10005. ReleaseIntermediateOperand(mem);
  10006. ReleaseOperand(right);
  10007. ELSIF type IS SyntaxTree.ComplexType THEN
  10008. Evaluate(expression, right);
  10009. componentType := type(SyntaxTree.ComplexType).componentType;
  10010. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  10011. Emit(Mov(position,mem, right.op)); (* real part *)
  10012. ReleaseIntermediateOperand(mem);
  10013. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10014. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  10015. ReleaseIntermediateOperand(mem);
  10016. ReleaseOperand(right);
  10017. ELSE (* covers cases: pointer / record / array *)
  10018. parameter := procedureType.returnParameter;
  10019. checker.SetCurrentScope(currentScope);
  10020. ASSERT(parameter # NIL);
  10021. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10022. Assign(parameterDesignator,expression);
  10023. END;
  10024. ReleaseIntermediateOperand(left);
  10025. IF locked THEN Lock(FALSE) END;
  10026. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10027. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10028. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  10029. parameter := procedureType.returnParameter;
  10030. checker.SetCurrentScope(currentScope);
  10031. IF parameter = NIL THEN
  10032. Error(procedure.position, "structured return of parameter of procedure not found");
  10033. ELSE
  10034. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10035. Assign(parameterDesignator,expression);
  10036. END;
  10037. IF locked THEN Lock(FALSE) END;
  10038. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10039. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10040. ELSE
  10041. HALT(200);
  10042. END;
  10043. ELSE
  10044. IF locked THEN Lock(FALSE) END;
  10045. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10046. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10047. END;
  10048. IF backend.cooperative THEN
  10049. BrL(exitLabel);
  10050. ELSE
  10051. callingConvention := procedureType.callingConvention;
  10052. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10053. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10054. ELSE
  10055. parametersSize := 0;
  10056. END;
  10057. EmitLeave(section, position,procedure, callingConvention);
  10058. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10059. END;
  10060. IF Trace THEN TraceExit("VisitReturnStatement") END;
  10061. END VisitReturnStatement;
  10062. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  10063. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  10064. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  10065. statements: SyntaxTree.StatementSequence;
  10066. name, suffix: SyntaxTree.IdentifierString;
  10067. BEGIN
  10068. Strings.IntToStr(awaitProcCounter,suffix);
  10069. Strings.Concat("@AwaitProcedure",suffix,name);
  10070. identifier := SyntaxTree.NewIdentifier(name);
  10071. INC(awaitProcCounter);
  10072. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10073. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10074. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10075. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10076. procedure.SetAccess(SyntaxTree.Hidden);
  10077. procedure.SetScope(currentScope);
  10078. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10079. procedureType.SetReturnType(system.booleanType);
  10080. procedure.SetType(procedureType);
  10081. body := SyntaxTree.NewBody(x.position,procedureScope);
  10082. procedureScope.SetBody(body);
  10083. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10084. returnStatement.SetReturnValue(x.condition);
  10085. statements := SyntaxTree.NewStatementSequence();
  10086. statements.AddStatement(returnStatement);
  10087. body.SetStatementSequence(statements);
  10088. currentScope.AddProcedure(procedure);
  10089. RETURN procedure
  10090. END MakeAwaitProcedure;
  10091. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10092. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10093. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  10094. BEGIN
  10095. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10096. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10097. IF backend.cooperative THEN
  10098. start := NewLabel();
  10099. true := NewLabel();
  10100. false := NewLabel();
  10101. SetLabel(start);
  10102. Condition(x.condition,true,false);
  10103. SetLabel(false);
  10104. PushSelfPointer();
  10105. CallThis(position,"ExclusiveBlocks","Await",1);
  10106. BrL(start);
  10107. SetLabel(true);
  10108. PushSelfPointer();
  10109. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10110. ELSE
  10111. proc := MakeAwaitProcedure(x);
  10112. Emit(Push(position,fp));
  10113. GetCodeSectionNameForSymbol(proc,name);
  10114. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10115. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10116. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10117. Emit(Call(position,call,ProcParametersSize(proc)));
  10118. Emit(Result(position,res));
  10119. (*
  10120. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10121. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10122. *)
  10123. InitOperand(result,ModeValue);
  10124. result.op := res;
  10125. label := NewLabel();
  10126. BreqL(label, result.op, SELF.true);
  10127. ReleaseOperand(result);
  10128. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10129. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10130. Emit(Push(position,res));
  10131. Emit(Push(position,fp));
  10132. PushSelfPointer();
  10133. Emit(Push(position,nil));
  10134. CallThis(position,"Objects","Await",4);
  10135. SetLabel(label);
  10136. END;
  10137. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10138. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10139. END VisitAwaitStatement;
  10140. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10141. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10142. BEGIN
  10143. FOR i := 0 TO x.Length() - 1 DO
  10144. statement := x.GetStatement( i );
  10145. Statement(statement);
  10146. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10147. END;
  10148. END StatementSequence;
  10149. PROCEDURE PushSelfPointer;
  10150. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10151. procedureType: SyntaxTree.ProcedureType;
  10152. BEGIN
  10153. scope := currentScope;
  10154. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10155. scope := scope.outerScope;
  10156. END;
  10157. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10158. moduleSection := meta.ModuleSection();
  10159. IF backend.cooperative THEN
  10160. moduleOffset := 0;
  10161. ELSE
  10162. moduleOffset := moduleSection.pc;
  10163. END;
  10164. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10165. ELSE
  10166. GetBaseRegister(op.op,currentScope,scope);
  10167. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10168. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10169. parametersSize := ProcParametersSize(procedure);
  10170. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10171. IF backend.cooperative THEN
  10172. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10173. END;
  10174. IntermediateCode.MakeMemory(op.op,addressType);
  10175. END;
  10176. Emit(Push(position,op.op));
  10177. ReleaseOperand(op);
  10178. END PushSelfPointer;
  10179. PROCEDURE Lock(lock: BOOLEAN);
  10180. BEGIN
  10181. IF Trace THEN TraceEnter("Lock") END;
  10182. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10183. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10184. ASSERT(modifyAssignmentCounter = 0);
  10185. IF dump # NIL THEN
  10186. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10187. dump.Ln;dump.Update;
  10188. END;
  10189. PushSelfPointer;
  10190. IF backend.cooperative THEN
  10191. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10192. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10193. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10194. END;
  10195. ELSE
  10196. Emit(Push(position,true));
  10197. IF lock THEN CallThis(position,"Objects","Lock",2)
  10198. ELSE CallThis(position,"Objects","Unlock",2);
  10199. END;
  10200. END;
  10201. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10202. IF Trace THEN TraceExit("Lock") END;
  10203. END Lock;
  10204. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10205. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10206. BEGIN
  10207. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10208. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10209. previouslyUnchecked := isUnchecked;
  10210. isUnchecked := isUnchecked OR x.isUnchecked;
  10211. previouslyCooperativeSwitches := cooperativeSwitches;
  10212. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10213. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10214. IF x.statements # NIL THEN
  10215. StatementSequence(x.statements);
  10216. END;
  10217. IF (x IS SyntaxTree.Body) THEN
  10218. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10219. section.SetFinally(section.pc);
  10220. StatementSequence(x(SyntaxTree.Body).finally)
  10221. ELSIF x.isExclusive THEN
  10222. end := NewLabel();
  10223. BrL(end);
  10224. section.SetFinally(section.pc);
  10225. Lock(FALSE);
  10226. EmitTrap(position,RethrowTrap);
  10227. SetLabel(end);
  10228. END;
  10229. END;
  10230. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10231. isUnchecked := previouslyUnchecked;
  10232. cooperativeSwitches := previouslyCooperativeSwitches;
  10233. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10234. END VisitStatementBlock;
  10235. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10236. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10237. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10238. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10239. procedure: SyntaxTree.Procedure;
  10240. map: SymbolMap;
  10241. callingConvention, parametersSize: LONGINT;
  10242. BEGIN
  10243. scope := currentScope;
  10244. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10245. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10246. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10247. return := emptyOperand;
  10248. IF Trace THEN TraceEnter("VisitCode") END;
  10249. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10250. NEW(in, x.inRules.Length());
  10251. FOR i := 0 TO LEN(in)-1 DO
  10252. statement := x.inRules.GetStatement(i);
  10253. WITH statement: SyntaxTree.Assignment DO
  10254. Evaluate(statement.right, operand);
  10255. result := operand.op;
  10256. NEW(str, 64);
  10257. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10258. in[i] := result; IntermediateCode.SetString(in[i], str);
  10259. ReleaseIntermediateOperand(operand.tag);
  10260. END;
  10261. END;
  10262. ELSE in := NIL
  10263. END;
  10264. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10265. NEW(out, x.outRules.Length());
  10266. FOR i := 0 TO LEN(out)-1 DO
  10267. statement := x.outRules.GetStatement(i);
  10268. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10269. WITH statement: SyntaxTree.Assignment DO
  10270. Designate(statement.left, operand);
  10271. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10272. NEW(str, 64);
  10273. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10274. out[i] := result; IntermediateCode.SetString(out[i], str);
  10275. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10276. |statement: SyntaxTree.ReturnStatement DO
  10277. NEW(str, 64);
  10278. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10279. IF currentIsInline THEN
  10280. map := currentMapper.Get(NIL);
  10281. Designate(map.to, operand);
  10282. IF map.isAddress THEN
  10283. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10284. ELSE
  10285. result := operand.op;
  10286. END;
  10287. (*! only if it does not fit into register
  10288. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10289. *)
  10290. (*Evaluate(map.to, operand);*)
  10291. out[i] := result;
  10292. ELSE
  10293. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10294. END;
  10295. IntermediateCode.SetString(out[i], str);
  10296. ReleaseIntermediateOperand(operand.tag);
  10297. return := out[i];
  10298. ELSE
  10299. END;
  10300. END;
  10301. ELSE out := NIL
  10302. END;
  10303. Emit(Asm(x.position,x.sourceCode, in, out));
  10304. IF in # NIL THEN
  10305. FOR i := 0 TO LEN(in)-1 DO
  10306. ReleaseIntermediateOperand(in[i]);
  10307. END;
  10308. END;
  10309. IF out # NIL THEN
  10310. FOR i := 0 TO LEN(out)-1 DO
  10311. WITH statement: SyntaxTree.Assignment DO
  10312. ReleaseIntermediateOperand(out[i]);
  10313. |statement: SyntaxTree.ReturnStatement DO
  10314. (* release happens below *)
  10315. ELSE
  10316. END;
  10317. statement := x.outRules.GetStatement(i);
  10318. END;
  10319. END;
  10320. IF return.mode # IntermediateCode.Undefined THEN
  10321. IF currentIsInline THEN
  10322. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10323. Symbol(procedureType.returnParameter, par);
  10324. MakeMemory(mem, par.op, return.type, 0);
  10325. ReleaseOperand(par);
  10326. Emit(Mov(position, mem, return));
  10327. ReleaseIntermediateOperand(mem);
  10328. ELSE
  10329. Emit(Return(position,return));
  10330. END;
  10331. ReleaseIntermediateOperand(return);
  10332. IF currentIsInline THEN RETURN END;
  10333. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10334. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10335. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10336. ELSE
  10337. parametersSize := 0;
  10338. END;
  10339. EmitLeave(section, position,procedure, callingConvention);
  10340. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10341. END;
  10342. IF Trace THEN TraceExit("VisitCode") END;
  10343. END VisitCode;
  10344. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10345. BEGIN
  10346. RETURN ProcedureParametersSize(system, procedure);
  10347. END ProcParametersSize;
  10348. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10349. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10350. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10351. const, call: IntermediateCode.Operand;
  10352. parameterDesignator: SyntaxTree.Expression;
  10353. saved: RegisterEntry;
  10354. name: Basic.SegmentedName;
  10355. BEGIN
  10356. IF Trace THEN TraceEnter("ParameterCopies") END;
  10357. parameter := x.firstParameter;
  10358. WHILE parameter # NIL DO
  10359. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10360. type := parameter.type.resolved;
  10361. IF IsOpenArray(type) THEN
  10362. VisitParameter(parameter);
  10363. op := result;
  10364. IF backend.cooperative & parameter.NeedsTrace() THEN
  10365. length := GetArrayLength(type, op.tag);
  10366. size := NewRegisterOperand(addressType);
  10367. base := ArrayBaseType(type);
  10368. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10369. Emit(Mul(position, size, length, const));
  10370. dst := NewRegisterOperand (addressType);
  10371. Emit(Mov(position, dst, size));
  10372. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10373. Emit(Sub(position,dst,sp,dst));
  10374. Emit(And(position,dst,dst,const));
  10375. Emit(Mov(position,sp,dst));
  10376. par := fp;
  10377. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10378. IntermediateCode.InitImmediate(null, byteType, 0);
  10379. Emit(Fill(position, dst, size, null));
  10380. ReleaseIntermediateOperand(dst);
  10381. ReleaseIntermediateOperand(length);
  10382. SaveRegisters();ReleaseUsedRegisters(saved);
  10383. (* register dst has been freed before SaveRegisters already *)
  10384. base := ArrayBaseType(type);
  10385. (* assign method of open array *)
  10386. IF base.IsRecordType() THEN
  10387. Emit (Push(position, length));
  10388. Emit (Push(position, dst));
  10389. Emit (Push(position, op.op));
  10390. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10391. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10392. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10393. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10394. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10395. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10396. Emit (Push(position,length));
  10397. Emit (Push(position, dst));
  10398. Emit (Push(position, length));
  10399. Emit (Push(position, op.op));
  10400. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10401. ELSE
  10402. Emit (Push(position, length));
  10403. Emit (Push(position, dst));
  10404. Emit (Push(position, length));
  10405. Emit (Push(position, op.op));
  10406. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10407. ASSERT(ArrayBaseType(type).IsPointer());
  10408. END;
  10409. RestoreRegisters(saved);
  10410. ELSE
  10411. temp := GetDynamicSize(type,op.tag);
  10412. ReuseCopy(size,temp);
  10413. ReleaseIntermediateOperand(temp);
  10414. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10415. Emit(Sub(position,size,sp,size));
  10416. Emit(And(position,size,size,const));
  10417. Emit(Mov(position,sp,size));
  10418. par := fp;
  10419. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10420. ReleaseIntermediateOperand(size);
  10421. size := GetDynamicSize(type,op.tag);
  10422. END;
  10423. Emit(Copy(position,sp,op.op,size));
  10424. ReleaseIntermediateOperand(size);
  10425. ReleaseOperand(op);
  10426. IntermediateCode.MakeMemory(par,addressType);
  10427. Emit(Mov(position,par,sp));
  10428. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10429. checker.SetCurrentScope(currentScope);
  10430. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10431. Assign(parameterDesignator,parameterDesignator);
  10432. END;
  10433. END;
  10434. parameter := parameter.nextParameter;
  10435. END;
  10436. IF Trace THEN TraceExit("ParameterCopies") END;
  10437. END ParameterCopies;
  10438. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10439. VAR x: SyntaxTree.Variable;
  10440. BEGIN
  10441. x := scope.firstVariable;
  10442. WHILE x # NIL DO
  10443. InitVariable(x,FALSE);
  10444. x := x.nextVariable;
  10445. END;
  10446. END InitVariables;
  10447. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10448. BEGIN
  10449. IF (symbol # NIL) THEN
  10450. RETURN fingerPrinter.SymbolFP(symbol).public
  10451. ELSE
  10452. RETURN 0
  10453. END;
  10454. END GetFingerprint;
  10455. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10456. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10457. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10458. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10459. name: Basic.SegmentedName;
  10460. offset: LONGINT;
  10461. BEGIN
  10462. IF Trace THEN TraceEnter("Body") END;
  10463. ReleaseUsedRegisters(saved); (* just in case ... *)
  10464. section := ir;
  10465. exitLabel := NewLabel ();
  10466. IF moduleBody THEN moduleBodySection := section END;
  10467. IF ir.comments # NIL THEN
  10468. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10469. commentPrintout.SingleStatement(TRUE);
  10470. dump := ir.comments;
  10471. ELSE
  10472. commentPrintout := NIL;
  10473. dump := NIL;
  10474. END;
  10475. prevScope := currentScope;
  10476. currentScope := scope;
  10477. lastSwitchPC := 0;
  10478. cooperativeSwitches := backend.cooperative;
  10479. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10480. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10481. IF x # NIL THEN
  10482. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10483. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10484. IF moduleBody THEN
  10485. ProfilerInit();
  10486. ELSE
  10487. Basic.SegmentedNameToString(ir.name, string);
  10488. ProfilerAddProcedure(numberProcedures,string);
  10489. ProfilerEnterExit(numberProcedures,TRUE);
  10490. END;
  10491. END;
  10492. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10493. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10494. END;
  10495. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10496. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10497. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10498. IF procedure = cellScope.bodyProcedure THEN
  10499. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10500. StaticCallOperand(op, cellScope.constructor);
  10501. Emit(Call(position,op.op,0));
  10502. END;
  10503. END;
  10504. END;
  10505. InitVariables(scope);
  10506. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10507. GetCodeSectionNameForSymbol(procedure, name);
  10508. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10509. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10510. IF ProtectModulesPointers THEN
  10511. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10512. ELSE
  10513. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10514. END;
  10515. IntermediateCode.SetOffset(right,offset); (* tag *)
  10516. IntermediateCode.InitMemory(left,addressType,fp,0);
  10517. Emit(Mov(position, left, right));
  10518. END;
  10519. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10520. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10521. ParameterCopies(procedureType);
  10522. IF x.code = NIL THEN
  10523. VisitStatementBlock(x);
  10524. ELSE
  10525. VisitCode(x.code)
  10526. END;
  10527. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10528. IF ~backend.cooperative THEN
  10529. ProfilerEnterExit(numberProcedures,FALSE);
  10530. END;
  10531. INC(numberProcedures);
  10532. END;
  10533. END;
  10534. IF backend.cooperative THEN
  10535. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10536. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10537. END;
  10538. IF x # NIL THEN
  10539. SELF.position := x.position;
  10540. END;
  10541. CheckRegistersFree();
  10542. ASSERT(modifyAssignmentCounter = 0);
  10543. currentScope := prevScope;
  10544. IF Trace THEN TraceExit("Body") END;
  10545. END Body;
  10546. END ImplementationVisitor;
  10547. MetaDataGenerator=OBJECT
  10548. VAR
  10549. implementationVisitor: ImplementationVisitor;
  10550. declarationVisitor: DeclarationVisitor;
  10551. module: Sections.Module;
  10552. moduleName: ARRAY 128 OF CHAR;
  10553. moduleNamePool: Basic.HashTableInt;
  10554. moduleNamePoolSection: IntermediateCode.Section;
  10555. modulePointerSection: IntermediateCode.Section;
  10556. modulePointerSizePC: LONGINT;
  10557. modulePointerSectionOffset: LONGINT;
  10558. modulePointers: LONGINT;
  10559. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10560. RecordBaseOffset: LONGINT;
  10561. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10562. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10563. TypeTags: LONGINT; (* type extension level support *)
  10564. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10565. patchInfoPC: LONGINT;
  10566. patchCRC: LONGINT;
  10567. CONST
  10568. EmptyBlockOffset = 2;
  10569. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10570. BEGIN
  10571. IF implementationVisitor.backend.cooperative THEN
  10572. TypeTags := MAX(LONGINT);
  10573. BaseTypesTableOffset := 0;
  10574. MethodTableOffset := 2;
  10575. TypeRecordBaseOffset := 0;
  10576. RecordBaseOffset := 0;
  10577. ELSIF simple THEN
  10578. TypeTags := 3; (* only 3 extensions allowed *)
  10579. BaseTypesTableOffset := 1;
  10580. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10581. TypeRecordBaseOffset := 0;
  10582. RecordBaseOffset := 1;
  10583. ELSE
  10584. TypeTags := 16;
  10585. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10586. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10587. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10588. (* change this when Heaps.HeapBlock is modified *)
  10589. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10590. RecordBaseOffset := 8; (* addresses *)
  10591. ELSE
  10592. RecordBaseOffset := 9; (* addresses *)
  10593. END;
  10594. END;
  10595. SELF.simple := simple;
  10596. SELF.implementationVisitor := implementationVisitor;
  10597. SELF.declarationVisitor := declarationVisitor;
  10598. implementationVisitor.meta := SELF;
  10599. declarationVisitor.meta := SELF;
  10600. END InitMetaDataGenerator;
  10601. PROCEDURE SetModule(module: Sections.Module);
  10602. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10603. BEGIN
  10604. SELF.module := module;
  10605. Global.GetModuleName(module.module,moduleName);
  10606. Global.GetSymbolSegmentedName(module.module, name);
  10607. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  10608. NEW(moduleNamePool, 32);
  10609. (*! require GC protection *)
  10610. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10611. IF ProtectModulesPointers THEN
  10612. name := "Heaps.AnyPtr";
  10613. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10614. (* set base pointer *)
  10615. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10616. END;
  10617. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10618. modulePointers := 0;
  10619. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10620. AddPointer(moduleNamePoolSection, namePoolOffset);
  10621. END;
  10622. END SetModule;
  10623. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10624. BEGIN
  10625. IF ~implementationVisitor.backend.cooperative THEN
  10626. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10627. INC(modulePointers);
  10628. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10629. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10630. END;
  10631. END AddPointer;
  10632. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10633. BEGIN
  10634. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10635. END GetTypeRecordBaseOffset;
  10636. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10637. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10638. BEGIN
  10639. (* change this when Heaps.HeapBlock is modified *)
  10640. INC(dataAdrOffset,7);
  10641. Info(section,"headerAdr");
  10642. Address(section,0);
  10643. Info(section,"typeDesc");
  10644. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10645. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10646. NamedSymbol(section, name, symbol, 0, offset);
  10647. Info(section,"mark: LONGINT;");
  10648. Longint(section,-1);
  10649. Info(section,"refCount: LONGINT;");
  10650. Longint(section,0);
  10651. (*
  10652. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10653. *)
  10654. Info(section,"dataAdr-: ADDRESS");
  10655. Symbol(section,section, dataAdrOffset,0);
  10656. Info(section,"size-: SIZE");
  10657. Address(section,0);
  10658. Info(section,"nextMark: HeapBlock;");
  10659. Address(section,0);
  10660. END HeapBlock;
  10661. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10662. VAR i: LONGINT;
  10663. BEGIN
  10664. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10665. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10666. Info(section,"count*: LONGINT");
  10667. Longint(section,0);
  10668. Info(section,"locked*: BOOLEAN");
  10669. Longint(section,0);
  10670. Info(section,"awaitingLock*: ProcessQueue");
  10671. Address(section,0);
  10672. Address(section,0);
  10673. Info(section,"awaitingCond*: ProcessQueue");
  10674. Address(section,0);
  10675. Address(section,0);
  10676. Info(section,"lockedBy*: ANY");
  10677. Address(section,0);
  10678. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10679. Longint(section,1);
  10680. FOR i := 2 TO 6 DO
  10681. Longint(section,0);
  10682. END;
  10683. Info(section,"lock*: ANY");
  10684. Address(section,0);
  10685. END ProtectedHeapBlock;
  10686. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10687. BEGIN
  10688. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10689. END Info;
  10690. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10691. VAR op: IntermediateCode.Operand;
  10692. BEGIN
  10693. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10694. section.Emit(Data(Basic.invalidPosition,op));
  10695. END Address;
  10696. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10697. VAR op: IntermediateCode.Operand;
  10698. BEGIN
  10699. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10700. section.Emit(Data(Basic.invalidPosition,op));
  10701. END Size;
  10702. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10703. VAR op: IntermediateCode.Operand;
  10704. BEGIN
  10705. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10706. section.Emit(Data(Basic.invalidPosition,op));
  10707. END Set;
  10708. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10709. VAR op: IntermediateCode.Operand;
  10710. BEGIN
  10711. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10712. section.Emit(Data(Basic.invalidPosition,op));
  10713. END Longint;
  10714. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10715. VAR op,noOperand: IntermediateCode.Operand;
  10716. BEGIN
  10717. IntermediateCode.InitOperand(noOperand);
  10718. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10719. section.PatchOperands(pc,op,noOperand,noOperand);
  10720. END PatchAddress;
  10721. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10722. VAR op,noOperand: IntermediateCode.Operand;
  10723. BEGIN
  10724. IntermediateCode.InitOperand(noOperand);
  10725. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10726. section.PatchOperands(pc,op,noOperand,noOperand);
  10727. END PatchSize;
  10728. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10729. VAR op,noOperand: IntermediateCode.Operand;
  10730. BEGIN
  10731. IntermediateCode.InitOperand(noOperand);
  10732. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10733. section.PatchOperands(pc,op,noOperand,noOperand);
  10734. END PatchLongint;
  10735. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10736. VAR op, noOperand: IntermediateCode.Operand;
  10737. BEGIN
  10738. IntermediateCode.InitOperand(noOperand);
  10739. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10740. section.PatchOperands(pc,op,noOperand,noOperand);
  10741. END PatchSymbol;
  10742. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10743. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10744. BEGIN
  10745. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10746. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10747. section.Emit(Data(Basic.invalidPosition,op));
  10748. END Boolean;
  10749. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10750. VAR op: IntermediateCode.Operand;
  10751. BEGIN
  10752. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10753. section.Emit(Data(Basic.invalidPosition,op));
  10754. END Char;
  10755. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10756. VAR op: IntermediateCode.Operand;
  10757. BEGIN
  10758. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10759. section.Emit(Data(Basic.invalidPosition,op));
  10760. END Integer;
  10761. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10762. VAR i: LONGINT;
  10763. BEGIN
  10764. Info(section,str);
  10765. i := 0;
  10766. WHILE(str[i] # 0X) DO
  10767. Char(section,str[i]);
  10768. INC(i);
  10769. END;
  10770. Char(section,0X);
  10771. END String;
  10772. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10773. VAR s: Basic.SectionName;
  10774. BEGIN
  10775. StringPool.GetString(str, s);
  10776. String(section, s);
  10777. END String0;
  10778. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10779. VAR op: IntermediateCode.Operand;
  10780. BEGIN
  10781. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10782. IntermediateCode.SetOffset(op,realOffset);
  10783. section.Emit(Data(Basic.invalidPosition,op));
  10784. END NamedSymbol;
  10785. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10786. VAR op: IntermediateCode.Operand;
  10787. BEGIN
  10788. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10789. IntermediateCode.SetOffset(op,realOffset);
  10790. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10791. END NamedSymbolAt;
  10792. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10793. BEGIN
  10794. IF symbol= NIL THEN
  10795. Address( section, realOffset);
  10796. ASSERT(virtualOffset = 0);
  10797. ELSE
  10798. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10799. END;
  10800. END Symbol;
  10801. (* OutPointers delivers
  10802. {pointerOffset}
  10803. *)
  10804. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10805. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10806. BEGIN
  10807. type := type.resolved;
  10808. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10809. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10810. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10811. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10812. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10813. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10814. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10815. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10816. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10817. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10818. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10819. ELSIF (type IS SyntaxTree.RecordType) THEN
  10820. (* never treat a record like a pointer, even if the pointer field is set! *)
  10821. WITH type: SyntaxTree.RecordType DO
  10822. base := type.GetBaseRecord();
  10823. IF base # NIL THEN
  10824. Pointers(offset,symbol,section, base,numberPointers);
  10825. END;
  10826. variable := type.recordScope.firstVariable;
  10827. WHILE(variable # NIL) DO
  10828. IF ~(variable.untraced) THEN
  10829. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10830. END;
  10831. variable := variable.nextVariable;
  10832. END;
  10833. END;
  10834. ELSIF (type IS SyntaxTree.CellType) THEN
  10835. WITH type: SyntaxTree.CellType DO
  10836. base := type.GetBaseRecord();
  10837. IF base # NIL THEN
  10838. Pointers(offset,symbol,section, base,numberPointers);
  10839. END;
  10840. variable := type.cellScope.firstVariable;
  10841. WHILE(variable # NIL) DO
  10842. IF ~(variable.untraced) THEN
  10843. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10844. END;
  10845. variable := variable.nextVariable;
  10846. END;
  10847. property := type.firstProperty;
  10848. WHILE(property # NIL) DO
  10849. IF ~(property.untraced) THEN
  10850. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10851. END;
  10852. property := property.nextProperty;
  10853. END;
  10854. parameter := type.firstParameter;
  10855. WHILE(parameter # NIL) DO
  10856. IF ~(parameter.untraced) THEN
  10857. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10858. END;
  10859. parameter := parameter.nextParameter;
  10860. END;
  10861. END;
  10862. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10863. WITH type: SyntaxTree.ArrayType DO
  10864. IF type.form= SyntaxTree.Static THEN
  10865. n := type.staticLength;
  10866. base := type.arrayBase.resolved;
  10867. WHILE(base IS SyntaxTree.ArrayType) DO
  10868. type := base(SyntaxTree.ArrayType);
  10869. n := n* type.staticLength;
  10870. base := type.arrayBase.resolved;
  10871. END;
  10872. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10873. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10874. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10875. FOR i := 0 TO n-1 DO
  10876. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10877. END;
  10878. END;
  10879. ELSE
  10880. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10881. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10882. END;
  10883. END;
  10884. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10885. WITH type: SyntaxTree.MathArrayType DO
  10886. IF type.form = SyntaxTree.Static THEN
  10887. n := type.staticLength;
  10888. base := type.arrayBase.resolved;
  10889. WHILE(base IS SyntaxTree.MathArrayType) DO
  10890. type := base(SyntaxTree.MathArrayType);
  10891. n := n* type.staticLength;
  10892. base := type.arrayBase.resolved;
  10893. END;
  10894. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10895. IF SemanticChecker.ContainsPointer(base) THEN
  10896. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10897. FOR i := 0 TO n-1 DO
  10898. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10899. END;
  10900. END;
  10901. ELSE
  10902. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10903. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10904. END
  10905. END;
  10906. (* ELSE no pointers in type *)
  10907. END;
  10908. END Pointers;
  10909. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10910. VAR position,i: LONGINT; ch: CHAR;
  10911. BEGIN
  10912. IF pool.Has(index) THEN
  10913. RETURN pool.GetInt(index)
  10914. ELSE
  10915. position := source.pc;
  10916. pool.PutInt(index, position);
  10917. Info(source, name);
  10918. i := 0;
  10919. REPEAT
  10920. ch := name[i]; INC(i);
  10921. Char( source, ch);
  10922. UNTIL ch = 0X;
  10923. END;
  10924. RETURN position;
  10925. END EnterDynamicName;
  10926. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10927. VAR name: Basic.SectionName; position: LONGINT;
  10928. BEGIN
  10929. IF pool.Has(index) THEN
  10930. RETURN pool.GetInt(index)
  10931. ELSE
  10932. StringPool.GetString(index, name);
  10933. position := EnterDynamicName(source,name,index, pool);
  10934. END;
  10935. RETURN position;
  10936. END DynamicName;
  10937. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10938. VAR section: IntermediateCode.Section;
  10939. BEGIN
  10940. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10941. IF implementationVisitor.backend.cooperative THEN
  10942. Info(section, "TypeDescriptor");
  10943. Basic.ToSegmentedName("BaseTypes.Array", name);
  10944. NamedSymbol(section, name,NIL, 0, 0);
  10945. BasePointer(section);
  10946. offset := 0;
  10947. ELSE
  10948. IF ProtectModulesPointers THEN
  10949. HeapBlock(mName,typeName,section,2);
  10950. END;
  10951. Info(section, "HeapBlock");
  10952. IF ProtectModulesPointers THEN
  10953. Symbol(section,section,2,0);
  10954. ELSE
  10955. Address(section,0);
  10956. END;
  10957. Info(section, "TypeDescriptor");
  10958. Address(section,0);
  10959. offset := section.pc;
  10960. END;
  10961. RETURN section
  10962. END NamedBlock;
  10963. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10964. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10965. BEGIN
  10966. COPY(moduleName,name);
  10967. Strings.Append(name,suffix);
  10968. Basic.ToSegmentedName(name, pooledName);
  10969. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10970. END Block;
  10971. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10972. VAR name: Basic.SegmentedName;
  10973. BEGIN
  10974. Info(source,"ArrayHeader");
  10975. IF implementationVisitor.backend.cooperative THEN
  10976. sizePC := source.pc;
  10977. Address(source,0);
  10978. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10979. IF baseType # "" THEN
  10980. Basic.ToSegmentedName(baseType, name);
  10981. NamedSymbol(source, name,NIL, 0, 0);
  10982. ELSE
  10983. Address(source,0);
  10984. END;
  10985. Address(source,0);
  10986. ELSE
  10987. Address(source,0);
  10988. Address(source,0);
  10989. (* first pointer for GC *)
  10990. IF hasPointer THEN
  10991. (* points to first element in the array, this is NOT the base type descriptor *)
  10992. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10993. ELSE
  10994. Address(source,0);
  10995. END;
  10996. sizePC := source.pc;
  10997. Address(source,0);
  10998. Info(source,"array data");
  10999. END;
  11000. END ArrayBlock;
  11001. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  11002. BEGIN
  11003. IF implementationVisitor.backend.cooperative THEN
  11004. PatchSize(section, pc, size);
  11005. PatchSize(section, pc + 3, size);
  11006. ELSE
  11007. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  11008. PatchSize(section, pc, size);
  11009. END;
  11010. END PatchArray;
  11011. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  11012. VAR
  11013. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  11014. sectionArray: POINTER TO ARRAY OF Sections.Section;
  11015. poolMap: Basic.HashTableInt;
  11016. namePool: IntermediateCode.Section;
  11017. namePoolOffset: LONGINT;
  11018. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  11019. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  11020. BEGIN
  11021. Basic.SegmentedNameToString(s1.name,n1);
  11022. Basic.SegmentedNameToString(s2.name,n2);
  11023. index := 0;
  11024. ch1 := n1[index];
  11025. ch2 := n2[index];
  11026. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  11027. INC(index);
  11028. ch1 := n1[index];
  11029. ch2 := n2[index];
  11030. END;
  11031. RETURN ch1 < ch2;
  11032. END Compare;
  11033. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  11034. VAR
  11035. i, j: LONGINT;
  11036. x, t: Sections.Section;
  11037. BEGIN
  11038. IF lo < hi THEN
  11039. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  11040. WHILE i <= j DO
  11041. WHILE Compare(list[i], x) DO INC(i) END;
  11042. WHILE Compare(x, list[j]) DO DEC(j) END;
  11043. IF i <= j THEN
  11044. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  11045. INC(i); DEC(j)
  11046. END
  11047. END;
  11048. IF lo < j THEN QuickSort(list, lo, j) END;
  11049. IF i < hi THEN QuickSort(list, i, hi) END
  11050. END;
  11051. END QuickSort;
  11052. (*
  11053. ExportDesc* = RECORD
  11054. fp*: ADDRESS;
  11055. name* {UNTRACED}: DynamicName;
  11056. adr*: ADDRESS;
  11057. exports*: LONGINT;
  11058. dsc* {UNTRACED}: ExportArray
  11059. END;
  11060. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  11061. *)
  11062. PROCEDURE ExportDesc2(
  11063. source: IntermediateCode.Section;
  11064. namePool: IntermediateCode.Section;
  11065. fingerPrinter: FingerPrinter.FingerPrinter;
  11066. symbol: Sections.Section;
  11067. name: StringPool.Index;
  11068. VAR patchAdr: LONGINT
  11069. ): BOOLEAN;
  11070. VAR fingerPrint: SyntaxTree.FingerPrint;
  11071. BEGIN
  11072. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11073. & (symbol.type # Sections.InlineCodeSection)
  11074. THEN
  11075. *)
  11076. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11077. & (symbol.type # Sections.ExitCodeSection)
  11078. & (symbol.type # Sections.InlineCodeSection))
  11079. THEN
  11080. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11081. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11082. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  11083. Longint(source,fingerPrint.public);
  11084. ELSE
  11085. Longint(source, 0);
  11086. END;
  11087. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  11088. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11089. Symbol(source, symbol,0,0);
  11090. patchAdr := source.pc;
  11091. Longint(source, 0);
  11092. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11093. Address(source,0);
  11094. END;
  11095. RETURN TRUE
  11096. ELSE
  11097. RETURN FALSE
  11098. END;
  11099. END ExportDesc2;
  11100. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11101. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11102. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11103. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11104. nextPatch: LONGINT;
  11105. TYPE
  11106. Scope = RECORD
  11107. elements: LONGINT;
  11108. gelements: LONGINT;
  11109. section: IntermediateCode.Section;
  11110. patchAdr: LONGINT;
  11111. arraySizePC: LONGINT;
  11112. beginPC: LONGINT; (* current scope start pc *)
  11113. END;
  11114. BEGIN
  11115. Basic.InitSegmentedName(prev);
  11116. olevel := -1;
  11117. scopes[0].section := source;
  11118. scopes[0].arraySizePC := MIN(LONGINT);
  11119. FOR s := 0 TO LEN(sections)-1 DO
  11120. symbol := sections[s];
  11121. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection) & (symbol.type # Sections.ExitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  11122. this := sections[s].name;
  11123. level := 0;
  11124. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11125. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11126. INC(level);
  11127. END;
  11128. WHILE level < olevel DO
  11129. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11130. IF olevel > 0 THEN
  11131. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11132. nextPatch := scopes[olevel-1].patchAdr+1;
  11133. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11134. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11135. END;
  11136. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11137. DEC(olevel);
  11138. END;
  11139. IF (level < LEN(this)) & (this[level] > 0) THEN
  11140. IF level > olevel THEN
  11141. (*TRACE("opening",level); *)
  11142. IF scopes[level].section = NIL THEN
  11143. arrayName := ".@ExportArray";
  11144. Strings.AppendInt(arrayName, level);
  11145. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11146. AddPointer(scopes[level].section,offset);
  11147. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11148. END;
  11149. scopes[level].beginPC := scopes[level].section.pc;
  11150. olevel := level;
  11151. scopes[olevel].elements := 0;
  11152. END;
  11153. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11154. sym := sections[s];
  11155. ELSE
  11156. sym := NIL;
  11157. END;
  11158. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11159. THEN
  11160. INC(scopes[olevel].elements);
  11161. END;
  11162. (* enter string in scope *)
  11163. INC(level);
  11164. END;
  11165. END;
  11166. Basic.SegmentedNameToString(this, name);
  11167. prev := this;
  11168. END;
  11169. END;
  11170. WHILE 0 <= olevel DO
  11171. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11172. IF olevel > 0 THEN
  11173. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11174. nextPatch := scopes[olevel-1].patchAdr+1;
  11175. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11176. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11177. END;
  11178. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11179. DEC(olevel);
  11180. END;
  11181. level := 0;
  11182. WHILE (level < LEN(scopes)) DO
  11183. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11184. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11185. END;
  11186. INC(level);
  11187. END;
  11188. END Export;
  11189. BEGIN
  11190. NEW(fingerPrinter);
  11191. NEW(poolMap, 64);
  11192. (* 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 *)
  11193. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11194. NEW(sectionArray, module.allSections.Length());
  11195. FOR i := 0 TO module.allSections.Length() - 1 DO
  11196. section := module.allSections.GetSection(i);
  11197. sectionArray[i] := section;
  11198. END;
  11199. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11200. Export(sectionArray^);
  11201. END ExportDesc;
  11202. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11203. VAR
  11204. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11205. BEGIN
  11206. Info(source, "exception table offsets array descriptor");
  11207. size := 0;
  11208. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11209. Info(source, "exception table content");
  11210. FOR i := 0 TO module.allSections.Length() - 1 DO
  11211. p := module.allSections.GetSection(i);
  11212. IF p.type = Sections.CodeSection THEN
  11213. finallyPC := p(IntermediateCode.Section).finally;
  11214. IF finallyPC>=0 THEN
  11215. Symbol( source, p, 0,0);
  11216. Symbol( source, p, finallyPC, 0);
  11217. Symbol( source, p, finallyPC,0);
  11218. INC(size);
  11219. END;
  11220. END
  11221. END;
  11222. PatchArray(source,sizePC,size);
  11223. END ExceptionArray;
  11224. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11225. VAR i: LONGINT; ch: CHAR;
  11226. BEGIN
  11227. i := 0;
  11228. REPEAT
  11229. ch := name[i]; INC(i);
  11230. Char( section, ch);
  11231. UNTIL ch = 0X;
  11232. WHILE i < 32 DO
  11233. Char( section, 0X); INC(i);
  11234. END;
  11235. END Name;
  11236. PROCEDURE References(section: IntermediateCode.Section);
  11237. CONST
  11238. sfTypeNone = 0X;
  11239. sfTypeCHAR = 01X;
  11240. sfTypeCHAR8 = 02X;
  11241. sfTypeCHAR16 = 03X;
  11242. sfTypeCHAR32 = 04X;
  11243. sfTypeRANGE = 05X;
  11244. sfTypeSHORTINT = 06X;
  11245. sfTypeINTEGER = 07X;
  11246. sfTypeLONGINT = 08X;
  11247. sfTypeHUGEINT = 09X;
  11248. sfTypeWORD = 0AX;
  11249. sfTypeLONGWORD = 0BX;
  11250. sfTypeSIGNED8 = 0CX;
  11251. sfTypeSIGNED16 = 0DX;
  11252. sfTypeSIGNED32 = 0EX;
  11253. sfTypeSIGNED64 = 0FX;
  11254. sfTypeUNSIGNED8 = 10X;
  11255. sfTypeUNSIGNED16 = 11X;
  11256. sfTypeUNSIGNED32 = 12X;
  11257. sfTypeUNSIGNED64 = 13X;
  11258. sfTypeREAL = 14X;
  11259. sfTypeLONGREAL = 15X;
  11260. sfTypeCOMPLEX = 16X;
  11261. sfTypeLONGCOMPLEX = 17X;
  11262. sfTypeBOOLEAN = 18X;
  11263. sfTypeSET = 19X;
  11264. sfTypeANY = 1AX;
  11265. sfTypeOBJECT = 1BX;
  11266. sfTypeBYTE = 1CX;
  11267. sfTypeADDRESS = 1DX;
  11268. sfTypeSIZE = 1EX;
  11269. sfTypeIndirect = 1FX;
  11270. sfTypeRecord = 20X;
  11271. sfTypePointerToRecord = 21X;
  11272. sfTypePointerToArray = 22X;
  11273. sfTypeOpenArray = 23X;
  11274. sfTypeStaticArray = 24X;
  11275. sfTypeDynamicArray = 25X;
  11276. sfTypeMathStaticArray = 26X;
  11277. sfTypeMathOpenArray = 27X;
  11278. sfTypeMathTensor = 28X;
  11279. sfTypeProcedure = 29X;
  11280. sfTypeDelegate = 2AX;
  11281. sfTypeENUM = 2BX;
  11282. sfTypeCELL = 2CX;
  11283. sfTypePORT = 2DX;
  11284. sfIN = 0X;
  11285. sfOUT = 1X;
  11286. flagDelegate = 0;
  11287. flagConstructor = 1;
  11288. (* variable / parameter addressing modes *)
  11289. sfAbsolute = 0X; (* global vars *)
  11290. sfRelative = 1X; (* variables, value parameters *)
  11291. sfIndirect = 2X; (* var parameters *)
  11292. sfScopeBegin = 0F0X;
  11293. sfScopeEnd = 0F1X;
  11294. sfProcedure = 0F2X;
  11295. sfVariable = 0F3X;
  11296. sfTypeDeclaration = 0F4X;
  11297. sfModule = 0FFX;
  11298. RefInfo = TRUE;
  11299. VAR
  11300. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11301. indirectTypes: Basic.HashTable;
  11302. PROCEDURE CurrentIndex(): LONGINT;
  11303. VAR i: LONGINT;
  11304. BEGIN
  11305. FOR i := startPC TO section.pc -1 DO
  11306. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11307. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11308. END;
  11309. startPC := section.pc;
  11310. RETURN lastOffset;
  11311. END CurrentIndex;
  11312. (*
  11313. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11314. Module = sfModule prevSymbol:SIZE name:String Scope.
  11315. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11316. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11317. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11318. Type =
  11319. sfTypePointerToRecord
  11320. | sfTypePointerToArray Type
  11321. | sfTypeOpenArray Type
  11322. | sfTypeDynamicArray Type
  11323. | sfTypeStaticArray length:SIZE Type
  11324. | sfTypeMathOpenArray Type
  11325. | sfTypeMathStaticArray length:SIZE Type
  11326. | sfTypeMathTensor Type
  11327. | sfTypeRecord tdAdr:ADDRESS
  11328. | sfTypeProcedure {Parameter} return:Type
  11329. | sfTypeDelegate {Parameter} return:Type
  11330. | sfTypePort (sfIN | sfOUT)
  11331. | sfTypeBOOLEAN
  11332. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11333. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11334. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11335. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11336. | sfTypeWORD | sfTypeLONGWORD
  11337. | sfTypeREAL | sfTypeLONGREAL
  11338. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11339. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11340. | sfTypeIndirect offset:SIZE.
  11341. *)
  11342. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11343. VAR offset: SIZE;
  11344. BEGIN
  11345. IF indirectTypes.Has(type) THEN
  11346. offset := indirectTypes.GetInt(type);
  11347. Char(section, sfTypeIndirect);
  11348. Size(section, offset);
  11349. RETURN TRUE;
  11350. ELSE
  11351. indirectTypes.PutInt(type, CurrentIndex());
  11352. RETURN FALSE;
  11353. END;
  11354. END Indirect;
  11355. PROCEDURE NType(type: SyntaxTree.Type);
  11356. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11357. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11358. BEGIN
  11359. IF type = NIL THEN
  11360. Char(section, sfTypeNone)
  11361. ELSE
  11362. type := type.resolved;
  11363. size := type.sizeInBits;
  11364. WITH type:SyntaxTree.PointerType DO
  11365. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11366. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11367. Char(section, sfTypePointerToRecord);
  11368. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11369. ELSE
  11370. IF RefInfo THEN Info(section,"PointerToArray") END;
  11371. Char(section, sfTypePointerToArray);
  11372. NType(type.pointerBase);
  11373. END;
  11374. | type: SyntaxTree.ArrayType DO
  11375. IF ~Indirect(type) THEN
  11376. IF type.form = SyntaxTree.Open THEN
  11377. IF RefInfo THEN Info(section,"OpenArray") END;
  11378. Char(section, sfTypeOpenArray);
  11379. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11380. IF RefInfo THEN Info(section,"DynamicArray") END;
  11381. Char(section, sfTypeDynamicArray);
  11382. ELSIF type.form = SyntaxTree.Static THEN
  11383. IF RefInfo THEN Info(section,"StaticArray") END;
  11384. Char(section, sfTypeStaticArray);
  11385. Size(section, type.staticLength);
  11386. ELSE
  11387. HALT(100);
  11388. END;
  11389. NType(type.arrayBase);
  11390. END;
  11391. | type: SyntaxTree.MathArrayType DO
  11392. IF ~Indirect(type) THEN
  11393. IF type.form = SyntaxTree.Open THEN
  11394. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11395. Char(section, sfTypeMathOpenArray);
  11396. ELSIF type.form = SyntaxTree.Static THEN
  11397. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11398. Char(section, sfTypeMathStaticArray);
  11399. Size(section, type.staticLength);
  11400. ELSIF type.form = SyntaxTree.Tensor THEN
  11401. IF RefInfo THEN Info(section,"MathTensor") END;
  11402. Char(section, sfTypeMathTensor);
  11403. ELSE
  11404. HALT(100);
  11405. END;
  11406. NType(type.arrayBase);
  11407. END;
  11408. | type: SyntaxTree.RecordType DO
  11409. IF ~Indirect(type) THEN
  11410. IF type.pointerType # NIL (* OBJECT *) THEN
  11411. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11412. Char(section, sfTypePointerToRecord)
  11413. ELSE
  11414. IF RefInfo THEN Info(section,"Record") END;
  11415. Char(section, sfTypeRecord);
  11416. td := type.typeDeclaration;
  11417. IF RefInfo THEN Info(section,"TD") END;
  11418. IF (td # NIL) THEN
  11419. Global.GetSymbolSegmentedName(td,segmentedName);
  11420. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11421. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11422. ELSE
  11423. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11424. END;
  11425. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11426. Symbol(section, tir, 0, offset);
  11427. ELSE
  11428. Address(section, 0);
  11429. END;
  11430. END;
  11431. END;
  11432. | type: SyntaxTree.CellType DO
  11433. IF ~Indirect(type) THEN
  11434. IF RefInfo THEN Info(section,"Record") END;
  11435. Char(section, sfTypeRecord);
  11436. td := type.typeDeclaration;
  11437. IF RefInfo THEN Info(section,"TD") END;
  11438. IF (td # NIL) THEN
  11439. Global.GetSymbolSegmentedName(td,segmentedName);
  11440. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11441. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11442. ELSE
  11443. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11444. END;
  11445. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11446. Symbol(section, tir, 0, offset);
  11447. ELSE
  11448. Address(section, 0);
  11449. END;
  11450. END;
  11451. | type: SyntaxTree.PortType DO
  11452. Char(section, sfTypePORT);
  11453. IF type.direction = SyntaxTree.OutPort THEN
  11454. Char(section, sfOUT)
  11455. ELSE
  11456. Char(section, sfIN)
  11457. END;
  11458. | type: SyntaxTree.ProcedureType DO
  11459. IF ~Indirect(type) THEN
  11460. IF type.isDelegate THEN
  11461. Char(section, sfTypeDelegate);
  11462. ELSE
  11463. Char(section, sfTypeProcedure);
  11464. END;
  11465. parameter := type.firstParameter;
  11466. WHILE(parameter # NIL) DO
  11467. NParameter(parameter, -1);
  11468. parameter := parameter.nextParameter;
  11469. END;
  11470. NType(type.returnType);
  11471. END;
  11472. | type:SyntaxTree.EnumerationType DO
  11473. Char(section, sfTypeENUM);
  11474. | type: SyntaxTree.BasicType DO
  11475. WITH type: SyntaxTree.BooleanType DO
  11476. IF RefInfo THEN Info(section,"Boolean") END;
  11477. Char(section, sfTypeBOOLEAN);
  11478. | type: SyntaxTree.CharacterType DO
  11479. IF type = module.system.characterType THEN
  11480. IF RefInfo THEN Info(section,"CHAR") END;
  11481. Char(section, sfTypeCHAR);
  11482. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11483. IF RefInfo THEN Info(section,"CHAR8") END;
  11484. Char(section, sfTypeCHAR8)
  11485. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11486. IF RefInfo THEN Info(section,"CHAR16") END;
  11487. Char(section, sfTypeCHAR16);
  11488. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11489. IF RefInfo THEN Info(section,"CHAR32") END;
  11490. Char(section, sfTypeCHAR32);
  11491. ELSE
  11492. HALT(100);
  11493. END;
  11494. |type: SyntaxTree.IntegerType DO
  11495. IF type(SyntaxTree.IntegerType).signed THEN
  11496. IF (type = module.system.shortintType) THEN
  11497. IF RefInfo THEN Info(section,"SHORTINT") END;
  11498. Char(section, sfTypeSHORTINT)
  11499. ELSIF (type = module.system.integerType) THEN
  11500. IF RefInfo THEN Info(section,"INTEGER") END;
  11501. Char(section, sfTypeINTEGER)
  11502. ELSIF (type = module.system.longintType) THEN
  11503. IF RefInfo THEN Info(section,"LONGINT") END;
  11504. Char(section, sfTypeLONGINT)
  11505. ELSIF (type = module.system.hugeintType) THEN
  11506. IF RefInfo THEN Info(section,"HUGEINT") END;
  11507. Char(section, sfTypeHUGEINT)
  11508. ELSIF (type = module.system.wordType) THEN
  11509. IF RefInfo THEN Info(section,"WORD") END;
  11510. Char(section, sfTypeWORD)
  11511. ELSIF (type = module.system.longWordType) THEN
  11512. IF RefInfo THEN Info(section,"LONGWORD") END;
  11513. Char(section, sfTypeLONGWORD);
  11514. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11515. IF RefInfo THEN Info(section,"SIGNED8") END;
  11516. Char(section, sfTypeSIGNED8)
  11517. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11518. IF RefInfo THEN Info(section,"SIGNED16") END;
  11519. Char(section, sfTypeSIGNED16)
  11520. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11521. IF RefInfo THEN Info(section,"SIGNED32") END;
  11522. Char(section, sfTypeSIGNED32)
  11523. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11524. IF RefInfo THEN Info(section,"SIGNED64") END;
  11525. Char(section, sfTypeSIGNED64)
  11526. ELSE
  11527. HALT(100);
  11528. END
  11529. ELSE (* unsigned *)
  11530. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11531. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11532. Char(section, sfTypeUNSIGNED8)
  11533. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11534. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11535. Char(section, sfTypeUNSIGNED16)
  11536. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11537. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11538. Char(section, sfTypeUNSIGNED32)
  11539. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11540. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11541. Char(section, sfTypeUNSIGNED64)
  11542. ELSE
  11543. HALT(100)
  11544. END
  11545. END;
  11546. | type: SyntaxTree.FloatType DO
  11547. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11548. IF RefInfo THEN Info(section,"REAL") END;
  11549. Char(section, sfTypeREAL);
  11550. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11551. IF RefInfo THEN Info(section,"LONGREAL") END;
  11552. Char(section, sfTypeLONGREAL);
  11553. ELSE
  11554. HALT(100);
  11555. END;
  11556. |type: SyntaxTree.ComplexType DO
  11557. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11558. IF RefInfo THEN Info(section,"COMPLEX") END;
  11559. Char(section, sfTypeCOMPLEX);
  11560. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11561. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11562. Char(section, sfTypeLONGCOMPLEX);
  11563. ELSE
  11564. HALT(100);
  11565. END;
  11566. |type:SyntaxTree.SetType DO
  11567. IF RefInfo THEN Info(section,"SET") END;
  11568. Char(section, sfTypeSET);
  11569. |type:SyntaxTree.AnyType DO
  11570. IF RefInfo THEN Info(section,"ANY") END;
  11571. Char(section, sfTypeANY);
  11572. |type:SyntaxTree.ObjectType DO
  11573. IF RefInfo THEN Info(section,"OBJECT") END;
  11574. Char(section, sfTypeOBJECT);
  11575. |type:SyntaxTree.ByteType DO
  11576. IF RefInfo THEN Info(section,"BYTE") END;
  11577. Char(section, sfTypeBYTE);
  11578. |type:SyntaxTree.RangeType DO
  11579. IF RefInfo THEN Info(section,"RANGE") END;
  11580. Char(section, sfTypeRANGE)
  11581. |type:SyntaxTree.AddressType DO
  11582. IF RefInfo THEN Info(section,"ADDRESS") END;
  11583. Char(section, sfTypeADDRESS)
  11584. |type:SyntaxTree.SizeType DO
  11585. IF RefInfo THEN Info(section,"SIZE") END;
  11586. Char(section, sfTypeSIZE)
  11587. ELSE
  11588. HALT(100)
  11589. END;
  11590. ELSE HALT(101);
  11591. END;
  11592. END;
  11593. END NType;
  11594. (*
  11595. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11596. *)
  11597. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11598. VAR pos: LONGINT; type: SyntaxTree.Type;
  11599. BEGIN
  11600. IF RefInfo THEN Info(section, "Parameter") END;
  11601. Char(section, sfVariable);
  11602. Size(section, procOffset);
  11603. String0(section, parameter.name);
  11604. type := parameter.type.resolved;
  11605. IF parameter.kind = SyntaxTree.VarParameter THEN
  11606. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11607. ELSE Char(section, sfIndirect)
  11608. END;
  11609. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11610. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11611. Char(section, sfIndirect);
  11612. ELSE
  11613. Char(section, sfRelative);
  11614. END;
  11615. ELSE
  11616. Char(section, sfRelative);
  11617. END;
  11618. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11619. NType(parameter.type);
  11620. END NParameter;
  11621. (*
  11622. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11623. *)
  11624. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11625. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11626. flags: SET;
  11627. BEGIN
  11628. IF procedure.externalName # NIL THEN RETURN END;
  11629. IF RefInfo THEN Info(section, "Procedure") END;
  11630. pos := CurrentIndex();
  11631. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11632. Char(section, sfProcedure);
  11633. Size(section, scopeOffset);
  11634. String0(section,procedure.name);
  11635. s := module.allSections.FindBySymbol(procedure);
  11636. Symbol(section,s,0,0); (* start *)
  11637. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11638. flags := {};
  11639. IF procedureType.isDelegate THEN
  11640. INCL(flags, flagDelegate);
  11641. END;
  11642. IF procedure.isConstructor THEN
  11643. INCL(flags, flagConstructor);
  11644. END;
  11645. Set(section, flags);
  11646. IF RefInfo THEN Info(section, "Parameters") END;
  11647. parameter := procedureType.firstParameter;
  11648. WHILE(parameter # NIL) DO
  11649. NParameter(parameter, pos);
  11650. parameter := parameter.nextParameter;
  11651. END;
  11652. IF procedureType.returnParameter # NIL THEN
  11653. NParameter(procedureType.returnParameter, pos);
  11654. END;
  11655. IF procedureType.selfParameter # NIL THEN
  11656. NParameter(procedureType.selfParameter, pos);
  11657. END;
  11658. IF RefInfo THEN Info(section, "ReturnType") END;
  11659. NType(procedureType.returnType);
  11660. NScope(procedure.procedureScope, pos);
  11661. END NProcedure;
  11662. (*
  11663. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11664. *)
  11665. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11666. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11667. BEGIN
  11668. IF RefInfo THEN Info(section, "Variable") END;
  11669. pos := CurrentIndex();
  11670. Char(section, sfVariable);
  11671. Size(section, scopeOffset);
  11672. String0(section, variable.name);
  11673. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11674. Char(section, sfAbsolute);
  11675. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11676. NamedSymbol(section, sn,variable, 0,0);
  11677. ELSE
  11678. Char(section, sfRelative);
  11679. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11680. END;
  11681. NType(variable.type);
  11682. s := module.allSections.FindBySymbol(variable);
  11683. END NVariable;
  11684. (*
  11685. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11686. *)
  11687. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11688. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11689. BEGIN
  11690. IF typeDeclaration = NIL THEN RETURN END;
  11691. pos := CurrentIndex();
  11692. s := module.allSections.FindBySymbol(typeDeclaration);
  11693. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11694. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11695. Char(section, sfTypeDeclaration);
  11696. Size(section, scopeOffset);
  11697. String0(section, typeDeclaration.name);
  11698. declared := typeDeclaration.declaredType.resolved;
  11699. IF (declared IS SyntaxTree.PointerType) THEN
  11700. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11701. END;
  11702. WITH declared: SyntaxTree.RecordType DO
  11703. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11704. Symbol(section, s, 0, offset);
  11705. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11706. Basic.AppendToSegmentedName(name,".@Info");
  11707. s := module.allSections.FindByName(name);
  11708. IF s # NIL THEN (* does not work for coop *)
  11709. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11710. END;
  11711. NScope(declared.recordScope, pos);
  11712. |declared: SyntaxTree.CellType DO
  11713. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11714. Symbol(section, s, 0, offset);
  11715. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11716. Basic.AppendToSegmentedName(name,".@Info");
  11717. s := module.allSections.FindByName(name);
  11718. IF s # NIL THEN
  11719. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11720. END;
  11721. NScope(declared.cellScope, pos);
  11722. ELSE
  11723. Address(section, 0);
  11724. END;
  11725. END NTypeDeclaration;
  11726. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11727. VAR pos: LONGINT;
  11728. BEGIN
  11729. pos := CurrentIndex();
  11730. Char(section,sfModule);
  11731. Size(section, prevSymbol);
  11732. String0(section, module.name);
  11733. NScope(module.moduleScope, pos);
  11734. END NModule;
  11735. (*
  11736. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11737. *)
  11738. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11739. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11740. BEGIN
  11741. IF scope = NIL THEN RETURN END;
  11742. IF RefInfo THEN Info(section, "Scope") END;
  11743. Char(section, sfScopeBegin);
  11744. variable := scope.firstVariable;
  11745. WHILE (variable # NIL) DO
  11746. NVariable(variable, prevSymbol);
  11747. variable := variable.nextVariable;
  11748. END;
  11749. WITH scope: SyntaxTree.ModuleScope DO
  11750. bodyProcedure := scope.bodyProcedure;
  11751. |scope: SyntaxTree.RecordScope DO
  11752. bodyProcedure := scope.bodyProcedure;
  11753. ELSE
  11754. bodyProcedure := NIL;
  11755. END;
  11756. IF bodyProcedure # NIL THEN
  11757. NProcedure(bodyProcedure, prevSymbol)
  11758. END;
  11759. procedure := scope.firstProcedure;
  11760. WHILE procedure # NIL DO
  11761. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11762. procedure := procedure.nextProcedure;
  11763. END;
  11764. typeDeclaration := scope.firstTypeDeclaration;
  11765. WHILE typeDeclaration # NIL DO
  11766. NTypeDeclaration(typeDeclaration, prevSymbol);
  11767. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11768. END;
  11769. Char(section, sfScopeEnd); (* scope ends *)
  11770. END NScope;
  11771. BEGIN
  11772. NEW(indirectTypes, 32);
  11773. ArrayBlock(section,sizePC,"", FALSE);
  11774. startPC := section.pc;
  11775. NModule(module.module, -1);
  11776. PatchArray(section,sizePC,CurrentIndex());
  11777. END References;
  11778. (*
  11779. Command* = RECORD
  11780. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11781. name*: Name; (* name of the procedure *)
  11782. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11783. entryAdr* : ADDRESS; (* entry address of procedure *)
  11784. END;
  11785. *)
  11786. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11787. VAR
  11788. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11789. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11790. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11791. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11792. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11793. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11794. BEGIN
  11795. RETURN
  11796. (type = NIL) OR
  11797. (type.resolved IS SyntaxTree.RecordType) OR
  11798. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11799. (type.resolved IS SyntaxTree.AnyType);
  11800. END TypeAllowed;
  11801. BEGIN
  11802. numberParameters := procedureType.numberParameters;
  11803. RETURN
  11804. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11805. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11806. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11807. END GetProcedureAllowed;
  11808. PROCEDURE WriteType(type : SyntaxTree.Type);
  11809. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11810. name: Basic.SegmentedName; offset: LONGINT;
  11811. BEGIN
  11812. IF type = NIL THEN
  11813. Address(source,0);
  11814. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11815. Address(source,1);
  11816. ELSE
  11817. type := type.resolved;
  11818. IF type IS SyntaxTree.PointerType THEN
  11819. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11820. END;
  11821. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11822. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11823. name[0] := typeDeclaration.name; name[1] := -1;
  11824. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11825. ASSERT(section # NIL);
  11826. ELSE
  11827. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11828. (* TODO *)
  11829. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11830. END;
  11831. IF implementationVisitor.backend.cooperative THEN
  11832. offset := 0;
  11833. ELSE
  11834. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11835. END;
  11836. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11837. END;
  11838. END WriteType;
  11839. BEGIN
  11840. Info(source, "command array descriptor");
  11841. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11842. numberCommands := 0;
  11843. Info(source, "command array content");
  11844. FOR i := 0 TO module.allSections.Length() - 1 DO
  11845. p := module.allSections.GetSection(i);
  11846. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11847. procedure := p.symbol(SyntaxTree.Procedure);
  11848. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11849. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11850. procedure.GetName(name);
  11851. Name(source,name);
  11852. numberParameters := procedureType.numberParameters;
  11853. (* offset of type of first parameter *)
  11854. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11855. ELSE WriteType(procedureType.firstParameter.type)
  11856. END;
  11857. (* offset of type of return parameter *)
  11858. WriteType(procedureType.returnType);
  11859. (* command name *)
  11860. (* command code offset *)
  11861. Symbol(source,p,0,0);
  11862. INC(numberCommands);
  11863. IF Trace THEN
  11864. D.Ln;
  11865. END;
  11866. END;
  11867. END
  11868. END;
  11869. PatchArray(source,sizePC,numberCommands);
  11870. END CommandArray;
  11871. (* to prevent from double import of different module aliases *)
  11872. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11873. VAR i: SyntaxTree.Import;
  11874. BEGIN
  11875. i := module.module.moduleScope.firstImport;
  11876. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11877. i := i.nextImport;
  11878. END;
  11879. RETURN i = import
  11880. END IsFirstDirectOccurence;
  11881. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11882. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11883. BEGIN
  11884. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11885. ArrayBlock(source,pc,"", FALSE);
  11886. Info(source, "import module array data");
  11887. IF implementationVisitor.backend.cooperative THEN
  11888. offset := 0;
  11889. ELSE
  11890. IF module.system.addressType.sizeInBits = 64 THEN
  11891. (* change this when Heaps.HeapBlock is modified *)
  11892. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11893. ELSE
  11894. (* change this when Heaps.HeapBlock is modified *)
  11895. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11896. END;
  11897. END;
  11898. import := module.module.moduleScope.firstImport;
  11899. numberImports := 0;
  11900. WHILE import # NIL DO
  11901. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11902. Global.GetModuleSegmentedName(import.module,name);
  11903. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11904. NamedSymbol(source, name, NIL, 0, offset);
  11905. INC(numberImports);
  11906. END;
  11907. import := import.nextImport
  11908. END;
  11909. PatchArray(source,pc,numberImports);
  11910. END ImportsArray;
  11911. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11912. VAR
  11913. p: Sections.Section; sizePC, size, i: LONGINT;
  11914. BEGIN
  11915. Info(source, "Type info section");
  11916. size := 0;
  11917. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11918. FOR i := 0 TO module.allSections.Length() - 1 DO
  11919. p := module.allSections.GetSection(i);
  11920. WITH p: IntermediateCode.Section DO
  11921. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11922. Symbol(source,p,EmptyBlockOffset,0);
  11923. INC(size);
  11924. END;
  11925. END
  11926. END;
  11927. PatchArray(source,sizePC,size);
  11928. END TypeInfoSection;
  11929. (*
  11930. ProcTableEntry* = RECORD
  11931. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11932. noPtr*: LONGINT;
  11933. END;
  11934. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11935. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11936. *)
  11937. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11938. VAR
  11939. numberPointers: LONGINT;
  11940. procedure: SyntaxTree.Procedure;
  11941. BEGIN
  11942. Info(section,"pcFrom");
  11943. Symbol(section,procedureSection,0,0);
  11944. Info(section,"pcTo");
  11945. Symbol(section, procedureSection, procedureSection.pc, 0);
  11946. Info(section,"pointer to offsets array");
  11947. Symbol(section, section,section.pc+1,0);
  11948. Info(section,"offsets array");
  11949. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11950. PointerArray(section, procedure.procedureScope, numberPointers);
  11951. END ProcedureDescriptor;
  11952. (* only for tracing, the descriptor is otherwise not complete ! *)
  11953. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11954. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11955. BEGIN
  11956. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11957. name := procedureSection.name;
  11958. Basic.AppendToSegmentedName(name,".@Info");
  11959. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11960. Address(section,0);
  11961. Symbol(section,section,2,0);
  11962. (*
  11963. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11964. descSize: SIZE;
  11965. sentinel: ADDRESS; (* = MPO-4 *)
  11966. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11967. flags*: SET;
  11968. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11969. name*: Name;
  11970. END;
  11971. *)
  11972. Size(section, 0);
  11973. Address(section,0);
  11974. Address(section,0);
  11975. Set(section,{});
  11976. moduleSection := ModuleSection();
  11977. Symbol( section, moduleSection, moduleSection.pc,0);
  11978. IF procedureSection.symbol = NIL THEN
  11979. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11980. ELSE
  11981. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11982. END;
  11983. Name(section, infoName);
  11984. Size(section, 0);
  11985. RETURN section;
  11986. END MakeProcedureDescriptorTag;
  11987. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11988. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11989. BEGIN
  11990. name := procedureSection.name;
  11991. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11992. IF implementationVisitor.backend.cooperative THEN
  11993. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11994. Info(section, "TypeDescriptor");
  11995. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11996. NamedSymbol(dest, name,NIL, 0, 0);
  11997. BaseRecord(dest);
  11998. offset := 0;
  11999. ELSIF CreateProcedureDescInfo THEN
  12000. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12001. Address(dest,0);
  12002. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  12003. offset := dest.pc;
  12004. ELSE
  12005. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  12006. END;
  12007. ProcedureDescriptor(dest, procedureSection);
  12008. Symbol(section, dest, offset, 0);
  12009. END ProcedureDescriptorPointer;
  12010. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  12011. VAR sizePC, i: LONGINT; destination: Sections.Section;
  12012. BEGIN
  12013. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  12014. numberProcs := 0;
  12015. FOR i := 0 TO module.allSections.Length() - 1 DO
  12016. destination := module.allSections.GetSection(i);
  12017. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  12018. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  12019. INC(numberProcs);
  12020. END
  12021. END;
  12022. PatchArray(section, sizePC, numberProcs);
  12023. END ProcedureDescriptorArray;
  12024. (*
  12025. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  12026. VAR
  12027. next*: Module; (** once a module is published, all fields are read-only *)
  12028. name*: Name;
  12029. init, published: BOOLEAN;
  12030. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  12031. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  12032. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  12033. command*: POINTER TO ARRAY OF Command;
  12034. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  12035. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  12036. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  12037. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  12038. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  12039. data*, code*: Bytes;
  12040. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  12041. export*: ExportDesc;
  12042. term*: TerminationHandler;
  12043. exTable*: ExceptionTable;
  12044. noProcs*: LONGINT;
  12045. firstProc*: ADDRESS; <- done by loader
  12046. maxPtrs*: LONGINT;
  12047. crc*: LONGINT;
  12048. *)
  12049. PROCEDURE BasePointer (section: IntermediateCode.Section);
  12050. BEGIN
  12051. Info(section, "cycle");
  12052. Size(section,0);
  12053. Info(section, "references");
  12054. Size(section,0);
  12055. Info(section, "nextMarked");
  12056. Address(section,0);
  12057. Info(section, "nextWatched");
  12058. Address(section,0);
  12059. END BasePointer;
  12060. PROCEDURE BaseObject (section: IntermediateCode.Section);
  12061. BEGIN
  12062. BasePointer(section);
  12063. Info(section, "action");
  12064. Address(section,0);
  12065. Info(section, "monitor");
  12066. Address(section,0);
  12067. END BaseObject;
  12068. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  12069. BEGIN
  12070. BasePointer(section);
  12071. Info(section, "action");
  12072. Address(section,0);
  12073. Info(section, "monitor");
  12074. Address(section,0);
  12075. END BaseRecord;
  12076. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12077. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12078. pooledName: Basic.SegmentedName;
  12079. symbol: SyntaxTree.Symbol;
  12080. BEGIN
  12081. Global.GetModuleName(module.module,name);
  12082. Strings.Append(name,".@Module.@Descriptor");
  12083. Basic.ToSegmentedName(name, pooledName);
  12084. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12085. Symbol(section,descriptorSection,0,0);
  12086. Info(descriptorSection, "descriptor");
  12087. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12088. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12089. Address(descriptorSection,0);
  12090. Global.GetModuleName(module.module,name);
  12091. Strings.Append(name,".@Trace");
  12092. Basic.ToSegmentedName(name, pooledName);
  12093. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12094. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12095. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12096. END ModuleDescriptor;
  12097. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12098. VAR name: ARRAY 128 OF CHAR;
  12099. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12100. symbol: SyntaxTree.Symbol;
  12101. BEGIN
  12102. Global.GetModuleName(module.module,name);
  12103. Strings.Append(name,".@Module");
  12104. Basic.ToSegmentedName(name, pooledName);
  12105. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12106. moduleSection.SetExported(TRUE);
  12107. IF moduleSection.pc = 0 THEN
  12108. IF implementationVisitor.backend.cooperative THEN
  12109. Info(moduleSection, "descriptor");
  12110. ModuleDescriptor(moduleSection);
  12111. BaseObject(moduleSection);
  12112. implementationVisitor.CreateTraceModuleMethod(module.module);
  12113. ELSE
  12114. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12115. Info(moduleSection, "HeapBlock");
  12116. Symbol(moduleSection,moduleSection,2,0);
  12117. Info(moduleSection, "TypeDescriptor");
  12118. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12119. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12120. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12121. END;
  12122. END;
  12123. RETURN moduleSection;
  12124. END ModuleSection;
  12125. PROCEDURE NewModuleInfo();
  12126. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12127. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12128. sectionName: Basic.SectionName;
  12129. CONST MPO=-40000000H;
  12130. BEGIN
  12131. (*
  12132. TypeDesc* = POINTER TO RECORD
  12133. descSize: SIZE;
  12134. sentinel: LONGINT; (* = MPO-4 *)
  12135. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12136. flags*: SET;
  12137. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12138. name*: Name;
  12139. refsOffset: SIZE;
  12140. END;
  12141. *)
  12142. (*name is missing prefixes sometimes*)
  12143. Global.GetModuleSegmentedName(module.module,name);
  12144. Basic.AppendToSegmentedName(name,".@Info");
  12145. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12146. IF ~implementationVisitor.backend.cooperative THEN
  12147. Info(source, "HeapBlock");
  12148. Address(source,0); (* an empty heap block prevents GC marking *)
  12149. Info(source, "TypeDescriptor");
  12150. Address(source,0);
  12151. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12152. END;
  12153. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12154. Address(source,MPO-4);
  12155. Info(source, "type tag pointer");
  12156. Address( source,0);
  12157. Info(source, "type flags");
  12158. flags := {};
  12159. Set( source, flags);
  12160. Info(source, "pointer to module");
  12161. moduleSection := ModuleSection();
  12162. Symbol( source, moduleSection, moduleSection.pc,0);
  12163. Info(source, "type name");
  12164. i := 0;
  12165. sectionName := "@Self";
  12166. (*
  12167. Global.GetSymbolSegmentedName(td,name);
  12168. Basic.SegmentedNameToString(name, sectionName);
  12169. *)
  12170. Name(source,sectionName);
  12171. patchInfoPC := source.pc;
  12172. Size(source, 0);
  12173. END NewModuleInfo;
  12174. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12175. VAR
  12176. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12177. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12178. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12179. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  12180. referenceSectionOffset : LONGINT;
  12181. name: Basic.SegmentedName; offset: LONGINT;
  12182. flags: SET;
  12183. BEGIN
  12184. NewModuleInfo();
  12185. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12186. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12187. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12188. ImportsArray(importSection);
  12189. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12190. CommandArray(commandsSection);
  12191. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12192. ExceptionArray(exceptionSection);
  12193. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12194. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12195. TypeInfoSection(typeInfoSection);
  12196. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12197. referenceSection.SetExported(TRUE);
  12198. References(referenceSection);
  12199. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12200. ProcedureDescriptorArray(procTableSection, numberProcs);
  12201. IF ProtectModulesPointers THEN
  12202. name := "Heaps.AnyPtr";
  12203. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12204. (* set base pointer *)
  12205. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12206. END;
  12207. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12208. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12209. moduleSection := ModuleSection();
  12210. Info(moduleSection, "nextRoot*: RootObject");
  12211. Address(moduleSection,0);
  12212. Info(moduleSection, "next*: Module");
  12213. Address(moduleSection,0);
  12214. Info(moduleSection, "name*: Name");
  12215. Name(moduleSection,moduleName);
  12216. Info(moduleSection, "init, published: BOOLEAN");
  12217. Boolean(moduleSection,FALSE);
  12218. Boolean(moduleSection,FALSE);
  12219. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12220. Boolean(moduleSection,FALSE);
  12221. Boolean(moduleSection,FALSE);
  12222. Info(moduleSection, "refcnt*: LONGINT");
  12223. Longint(moduleSection,0);
  12224. Info(moduleSection, "sb*: ADDRESS");
  12225. Address(moduleSection,0);
  12226. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12227. Address(moduleSection,0);
  12228. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12229. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12230. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12231. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12232. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12233. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12234. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12235. Symbol(moduleSection,importSection,importSectionOffset,0);
  12236. Info(moduleSection, "procTable*: ProcTable");
  12237. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12238. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12239. Address(moduleSection,0);
  12240. Address(moduleSection,0);
  12241. Address(moduleSection,0);
  12242. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12243. Info(moduleSection, "export*: ExportDesc");
  12244. ExportDesc(moduleSection);
  12245. Info(moduleSection, "term*: TerminationHandler");
  12246. Address(moduleSection,0);
  12247. Info(moduleSection, "exTable*: ExceptionTable");
  12248. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12249. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12250. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12251. Info(moduleSection, "crc*: LONGINT");
  12252. patchCRC:= moduleSection.pc;
  12253. Longint(moduleSection, 0); (*! must be implemented *)
  12254. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12255. Info(moduleSection, "body*: ADDRESS");
  12256. Symbol(moduleSection, bodyProc, 0,0);
  12257. Info(moduleSection, "module flags");
  12258. flags := {};
  12259. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12260. Set( moduleSection, flags);
  12261. IF implementationVisitor.backend.cooperative THEN
  12262. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12263. Info(moduleSection, "monitor.owner");
  12264. Address(moduleSection,0);
  12265. Info(moduleSection, "monitor.nestingLevel");
  12266. Address(moduleSection,0);
  12267. Info(moduleSection, "monitor.blockedQueue");
  12268. Address(moduleSection,0); Address(moduleSection,0);
  12269. Info(moduleSection, "monitor.waitingQueue");
  12270. Address(moduleSection,0); Address(moduleSection,0);
  12271. Info(moduleSection, "monitor.waitingSentinel");
  12272. Address(moduleSection,0);
  12273. END;
  12274. END Module;
  12275. PROCEDURE PatchCRC(crc: LONGINT);
  12276. BEGIN
  12277. IF ~simple THEN
  12278. PatchLongint(ModuleSection(), patchCRC, crc);
  12279. END;
  12280. END PatchCRC;
  12281. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12282. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12283. BEGIN
  12284. ArrayBlock(source,pc,"",FALSE);
  12285. Info(source, "pointer offsets array data");
  12286. IF scope IS SyntaxTree.RecordScope THEN
  12287. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12288. ELSIF scope IS SyntaxTree.CellScope THEN
  12289. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12290. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12291. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12292. WHILE variable # NIL DO
  12293. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12294. symbol := module.allSections.FindBySymbol(variable);
  12295. ASSERT(symbol # NIL);
  12296. Pointers(0,symbol, source,variable.type,numberPointers);
  12297. END;
  12298. variable := variable.nextVariable;
  12299. END;
  12300. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12301. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12302. WHILE parameter # NIL DO
  12303. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12304. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12305. END;
  12306. parameter := parameter.nextParameter;
  12307. END;
  12308. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12309. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12310. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12311. IF implementationVisitor.backend.preciseGC THEN
  12312. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12313. END;
  12314. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12315. END;
  12316. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12317. WHILE(variable # NIL) DO
  12318. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12319. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12320. END;
  12321. variable := variable.nextVariable
  12322. END;
  12323. END;
  12324. PatchArray(source,pc,numberPointers);
  12325. END PointerArray;
  12326. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12327. VAR
  12328. name: Basic.SegmentedName;
  12329. section: IntermediateCode.Section;
  12330. BEGIN
  12331. Global.GetSymbolSegmentedName(symbol,name);
  12332. Basic.AppendToSegmentedName(name,suffix);
  12333. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12334. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12335. Info(section, "HeapBlock");
  12336. Address(section,0); (* empty such that GC does not go on traversing *)
  12337. Info(section, suffix);
  12338. Address(section,0);
  12339. pc := section.pc;
  12340. RETURN section;
  12341. END SymbolSection;
  12342. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12343. VAR recordType: SyntaxTree.RecordType;
  12344. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12345. section: Sections.Section; cellType: SyntaxTree.CellType;
  12346. tdInfoOffset: LONGINT;
  12347. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12348. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12349. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12350. sectionName: Basic.SectionName;
  12351. CONST MPO=-40000000H;
  12352. BEGIN
  12353. (*
  12354. TypeDesc* = POINTER TO RECORD
  12355. descSize: SIZE;
  12356. sentinel: LONGINT; (* = MPO-4 *)
  12357. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12358. flags*: SET;
  12359. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12360. name*: Name;
  12361. refsOffset: SIZE;
  12362. END;
  12363. *)
  12364. (* source := module.sections.FindByName(...) *)
  12365. Global.GetSymbolSegmentedName(td,name);
  12366. Basic.AppendToSegmentedName(name,".@Info");
  12367. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12368. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12369. Address(source,0);
  12370. Info(source, "TypeDescriptor");
  12371. Address(source,0);
  12372. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12373. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12374. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12375. Info(source, "type tag pointer");
  12376. Symbol( source, tag, offset, 0);
  12377. Info(source, "type flags");
  12378. flags := {};
  12379. IF isProtected THEN INCL(flags,31) END;
  12380. Set( source, flags);
  12381. Info(source, "pointer to module");
  12382. moduleSection := ModuleSection();
  12383. Symbol( source, moduleSection, moduleSection.pc,0);
  12384. Info(source, "type name");
  12385. i := 0;
  12386. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12387. (*
  12388. Global.GetSymbolSegmentedName(td,name);
  12389. Basic.SegmentedNameToString(name, sectionName);
  12390. *)
  12391. Name(source,sectionName);
  12392. Size(source, 0);
  12393. RETURN source;
  12394. END NewTypeDescriptorInfo;
  12395. PROCEDURE NewTypeDescriptor;
  12396. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12397. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12398. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12399. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12400. CONST MPO=-40000000H;
  12401. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12402. VAR i: LONGINT;
  12403. PROCEDURE Td(record: SyntaxTree.RecordType);
  12404. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12405. BEGIN
  12406. IF record # NIL THEN
  12407. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12408. baseTD := record.typeDeclaration;
  12409. Global.GetSymbolSegmentedName(baseTD,name);
  12410. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12411. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12412. ELSE
  12413. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12414. END;
  12415. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12416. Symbol(source, tir, 0, offset);
  12417. IF reverse THEN Td(record.GetBaseRecord()) END;
  12418. END;
  12419. END Td;
  12420. BEGIN
  12421. Info(source, "tag table");
  12422. baseRecord := recordType;
  12423. i := 0;
  12424. WHILE baseRecord # NIL DO
  12425. INC(i);
  12426. baseRecord := baseRecord.GetBaseRecord();
  12427. END;
  12428. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12429. IF ~reverse THEN Td(recordType) END;
  12430. WHILE i < size DO
  12431. Address(source,0);
  12432. INC(i);
  12433. END;
  12434. IF reverse THEN Td(recordType) END;
  12435. END TdTable;
  12436. PROCEDURE MethodTable(reverse: BOOLEAN);
  12437. VAR i,methods: LONGINT;
  12438. BEGIN
  12439. Info(source, "method table");
  12440. IF recordType # NIL THEN
  12441. methods := recordType.recordScope.numberMethods;
  12442. IF reverse THEN
  12443. FOR i := methods-1 TO 0 BY -1 DO
  12444. procedure := recordType.recordScope.FindMethod(i);
  12445. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12446. NamedSymbol(source, name,procedure, 0,0);
  12447. END;
  12448. ELSE
  12449. FOR i := 0 TO methods-1 DO
  12450. procedure := recordType.recordScope.FindMethod(i);
  12451. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12452. NamedSymbol(source, name,procedure, 0,0);
  12453. END;
  12454. END;
  12455. END;
  12456. END MethodTable;
  12457. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12458. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12459. BEGIN
  12460. Info(source, "method table");
  12461. baseRecord := recordType;
  12462. WHILE baseRecord.baseType # NIL DO
  12463. baseRecord := baseRecord.GetBaseRecord ();
  12464. END;
  12465. GetRecordTypeName (baseRecord, name);
  12466. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12467. IF name = stackFrame THEN
  12468. start := 0;
  12469. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12470. baseRecord := recordType;
  12471. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12472. baseRecord := baseRecord.GetBaseRecord ();
  12473. END;
  12474. IF baseRecord # NIL THEN
  12475. GetRecordTypeName (baseRecord, name);
  12476. IF pointer & ~baseRecord.isObject THEN
  12477. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12478. END;
  12479. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12480. ELSIF recordType.isObject THEN
  12481. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12482. ELSIF pointer THEN
  12483. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12484. ELSE
  12485. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12486. END;
  12487. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12488. Symbol(source, tir, 0, 0);
  12489. start := 0;
  12490. baseRecord := recordType;
  12491. WHILE (baseRecord # NIL) DO
  12492. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12493. baseRecord := baseRecord.GetBaseRecord ();
  12494. END;
  12495. ELSE
  12496. (* explicit trace method: *)
  12497. procedure := recordType.recordScope.FindMethod(0);
  12498. IF ~procedure.isFinalizer THEN
  12499. Global.GetSymbolSegmentedName(procedure, name);
  12500. NamedSymbol(source, name,procedure, 0,0);
  12501. END;
  12502. start := 1;
  12503. END;
  12504. IF (name # stackFrame) & recordType.isObject THEN
  12505. baseRecord := recordType;
  12506. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12507. baseRecord := baseRecord.GetBaseRecord ();
  12508. END;
  12509. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12510. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12511. ELSE
  12512. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12513. END;
  12514. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12515. Symbol(source, tir, 0, 0);
  12516. END;
  12517. methods := recordType.recordScope.numberMethods;
  12518. FOR i := start TO methods-1 DO
  12519. procedure := recordType.recordScope.FindMethod(i);
  12520. IF ~procedure.isFinalizer THEN
  12521. Global.GetSymbolSegmentedName(procedure, name);
  12522. NamedSymbol(source, name,procedure, 0,0);
  12523. END;
  12524. END;
  12525. END CooperativeMethodTable;
  12526. BEGIN
  12527. Global.GetSymbolSegmentedName(td,name);
  12528. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12529. source.SetExported(IsExported(td));
  12530. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12531. IF implementationVisitor.backend.cooperative THEN
  12532. base := NIL;
  12533. baseRecord := recordType.GetBaseRecord();
  12534. IF baseRecord # NIL THEN
  12535. baseTD := baseRecord.typeDeclaration;
  12536. END;
  12537. IF ~recordType.isObject THEN
  12538. Info(source, "parent");
  12539. IF baseRecord # NIL THEN
  12540. Global.GetSymbolSegmentedName(baseTD,name);
  12541. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12542. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12543. ELSE
  12544. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12545. END;
  12546. Symbol(source, tir, 0, 0);
  12547. ELSE
  12548. Address(source,0);
  12549. END;
  12550. Info(source, "record size");
  12551. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12552. CooperativeMethodTable(FALSE);
  12553. base := source;
  12554. Global.GetSymbolSegmentedName(td,name);
  12555. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12556. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12557. source.SetExported(IsExported(td));
  12558. END;
  12559. Info(source, "parent");
  12560. IF baseRecord # NIL THEN
  12561. Global.GetSymbolSegmentedName(baseTD,name);
  12562. sym := baseTD;
  12563. IF ~recordType.isObject THEN
  12564. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12565. sym := NIL;
  12566. END;
  12567. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12568. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12569. ELSE
  12570. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12571. END;
  12572. Symbol(source, tir, 0, 0);
  12573. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12574. Address(source,0);
  12575. ELSE
  12576. IF recordType.isObject THEN
  12577. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12578. ELSE
  12579. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12580. END;
  12581. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12582. Symbol(source, tir, 0, 0);
  12583. END;
  12584. Info(source, "base record descriptor");
  12585. Symbol(source, base, 0, 0);
  12586. CooperativeMethodTable(TRUE);
  12587. IF recordType.hasPointers THEN
  12588. IF ~HasExplicitTraceMethod (recordType) THEN
  12589. implementationVisitor.CreateTraceMethod(recordType);
  12590. END;
  12591. implementationVisitor.CreateResetProcedure(recordType);
  12592. implementationVisitor.CreateAssignProcedure(recordType);
  12593. END;
  12594. ELSIF ~simple THEN
  12595. (*
  12596. MethodEnd = MPO
  12597. ---
  12598. methods (# methods)
  12599. ---
  12600. tags (16)
  12601. ---
  12602. TypeDesc = TypeInfoAdr
  12603. ---
  12604. td adr ---> rec size
  12605. ----
  12606. pointer offsets
  12607. ----
  12608. (padding)
  12609. -----
  12610. empty [2 addresses aligned]
  12611. empty
  12612. empty
  12613. numPtrs
  12614. ---
  12615. pointer offsets
  12616. ---
  12617. *)
  12618. Info(source, "MethodEnd = MPO");
  12619. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12620. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12621. MethodTable(TRUE);
  12622. TdTable(TypeTags, TRUE);
  12623. Info(source, "type descriptor info pointer");
  12624. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12625. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12626. IF (cellType # NIL) THEN
  12627. IF cellType.sizeInBits < 0 THEN
  12628. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12629. END;
  12630. Info(source, "cell size");
  12631. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12632. ELSE
  12633. Info(source, "record size");
  12634. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12635. END;
  12636. Info(source, "pointer offsets pointer");
  12637. padding := 1- source.pc MOD 2;
  12638. Symbol(source, source, source.pc+1+padding,0);
  12639. IF padding >0 THEN
  12640. Info(source, "padding");
  12641. FOR i := 1 TO padding DO Address(source,0) END;
  12642. END;
  12643. IF cellType # NIL THEN
  12644. PointerArray(source, cellType.cellScope, numberPointers);
  12645. ELSE
  12646. PointerArray(source, recordType.recordScope, numberPointers);
  12647. END;
  12648. ELSE
  12649. (*
  12650. simple:
  12651. td adr --> size
  12652. tag(1)
  12653. tag(2)
  12654. tag(3)
  12655. methods ->
  12656. *)
  12657. Info(source, "record size");
  12658. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12659. TdTable(TypeTags, FALSE);
  12660. MethodTable(FALSE);
  12661. END;
  12662. END NewTypeDescriptor;
  12663. BEGIN
  12664. x := x.resolved;
  12665. IF (x IS SyntaxTree.PointerType) THEN
  12666. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12667. END;
  12668. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12669. recordType := x(SyntaxTree.RecordType);
  12670. td := x.typeDeclaration;
  12671. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12672. ASSERT(td # NIL);
  12673. section := module.allSections.FindBySymbol(td); (* TODO *)
  12674. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12675. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12676. NewTypeDescriptor
  12677. END;
  12678. END;
  12679. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12680. cellType := x(SyntaxTree.CellType);
  12681. td := x.typeDeclaration;
  12682. section := module.allSections.FindBySymbol(td); (* TODO *)
  12683. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12684. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12685. NewTypeDescriptor
  12686. END;
  12687. END;
  12688. END
  12689. END CheckTypeDeclaration
  12690. END MetaDataGenerator;
  12691. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12692. VAR
  12693. trace-: BOOLEAN;
  12694. traceString-: SyntaxTree.IdentifierString;
  12695. traceModuleName-: SyntaxTree.IdentifierString;
  12696. profile-: BOOLEAN;
  12697. noRuntimeChecks: BOOLEAN;
  12698. simpleMetaData-: BOOLEAN;
  12699. noAsserts: BOOLEAN;
  12700. optimize-: BOOLEAN;
  12701. cooperative-: BOOLEAN;
  12702. preregisterStatic-: BOOLEAN;
  12703. dump-: Basic.Writer;
  12704. cellsAreObjects: BOOLEAN;
  12705. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12706. experiment: BOOLEAN;
  12707. PROCEDURE &InitIntermediateBackend*;
  12708. BEGIN
  12709. simpleMetaData := FALSE;
  12710. InitBackend;
  12711. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12712. SetTraceModuleName(DefaultTraceModuleName);
  12713. END InitIntermediateBackend;
  12714. (* must be overwritten by actual backend, if parameter registers should be used *)
  12715. PROCEDURE GetParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; VAR register: WORD): BOOLEAN;
  12716. BEGIN
  12717. register := -1;
  12718. RETURN FALSE;
  12719. END GetParameterRegister;
  12720. PROCEDURE ResetParameterRegisters*;
  12721. BEGIN
  12722. END ResetParameterRegisters;
  12723. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12724. VAR
  12725. declarationVisitor: DeclarationVisitor;
  12726. implementationVisitor: ImplementationVisitor;
  12727. module: Sections.Module;
  12728. name, platformName: SyntaxTree.IdentifierString;
  12729. meta: MetaDataGenerator;
  12730. crc: CRC.CRC32Stream;
  12731. BEGIN
  12732. ResetError;
  12733. Global.GetSymbolName(x,name);
  12734. NEW(module,x,system); (* backend structures *)
  12735. Global.GetModuleName(x, name);
  12736. module.SetModuleName(name);
  12737. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  12738. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12739. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12740. declarationVisitor.Module(x,module);
  12741. IF ~meta.simple THEN
  12742. meta.Module(implementationVisitor.moduleBodySection);
  12743. END;
  12744. GetDescription(platformName);
  12745. module.SetPlatformName(platformName);
  12746. NEW(crc);
  12747. module.allSections.WriteRaw(crc);
  12748. crc.Update;
  12749. meta.PatchCRC(crc.GetCRC());
  12750. RETURN module
  12751. END GenerateIntermediate;
  12752. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12753. BEGIN RETURN TRUE
  12754. END SupportedImmediate;
  12755. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12756. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12757. END ProcessSyntaxTreeModule;
  12758. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12759. VAR
  12760. result: Sections.Module;
  12761. traceName: Basic.MessageString;
  12762. BEGIN
  12763. ASSERT(intermediateCodeModule IS Sections.Module);
  12764. result := intermediateCodeModule(Sections.Module);
  12765. IF trace THEN
  12766. traceName := "intermediate code trace: ";
  12767. Strings.Append(traceName,traceString);
  12768. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12769. IF (traceString="") OR (traceString="*") THEN
  12770. result.Dump(dump);
  12771. dump.Update
  12772. ELSE
  12773. Sections.DumpFiltered(dump, result, traceString);
  12774. END
  12775. END;
  12776. RETURN result
  12777. END ProcessIntermediateCodeModule;
  12778. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12779. BEGIN instructionSet := "Intermediate";
  12780. END GetDescription;
  12781. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  12782. BEGIN
  12783. SELF.simpleMetaData := simpleMetaData;
  12784. END SetSimpleMetaData;
  12785. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12786. BEGIN COPY(name, traceModuleName)
  12787. END SetTraceModuleName;
  12788. PROCEDURE DefineOptions*(options: Options.Options);
  12789. BEGIN
  12790. DefineOptions^(options);
  12791. options.Add(0X,"trace",Options.String);
  12792. options.Add(0X,"builtinsModule",Options.String);
  12793. options.Add(0X,"traceModule",Options.String);
  12794. options.Add(0X,"profile",Options.Flag);
  12795. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12796. options.Add(0X,"noAsserts",Options.Flag);
  12797. options.Add(0X,"metaData",Options.String);
  12798. options.Add('o',"optimize", Options.Flag);
  12799. options.Add(0X,"preregisterStatic", Options.Flag);
  12800. options.Add(0X,"cellsAreObjects", Options.Flag);
  12801. options.Add(0X,"preciseGC", Options.Flag);
  12802. options.Add(0X,"trackLeave", Options.Flag);
  12803. options.Add(0X,"writeBarriers", Options.Flag);
  12804. options.Add(0X,"experiment", Options.Flag);
  12805. END DefineOptions;
  12806. PROCEDURE GetOptions*(options: Options.Options);
  12807. VAR name,string: SyntaxTree.IdentifierString;
  12808. BEGIN
  12809. GetOptions^(options);
  12810. trace := options.GetString("trace",traceString);
  12811. profile := options.GetFlag("profile");
  12812. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12813. noAsserts := options.GetFlag("noAsserts");
  12814. cooperative := options.GetFlag("cooperative");
  12815. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12816. simpleMetaData := TRUE
  12817. END;
  12818. IF options.GetString("metaData",string) THEN
  12819. IF string = "simple" THEN simpleMetaData := TRUE
  12820. ELSIF string ="full" THEN simpleMetaData := FALSE
  12821. END;
  12822. END;
  12823. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12824. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12825. optimize := options.GetFlag("optimize");
  12826. preregisterStatic := options.GetFlag("preregisterStatic");
  12827. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12828. preciseGC := options.GetFlag("preciseGC");
  12829. trackLeave := options.GetFlag("trackLeave");
  12830. writeBarriers := options.GetFlag("writeBarriers");
  12831. experiment := options.GetFlag("experiment");
  12832. END GetOptions;
  12833. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12834. BEGIN RETURN SymbolFileFormat.Get()
  12835. END DefaultSymbolFileFormat;
  12836. END IntermediateBackend;
  12837. (* ----------------------------------- register allocation ------------------------------------- *)
  12838. (* register mapping scheme
  12839. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12840. spill offset
  12841. part(n) --> ticket <--> physical register
  12842. spill offset
  12843. *)
  12844. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12845. emptyOperand: IntermediateCode.Operand;
  12846. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12847. statCoopResetVariables: LONGINT;
  12848. statCoopModifyAssignments: LONGINT;
  12849. modifyAssignmentsPC : LONGINT;
  12850. statCoopNilCheck: LONGINT;
  12851. statCoopSwitch: LONGINT;
  12852. statCoopAssignProcedure: LONGINT;
  12853. statCoopTraceMethod: LONGINT;
  12854. statCoopResetProcedure: LONGINT;
  12855. statCoopTraceModule: LONGINT;
  12856. PROCEDURE ResetStatistics*;
  12857. BEGIN
  12858. statCoopResetVariables := 0;
  12859. statCoopModifyAssignments := 0;
  12860. statCoopNilCheck:= 0;
  12861. statCoopSwitch:= 0;
  12862. statCoopAssignProcedure:= 0;
  12863. statCoopTraceMethod:= 0;
  12864. statCoopResetProcedure:= 0;
  12865. statCoopTraceModule:= 0;
  12866. END ResetStatistics;
  12867. PROCEDURE Statistics*;
  12868. BEGIN
  12869. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12870. TRACE(statCoopNilCheck, statCoopSwitch);
  12871. TRACE(statCoopAssignProcedure,
  12872. statCoopTraceMethod,
  12873. statCoopResetProcedure,
  12874. statCoopTraceModule)
  12875. END Statistics;
  12876. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12877. VAR h: LONGINT;
  12878. BEGIN
  12879. WHILE b # 0 DO
  12880. h := a MOD b;
  12881. a := b;
  12882. b := h;
  12883. END;
  12884. RETURN a
  12885. END GCD;
  12886. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12887. BEGIN
  12888. RETURN a*b DIV GCD(a,b)
  12889. END SCM;
  12890. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12891. BEGIN
  12892. (*TRACE(a,b);*)
  12893. IF a = 0 THEN RETURN b
  12894. ELSIF b = 0 THEN RETURN a
  12895. ELSE RETURN SCM(a,b)
  12896. END;
  12897. END CommonAlignment;
  12898. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12899. BEGIN
  12900. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12901. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12902. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12903. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12904. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12905. END
  12906. END PassBySingleReference;
  12907. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12908. BEGIN
  12909. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12910. END PassInRegister;
  12911. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12912. VAR new: RegisterEntry;
  12913. BEGIN
  12914. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12915. IF queue = NIL THEN
  12916. queue := new
  12917. ELSE
  12918. new.next := queue;
  12919. IF queue#NIL THEN queue.prev := new END;
  12920. queue := new
  12921. END;
  12922. END AddRegisterEntry;
  12923. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12924. VAR this: RegisterEntry;
  12925. BEGIN
  12926. this := queue;
  12927. WHILE (this # NIL) & (this.register # register) DO
  12928. this := this.next;
  12929. END;
  12930. IF this = NIL THEN
  12931. RETURN FALSE
  12932. END;
  12933. ASSERT(this # NIL);
  12934. IF this = queue THEN queue := queue.next END;
  12935. IF this.prev # NIL THEN this.prev.next := this.next END;
  12936. IF this.next # NIL THEN this.next.prev := this.prev END;
  12937. RETURN TRUE
  12938. END RemoveRegisterEntry;
  12939. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12940. BEGIN ASSERT(cond);
  12941. END Assert;
  12942. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12943. BEGIN
  12944. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12945. END ReusableRegister;
  12946. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12947. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12948. BEGIN
  12949. procedure := moduleScope.bodyProcedure;
  12950. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12951. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12952. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12953. procedure.SetScope(moduleScope);
  12954. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12955. procedure.SetAccess(SyntaxTree.Hidden);
  12956. moduleScope.SetBodyProcedure(procedure);
  12957. moduleScope.AddProcedure(procedure);
  12958. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12959. END;
  12960. END EnsureBodyProcedure;
  12961. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12962. VAR import: SyntaxTree.Import;
  12963. selfName: SyntaxTree.IdentifierString;
  12964. module: SyntaxTree.Module;
  12965. BEGIN
  12966. scope.ownerModule.GetName(selfName);
  12967. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12968. module := scope.ownerModule
  12969. ELSE
  12970. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12971. IF import = NIL THEN
  12972. RETURN NIL
  12973. ELSIF import.module = NIL THEN
  12974. RETURN NIL
  12975. ELSE module := import.module
  12976. END;
  12977. END;
  12978. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12979. END GetSymbol;
  12980. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12981. BEGIN
  12982. op.mode := mode;
  12983. IntermediateCode.InitOperand(op.op);
  12984. IntermediateCode.InitOperand(op.tag);
  12985. IntermediateCode.InitOperand(op.extra);
  12986. op.dimOffset := 0;
  12987. END InitOperand;
  12988. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12989. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12990. BEGIN RETURN IntermediateCode.GetType(system, type)
  12991. END GetType;
  12992. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12993. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12994. BEGIN
  12995. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12996. (*
  12997. UniqueId(name,module,name,adr);
  12998. *)
  12999. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  13000. constant.SetValue(value);
  13001. constant.SetAccess(SyntaxTree.Hidden);
  13002. module.moduleScope.AddConstant(constant);
  13003. constant.SetScope(module.moduleScope);
  13004. RETURN constant
  13005. END BuildConstant;
  13006. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13007. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  13008. BEGIN
  13009. variable := scope.firstVariable;
  13010. WHILE variable # NIL DO
  13011. IF variable.NeedsTrace() THEN
  13012. RETURN TRUE;
  13013. END;
  13014. variable := variable.nextVariable;
  13015. END;
  13016. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13017. WHILE parameter # NIL DO
  13018. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  13019. RETURN TRUE;
  13020. END;
  13021. parameter := parameter.nextParameter;
  13022. END;
  13023. RETURN FALSE;
  13024. END HasPointers;
  13025. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  13026. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) OR (parameter.type.resolved IS SyntaxTree.MathArrayType));
  13027. END IsVariableParameter;
  13028. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13029. VAR parameter: SyntaxTree.Parameter;
  13030. BEGIN
  13031. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13032. WHILE parameter # NIL DO
  13033. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  13034. IF parameter.movable THEN RETURN TRUE END;
  13035. parameter := parameter.nextParameter;
  13036. END;
  13037. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  13038. END HasVariableParameters;
  13039. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  13040. BEGIN
  13041. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  13042. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  13043. END HasExplicitTraceMethod;
  13044. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  13045. BEGIN
  13046. IF expression.resolved # NIL THEN expression := expression.resolved END;
  13047. IF (expression IS SyntaxTree.IntegerValue) THEN
  13048. val := expression(SyntaxTree.IntegerValue).value;
  13049. RETURN TRUE
  13050. ELSE
  13051. RETURN FALSE
  13052. END;
  13053. END IsIntegerConstant;
  13054. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  13055. BEGIN
  13056. IF val <= 0 THEN RETURN FALSE END;
  13057. exp := 0;
  13058. WHILE ~ODD(val) DO
  13059. val := val DIV 2;
  13060. INC(exp)
  13061. END;
  13062. RETURN val = 1
  13063. END PowerOf2;
  13064. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  13065. VAR procedure: SyntaxTree.Procedure;
  13066. BEGIN
  13067. procedure := record.recordScope.constructor;
  13068. IF procedure = NIL THEN
  13069. record := record.GetBaseRecord();
  13070. IF record # NIL THEN
  13071. procedure := GetConstructor(record)
  13072. END;
  13073. END;
  13074. RETURN procedure;
  13075. END GetConstructor;
  13076. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  13077. BEGIN
  13078. value := SHORT(op.intValue);
  13079. RETURN op.mode = IntermediateCode.ModeImmediate;
  13080. END IsIntegerImmediate;
  13081. (** whether a type strictily is a pointer to record or object type
  13082. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13083. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13084. BEGIN
  13085. IF type = NIL THEN
  13086. RETURN FALSE
  13087. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13088. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13089. ELSE
  13090. RETURN FALSE
  13091. END
  13092. END IsStrictlyPointerToRecord;
  13093. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13094. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13095. END IsUnsafePointer;
  13096. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13097. BEGIN type := type.resolved;
  13098. IF type IS SyntaxTree.PointerType THEN
  13099. type := type(SyntaxTree.PointerType).pointerBase;
  13100. type := type.resolved;
  13101. IF type IS SyntaxTree.RecordType THEN
  13102. recordType := type(SyntaxTree.RecordType);
  13103. RETURN TRUE
  13104. ELSE
  13105. RETURN FALSE
  13106. END
  13107. ELSIF type IS SyntaxTree.RecordType THEN
  13108. recordType := type(SyntaxTree.RecordType);
  13109. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13110. ELSIF type IS SyntaxTree.ObjectType THEN
  13111. RETURN TRUE
  13112. ELSIF type IS SyntaxTree.AnyType THEN
  13113. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13114. ELSE
  13115. RETURN FALSE
  13116. END;
  13117. END IsPointerToRecord;
  13118. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13119. BEGIN
  13120. type := type.resolved;
  13121. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13122. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13123. END IsArrayOfSystemByte;
  13124. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13125. BEGIN
  13126. IF type = NIL THEN RETURN FALSE END;
  13127. type := type.resolved;
  13128. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13129. END IsOpenArray;
  13130. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13131. BEGIN
  13132. IF type = NIL THEN RETURN FALSE END;
  13133. type := type.resolved;
  13134. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13135. END IsSemiDynamicArray;
  13136. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13137. BEGIN
  13138. IF type = NIL THEN RETURN FALSE END;
  13139. type := type.resolved;
  13140. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13141. END IsStaticArray;
  13142. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13143. BEGIN
  13144. IF type = NIL THEN RETURN FALSE END;
  13145. type := type.resolved;
  13146. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13147. END IsStaticMathArray;
  13148. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13149. BEGIN
  13150. WHILE (IsStaticMathArray(type)) DO
  13151. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13152. END;
  13153. RETURN type;
  13154. END StaticMathArrayBaseType;
  13155. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13156. VAR size: LONGINT;
  13157. BEGIN
  13158. size := 1;
  13159. WHILE (IsStaticArray(type)) DO
  13160. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13161. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13162. END;
  13163. RETURN size;
  13164. END StaticArrayNumElements;
  13165. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13166. VAR size: LONGINT;
  13167. BEGIN
  13168. size := 1;
  13169. WHILE (IsStaticMathArray(type)) DO
  13170. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13171. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13172. END;
  13173. RETURN size;
  13174. END StaticMathArrayNumElements;
  13175. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13176. BEGIN
  13177. WHILE (IsStaticArray(type)) DO
  13178. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13179. END;
  13180. RETURN type;
  13181. END StaticArrayBaseType;
  13182. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13183. BEGIN
  13184. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13185. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13186. END;
  13187. RETURN type;
  13188. END ArrayBaseType;
  13189. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13190. BEGIN
  13191. IF type = NIL THEN RETURN FALSE END;
  13192. type := type.resolved;
  13193. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13194. END IsDelegate;
  13195. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13196. VAR i: LONGINT;
  13197. BEGIN
  13198. i := 0; type := type.resolved;
  13199. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13200. INC(i);
  13201. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13202. END;
  13203. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13204. INC(i);
  13205. type := type(SyntaxTree.MathArrayType).arrayBase;
  13206. IF type # NIL THEN type := type.resolved END;
  13207. END;
  13208. RETURN i
  13209. END DynamicDim;
  13210. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13211. BEGIN
  13212. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13213. type := type(SyntaxTree.ArrayType).arrayBase;
  13214. END;
  13215. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13216. type := type(SyntaxTree.MathArrayType).arrayBase;
  13217. END;
  13218. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13219. END StaticSize;
  13220. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13221. BEGIN
  13222. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13223. END IsImmediate;
  13224. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13225. BEGIN
  13226. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13227. END IsAddress;
  13228. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13229. BEGIN
  13230. RETURN (x.mode = IntermediateCode.ModeRegister);
  13231. END IsRegister;
  13232. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13233. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13234. BEGIN
  13235. typeDeclaration := recordType.typeDeclaration;
  13236. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13237. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13238. END GetRecordTypeName;
  13239. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13240. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13241. BEGIN
  13242. parSize := 0;
  13243. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13244. parameter := procedureType.returnParameter;
  13245. INC(parSize,system.SizeOfParameter(parameter));
  13246. parSize := parSize + (-parSize) MOD system.addressSize;
  13247. END;
  13248. parameter :=procedureType.lastParameter;
  13249. WHILE (parameter # NIL) DO
  13250. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13251. INC(parSize, system.addressSize);
  13252. ELSE
  13253. INC(parSize,system.SizeOfParameter(parameter));
  13254. parSize := parSize + (-parSize) MOD system.addressSize;
  13255. END;
  13256. parameter := parameter.prevParameter;
  13257. END;
  13258. IF procedureType.selfParameter # NIL THEN
  13259. parameter := procedureType.selfParameter;
  13260. INC(parSize,system.SizeOfParameter(parameter));
  13261. parSize := parSize + (-parSize) MOD system.addressSize;
  13262. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13263. END; (* method => self pointer *)
  13264. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13265. RETURN ToMemoryUnits(system,parSize)
  13266. END ParametersSize;
  13267. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13268. BEGIN
  13269. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13270. END IsNested;
  13271. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13272. BEGIN
  13273. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13274. scope := scope.outerScope;
  13275. END;
  13276. RETURN scope # NIL;
  13277. END InCellScope;
  13278. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13279. BEGIN
  13280. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13281. END ProcedureParametersSize;
  13282. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13283. VAR dataUnit: LONGINT;
  13284. BEGIN dataUnit := system.dataUnit;
  13285. ASSERT(size MOD system.dataUnit = 0);
  13286. RETURN LONGINT(size DIV system.dataUnit)
  13287. END ToMemoryUnits;
  13288. PROCEDURE Get*(): Backend.Backend;
  13289. VAR backend: IntermediateBackend;
  13290. BEGIN NEW(backend); RETURN backend
  13291. END Get;
  13292. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13293. VAR instruction: IntermediateCode.Instruction;
  13294. BEGIN
  13295. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13296. RETURN instruction
  13297. END Nop;
  13298. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13299. VAR instruction: IntermediateCode.Instruction;
  13300. BEGIN
  13301. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13302. RETURN instruction
  13303. END Mov;
  13304. (* like Mov but ensures that no new register will be allocated for dest *)
  13305. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13306. VAR instruction: IntermediateCode.Instruction;
  13307. BEGIN
  13308. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13309. RETURN instruction
  13310. END MovReplace;
  13311. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13312. VAR instruction: IntermediateCode.Instruction;
  13313. BEGIN
  13314. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13315. RETURN instruction
  13316. END Conv;
  13317. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13318. VAR instruction: IntermediateCode.Instruction;
  13319. BEGIN
  13320. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13321. RETURN instruction
  13322. END Call;
  13323. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13324. VAR op1, op2, op3: IntermediateCode.Operand;
  13325. VAR instruction: IntermediateCode.Instruction;
  13326. BEGIN
  13327. IntermediateCode.InitNumber(op1,pcOffset);
  13328. IntermediateCode.InitNumber(op2,callingConvention);
  13329. IntermediateCode.InitNumber(op3,unwind);
  13330. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13331. RETURN instruction
  13332. END Exit;
  13333. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13334. VAR instruction: IntermediateCode.Instruction;
  13335. BEGIN
  13336. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13337. RETURN instruction
  13338. END Return;
  13339. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13340. VAR instruction: IntermediateCode.Instruction;
  13341. BEGIN
  13342. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13343. RETURN instruction
  13344. END Result;
  13345. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13346. VAR op1: IntermediateCode.Operand;
  13347. VAR instruction: IntermediateCode.Instruction;
  13348. BEGIN
  13349. IntermediateCode.InitNumber(op1,nr);
  13350. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13351. RETURN instruction
  13352. END Trap;
  13353. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13354. VAR instruction: IntermediateCode.Instruction;
  13355. BEGIN
  13356. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13357. RETURN instruction
  13358. END Br;
  13359. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13360. VAR instruction: IntermediateCode.Instruction;
  13361. BEGIN
  13362. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13363. RETURN instruction
  13364. END Breq;
  13365. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13366. VAR instruction: IntermediateCode.Instruction;
  13367. BEGIN
  13368. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13369. RETURN instruction
  13370. END Brne;
  13371. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13372. VAR instruction: IntermediateCode.Instruction;
  13373. BEGIN
  13374. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13375. RETURN instruction
  13376. END Brge;
  13377. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13378. VAR instruction: IntermediateCode.Instruction;
  13379. BEGIN
  13380. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13381. RETURN instruction
  13382. END Brlt;
  13383. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13384. VAR instruction: IntermediateCode.Instruction;
  13385. BEGIN
  13386. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13387. RETURN instruction
  13388. END Pop;
  13389. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13390. VAR instruction: IntermediateCode.Instruction;
  13391. BEGIN
  13392. ASSERT(op.mode # IntermediateCode.Undefined);
  13393. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13394. RETURN instruction
  13395. END Push;
  13396. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13397. VAR instruction: IntermediateCode.Instruction;
  13398. BEGIN
  13399. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13400. RETURN instruction
  13401. END Neg;
  13402. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13403. VAR instruction: IntermediateCode.Instruction;
  13404. BEGIN
  13405. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13406. RETURN instruction
  13407. END Not;
  13408. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13409. VAR instruction: IntermediateCode.Instruction;
  13410. BEGIN
  13411. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13412. RETURN instruction
  13413. END Abs;
  13414. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13415. VAR instruction: IntermediateCode.Instruction;
  13416. BEGIN
  13417. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13418. ASSERT(~IsImmediate(instruction.op1));
  13419. RETURN instruction
  13420. END Mul;
  13421. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13422. VAR instruction: IntermediateCode.Instruction;
  13423. BEGIN
  13424. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13425. RETURN instruction
  13426. END Div;
  13427. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13428. VAR instruction: IntermediateCode.Instruction;
  13429. BEGIN
  13430. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13431. RETURN instruction
  13432. END Mod;
  13433. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13434. VAR instruction: IntermediateCode.Instruction;
  13435. BEGIN
  13436. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13437. RETURN instruction
  13438. END Sub;
  13439. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13440. VAR instruction: IntermediateCode.Instruction;
  13441. BEGIN
  13442. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13443. RETURN instruction
  13444. END Add;
  13445. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13446. VAR instruction: IntermediateCode.Instruction;
  13447. BEGIN
  13448. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13449. RETURN instruction
  13450. END And;
  13451. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13452. VAR instruction: IntermediateCode.Instruction;
  13453. BEGIN
  13454. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13455. RETURN instruction
  13456. END Or;
  13457. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13458. VAR instruction: IntermediateCode.Instruction;
  13459. BEGIN
  13460. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13461. RETURN instruction
  13462. END Xor;
  13463. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13464. VAR instruction: IntermediateCode.Instruction;
  13465. BEGIN
  13466. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13467. RETURN instruction
  13468. END Shl;
  13469. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13470. VAR instruction: IntermediateCode.Instruction;
  13471. BEGIN
  13472. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13473. RETURN instruction
  13474. END Shr;
  13475. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13476. VAR instruction: IntermediateCode.Instruction;
  13477. BEGIN
  13478. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13479. RETURN instruction
  13480. END Rol;
  13481. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13482. VAR instruction: IntermediateCode.Instruction;
  13483. BEGIN
  13484. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13485. RETURN instruction
  13486. END Ror;
  13487. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13488. VAR instruction: IntermediateCode.Instruction;
  13489. BEGIN
  13490. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13491. RETURN instruction
  13492. END Cas;
  13493. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13494. VAR instruction: IntermediateCode.Instruction;
  13495. BEGIN
  13496. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  13497. ASSERT(~IntermediateCode.IsVectorRegister(src));
  13498. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13499. RETURN instruction
  13500. END Copy;
  13501. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13502. VAR instruction: IntermediateCode.Instruction;
  13503. BEGIN
  13504. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13505. RETURN instruction
  13506. END Fill;
  13507. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13508. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13509. BEGIN
  13510. string := IntermediateCode.String(s);
  13511. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13512. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13513. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13514. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13515. RETURN instruction
  13516. END Asm;
  13517. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13518. VAR instruction: IntermediateCode.Instruction;
  13519. BEGIN
  13520. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13521. RETURN instruction
  13522. END Data;
  13523. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13524. VAR instruction: IntermediateCode.Instruction;
  13525. BEGIN
  13526. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13527. IntermediateCode.SetSubType(instruction, subtype);
  13528. RETURN instruction
  13529. END SpecialInstruction;
  13530. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13531. VAR op1: IntermediateCode.Operand;
  13532. VAR instruction: IntermediateCode.Instruction;
  13533. BEGIN
  13534. (*! generate a warning if size exceeds a certain limit *)
  13535. (*
  13536. ASSERT(bytes < 1000000); (* sanity check *)
  13537. *)
  13538. ASSERT(0 <= units); (* sanity check *)
  13539. IntermediateCode.InitNumber(op1,units);
  13540. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13541. RETURN instruction
  13542. END Reserve;
  13543. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13544. VAR op1: IntermediateCode.Operand;
  13545. VAR instruction: IntermediateCode.Instruction;
  13546. BEGIN
  13547. IntermediateCode.InitNumber(op1,position.start);
  13548. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13549. RETURN instruction
  13550. END LabelInstruction;
  13551. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13552. VAR pc: LONGINT;
  13553. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13554. BEGIN
  13555. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13556. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13557. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13558. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13559. IF instr.op1.type.form = IntermediateCode.Float THEN
  13560. RETURN instr.op1.floatValue = op.floatValue
  13561. ELSE
  13562. RETURN instr.op1.intValue = op.intValue
  13563. END;
  13564. END ProvidesValue;
  13565. BEGIN
  13566. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13567. pc := 0;
  13568. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13569. INC(pc);
  13570. END;
  13571. IF pc = data.pc THEN
  13572. data.Emit(Data(Basic.invalidPosition,vop));
  13573. END;
  13574. RETURN pc
  13575. END EnterImmediate;
  13576. PROCEDURE Init;
  13577. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13578. BEGIN
  13579. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13580. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13581. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13582. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13583. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13584. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13585. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13586. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13587. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13588. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13589. IntermediateCode.InitOperand(emptyOperand);
  13590. FOR i := 0 TO NumberSystemCalls-1 DO
  13591. name := "@SystemCall";
  13592. Basic.AppendNumber(name,i);
  13593. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13594. END;
  13595. END Init;
  13596. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13597. BEGIN
  13598. RETURN (symbol # NIL) & symbol.NeedsSection();
  13599. END IsExported;
  13600. BEGIN
  13601. Init;
  13602. END FoxIntermediateBackend.
  13603. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13604. # Release.Build --path="/temp/obg/" Win32 ~
  13605. # Linker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Builtins Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection Loader BootConsole ~
  13606. FStols.CloseFiles A2Z.exe ~
  13607. System.FreeDownTo FoxIntermediateBackend ~
  13608. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13609. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13610. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13611. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13612. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13613. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13614. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13615. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13616. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13617. GenericLinker.Mod Loader.Mod BootConsole.Mod