FoxIntermediateBackend.Mod 585 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685146861468714688146891469014691146921469314694146951469614697146981469914700147011470214703147041470514706147071470814709147101471114712147131471414715147161471714718147191472014721147221472314724147251472614727147281472914730147311473214733147341473514736147371473814739147401474114742147431474414745147461474714748147491475014751147521475314754147551475614757147581475914760147611476214763147641476514766147671476814769147701477114772147731477414775147761477714778147791478014781147821478314784147851478614787147881478914790147911479214793147941479514796147971479814799148001480114802148031480414805148061480714808148091481014811148121481314814148151481614817148181481914820148211482214823148241482514826148271482814829148301483114832148331483414835148361483714838148391484014841148421484314844148451484614847148481484914850148511485214853148541485514856148571485814859148601486114862148631486414865148661486714868148691487014871148721487314874148751487614877148781487914880148811488214883148841488514886148871488814889148901489114892148931489414895148961489714898148991490014901149021490314904149051490614907149081490914910149111491214913149141491514916149171491814919149201492114922149231492414925149261492714928149291493014931149321493314934149351493614937149381493914940149411494214943149441494514946149471494814949
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, 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, SyntaxTree.DarwinCCallingConvention};
  96. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, 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, Diagnostics.Invalid, s);
  167. END Error;
  168. PROCEDURE Type(x: SyntaxTree.Type);
  169. BEGIN
  170. x.Accept(SELF);
  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 implementationVisitor.newObjectFile & ((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. registerNumber: LONGINT;
  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. PROCEDURE Signature;
  522. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  523. BEGIN
  524. procedureType := x.type(SyntaxTree.ProcedureType);
  525. returnType := procedureType.returnType;
  526. IF returnType # NIL THEN
  527. meta.CheckTypeDeclaration(returnType)
  528. END;
  529. parameter := procedureType.firstParameter;
  530. WHILE parameter # NIL DO
  531. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  532. parameter := parameter.nextParameter;
  533. END;
  534. END Signature;
  535. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  536. VAR result: BOOLEAN;
  537. BEGIN
  538. result := FALSE;
  539. IF x = SyntaxTree.invalidExpression THEN
  540. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  541. result := TRUE;
  542. value := x.resolved(SyntaxTree.IntegerValue).value;
  543. ELSE
  544. Error(x.position,"expression is not an integer constant");
  545. END;
  546. RETURN result;
  547. END CheckIntegerValue;
  548. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  549. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  550. BEGIN
  551. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  552. WHILE (this # NIL) & (this.identifier # id) DO
  553. this := this.nextModifier;
  554. END;
  555. IF this # NIL THEN
  556. IF this.expression = NIL THEN
  557. Error(this.position,"expected expression value");
  558. ELSIF CheckIntegerValue(this.expression,value) THEN
  559. END;
  560. RETURN TRUE
  561. ELSE RETURN FALSE
  562. END;
  563. END HasValue;
  564. CONST DefaultDataMemorySize=512;
  565. BEGIN
  566. IF x.externalName # NIL THEN RETURN END;
  567. (*
  568. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  569. *)
  570. (* code section for this procedure *)
  571. position := x.position.start;
  572. scope := x.procedureScope;
  573. prevScope := currentScope;
  574. currentScope := scope;
  575. procedureType := x.type(SyntaxTree.ProcedureType);
  576. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  577. implementationVisitor.temporaries.Clear;
  578. implementationVisitor.usedRegisters := NIL;
  579. implementationVisitor.registerUsageCount.Init;
  580. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  581. IF (scope.body # NIL) & (x.isInline) THEN
  582. inline := TRUE;
  583. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  584. ir.SetExported(IsExported(x));
  585. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  586. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  587. IF backend.cellsAreObjects THEN
  588. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  589. ir.SetExported(IsExported(x));
  590. ELSE
  591. RETURN; (* cellnet cannot be compiled for final static hardware *)
  592. END;
  593. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  594. inline := FALSE;
  595. AddBodyCallStub(x);
  596. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  597. ir.SetExported(IsExported(x));
  598. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  599. inline := FALSE;
  600. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  601. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  602. AddBodyCallStub(x);
  603. AddStackAllocation(x,memorySize);
  604. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  605. ir.SetExported(IsExported(x));
  606. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  607. inline := FALSE;
  608. Parameters(procedureType.firstParameter);
  609. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  610. ir.SetExported(IsExported(x));
  611. ELSE
  612. inline := FALSE;
  613. IF x.isEntry OR x.isExit THEN
  614. IF x.isEntry THEN
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  616. ELSE
  617. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  618. END;
  619. ir.SetExported(TRUE);
  620. ELSE
  621. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  622. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  623. END;
  624. END;
  625. callingConvention := procedureType.callingConvention;
  626. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  627. parametersSize := ProcedureParametersSize(backend.system,x);
  628. ELSE
  629. parametersSize := 0;
  630. END;
  631. IF scope.body # NIL THEN
  632. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  633. registerNumber := 0;
  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. registerParameters := backend.NumberParameterRegisters(callingConvention);
  651. (* assumption: registers are passed left to right and left parameters are in registers *)
  652. formalParameter := procedureType.firstParameter;
  653. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  654. IF ~PassInRegister(formalParameter, callingConvention) THEN
  655. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  656. ELSE
  657. IF formalParameter.type.IsRecordType() THEN
  658. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  659. type := addressType;
  660. ELSE
  661. type := GetType(system, formalParameter.type);
  662. END;
  663. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  664. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  665. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  666. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  667. implementationVisitor.ReleaseIntermediateOperand(src);
  668. INC(registerNumber);
  669. formalParameter := formalParameter.nextParameter;
  670. END;
  671. END;
  672. END;
  673. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  674. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize),registerNumber);
  675. END;
  676. pc := ir.pc-1;
  677. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  678. registerParameters := backend.NumberParameterRegisters(callingConvention);
  679. (* assumption: registers are passed left to right and left parameters are in registers *)
  680. formalParameter := procedureType.firstParameter;
  681. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  682. IF ~PassInRegister(formalParameter, callingConvention) THEN
  683. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  684. ELSE
  685. IF formalParameter.type.IsRecordType() THEN
  686. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  687. type := addressType;
  688. ELSE
  689. type := GetType(system, formalParameter.type);
  690. END;
  691. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  692. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  693. implementationVisitor.currentScope := currentScope;
  694. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  695. formalParameter.SetOffset(variable.offsetInBits);
  696. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  697. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  698. implementationVisitor.ReleaseIntermediateOperand(src);
  699. INC(registerNumber);
  700. formalParameter := formalParameter.nextParameter;
  701. END;
  702. END;
  703. END;
  704. END;
  705. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  706. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  707. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  708. IF scope.lastVariable # NIL THEN
  709. stackSize := scope.lastVariable.offsetInBits;
  710. IF stackSize <0 THEN stackSize := -stackSize END;
  711. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  712. END;
  713. END;
  714. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  715. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  716. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  717. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  718. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  719. ir.EmitAt(pc,Push(size));
  720. implementationVisitor.StaticCallOperand(result,procedure);
  721. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  722. END;
  723. *)
  724. END;
  725. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  726. IF stackSize > 0 THEN
  727. IF (stackSize MOD system.addressSize = 0) THEN
  728. null := IntermediateCode.Immediate(addressType,0);
  729. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  730. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  731. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  732. ELSE
  733. null := IntermediateCode.Immediate(int8,0);
  734. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  735. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  736. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  737. END;
  738. (*! should potentially be called by backend -- enter might initialize
  739. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  740. *)
  741. END;
  742. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  743. parametersSize := ProcedureParametersSize(backend.system,x);
  744. ELSE
  745. parametersSize := 0;
  746. END;
  747. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  748. finalizer := FALSE;
  749. IF backend.cooperative & x.isFinalizer THEN
  750. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  751. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  752. GetRecordTypeName(recordType,name);
  753. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  754. END;
  755. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  756. IF backend.cooperative THEN
  757. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  758. IF implementationVisitor.profile & ~isModuleBody THEN
  759. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  760. END;
  761. ELSE
  762. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  763. END;
  764. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  765. IF finalizer THEN
  766. IF backend.hasLinkRegister THEN
  767. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  768. END;
  769. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  770. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  771. ir.Emit(Br(x.position,dest));
  772. ELSE
  773. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  774. END;
  775. ELSE
  776. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  777. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  778. END;
  779. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  780. IF backend.cooperative THEN
  781. IF HasPointers (scope) THEN
  782. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  783. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  784. ir.Emit(Result(x.position, res));
  785. ir.Emit(Push(x.position, res));
  786. implementationVisitor.ResetVariables(scope);
  787. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  788. ir.Emit(Pop(x.position, res));
  789. ir.Emit(Return(x.position, res));
  790. ELSE
  791. implementationVisitor.ResetVariables(scope);
  792. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  793. END;
  794. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  795. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  796. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  797. ir.Emit(Result(x.position, res));
  798. ir.Emit(Push(x.position, res));
  799. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  800. ir.Emit(Pop(x.position, res));
  801. ir.Emit(Return(x.position, res));
  802. ELSE
  803. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  804. END;
  805. END;
  806. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  807. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  808. ELSE
  809. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  810. ir.Emit(Nop(x.position));
  811. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  812. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  813. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  814. END;
  815. END;
  816. END
  817. END;
  818. ELSE (* force body for procedures *)
  819. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0,0);
  820. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  821. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  822. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  823. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  824. END;
  825. Scope(scope);
  826. Signature;
  827. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  828. currentScope := prevScope;
  829. END Procedure;
  830. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  831. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  832. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  833. BEGIN
  834. ASSERT (bodyProcedure # NIL);
  835. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  836. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  837. procedure.SetScope(bodyProcedure.scope);
  838. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  839. procedure.SetAccess(SyntaxTree.Hidden);
  840. Global.GetSymbolSegmentedName (procedure,name);
  841. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  842. ir.SetExported(TRUE);
  843. Global.GetSymbolSegmentedName (bodyProcedure,name);
  844. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  845. implementationVisitor.currentScope := module.module.moduleScope;
  846. implementationVisitor.section := ir;
  847. implementationVisitor.PushSelfPointer();
  848. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  849. ELSIF backend.preregisterStatic THEN
  850. implementationVisitor.currentScope := module.module.moduleScope;
  851. implementationVisitor.section := ir;
  852. implementationVisitor.PushSelfPointer();
  853. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  854. ELSE
  855. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  856. ir.Emit(Call(bodyProcedure.position,op, 0));
  857. END;
  858. END AddBodyCallStub;
  859. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  860. VAR name: Basic.SegmentedName;
  861. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  862. BEGIN
  863. Global.GetSymbolSegmentedName (symbol,name);
  864. Basic.RemoveSuffix(name);
  865. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  866. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  867. ir.SetExported(TRUE);
  868. IntermediateCode.InitImmediate(op,addressType,initStack);
  869. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  870. END AddStackAllocation;
  871. (** entry function to visit a complete module *)
  872. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  873. VAR
  874. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  875. hasDynamicOperatorDeclarations: BOOLEAN;
  876. operator: SyntaxTree.Operator;
  877. import: SyntaxTree.Import;
  878. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  879. BEGIN
  880. type := type.resolved;
  881. IF type IS SyntaxTree.RecordType THEN
  882. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  883. ELSIF (type IS SyntaxTree.ArrayType) THEN
  884. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  885. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  886. END;
  887. ELSIF type IS SyntaxTree.MathArrayType THEN
  888. WITH type: SyntaxTree.MathArrayType DO
  889. IF type.form = SyntaxTree.Open THEN
  890. RETURN TRUE
  891. ELSIF type.form = SyntaxTree.Static THEN
  892. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  893. END;
  894. END;
  895. END;
  896. RETURN FALSE
  897. END TypeNeedsInitialization;
  898. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  899. VAR variable: SyntaxTree.Variable;
  900. BEGIN
  901. variable := scope.firstVariable;
  902. WHILE variable # NIL DO
  903. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  904. IF variable.initializer # NIL THEN RETURN TRUE END;
  905. variable := variable.nextVariable;
  906. END;
  907. RETURN FALSE
  908. END ScopeNeedsInitialization;
  909. BEGIN
  910. ASSERT(x # NIL); ASSERT(module # NIL);
  911. SELF.module := module;
  912. (* add import names to the generated Sections.Module *)
  913. import := x.moduleScope.firstImport;
  914. WHILE import # NIL DO
  915. import.module.GetName(idstr);
  916. module.imports.AddName(idstr);
  917. import := import.nextImport
  918. END;
  919. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  920. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  921. moduleSelf := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@moduleSelf"));
  922. moduleSelf.SetType(system.anyType);
  923. moduleSelf.SetScope(x.moduleScope);
  924. moduleSelf.SetUntraced(TRUE);
  925. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  926. ir.SetExported(TRUE);
  927. IntermediateCode.InitImmediate(op,addressType,0);
  928. ir.Emit(Data(Basic.invalidPosition,op));
  929. END;
  930. implementationVisitor.module := module;
  931. implementationVisitor.moduleScope := x.moduleScope;
  932. implementationVisitor.moduleSelf := moduleSelf;
  933. implementationVisitor.canBeLoaded := TRUE;
  934. meta.SetModule(module);
  935. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  936. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  937. END;
  938. IF backend.profile THEN
  939. EnsureBodyProcedure(x.moduleScope);
  940. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  941. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  942. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  943. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  944. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  945. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  946. Global.GetModuleName(module.module,idstr);
  947. implementationVisitor.ProfilerAddModule(idstr);
  948. implementationVisitor.numberProcedures := 0;
  949. END;
  950. implementationVisitor.profile := backend.profile;
  951. (* check if there is at least one dynamic operator locally defined *)
  952. hasDynamicOperatorDeclarations := FALSE;
  953. operator := x.moduleScope.firstOperator;
  954. WHILE operator # NIL DO
  955. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  956. operator := operator.nextOperator
  957. END;
  958. (* add operator initialization code section *)
  959. IF hasDynamicOperatorDeclarations THEN
  960. EnsureBodyProcedure(x.moduleScope);
  961. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  962. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  963. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  964. END;
  965. Scope(x.moduleScope);
  966. IF hasDynamicOperatorDeclarations THEN
  967. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  968. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  969. END;
  970. IF backend.profile THEN
  971. implementationVisitor.ProfilerPatchInit;
  972. END;
  973. END Module;
  974. END DeclarationVisitor;
  975. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  976. RegisterUsageCount*=OBJECT
  977. VAR used: UsedArray; count: LONGINT;
  978. PROCEDURE &Init;
  979. VAR i: LONGINT;
  980. BEGIN
  981. count := 0;
  982. IF used = NIL THEN NEW(used,64); END;
  983. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  984. END Init;
  985. PROCEDURE Grow;
  986. VAR new: UsedArray; size,i: LONGINT;
  987. BEGIN
  988. size := LEN(used)*2;
  989. NEW(new,size);
  990. FOR i := 0 TO LEN(used)-1 DO
  991. new[i].count := used[i].count;
  992. new[i].type := used[i].type;
  993. new[i].map := used[i].map
  994. END;
  995. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  996. used := new
  997. END Grow;
  998. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  999. BEGIN
  1000. INC(count);
  1001. IF count = LEN(used) THEN Grow END;
  1002. used[count].type := type;
  1003. used[count].class := class;
  1004. used[count].map := count;
  1005. RETURN count;
  1006. END Next;
  1007. PROCEDURE IncUse(register: LONGINT);
  1008. BEGIN
  1009. INC(used[register].count);
  1010. (*
  1011. IF (register = 1) & (count > 30) THEN
  1012. D.TraceBack;
  1013. END;
  1014. *)
  1015. END IncUse;
  1016. PROCEDURE DecUse(register: LONGINT);
  1017. BEGIN
  1018. DEC(used[register].count);
  1019. END DecUse;
  1020. PROCEDURE Map(register: LONGINT): LONGINT;
  1021. VAR map : LONGINT;
  1022. BEGIN
  1023. IF register > 0 THEN
  1024. map := used[register].map;
  1025. WHILE register # map DO register := map; map := used[register].map END;
  1026. END;
  1027. RETURN register
  1028. END Map;
  1029. PROCEDURE Use(register: LONGINT): LONGINT;
  1030. BEGIN
  1031. IF register< LEN(used) THEN
  1032. RETURN used[register].count
  1033. ELSE
  1034. RETURN 0
  1035. END
  1036. END Use;
  1037. END RegisterUsageCount;
  1038. RegisterEntry = POINTER TO RECORD
  1039. prev,next: RegisterEntry;
  1040. register: LONGINT;
  1041. registerClass: IntermediateCode.RegisterClass;
  1042. type: IntermediateCode.Type;
  1043. END;
  1044. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1045. Variables = OBJECT (Basic.List)
  1046. VAR
  1047. inUse: VariableUse;
  1048. registerIndex: LONGINT;
  1049. nameIndex: LONGINT;
  1050. PROCEDURE & Init;
  1051. VAR i: LONGINT;
  1052. BEGIN
  1053. InitList(16);
  1054. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1055. registerIndex := 1024;
  1056. nameIndex := 0;
  1057. END Init;
  1058. PROCEDURE Clear*;
  1059. VAR i: LONGINT;
  1060. BEGIN
  1061. Clear^;
  1062. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1063. registerIndex := 1024;
  1064. nameIndex := 0;
  1065. END Clear;
  1066. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1067. VAR string: SyntaxTree.IdentifierString ;
  1068. BEGIN
  1069. COPY("@hiddenIRVar",string);
  1070. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1071. RETURN SyntaxTree.NewIdentifier(string);
  1072. END GetUID;
  1073. PROCEDURE GetUsage(VAR use: VariableUse);
  1074. BEGIN
  1075. use := inUse;
  1076. END GetUsage;
  1077. PROCEDURE SetUsage(CONST use: VariableUse);
  1078. BEGIN
  1079. inUse := use;
  1080. END SetUsage;
  1081. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1082. VAR any: ANY;
  1083. BEGIN
  1084. any := Get(i);
  1085. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1086. END GetVariable;
  1087. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1088. BEGIN
  1089. Set(pos, v);
  1090. END SetVariable;
  1091. PROCEDURE Occupy(pos: LONGINT);
  1092. BEGIN
  1093. INCL(inUse[pos DIV 32], pos MOD 32);
  1094. END Occupy;
  1095. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1096. BEGIN
  1097. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1098. END Occupied;
  1099. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1100. BEGIN
  1101. Occupy(Length());
  1102. Add(v);
  1103. END AddVariable;
  1104. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1105. BEGIN
  1106. t1 := t1.resolved;
  1107. t2 := t2.resolved;
  1108. (*RETURN t1.SameType(t2); *)
  1109. RETURN
  1110. (t1.SameType(t2))
  1111. OR
  1112. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1113. OR
  1114. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1115. OR
  1116. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1117. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1118. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1119. OR
  1120. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1121. (DynamicDim(t1) = DynamicDim(t2))
  1122. );
  1123. END CompatibleType;
  1124. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1125. VAR var : SyntaxTree.Variable; i: LONGINT;
  1126. BEGIN
  1127. pos := Length();
  1128. FOR i := 0 TO pos-1 DO
  1129. IF ~(Occupied(i)) THEN
  1130. var := GetVariable(i);
  1131. IF CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1132. pos := i;
  1133. Occupy(i);
  1134. RETURN var;
  1135. END;
  1136. END;
  1137. END;
  1138. RETURN NIL
  1139. END GetFreeVariable;
  1140. END Variables;
  1141. SymbolMap = POINTER TO RECORD
  1142. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1143. isAddress: BOOLEAN;
  1144. END;
  1145. SymbolMapper = OBJECT
  1146. VAR
  1147. first: SymbolMap;
  1148. PROCEDURE & Init;
  1149. BEGIN
  1150. first := NIL;
  1151. END Init;
  1152. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1153. VAR new: SymbolMap;
  1154. BEGIN
  1155. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1156. new.next := first; first := new;
  1157. END Add;
  1158. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1159. VAR s: SymbolMap;
  1160. BEGIN
  1161. s := first;
  1162. WHILE (s # NIL) & (s.this # this) DO
  1163. s := s.next
  1164. END;
  1165. RETURN s
  1166. END Get;
  1167. END SymbolMapper;
  1168. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1169. VAR
  1170. system: Global.System;
  1171. section: IntermediateCode.Section;
  1172. module: Sections.Module;
  1173. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1174. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1175. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1176. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1177. checker: SemanticChecker.Checker;
  1178. backend: IntermediateBackend;
  1179. meta: MetaDataGenerator;
  1180. position: Position;
  1181. moduleSelf: SyntaxTree.Variable;
  1182. (* variables for hand over of variables / temporary state *)
  1183. currentScope: SyntaxTree.Scope;
  1184. constantDeclaration : SyntaxTree.Symbol;
  1185. result: Operand; (* result of the most recent expression / statement *)
  1186. destination: IntermediateCode.Operand;
  1187. arrayDestinationTag: IntermediateCode.Operand;
  1188. arrayDestinationDimension:LONGINT;
  1189. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1190. conditional: BOOLEAN;
  1191. trueLabel, falseLabel, exitLabel: Label;
  1192. locked: BOOLEAN;
  1193. (*
  1194. usedRegisters: Registers;
  1195. *)
  1196. registerUsageCount: RegisterUsageCount;
  1197. usedRegisters: RegisterEntry;
  1198. (* useful operands and types *)
  1199. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1200. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1201. commentPrintout: Printout.Printer;
  1202. dump: Streams.Writer;
  1203. tagsAvailable : BOOLEAN;
  1204. supportedInstruction: SupportedInstructionProcedure;
  1205. supportedImmediate: SupportedImmediateProcedure;
  1206. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1207. emitLabels: BOOLEAN;
  1208. builtinsModuleName : SyntaxTree.IdentifierString;
  1209. newObjectFile: BOOLEAN;
  1210. indexCounter: LONGINT;
  1211. profile: BOOLEAN;
  1212. profileId, profileInit: IntermediateCode.Section;
  1213. profileInitPatchPosition: LONGINT;
  1214. numberProcedures: LONGINT;
  1215. procedureResultDesignator : SyntaxTree.Designator;
  1216. operatorInitializationCodeSection: IntermediateCode.Section;
  1217. fingerPrinter: FingerPrinter.FingerPrinter;
  1218. temporaries: Variables;
  1219. canBeLoaded : BOOLEAN;
  1220. currentIsInline: BOOLEAN;
  1221. currentMapper: SymbolMapper;
  1222. currentInlineExit: Label;
  1223. moduleBodySection: IntermediateCode.Section;
  1224. NeedDescriptor : BOOLEAN;
  1225. cooperativeSwitches: BOOLEAN;
  1226. lastSwitchPC: LONGINT;
  1227. isUnchecked: BOOLEAN;
  1228. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1229. newObjectFile: BOOLEAN);
  1230. BEGIN
  1231. SELF.system := system;
  1232. SELF.builtinsModuleName := runtime;
  1233. currentScope := NIL;
  1234. hiddenPointerType := NIL;
  1235. delegatePointerType := NIL;
  1236. awaitProcCounter := 0;
  1237. labelId := 0; constId := 0; labelId := 0;
  1238. SELF.checker := checker;
  1239. SELF.backend := backend;
  1240. position := Basic.invalidPosition;
  1241. conditional := FALSE;
  1242. locked := FALSE;
  1243. InitOperand(result,ModeUndefined);
  1244. addressType := IntermediateCode.GetType(system,system.addressType);
  1245. setType := IntermediateCode.GetType(system,system.setType);
  1246. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1247. lenType := IntermediateCode.GetType(system, system.lenType);
  1248. byteType := IntermediateCode.GetType(system, system.byteType);
  1249. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1250. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1251. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1252. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1253. nil := IntermediateCode.Immediate(addressType,0);
  1254. one := IntermediateCode.Immediate(addressType,1);
  1255. IntermediateCode.InitOperand(destination);
  1256. tagsAvailable := TRUE;
  1257. supportedInstruction := supportedInstructionProcedure;
  1258. supportedImmediate := supportedImmediateProcedure;
  1259. inData := FALSE;
  1260. SELF.emitLabels := emitLabels;
  1261. IntermediateCode.InitOperand(arrayDestinationTag);
  1262. bool := IntermediateCode.GetType(system,system.booleanType);
  1263. IntermediateCode.InitImmediate(false,bool,0);
  1264. IntermediateCode.InitImmediate(true,bool,1);
  1265. SELF.newObjectFile := newObjectFile;
  1266. indexCounter := 0;
  1267. NEW(registerUsageCount);
  1268. usedRegisters := NIL;
  1269. procedureResultDesignator := NIL;
  1270. NEW(fingerPrinter);
  1271. NEW(temporaries);
  1272. currentIsInline := FALSE;
  1273. NeedDescriptor := FALSE;
  1274. isUnchecked := backend.noRuntimeChecks;
  1275. END Init;
  1276. TYPE Context = RECORD
  1277. section: IntermediateCode.Section;
  1278. registerUsageCount: RegisterUsageCount;
  1279. usedRegisters: RegisterEntry;
  1280. temporaries: Variables;
  1281. END;
  1282. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1283. VAR context: Context;
  1284. BEGIN
  1285. context.section := section;
  1286. context.registerUsageCount := registerUsageCount;
  1287. context.usedRegisters := usedRegisters;
  1288. context.temporaries := temporaries;
  1289. section := new;
  1290. NEW(registerUsageCount);
  1291. NEW(temporaries);
  1292. usedRegisters := NIL;
  1293. RETURN context;
  1294. END SwitchContext;
  1295. PROCEDURE ReturnToContext(context: Context);
  1296. BEGIN
  1297. section := context.section;
  1298. registerUsageCount := context.registerUsageCount;
  1299. usedRegisters := context.usedRegisters;
  1300. temporaries := context.temporaries;
  1301. END ReturnToContext;
  1302. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1303. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1304. BEGIN
  1305. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1306. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1307. END;
  1308. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1309. section.SetExported(IsExported(syntaxTreeSymbol));
  1310. RETURN section
  1311. END NewSection;
  1312. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1313. VAR new: LONGINT;
  1314. BEGIN
  1315. new := registerUsageCount.Next(type,class);
  1316. UseRegister(new);
  1317. RETURN new
  1318. END AcquireRegister;
  1319. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1320. VAR
  1321. fingerPrint: SyntaxTree.FingerPrint;
  1322. fingerPrintString: ARRAY 32 OF CHAR;
  1323. BEGIN
  1324. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1325. string := "[";
  1326. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1327. Strings.Append(string, fingerPrintString);
  1328. Strings.Append(string, "]");
  1329. END GetFingerprintString;
  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 GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1333. VAR string: ARRAY 32 OF CHAR;
  1334. BEGIN
  1335. Global.GetSymbolSegmentedName(symbol, 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. Basic.AppendToSegmentedName(name,string);
  1340. END
  1341. END GetCodeSectionNameForSymbol;
  1342. (** get the name for the code section that represens a certain symbol
  1343. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1344. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1345. VAR string: ARRAY 32 OF CHAR;
  1346. BEGIN
  1347. Global.GetSymbolNameInScope(symbol, scope, name);
  1348. (* if the symbol is an operator, then append the fingerprint to the name *)
  1349. IF symbol IS SyntaxTree.Operator THEN
  1350. GetFingerprintString(symbol, string);
  1351. Strings.Append(name, string);
  1352. END
  1353. END GetCodeSectionNameForSymbolInScope;
  1354. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1355. BEGIN
  1356. IF dump # NIL THEN
  1357. dump.String("enter "); dump.String(s); dump.Ln;
  1358. END;
  1359. END TraceEnter;
  1360. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1361. BEGIN
  1362. IF dump # NIL THEN
  1363. dump.String("exit "); dump.String(s); dump.Ln;
  1364. END;
  1365. END TraceExit;
  1366. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1367. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1368. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1369. VAR i: LONGINT;
  1370. BEGIN
  1371. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1372. IF op.rule # NIL THEN
  1373. FOR i := 0 TO LEN(op.rule)-1 DO
  1374. CheckRegister(op.rule[i])
  1375. END;
  1376. END;
  1377. END CheckRegister;
  1378. BEGIN
  1379. CheckRegister(instruction.op1);
  1380. CheckRegister(instruction.op2);
  1381. CheckRegister(instruction.op3);
  1382. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1383. ELSE section.Emit(instruction);
  1384. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1385. END;
  1386. END Emit;
  1387. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1388. BEGIN
  1389. IF backend.cooperative THEN
  1390. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1391. CallThis(position,"Runtime","Trap",1);
  1392. ELSE
  1393. Emit(Trap(position,trapNo));
  1394. END;
  1395. END EmitTrap;
  1396. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1397. VAR name: Basic.SegmentedName;
  1398. VAR op1, op2, reg: IntermediateCode.Operand;
  1399. VAR call, nocall: Label;
  1400. VAR parametersSize: LONGINT;
  1401. VAR prevSection: IntermediateCode.Section;
  1402. VAR prevDump: Streams.Writer;
  1403. VAR body: SyntaxTree.Body;
  1404. VAR procedureType: SyntaxTree.ProcedureType;
  1405. BEGIN
  1406. IF procedure # NIL THEN
  1407. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1408. ELSE procedureType := NIL;
  1409. END;
  1410. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1411. prevSection := SELF.section;
  1412. SELF.section := section;
  1413. prevDump := dump;
  1414. dump := section.comments;
  1415. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1416. IF backend.hasLinkRegister THEN
  1417. Emit(Push(Basic.invalidPosition, lr));
  1418. END;
  1419. Emit(Push(Basic.invalidPosition,fp));
  1420. IF procedure # NIL THEN
  1421. body := procedure.procedureScope.body;
  1422. ELSE
  1423. body := NIL;
  1424. END;
  1425. IF backend.cooperative THEN
  1426. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1427. GetCodeSectionNameForSymbol(procedure, name);
  1428. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1429. ELSE
  1430. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1431. END;
  1432. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1433. IntermediateCode.AddOffset(op1, 1);
  1434. Emit(Push(Basic.invalidPosition,op1));
  1435. Emit(Mov(Basic.invalidPosition,fp, sp));
  1436. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1437. NEW(call, section);
  1438. NEW(nocall, section);
  1439. reg := NewRegisterOperand(addressType);
  1440. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1441. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1442. BrltL(call, sp, reg);
  1443. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1444. BrgeL(nocall, sp, op2);
  1445. call.Resolve(section.pc);
  1446. Emit(Push(Basic.invalidPosition, reg));
  1447. ReleaseIntermediateOperand(reg);
  1448. parametersSize := ProcParametersSize(procedure);
  1449. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1450. Emit(Push(Basic.invalidPosition, op2));
  1451. CallThis(position, "Activities","ExpandStack",2);
  1452. Emit(Result(Basic.invalidPosition, sp));
  1453. nocall.Resolve(section.pc);
  1454. END;
  1455. ELSE
  1456. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1457. Emit(Push(Basic.invalidPosition, one)) ;
  1458. procedureType.SetParametersOffset(1);
  1459. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1460. END;
  1461. Emit(Mov(Basic.invalidPosition, fp, sp));
  1462. END;
  1463. END;
  1464. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1465. SELF.section := prevSection;
  1466. dump := prevDump;
  1467. END EmitEnter;
  1468. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1469. VAR op1,op2: IntermediateCode.Operand;
  1470. VAR instruction: IntermediateCode.Instruction;
  1471. BEGIN
  1472. IntermediateCode.InitNumber(op1,callconv);
  1473. IntermediateCode.InitNumber(op2,varSize);
  1474. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1475. RETURN instruction
  1476. END Enter;
  1477. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1478. VAR op1: IntermediateCode.Operand;
  1479. VAR instruction: IntermediateCode.Instruction;
  1480. BEGIN
  1481. IntermediateCode.InitNumber(op1,callconv);
  1482. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1483. RETURN instruction
  1484. END Leave;
  1485. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1486. VAR prevSection: IntermediateCode.Section;
  1487. VAR op2, size: IntermediateCode.Operand;
  1488. VAR body: SyntaxTree.Body;
  1489. BEGIN
  1490. prevSection := SELF.section;
  1491. SELF.section := section;
  1492. Emit(Leave(position, callconv));
  1493. IF procedure # NIL THEN
  1494. body := procedure.procedureScope.body;
  1495. ELSE
  1496. body := NIL;
  1497. END;
  1498. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1499. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1500. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1501. Emit(Add(position, sp, fp, op2));
  1502. ELSE
  1503. Emit(Mov(position, sp, fp));
  1504. END;
  1505. Emit(Pop(position, fp));
  1506. END;
  1507. SELF.section := prevSection;
  1508. END EmitLeave;
  1509. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1510. VAR m: SymbolMap;
  1511. BEGIN
  1512. position := x.position;
  1513. IF currentIsInline THEN
  1514. m := currentMapper.Get(x);
  1515. IF m # NIL THEN
  1516. (*
  1517. Printout.Info("mapping from", x);
  1518. Printout.Info("mapping to ", m.to);
  1519. *)
  1520. m.to.Accept(SELF);
  1521. op := result;
  1522. IF m.tag # NIL THEN
  1523. ReleaseIntermediateOperand(result.tag);
  1524. m.tag.Accept(SELF);
  1525. op.tag := result.op;
  1526. ReleaseIntermediateOperand(result.tag);
  1527. END;
  1528. RETURN
  1529. END;
  1530. END;
  1531. x.Accept(SELF);
  1532. op := result;
  1533. END Symbol;
  1534. PROCEDURE Expression(x: SyntaxTree.Expression);
  1535. BEGIN
  1536. position := x.position;
  1537. constantDeclaration := NIL;
  1538. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1539. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1540. END;
  1541. IF x.resolved # NIL THEN
  1542. x.resolved.Accept(SELF)
  1543. ELSE
  1544. x.Accept(SELF)
  1545. END;
  1546. (* check this, was commented out in ActiveCells3 *)
  1547. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1548. Error(x.position, "unsupported modifier");
  1549. END;
  1550. END Expression;
  1551. (*
  1552. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1553. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1554. BEGIN
  1555. temporaries.GetUsage(current);
  1556. FOR i := 0 TO LEN(current)-1 DO
  1557. set := current[i] - previous[i];
  1558. IF set # {} THEN
  1559. FOR j := 0 TO MAX(SET)-1 DO
  1560. IF j IN set THEN
  1561. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1562. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1563. Symbol(variable, op);
  1564. MakeMemory(tmp,op.op,addressType,0);
  1565. ReleaseOperand(op);
  1566. Emit(Mov(position,tmp, nil ) );
  1567. ReleaseIntermediateOperand(tmp);
  1568. END;
  1569. END;
  1570. END;
  1571. END;
  1572. END;
  1573. END ResetUsedTemporaries;
  1574. *)
  1575. PROCEDURE Statement(x: SyntaxTree.Statement);
  1576. VAR use: VariableUse;
  1577. BEGIN
  1578. temporaries.GetUsage(use);
  1579. position := x.position;
  1580. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1581. IF commentPrintout # NIL THEN
  1582. commentPrintout.Statement(x);
  1583. dump.Ln;
  1584. (*dump.Update;*)
  1585. END;
  1586. x.Accept(SELF);
  1587. (*
  1588. CheckRegistersFree();
  1589. *)
  1590. (*ResetUsedTemporaries(use);*)
  1591. temporaries.SetUsage(use);
  1592. END Statement;
  1593. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1594. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1595. *)
  1596. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1597. BEGIN
  1598. ASSERT(op.mode # IntermediateCode.Undefined);
  1599. IF op.mode = IntermediateCode.ModeMemory THEN
  1600. ReuseCopy(res,op);
  1601. ELSE
  1602. res := op;
  1603. UseIntermediateOperand(res);
  1604. END;
  1605. IntermediateCode.AddOffset(res,offset);
  1606. IntermediateCode.MakeMemory(res,type);
  1607. END MakeMemory;
  1608. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1609. VAR mem: IntermediateCode.Operand;
  1610. BEGIN
  1611. MakeMemory(mem,res,type,offset);
  1612. ReleaseIntermediateOperand(res);
  1613. res := mem;
  1614. END ToMemory;
  1615. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1616. VAR mem: IntermediateCode.Operand;
  1617. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1618. componentType: SyntaxTree.Type;
  1619. BEGIN
  1620. type := type.resolved;
  1621. IF operand.mode = ModeReference THEN
  1622. IF type IS SyntaxTree.RangeType THEN
  1623. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1624. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1625. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1626. ReleaseOperand(operand);
  1627. operand.op := firstOp;
  1628. operand.tag := lastOp;
  1629. operand.extra := stepOp;
  1630. ELSIF type IS SyntaxTree.ComplexType THEN
  1631. componentType := type(SyntaxTree.ComplexType).componentType;
  1632. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1633. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1634. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1635. ReleaseOperand(operand);
  1636. operand.op := firstOp;
  1637. operand.tag := lastOp
  1638. ELSE
  1639. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1640. ReleaseIntermediateOperand(operand.op);
  1641. operand.op := mem;
  1642. END;
  1643. operand.mode := ModeValue;
  1644. END;
  1645. ASSERT(operand.mode = ModeValue);
  1646. END LoadValue;
  1647. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1648. VAR prevConditional: BOOLEAN;
  1649. BEGIN
  1650. prevConditional := conditional;
  1651. conditional := FALSE;
  1652. InitOperand(result, ModeUndefined);
  1653. Expression(x);
  1654. op := result;
  1655. LoadValue(op,x.type.resolved);
  1656. conditional := prevConditional;
  1657. END Evaluate;
  1658. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1659. VAR prevConditional: BOOLEAN;
  1660. BEGIN
  1661. prevConditional := conditional;
  1662. conditional := FALSE;
  1663. InitOperand(result,ModeUndefined);
  1664. Expression(x);
  1665. op := result;
  1666. (*
  1667. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1668. *)
  1669. conditional := prevConditional;
  1670. END Designate;
  1671. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1672. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1673. BEGIN
  1674. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1675. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1676. conditional := TRUE;
  1677. trueLabel := trueL; falseLabel := falseL;
  1678. Expression(x);
  1679. trueL := trueLabel; falseL := falseLabel;
  1680. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1681. END Condition;
  1682. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1683. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1684. BEGIN
  1685. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1686. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1687. RETURN op
  1688. END NewRegisterOperand;
  1689. PROCEDURE UnuseRegister(register: LONGINT);
  1690. BEGIN
  1691. IF (register > 0) THEN
  1692. register := registerUsageCount.Map(register);
  1693. registerUsageCount.DecUse(register);
  1694. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1695. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1696. END;
  1697. IF registerUsageCount.Use(register)=0 THEN
  1698. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1699. Warning(position, "register cannot be removed");
  1700. END;
  1701. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1702. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1703. END;
  1704. ELSIF registerUsageCount.Use(register)<0 THEN
  1705. Warning(position, "register removed too often");
  1706. IF dump # NIL THEN
  1707. dump.String("register removed too often"); dump.Ln; dump.Update;
  1708. END;
  1709. END;
  1710. END;
  1711. END UnuseRegister;
  1712. PROCEDURE UseRegister(register: LONGINT);
  1713. BEGIN
  1714. IF (register > 0) THEN
  1715. register := registerUsageCount.Map(register);
  1716. registerUsageCount.IncUse(register);
  1717. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1718. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1719. END;
  1720. IF registerUsageCount.Use(register)=1 THEN
  1721. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1722. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1723. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1724. END;
  1725. END;
  1726. END;
  1727. END UseRegister;
  1728. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1729. BEGIN
  1730. UnuseRegister(op.register)
  1731. END ReleaseIntermediateOperand;
  1732. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1733. BEGIN
  1734. UseRegister(op.register)
  1735. END UseIntermediateOperand;
  1736. PROCEDURE ReleaseOperand(CONST op: Operand);
  1737. BEGIN
  1738. UnuseRegister(op.op.register);
  1739. UnuseRegister(op.tag.register);
  1740. UnuseRegister(op.extra.register);
  1741. END ReleaseOperand;
  1742. (* save registers marked in array "markedRegisters" to the stack
  1743. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1744. *)
  1745. PROCEDURE SaveRegisters();
  1746. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1747. BEGIN
  1748. entry := usedRegisters;
  1749. WHILE entry # NIL DO
  1750. type := registerUsageCount.used[entry.register].type;
  1751. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1752. Emit(Push(position,op));
  1753. entry := entry.next;
  1754. END;
  1755. END SaveRegisters;
  1756. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1757. BEGIN
  1758. saved := usedRegisters;
  1759. usedRegisters := NIL;
  1760. END ReleaseUsedRegisters;
  1761. (** remove parameter registers from used queue *)
  1762. PROCEDURE ReleaseParameterRegisters;
  1763. VAR entry,prev,next: RegisterEntry;
  1764. BEGIN
  1765. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1766. WHILE entry # NIL DO
  1767. next := entry.next;
  1768. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1769. registerUsageCount.DecUse(entry.register);
  1770. ASSERT(registerUsageCount.Use(entry.register)=0);
  1771. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1772. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1773. END;
  1774. ELSIF prev = NIL THEN
  1775. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1776. ELSE
  1777. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1778. END;
  1779. entry := next;
  1780. END;
  1781. END ReleaseParameterRegisters;
  1782. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1783. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1784. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1785. BEGIN
  1786. entry := saved;
  1787. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1788. entry := prev;
  1789. WHILE entry # NIL DO
  1790. prev := entry.prev;
  1791. type := entry.type;
  1792. class := entry.registerClass;
  1793. IntermediateCode.InitRegister(op,type,class,entry.register);
  1794. (*
  1795. new := registerUsageCount.Next(type,class);
  1796. registerUsageCount.Remap(entry.register,new);
  1797. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1798. dump.String("remap register "); dump.Int(entry.register,1);
  1799. dump.String("to "); dump.Int(new,1);
  1800. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1801. END;
  1802. entry.register := new;
  1803. *)
  1804. Emit(Pop(position,op));
  1805. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1806. entry := prev;
  1807. END;
  1808. (*
  1809. usedRegisters := saved;
  1810. *)
  1811. END RestoreRegisters;
  1812. PROCEDURE CheckRegistersFree;
  1813. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1814. BEGIN
  1815. IF usedRegisters # NIL THEN
  1816. r := usedRegisters;
  1817. WHILE r # NIL DO
  1818. warning := "register ";
  1819. Strings.AppendInt(warning, r.register);
  1820. Strings.Append(warning, " not released.");
  1821. Warning(position,warning);
  1822. r := r .next;
  1823. END;
  1824. END;
  1825. FOR i := 0 TO registerUsageCount.count-1 DO
  1826. IF registerUsageCount.used[i].count < 0 THEN
  1827. warning := "register ";
  1828. Strings.AppendInt(warning, i);
  1829. Strings.Append(warning, " unused too often.");
  1830. Warning(position,warning);
  1831. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1832. warning := "register ";
  1833. Strings.AppendInt(warning, i);
  1834. Strings.Append(warning, " not unused often enough.");
  1835. Warning(position,warning);
  1836. END;
  1837. END;
  1838. END CheckRegistersFree;
  1839. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1840. Otherwise allocate a new register.
  1841. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1842. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1843. BEGIN
  1844. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1845. UseIntermediateOperand(result);
  1846. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1847. UseIntermediateOperand(result);
  1848. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1849. END;
  1850. END Reuse2;
  1851. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1852. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1853. If not then allocate a new register.
  1854. Does NOT necessarily keep the content of src1 or src2 in result!
  1855. *)
  1856. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1857. BEGIN
  1858. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1859. UseIntermediateOperand(result);
  1860. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1861. UseIntermediateOperand(result);
  1862. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1863. result := alternative; alternative := emptyOperand;
  1864. UseIntermediateOperand(result);
  1865. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1866. END;
  1867. END Reuse2a;
  1868. (* like reuse2 but only one source *)
  1869. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1870. BEGIN
  1871. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1872. UseIntermediateOperand(result);
  1873. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1874. END;
  1875. END Reuse1;
  1876. (* like reuse2a but only one source *)
  1877. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1878. BEGIN
  1879. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1880. UseIntermediateOperand(result);
  1881. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1882. UseIntermediateOperand(result);
  1883. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1884. END;
  1885. END Reuse1a;
  1886. (* like reuse1 but guarantees that content of src1 is in result *)
  1887. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1888. BEGIN
  1889. IF ReusableRegister(src1) THEN
  1890. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1891. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1892. UseIntermediateOperand(result);
  1893. ELSE
  1894. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1895. Emit(Mov(position,result,src1));
  1896. END
  1897. END ReuseCopy;
  1898. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1899. BEGIN
  1900. IF ReusableRegister(src) THEN
  1901. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1902. ELSE
  1903. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1904. Emit(Mov(position,result,src));
  1905. ReleaseIntermediateOperand(src);
  1906. END
  1907. END TransferToRegister;
  1908. (** labels and branches **)
  1909. PROCEDURE NewLabel(): Label;
  1910. VAR label: Label;
  1911. BEGIN
  1912. NEW(label,section); RETURN label;
  1913. END NewLabel;
  1914. PROCEDURE SetLabel(label: Label);
  1915. BEGIN label.Resolve(section.pc);
  1916. END SetLabel;
  1917. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1918. BEGIN
  1919. ASSERT(label # NIL);
  1920. IF label.pc < 0 THEN (* label not yet set *)
  1921. label.AddFixup(section.pc);
  1922. END;
  1923. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1924. END LabelOperand;
  1925. PROCEDURE BrL(label: Label);
  1926. BEGIN
  1927. Emit(Br(position,LabelOperand(label)));
  1928. END BrL;
  1929. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1930. BEGIN
  1931. Emit(Brge(position,LabelOperand(label),left,right));
  1932. END BrgeL;
  1933. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1934. BEGIN
  1935. Emit(Brlt(position,LabelOperand(label),left,right));
  1936. END BrltL;
  1937. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1938. BEGIN
  1939. Emit(Breq(position,LabelOperand(label),left,right));
  1940. END BreqL;
  1941. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1942. BEGIN
  1943. Emit(Brne(position,LabelOperand(label),left,right));
  1944. END BrneL;
  1945. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1946. VAR new: IntermediateCode.Operand;
  1947. BEGIN
  1948. IF Trace THEN TraceEnter("Convert") END;
  1949. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1950. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1951. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1952. & (operand.offset = 0)
  1953. THEN
  1954. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1955. Emit(Conv(position,new,operand));
  1956. ELSE
  1957. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1958. Emit(Conv(position,new,operand));
  1959. ReleaseIntermediateOperand(operand);
  1960. END;
  1961. operand := new;
  1962. 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
  1963. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1964. ELSE
  1965. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1966. Emit(Conv(position,new,operand));
  1967. ReleaseIntermediateOperand(operand);
  1968. operand := new;
  1969. END;
  1970. IF Trace THEN TraceExit("Convert") END;
  1971. END Convert;
  1972. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1973. VAR exit: Label;
  1974. BEGIN
  1975. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1976. exit := NewLabel();
  1977. br(exit,left,right);
  1978. EmitTrap(position,trapNo);
  1979. SetLabel(exit);
  1980. END TrapC;
  1981. (** expressions *)
  1982. (** emit necessary runtime check for set elements **)
  1983. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1984. VAR max: IntermediateCode.Operand;
  1985. BEGIN
  1986. IF isUnchecked THEN RETURN END;
  1987. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1988. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1989. TrapC(BrgeL, max, o, SetElementTrap);
  1990. END;
  1991. END CheckSetElement;
  1992. (** the set that a range represents **)
  1993. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1994. VAR
  1995. operand: Operand;
  1996. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1997. BEGIN
  1998. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1999. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  2000. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  2001. one := IntermediateCode.Immediate(setType, 1);
  2002. Evaluate(x, operand);
  2003. Convert(operand.op, setType);
  2004. Convert(operand.tag, setType);
  2005. CheckSetElement(operand.op);
  2006. CheckSetElement(operand.tag);
  2007. (* create mask for lower bound
  2008. i.e. shift 11111111 to the left by the value of the lower bound
  2009. *)
  2010. Reuse1(temp, operand.op);
  2011. Emit(Shl(position,temp, allBits, operand.op));
  2012. ReleaseIntermediateOperand(operand.op);
  2013. operand.op := temp;
  2014. (* create mask for upper bound
  2015. i.e. shift 11111111 to the right by the difference between the
  2016. upper bound and the maximum number of set elements
  2017. *)
  2018. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2019. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2020. Reuse1(temp, operand.tag);
  2021. ELSE
  2022. Reuse1(temp, operand.tag);
  2023. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2024. Emit(Sub(position,temp, size, operand.tag));
  2025. END;
  2026. Emit(Shr(position,temp, allBits, operand.tag));
  2027. ReleaseIntermediateOperand(operand.tag);
  2028. operand.tag := temp;
  2029. Reuse2(resultingSet, operand.op, operand.tag);
  2030. (* intersect the two masks *)
  2031. Emit(And(position,resultingSet, operand.op, operand.tag));
  2032. ReleaseOperand(operand);
  2033. RETURN resultingSet
  2034. END SetFromRange;
  2035. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2036. VAR
  2037. res, operand: Operand;
  2038. temp, one, noBits, dest: IntermediateCode.Operand;
  2039. expression: SyntaxTree.Expression;
  2040. i: LONGINT;
  2041. BEGIN
  2042. IF Trace THEN TraceEnter("VisitSet") END;
  2043. dest := destination;
  2044. destination := emptyOperand;
  2045. noBits := IntermediateCode.Immediate(setType, 0);
  2046. one := IntermediateCode.Immediate(setType, 1);
  2047. (* start off with the empty set *)
  2048. InitOperand(res, ModeValue);
  2049. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2050. Emit(Mov(position,res.op, noBits));
  2051. FOR i := 0 TO x.elements.Length() - 1 DO
  2052. expression := x.elements.GetExpression(i);
  2053. IF expression IS SyntaxTree.RangeExpression THEN
  2054. (* range of set elements *)
  2055. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2056. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2057. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2058. ReleaseIntermediateOperand(temp)
  2059. ELSE
  2060. (* singelton element *)
  2061. Evaluate(expression, operand);
  2062. Convert(operand.op, setType);
  2063. CheckSetElement(operand.op);
  2064. (* create subset containing single element *)
  2065. Reuse1(temp, operand.op);
  2066. Emit(Shl(position,temp, one, operand.op));
  2067. ReleaseOperand(operand);
  2068. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2069. ReleaseIntermediateOperand(temp);
  2070. END
  2071. END;
  2072. result := res;
  2073. destination := dest;
  2074. IF Trace THEN TraceExit("VisitSet") END;
  2075. END VisitSet;
  2076. (* math arrays of the form [a,b,c]
  2077. x is a static array and thus does not provide any pointers
  2078. *)
  2079. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2080. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2081. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2082. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2083. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2084. element: SyntaxTree.IntegerValue;
  2085. BEGIN
  2086. numberElements := x.elements.Length();
  2087. expression := index.parameters.GetExpression(dim);
  2088. element := expression(SyntaxTree.IntegerValue);
  2089. FOR i := 0 TO numberElements-1 DO
  2090. expression := x.elements.GetExpression(i);
  2091. element.SetValue(i);
  2092. IF expression IS SyntaxTree.MathArrayExpression THEN
  2093. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2094. ELSE
  2095. Assign(index,expression);
  2096. END;
  2097. END;
  2098. END RecursiveAssignment;
  2099. BEGIN
  2100. (*static math array not providing pointers anyway *)
  2101. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2102. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2103. designator.SetType(variable.type);
  2104. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2105. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2106. FOR i := 0 TO dim-1 DO
  2107. element := SyntaxTree.NewIntegerValue(x.position,0);
  2108. element.SetType(system.longintType);
  2109. index.parameters.AddExpression(element);
  2110. END;
  2111. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2112. RecursiveAssignment(x,0);
  2113. Expression(designator);
  2114. END VisitMathArrayExpression;
  2115. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2116. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2117. BEGIN
  2118. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2119. dest := destination; destination := emptyOperand;
  2120. IF x.operator = Scanner.Not THEN
  2121. IF conditional THEN
  2122. Condition(x.left,falseLabel,trueLabel)
  2123. ELSE
  2124. Evaluate(x.left,operand);
  2125. InitOperand(result,ModeValue);
  2126. Reuse1a(result.op,operand.op,dest);
  2127. Emit(Xor(position,result.op,operand.op,true));
  2128. ReleaseOperand(operand);
  2129. END;
  2130. ELSIF x.operator = Scanner.Minus THEN
  2131. Evaluate(x.left,operand);
  2132. InitOperand(result,ModeValue);
  2133. Reuse1a(result.op,operand.op,dest);
  2134. type := x.left.type.resolved;
  2135. IF type IS SyntaxTree.SetType THEN
  2136. Emit(Not(position,result.op,operand.op));
  2137. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2138. Reuse1(result.tag,operand.tag);
  2139. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2140. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2141. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2142. Emit(Neg(position,result.op,operand.op));
  2143. ELSE HALT(200)
  2144. END;
  2145. ReleaseOperand(operand);
  2146. ELSIF x.operator = Scanner.Address THEN
  2147. Designate(x.left,operand);
  2148. operand.mode := ModeValue;
  2149. t0 := x.left.type.resolved;
  2150. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2151. ReleaseIntermediateOperand(operand.op);
  2152. operand.op := operand.tag;
  2153. IntermediateCode.InitOperand(operand.tag);
  2154. END;
  2155. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2156. result := operand;
  2157. ELSE HALT(100)
  2158. END;
  2159. destination := dest;
  2160. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2161. END VisitUnaryExpression;
  2162. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2163. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2164. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2165. BEGIN
  2166. type := type.resolved;
  2167. originalType := type;
  2168. IF type IS SyntaxTree.PointerType THEN
  2169. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2170. END;
  2171. IF type IS SyntaxTree.ObjectType THEN
  2172. BrL(trueL);
  2173. ELSE
  2174. ASSERT(type IS SyntaxTree.RecordType);
  2175. (*
  2176. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2177. *)
  2178. ReuseCopy(left,tag);
  2179. right := TypeDescriptorAdr(type);
  2180. IF ~newObjectFile THEN
  2181. IntermediateCode.MakeMemory(right,addressType);
  2182. END;
  2183. IF backend.cooperative THEN
  2184. repeatL := NewLabel();
  2185. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2186. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2187. END;
  2188. SetLabel(repeatL);
  2189. BreqL(trueL,left,right);
  2190. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2191. BrneL(repeatL,left,nil);
  2192. ELSIF meta.simple THEN
  2193. level := type(SyntaxTree.RecordType).Level();
  2194. (* get type desc tag of level relative to base tag *)
  2195. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2196. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2197. IntermediateCode.MakeMemory(left,addressType);
  2198. BreqL(trueL,left,right);
  2199. ELSE
  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. END;
  2207. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2208. BrL(falseL);
  2209. END;
  2210. END TypeTest;
  2211. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2212. BEGIN
  2213. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2214. IF dump # NIL THEN
  2215. dump.String(s); dump.Ln;
  2216. END;
  2217. END Error;
  2218. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2219. BEGIN
  2220. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2221. IF dump # NIL THEN
  2222. dump.String(s); dump.Ln; dump.Update;
  2223. END;
  2224. END Warning;
  2225. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2226. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2227. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2228. operand:Operand;
  2229. BEGIN
  2230. previousSection := section;
  2231. Global.GetModuleName(mod,name);
  2232. Strings.Append(name,".@Trace");
  2233. Basic.ToSegmentedName(name, pooledName);
  2234. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2235. IF dump # NIL THEN dump := section.comments END;
  2236. IF backend.hasLinkRegister THEN
  2237. Emit(Push(Basic.invalidPosition, lr));
  2238. END;
  2239. variable := mod.moduleScope.firstVariable;
  2240. WHILE variable # NIL DO
  2241. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2242. Symbol(variable, operand);
  2243. register := operand.op;
  2244. CallTraceMethod(register, variable.type);
  2245. ReleaseIntermediateOperand(register);
  2246. END;
  2247. variable := variable.nextVariable;
  2248. END;
  2249. IF backend.hasLinkRegister THEN
  2250. Emit(Pop(Basic.invalidPosition, lr));
  2251. END;
  2252. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2253. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2254. Emit(Br(position,op));
  2255. INC(statCoopTraceModule, section.pc);
  2256. section := previousSection;
  2257. IF dump # NIL THEN dump := section.comments END;
  2258. END CreateTraceModuleMethod;
  2259. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2260. BEGIN
  2261. Emit (Push(position, dst));
  2262. Emit (Push(position, src));
  2263. CallThis(position,"GarbageCollector","Assign", 2);
  2264. END CallAssignPointer;
  2265. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2266. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2267. BEGIN
  2268. IF SemanticChecker.IsPointerType (type) THEN
  2269. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2270. ELSIF type.IsRecordType() THEN
  2271. Emit (Push(position,dst));
  2272. Emit (Push(position,src));
  2273. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2274. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2275. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2276. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2277. ELSIF IsStaticArray(type) THEN
  2278. size := StaticArrayNumElements(type);
  2279. base := StaticArrayBaseType(type);
  2280. IF base.IsRecordType() THEN
  2281. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2282. Emit (Push(position, dst));
  2283. Emit (Push(position, src));
  2284. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2285. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2286. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2287. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2288. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2289. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2290. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2291. Emit (Push(position, dst));
  2292. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2293. Emit (Push(position, src));
  2294. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2295. ELSE
  2296. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2297. Emit (Push(position, dst));
  2298. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2299. Emit (Push(position, src));
  2300. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2301. ASSERT(StaticArrayBaseType(type).IsPointer());
  2302. END;
  2303. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2304. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2305. Emit (Push(position, dst));
  2306. Emit (Push(position, src));
  2307. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2308. ELSE HALT(100); (* missing ? *)
  2309. END;
  2310. END CallAssignMethod;
  2311. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2312. VAR name: Basic.SegmentedName;
  2313. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2314. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2315. context: Context;
  2316. BEGIN
  2317. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2318. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2319. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2320. GetRecordTypeName (recordType,name);
  2321. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2322. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2323. IF dump # NIL THEN dump := section.comments END;
  2324. IF backend.hasLinkRegister THEN
  2325. Emit(Push(Basic.invalidPosition, lr));
  2326. END;
  2327. variable := recordType.recordScope.firstVariable;
  2328. WHILE variable # NIL DO
  2329. IF variable.NeedsTrace() THEN
  2330. dst := NewRegisterOperand (addressType);
  2331. src := NewRegisterOperand (addressType);
  2332. Emit (Mov(position, dst, parameter1));
  2333. Emit (Mov(position, src, parameter2));
  2334. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2335. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2336. CallAssignMethod(dst, src, variable.type);
  2337. ReleaseIntermediateOperand(src);
  2338. ReleaseIntermediateOperand(dst);
  2339. END;
  2340. variable := variable.nextVariable;
  2341. END;
  2342. recordBase := recordType.GetBaseRecord();
  2343. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2344. IF backend.hasLinkRegister THEN
  2345. Emit(Pop(Basic.invalidPosition, lr));
  2346. END;
  2347. GetRecordTypeName (recordBase,name);
  2348. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2349. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2350. Emit(Br(position,op));
  2351. ELSE
  2352. Emit(Exit(position,0,0, 0));
  2353. END;
  2354. IF ~recordType.isObject THEN
  2355. GetRecordTypeName (recordType,name);
  2356. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2357. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2358. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2359. NEW(registerUsageCount);
  2360. usedRegisters := NIL;
  2361. dst := NewRegisterOperand (addressType);
  2362. src := NewRegisterOperand (addressType);
  2363. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2364. Emit(Mov(position, dst, parameter1));
  2365. Emit(Mov(position, src, parameter2));
  2366. label := NewLabel();
  2367. SetLabel(label);
  2368. Emit(Push(position, dst));
  2369. Emit(Push(position, src));
  2370. GetRecordTypeName (recordType,name);
  2371. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2372. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2373. Emit(Call(position, op, 0));
  2374. Emit(Pop(position, src));
  2375. Emit(Pop(position, dst));
  2376. Emit(Add(position, dst, dst, ofs));
  2377. Emit(Add(position, src, src, ofs));
  2378. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2379. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2380. Emit(Exit(position,0,0, 0));
  2381. END;
  2382. INC(statCoopAssignProcedure, section.pc);
  2383. ReturnToContext(context);
  2384. IF dump # NIL THEN dump := section.comments END;
  2385. END CreateAssignProcedure;
  2386. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2387. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2388. BEGIN
  2389. IF IsUnsafePointer (type) THEN
  2390. skip := NewLabel();
  2391. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2392. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2393. BreqL (skip, op, nil);
  2394. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2395. SetLabel (skip);
  2396. ELSIF SemanticChecker.IsPointerType (type) THEN
  2397. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2398. CallThis(position,"GarbageCollector","Mark", 1);
  2399. ELSIF type.IsRecordType() THEN
  2400. Emit (Push(position,register));
  2401. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2402. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2403. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2404. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2405. ELSIF IsStaticArray(type) THEN
  2406. size := StaticArrayNumElements(type);
  2407. base := StaticArrayBaseType(type);
  2408. IF base.IsRecordType() THEN
  2409. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2410. Emit (Push(position, register));
  2411. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2412. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2413. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2414. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2415. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2416. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2417. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2418. Emit (Push(position, register));
  2419. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2420. ELSE
  2421. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2422. Emit (Push(position, register));
  2423. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2424. ASSERT(base.IsPointer());
  2425. END;
  2426. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2427. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2428. CallThis(position,"GarbageCollector","Mark", 1);
  2429. ELSE HALT(100); (* missing ? *)
  2430. END;
  2431. END CallTraceMethod;
  2432. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2433. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2434. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2435. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2436. BEGIN
  2437. previousSection := section;
  2438. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2439. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2440. GetRecordTypeName (recordType,name);
  2441. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2442. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2443. IF dump # NIL THEN dump := section.comments END;
  2444. IF backend.hasLinkRegister THEN
  2445. Emit(Push(Basic.invalidPosition, lr));
  2446. END;
  2447. variable := recordType.recordScope.firstVariable;
  2448. WHILE variable # NIL DO
  2449. IF variable.NeedsTrace() THEN
  2450. register := NewRegisterOperand (addressType);
  2451. Emit (Mov(position,register,parameter1));
  2452. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2453. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2454. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2455. END;
  2456. CallTraceMethod(register, variable.type);
  2457. ReleaseIntermediateOperand(register);
  2458. END;
  2459. variable := variable.nextVariable;
  2460. END;
  2461. recordBase := recordType.GetBaseRecord();
  2462. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2463. recordBase := recordBase.GetBaseRecord();
  2464. END;
  2465. IF recordBase # NIL THEN
  2466. IF backend.hasLinkRegister THEN
  2467. Emit(Pop(Basic.invalidPosition, lr));
  2468. END;
  2469. GetRecordTypeName (recordBase,name);
  2470. IF HasExplicitTraceMethod (recordBase) THEN
  2471. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2472. ELSE
  2473. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2474. END;
  2475. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2476. Emit(Br(position,op));
  2477. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2478. Emit(Exit(position,0,0,0));
  2479. ELSE
  2480. IF backend.hasLinkRegister THEN
  2481. Emit(Pop(Basic.invalidPosition, lr));
  2482. END;
  2483. IF recordType.isObject THEN
  2484. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2485. ELSE
  2486. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2487. END;
  2488. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2489. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2490. Emit(Br(position,op));
  2491. END;
  2492. IF ~recordType.isObject THEN
  2493. GetRecordTypeName (recordType,name);
  2494. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2495. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2496. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2497. NEW(registerUsageCount);
  2498. usedRegisters := NIL;
  2499. IF dump # NIL THEN dump := section.comments END;
  2500. register := NewRegisterOperand (addressType);
  2501. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2502. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2503. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2504. END;
  2505. Emit (Push(position,register));
  2506. GetRecordTypeName (recordType,name);
  2507. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2508. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2509. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2510. ReleaseIntermediateOperand(register);
  2511. Emit(Exit(position,0,0,0));
  2512. GetRecordTypeName (recordType,name);
  2513. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2514. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2515. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2516. NEW(registerUsageCount);
  2517. usedRegisters := NIL;
  2518. register := NewRegisterOperand (addressType);
  2519. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2520. Emit(Mov(position, register, parameter1));
  2521. label := NewLabel();
  2522. SetLabel(label);
  2523. Emit(Push(position, register));
  2524. GetRecordTypeName (recordType,name);
  2525. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2526. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2527. Emit(Call(position, op, 0));
  2528. Emit(Pop(position, register));
  2529. Emit(Add(position, register, register, ofs));
  2530. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2531. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2532. Emit(Exit(position,0,0,0));
  2533. END;
  2534. INC(statCoopTraceMethod, section.pc);
  2535. ReturnToContext(context);
  2536. IF dump # NIL THEN dump := section.comments END;
  2537. END CreateTraceMethod;
  2538. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2539. VAR name: Basic.SegmentedName;
  2540. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2541. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2542. context: Context;
  2543. BEGIN
  2544. IF recordType.isObject THEN RETURN END;
  2545. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2546. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2547. GetRecordTypeName (recordType,name);
  2548. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2549. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2550. IF dump # NIL THEN dump := section.comments END;
  2551. IF backend.hasLinkRegister THEN
  2552. Emit(Push(Basic.invalidPosition, lr));
  2553. END;
  2554. variable := recordType.recordScope.firstVariable;
  2555. WHILE variable # NIL DO
  2556. IF variable.NeedsTrace() THEN
  2557. dst := NewRegisterOperand (addressType);
  2558. Emit (Mov(position, dst, parameter1));
  2559. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2560. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2561. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2562. END;
  2563. CallResetProcedure(dst, nil, variable.type);
  2564. ReleaseIntermediateOperand(dst);
  2565. END;
  2566. variable := variable.nextVariable;
  2567. END;
  2568. recordBase := recordType.GetBaseRecord();
  2569. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2570. IF backend.hasLinkRegister THEN
  2571. Emit(Pop(Basic.invalidPosition, lr));
  2572. END;
  2573. GetRecordTypeName (recordBase,name);
  2574. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2575. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2576. Emit(Br(position,op));
  2577. ELSE
  2578. Emit(Exit(position,0,0, 0));
  2579. END;
  2580. GetRecordTypeName (recordType,name);
  2581. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2582. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2583. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2584. NEW(registerUsageCount);
  2585. usedRegisters := NIL;
  2586. dst := NewRegisterOperand (addressType);
  2587. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2588. Emit(Mov(position, dst, parameter1));
  2589. label := NewLabel();
  2590. SetLabel(label);
  2591. Emit(Push(position, dst));
  2592. GetRecordTypeName (recordType,name);
  2593. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2594. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2595. Emit(Call(position, op, 0));
  2596. Emit(Pop(position, dst));
  2597. Emit(Add(position, dst, dst, ofs));
  2598. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2599. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2600. Emit(Exit(position,0,0, 0));
  2601. INC(statCoopResetProcedure, section.pc);
  2602. ReturnToContext(context);
  2603. IF dump # NIL THEN dump := section.comments END;
  2604. END CreateResetProcedure;
  2605. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2606. VAR name: Basic.SegmentedName; context: Context;
  2607. BEGIN
  2608. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2609. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2610. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2611. IF dump # NIL THEN dump := section.comments END;
  2612. IF backend.hasLinkRegister THEN
  2613. Emit(Push(Basic.invalidPosition, lr));
  2614. END;
  2615. Emit(Push(position,fp));
  2616. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2617. ResetVariables(scope);
  2618. Emit(Pop(position,fp));
  2619. Emit(Exit(position,0,0, 0));
  2620. ReturnToContext(context);
  2621. IF dump # NIL THEN dump := section.comments END;
  2622. END CreateResetMethod;
  2623. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2624. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2625. BEGIN
  2626. IF SemanticChecker.IsPointerType (type) THEN
  2627. Emit (Push(position, dest));
  2628. CallThis(position,"GarbageCollector","Reset", 1);
  2629. ELSIF type.IsRecordType() THEN
  2630. Emit (Push(position, dest));
  2631. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2632. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2633. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2634. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2635. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2636. size := GetArrayLength(type, tag);
  2637. base := ArrayBaseType(type);
  2638. IF base.IsRecordType() THEN
  2639. Emit (Push(position, size));
  2640. Emit (Push(position, dest));
  2641. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2642. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2643. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2644. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2645. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2646. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2647. Emit (Push(position, size));
  2648. Emit (Push(position, dest));
  2649. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2650. ELSE
  2651. Emit (Push(position, size));
  2652. Emit (Push(position, dest));
  2653. CallThis(position,"GarbageCollector","ResetArray", 2);
  2654. ASSERT(ArrayBaseType(type).IsPointer());
  2655. END;
  2656. ReleaseIntermediateOperand(size);
  2657. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2658. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2659. Emit (Push(position, dest));
  2660. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2661. ELSE HALT(100); (* missing ? *)
  2662. END;
  2663. END CallResetProcedure;
  2664. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2665. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2666. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2667. VAR operand: Operand;
  2668. BEGIN
  2669. Symbol (symbol, operand);
  2670. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2671. ReleaseOperand(operand);
  2672. END Reset;
  2673. BEGIN
  2674. previousScope := currentScope;
  2675. currentScope := scope;
  2676. pc := section.pc;
  2677. variable := scope.firstVariable;
  2678. WHILE variable # NIL DO
  2679. IF variable.NeedsTrace() THEN
  2680. Reset (variable);
  2681. END;
  2682. variable := variable.nextVariable;
  2683. END;
  2684. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2685. WHILE parameter # NIL DO
  2686. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2687. Reset (parameter);
  2688. END;
  2689. parameter := parameter.nextParameter;
  2690. END;
  2691. INC(statCoopResetVariables, section.pc - pc);
  2692. currentScope := previousScope;
  2693. END ResetVariables;
  2694. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2695. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2696. BEGIN
  2697. type := symbol.type.resolved;
  2698. SaveRegisters();ReleaseUsedRegisters(saved);
  2699. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2700. Symbol(symbol, operand);
  2701. ToMemory(operand.op,addressType,0);
  2702. Emit(Push(position,operand.op));
  2703. IF refer THEN
  2704. CallThis(position,"Heaps","Refer",1);
  2705. ELSE
  2706. CallThis(position,"Heaps","Reset",1);
  2707. END;
  2708. ELSIF type.IsRecordType() THEN
  2709. Symbol(symbol, operand);
  2710. Emit(Push(position,operand.op));
  2711. Emit(Push(position,operand.tag)); (* type desc *)
  2712. IF refer THEN
  2713. CallThis(position,"Heaps","ReferRecord",2);
  2714. ELSE
  2715. CallThis(position,"Heaps","ResetRecord",2);
  2716. END;
  2717. ELSIF IsStaticArray(type) THEN
  2718. size := StaticArrayNumElements(type);
  2719. base := StaticArrayBaseType(type);
  2720. Symbol(symbol, operand);
  2721. arg := TypeDescriptorAdr(base);
  2722. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  2723. Emit(Push(position,operand.op));
  2724. Emit(Push(position,arg));
  2725. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2726. ReleaseIntermediateOperand(arg);
  2727. IF refer THEN
  2728. CallThis(position,"Heaps","ReferArray",3);
  2729. ELSE
  2730. CallThis(position,"Heaps","ResetArray",3);
  2731. END;
  2732. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  2733. size := StaticMathArrayNumElements(type);
  2734. base := StaticMathArrayBaseType(type);
  2735. Symbol(symbol, operand);
  2736. arg := TypeDescriptorAdr(base);
  2737. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  2738. Emit(Push(position,operand.op));
  2739. Emit(Push(position,arg));
  2740. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2741. ReleaseIntermediateOperand(arg);
  2742. IF refer THEN
  2743. CallThis(position,"Heaps","ReferArray",3);
  2744. ELSE
  2745. CallThis(position,"Heaps","ResetArray",3);
  2746. END;
  2747. ELSIF type IS SyntaxTree.MathArrayType THEN
  2748. Symbol(symbol, operand);
  2749. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  2750. Emit (Push(position, operand.op));
  2751. ELSE
  2752. Emit (Push(position, operand.tag));
  2753. END;
  2754. IF refer THEN
  2755. CallThis(position,"Heaps","ReferMathArray", 1);
  2756. ELSE
  2757. CallThis(position,"Heaps","ResetMathArray", 1);
  2758. END;
  2759. ELSIF type IS SyntaxTree.ProcedureType THEN
  2760. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  2761. Symbol(symbol, operand);
  2762. Emit (Push(position, operand.tag));
  2763. IF refer THEN
  2764. CallThis(position,"Heaps","Refer", 1);
  2765. ELSE
  2766. CallThis(position,"Heaps","Reset", 1);
  2767. END;
  2768. ELSE HALT(100); (* missing ? *)
  2769. END;
  2770. ReleaseOperand(operand);
  2771. RestoreRegisters(saved);
  2772. END Reset;
  2773. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  2774. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  2775. BEGIN
  2776. previousScope := currentScope;
  2777. currentScope := scope;
  2778. pc := section.pc;
  2779. IF ~ refer THEN
  2780. variable := scope.firstVariable;
  2781. prevOffset := MAX(SIZE);
  2782. WHILE variable # NIL DO
  2783. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2784. Reset (variable,refer);
  2785. prevOffset := variable.offsetInBits;
  2786. END;
  2787. variable := variable.nextVariable;
  2788. END;
  2789. END;
  2790. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2791. WHILE parameter # NIL DO
  2792. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  2793. Reset (parameter,refer);
  2794. END;
  2795. parameter := parameter.nextParameter;
  2796. END;
  2797. INC(statCoopResetVariables, section.pc - pc);
  2798. currentScope := previousScope;
  2799. END ResetVariables2;
  2800. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2801. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2802. VAR op: IntermediateCode.Operand; context: Context;
  2803. BEGIN
  2804. previousSection := section;
  2805. GetCodeSectionNameForSymbol(procedure, name);
  2806. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2807. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2808. IF dump # NIL THEN dump := section.comments END;
  2809. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2810. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2811. Emit(Data(position,op));
  2812. Emit(Data(position,nil));
  2813. IF HasPointers (procedure.procedureScope) THEN
  2814. GetCodeSectionNameForSymbol(procedure, name);
  2815. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2816. ELSE
  2817. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2818. END;
  2819. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2820. Emit(Data(position,op));
  2821. ReturnToContext(context);
  2822. IF dump # NIL THEN dump := section.comments END;
  2823. END CreateProcedureDescriptor;
  2824. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2825. VAR import: SyntaxTree.Import;
  2826. s: Basic.MessageString;
  2827. selfName: SyntaxTree.IdentifierString;
  2828. BEGIN
  2829. moduleScope.ownerModule.GetName(selfName);
  2830. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2831. module := moduleScope.ownerModule
  2832. ELSE
  2833. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2834. IF import = NIL THEN
  2835. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2836. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2837. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2838. s := "Module ";
  2839. Strings.Append(s,moduleName);
  2840. Strings.Append(s," cannot be imported.");
  2841. IF force THEN
  2842. Error(position,s);
  2843. ELSIF canBeLoaded THEN
  2844. IF WarningDynamicLoading THEN
  2845. Strings.Append(s, "=> no dynamic linking.");
  2846. Warning(position, s);
  2847. END;
  2848. canBeLoaded := FALSE;
  2849. END;
  2850. RETURN FALSE
  2851. ELSE
  2852. SELF.module.imports.AddName(moduleName)
  2853. END;
  2854. ELSIF import.module = NIL THEN (* already tried *)
  2855. RETURN FALSE
  2856. END;
  2857. module := import.module;
  2858. END;
  2859. RETURN TRUE
  2860. END AddImport;
  2861. (* needed for old binary object file format*)
  2862. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2863. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2864. BEGIN
  2865. IF AddImport(moduleName,module,TRUE) THEN
  2866. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2867. IF procedure = NIL THEN
  2868. s := "Instruction not supported on target, emulation procedure ";
  2869. Strings.Append(s,moduleName);
  2870. Strings.Append(s,".");
  2871. Strings.Append(s,procedureName);
  2872. Strings.Append(s," not present");
  2873. Error(position,s);
  2874. ELSE
  2875. StaticCallOperand(r,procedure);
  2876. ReleaseOperand(r);
  2877. fp := GetFingerprint(procedure);
  2878. END;
  2879. END;
  2880. END EnsureSymbol;
  2881. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2882. VAR exit: Label; trueL,falseL: Label;
  2883. BEGIN
  2884. trueL := NewLabel();
  2885. falseL := NewLabel();
  2886. exit := NewLabel();
  2887. Condition(x,trueL,falseL);
  2888. InitOperand(result,ModeValue);
  2889. SetLabel(trueL);
  2890. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2891. Emit(Mov(position,result.op,true));
  2892. BrL(exit);
  2893. SetLabel(falseL);
  2894. Emit(MovReplace(position,result.op,false));
  2895. SetLabel(exit);
  2896. END ConditionToValue;
  2897. PROCEDURE ValueToCondition(VAR op: Operand);
  2898. BEGIN
  2899. LoadValue(op,system.booleanType);
  2900. BrneL(trueLabel,op.op, false);
  2901. ReleaseOperand(op);
  2902. BrL(falseLabel);
  2903. END ValueToCondition;
  2904. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2905. VAR size: LONGINT;
  2906. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2907. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2908. BEGIN
  2909. ASSERT(type.form = SyntaxTree.Open);
  2910. baseType := type.arrayBase.resolved;
  2911. IF IsOpenArray(baseType) THEN
  2912. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2913. ELSE
  2914. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2915. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2916. END;
  2917. len := tag;
  2918. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2919. IntermediateCode.MakeMemory(len,addressType);
  2920. UseIntermediateOperand(len);
  2921. Reuse2(res,sizeOperand,len);
  2922. Emit(Mul(position,res,sizeOperand,len));
  2923. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2924. RETURN res
  2925. END GetArraySize;
  2926. BEGIN
  2927. type := type.resolved;
  2928. IF IsOpenArray(type) THEN
  2929. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2930. RETURN tag
  2931. ELSE
  2932. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2933. END;
  2934. ELSE
  2935. size := ToMemoryUnits(system,system.SizeOf(type));
  2936. RETURN IntermediateCode.Immediate(addressType,size)
  2937. END;
  2938. END GetDynamicSize;
  2939. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2940. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2941. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2942. BEGIN
  2943. ASSERT(type.form = SyntaxTree.Open);
  2944. baseType := type.arrayBase.resolved;
  2945. IF IsOpenArray(baseType) THEN
  2946. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2947. ELSE
  2948. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2949. END;
  2950. len := tag;
  2951. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2952. IntermediateCode.MakeMemory(len,addressType);
  2953. UseIntermediateOperand(len);
  2954. Reuse2(res,sizeOperand,len);
  2955. Emit(Mul(position,res,sizeOperand,len));
  2956. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2957. RETURN res
  2958. END GetLength;
  2959. BEGIN
  2960. type := type.resolved;
  2961. IF IsOpenArray(type) THEN
  2962. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2963. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2964. ELSIF type IS SyntaxTree.StringType THEN
  2965. RETURN tag;
  2966. ELSE
  2967. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2968. END;
  2969. END GetArrayLength;
  2970. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2971. VAR result: IntermediateCode.Operand;
  2972. BEGIN
  2973. IF backend.cooperative THEN
  2974. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2975. ELSE
  2976. MakeMemory(result, tag, addressType, 0);
  2977. END;
  2978. RETURN result
  2979. END GetSizeFromTag;
  2980. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2981. VAR parameter: SyntaxTree.Parameter;
  2982. BEGIN
  2983. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2984. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2985. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2986. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2987. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2988. END;
  2989. RETURN GetDynamicSize(e.type, tag);
  2990. END GetArrayOfBytesSize;
  2991. (*
  2992. to find imported symbol. not needed ?
  2993. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2994. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2995. BEGIN
  2996. IF AddImport(moduleName,importedModule,FALSE) THEN
  2997. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2998. RETURN symbol
  2999. ELSE
  3000. RETURN NIL
  3001. END
  3002. END SymbolByName;
  3003. *)
  3004. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3005. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3006. BEGIN
  3007. IF AddImport(moduleName,runtimeModule,force) THEN
  3008. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3009. IF procedure = NIL THEN
  3010. s := "Procedure ";
  3011. Strings.Append(s,moduleName);
  3012. Strings.Append(s,".");
  3013. Strings.Append(s,procedureName);
  3014. Strings.Append(s," not present");
  3015. Error(position,s);
  3016. RETURN FALSE
  3017. ELSE
  3018. RETURN TRUE
  3019. END;
  3020. ELSE RETURN FALSE
  3021. END;
  3022. END GetRuntimeProcedure;
  3023. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3024. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3025. s: Basic.MessageString;
  3026. BEGIN
  3027. Basic.InitSegmentedName(name);
  3028. name[0] := Basic.MakeString(moduleName);
  3029. name[1] := Basic.MakeString(typeName);
  3030. name[2] := -1;
  3031. IF AddImport(moduleName,importedModule, FALSE) THEN
  3032. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3033. IF symbol = NIL THEN
  3034. s := "type ";
  3035. Strings.Append(s,moduleName);
  3036. Strings.Append(s,".");
  3037. Strings.Append(s,typeName);
  3038. Strings.Append(s," not present");
  3039. Error(position,s);
  3040. END;
  3041. ELSE symbol := NIL;
  3042. END;
  3043. IF importedModule = moduleScope.ownerModule THEN
  3044. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3045. ELSE
  3046. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3047. END;
  3048. RETURN symbol
  3049. END GetTypeDescriptor;
  3050. (* 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. *)
  3051. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3052. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3053. pooledName: Basic.SegmentedName; size: LONGINT;
  3054. BEGIN
  3055. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3056. StaticCallOperand(result,procedure);
  3057. IF numberParameters < 0 THEN
  3058. size := ProcParametersSize(procedure);
  3059. ELSE
  3060. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3061. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3062. Error(position,"runtime call parameter count mismatch");
  3063. END;
  3064. END;
  3065. Emit(Call(position, result.op, size));
  3066. ReleaseOperand(result);
  3067. ELSE (* only static linking possible *)
  3068. ASSERT(numberParameters >= 0);
  3069. Basic.InitSegmentedName(pooledName);
  3070. pooledName[0] := Basic.MakeString(moduleName);
  3071. pooledName[1] := Basic.MakeString(procedureName);
  3072. pooledName[2] := -1;
  3073. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3074. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3075. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3076. END;
  3077. END CallThisChecked;
  3078. (* 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. *)
  3079. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3080. BEGIN
  3081. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3082. END CallThis;
  3083. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  3084. VAR
  3085. left,right: Operand;
  3086. leftSize, rightSize: IntermediateCode.Operand;
  3087. saved: RegisterEntry;
  3088. reg: IntermediateCode.Operand;
  3089. procedureName: SyntaxTree.IdentifierString;
  3090. BEGIN
  3091. procedureName := "CompareString";
  3092. SaveRegisters();ReleaseUsedRegisters(saved);
  3093. Designate(leftExpression,left);
  3094. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3095. Emit(Push(position,leftSize));
  3096. ReleaseIntermediateOperand(leftSize);
  3097. Emit(Push(position,left.op));
  3098. ReleaseOperand(left);
  3099. Designate(rightExpression,right);
  3100. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3101. Emit(Push(position,rightSize));
  3102. ReleaseIntermediateOperand(rightSize);
  3103. Emit(Push(position,right.op));
  3104. ReleaseOperand(right);
  3105. CallThis(position,builtinsModuleName,procedureName, 4);
  3106. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3107. Emit(Result(position,reg));
  3108. (*
  3109. AcquireThisRegister(int8,IntermediateCode.Result);
  3110. *)
  3111. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3112. (*
  3113. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3114. *)
  3115. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3116. ReleaseIntermediateOperand(reg);
  3117. BrL(falseLabel);
  3118. END CompareString;
  3119. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3120. VAR
  3121. left,right: Operand;
  3122. leftSize, rightSize: IntermediateCode.Operand;
  3123. saved: RegisterEntry;
  3124. procedureName: SyntaxTree.IdentifierString;
  3125. BEGIN
  3126. procedureName := "CopyString";
  3127. SaveRegisters();ReleaseUsedRegisters(saved);
  3128. Designate(leftExpression,left);
  3129. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3130. Emit(Push(position,leftSize));
  3131. ReleaseIntermediateOperand(leftSize);
  3132. Emit(Push(position,left.op));
  3133. ReleaseOperand(left);
  3134. Designate(rightExpression,right);
  3135. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3136. Emit(Push(position,rightSize));
  3137. ReleaseIntermediateOperand(rightSize);
  3138. Emit(Push(position,right.op));
  3139. ReleaseOperand(right);
  3140. CallThis(position,builtinsModuleName,procedureName,4);
  3141. RestoreRegisters(saved);
  3142. END CopyString;
  3143. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3144. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3145. leftType,rightType: SyntaxTree.Type;
  3146. leftExpression,rightExpression : SyntaxTree.Expression;
  3147. componentType: IntermediateCode.Type;
  3148. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3149. size: LONGINT;
  3150. BEGIN
  3151. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3152. dest := destination; destination := emptyOperand;
  3153. leftType := x.left.type.resolved;
  3154. rightType := x.right.type.resolved;
  3155. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3156. CASE x.operator OF
  3157. Scanner.Or:
  3158. (* shortcut evaluation of left OR right *)
  3159. IF ~conditional THEN ConditionToValue(x);
  3160. ELSE
  3161. next := NewLabel();
  3162. Condition(x.left,trueLabel,next);
  3163. SetLabel(next);
  3164. Condition(x.right,trueLabel,falseLabel);
  3165. END;
  3166. |Scanner.And:
  3167. (* shortcut evaluation of left & right *)
  3168. IF ~conditional THEN ConditionToValue(x);
  3169. ELSE
  3170. next := NewLabel();
  3171. Condition(x.left,next,falseLabel);
  3172. SetLabel(next);
  3173. Condition(x.right,trueLabel,falseLabel);
  3174. END;
  3175. |Scanner.Is:
  3176. IF ~conditional THEN ConditionToValue(x);
  3177. ELSE
  3178. (* get type desc tag *)
  3179. IF IsPointerToRecord(leftType,recordType) THEN
  3180. Evaluate(x.left,left);
  3181. Dereference(left,recordType,IsUnsafePointer(leftType))
  3182. ELSE
  3183. Designate(x.left,left);
  3184. END;
  3185. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3186. ReleaseOperand(left);
  3187. END;
  3188. |Scanner.Plus:
  3189. Evaluate(x.left,left);
  3190. Evaluate(x.right,right);
  3191. IF leftType IS SyntaxTree.SetType THEN
  3192. InitOperand(result,ModeValue);
  3193. Reuse2a(result.op,left.op,right.op,dest);
  3194. Emit(Or(position,result.op,left.op,right.op));
  3195. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3196. InitOperand(result,ModeValue);
  3197. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3198. Reuse2(result.tag,left.tag,right.tag);
  3199. Emit(Add(position,result.op,left.op,right.op));
  3200. Emit(Add(position,result.tag,left.tag,right.tag))
  3201. ELSE
  3202. InitOperand(result,ModeValue);
  3203. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3204. AddInt(result.op, left.op, right.op) ;
  3205. ELSE
  3206. *)
  3207. Reuse2a(result.op,left.op,right.op,dest);
  3208. Emit(Add(position,result.op,left.op,right.op));
  3209. (*
  3210. END;
  3211. *)
  3212. END;
  3213. ReleaseOperand(left); ReleaseOperand(right);
  3214. |Scanner.Minus:
  3215. Evaluate(x.left,left);
  3216. Evaluate(x.right,right);
  3217. IF leftType IS SyntaxTree.SetType THEN
  3218. InitOperand(result,ModeValue);
  3219. Reuse1(result.op,right.op);
  3220. Emit(Not(position,result.op,right.op));
  3221. ReleaseOperand(right);
  3222. Emit(And(position,result.op,result.op,left.op));
  3223. ReleaseOperand(left);
  3224. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3225. InitOperand(result,ModeValue);
  3226. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3227. Reuse2(result.tag,left.tag,right.tag);
  3228. Emit(Sub(position,result.op,left.op,right.op));
  3229. Emit(Sub(position,result.tag,left.tag,right.tag));
  3230. ReleaseOperand(left); ReleaseOperand(right)
  3231. ELSE
  3232. InitOperand(result,ModeValue);
  3233. Reuse2a(result.op,left.op,right.op,dest);
  3234. Emit(Sub(position,result.op,left.op,right.op));
  3235. ReleaseOperand(left); ReleaseOperand(right);
  3236. END;
  3237. |Scanner.Times:
  3238. Evaluate(x.left,left);
  3239. Evaluate(x.right,right);
  3240. IF leftType IS SyntaxTree.SetType THEN
  3241. InitOperand(result,ModeValue);
  3242. Reuse2a(result.op,left.op,right.op,dest);
  3243. Emit(And(position,result.op,left.op,right.op));
  3244. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3245. InitOperand(result, ModeValue);
  3246. componentType := left.op.type;
  3247. (* TODO: review this *)
  3248. (*
  3249. result.op = left.op * right.op - left.tag * right.tag
  3250. result.tag = left.tag * right.op + left.op * right.tag
  3251. *)
  3252. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3253. Emit(Mul(position,result.op, left.op, right.op));
  3254. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3255. Emit(Mul(position,tempReg, left.tag, right.tag));
  3256. Emit(Sub(position,result.op, result.op, tempReg));
  3257. Reuse2(result.tag, left.tag, right.op);
  3258. Emit(Mul(position,result.tag, left.tag, right.op));
  3259. Emit(Mul(position,tempReg, left.op, right.tag));
  3260. Emit(Add(position,result.tag, result.tag, tempReg));
  3261. ReleaseIntermediateOperand(tempReg)
  3262. ELSE
  3263. InitOperand(result,ModeValue);
  3264. Reuse2a(result.op,left.op,right.op,dest);
  3265. Emit(Mul(position,result.op,left.op,right.op));
  3266. END;
  3267. ReleaseOperand(left); ReleaseOperand(right);
  3268. |Scanner.Div:
  3269. Evaluate(x.left,left);
  3270. Evaluate(x.right,right);
  3271. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3272. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3273. IF ~isUnchecked THEN
  3274. exit := NewLabel();
  3275. BrltL(exit,zero,right.op);
  3276. EmitTrap(position,NegativeDivisorTrap);
  3277. SetLabel(exit);
  3278. END;
  3279. END;
  3280. InitOperand(result,ModeValue);
  3281. Reuse2a(result.op,left.op,right.op,dest);
  3282. Emit(Div(position,result.op,left.op,right.op));
  3283. ReleaseOperand(left); ReleaseOperand(right);
  3284. |Scanner.Mod:
  3285. Evaluate(x.left,left);
  3286. Evaluate(x.right,right);
  3287. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3288. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3289. IF ~isUnchecked THEN
  3290. exit := NewLabel();
  3291. BrltL(exit,zero,right.op);
  3292. EmitTrap(position,NegativeDivisorTrap);
  3293. SetLabel(exit);
  3294. END;
  3295. END;
  3296. InitOperand(result,ModeValue);
  3297. Reuse2a(result.op,left.op,right.op,dest);
  3298. Emit(Mod(position,result.op,left.op,right.op));
  3299. ReleaseOperand(left); ReleaseOperand(right);
  3300. |Scanner.Slash:
  3301. Evaluate(x.left,left);
  3302. Evaluate(x.right,right);
  3303. IF leftType IS SyntaxTree.SetType THEN
  3304. InitOperand(result,ModeValue);
  3305. Reuse2a(result.op,left.op,right.op,dest);
  3306. Emit(Xor(position,result.op,left.op,right.op));
  3307. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3308. InitOperand(result,ModeValue);
  3309. componentType := left.op.type;
  3310. (* review this *)
  3311. (*
  3312. divisor = right.op * right.op + right.tag * right.tag
  3313. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3314. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3315. *)
  3316. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3317. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3318. Emit(Mul(position,tempReg, right.op, right.op));
  3319. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3320. Emit(Add(position,tempReg, tempReg, tempReg2));
  3321. result.op := tempReg2;
  3322. Emit(Mul(position,result.op, left.op, right.op));
  3323. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3324. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3325. Emit(Add(position,result.op, result.op, tempReg2));
  3326. Emit(Div(position,result.op, result.op, tempReg));
  3327. Reuse2(result.tag, left.tag, right.op);
  3328. Emit(Mul(position,result.tag, left.tag, right.op));
  3329. Emit(Mul(position,tempReg2, left.op, right.tag));
  3330. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3331. Emit(Div(position,result.tag, result.tag, tempReg));
  3332. ReleaseIntermediateOperand(tempReg);
  3333. ReleaseIntermediateOperand(tempReg2)
  3334. ELSE
  3335. InitOperand(result,ModeValue);
  3336. Reuse2a(result.op,left.op,right.op,dest);
  3337. Emit(Div(position,result.op,left.op,right.op));
  3338. END;
  3339. ReleaseOperand(left); ReleaseOperand(right);
  3340. |Scanner.Equal:
  3341. IF ~conditional THEN ConditionToValue(x);
  3342. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3343. CompareString(BreqL,x.left,x.right);
  3344. ELSE
  3345. Evaluate(x.left,left);
  3346. Evaluate(x.right,right);
  3347. IF leftType IS SyntaxTree.RangeType THEN
  3348. ASSERT(rightType IS SyntaxTree.RangeType);
  3349. BrneL(falseLabel, left.op, right.op); (* first *)
  3350. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3351. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3352. ReleaseOperand(left); ReleaseOperand(right);
  3353. BrL(trueLabel)
  3354. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3355. BrneL(falseLabel, left.op, right.op); (* first *)
  3356. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3357. ReleaseOperand(left); ReleaseOperand(right);
  3358. BrL(trueLabel)
  3359. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3360. (* TODO: review this *)
  3361. BrneL(falseLabel, left.op, right.op); (* real part *)
  3362. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3363. ReleaseOperand(left); ReleaseOperand(right);
  3364. BrL(trueLabel)
  3365. ELSE
  3366. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3367. ReleaseOperand(left); ReleaseOperand(right);
  3368. BrL(trueLabel);
  3369. END;
  3370. END;
  3371. |Scanner.LessEqual:
  3372. IF ~conditional THEN ConditionToValue(x);
  3373. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3374. CompareString(BrgeL,x.right,x.left);
  3375. ELSE
  3376. Evaluate(x.left,left);
  3377. Evaluate(x.right,right);
  3378. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3379. Reuse1(temp.op,right.op);
  3380. Emit(And(position,temp.op,left.op,right.op));
  3381. ReleaseOperand(right);
  3382. BreqL(trueLabel,temp.op,left.op);
  3383. BrL(falseLabel);
  3384. ReleaseOperand(temp);ReleaseOperand(left);
  3385. ELSE
  3386. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3387. ReleaseOperand(left); ReleaseOperand(right);
  3388. BrL(trueLabel);
  3389. END;
  3390. END;
  3391. |Scanner.Less:
  3392. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3393. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3394. leftExpression.SetType(system.booleanType);
  3395. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3396. rightExpression.SetType(system.booleanType);
  3397. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3398. leftExpression.SetType(system.booleanType);
  3399. Expression(leftExpression);
  3400. ELSIF ~conditional THEN ConditionToValue(x);
  3401. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3402. CompareString(BrltL,x.left,x.right);
  3403. ELSE
  3404. Evaluate(x.left,left);
  3405. Evaluate(x.right,right);
  3406. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3407. ReleaseOperand(left); ReleaseOperand(right);
  3408. BrL(trueLabel);
  3409. END;
  3410. |Scanner.Greater:
  3411. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3412. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3413. leftExpression.SetType(system.booleanType);
  3414. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3415. rightExpression.SetType(system.booleanType);
  3416. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3417. leftExpression.SetType(system.booleanType);
  3418. Expression(leftExpression);
  3419. ELSIF ~conditional THEN ConditionToValue(x);
  3420. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3421. CompareString(BrltL,x.right,x.left);
  3422. ELSE
  3423. Evaluate(x.left,left);
  3424. Evaluate(x.right,right);
  3425. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3426. ReleaseOperand(left); ReleaseOperand(right);
  3427. BrL(trueLabel);
  3428. END;
  3429. |Scanner.GreaterEqual:
  3430. IF ~conditional THEN ConditionToValue(x);
  3431. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3432. CompareString(BrgeL,x.left,x.right);
  3433. ELSE
  3434. Evaluate(x.left,left);
  3435. Evaluate(x.right,right);
  3436. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3437. Reuse1(temp.op,left.op);
  3438. Emit(And(position,temp.op,left.op,right.op));
  3439. ReleaseOperand(left);
  3440. BreqL(trueLabel, temp.op,right.op);
  3441. ReleaseOperand(temp); ReleaseOperand(right);
  3442. BrL(falseLabel);
  3443. ELSE
  3444. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3445. ReleaseOperand(left); ReleaseOperand(right);
  3446. BrL(trueLabel);
  3447. END;
  3448. END;
  3449. |Scanner.Unequal:
  3450. IF ~conditional THEN ConditionToValue(x);
  3451. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3452. CompareString(BrneL,x.left,x.right);
  3453. ELSE
  3454. Evaluate(x.left,left);
  3455. Evaluate(x.right,right);
  3456. IF leftType IS SyntaxTree.RangeType THEN
  3457. ASSERT(rightType IS SyntaxTree.RangeType);
  3458. BrneL(trueLabel, left.op, right.op); (* first *)
  3459. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3460. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3461. ReleaseOperand(left); ReleaseOperand(right);
  3462. BrL(falseLabel)
  3463. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3464. BrneL(trueLabel, left.op, right.op); (* first *)
  3465. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3466. ReleaseOperand(left); ReleaseOperand(right);
  3467. BrL(falseLabel)
  3468. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3469. (* TODO: review this *)
  3470. BrneL(trueLabel, left.op, right.op); (* real part *)
  3471. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3472. ReleaseOperand(left); ReleaseOperand(right);
  3473. BrL(falseLabel)
  3474. ELSE
  3475. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3476. ReleaseOperand(left); ReleaseOperand(right);
  3477. BrL(trueLabel);
  3478. END;
  3479. END;
  3480. |Scanner.In:
  3481. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3482. Evaluate(x.left,left);
  3483. Evaluate(x.right,right);
  3484. Convert(left.op,setType);
  3485. Convert(right.op,setType);
  3486. ReuseCopy(temp.op,right.op);
  3487. Emit(Shr(position,temp.op,temp.op,left.op));
  3488. ReleaseOperand(right); ReleaseOperand(left);
  3489. IntermediateCode.InitImmediate(one,setType,1);
  3490. Emit(And(position,temp.op,temp.op,one));
  3491. IF conditional THEN
  3492. IntermediateCode.InitImmediate(zero,setType,0);
  3493. BrneL(trueLabel,temp.op,zero);
  3494. ReleaseOperand(temp);
  3495. BrL(falseLabel);
  3496. ELSE
  3497. Convert(temp.op,bool);
  3498. result.mode := ModeValue;
  3499. result.op := temp.op;
  3500. result.tag := nil; (* may be left over from calls to evaluate *)
  3501. END;
  3502. ELSE
  3503. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3504. IF x.operator = Scanner.Questionmarks THEN
  3505. leftExpression := x.left;
  3506. rightExpression := x.right;
  3507. ELSE
  3508. leftExpression := x.right;
  3509. rightExpression := x.left;
  3510. END;
  3511. Evaluate(leftExpression, left);
  3512. Emit(Push(position,left.op));
  3513. ReleaseOperand(left);
  3514. Designate(rightExpression, right);
  3515. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3516. IF ~backend.cellsAreObjects THEN
  3517. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3518. END;
  3519. Emit(Push(position,right.op));
  3520. ReleaseOperand(right);
  3521. IF backend.cellsAreObjects THEN
  3522. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3523. ELSE
  3524. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3525. END;
  3526. InitOperand(result, ModeValue);
  3527. result.op := NewRegisterOperand(bool);
  3528. Emit(Result(position,result.op));
  3529. IF conditional THEN
  3530. IntermediateCode.InitImmediate(zero,setType,0);
  3531. BrneL(trueLabel,result.op,zero);
  3532. ReleaseOperand(result);
  3533. BrL(falseLabel);
  3534. END;
  3535. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3536. leftExpression := x.left;
  3537. rightExpression := x.right;
  3538. Evaluate(leftExpression, left);
  3539. Emit(Push(position,left.op));
  3540. ReleaseOperand(left);
  3541. Evaluate(rightExpression, right);
  3542. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3543. IF ~backend.cellsAreObjects THEN
  3544. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3545. END;
  3546. Emit(Push(position,right.op));
  3547. ReleaseOperand(right);
  3548. IF backend.cellsAreObjects THEN
  3549. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3550. ELSE
  3551. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3552. END;
  3553. InitOperand(result, ModeValue);
  3554. result.op := NewRegisterOperand(bool);
  3555. Emit(Result(position,result.op));
  3556. IF conditional THEN
  3557. IntermediateCode.InitImmediate(zero,setType,0);
  3558. BrneL(trueLabel,result.op,zero);
  3559. ReleaseOperand(result);
  3560. BrL(falseLabel);
  3561. END;
  3562. ELSE
  3563. HALT(100);
  3564. END;
  3565. END;
  3566. destination := dest;
  3567. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3568. END VisitBinaryExpression;
  3569. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3570. VAR localResult, operand: Operand;
  3571. BEGIN
  3572. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3573. InitOperand(localResult, ModeValue);
  3574. ASSERT(x.first # NIL);
  3575. Evaluate(x.first, operand);
  3576. localResult.op := operand.op;
  3577. ReleaseOperand(operand);
  3578. UseIntermediateOperand(localResult.op);
  3579. ASSERT(x.last # NIL);
  3580. Evaluate(x.last, operand);
  3581. localResult.tag := operand.op;
  3582. ReleaseOperand(operand);
  3583. UseIntermediateOperand(localResult.tag);
  3584. IF x.step # NIL THEN
  3585. Evaluate(x.step, operand);
  3586. localResult.extra := operand.op;
  3587. ReleaseOperand(operand);
  3588. UseIntermediateOperand(localResult.extra);
  3589. END;
  3590. result := localResult;
  3591. IF Trace THEN TraceExit("VisitRangeExpression") END
  3592. END VisitRangeExpression;
  3593. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3594. BEGIN
  3595. HALT(100); (* should never be evaluated *)
  3596. END VisitTensorRangeExpression;
  3597. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3598. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3599. BEGIN
  3600. IF Trace THEN TraceEnter("VisitConversion") END;
  3601. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3602. dest := destination; destination := emptyOperand;
  3603. Evaluate(x.expression,old);
  3604. InitOperand(result,ModeValue);
  3605. result.op := old.op;
  3606. ASSERT(result.op.mode # 0);
  3607. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3608. (* convert TO a complex number *)
  3609. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3610. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3611. ASSERT(result.op.mode # 0);
  3612. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3613. (* convert FROM a complex number TO a complex number*)
  3614. result.tag := old.tag;
  3615. ASSERT(result.tag.mode # 0);
  3616. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3617. ASSERT(result.tag.mode # 0)
  3618. ELSE
  3619. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3620. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3621. END
  3622. ELSE
  3623. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3624. ASSERT(result.op.mode # 0);
  3625. result.tag := old.tag; (*! probably never used *)
  3626. END;
  3627. destination := dest;
  3628. IF Trace THEN TraceExit("VisitConversion") END;
  3629. END VisitConversion;
  3630. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3631. BEGIN
  3632. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3633. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3634. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3635. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3636. END VisitTypeDeclaration;
  3637. (** designators (expressions) *)
  3638. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3639. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3640. BEGIN
  3641. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3642. IF x.left # NIL THEN Expression(x.left) END;
  3643. Symbol(x.symbol,result);
  3644. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3645. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3646. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3647. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3648. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3649. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3650. END;
  3651. END;
  3652. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3653. END VisitSymbolDesignator;
  3654. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3655. BEGIN
  3656. IF isUnchecked THEN RETURN END;
  3657. IF tagsAvailable THEN
  3658. TrapC(BrltL,index,length,IndexCheckTrap);
  3659. END;
  3660. END BoundCheck;
  3661. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3662. VAR d: IntermediateCode.Operand;
  3663. BEGIN
  3664. IF isUnchecked THEN RETURN END;
  3665. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3666. TrapC(op,dim,d,ArraySizeTrap);
  3667. ReleaseIntermediateOperand(d);
  3668. END DimensionCheck;
  3669. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3670. VAR
  3671. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3672. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3673. expression: SyntaxTree.Expression;
  3674. resultingType, leftType, baseType: SyntaxTree.Type;
  3675. skipLabel1: Label;
  3676. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3677. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3678. variableOp: Operand;
  3679. variable: SyntaxTree.Variable;
  3680. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3681. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3682. VAR e: SyntaxTree.Expression; i: LONGINT;
  3683. BEGIN
  3684. tensorFound := FALSE;
  3685. FOR i := 0 TO parameters.Length()-1 DO
  3686. e := parameters.GetExpression(i);
  3687. IF e IS SyntaxTree.TensorRangeExpression THEN
  3688. ASSERT(~tensorFound);
  3689. tensorFound := TRUE;
  3690. ELSIF e IS SyntaxTree.RangeExpression THEN
  3691. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3692. ELSE
  3693. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3694. END;
  3695. END;
  3696. END CountIndices;
  3697. BEGIN
  3698. ASSERT(tagsAvailable);
  3699. resultingType := x.type.resolved; (* resulting type *)
  3700. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3701. InitOperand(localResult, ModeReference);
  3702. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3703. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3704. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3705. (* a globally defined array destination tag is available -> use and invalidate it*)
  3706. localResult.tag := arrayDestinationTag;
  3707. IntermediateCode.InitOperand(arrayDestinationTag)
  3708. ELSE
  3709. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3710. (* the result is of array range type and thus does not provide any collectable pointers *)
  3711. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3712. Symbol(variable, variableOp);
  3713. ReuseCopy(localResult.tag, variableOp.op);
  3714. ReleaseOperand(variableOp);
  3715. END
  3716. END;
  3717. indexListSize := x.parameters.Length();
  3718. CountIndices(x.parameters);
  3719. (*ASSERT(tensorRangeCount <= 1);*)
  3720. (* designate the array to be indexed over, perform tensor range check if known *)
  3721. Designate(x.left, array);
  3722. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3723. Dereference(array, leftType,FALSE);
  3724. IF ~tensorFound THEN
  3725. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3726. END
  3727. END;
  3728. (* default base offset *)
  3729. srcDimOffset := 0;
  3730. destDimOffset := 0;
  3731. indexDim := 0;
  3732. (* use address of source array as basis *)
  3733. localResult.op := array.op;
  3734. UseIntermediateOperand(localResult.op);
  3735. (* go through the index list *)
  3736. FOR i := 0 TO indexListSize - 1 DO
  3737. expression := x.parameters.GetExpression(i);
  3738. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3739. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3740. srcDimOffset := -indexListSize;
  3741. destDimOffset := -suffixRanges;
  3742. ELSE
  3743. (* determine which dimension of source array is currently looked at *)
  3744. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3745. (* get the memory operand pointing to array descriptor dimension *)
  3746. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3747. (* make a reusable register from it *)
  3748. ReuseCopy(srcDim, tmp);
  3749. ReleaseIntermediateOperand(tmp);
  3750. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3751. ELSE
  3752. srcDim := IntermediateCode.Immediate(sizeType, i);
  3753. END;
  3754. (* get length and increment of source array for current dimension *)
  3755. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3756. Convert(sourceLength.op, sizeType);
  3757. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3758. Convert(sourceIncrement.op, sizeType);
  3759. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3760. ReleaseIntermediateOperand(srcDim);
  3761. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3762. (* SINGLE INDEX *)
  3763. Evaluate(expression, index);
  3764. ReleaseIntermediateOperand(index.tag);
  3765. index.tag := emptyOperand;
  3766. Convert(index.op, sizeType);
  3767. (* lower bound check *)
  3768. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3769. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3770. ELSIF isUnchecked THEN (* do nothing *)
  3771. ELSE
  3772. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3773. END;
  3774. (* upper bound check *)
  3775. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3776. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3777. ELSIF isUnchecked THEN (* do nothing *)
  3778. ELSE
  3779. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3780. END;
  3781. ReleaseOperand(sourceLength);
  3782. Convert(index.op, addressType);
  3783. summand := index.op;
  3784. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3785. (* RANGE OF INDICES *)
  3786. Evaluate(expression, range);
  3787. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3788. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3789. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3790. ReleaseOperand(range);
  3791. Convert(firstIndex, sizeType);
  3792. Convert(lastIndex, sizeType);
  3793. Convert(stepSize, sizeType);
  3794. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3795. if it is 'MAX(LONGINT)' *)
  3796. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3797. TransferToRegister(lastIndex, lastIndex);
  3798. skipLabel1 := NewLabel();
  3799. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3800. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3801. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3802. SetLabel(skipLabel1)
  3803. END;
  3804. (* check if step size is valid *)
  3805. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3806. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3807. ELSIF isUnchecked THEN (* do nothing *)
  3808. ELSE
  3809. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3810. END;
  3811. (* check lower bound check *)
  3812. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3813. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3814. ELSIF isUnchecked THEN (* do nothing *)
  3815. ELSE
  3816. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3817. END;
  3818. (* check upper bound check *)
  3819. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3820. (* statically open range: nothing to do *)
  3821. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3822. ASSERT(staticLastIndex < staticSourceLength)
  3823. ELSIF isUnchecked THEN (* do nothing *)
  3824. ELSE
  3825. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3826. END;
  3827. (* determine length of target array for current dimension *)
  3828. (* 1. incorporate last index: *)
  3829. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3830. (* last index is static *)
  3831. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3832. targetLength := sourceLength.op
  3833. ELSE
  3834. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3835. END;
  3836. UseIntermediateOperand(targetLength);
  3837. ELSE
  3838. (* targetLength := lastIndex + 1
  3839. Reuse1(targetLength, lastIndex);
  3840. *)
  3841. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3842. END;
  3843. ReleaseOperand(sourceLength);
  3844. ReleaseIntermediateOperand(lastIndex);
  3845. (* 2. incorporate first index: *)
  3846. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3847. (* first index and current target length are static *)
  3848. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3849. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3850. (* first index = 0: nothing to do *)
  3851. ELSE
  3852. (* targetLength := targetLength - firstIndex *)
  3853. TransferToRegister(targetLength, targetLength);
  3854. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3855. END;
  3856. (* clip negative lengths to 0 *)
  3857. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3858. IF staticTargetLength < 0 THEN
  3859. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3860. END
  3861. ELSE
  3862. skipLabel1 := NewLabel();
  3863. TransferToRegister(targetLength, targetLength);
  3864. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3865. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3866. SetLabel(skipLabel1)
  3867. END;
  3868. (* 3. incorporate index step size: *)
  3869. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3870. (*step size and current target length are static *)
  3871. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3872. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3873. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3874. (* step size = 1: nothing to do *)
  3875. ELSE
  3876. (* emit code for this:
  3877. targetLength := (targetLength-1) DIV stepSize +1;
  3878. *)
  3879. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3880. DivInt(targetLength, targetLength, stepSize);
  3881. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3882. END;
  3883. (* determine increment of target array for current dimension *)
  3884. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3885. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3886. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3887. (* step size = 1 *)
  3888. targetIncrement := sourceIncrement.op;
  3889. UseIntermediateOperand(targetIncrement)
  3890. ELSE
  3891. (* targetIncrement := sourceIncrement * stepSize *)
  3892. Reuse1(targetIncrement, stepSize);
  3893. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3894. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3895. END;
  3896. ReleaseIntermediateOperand(stepSize);
  3897. (* write length and increment of target array to descriptor *)
  3898. IF destDimOffset < 0 THEN
  3899. (* determine which dimension of target array is currently looked at *)
  3900. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3901. TransferToRegister(destDim, tmp);
  3902. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3903. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3904. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3905. ReleaseIntermediateOperand(destDim);
  3906. INC(destDimOffset);
  3907. ELSE
  3908. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3909. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3910. END;
  3911. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3912. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3913. INC(indexDim);
  3914. Convert(firstIndex, addressType);
  3915. TransferToRegister(summand, firstIndex);
  3916. ELSE HALT(100);
  3917. END;
  3918. (*
  3919. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3920. *)
  3921. Convert(sourceIncrement.op, addressType);
  3922. Convert(summand, addressType);
  3923. MulInt(summand, summand, sourceIncrement.op);
  3924. ReleaseIntermediateOperand(sourceIncrement.op);
  3925. AddInt(localResult.op, localResult.op, summand);
  3926. ReleaseIntermediateOperand(summand);
  3927. END
  3928. END;
  3929. result := localResult;
  3930. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3931. ReleaseIntermediateOperand(result.tag);
  3932. result.tag := TypeDescriptorAdr(resultingType);
  3933. IF ~newObjectFile THEN
  3934. IntermediateCode.MakeMemory(result.tag,addressType);
  3935. END;
  3936. ELSIF IsDelegate(resultingType) THEN
  3937. ReleaseIntermediateOperand(result.tag);
  3938. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3939. UseIntermediateOperand(result.tag);
  3940. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3941. ReleaseIntermediateOperand(result.tag);
  3942. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3943. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3944. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3945. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3946. (* finalize target array descriptor *)
  3947. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3948. (* write lengths and increments of target array for remaining dimensions *)
  3949. i := indexListSize;
  3950. WHILE indexDim < targetArrayDimensionality DO
  3951. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3952. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3953. ReleaseOperand(sourceLength);
  3954. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3955. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3956. ReleaseOperand(sourceIncrement);
  3957. INC(i); INC(indexDim);
  3958. END;
  3959. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3960. tmp := nil;
  3961. ELSE
  3962. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3963. END;
  3964. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3965. ReleaseIntermediateOperand(tmp);
  3966. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3967. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3968. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3969. ELSE
  3970. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3971. END;
  3972. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3973. ReleaseIntermediateOperand(tmp);
  3974. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3975. (* write dimensionality *)
  3976. IF targetArrayDimensionality # 0 THEN
  3977. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3978. END;
  3979. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3980. END;
  3981. ReleaseOperand(array);
  3982. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3983. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3984. END;
  3985. END MathIndexDesignator;
  3986. (* get the length of an array , trying to make use of static information *)
  3987. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3988. VAR res: IntermediateCode.Operand; size: LONGINT;
  3989. BEGIN
  3990. type := type.resolved;
  3991. IF type IS SyntaxTree.ArrayType THEN
  3992. WITH type: SyntaxTree.ArrayType DO
  3993. IF type.form = SyntaxTree.Static THEN
  3994. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3995. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3996. Evaluate(type.length, op);
  3997. ReleaseIntermediateOperand(op.tag);
  3998. RETURN op.op;*)
  3999. ELSE
  4000. res := tag;
  4001. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4002. IntermediateCode.MakeMemory(res,addressType);
  4003. UseIntermediateOperand(res);
  4004. RETURN res
  4005. END
  4006. END;
  4007. ELSE
  4008. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4009. RETURN IntermediateCode.Immediate(addressType,size);
  4010. END;
  4011. END ArrayLength;
  4012. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4013. BEGIN
  4014. IF IsImmediate(x) THEN
  4015. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4016. ELSE
  4017. IF ~ReusableRegister(res) THEN
  4018. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4019. ELSE
  4020. UseIntermediateOperand(res);
  4021. END;
  4022. Emit(Mov(position,res,x))
  4023. END;
  4024. END CopyInt;
  4025. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4026. BEGIN
  4027. ReleaseIntermediateOperand(res);
  4028. IF IsImmediate(x) & IsImmediate(y) THEN
  4029. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4030. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4031. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4032. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4033. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4034. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4035. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4036. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4037. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4038. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4039. UseIntermediateOperand(res);
  4040. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4041. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4042. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4043. UseIntermediateOperand(res);
  4044. ELSE
  4045. IF ~ReusableRegister(res) THEN
  4046. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4047. ELSE
  4048. UseIntermediateOperand(res);
  4049. END;
  4050. IF IsImmediate(x) & (x.intValue = 0) THEN
  4051. Emit(Mov(position,res,y))
  4052. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4053. Emit(Mov(position,res,x))
  4054. ELSE
  4055. Emit(Add(position,res, x, y));
  4056. END;
  4057. END;
  4058. END AddInt;
  4059. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4060. BEGIN
  4061. ReleaseIntermediateOperand(res);
  4062. IF IsImmediate(x) & IsImmediate(y) THEN
  4063. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4064. ELSE
  4065. IF ~ReusableRegister(res) THEN
  4066. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4067. ELSE UseIntermediateOperand(res);
  4068. END;
  4069. IF IsImmediate(x) & (x.intValue = 1) THEN
  4070. Emit(Mov(position,res,y))
  4071. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4072. Emit(Mov(position,res,x))
  4073. ELSE
  4074. Emit(Mul(position,res, x, y));
  4075. END;
  4076. END;
  4077. END MulInt;
  4078. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4079. BEGIN
  4080. ReleaseIntermediateOperand(res);
  4081. IF IsImmediate(x) & IsImmediate(y) THEN
  4082. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4083. ELSE
  4084. IF ~ReusableRegister(res) THEN
  4085. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4086. ELSE UseIntermediateOperand(res);
  4087. END;
  4088. IF IsImmediate(x) & (x.intValue = 1) THEN
  4089. Emit(Mov(position,res,y))
  4090. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4091. Emit(Mov(position,res,x))
  4092. ELSE
  4093. Emit(Div(position,res, x, y));
  4094. END;
  4095. END;
  4096. END DivInt;
  4097. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4098. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4099. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4100. BEGIN
  4101. type := x.left.type.resolved;
  4102. IF type IS SyntaxTree.StringType THEN
  4103. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4104. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4105. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4106. type := atype;
  4107. x.left.SetType(type);
  4108. END;
  4109. IntermediateCode.InitImmediate(res,addressType,0);
  4110. maxDim := x.parameters.Length()-1;
  4111. (*
  4112. computation rule:
  4113. a: ARRAY X,Y,Z OF Element with size S
  4114. a[i,j,k] -->
  4115. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4116. *)
  4117. FOR i := 0 TO maxDim DO
  4118. e := x.parameters.GetExpression(i);
  4119. Evaluate(e,index);
  4120. Convert(index.op,addressType);
  4121. AddInt(res, res, index.op);
  4122. IF i = 0 THEN
  4123. (*
  4124. ReuseCopy(res, index.op);
  4125. *)
  4126. Designate(x.left,array);
  4127. type := x.left.type.resolved;
  4128. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4129. Dereference(array, type, FALSE);
  4130. END;
  4131. (*
  4132. ELSE AddInt(res, res, index.op);
  4133. *)
  4134. END;
  4135. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4136. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4137. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4138. BoundCheck(index.op, length);
  4139. END;
  4140. ReleaseIntermediateOperand(length);
  4141. END;
  4142. ReleaseOperand(index);
  4143. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4144. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4145. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4146. MulInt(res,res,length);
  4147. END;
  4148. ReleaseIntermediateOperand(length);
  4149. END;
  4150. (* remaining open dimensions -- compute address *)
  4151. i := maxDim+1;
  4152. IF type IS SyntaxTree.ArrayType THEN
  4153. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4154. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4155. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4156. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4157. MulInt(res,res,length);
  4158. END;
  4159. ReleaseIntermediateOperand(length);
  4160. INC(i);
  4161. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4162. END;
  4163. END;
  4164. IF (type IS SyntaxTree.ArrayType) THEN
  4165. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4166. size := StaticSize(system, type);
  4167. IF size # 1 THEN
  4168. length := IntermediateCode.Immediate(addressType,size);
  4169. MulInt(res,res,length);
  4170. END;
  4171. ELSE
  4172. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4173. IF size # 1 THEN
  4174. length := IntermediateCode.Immediate(addressType,size);
  4175. MulInt(res,res,length);
  4176. END;
  4177. END;
  4178. END;
  4179. AddInt(res,res,array.op);
  4180. InitOperand(result,ModeReference);
  4181. result.op := res;
  4182. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4183. ReleaseIntermediateOperand(result.tag);
  4184. result.tag := TypeDescriptorAdr(type);
  4185. IF ~newObjectFile THEN
  4186. IntermediateCode.MakeMemory(result.tag,addressType);
  4187. END
  4188. ELSIF IsDelegate(type) THEN
  4189. ReleaseIntermediateOperand(result.tag);
  4190. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4191. UseIntermediateOperand(result.tag);
  4192. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4193. ReleaseIntermediateOperand(result.tag);
  4194. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4195. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4196. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4197. END;
  4198. ReleaseOperand(array);
  4199. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4200. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4201. END;
  4202. END IndexDesignator;
  4203. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4204. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4205. BEGIN
  4206. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4207. dest := destination; destination := emptyOperand;
  4208. type := x.left.type.resolved;
  4209. IF type IS SyntaxTree.MathArrayType THEN
  4210. MathIndexDesignator(x);
  4211. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4212. IndexDesignator(x);
  4213. END;
  4214. destination := dest;
  4215. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4216. END VisitIndexDesignator;
  4217. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4218. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4219. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4220. procedure: SyntaxTree.Procedure;
  4221. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4222. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4223. BEGIN
  4224. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4225. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4226. parameters := expression.parameters;
  4227. moduleName := "FoxArrayBase";
  4228. procedureName := "CopyDescriptor";
  4229. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4230. SaveRegisters();ReleaseUsedRegisters(saved);
  4231. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4232. IF procedure = NIL THEN
  4233. s := "procedure ";
  4234. Strings.Append(s,moduleName);
  4235. Strings.Append(s,".");
  4236. Strings.Append(s,procedureName);
  4237. Strings.Append(s," not present");
  4238. Error(position,s);
  4239. ELSE
  4240. (* push address of temporary variable *)
  4241. Symbol(variable,destOperand);
  4242. Emit(Push(position,destOperand.op));
  4243. ReleaseOperand(destOperand);
  4244. (* push src *)
  4245. Evaluate(expression.left,srcOperand);
  4246. (*
  4247. Dereference(srcOperand,expression.type.resolved);
  4248. Emit(Push(position,srcOperand.tag));
  4249. *)
  4250. Emit(Push(position,srcOperand.op));
  4251. ReleaseOperand(srcOperand);
  4252. tensorFound := FALSE;
  4253. FOR i := 0 TO parameters.Length()-1 DO
  4254. e := parameters.GetExpression(i);
  4255. IF e IS SyntaxTree.TensorRangeExpression THEN
  4256. tensorFound := TRUE;
  4257. ELSIF e IS SyntaxTree.RangeExpression THEN
  4258. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4259. ELSE
  4260. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4261. END;
  4262. END;
  4263. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4264. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4265. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4266. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4267. StaticCallOperand(procOp,procedure);
  4268. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4269. ReleaseOperand(procOp);
  4270. END;
  4271. RestoreRegisters(saved);
  4272. END;
  4273. RETURN variable
  4274. END PrepareTensorDescriptor;
  4275. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4276. VAR
  4277. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4278. operand, tmpOperand, variableOp, variable2Op: Operand;
  4279. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4280. variable, variable2: SyntaxTree.Variable;
  4281. dim, i, size: LONGINT;
  4282. (* TODO: needed? *)
  4283. oldArrayDestinationTag: IntermediateCode.Operand;
  4284. oldArrayDestinationDimension: LONGINT;
  4285. position: Position;
  4286. saved: RegisterEntry;
  4287. arrayFlags: SET;
  4288. m, n: LONGINT;
  4289. PROCEDURE Pass(op: IntermediateCode.Operand);
  4290. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4291. BEGIN
  4292. IF numberRegister >= 0 THEN
  4293. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention,op.type,numberRegister));
  4294. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4295. Emit(Mov(position,parameterRegister, op));
  4296. ELSE
  4297. Emit(Push(position,op))
  4298. END
  4299. END Pass;
  4300. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4301. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4302. BEGIN
  4303. formalType := formalType.resolved; actualType := actualType.resolved;
  4304. IF IsOpenArray(formalType)THEN
  4305. IF actualType IS SyntaxTree.StringType THEN
  4306. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4307. RETURN;
  4308. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4309. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4310. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4311. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4312. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4313. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4314. ELSE
  4315. tmp := baseReg;
  4316. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4317. IntermediateCode.MakeMemory(tmp,addressType);
  4318. Pass((tmp));
  4319. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4320. END;
  4321. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4322. END;
  4323. END PushArrayLens;
  4324. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4325. BEGIN
  4326. CASE size OF
  4327. |2: INCL(flags,Size2Flag);
  4328. |3: INCL(flags,Size3Flag);
  4329. |4: INCL(flags,Size4Flag);
  4330. |5: INCL(flags,Size5Flag);
  4331. |6: INCL(flags,Size6Flag);
  4332. |7: INCL(flags,Size7Flag);
  4333. |8: INCL(flags,Size8Flag);
  4334. END;
  4335. END SetSmallArraySizeFlag;
  4336. BEGIN
  4337. IF Trace THEN TraceEnter("PushParameter") END;
  4338. position := expression.position;
  4339. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4340. type := expression.type.resolved;
  4341. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4342. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4343. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4344. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4345. );
  4346. (* TODO: needed? *)
  4347. oldArrayDestinationTag := arrayDestinationTag;
  4348. oldArrayDestinationDimension := arrayDestinationDimension;
  4349. IF IsArrayOfSystemByte(parameter.type) THEN
  4350. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4351. Designate(expression,operand);
  4352. ELSE
  4353. Evaluate(expression, tmpOperand);
  4354. (* array of system byte does not provide any pointers *)
  4355. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4356. Symbol(variable, operand);
  4357. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4358. Emit(Mov(position,tmp, tmpOperand.op));
  4359. ReleaseOperand(tmpOperand);
  4360. END;
  4361. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4362. ReleaseIntermediateOperand(operand.tag);
  4363. operand.tag := tmp;
  4364. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4365. Pass((operand.tag));
  4366. END;
  4367. Pass((operand.op));
  4368. ELSIF IsOpenArray(parameter.type) THEN
  4369. Designate(expression,operand);
  4370. baseReg := operand.tag;
  4371. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4372. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4373. END;
  4374. Pass((operand.op)); (* address of the array *)
  4375. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4376. (* case 1
  4377. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4378. *)
  4379. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4380. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4381. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4382. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4383. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4384. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4385. arrayDestinationTag := sp;
  4386. (* case 1b
  4387. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4388. *)
  4389. IF expression IS SyntaxTree.IndexDesignator THEN
  4390. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4391. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4392. arrayDestinationDimension := dim;
  4393. Designate(expression,operand);
  4394. (* case 1a
  4395. P(...,A,...) push: push array descriptor to stack
  4396. *)
  4397. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4398. Designate(expression,operand);
  4399. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4400. i := 0;
  4401. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4402. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4403. INC(i);
  4404. END;
  4405. type := expression.type.resolved;
  4406. WHILE (i<dim) DO (* remaining static dimensions *)
  4407. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4408. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4409. ReleaseOperand(tmpOperand);
  4410. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4411. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4412. ReleaseOperand(tmpOperand);
  4413. INC(i);
  4414. END;
  4415. dimOp := IntermediateCode.Immediate(addressType,dim);
  4416. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4417. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4418. (* case 1d
  4419. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4420. + case 1e
  4421. P(.. PT() ... );
  4422. *)
  4423. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4424. Designate(expression,operand);
  4425. Dereference(operand,type.resolved,FALSE);
  4426. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4427. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4428. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4429. (* case 1f
  4430. P(...,S,...) push: create array descriptor to S on stack
  4431. case 1g
  4432. P(... PS()...)
  4433. *)
  4434. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4435. Designate(expression,operand);
  4436. FOR i := 0 TO dim-1 DO
  4437. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4438. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4439. ReleaseOperand(tmpOperand);
  4440. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4441. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4442. ReleaseOperand(tmpOperand);
  4443. END;
  4444. (*******
  4445. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4446. *)
  4447. arrayFlags := {StaticFlag};
  4448. IF dim = 1 THEN
  4449. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4450. ReleaseOperand(tmpOperand);
  4451. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4452. m := LONGINT(tmpOperand.op.intValue);
  4453. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4454. ELSIF dim = 2 THEN
  4455. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4456. ReleaseOperand(tmpOperand);
  4457. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4458. m := LONGINT(tmpOperand.op.intValue);
  4459. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4460. ReleaseOperand(tmpOperand);
  4461. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4462. n := LONGINT(tmpOperand.op.intValue);
  4463. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4464. INCL(arrayFlags,SmallMatrixFlag);
  4465. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4466. END;
  4467. END;
  4468. (*******)
  4469. dimOp := IntermediateCode.Immediate(addressType,dim);
  4470. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4471. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4472. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4473. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4474. baseType := SemanticChecker.ArrayBase(type,dim);
  4475. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4476. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4477. ELSE HALT(100);
  4478. END;
  4479. (* case 2
  4480. procedure P([left args], var A: array [*,*] of Type, [right args])
  4481. *)
  4482. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4483. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4484. (* case 2b
  4485. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4486. push: push reference to pushed array descriptor
  4487. post: remove array descriptor.
  4488. *)
  4489. IF expression IS SyntaxTree.IndexDesignator THEN
  4490. descriptorType := GetMathArrayDescriptorType(dim);
  4491. (* range type : no allocation possible, should be untraced *)
  4492. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4493. Symbol(variable,variableOp);
  4494. arrayDestinationTag := variableOp.op;
  4495. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4496. arrayDestinationDimension := dim;
  4497. NeedDescriptor := TRUE;
  4498. Designate(expression,operand);
  4499. Pass((operand.tag));
  4500. NeedDescriptor := FALSE;
  4501. (* case 2a
  4502. P(...,A,...)
  4503. push: push reference to array descriptor on stack
  4504. *)
  4505. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4506. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4507. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4508. INC(i);
  4509. END;
  4510. IF i = dim THEN
  4511. Designate(expression,operand);
  4512. Pass((operand.tag));
  4513. ELSE (* open-static *)
  4514. type := expression.type.resolved;
  4515. descriptorType := GetMathArrayDescriptorType(dim);
  4516. (* static array , cannot be reallocated, untraced !*)
  4517. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4518. Symbol(variable,variableOp);
  4519. arrayDestinationTag := variableOp.op;
  4520. Designate(expression,operand);
  4521. FOR i := 0 TO dim-1 DO
  4522. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4523. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4524. ReleaseOperand(tmpOperand);
  4525. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4526. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4527. ReleaseOperand(tmpOperand);
  4528. END;
  4529. dimOp := IntermediateCode.Immediate(addressType,dim);
  4530. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4531. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4532. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4533. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4534. baseType := SemanticChecker.ArrayBase(type,dim);
  4535. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4536. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4537. Pass((arrayDestinationTag));
  4538. END;
  4539. (* case 2d
  4540. P(...,T,...) push: emit dimension check, push T
  4541. *)
  4542. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4543. Designate(expression,operand);
  4544. Dereference(operand,type.resolved,FALSE);
  4545. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4546. Pass((operand.tag));
  4547. (* case 2f
  4548. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4549. push: push reference to pushed array descriptor
  4550. post: remove array descriptor
  4551. *)
  4552. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4553. descriptorType := GetMathArrayDescriptorType(dim);
  4554. (* static array -- cannot be reallocatated, untraced *)
  4555. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4556. Symbol(variable,variableOp);
  4557. arrayDestinationTag := variableOp.op;
  4558. Designate(expression,operand);
  4559. FOR i := 0 TO dim-1 DO
  4560. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4561. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4562. ReleaseOperand(tmpOperand);
  4563. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4564. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4565. ReleaseOperand(tmpOperand);
  4566. END;
  4567. (*
  4568. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4569. *)
  4570. arrayFlags := {StaticFlag};
  4571. IF dim = 1 THEN
  4572. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4573. ReleaseOperand(tmpOperand);
  4574. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4575. m := LONGINT(tmpOperand.op.intValue);
  4576. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4577. ELSIF dim = 2 THEN
  4578. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4579. ReleaseOperand(tmpOperand);
  4580. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4581. m := LONGINT(tmpOperand.op.intValue);
  4582. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4583. ReleaseOperand(tmpOperand);
  4584. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4585. n := LONGINT(tmpOperand.op.intValue);
  4586. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4587. INCL(arrayFlags,SmallMatrixFlag);
  4588. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4589. END;
  4590. END;
  4591. (*******)
  4592. dimOp := IntermediateCode.Immediate(addressType,dim);
  4593. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4594. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4595. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4596. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4597. baseType := SemanticChecker.ArrayBase(type,dim);
  4598. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4599. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4600. Pass((arrayDestinationTag));
  4601. ELSE HALT(100);
  4602. END;
  4603. (* case 3
  4604. procedure P([left args], [const] A: array [?] of Type, [right args])
  4605. *)
  4606. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4607. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4608. (* case 3b
  4609. P(...,A[a..b,c..d],...)
  4610. *)
  4611. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4612. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4613. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4614. Symbol(variable,variableOp);
  4615. LoadValue(variableOp,system.addressType);
  4616. ELSE
  4617. descriptorType := GetMathArrayDescriptorType(dim);
  4618. (* range -- cannot be reallocated *)
  4619. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4620. Symbol(variable,variableOp);
  4621. END;
  4622. arrayDestinationTag := variableOp.op;
  4623. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4624. arrayDestinationDimension := 0;
  4625. Designate(expression,operand);
  4626. Pass((operand.tag));
  4627. (* case 3a
  4628. P(...,A,...)
  4629. *)
  4630. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4631. i := 0;
  4632. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4633. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4634. INC(i);
  4635. END;
  4636. IF i = dim THEN
  4637. Designate(expression,operand);
  4638. Pass((operand.tag));
  4639. ELSE (* open-static *)
  4640. type := expression.type.resolved;
  4641. descriptorType := GetMathArrayDescriptorType(dim);
  4642. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4643. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4644. Symbol(variable,variableOp);
  4645. arrayDestinationTag := variableOp.op;
  4646. Designate(expression,operand);
  4647. FOR i := 0 TO dim-1 DO
  4648. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4649. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4650. ReleaseOperand(tmpOperand);
  4651. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4652. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4653. ReleaseOperand(tmpOperand);
  4654. END;
  4655. dimOp := IntermediateCode.Immediate(addressType,dim);
  4656. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4657. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4658. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4659. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4660. baseType := SemanticChecker.ArrayBase(type,dim);
  4661. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4662. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4663. Pass((arrayDestinationTag));
  4664. END;
  4665. (* case 3d
  4666. P(...,T,...)
  4667. case 3e
  4668. P(...,PT(...),...)
  4669. *)
  4670. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4671. Designate(expression,operand);
  4672. Dereference(operand,type.resolved,FALSE);
  4673. Pass((operand.tag));
  4674. (* case 3f
  4675. P(...,S,...)
  4676. case 3g
  4677. P(...,PS(...),...)
  4678. *)
  4679. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4680. descriptorType := GetMathArrayDescriptorType(dim);
  4681. (* static array does not need to be traced *)
  4682. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4683. Symbol(variable,variableOp);
  4684. arrayDestinationTag := variableOp.op;
  4685. Designate(expression,operand);
  4686. IF operand.op.type.length >1 THEN (* vector register *)
  4687. (* static array does not need to be traced *)
  4688. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4689. Symbol(variable2, variable2Op);
  4690. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4691. Emit(Mov(position,tmp, operand.op));
  4692. ReleaseOperand(operand);
  4693. Symbol(variable2, operand);
  4694. END;
  4695. FOR i := 0 TO dim-1 DO
  4696. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4697. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4698. ReleaseOperand(tmpOperand);
  4699. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4700. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4701. ReleaseOperand(tmpOperand);
  4702. END;
  4703. dimOp := IntermediateCode.Immediate(addressType,dim);
  4704. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4705. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4706. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4707. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4708. baseType := SemanticChecker.ArrayBase(type,dim);
  4709. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4710. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4711. Pass((arrayDestinationTag));
  4712. ELSE HALT(100);
  4713. END;
  4714. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4715. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4716. (* case 4b
  4717. P(...,A[a..b,c..d],...)
  4718. *)
  4719. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4720. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4721. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4722. Symbol(variable,variableOp);
  4723. LoadValue(variableOp,system.addressType);
  4724. ELSE
  4725. descriptorType := GetMathArrayDescriptorType(dim);
  4726. (* range array -- cannot be allocated *)
  4727. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4728. Symbol(variable,variableOp);
  4729. END;
  4730. arrayDestinationTag := variableOp.op;
  4731. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4732. arrayDestinationDimension := 0;
  4733. Designate(expression,operand);
  4734. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4735. Symbol(variable,variableOp);
  4736. ELSE
  4737. (* alias to range -- untraced *)
  4738. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4739. Symbol(variable,variableOp);
  4740. MakeMemory(tmp,variableOp.op,addressType,0);
  4741. Emit(Mov(position,tmp,operand.tag));
  4742. ReleaseIntermediateOperand(tmp);
  4743. END;
  4744. Pass((variableOp.op));
  4745. ReleaseOperand(variableOp);
  4746. (* case 4a
  4747. P(...,A,...)
  4748. *)
  4749. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4750. i := 0;
  4751. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4752. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4753. INC(i);
  4754. END;
  4755. IF i = dim THEN
  4756. Designate(expression,operand);
  4757. arrayDestinationTag := operand.tag;
  4758. ELSE (* open-static *)
  4759. type := expression.type.resolved;
  4760. descriptorType := GetMathArrayDescriptorType(dim);
  4761. (* static array -- untraced *)
  4762. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4763. Symbol(variable,variableOp);
  4764. arrayDestinationTag := variableOp.op;
  4765. Designate(expression,operand);
  4766. FOR i := 0 TO dim-1 DO
  4767. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4768. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4769. ReleaseOperand(tmpOperand);
  4770. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4771. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4772. ReleaseOperand(tmpOperand);
  4773. END;
  4774. dimOp := IntermediateCode.Immediate(addressType,dim);
  4775. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4776. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4777. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4778. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4779. baseType := SemanticChecker.ArrayBase(type,dim);
  4780. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4781. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4782. END;
  4783. (* tensor alias to open array -- untraced *)
  4784. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4785. Symbol(variable,variableOp);
  4786. MakeMemory(tmp,variableOp.op,addressType,0);
  4787. Emit(Mov(position,tmp,arrayDestinationTag));
  4788. ReleaseIntermediateOperand(tmp);
  4789. Pass((variableOp.op));
  4790. ReleaseOperand(variableOp);
  4791. (* case 4d
  4792. P(...,T,...)
  4793. *)
  4794. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4795. Designate(expression,operand);
  4796. Pass((operand.op));
  4797. (* case 4f
  4798. P(...,S,...)
  4799. *)
  4800. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4801. descriptorType := GetMathArrayDescriptorType(dim);
  4802. (* static array -- cannot be reallocated, untraced *)
  4803. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4804. Symbol(variable,variableOp);
  4805. arrayDestinationTag := variableOp.op;
  4806. Designate(expression,operand);
  4807. FOR i := 0 TO dim-1 DO
  4808. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4809. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4810. ReleaseOperand(tmpOperand);
  4811. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4812. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4813. ReleaseOperand(tmpOperand);
  4814. END;
  4815. dimOp := IntermediateCode.Immediate(addressType,dim);
  4816. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4817. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4818. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4819. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4820. baseType := SemanticChecker.ArrayBase(type,dim);
  4821. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4822. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4823. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4824. Symbol(variable,variableOp);
  4825. MakeMemory(tmp,variableOp.op,addressType,0);
  4826. Emit(Mov(position,tmp,arrayDestinationTag));
  4827. ReleaseIntermediateOperand(tmp);
  4828. Pass((variableOp.op));
  4829. ReleaseOperand(variableOp);
  4830. ELSE HALT(100);
  4831. END;
  4832. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4833. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4834. Designate(expression,operand);
  4835. IF operand.op.type.length > 1 THEN
  4836. Emit(Push(position, operand.op));
  4837. ELSE
  4838. size := system.SizeOf(type);
  4839. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4840. size := ToMemoryUnits(system,size);
  4841. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4842. arrayDestinationTag := sp;
  4843. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4844. END;
  4845. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4846. Designate(expression,operand);
  4847. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4848. (* static array no pointer *)
  4849. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4850. Symbol(variable,variableOp);
  4851. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4852. Emit(Mov(position,tmp,operand.op));
  4853. Emit(Push(position,variableOp.op));
  4854. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4855. Pass((operand.op));
  4856. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4857. END;
  4858. ELSE HALT(200)
  4859. END;
  4860. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4861. IF parameter.kind = SyntaxTree.VarParameter THEN
  4862. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4863. Designate(expression, operand);
  4864. Pass((operand.op));
  4865. ELSE
  4866. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4867. Evaluate(expression, operand);
  4868. Pass((operand.extra)); (* step *)
  4869. Pass((operand.tag)); (* last *)
  4870. Pass((operand.op)) (* first *)
  4871. END
  4872. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4873. IF parameter.kind = SyntaxTree.VarParameter THEN
  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. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4880. IF (numberRegister > 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4881. Pass((operand.tag)); (* imaginary part *)
  4882. Pass((operand.op)) (* real part *)
  4883. ELSE
  4884. (* pass complex as a whole in order to comply with the variable alignment of its components *)
  4885. size := ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,parameter.type));
  4886. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4887. tmp := sp;
  4888. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4889. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4890. size := ToMemoryUnits(system,system.AlignmentOf(system.variableAlignment,componentType));
  4891. IntermediateCode.AddOffset(tmp,size);
  4892. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4893. END
  4894. END
  4895. ELSE
  4896. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4897. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4898. Designate(expression,operand);
  4899. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4900. (* stack allocation *)
  4901. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4902. (*! parameter alignment to be discussed ... *)
  4903. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4904. size := type(SyntaxTree.StringType).length;
  4905. END;
  4906. IF backend.cooperative & parameter.NeedsTrace() THEN
  4907. dst := NewRegisterOperand (addressType);
  4908. Emit(Mov(position,dst, sp));
  4909. IntermediateCode.InitImmediate(null, byteType, 0);
  4910. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4911. ReleaseIntermediateOperand(dst);
  4912. SaveRegisters();ReleaseUsedRegisters(saved);
  4913. (* register dst has been freed before SaveRegisters already *)
  4914. CallAssignMethod(dst, operand.op, parameter.type);
  4915. RestoreRegisters(saved);
  4916. END;
  4917. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4918. ELSIF IsOpenArray(parameter.type) THEN
  4919. Designate(expression,operand);
  4920. baseReg := operand.tag;
  4921. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4922. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4923. END;
  4924. Pass((operand.op)); (* address of the array *)
  4925. ELSIF IsDelegate(parameter.type) THEN
  4926. Evaluate(expression,operand);
  4927. IF backend.cooperative & parameter.NeedsTrace() THEN
  4928. Emit(Push(position, nil));
  4929. dst := NewRegisterOperand (addressType);
  4930. Emit(Mov(position,dst, sp));
  4931. ReleaseIntermediateOperand(dst);
  4932. SaveRegisters();ReleaseUsedRegisters(saved);
  4933. Emit(Push(position, dst));
  4934. (* register dst has been freed before SaveRegisters already *)
  4935. Emit(Push(position, operand.tag));
  4936. CallThis(position,"GarbageCollector","Assign",2);
  4937. RestoreRegisters(saved);
  4938. ELSE
  4939. Pass((operand.tag));
  4940. END;
  4941. Pass((operand.op));
  4942. ELSE
  4943. Evaluate(expression,operand);
  4944. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4945. Emit(Push(position, nil));
  4946. dst := NewRegisterOperand (addressType);
  4947. Emit(Mov(position,dst, sp));
  4948. ReleaseIntermediateOperand(dst);
  4949. SaveRegisters();ReleaseUsedRegisters(saved);
  4950. Emit(Push(position, dst));
  4951. (* register dst has been freed before SaveRegisters already *)
  4952. Emit(Push(position, operand.op));
  4953. CallThis(position,"GarbageCollector","Assign",2);
  4954. RestoreRegisters(saved);
  4955. ELSE
  4956. Pass((operand.op));
  4957. END;
  4958. END;
  4959. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4960. Evaluate(expression,operand);
  4961. Pass((operand.op));
  4962. ELSE (* var parameter *)
  4963. Designate(expression,operand);
  4964. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4965. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4966. Pass((operand.tag));
  4967. END;
  4968. END;
  4969. Pass((operand.op));
  4970. END;
  4971. END;
  4972. (* TODO: needed? *)
  4973. arrayDestinationTag := oldArrayDestinationTag;
  4974. arrayDestinationDimension := oldArrayDestinationDimension;
  4975. IF needsParameterBackup THEN
  4976. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4977. ReuseCopy(parameterBackup, operand.op)
  4978. END;
  4979. ReleaseOperand(operand);
  4980. IF Trace THEN TraceExit("PushParameter") END;
  4981. END PushParameter;
  4982. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  4983. VAR prevConditional: BOOLEAN;
  4984. BEGIN
  4985. prevConditional := conditional;
  4986. conditional := FALSE;
  4987. 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
  4988. Expression(x.result); (* use register *)
  4989. END;
  4990. Statement(x.statement);
  4991. conditional := prevConditional;
  4992. IF x.result # NIL THEN Expression(x.result) END;
  4993. 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
  4994. ReleaseIntermediateOperand(result.op);
  4995. END;
  4996. END VisitStatementDesignator;
  4997. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4998. VAR
  4999. procedure: SyntaxTree.Procedure;
  5000. procedureType: SyntaxTree.ProcedureType;
  5001. wasInline: BOOLEAN;
  5002. actualParameters: SyntaxTree.ExpressionList;
  5003. formalParameter: SyntaxTree.Parameter;
  5004. actualParameter: SyntaxTree.Expression;
  5005. i: LONGINT;
  5006. localVariable: SyntaxTree.Variable;
  5007. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5008. src, dest: Operand;
  5009. prevInlineExit : Label;
  5010. prevMapper: SymbolMapper;
  5011. tooComplex: BOOLEAN;
  5012. resultDesignator: SyntaxTree.Expression;
  5013. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5014. BEGIN
  5015. IF e = NIL THEN RETURN TRUE
  5016. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5017. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5018. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5019. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5020. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5021. ELSE RETURN FALSE
  5022. END;
  5023. END SimpleExpression;
  5024. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5025. BEGIN
  5026. RETURN checker.CanPassInRegister(type)
  5027. END FitsInRegister;
  5028. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5029. VAR
  5030. variable: SyntaxTree.Variable;
  5031. variableDesignator: SyntaxTree.Designator;
  5032. BEGIN
  5033. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5034. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5035. variableDesignator.SetType(type);
  5036. RETURN variableDesignator
  5037. END GetTemp;
  5038. BEGIN
  5039. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5040. wasInline := currentIsInline;
  5041. prevInlineExit := currentInlineExit;
  5042. prevMapper := currentMapper;
  5043. currentInlineExit := NewLabel();
  5044. tooComplex := FALSE;
  5045. NEW(currentMapper);
  5046. currentIsInline := TRUE;
  5047. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5048. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5049. formalParameter := procedureType.firstParameter;
  5050. actualParameters := x.parameters;
  5051. i := 0;
  5052. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5053. actualParameter := actualParameters.GetExpression(i);
  5054. IF actualParameter.resolved # NIL THEN
  5055. actualParameter := actualParameter.resolved
  5056. END;
  5057. (*
  5058. if expression is simple and can be passed immediately
  5059. or if type fits in register then we can proceed
  5060. otherwise we escape to ordinary procedure call.
  5061. *)
  5062. (* cases where the expression can be mapped identically *)
  5063. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5064. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5065. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5066. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5067. (*
  5068. Assign(variableDesignator, actualParameter);
  5069. *)
  5070. Evaluate(actualParameter, src);
  5071. Designate(variableDesignator, dest);
  5072. Emit(Mov(x.position, dest.op, src.op));
  5073. ReleaseOperand(dest);
  5074. ReleaseOperand(src);
  5075. (* the src operand should now have been completely released ! *)
  5076. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5077. ELSE tooComplex := TRUE
  5078. END;
  5079. (*
  5080. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5081. currentMapper.Add(formalParameter, actualParameter, NIL);
  5082. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5083. variableDesignator := GetTemp(system.addressType, FALSE);
  5084. Designate(actualParameter, src);
  5085. Designate(variableDesignator, dest);
  5086. IntermediateCode.MakeMemory(dest.op,addressType);
  5087. Emit(Mov(x.position, dest.op, src.op));
  5088. ReleaseOperand(dest);
  5089. IF src.tag.mode # IntermediateCode.Undefined THEN
  5090. tagDesignator := GetTemp(system.addressType, FALSE);
  5091. Designate(tagDesignator, dest);
  5092. IntermediateCode.MakeMemory(dest.op,addressType);
  5093. Emit(Mov(x.position, dest.op, src.op));
  5094. END;
  5095. ReleaseOperand(dest); ReleaseOperand(src);
  5096. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5097. END;
  5098. *)
  5099. formalParameter := formalParameter.nextParameter;
  5100. INC(i);
  5101. END;
  5102. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5103. IF resultDesignator # NIL THEN
  5104. returnDesignator := resultDesignator
  5105. ELSE
  5106. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5107. END;
  5108. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5109. END;
  5110. localVariable := procedure.procedureScope.firstVariable;
  5111. WHILE ~tooComplex & (localVariable # NIL) DO
  5112. variableDesignator := GetTemp(localVariable.type, FALSE);
  5113. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5114. localVariable := localVariable.nextVariable;
  5115. END;
  5116. IF ~tooComplex THEN
  5117. VisitStatementBlock(procedure.procedureScope.body);
  5118. SetLabel(currentInlineExit);
  5119. IF procedureType.returnType # NIL THEN
  5120. Designate(returnDesignator, result);
  5121. IF conditional THEN
  5122. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5123. ValueToCondition(result)
  5124. END;
  5125. END;
  5126. END;
  5127. currentMapper := prevMapper;
  5128. currentInlineExit := prevInlineExit;
  5129. currentIsInline := wasInline;
  5130. RETURN ~tooComplex
  5131. END InlineProcedureCall;
  5132. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5133. VAR
  5134. parameters: SyntaxTree.ExpressionList;
  5135. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5136. designator: SyntaxTree.Designator;
  5137. procedureType: SyntaxTree.ProcedureType;
  5138. formalParameter: SyntaxTree.Parameter;
  5139. operand, returnValue: Operand;
  5140. reg, size, mask, dest: IntermediateCode.Operand;
  5141. saved,saved2: RegisterEntry;
  5142. symbol: SyntaxTree.Symbol;
  5143. variable: SyntaxTree.Variable;
  5144. i, parametersSize, returnTypeSize : LONGINT;
  5145. structuredReturnType: BOOLEAN;
  5146. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5147. tempVariableDesignator: SyntaxTree.Designator;
  5148. gap, alignment: LONGINT; (*fld*)
  5149. (* TODO: remove unnecessary backup variables *)
  5150. oldResult: Operand;
  5151. oldCurrentScope: SyntaxTree.Scope;
  5152. oldArrayDestinationTag: IntermediateCode.Operand;
  5153. oldArrayDestinationDimension: LONGINT;
  5154. oldConstantDeclaration: SyntaxTree.Symbol;
  5155. oldDestination: IntermediateCode.Operand;
  5156. oldCurrentLoop: Label;
  5157. oldConditional: BOOLEAN;
  5158. oldTrueLabel, oldFalseLabel: Label;
  5159. oldLocked: BOOLEAN;
  5160. usedRegisters,oldUsedRegisters: RegisterEntry;
  5161. return: IntermediateCode.Operand;
  5162. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5163. arg: IntermediateCode.Operand;
  5164. dummy: IntermediateCode.Operand;
  5165. recordType: SyntaxTree.RecordType;
  5166. operatorSelectionProcedureOperand: Operand;
  5167. operatorSelectionProcedure: SyntaxTree.Procedure;
  5168. fingerPrint: SyntaxTree.FingerPrint;
  5169. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5170. identifierNumber: LONGINT;
  5171. parameterRegisters: SIZE;
  5172. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5173. procedure: SyntaxTree.Procedure;
  5174. callingConvention: SyntaxTree.CallingConvention;
  5175. PROCEDURE BackupGlobalState;
  5176. BEGIN
  5177. oldResult := result;
  5178. oldCurrentScope := currentScope;
  5179. oldArrayDestinationTag := arrayDestinationTag;
  5180. oldArrayDestinationDimension := arrayDestinationDimension;
  5181. oldConstantDeclaration := constantDeclaration;
  5182. oldDestination := destination;
  5183. oldCurrentLoop := currentLoop;
  5184. oldConditional := conditional;
  5185. oldTrueLabel := trueLabel;
  5186. oldFalseLabel := falseLabel;
  5187. oldLocked := locked;
  5188. oldUsedRegisters := usedRegisters
  5189. END BackupGlobalState;
  5190. PROCEDURE RestoreGlobalState;
  5191. BEGIN
  5192. result := oldResult;
  5193. currentScope := oldCurrentScope;
  5194. arrayDestinationTag := oldArrayDestinationTag;
  5195. arrayDestinationDimension := oldArrayDestinationDimension;
  5196. constantDeclaration := oldConstantDeclaration;
  5197. destination := oldDestination;
  5198. currentLoop := oldCurrentLoop;
  5199. conditional := oldConditional;
  5200. trueLabel := oldTrueLabel;
  5201. falseLabel := oldFalseLabel;
  5202. locked := oldLocked;
  5203. usedRegisters := oldUsedRegisters
  5204. END RestoreGlobalState;
  5205. (** do preparations before parameter push for array-structured object types (ASOTs):
  5206. if ASOT is passed as VAR parameter:
  5207. - allocate temporary variable of math array type
  5208. - copy contents of ASOT to be passed to temporary variable
  5209. - use temporary variable as the actual parameter instead
  5210. - 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)
  5211. **)
  5212. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5213. VAR
  5214. expression: SyntaxTree.Expression;
  5215. BEGIN
  5216. IF actualParameter IS SyntaxTree.Designator THEN
  5217. designator := actualParameter(SyntaxTree.Designator);
  5218. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5219. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5220. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5221. ASSERT(checker # NIL);
  5222. checker.SetCurrentScope(currentScope);
  5223. (* allocate temporary variable *)
  5224. ASSERT(actualParameter.type # NIL);
  5225. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5226. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5227. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5228. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5229. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5230. ASSERT(tempVariableDesignator.type # NIL);
  5231. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5232. (* copy math array stored in actual parameter to temporary variable *)
  5233. BackupGlobalState;
  5234. AssignMathArray(tempVariableDesignator, actualParameter);
  5235. RestoreGlobalState;
  5236. (* use temporary variable as actual parameter instead of the original one *)
  5237. actualParameter := tempVariableDesignator;
  5238. (* create write-back call and store it in linked list *)
  5239. (* create new list entry *)
  5240. IF firstWriteBackCall = NIL THEN
  5241. NEW(firstWriteBackCall);
  5242. currentWriteBackCall := firstWriteBackCall
  5243. ELSE
  5244. ASSERT(currentWriteBackCall # NIL);
  5245. NEW(currentWriteBackCall.next);
  5246. currentWriteBackCall := currentWriteBackCall.next
  5247. END;
  5248. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5249. ASSERT(expression.type = NIL);
  5250. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5251. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5252. (* prepare writeback for any other "normal" indexer *)
  5253. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5254. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5255. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5256. Assign(tempVariableDesignator, actualParameter);
  5257. actualParameter := tempVariableDesignator;
  5258. IF firstWriteBackCall = NIL THEN
  5259. NEW(firstWriteBackCall);
  5260. currentWriteBackCall := firstWriteBackCall
  5261. ELSE
  5262. ASSERT(currentWriteBackCall # NIL);
  5263. NEW(currentWriteBackCall.next);
  5264. currentWriteBackCall := currentWriteBackCall.next
  5265. END;
  5266. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5267. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5268. END
  5269. END
  5270. END PrepareParameter;
  5271. BEGIN
  5272. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5273. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5274. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5275. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5276. IF InlineProcedureCall(x) THEN
  5277. RETURN
  5278. ELSE
  5279. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5280. END
  5281. END;
  5282. END;
  5283. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5284. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5285. callingConvention := procedureType.callingConvention;
  5286. dest := destination; destination := emptyOperand;
  5287. SaveRegisters();ReleaseUsedRegisters(saved);
  5288. parameters := x.parameters;
  5289. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5290. (* an operator is called *)
  5291. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5292. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5293. (* check if a dynamic operator call should be performed *)
  5294. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5295. ELSE
  5296. isCallOfDynamicOperator := FALSE
  5297. END;
  5298. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5299. Emit(Push(position, ap));
  5300. END;
  5301. alignment := procedureType.stackAlignment;
  5302. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5303. alignment := 16 (* bytes *);
  5304. END;
  5305. IF alignment > 1 THEN
  5306. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5307. Emit(Mov(position,reg, sp));
  5308. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5309. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5310. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5311. gap := 4*ToMemoryUnits(system,system.addressSize);
  5312. END;
  5313. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5314. gap := gap - 6*ToMemoryUnits(system,system.addressSize); (* the first 6 parameters are passed via registers in SysVABI *)
  5315. IF gap < 0 THEN
  5316. gap := 0
  5317. END;
  5318. ELSE
  5319. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5320. END;
  5321. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5322. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5323. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5324. Emit(And(position,sp, sp, mask));
  5325. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5326. Emit(Push(position,reg));
  5327. ReleaseIntermediateOperand(reg);
  5328. END;
  5329. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5330. (* align stack to 16-byte boundary *)
  5331. IntermediateCode.InitImmediate(mask,addressType,-16);
  5332. Emit(And(position,sp, sp, mask));
  5333. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5334. IF gap # 0 THEN
  5335. IntermediateCode.InitImmediate(size,addressType,gap);
  5336. Emit(Sub(position,sp,sp,size))
  5337. END;
  5338. END;
  5339. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5340. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5341. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5342. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5343. ELSE
  5344. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5345. END;
  5346. Evaluate(x.left, operand);
  5347. IF symbol IS SyntaxTree.Procedure THEN
  5348. IF (procedureType.selfParameter # NIL) THEN
  5349. Emit(Push(position,operand.tag));
  5350. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5351. Emit(Push(position,operand.tag));
  5352. ELSIF (procedureType.isDelegate) THEN
  5353. Emit(Push(position,operand.tag));
  5354. END;
  5355. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5356. IF (procedureType.selfParameter # NIL) THEN
  5357. Emit(Push(position,operand.tag));
  5358. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5359. Emit(Push(position,operand.tag));
  5360. END;
  5361. ELSE HALT(200);
  5362. END;
  5363. ReleaseIntermediateOperand(operand.tag);
  5364. operand.tag := emptyOperand;
  5365. (* determine if a structured return type is needed *)
  5366. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5367. IF structuredReturnType THEN
  5368. IF resultDesignator # NIL THEN
  5369. d := resultDesignator;
  5370. ELSE
  5371. (* temporary result that might be allocated, must potentially be traced *)
  5372. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5373. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5374. d.SetType(variable.type);
  5375. END;
  5376. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5377. Designate(d,returnValue);
  5378. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5379. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5380. Emit(Push(position,size));
  5381. Emit(Push(position,returnValue.op));
  5382. ReleaseOperand(returnValue);
  5383. ELSE*)
  5384. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5385. (*
  5386. END;
  5387. *)
  5388. END;
  5389. firstWriteBackCall := NIL; (* reset write-back call list *)
  5390. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5391. parameterRegisters := backend.NumberParameterRegisters(callingConvention);
  5392. passByRegister := parameterRegisters > 0;
  5393. registerNumber := 0;
  5394. formalParameter := procedureType.lastParameter;
  5395. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5396. actualParameter := parameters.GetExpression(i);
  5397. PrepareParameter(actualParameter, formalParameter);
  5398. IF passByRegister & (i < parameterRegisters) THEN
  5399. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5400. Error(actualParameter.position,"cannot be passed by register")
  5401. ELSE
  5402. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,i);
  5403. END;
  5404. INC(registerNumber);
  5405. ELSE
  5406. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5407. END;
  5408. formalParameter := formalParameter.prevParameter;
  5409. END;
  5410. IF passByRegister (* & (registerNumber > 0)*) & ~(callingConvention IN SysvABI) THEN
  5411. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5412. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5413. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5414. END;
  5415. ELSE
  5416. hasDynamicOperands := FALSE;
  5417. formalParameter := procedureType.firstParameter;
  5418. FOR i := 0 TO parameters.Length() - 1 DO
  5419. actualParameter := parameters.GetExpression(i);
  5420. IF formalParameter # NIL THEN (* TENTATIVE *)
  5421. PrepareParameter(actualParameter, formalParameter);
  5422. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5423. ASSERT(i < 2);
  5424. hasDynamicOperands := TRUE;
  5425. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5426. ELSE
  5427. IF passByRegister & (registerNumber > 0) THEN
  5428. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5429. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5430. END;
  5431. passByRegister := FALSE;
  5432. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5433. END;
  5434. formalParameter := formalParameter.nextParameter;
  5435. END;
  5436. END;
  5437. END;
  5438. IF symbol IS SyntaxTree.Procedure THEN
  5439. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5440. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5441. Emit(Push(position,reg));
  5442. ReleaseIntermediateOperand(reg);
  5443. END;
  5444. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5445. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5446. parametersSize := ParametersSize(system,procedureType, FALSE);
  5447. END;
  5448. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5449. (*
  5450. dynamic operator overloading:
  5451. first push parameters, regularly:
  5452. [self]
  5453. par1
  5454. par2
  5455. then push parameters for GetOperator
  5456. identifier
  5457. ptr1
  5458. tag
  5459. ptr2
  5460. tag
  5461. call GetOperatorRuntimeProc
  5462. call Operator
  5463. *)
  5464. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5465. (* push ID *)
  5466. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5467. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5468. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5469. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5470. formalParameter := procedureType.firstParameter;
  5471. FOR i := 0 TO parameters.Length() - 1 DO
  5472. IF formalParameter.access # SyntaxTree.Hidden THEN
  5473. ASSERT(i < 2);
  5474. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5475. (* push pointer *)
  5476. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5477. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5478. (* add dereference *)
  5479. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5480. (*! better: do refer to stack above than using parameter backups !!*)
  5481. ReleaseIntermediateOperand(parameterBackups[i]);
  5482. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5483. END;
  5484. Emit(Push(position,parameterBackups[i]));
  5485. ReleaseIntermediateOperand(parameterBackups[i]);
  5486. (* push typetag *)
  5487. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5488. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5489. arg := TypeDescriptorAdr(recordType);
  5490. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5491. Emit(Push(position,arg));
  5492. ELSE
  5493. (* push 'NonPointer' *)
  5494. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5495. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5496. (* push fingerprint *)
  5497. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5498. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5499. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5500. END
  5501. END;
  5502. formalParameter := formalParameter.nextParameter
  5503. END;
  5504. (* for unary operators: complete the information for the second parameter *)
  5505. IF procedureType.numberParameters < 2 THEN
  5506. (* push 'NonPointer' *)
  5507. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5508. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5509. (* push 'NoType' *)
  5510. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5511. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5512. END;
  5513. (* call operator selection procedure *)
  5514. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5515. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5516. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5517. ReleaseOperand(operatorSelectionProcedureOperand);
  5518. (* use the address that the operator selection procedure returned as the target address of the call *)
  5519. InitOperand(operand, ModeValue);
  5520. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5521. Emit(Result(position,operand.op))
  5522. END
  5523. END;
  5524. ReleaseParameterRegisters();
  5525. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5526. SaveRegisters();ReleaseUsedRegisters(saved2);
  5527. CallThis(position,"Objects","LeaveA2",0);
  5528. RestoreRegisters(saved2);
  5529. END;
  5530. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5531. Emit(Call(position,operand.op,0));
  5532. ELSE
  5533. Emit(Call(position,operand.op,parametersSize));
  5534. END;
  5535. ReleaseOperand(operand);
  5536. IF procedureType.noReturn THEN
  5537. EmitTrap(position,NoReturnTrap);
  5538. END;
  5539. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5540. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5541. Emit(Result(position,return));
  5542. END;
  5543. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5544. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5545. Emit(Push(position, return));
  5546. CallThis(position,"Objects","ReenterA2",0);
  5547. Emit(Pop(position, return));
  5548. ELSE
  5549. CallThis(position,"Objects","ReenterA2",0);
  5550. END;
  5551. END;
  5552. (* === return parameter space === *)
  5553. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5554. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5555. (* cleanup all space for all parameters *)
  5556. IF parametersSize < 32 THEN
  5557. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5558. parametersSize := 32
  5559. END;
  5560. size := IntermediateCode.Immediate(addressType,parametersSize);
  5561. Emit(Add(position,sp,sp,size))
  5562. END;
  5563. IF (callingConvention IN SysvABI) THEN
  5564. IF passByRegister THEN
  5565. IF parameters.Length() > parameterRegisters THEN
  5566. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5567. ELSE
  5568. parametersSize := 0
  5569. END;
  5570. ELSE
  5571. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5572. INC( parametersSize, (-parametersSize) MOD 16 )
  5573. END;
  5574. IF parametersSize > 0 THEN
  5575. size := IntermediateCode.Immediate(addressType,parametersSize);
  5576. Emit(Add(position,sp,sp,size))
  5577. END;
  5578. END;
  5579. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5580. IF structuredReturnType THEN
  5581. (* stack pointer rewinding done by callee
  5582. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5583. Emit(Add(position,sp,sp,size));
  5584. *)
  5585. RestoreRegisters(saved);
  5586. InitOperand(result,ModeReference);
  5587. Symbol(variable,result);
  5588. ELSE
  5589. RestoreRegisters(saved);
  5590. InitOperand(result,ModeValue);
  5591. result.op := return;
  5592. END;
  5593. END;
  5594. IF alignment > 1 THEN
  5595. Emit(Pop(position,sp));
  5596. END;
  5597. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5598. Emit(Pop(position, ap));
  5599. END;
  5600. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5601. ValueToCondition(result);
  5602. END;
  5603. destination := dest;
  5604. (* perform all write-back calls in the list *)
  5605. BackupGlobalState;
  5606. currentWriteBackCall := firstWriteBackCall;
  5607. WHILE currentWriteBackCall # NIL DO
  5608. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5609. currentWriteBackCall := currentWriteBackCall.next
  5610. END;
  5611. RestoreGlobalState;
  5612. (* TENATIVE *)
  5613. (*
  5614. IF isOperatorCall THEN
  5615. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5616. END;
  5617. *)
  5618. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5619. END VisitProcedureCallDesignator;
  5620. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5621. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5622. td: SyntaxTree.Symbol;
  5623. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5624. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5625. BEGIN
  5626. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5627. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5628. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5629. variable.SetType(system.anyType);
  5630. scope.AddVariable(variable);
  5631. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5632. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5633. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5634. typeDeclaration.SetScope(module.module.moduleScope);
  5635. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5636. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5637. END;
  5638. RETURN hiddenPointerType;
  5639. END GetHiddenPointerType;
  5640. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5641. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5642. BEGIN
  5643. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5644. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5645. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5646. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5647. scope.AddVariable(variable);
  5648. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5649. variable.SetType(system.anyType);
  5650. scope.AddVariable(variable);
  5651. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5652. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5653. typeDeclaration.SetDeclaredType(delegatePointerType);
  5654. typeDeclaration.SetScope(module.module.moduleScope);
  5655. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5656. delegatePointerType.SetState(SyntaxTree.Resolved);
  5657. END;
  5658. RETURN delegatePointerType
  5659. END GetDelegateType;
  5660. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5661. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5662. such as in VAR a: RECORD ... END;
  5663. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5664. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5665. *)
  5666. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5667. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5668. BEGIN (* no code emission *)
  5669. source := NIL;
  5670. x := x.resolved;
  5671. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5672. x := GetHiddenPointerType();
  5673. ELSIF IsDelegate(x) THEN
  5674. x := GetDelegateType();
  5675. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5676. ELSE HALT(200);
  5677. END;
  5678. td := x.typeDeclaration;
  5679. IF td = NIL THEN
  5680. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5681. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5682. ASSERT(td # NIL);
  5683. END;
  5684. IF newObjectFile THEN
  5685. GetCodeSectionNameForSymbol(td,name);
  5686. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5687. meta.CheckTypeDeclaration(x);
  5688. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5689. ELSE
  5690. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5691. END;
  5692. IF backend.cooperative OR meta.simple THEN
  5693. offset := 0;
  5694. ELSE
  5695. IF x IS SyntaxTree.CellType THEN
  5696. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5697. IF baseRecord = NIL THEN
  5698. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5699. ELSE
  5700. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5701. END;
  5702. ELSE
  5703. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5704. END;
  5705. END;
  5706. ELSE
  5707. offset := 0;
  5708. source := module.allSections.FindBySymbol(td); (*TODO*)
  5709. IF source = NIL THEN
  5710. null := 0;
  5711. GetCodeSectionNameForSymbol(td,name);
  5712. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5713. Basic.SuffixSegmentedName (name, module.module.name);
  5714. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5715. IntermediateCode.InitImmediate(op,addressType,0);
  5716. source(IntermediateCode.Section).Emit(Data(position,op));
  5717. ELSE
  5718. name := source.name;
  5719. END;
  5720. END;
  5721. RETURN td
  5722. END GetBackendType;
  5723. BEGIN
  5724. (*td := t.typeDeclaration;*)
  5725. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5726. (*
  5727. IF t IS SyntaxTree.PointerType THEN
  5728. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5729. ELSE
  5730. source := GetBackendType(t);
  5731. END;
  5732. *)
  5733. IF newObjectFile THEN
  5734. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5735. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5736. IntermediateCode.SetOffset(res,offset);
  5737. ELSE
  5738. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5739. END;
  5740. (*
  5741. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5742. make memory should be used when tag is used, not earlier
  5743. *)
  5744. RETURN res
  5745. END TypeDescriptorAdr;
  5746. (*
  5747. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5748. VAR result: IntermediateCode.Operand;
  5749. BEGIN
  5750. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5751. operand.tag := TypeDescriptorAdr(operand.type);
  5752. IntermediateCode.MakeMemory(operand.tag,addressType);
  5753. UseIntermediateOperand(operand.tag);
  5754. END;
  5755. END MakeTypeTag;
  5756. *)
  5757. PROCEDURE ProfilerInit;
  5758. VAR reg: IntermediateCode.Operand;
  5759. BEGIN
  5760. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5761. Emit(Call(position,reg,0));
  5762. END ProfilerInit;
  5763. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5764. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5765. BEGIN
  5766. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5767. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5768. THEN
  5769. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5770. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5771. Emit(Push(position,reg));
  5772. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5773. Emit(Push(position,reg));
  5774. StaticCallOperand(result,procedure);
  5775. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5776. ReleaseOperand(result);
  5777. END;
  5778. END ProfilerEnterExit;
  5779. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5780. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5781. BEGIN
  5782. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5783. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5784. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5785. profileInit.Emit(Push(position,reg));
  5786. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5787. profileInit.Emit(Push(position,reg));
  5788. NEW(string, LEN(name)); COPY(name, string^);
  5789. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5790. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5791. sv.SetType(type);
  5792. Designate(sv,result);
  5793. profileInit.Emit(Push(position,result.tag));
  5794. profileInit.Emit(Push(position,result.op));
  5795. StaticCallOperand(result,procedure);
  5796. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5797. ReleaseOperand(result);
  5798. END;
  5799. END ProfilerAddProcedure;
  5800. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5801. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5802. BEGIN
  5803. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5804. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5805. profileInit.Emit(Push(position,reg));
  5806. profileInitPatchPosition := profileInit.pc;
  5807. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5808. NEW(string, LEN(name)); COPY(name, string^);
  5809. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5810. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5811. sv.SetType(type);
  5812. Designate(sv,result);
  5813. profileInit.Emit(Push(position,result.tag));
  5814. profileInit.Emit(Push(position,result.op));
  5815. StaticCallOperand(result,procedure);
  5816. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5817. ReleaseOperand(result);
  5818. END;
  5819. END ProfilerAddModule;
  5820. PROCEDURE ProfilerPatchInit;
  5821. VAR reg: IntermediateCode.Operand;
  5822. BEGIN
  5823. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5824. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5825. EmitLeave(profileInit,position,NIL,0);
  5826. profileInit.Emit(Exit(position,0,0,0));
  5827. END ProfilerPatchInit;
  5828. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5829. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5830. VAR
  5831. id: LONGINT;
  5832. leftType, rightType: SyntaxTree.Type;
  5833. procedureType: SyntaxTree.ProcedureType;
  5834. runtimeProcedure: SyntaxTree.Procedure;
  5835. runtimeProcedureOperand, operatorOperand: Operand;
  5836. kind: SET;
  5837. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5838. VAR
  5839. arg: IntermediateCode.Operand;
  5840. recordType: SyntaxTree.RecordType;
  5841. fingerPrint: SyntaxTree.FingerPrint;
  5842. BEGIN
  5843. IF type = NIL THEN
  5844. (* no type: push 'NoType' *)
  5845. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5846. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5847. ELSIF IsStrictlyPointerToRecord(type) THEN
  5848. (* pointer to record type: push typetag *)
  5849. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5850. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5851. arg := TypeDescriptorAdr(recordType);
  5852. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5853. ELSE
  5854. (* non-pointer to record type: push fingerprint *)
  5855. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5856. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5857. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5858. END;
  5859. operatorInitializationCodeSection.Emit(Push(position,arg))
  5860. END PushTypeInfo;
  5861. BEGIN
  5862. ASSERT(operatorInitializationCodeSection # NIL);
  5863. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5864. procedureType := operator.type(SyntaxTree.ProcedureType);
  5865. (* determine types *)
  5866. leftType := procedureType.firstParameter.type;
  5867. IF procedureType.numberParameters = 2 THEN
  5868. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5869. rightType := procedureType.firstParameter.nextParameter.type;
  5870. ELSE
  5871. rightType := NIL
  5872. END;
  5873. (* determine operator kind *)
  5874. IF IsStrictlyPointerToRecord(leftType) THEN
  5875. kind := {LhsIsPointer}
  5876. ELSE
  5877. kind := {}
  5878. END;
  5879. IF IsStrictlyPointerToRecord(rightType) THEN
  5880. kind := kind + {RhsIsPointer}
  5881. END;
  5882. IF kind # {} THEN (* TODO: to be removed later on *)
  5883. (* at least one of the types is a pointer to record *)
  5884. (* emit a code that registers this specific operator in the runtime *)
  5885. dump := operatorInitializationCodeSection.comments;
  5886. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5887. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5888. (* push ID *)
  5889. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5890. id := Global.GetSymbol(module.module.case, operator.name);
  5891. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5892. (* push kind *)
  5893. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5894. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5895. (* push type infos *)
  5896. PushTypeInfo(leftType);
  5897. PushTypeInfo(rightType);
  5898. (* push operator address *)
  5899. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5900. StaticCallOperand(operatorOperand, operator);
  5901. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5902. ReleaseOperand(operatorOperand);
  5903. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5904. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5905. ReleaseOperand(runtimeProcedureOperand)
  5906. END
  5907. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5908. END
  5909. END RegisterDynamicOperator;
  5910. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5911. VAR
  5912. traceModule: SyntaxTree.Module;
  5913. procedure: SyntaxTree.Procedure;
  5914. procedureVariable: SyntaxTree.Variable;
  5915. s,msg: Basic.MessageString;
  5916. res: Operand;
  5917. i: LONGINT;
  5918. sv: SyntaxTree.StringValue;
  5919. type: SyntaxTree.Type;
  5920. recordType: SyntaxTree.RecordType;
  5921. printout: Printout.Printer;
  5922. stringWriter: Streams.StringWriter;
  5923. expression: SyntaxTree.Expression;
  5924. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5925. BEGIN
  5926. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5927. IF procedure = NIL THEN
  5928. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5929. END;
  5930. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5931. s := "procedure ";
  5932. Strings.Append(s,backend.traceModuleName);
  5933. Strings.Append(s,".");
  5934. Strings.Append(s,procedureName);
  5935. Strings.Append(s," not present");
  5936. Error(position,s);
  5937. RETURN FALSE
  5938. ELSE
  5939. RETURN TRUE
  5940. END;
  5941. END GetProcedure;
  5942. PROCEDURE CallProcedure;
  5943. VAR size: LONGINT;
  5944. BEGIN
  5945. IF procedure # NIL THEN
  5946. StaticCallOperand(result,procedure);
  5947. size := ProcParametersSize(procedure);
  5948. ELSE
  5949. Symbol(procedureVariable, result);
  5950. LoadValue(result, procedureVariable.type.resolved);
  5951. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5952. END;
  5953. Emit(Call(position,result.op,size));
  5954. END CallProcedure;
  5955. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5956. VAR res: Operand; string: SyntaxTree.String;
  5957. BEGIN
  5958. IF GetProcedure("String") THEN
  5959. NEW(string, LEN(s)); COPY(s, string^);
  5960. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5961. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5962. sv.SetType(type);
  5963. Designate(sv,res);
  5964. Emit(Push(position,res.tag));
  5965. Emit(Push(position,res.op));
  5966. ReleaseOperand(res);
  5967. CallProcedure;
  5968. END;
  5969. END String;
  5970. PROCEDURE Integer(op: IntermediateCode.Operand);
  5971. BEGIN
  5972. IF GetProcedure("Int") THEN
  5973. Emit(Push(position,op));
  5974. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5975. CallProcedure;
  5976. END;
  5977. END Integer;
  5978. PROCEDURE Float(op: IntermediateCode.Operand);
  5979. BEGIN
  5980. IF GetProcedure("HIntHex") THEN
  5981. Emit(Push(position,op));
  5982. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5983. CallProcedure;
  5984. END;
  5985. END Float;
  5986. PROCEDURE Set(op: IntermediateCode.Operand);
  5987. BEGIN
  5988. IF GetProcedure("Set") THEN
  5989. Emit(Push(position,op));
  5990. (*
  5991. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5992. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5993. *)
  5994. CallProcedure;
  5995. END;
  5996. END Set;
  5997. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5998. BEGIN
  5999. IF GetProcedure("Boolean") THEN
  6000. Emit(Push(position,op));
  6001. CallProcedure;
  6002. END;
  6003. END Boolean;
  6004. PROCEDURE Char(op: IntermediateCode.Operand);
  6005. BEGIN
  6006. IF GetProcedure("Char") THEN
  6007. Emit(Push(position,op));
  6008. CallProcedure;
  6009. END;
  6010. END Char;
  6011. PROCEDURE Address(op: IntermediateCode.Operand);
  6012. BEGIN
  6013. IF GetProcedure("Address") THEN
  6014. Emit(Push(position,op));
  6015. CallProcedure;
  6016. END;
  6017. END Address;
  6018. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6019. VAR len: IntermediateCode.Operand;
  6020. BEGIN
  6021. IF GetProcedure("String") THEN
  6022. len := GetArrayLength(type, op.tag);
  6023. Emit(Push(position,len));
  6024. ReleaseIntermediateOperand(len);
  6025. Emit(Push(position,op.op));
  6026. CallProcedure;
  6027. END;
  6028. END StringOperand;
  6029. PROCEDURE Ln;
  6030. BEGIN
  6031. IF GetProcedure("Ln") THEN
  6032. CallProcedure;
  6033. END;
  6034. END Ln;
  6035. BEGIN
  6036. IF backend.traceModuleName = "" THEN RETURN END;
  6037. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6038. IF GetProcedure("Enter") THEN
  6039. CallProcedure
  6040. END;
  6041. NEW(stringWriter,LEN(s));
  6042. FOR i := 0 TO x.Length()-1 DO
  6043. msg := "";
  6044. expression := x.GetExpression(i);
  6045. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6046. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6047. ELSE
  6048. Global.GetModuleName(module.module, s);
  6049. END;
  6050. IF i = 0 THEN
  6051. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6052. stringWriter.String(":");
  6053. END;
  6054. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6055. IF ~(expression IS SyntaxTree.StringValue) THEN
  6056. printout.Expression(expression);
  6057. stringWriter.Get(s);
  6058. Strings.Append(msg,s);
  6059. Strings.Append(msg,"= ");
  6060. ELSE stringWriter.Get(s); (* remove from string writer *)
  6061. Strings.Append(msg, s);
  6062. END;
  6063. String(msg);
  6064. IF SemanticChecker.IsStringType(expression.type) THEN
  6065. Designate(expression,res);
  6066. StringOperand(res, expression.type);
  6067. ELSE
  6068. Evaluate(expression,res);
  6069. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6070. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6071. Convert(res.op,int64);
  6072. END;
  6073. Integer(res.op);
  6074. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6075. Boolean(res.op);
  6076. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6077. Set(res.op);
  6078. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6079. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6080. Convert(res.op,float64);
  6081. END;
  6082. Float(res.op);
  6083. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6084. Char(res.op);
  6085. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6086. Address(res.op);String("H");
  6087. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6088. Address(res.op);String("H");
  6089. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6090. Address(res.op);String("H");
  6091. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6092. Address(res.op);String("H");
  6093. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6094. String("NIL");
  6095. ELSE HALT(200);
  6096. END;
  6097. END;
  6098. ReleaseOperand(res);
  6099. String("; ");
  6100. END;
  6101. IF GetProcedure("Exit") THEN
  6102. CallProcedure
  6103. ELSE
  6104. Ln;
  6105. END;
  6106. END;
  6107. END SystemTrace;
  6108. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6109. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6110. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6111. BEGIN
  6112. type := type.resolved;
  6113. IF type IS SyntaxTree.RecordType THEN
  6114. WITH type: SyntaxTree.RecordType DO
  6115. baseType := type.baseType;
  6116. IF baseType # NIL THEN
  6117. baseType := baseType.resolved;
  6118. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6119. InitFields(baseType,adr,offset);
  6120. END;
  6121. variable := type.recordScope.firstVariable;
  6122. WHILE variable # NIL DO
  6123. IF variable.initializer # NIL THEN
  6124. Evaluate(variable.initializer,initializerOp);
  6125. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6126. Emit(Mov(position,mem,initializerOp.op));
  6127. ReleaseOperand(initializerOp);
  6128. ReleaseIntermediateOperand(mem);
  6129. END;
  6130. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6131. variable := variable.nextVariable
  6132. END;
  6133. END;
  6134. ELSIF type IS SyntaxTree.CellType THEN
  6135. WITH type: SyntaxTree.CellType DO
  6136. baseType := type.baseType;
  6137. IF baseType # NIL THEN
  6138. baseType := baseType.resolved;
  6139. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6140. InitFields(baseType,adr,offset);
  6141. END;
  6142. variable := type.cellScope.firstVariable;
  6143. WHILE variable # NIL DO
  6144. IF variable.initializer # NIL THEN
  6145. Evaluate(variable.initializer,initializerOp);
  6146. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6147. Emit(Mov(position,mem,initializerOp.op));
  6148. ReleaseOperand(initializerOp);
  6149. ReleaseIntermediateOperand(mem);
  6150. END;
  6151. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6152. variable := variable.nextVariable
  6153. END;
  6154. END;
  6155. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6156. WITH type: SyntaxTree.ArrayType DO
  6157. IF type.form = SyntaxTree.Static THEN
  6158. baseType := type.arrayBase;
  6159. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6160. FOR i := 0 TO type.staticLength-1 DO
  6161. InitFields(baseType,adr,offset+i*size);
  6162. END;
  6163. END;
  6164. END;
  6165. ELSIF type IS SyntaxTree.MathArrayType THEN
  6166. WITH type: SyntaxTree.MathArrayType DO
  6167. IF type.form = SyntaxTree.Open THEN
  6168. dim := DynamicDim(type);
  6169. imm := IntermediateCode.Immediate(addressType,dim);
  6170. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6171. baseType := SemanticChecker.ArrayBase(type,dim);
  6172. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6173. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6174. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6175. ReleaseIntermediateOperand(imm);
  6176. (* flags remain empty (=0) for open array *)
  6177. ELSIF type.form = SyntaxTree.Static THEN
  6178. baseType := type.arrayBase;
  6179. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6180. ASSERT(type.staticLength < 1024*1024*1024);
  6181. FOR i := 0 TO type.staticLength-1 DO
  6182. InitFields(baseType,adr,offset+i*size);
  6183. END;
  6184. END;
  6185. END;
  6186. END;
  6187. END InitFields;
  6188. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6189. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6190. saved: RegisterEntry;
  6191. BEGIN
  6192. type := variable.type.resolved;
  6193. IF (type IS SyntaxTree.MathArrayType) THEN
  6194. WITH type: SyntaxTree.MathArrayType DO
  6195. IF type.form = SyntaxTree.Open THEN
  6196. Symbol(variable,operand);
  6197. InitFields(type, operand.tag,0);
  6198. IF temporary THEN
  6199. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6200. END;
  6201. ELSIF type.form = SyntaxTree.Tensor THEN
  6202. IF temporary & backend.writeBarriers THEN
  6203. SaveRegisters();ReleaseUsedRegisters(saved);
  6204. Symbol(variable, operand);
  6205. Emit(Push(position,operand.op));
  6206. ReleaseOperand(operand);
  6207. Emit(Push(position,nil));
  6208. CallThis(position,"FoxArrayBase","Assign",2);
  6209. RestoreRegisters(saved);
  6210. ELSE
  6211. Symbol(variable, operand);
  6212. MakeMemory(tmp,operand.op,addressType,0);
  6213. ReleaseOperand(operand);
  6214. IF temporary THEN
  6215. (* trick -- temporary object from array base *)
  6216. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6217. Symbol(symbol,operand);
  6218. MakeMemory(mem,operand.op,addressType,0);
  6219. ReleaseOperand(operand);
  6220. Emit(Mov(position,tmp, mem) );
  6221. ReleaseOperand(operand);
  6222. ELSE
  6223. Emit(Mov(position,tmp, nil ) );
  6224. END;
  6225. ReleaseIntermediateOperand(tmp)
  6226. END;
  6227. END;
  6228. END;
  6229. ELSE
  6230. Symbol(variable,operand);
  6231. IF variable.initializer # NIL THEN
  6232. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6233. reference.SetType(variable.type.resolved);
  6234. reference.SetAssignable(TRUE);
  6235. Assign(reference,variable.initializer);
  6236. ELSIF temporary THEN
  6237. IF SemanticChecker.IsPointerType(variable.type) THEN
  6238. IF backend.writeBarriers THEN
  6239. SaveRegisters();ReleaseUsedRegisters(saved);
  6240. Symbol(variable, operand);
  6241. Emit(Push(position,operand.op));
  6242. ReleaseOperand(operand);
  6243. Emit(Push(position,nil));
  6244. CallThis(position,"Heaps","Assign",2);
  6245. RestoreRegisters(saved);
  6246. ELSE
  6247. Symbol(variable, operand);
  6248. MakeMemory(tmp,operand.op,addressType,0);
  6249. ReleaseOperand(operand);
  6250. Emit(Mov(position,tmp, nil ) );
  6251. ReleaseIntermediateOperand(tmp);
  6252. END;
  6253. END;
  6254. END;
  6255. InitFields(type, operand.op,0);
  6256. ReleaseOperand(operand);
  6257. END;
  6258. END InitVariable;
  6259. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6260. VAR end: Label;
  6261. BEGIN
  6262. IF type.form = SyntaxTree.Tensor THEN
  6263. InitOperand(result,ModeValue);
  6264. ReuseCopy(result.op,base);
  6265. end := NewLabel();
  6266. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6267. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6268. SetLabel(end);
  6269. Convert(result.op,lenType);
  6270. ELSE
  6271. InitOperand(result,ModeValue);
  6272. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6273. END
  6274. END MathArrayDim;
  6275. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6276. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6277. BEGIN
  6278. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6279. MakeMemory(mem,base,addressType,offset);
  6280. Emit(Mov(position,mem,value));
  6281. ReleaseIntermediateOperand(mem);
  6282. END PutMathArrayField;
  6283. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6284. VAR mem: IntermediateCode.Operand;
  6285. BEGIN
  6286. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6287. MakeMemory(mem,base,addressType,offset);
  6288. Emit(Mov(position,mem,value));
  6289. ReleaseIntermediateOperand(mem);
  6290. END PutMathArrayFieldOffset;
  6291. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6292. BEGIN
  6293. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6294. MakeMemory(value,base,addressType,offset);
  6295. END GetMathArrayField;
  6296. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6297. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6298. BEGIN
  6299. IF incr THEN
  6300. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6301. ELSE
  6302. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6303. END;
  6304. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6305. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6306. ELSE
  6307. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6308. Emit(Mov(position,reg,dim));
  6309. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6310. Emit(Add(position,reg,reg,base));
  6311. MakeMemory(mem, reg, addressType, offset);
  6312. ReleaseIntermediateOperand(reg);
  6313. Emit(Mov(position,mem,value));
  6314. ReleaseIntermediateOperand(mem);
  6315. END;
  6316. END PutMathArrayLenOrIncr;
  6317. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6318. BEGIN
  6319. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6320. END PutMathArrayLength;
  6321. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6322. BEGIN
  6323. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6324. END PutMathArrayIncrement;
  6325. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6326. BEGIN
  6327. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6328. END GetMathArrayIncrement;
  6329. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6330. BEGIN
  6331. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6332. END GetMathArrayLength;
  6333. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6334. VAR dimOp: IntermediateCode.Operand;
  6335. BEGIN
  6336. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6337. GetMathArrayLength(type, operand, dimOp, check, result);
  6338. END GetMathArrayLengthAt;
  6339. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6340. VAR dimOp: IntermediateCode.Operand;
  6341. BEGIN
  6342. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6343. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6344. END GetMathArrayIncrementAt;
  6345. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6346. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6347. offset: LONGINT;
  6348. BEGIN
  6349. IF increment THEN
  6350. offset := MathIncrOffset;
  6351. ELSE
  6352. offset := MathLenOffset;
  6353. END;
  6354. INC(offset,operand.dimOffset*2);
  6355. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6356. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6357. END;
  6358. (* static dimension *)
  6359. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6360. IF check & (type.form = SyntaxTree.Tensor) THEN
  6361. DimensionCheck(operand.tag,dim,BrltL);
  6362. END;
  6363. val := SHORT(dim.intValue);
  6364. IF type.form # SyntaxTree.Tensor THEN
  6365. t := SemanticChecker.ArrayBase(type,val);
  6366. type := t.resolved(SyntaxTree.MathArrayType);
  6367. IF type.form = SyntaxTree.Static THEN
  6368. IF increment THEN
  6369. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6370. ELSE
  6371. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6372. END;
  6373. InitOperand(result,ModeValue);
  6374. result.op := res;
  6375. RETURN;
  6376. END;
  6377. END;
  6378. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6379. MakeMemory(res,operand.tag,addressType,offset);
  6380. (*
  6381. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6382. *)
  6383. InitOperand(result,ModeValue);
  6384. result.op := res;
  6385. ELSE
  6386. Convert(dim,addressType);
  6387. IF check THEN
  6388. IF type.form = SyntaxTree.Tensor THEN
  6389. DimensionCheck(operand.tag,dim,BrltL);
  6390. ELSIF isUnchecked THEN (* do nothing *)
  6391. ELSE
  6392. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6393. END;
  6394. END;
  6395. end := NewLabel(); next := NIL;
  6396. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6397. Emit(Mov(position,res,dim));
  6398. Convert(res,sizeType);
  6399. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6400. WHILE t IS SyntaxTree.MathArrayType DO
  6401. type := t(SyntaxTree.MathArrayType);
  6402. IF type.form = SyntaxTree.Static THEN
  6403. imm := IntermediateCode.Immediate(sizeType,val);
  6404. next := NewLabel();
  6405. BrneL(next,imm,res);
  6406. IF increment THEN
  6407. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6408. ELSE
  6409. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6410. END;
  6411. Emit(MovReplace(position,res,imm));
  6412. BrL(end);
  6413. ELSE hasDynamicPart := TRUE;
  6414. END;
  6415. t := type.arrayBase.resolved;
  6416. val := val + 1;
  6417. IF next # NIL THEN SetLabel(next) END;
  6418. END;
  6419. IF hasDynamicPart THEN
  6420. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6421. Emit(Mov(position,res2,dim));
  6422. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6423. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6424. Emit(Add(position,res2,res2,imm));
  6425. Emit(Add(position,res2,res2,operand.tag));
  6426. IntermediateCode.MakeMemory(res2,sizeType);
  6427. Emit(MovReplace(position,res,res2));
  6428. ReleaseIntermediateOperand(res2);
  6429. END;
  6430. SetLabel(end);
  6431. Convert(res,sizeType);
  6432. InitOperand(result,ModeValue);
  6433. result.op := res;
  6434. END;
  6435. END MathArrayLenOrIncr;
  6436. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6437. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6438. offset: LONGINT;
  6439. BEGIN
  6440. offset := operand.dimOffset+DynamicDim(type)-1;
  6441. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6442. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6443. val := SHORT(dim.intValue);
  6444. t := SemanticChecker.ArrayBase(type,val);
  6445. type := t.resolved(SyntaxTree.ArrayType);
  6446. IF type.form = SyntaxTree.Static THEN
  6447. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6448. ELSE
  6449. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6450. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6451. END;
  6452. UseIntermediateOperand(res);
  6453. InitOperand(result,ModeValue);
  6454. result.op := res;
  6455. ELSE
  6456. Convert(dim,addressType);
  6457. IF ~isUnchecked THEN
  6458. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6459. END;
  6460. end := NewLabel(); next := NIL;
  6461. (* ReuseCopy(dim,res); *)
  6462. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6463. Emit(Mov(position,res,dim));
  6464. Convert(res,sizeType);
  6465. Convert(res,sizeType);
  6466. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6467. WHILE t IS SyntaxTree.ArrayType DO
  6468. type := t(SyntaxTree.ArrayType);
  6469. IF type.form = SyntaxTree.Static THEN
  6470. imm := IntermediateCode.Immediate(sizeType,val);
  6471. next := NewLabel();
  6472. BrneL(next,imm,res);
  6473. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6474. Emit(MovReplace(position,res,imm));
  6475. BrL(end);
  6476. ELSE hasDynamicPart := TRUE;
  6477. END;
  6478. t := type.arrayBase.resolved;
  6479. val := val + 1;
  6480. IF next # NIL THEN SetLabel(next) END;
  6481. END;
  6482. IF hasDynamicPart THEN
  6483. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6484. Convert(res2,addressType);
  6485. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6486. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6487. Emit(Sub(position,res2,imm,res2));
  6488. Emit(Add(position,res2,res2,operand.tag));
  6489. IntermediateCode.MakeMemory(res2,sizeType);
  6490. Emit(MovReplace(position,res,res2));
  6491. ReleaseIntermediateOperand(res2);
  6492. END;
  6493. SetLabel(end);
  6494. Convert(res,sizeType);
  6495. InitOperand(result,ModeValue);
  6496. result.op := res;
  6497. END;
  6498. END ArrayLen;
  6499. (**
  6500. create a temporary variable in current scope
  6501. **)
  6502. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6503. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6504. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6505. BEGIN
  6506. IF ~register THEN
  6507. v := temporaries.GetFreeVariable(type, untraced, index);
  6508. ELSE
  6509. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6510. END;
  6511. scope := currentScope;
  6512. (*
  6513. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6514. *)
  6515. name := temporaries.GetUID();
  6516. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6517. variable.SetType(type);
  6518. variable.SetAccess(SyntaxTree.Hidden);
  6519. variable.SetUntraced(untraced);
  6520. IF v = NIL THEN
  6521. temporaries.AddVariable(variable);
  6522. IF ~register THEN
  6523. IF scope.lastVariable # NIL THEN
  6524. offset := scope.lastVariable.offsetInBits;
  6525. ELSE
  6526. offset := 0;
  6527. END;
  6528. DEC(offset,system.SizeOf(variable.type));
  6529. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6530. variable(SyntaxTree.Variable).SetOffset(offset);
  6531. scope.AddVariable(variable(SyntaxTree.Variable));
  6532. scope.EnterSymbol(variable, duplicate);
  6533. ASSERT(~duplicate);
  6534. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6535. ELSE
  6536. variable.SetUseRegister(TRUE);
  6537. variable(SyntaxTree.Variable).SetOffset(0);
  6538. END;
  6539. ELSE (* v # NIL *)
  6540. (* reuse slot for new variable, do not create new slot ! *)
  6541. temporaries.SetVariable(index, variable);
  6542. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6543. ASSERT(~register);
  6544. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6545. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6546. scope.EnterSymbol(variable, duplicate);
  6547. ASSERT(~duplicate);
  6548. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6549. END;
  6550. RETURN variable(SyntaxTree.Variable)
  6551. END GetTemporaryVariable;
  6552. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6553. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6554. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6555. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6556. i: LONGINT; duplicate: BOOLEAN;
  6557. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6558. VAR variable: SyntaxTree.Variable;
  6559. BEGIN
  6560. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6561. variable.SetType(type);
  6562. recordScope.AddVariable(variable);
  6563. END AddVariable;
  6564. BEGIN
  6565. name := "@ArrayDescriptor";
  6566. Basic.AppendNumber(name,dimensions);
  6567. identifier := SyntaxTree.NewIdentifier(name);
  6568. parentScope := module.module.moduleScope;
  6569. symbol := parentScope.FindSymbol(identifier);
  6570. IF symbol # NIL THEN
  6571. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6572. type := typeDeclaration.declaredType;
  6573. ELSE
  6574. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6575. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6576. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6577. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6578. recordType.SetTypeDeclaration(typeDeclaration);
  6579. recordType.SetState(SyntaxTree.Resolved);
  6580. typeDeclaration.SetDeclaredType(recordType);
  6581. AddVariable("@ptr",system.anyType);
  6582. AddVariable("@adr",system.addressType);
  6583. AddVariable("@flags",system.addressType);
  6584. AddVariable("@dim",system.addressType);
  6585. AddVariable("@elementSize",system.addressType);
  6586. FOR i := 0 TO dimensions-1 DO
  6587. name := "@len";
  6588. Basic.AppendNumber(name,i);
  6589. AddVariable(name,system.addressType);
  6590. name := "@incr";
  6591. Basic.AppendNumber(name,i);
  6592. AddVariable(name,system.addressType);
  6593. END;
  6594. parentScope.AddTypeDeclaration(typeDeclaration);
  6595. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6596. ASSERT(~duplicate);
  6597. type := recordType;
  6598. END;
  6599. RETURN type
  6600. END GetMathArrayDescriptorType;
  6601. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6602. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6603. BEGIN
  6604. type := GetMathArrayDescriptorType(dimensions);
  6605. Emit(Push(position,op.op));
  6606. (* push type descriptor *)
  6607. reg := TypeDescriptorAdr(type);
  6608. IF ~newObjectFile THEN
  6609. IntermediateCode.MakeMemory(reg,addressType);
  6610. END;
  6611. Emit(Push(position,reg));
  6612. ReleaseIntermediateOperand(reg);
  6613. (* push realtime flag: false by default *)
  6614. Emit(Push(position,false));
  6615. CallThis(position,"Heaps","NewRec",3);
  6616. END NewMathArrayDescriptor;
  6617. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6618. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6619. BEGIN
  6620. NEW(string, LEN(s)); COPY(s, string^);
  6621. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6622. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6623. sv.SetType(type);
  6624. Designate(sv,res);
  6625. Emit(Push(position,res.tag));
  6626. Emit(Push(position,res.op));
  6627. ReleaseOperand(res);
  6628. END PushConstString;
  6629. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6630. BEGIN
  6631. IF b THEN
  6632. Emit(Push(Basic.invalidPosition, true));
  6633. ELSE
  6634. Emit(Push(Basic.invalidPosition, false));
  6635. END;
  6636. END PushConstBoolean;
  6637. PROCEDURE PushConstSet(v: SET);
  6638. VAR value: SyntaxTree.Value; op: Operand;
  6639. BEGIN
  6640. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6641. value.SetType(system.setType);
  6642. Evaluate(value, op);
  6643. Emit(Push(Basic.invalidPosition, op.op));
  6644. ReleaseOperand(op);
  6645. END PushConstSet;
  6646. PROCEDURE PushConstInteger(v: LONGINT);
  6647. VAR value: SyntaxTree.Value; op: Operand;
  6648. BEGIN
  6649. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6650. value.SetType(system.longintType);
  6651. Evaluate(value, op);
  6652. Emit(Push(Basic.invalidPosition, op.op));
  6653. ReleaseOperand(op);
  6654. END PushConstInteger;
  6655. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6656. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6657. section: IntermediateCode.Section;
  6658. BEGIN
  6659. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6660. Global.GetSymbolSegmentedName(symbol, name);
  6661. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6662. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6663. procedure.SetScope(moduleScope);
  6664. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6665. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6666. procedure.SetAccess(SyntaxTree.Hidden);
  6667. currentScope := procedureScope;
  6668. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6669. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6670. RETURN section;
  6671. END OpenInitializer;
  6672. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6673. BEGIN
  6674. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6675. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6676. section := prev;
  6677. END CloseInitializer;
  6678. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6679. VAR name: SyntaxTree.IdentifierString;
  6680. variable: SyntaxTree.Variable;
  6681. parameter: SyntaxTree.Parameter;
  6682. type: SyntaxTree.Type;
  6683. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6684. BEGIN
  6685. InitOperand(op,ModeReference);
  6686. op.op := fp;
  6687. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6688. Dereference(op, x, FALSE);
  6689. result := op;
  6690. Symbol(symbol, op);
  6691. END Field;
  6692. PROCEDURE Direction(direction: LONGINT): SET;
  6693. BEGIN
  6694. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6695. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6696. ELSE HALT(100);
  6697. END;
  6698. END Direction;
  6699. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6700. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6701. BEGIN
  6702. Field(port, op);
  6703. ToMemory(op.op,addressType,0);
  6704. Emit(Push(Basic.invalidPosition, op.op));
  6705. ReleaseOperand(op);
  6706. Basic.GetString(modifier.identifier, name);
  6707. PushConstString(name);
  6708. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6709. ASSERT(SemanticChecker.IsStringType(value.type));
  6710. Designate(value, op);
  6711. Emit(Push(modifier.position, op.tag));
  6712. Emit(Push(modifier.position, op.op));
  6713. ReleaseOperand(op);
  6714. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6715. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6716. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6717. Evaluate(value, op);
  6718. Emit(Push(modifier.position, op.op));
  6719. ReleaseOperand(op);
  6720. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6721. ELSE
  6722. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6723. END;
  6724. END AddPortProperty;
  6725. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6726. VAR modifier: SyntaxTree.Modifier;
  6727. BEGIN
  6728. modifier := parameter.modifiers;
  6729. WHILE modifier # NIL DO
  6730. AddPortProperty(parameter,modifier, modifier.expression);
  6731. modifier := modifier.nextModifier;
  6732. END;
  6733. END AddPortProperties;
  6734. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6735. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6736. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6737. PROCEDURE PushLens(type: SyntaxTree.Type);
  6738. BEGIN
  6739. IF IsSemiDynamicArray(type) THEN
  6740. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6741. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6742. Emit(Push(Basic.invalidPosition, op.op));
  6743. ReleaseOperand(op);
  6744. INC(dim);
  6745. ELSIF IsStaticArray(type) THEN
  6746. len := len * type(SyntaxTree.ArrayType).staticLength;
  6747. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6748. INC(dim);
  6749. ELSE
  6750. baseType := type;
  6751. END;
  6752. END PushLens;
  6753. BEGIN
  6754. (* cell *)
  6755. IF parameter.type IS SyntaxTree.ArrayType THEN
  6756. type := parameter.type;
  6757. dim := 0;
  6758. len := 1;
  6759. PushLens(type);
  6760. portType := baseType.resolved(SyntaxTree.PortType);
  6761. ELSE
  6762. portType := parameter.type(SyntaxTree.PortType);
  6763. END;
  6764. PushSelfPointer();
  6765. (* port / array of ports *)
  6766. IF IsStaticArray(type) THEN
  6767. PushConstInteger(len);
  6768. END;
  6769. Field(parameter, op);
  6770. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6771. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6772. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6773. Designate(d, op);*)
  6774. Emit(Push(Basic.invalidPosition, op.op));
  6775. ReleaseOperand(op);
  6776. (* name *)
  6777. PushConstString(name);
  6778. (* inout *)
  6779. PushConstSet(Direction(portType.direction));
  6780. (* width *)
  6781. PushConstInteger(portType.sizeInBits);
  6782. IF parameter.type IS SyntaxTree.PortType THEN
  6783. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6784. AddPortProperties(parameter);
  6785. ELSIF IsStaticArray(type)THEN
  6786. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6787. ELSIF IsSemiDynamicArray(type) THEN
  6788. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6789. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6790. Emit(Add(position,reg, sp, size));
  6791. (* dim *)
  6792. PushConstInteger(dim);
  6793. (* len array *)
  6794. Emit(Push(position, reg));
  6795. ReleaseIntermediateOperand(reg);
  6796. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6797. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6798. Emit(Add(position, sp,sp, size));
  6799. ELSE
  6800. HALT(100);
  6801. END;
  6802. END Parameter;
  6803. BEGIN
  6804. IF backend.cellsAreObjects THEN
  6805. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6806. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6807. END;
  6808. parameter := x.firstParameter;
  6809. WHILE (parameter # NIL) DO
  6810. type := parameter.type.resolved;
  6811. WHILE (type IS SyntaxTree.ArrayType) DO
  6812. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6813. END;
  6814. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6815. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6816. Parameter(name,parameter);
  6817. END;
  6818. parameter := parameter.nextParameter;
  6819. END;
  6820. ELSE HALT(200)
  6821. END;
  6822. END AddPorts;
  6823. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6824. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6825. BEGIN
  6826. Symbol(cell,op);
  6827. ToMemory(op.op,addressType,0);
  6828. Emit(Push(position,op.op));
  6829. ReleaseOperand(op);
  6830. property.GetName(name);
  6831. (* does not work when inheritance is used:
  6832. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6833. *)
  6834. PushConstString(name);
  6835. IF (value # NIL) THEN
  6836. ASSERT(
  6837. SemanticChecker.IsStringType(property.type)
  6838. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6839. OR (property.type.resolved IS SyntaxTree.FloatType)
  6840. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6841. OR (property.type.resolved IS SyntaxTree.SetType)
  6842. );
  6843. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6844. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6845. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6846. Designate(d, op);
  6847. IF SemanticChecker.IsStringType(property.type) THEN
  6848. Emit(Push(Basic.invalidPosition, op.tag))
  6849. END;
  6850. Emit(Push(Basic.invalidPosition, op.op));
  6851. ReleaseOperand(op);
  6852. END;
  6853. IF value = NIL THEN
  6854. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6855. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6856. ASSERT(SemanticChecker.IsStringType(value.type));
  6857. Designate(value, op);
  6858. PushString(op, value.type);
  6859. ReleaseOperand(op);
  6860. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6861. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6862. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6863. Evaluate(value, op);
  6864. Emit(Push(property.position, op.op));
  6865. ReleaseOperand(op);
  6866. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6867. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6868. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6869. Evaluate(value, op);
  6870. Emit(Push(property.position, op.op));
  6871. ReleaseOperand(op);
  6872. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6873. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6874. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6875. Evaluate(value, op);
  6876. Emit(Push(property.position, op.op));
  6877. ReleaseOperand(op);
  6878. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6879. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6880. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6881. Evaluate(value, op);
  6882. Emit(Push(property.position, op.op));
  6883. ReleaseOperand(op);
  6884. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6885. ELSE
  6886. HALT(200);
  6887. END;
  6888. END AddProperty;
  6889. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6890. VAR symbol: SyntaxTree.Symbol;
  6891. BEGIN
  6892. WHILE modifier # NIL DO
  6893. symbol := cellType.FindProperty(modifier.identifier);
  6894. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6895. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6896. modifier := modifier.nextModifier;
  6897. END;
  6898. END AddModifiers;
  6899. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6900. VAR last: SyntaxTree.Modifier;
  6901. BEGIN
  6902. IF to = NIL THEN
  6903. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6904. ELSE
  6905. last := to;
  6906. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6907. last := last.nextModifier;
  6908. END;
  6909. IF last.identifier # this.identifier THEN
  6910. ASSERT(last.nextModifier = NIL);
  6911. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6912. END;
  6913. END;
  6914. END AppendModifier;
  6915. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6916. BEGIN
  6917. WHILE this # NIL DO
  6918. AppendModifier(to, this);
  6919. this := this.nextModifier;
  6920. END;
  6921. END AppendModifiers;
  6922. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6923. VAR base: SyntaxTree.Type;
  6924. BEGIN
  6925. AppendModifiers(to, c.modifiers);
  6926. base := c.GetBaseValueType();
  6927. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6928. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6929. END;
  6930. END AppendCellTypeModifiers;
  6931. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6932. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6933. BEGIN
  6934. Basic.GetString(modifier.identifier, name);
  6935. PushConstString(name);
  6936. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6937. ASSERT(SemanticChecker.IsStringType(value.type));
  6938. Designate(value, op);
  6939. PushString(op, value.type);
  6940. ReleaseOperand(op);
  6941. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6942. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6943. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6944. Evaluate(value, op);
  6945. Emit(Push(modifier.position, op.op));
  6946. ReleaseOperand(op);
  6947. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6948. ELSE
  6949. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6950. END;
  6951. END AddPortProperty;
  6952. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6953. BEGIN
  6954. WHILE modifier # NIL DO
  6955. AddPortProperty(modifier, modifier.expression);
  6956. modifier := modifier.nextModifier;
  6957. END;
  6958. END AddPortProperties;
  6959. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6960. VAR op: Operand;
  6961. BEGIN
  6962. Evaluate(p, op);
  6963. Emit(Push(p.position, op.op));
  6964. ReleaseOperand(op);
  6965. IF p IS SyntaxTree.Designator THEN
  6966. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6967. END;
  6968. END PushPort;
  6969. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6970. VAR tmp: IntermediateCode.Operand;
  6971. BEGIN
  6972. actualType := actualType.resolved;
  6973. IF actualType IS SyntaxTree.StringType THEN
  6974. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6975. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6976. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6977. ELSE
  6978. tmp := op.tag;
  6979. IntermediateCode.MakeMemory(tmp,addressType);
  6980. Emit(Push(position,tmp));
  6981. END;
  6982. Emit(Push(position,op.op))
  6983. END PushString;
  6984. (* conservative check if x is potentially on the heap, excluding the module heap
  6985. required for generational garbage collector
  6986. *)
  6987. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6988. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6989. BEGIN
  6990. RETURN TRUE;
  6991. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6992. passed by reference.
  6993. pos := x.position.start;
  6994. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6995. x := x(SyntaxTree.Designator).left;
  6996. END;
  6997. RETURN x # NIL;
  6998. *)
  6999. END OnHeap;
  7000. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  7001. VAR
  7002. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  7003. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7004. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7005. tmp:IntermediateCode.Operand;
  7006. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  7007. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7008. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7009. dest: IntermediateCode.Operand;
  7010. staticLength: LONGINT; itype: IntermediateCode.Type;
  7011. convert,isTensor: BOOLEAN;
  7012. recordType: SyntaxTree.RecordType;
  7013. baseType: SyntaxTree.Type;
  7014. flags: SET;
  7015. left: SyntaxTree.Expression;
  7016. call: SyntaxTree.Designator;
  7017. procedure: SyntaxTree.Procedure;
  7018. temporaryVariable: SyntaxTree.Variable;
  7019. dummy: IntermediateCode.Operand;
  7020. customBuiltin: SyntaxTree.CustomBuiltin;
  7021. isVarPar: ARRAY 3 OF BOOLEAN;
  7022. callsection: Sections.Section;
  7023. segmentedName: Basic.SegmentedName;
  7024. needsTrace: BOOLEAN;
  7025. n: ARRAY 256 OF CHAR;
  7026. modifier: SyntaxTree.Modifier;
  7027. previous, init: IntermediateCode.Section;
  7028. prevScope: SyntaxTree.Scope;
  7029. firstPar: LONGINT;
  7030. saved: RegisterEntry;
  7031. callingConvention: SyntaxTree.CallingConvention;
  7032. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7033. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7034. priority: IntermediateCode.Operand;
  7035. op,callop: Operand;
  7036. BEGIN
  7037. IF type = NIL THEN RETURN END;
  7038. type := type.resolved;
  7039. IF type IS SyntaxTree.PointerType THEN
  7040. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7041. END;
  7042. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7043. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7044. recordScope := type(SyntaxTree.RecordType).recordScope;
  7045. IF recordScope.bodyProcedure # NIL THEN
  7046. procedure := recordScope.bodyProcedure;
  7047. body := procedure.procedureScope.body;
  7048. Emit(Push(position,self));
  7049. IF body.isActive THEN
  7050. StaticCallOperand(callop,procedure);
  7051. Emit(Push(position,callop.op));
  7052. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7053. Convert(priority,sizeType);
  7054. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7055. END;
  7056. Emit(Push(position,priority));
  7057. ReleaseIntermediateOperand(priority);
  7058. IF backend.cooperative THEN
  7059. Emit(Push(position,self));
  7060. CallThis(position,"Activities","Create",3)
  7061. ELSE
  7062. flags := 0;
  7063. IF body.isSafe THEN
  7064. flags := 1;
  7065. END;
  7066. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7067. Emit(Push(position,self));
  7068. CallThis(position,"Objects","CreateProcess",4)
  7069. END;
  7070. ELSE
  7071. Emit(Push(position,self));
  7072. StaticCallOperand(callop,procedure);
  7073. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7074. END;
  7075. Emit(Pop(position,self));
  7076. END;
  7077. END CallBodies;
  7078. PROCEDURE PushTD(type: SyntaxTree.Type);
  7079. VAR op: IntermediateCode.Operand;
  7080. BEGIN
  7081. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7082. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7083. ELSE
  7084. IF type.resolved IS SyntaxTree.PointerType THEN
  7085. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7086. END;
  7087. op := TypeDescriptorAdr(type.resolved);
  7088. IF ~newObjectFile THEN
  7089. IntermediateCode.MakeMemory(op,addressType);
  7090. END;
  7091. Emit(Push(position,op));
  7092. END
  7093. END PushTD;
  7094. BEGIN
  7095. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7096. dest := destination; destination := emptyOperand;
  7097. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7098. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7099. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7100. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7101. CASE x.id OF
  7102. (* ---- COPY ----- *)
  7103. |Global.Copy:
  7104. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7105. (* ---- EXCL, INCL----- *)
  7106. |Global.Excl,Global.Incl:
  7107. Evaluate(p0,s0);
  7108. Evaluate(p1,s1);
  7109. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7110. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7111. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7112. END;
  7113. ReuseCopy(res,s0.op);
  7114. ReleaseOperand(s0);
  7115. Reuse1(tmp,s1.op);
  7116. ReleaseOperand(s1);
  7117. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7118. IF x.id = Global.Excl THEN
  7119. Emit(Not(position,tmp,tmp));
  7120. Emit(And(position,res,res,tmp));
  7121. ELSE
  7122. Emit(Or(position,res,res,tmp));
  7123. END;
  7124. ReleaseIntermediateOperand(tmp);
  7125. Designate(p0,s0);
  7126. ToMemory(s0.op,s1.op.type,0);
  7127. Emit(Mov(position,s0.op,res));
  7128. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7129. (* ---- DISPOSE ----- *)
  7130. |Global.Dispose:
  7131. Designate(p0,s0);
  7132. Emit(Push(position,s0.op));
  7133. ReleaseOperand(s0);
  7134. CallThis(position,"Runtime","Dispose", 1);
  7135. (* ---- GETPROCEDURE ----- *)
  7136. |Global.GetProcedure:
  7137. Designate(p0,s0);
  7138. PushString(s0,p0.type);
  7139. Designate(p1,s1);
  7140. PushString(s1,p1.type);
  7141. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7142. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7143. ELSE PushTD(procedureType.firstParameter.type)
  7144. END;
  7145. PushTD(procedureType.returnType);
  7146. Designate(p2,s2);
  7147. Emit(Push(position,s2.op));
  7148. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7149. CallThis(position,"Modules","GetProcedure", 7);
  7150. (* ---- ASH, LSH, ROT ----- *)
  7151. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7152. Evaluate(p0,s0);
  7153. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7154. (* make unsigned arguments in order to produced a logical shift *)
  7155. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7156. convert:= TRUE;
  7157. itype := s0.op.type;
  7158. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7159. Convert(s0.op,itype);
  7160. ELSE
  7161. convert := FALSE;
  7162. END;
  7163. END;
  7164. Evaluate(p1,s1);
  7165. IF IsIntegerConstant(p1,hint) THEN
  7166. ReuseCopy(reg,s0.op);
  7167. IF hint > 0 THEN
  7168. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7169. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7170. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7171. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7172. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7173. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7174. END;
  7175. ELSIF hint < 0 THEN
  7176. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7177. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7178. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7179. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7180. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7181. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7182. END;
  7183. END;
  7184. ReleaseOperand(s0); ReleaseOperand(s1);
  7185. ELSE
  7186. exit := NewLabel();
  7187. end := NewLabel();
  7188. ReuseCopy(reg,s0.op);
  7189. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7190. Reuse1(tmp,s1.op);
  7191. Emit(Neg(position,tmp,s1.op));
  7192. Convert(tmp,s1.op.type);
  7193. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7194. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7195. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7196. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7197. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7198. END;
  7199. ReleaseIntermediateOperand(tmp);
  7200. BrL(end);
  7201. SetLabel(exit);
  7202. ReuseCopy(tmp,s1.op);
  7203. Convert(tmp,s1.op.type);
  7204. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7205. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7206. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7207. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7208. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7209. END;
  7210. ReleaseIntermediateOperand(tmp);
  7211. SetLabel(end);
  7212. ReleaseOperand(s0); ReleaseOperand(s1);
  7213. END;
  7214. InitOperand(result,ModeValue);
  7215. IF convert THEN
  7216. itype := reg.type;
  7217. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7218. Convert(reg,itype);
  7219. END;
  7220. result.op := reg;
  7221. (* ---- CAP ----- *)
  7222. |Global.Cap:
  7223. Evaluate(p0,result);
  7224. ReuseCopy(reg,result.op);
  7225. ReleaseIntermediateOperand(result.op);
  7226. ignore := NewLabel();
  7227. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7228. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7229. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7230. SetLabel(ignore);
  7231. result.op := reg;
  7232. (* ---- CHR ----- *)
  7233. |Global.Chr, Global.Chr32:
  7234. Evaluate(p0,result);
  7235. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7236. |Global.Entier, Global.EntierH:
  7237. Evaluate(p0,result);
  7238. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7239. (* ---- MIN and MAX ----- *)
  7240. |Global.Max,Global.Min:
  7241. Evaluate(p0,s0);
  7242. Evaluate(p1,s1);
  7243. Reuse2(res,s0.op,s1.op);
  7244. else := NewLabel();
  7245. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7246. ELSE BrltL(else,s1.op,s0.op) END;
  7247. Emit(Mov(position,res,s0.op));
  7248. ReleaseOperand(s0);
  7249. end := NewLabel();
  7250. BrL(end);
  7251. SetLabel(else);
  7252. Emit(MovReplace(position,res,s1.op));
  7253. SetLabel(end);
  7254. ReleaseOperand(s1);
  7255. InitOperand(result,ModeValue);
  7256. result.op := res;
  7257. (* ---- ODD ----- *)
  7258. |Global.Odd:
  7259. IF ~conditional THEN
  7260. ConditionToValue(x)
  7261. ELSE
  7262. Evaluate(p0,result);
  7263. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7264. Reuse1(res,result.op);
  7265. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7266. ReleaseIntermediateOperand(result.op);
  7267. result.op := res;
  7268. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7269. ReleaseOperand(result);
  7270. BrL(falseLabel);
  7271. END;
  7272. (* ---- ORD ----- *)
  7273. |Global.Ord, Global.Ord32:
  7274. Evaluate(p0,result);
  7275. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7276. (* ---- SHORT, LONG ----- *)
  7277. |Global.Short, Global.Long:
  7278. Evaluate(p0,result);
  7279. IF x.type IS SyntaxTree.ComplexType THEN
  7280. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7281. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7282. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7283. ELSE
  7284. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7285. END
  7286. (* ---- HALT, SYSTEM.HALT----- *)
  7287. |Global.Halt, Global.systemHalt:
  7288. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7289. EmitTrap (position, val);
  7290. (* ---- ASSERT ----- *)
  7291. |Global.Assert:
  7292. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7293. trueL := NewLabel();
  7294. falseL := NewLabel();
  7295. Condition(p0,trueL,falseL);
  7296. IF p1 = NIL THEN val := AssertTrap
  7297. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7298. END;
  7299. SetLabel(falseL);
  7300. EmitTrap(position,val);
  7301. SetLabel(trueL);
  7302. END;
  7303. (*
  7304. Emit(TrapC(result.op,val);
  7305. *)
  7306. (* ---- INC, DEC----- *)
  7307. |Global.Inc,Global.Dec:
  7308. Expression(p0); adr := result.op;
  7309. LoadValue(result,p0.type); l := result;
  7310. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7311. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7312. END;
  7313. IF x.id = Global.Inc THEN
  7314. Emit(Add(position,l.op,l.op,r.op));
  7315. ELSE
  7316. Emit(Sub(position,l.op,l.op,r.op));
  7317. END;
  7318. ReleaseOperand(l); ReleaseOperand(r);
  7319. (* ---- LEN ----- *)
  7320. |Global.Len: (* dynamic length, static length done by checker *)
  7321. Designate(p0,operand);
  7322. IF p1 = NIL THEN
  7323. InitOperand(l,ModeValue);
  7324. l.op := IntermediateCode.Immediate(sizeType,0);
  7325. ELSE
  7326. Evaluate(p1,l);
  7327. END;
  7328. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7329. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7330. Dereference(operand, p0.type.resolved, FALSE);
  7331. END;
  7332. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7333. ReleaseOperand(operand); ReleaseOperand(l);
  7334. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7335. ASSERT(p1 # NIL);
  7336. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7337. Dereference(operand,p0.type.resolved,FALSE);
  7338. END;
  7339. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7340. ReleaseOperand(operand); ReleaseOperand(l);
  7341. ELSE HALT(100);
  7342. END;
  7343. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7344. (* ---- FIRST ---- *)
  7345. |Global.First:
  7346. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7347. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7348. ELSE
  7349. Designate(p0, result)
  7350. END
  7351. (* ---- LAST ---- *)
  7352. |Global.Last:
  7353. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7354. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7355. ELSE
  7356. Designate(p0, result);
  7357. (* make sure result.op is a register *)
  7358. tmp := result.op;
  7359. ReuseCopy(result.op, result.op);
  7360. ReleaseIntermediateOperand(tmp);
  7361. (* add offset to result.op *)
  7362. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7363. END
  7364. (* ---- STEP ---- *)
  7365. |Global.Step:
  7366. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7367. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7368. ELSE
  7369. Designate(p0, result);
  7370. (* make sure result.op is a register *)
  7371. tmp := result.op;
  7372. ReuseCopy(result.op, result.op);
  7373. ReleaseIntermediateOperand(tmp);
  7374. (* add offset to result.op *)
  7375. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7376. END
  7377. (* ---- RE ---- *)
  7378. |Global.Re:
  7379. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7380. Designate(p0, result)
  7381. ELSE
  7382. Evaluate(p0, result)
  7383. END
  7384. (* ---- IM ---- *)
  7385. |Global.Im:
  7386. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7387. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7388. Designate(p0, result);
  7389. (* make sure result.op is a register *)
  7390. tmp := result.op;
  7391. ReuseCopy(result.op, result.op);
  7392. ReleaseIntermediateOperand(tmp);
  7393. (* add offset to result.op *)
  7394. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7395. (* ---- ABS ----- *)
  7396. |Global.Abs:
  7397. Evaluate(p0,operand);
  7398. type := p0.type.resolved;
  7399. InitOperand(result,ModeValue);
  7400. Reuse1a(result.op,operand.op,dest);
  7401. Emit(Abs(position,result.op,operand.op));
  7402. ReleaseOperand(operand);
  7403. (* ---- WAIT ----- *)
  7404. |Global.Wait:
  7405. Evaluate(p0,operand);
  7406. Emit(Push(position,operand.op));
  7407. ReleaseOperand(operand);
  7408. CallThis(position,"Activities","Wait", 1);
  7409. (* ---- NEW ----- *)
  7410. |Global.New:
  7411. (*! the following code is only correct for "standard" Oberon calling convention *)
  7412. IF x.type # NIL THEN
  7413. type := x.type.resolved;
  7414. firstPar := 0;
  7415. ELSE
  7416. type := p0.type.resolved;
  7417. firstPar := 1;
  7418. END;
  7419. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7420. THEN
  7421. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7422. IF backend.cooperative THEN
  7423. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7424. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7425. IF recordType.isObject THEN
  7426. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7427. IF recordType.IsActive() THEN
  7428. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7429. END;
  7430. IF recordType.IsProtected() THEN
  7431. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7432. END;
  7433. ELSE
  7434. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7435. END;
  7436. END;
  7437. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7438. CallThis(position,"Runtime","New", 1);
  7439. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7440. Emit(Result(position, pointer));
  7441. exit := NewLabel();
  7442. BreqL(exit,pointer,nil);
  7443. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7444. GetRecordTypeName (recordType,name);
  7445. IF ~recordType.isObject THEN
  7446. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7447. END;
  7448. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7449. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7450. IF recordType.isObject THEN
  7451. IF recordType.IsProtected() THEN
  7452. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7453. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7454. END;
  7455. IF recordType.IsActive() THEN
  7456. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7457. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7458. END;
  7459. END;
  7460. END;
  7461. (* initialize fields *)
  7462. IF type(SyntaxTree.PointerType).isPlain THEN
  7463. size := 0;
  7464. ELSIF recordType.isObject THEN
  7465. size := BaseObjectTypeSize;
  7466. ELSE
  7467. size := BaseRecordTypeSize;
  7468. END;
  7469. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7470. (* call initializer *)
  7471. constructor := GetConstructor(recordType);
  7472. IF constructor # NIL THEN
  7473. (*! should be unified with ProcedureCallDesignator *)
  7474. Emit(Push(position,pointer));
  7475. ReleaseIntermediateOperand(pointer);
  7476. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7477. FOR i := firstPar TO x.parameters.Length()-1 DO
  7478. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7479. formalParameter := formalParameter.nextParameter;
  7480. END;
  7481. (* static call of the constructor *)
  7482. GetCodeSectionNameForSymbol(constructor,name);
  7483. ASSERT(~constructor.isInline);
  7484. IF constructor.scope.ownerModule # module.module THEN
  7485. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7486. ELSE
  7487. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7488. END;
  7489. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7490. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7491. Emit(Pop(position,pointer));
  7492. END;
  7493. (* call bodies *)
  7494. CallBodies(pointer,type);
  7495. SetLabel(exit);
  7496. needsTrace := p0.NeedsTrace();
  7497. IF needsTrace THEN ModifyAssignments(true) END;
  7498. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7499. Emit(Push(position, pointer));
  7500. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7501. Emit(Pop(position, pointer));
  7502. END;
  7503. Designate(p0,l);
  7504. IF needsTrace THEN
  7505. CallAssignPointer(l.op, pointer);
  7506. ELSE
  7507. ToMemory(l.op,addressType,0);
  7508. Emit(Mov(position,l.op,pointer));
  7509. END;
  7510. ReleaseIntermediateOperand(pointer);
  7511. ReleaseOperand(l);
  7512. IF needsTrace THEN ModifyAssignments(false) END;
  7513. ELSE (* not cooperative backend *)
  7514. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7515. IF temporaryVariable # NIL THEN
  7516. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7517. ELSE
  7518. Designate(p0,l);
  7519. END;
  7520. (* l.op contains address of pointer to record *)
  7521. Emit(Push(position,l.op)); (* address for use after syscall *)
  7522. Emit(Push(position,l.op));
  7523. ReleaseOperand(l);
  7524. (* push type descriptor *)
  7525. reg := TypeDescriptorAdr(recordType);
  7526. IF ~newObjectFile THEN
  7527. IntermediateCode.MakeMemory(reg,addressType);
  7528. END;
  7529. Emit(Push(position,reg));
  7530. ReleaseIntermediateOperand(reg);
  7531. (* push realtime flag *)
  7532. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7533. ELSE Emit(Push(position,false));
  7534. END;
  7535. CallThis(position,"Heaps","NewRec", 3);
  7536. (* check allocation success, if not successful then do not call initializers and bodies *)
  7537. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7538. Emit(Pop(position,pointer));
  7539. MakeMemory(reg,pointer,addressType,0);
  7540. ReleaseIntermediateOperand(pointer);
  7541. pointer := reg;
  7542. exit := NewLabel();
  7543. BreqL(exit,pointer,nil);
  7544. Emit(Push(position,pointer));
  7545. (* initialize fields *)
  7546. InitFields(recordType, pointer,0);
  7547. (* call initializer *)
  7548. constructor := GetConstructor(recordType);
  7549. IF constructor # NIL THEN
  7550. (*! should be unified with ProcedureCallDesignator *)
  7551. Emit(Push(position,pointer));
  7552. ReleaseIntermediateOperand(pointer);
  7553. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7554. FOR i := firstPar TO x.parameters.Length()-1 DO
  7555. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7556. formalParameter := formalParameter.nextParameter;
  7557. END;
  7558. (* static call of the constructor *)
  7559. GetCodeSectionNameForSymbol(constructor,name);
  7560. ASSERT(~constructor.isInline);
  7561. IF constructor.scope.ownerModule # module.module THEN
  7562. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7563. ELSE
  7564. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7565. END;
  7566. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7567. ELSE
  7568. ReleaseIntermediateOperand(pointer);
  7569. END;
  7570. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7571. Emit(Pop(position,pointer));
  7572. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7573. Designate(p0,l);
  7574. IF backend.writeBarriers & OnHeap(p0) THEN
  7575. SaveRegisters();ReleaseUsedRegisters(saved);
  7576. Emit(Push(position,l.op));
  7577. Emit(Push(position,pointer));
  7578. CallThis(position,"Heaps","Assign",2);
  7579. RestoreRegisters(saved);
  7580. ELSE
  7581. ToMemory(l.op,addressType,0);
  7582. Emit(Mov(position,l.op,pointer));
  7583. END;
  7584. ReleaseOperand(l);
  7585. result.tag := emptyOperand;
  7586. ELSIF (x.type # NIL) THEN
  7587. result := l; (* temporary variable is the result of NEW Type() *)
  7588. END;
  7589. (* call bodies *)
  7590. CallBodies(pointer,type);
  7591. ReleaseIntermediateOperand(pointer);
  7592. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7593. end := NewLabel();
  7594. BrL(end);
  7595. SetLabel(exit);
  7596. Designate(p0,l);
  7597. ToMemory(l.op,addressType,0);
  7598. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7599. ReleaseOperand(l);
  7600. SetLabel(end);
  7601. ELSE
  7602. SetLabel(exit);
  7603. END;
  7604. END;
  7605. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7606. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7607. IF ~backend.cooperative THEN (* simpler version *)
  7608. (*
  7609. push len0
  7610. push len1
  7611. push len2
  7612. push len_size
  7613. push len_adr
  7614. push tag
  7615. push static elements
  7616. push element size
  7617. push adr
  7618. *)
  7619. dim := 0;
  7620. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7621. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7622. parameter := x.parameters.GetExpression(i);
  7623. Evaluate(parameter,r);
  7624. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7625. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7626. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7627. END;
  7628. Emit(Push(position,r.op));
  7629. ReleaseOperand(r);
  7630. INC(dim);
  7631. END;
  7632. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7633. Emit(Mov(position, adr, sp));
  7634. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7635. Emit(Push(position, adr));
  7636. ReleaseIntermediateOperand(adr);
  7637. openDim := dim;
  7638. staticLength := 1;
  7639. IF type IS SyntaxTree.ArrayType THEN
  7640. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7641. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7642. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7643. END;
  7644. END;
  7645. IF SemanticChecker.ContainsPointer(type) THEN
  7646. tmp := TypeDescriptorAdr(type);
  7647. IF ~newObjectFile THEN
  7648. IntermediateCode.MakeMemory(tmp,addressType);
  7649. END;
  7650. ELSE
  7651. tmp := nil;
  7652. END;
  7653. Emit(Push(position,tmp)); (* type descriptor *)
  7654. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7655. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7656. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7657. Designate(p0,l);
  7658. Emit(Push(position,l.op)); (* address *)
  7659. ReleaseOperand(l);
  7660. CallThis(position,"Heaps","NewArray", 6);
  7661. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7662. Emit(Add(position,sp,sp,tmp));
  7663. ELSE
  7664. dim := 0;
  7665. IntermediateCode.InitOperand(reg);
  7666. IF p1 # NIL THEN
  7667. FOR i := firstPar TO x.parameters.Length()-1 DO
  7668. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7669. parameter := x.parameters.GetExpression(i);
  7670. Evaluate(parameter,r);
  7671. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7672. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7673. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7674. END;
  7675. Emit(Push(position,r.op));
  7676. IF i=1 THEN
  7677. CopyInt(reg,r.op);
  7678. ELSE
  7679. MulInt(reg, reg, r.op);
  7680. END;
  7681. ReleaseOperand(r);
  7682. INC(dim);
  7683. END;
  7684. Convert(reg,addressType);
  7685. ELSE
  7686. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7687. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7688. END;
  7689. openDim := dim;
  7690. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7691. IF backend.cooperative THEN
  7692. size := ToMemoryUnits(system,system.SizeOf(type));
  7693. WHILE type IS SyntaxTree.ArrayType DO
  7694. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7695. END;
  7696. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7697. IF (size # 1) THEN
  7698. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7699. END;
  7700. Emit(Push(position,reg));
  7701. size := ToMemoryUnits(system,system.SizeOf(type));
  7702. IF (size # 1) THEN
  7703. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7704. END;
  7705. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7706. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7707. Emit(Push(position,reg));
  7708. ReleaseIntermediateOperand(reg);
  7709. CallThis(position,"Runtime","New", 1);
  7710. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7711. Emit(Result(position, pointer));
  7712. exit := NewLabel();
  7713. else := NewLabel();
  7714. BreqL(else,pointer,nil);
  7715. IF ~type.hasPointers THEN
  7716. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7717. ELSIF type IS SyntaxTree.RecordType THEN
  7718. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7719. ELSIF type IS SyntaxTree.ProcedureType THEN
  7720. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7721. ELSE
  7722. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7723. END;
  7724. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7725. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7726. 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))));
  7727. IF type IS SyntaxTree.RecordType THEN
  7728. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7729. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7730. ELSE
  7731. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7732. END;
  7733. i := openDim;
  7734. WHILE i > 0 DO
  7735. DEC (i);
  7736. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7737. END;
  7738. needsTrace := p0.NeedsTrace();
  7739. IF needsTrace THEN ModifyAssignments(true) END;
  7740. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7741. Emit(Push(position, pointer));
  7742. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7743. Emit(Pop(position, pointer));
  7744. END;
  7745. Designate(p0,l);
  7746. IF needsTrace THEN
  7747. CallAssignPointer(l.op, pointer);
  7748. ModifyAssignments(false);
  7749. ELSE
  7750. ToMemory(l.op,addressType,0);
  7751. Emit(Mov(position,l.op,pointer));
  7752. END;
  7753. ReleaseIntermediateOperand(pointer);
  7754. ReleaseOperand(l);
  7755. BrL(exit);
  7756. SetLabel(else);
  7757. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7758. Designate(p0,l);
  7759. IF needsTrace THEN
  7760. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7761. ELSE
  7762. ToMemory(l.op,addressType,0);
  7763. Emit(Mov(position,l.op,pointer));
  7764. END;
  7765. ReleaseOperand(l);
  7766. SetLabel(exit);
  7767. ELSE
  7768. (*! the following code is only correct for "standard" Oberon calling convention *)
  7769. IF SemanticChecker.ContainsPointer(type) THEN
  7770. IF type IS SyntaxTree.ArrayType THEN
  7771. staticLength := 1;
  7772. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7773. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7774. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7775. END;
  7776. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7777. MulInt(reg,reg,tmp);
  7778. END;
  7779. Designate(p0,l);
  7780. IF openDim > 0 THEN
  7781. Emit(Push(position,l.op)); (* address for use after syscall *)
  7782. END;
  7783. Emit(Push(position,l.op)); (* address *)
  7784. ReleaseOperand(l);
  7785. tmp := TypeDescriptorAdr(type);
  7786. IF ~newObjectFile THEN
  7787. IntermediateCode.MakeMemory(tmp,addressType);
  7788. END;
  7789. Emit(Push(position,tmp)); (* type descriptor *)
  7790. ReleaseIntermediateOperand(tmp);
  7791. Emit(Push(position,reg)); (* number Elements *)
  7792. ReleaseIntermediateOperand(reg);
  7793. tmp := IntermediateCode.Immediate(addressType,dim);
  7794. Emit(Push(position,tmp)); (* dimensions *)
  7795. (* push realtime flag *)
  7796. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7797. ELSE Emit(Push(position,false));
  7798. END;
  7799. CallThis(position,"Heaps","NewArr",5)
  7800. ELSE
  7801. size := ToMemoryUnits(system,system.SizeOf(type));
  7802. IF (size # 1) THEN
  7803. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7804. (*
  7805. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7806. *)
  7807. END;
  7808. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7809. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7810. AddInt(reg, reg, tmp);
  7811. (*
  7812. Emit(Add(position,reg,reg,tmp));
  7813. *)
  7814. Designate(p0,l);
  7815. IF openDim >0 THEN
  7816. Emit(Push(position,l.op)); (* address for use after syscall *)
  7817. END;
  7818. Emit(Push(position,l.op)); (* address for syscall *)
  7819. ReleaseOperand(l); (* pointer address *)
  7820. Emit(Push(position,reg)); (* size *)
  7821. ReleaseIntermediateOperand(reg);
  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","NewSys", 3)
  7827. END;
  7828. IF openDim > 0 THEN
  7829. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7830. Emit(Pop(position,adr));
  7831. ToMemory(adr,addressType,0);
  7832. ReuseCopy(tmp,adr);
  7833. ReleaseIntermediateOperand(adr);
  7834. adr := tmp;
  7835. else := NewLabel();
  7836. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7837. i := openDim-1;
  7838. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7839. WHILE (i >= 0) DO
  7840. Emit(Pop(position,reg));
  7841. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7842. Emit(Mov(position,res,reg));
  7843. DEC(i);
  7844. END;
  7845. ReleaseIntermediateOperand(adr);
  7846. ReleaseIntermediateOperand(reg);
  7847. exit := NewLabel();
  7848. BrL(exit);
  7849. SetLabel(else);
  7850. (* else part: array could not be allocated *)
  7851. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7852. Emit(Add(position,sp,sp,tmp));
  7853. SetLabel(exit);
  7854. END;
  7855. END;
  7856. END;
  7857. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7858. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7859. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7860. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7861. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7862. callingConvention := procedureType.callingConvention;
  7863. left.SetType(procedure.type);
  7864. formalParameter := procedureType.firstParameter;
  7865. (* push array to allocate *)
  7866. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7867. formalParameter :=formalParameter.nextParameter;
  7868. (* push length array *)
  7869. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7870. (* push size *)
  7871. type := t0;
  7872. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7873. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7874. END;
  7875. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7876. Emit(Push(position,tmp));
  7877. (* *)
  7878. IF SemanticChecker.ContainsPointer(type) THEN
  7879. tmp := TypeDescriptorAdr(type);
  7880. IF ~newObjectFile THEN
  7881. IntermediateCode.MakeMemory(tmp,addressType);
  7882. END;
  7883. ELSE
  7884. tmp := IntermediateCode.Immediate(addressType, 0);
  7885. END;
  7886. Emit(Push(position,tmp)); (* type descriptor *)
  7887. StaticCallOperand(result,procedure);
  7888. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7889. ReleaseOperand(result);
  7890. END;
  7891. (*
  7892. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7893. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7894. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7895. *)
  7896. ELSE
  7897. (*
  7898. push len0
  7899. push len1
  7900. push len2
  7901. push size
  7902. push len_adr
  7903. push element_size
  7904. push tag
  7905. push adr
  7906. *)
  7907. dim := 0;
  7908. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7909. isTensor := TRUE;
  7910. ELSE
  7911. isTensor := FALSE;
  7912. END;
  7913. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7914. IF ~isTensor THEN
  7915. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7916. END;
  7917. parameter := x.parameters.GetExpression(i);
  7918. Evaluate(parameter,r);
  7919. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7920. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7921. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7922. END;
  7923. Emit(Push(position,r.op));
  7924. ReleaseOperand(r);
  7925. INC(dim);
  7926. END;
  7927. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7928. Emit(Mov(position, adr, sp));
  7929. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7930. Emit(Push(position, adr));
  7931. ReleaseIntermediateOperand(adr);
  7932. openDim := dim;
  7933. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7934. IF isTensor THEN
  7935. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7936. ELSE
  7937. baseType := SemanticChecker.ArrayBase(type,openDim);
  7938. END;
  7939. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7940. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7941. IF SemanticChecker.ContainsPointer(baseType) THEN
  7942. tmp := TypeDescriptorAdr(baseType);
  7943. IF ~newObjectFile THEN
  7944. IntermediateCode.MakeMemory(tmp,addressType);
  7945. END;
  7946. ELSE
  7947. tmp := nil;
  7948. END;
  7949. Emit(Push(position,tmp)); (* type descriptor *)
  7950. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7951. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7952. ELSE (* error message has already been emited *)
  7953. RETURN;
  7954. END;
  7955. Designate(p0,l);
  7956. IF isTensor THEN
  7957. Emit(Push(position,l.op)); (* address *)
  7958. ELSE
  7959. Emit(Push(position,l.tag)); (* address *)
  7960. END;
  7961. ReleaseOperand(l);
  7962. StaticCallOperand(result,procedure);
  7963. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7964. ReleaseOperand(result);
  7965. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7966. Emit(Add(position,sp,sp,tmp));
  7967. END;
  7968. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7969. THEN
  7970. IF ~backend.cellsAreObjects THEN RETURN END;
  7971. IF InCellScope(currentScope) THEN
  7972. PushSelfPointer()
  7973. ELSE
  7974. Emit(Push(position, nil));
  7975. END;
  7976. (* push temp address *)
  7977. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7978. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7979. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7980. (* l.op contains address of pointer to record *)
  7981. Emit(Push(position,l.op)); (* address for use after syscall *)
  7982. ReleaseOperand(l);
  7983. (* push type descriptor *)
  7984. reg := TypeDescriptorAdr(baseType);
  7985. IF ~newObjectFile THEN
  7986. IntermediateCode.MakeMemory(reg,addressType);
  7987. END;
  7988. Emit(Push(position,reg));
  7989. ReleaseIntermediateOperand(reg);
  7990. (* push name *)
  7991. (*Global.GetSymbolName(p0, n);*)
  7992. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7993. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7994. ELSE
  7995. Global.GetModuleName(module.module, n);
  7996. END;
  7997. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7998. (*type.typeDeclaration.GetName(n);*)
  7999. PushConstString(n);
  8000. (* push cellnet boolean *)
  8001. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  8002. (* push engine boolean *)
  8003. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  8004. (* allocate *)
  8005. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  8006. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8007. (* l.op contains address of pointer to record *)
  8008. ToMemory(l.op,addressType,0);
  8009. (* l.op contains value of pointer to record *)
  8010. InitFields(baseType, l.op,0);
  8011. (* add capabilities *)
  8012. modifier := p0(SyntaxTree.Designator).modifiers;
  8013. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  8014. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  8015. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  8016. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  8017. END;
  8018. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  8019. (*
  8020. modifier := baseType(SyntaxTree.CellType).modifiers;
  8021. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  8022. modifier := p0(SyntaxTree.Designator).modifiers;
  8023. *)
  8024. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8025. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8026. (* l.op contains address of pointer to record *)
  8027. ToMemory(l.op,addressType,0);
  8028. (* l.op contains value of pointer to record *)
  8029. Emit(Push(position,l.op)); (* address for use after syscall *)
  8030. ReleaseOperand(l);
  8031. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8032. prevScope := currentScope;
  8033. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8034. previous := section;
  8035. section := init;
  8036. (* add ports *)
  8037. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8038. CloseInitializer(previous);
  8039. currentScope := prevScope;
  8040. Symbol(temporaryVariable,l);
  8041. ToMemory(l.op,addressType,0);
  8042. Emit(Push(position,l.op));
  8043. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8044. (*
  8045. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8046. IF constructor # NIL THEN
  8047. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8048. FOR i := 1 TO x.parameters.Length()-1 DO
  8049. p := x.parameters.GetExpression(i);
  8050. Global.GetSymbolName(parameter,name);
  8051. Evaluate(p, value);
  8052. ASSERT(value.type # NIL);
  8053. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8054. par := instance.AddParameter(name);
  8055. par.SetInteger(value.integer);
  8056. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8057. par := instance.AddParameter(name);
  8058. par.SetBoolean(value.boolean);
  8059. ELSE Error(x.position,NotYetImplemented)
  8060. END;
  8061. parameter := parameter.nextParameter
  8062. END;
  8063. END;
  8064. *)
  8065. (* call initializer *)
  8066. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8067. IF constructor # NIL THEN
  8068. (*! should be unified with ProcedureCallDesignator *)
  8069. IF backend.cellsAreObjects THEN
  8070. Symbol(temporaryVariable,l);
  8071. ToMemory(l.op,addressType,0);
  8072. Emit(Push(position,l.op));
  8073. ReleaseOperand(l);
  8074. END;
  8075. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8076. FOR i := firstPar TO x.parameters.Length()-1 DO
  8077. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8078. formalParameter := formalParameter.nextParameter;
  8079. END;
  8080. (* static call of the constructor *)
  8081. Global.GetSymbolSegmentedName(constructor,name);
  8082. ASSERT(~constructor.isInline);
  8083. IF constructor.scope.ownerModule # module.module THEN
  8084. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8085. ELSE
  8086. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8087. END;
  8088. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8089. (*ELSE
  8090. ReleaseIntermediateOperand(pointer);*)
  8091. END;
  8092. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8093. ToMemory(l.op, addressType, 0);
  8094. Designate(p0,s0);
  8095. ToMemory(s0.op,addressType,0);
  8096. Emit(Mov(position,s0.op,l.op));
  8097. ReleaseOperand(l);
  8098. ReleaseOperand(s0);
  8099. result.tag := emptyOperand;
  8100. (* start *)
  8101. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8102. (* push cell *)
  8103. Symbol(temporaryVariable, l);
  8104. ToMemory(l.op,addressType,0);
  8105. Emit(Push(Basic.invalidPosition,l.op));
  8106. (* push delegate *)
  8107. Emit(Push(Basic.invalidPosition,l.op));
  8108. ReleaseOperand(l);
  8109. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8110. Emit(Push(position, s1.op));
  8111. ReleaseOperand(s1);
  8112. CallThis(position,"ActiveCellsRuntime","Start",3);
  8113. END;
  8114. (*IF temporaryVariable # NIL THEN
  8115. end := NewLabel();
  8116. BrL(end);
  8117. SetLabel(exit);
  8118. Designate(p0,l);
  8119. ToMemory(l.op,addressType,0);
  8120. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8121. ReleaseOperand(l);
  8122. SetLabel(end);
  8123. ELSE
  8124. SetLabel(exit);
  8125. END;
  8126. *)
  8127. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8128. ELSE (* no pointer to record, no pointer to array *)
  8129. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8130. (* ignore new statement *)
  8131. Warning(p0.position, "cannot run on final hardware");
  8132. ELSE
  8133. HALT(200);
  8134. END;
  8135. END;
  8136. (* ---- ADDRESSOF----- *)
  8137. |Global.systemAdr:
  8138. Designate(p0,s0);
  8139. s0.mode := ModeValue;
  8140. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8141. ReleaseIntermediateOperand(s0.op);
  8142. s0.op := s0.tag;
  8143. IntermediateCode.InitOperand(s0.tag);
  8144. END;
  8145. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8146. result := s0;
  8147. (* ---- BIT ----- *)
  8148. |Global.systemBit:
  8149. Evaluate(p0,s0);
  8150. ToMemory(s0.op,addressType,0);
  8151. ReuseCopy(res,s0.op);
  8152. ReleaseOperand(s0);
  8153. Evaluate(p1,s1);
  8154. Emit(Ror(position,res,res,s1.op));
  8155. ReleaseOperand(s1);
  8156. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8157. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8158. IF ~conditional THEN
  8159. InitOperand(result,ModeValue); result.op := res;
  8160. ELSE
  8161. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8162. BrL(falseLabel);
  8163. ReleaseIntermediateOperand(res);
  8164. END;
  8165. (* --- MSK ----*)
  8166. |Global.systemMsk:
  8167. Evaluate(p0,s0);
  8168. Evaluate(p1,s1);
  8169. ReuseCopy(res,s0.op);
  8170. ReleaseOperand(s0);
  8171. Emit(And(position,res,res,s1.op));
  8172. ReleaseOperand(s1);
  8173. InitOperand(result,ModeValue);
  8174. result.op := res;
  8175. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8176. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8177. Evaluate(p0,s0);
  8178. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8179. ReleaseOperand(s0);
  8180. InitOperand(result,ModeValue);
  8181. result.op := res;
  8182. (* ---- SYSTEM.GetStackPointer ----- *)
  8183. |Global.systemGetStackPointer:
  8184. InitOperand(result,ModeValue);
  8185. result.op := sp;
  8186. (* ---- SYSTEM.GetFramePointer ----- *)
  8187. |Global.systemGetFramePointer:
  8188. InitOperand(result,ModeValue);
  8189. result.op := fp;
  8190. (* ---- SYSTEM.GetActivity ----- *)
  8191. |Global.systemGetActivity:
  8192. ASSERT(backend.cooperative);
  8193. InitOperand(result,ModeValue);
  8194. result.op := ap;
  8195. (* ---- SYSTEM.SetStackPointer ----- *)
  8196. |Global.systemSetStackPointer:
  8197. Evaluate(p0,s0); (* *)
  8198. Emit(Mov(position,sp,s0.op));
  8199. ReleaseOperand(s0);
  8200. (* ---- SYSTEM.SetFramePointer ----- *)
  8201. |Global.systemSetFramePointer:
  8202. Evaluate(p0,s0); (* *)
  8203. Emit(Mov(position,fp,s0.op));
  8204. ReleaseOperand(s0);
  8205. (* ---- SYSTEM.Activity ----- *)
  8206. |Global.systemSetActivity:
  8207. ASSERT(backend.cooperative);
  8208. Evaluate(p0,s0); (* *)
  8209. Emit(Mov(position,ap,s0.op));
  8210. ReleaseOperand(s0);
  8211. (* ---- SYSTEM.VAL ----- *)
  8212. |Global.systemVal:
  8213. Expression(p1);
  8214. s1 := result;
  8215. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8216. IF s1.mode = ModeReference THEN
  8217. (* nothing to be done if not record type, just take over new type *)
  8218. IF (type IS SyntaxTree.RecordType) THEN
  8219. ReleaseIntermediateOperand(s1.tag);
  8220. s1.tag := TypeDescriptorAdr(type);
  8221. IF ~newObjectFile THEN
  8222. IntermediateCode.MakeMemory(s1.tag,addressType);
  8223. END;
  8224. UseIntermediateOperand(s1.tag);
  8225. END;
  8226. result := s1;
  8227. ELSE (* copy over result to different type, may not use convert *)
  8228. itype := IntermediateCode.GetType(system,type);
  8229. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8230. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8231. Emit(Mov(position,s0.op,s1.op));
  8232. ReleaseOperand(s1);
  8233. InitOperand(result,ModeValue);
  8234. result.op := s0.op;
  8235. ELSE (* different size, must convert *)
  8236. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8237. Convert(s1.op, IntermediateCode.GetType(system,type));
  8238. result := s1;
  8239. END;
  8240. END;
  8241. (* ---- SYSTEM.GET ----- *)
  8242. |Global.systemGet:
  8243. Evaluate(p0,s0); (* adr *)
  8244. Designate(p1,s1); (* variable *)
  8245. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8246. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8247. Emit(Mov(position,s1.op,s0.op));
  8248. ReleaseOperand(s1);
  8249. ReleaseOperand(s0);
  8250. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8251. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8252. Evaluate(p0,s0); (* *)
  8253. Evaluate(p1,s1); (* variable *)
  8254. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8255. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8256. (* real part *)
  8257. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8258. Emit(Mov(position,res, s1.op));
  8259. ReleaseIntermediateOperand(res);
  8260. (* imaginary part *)
  8261. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8262. Emit(Mov(position,res, s1.tag));
  8263. ReleaseIntermediateOperand(res);
  8264. ReleaseOperand(s1);
  8265. ReleaseOperand(s0);
  8266. ELSE
  8267. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8268. ReleaseOperand(s0);
  8269. Emit(Mov(position,res,s1.op));
  8270. ReleaseIntermediateOperand(res);
  8271. ReleaseOperand(s1);
  8272. END;
  8273. (* ---- SYSTEM.MOVE ----- *)
  8274. |Global.systemMove:
  8275. Evaluate(p0,s0);
  8276. Evaluate(p1,s1);
  8277. Evaluate(p2,s2);
  8278. Emit(Copy(position,s1.op,s0.op,s2.op));
  8279. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8280. (* ---- SYSTEM.NEW ----- *)
  8281. |Global.systemNew:
  8282. Designate(p0,s0);
  8283. Emit(Push(position,s0.op));
  8284. ReleaseOperand(s0);
  8285. Evaluate(p1,s1);
  8286. Emit(Push(position,s1.op));
  8287. ReleaseOperand(s1);
  8288. (* push realtime flag: false by default *)
  8289. Emit(Push(position,false));
  8290. CallThis(position,"Heaps","NewSys",3);
  8291. (* ---- SYSTEM.CALL ----- *)
  8292. |Global.systemRef:
  8293. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8294. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8295. s0.mode := ModeValue;
  8296. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8297. result := s0
  8298. (* ---- INCR ----- *)
  8299. |Global.Incr:
  8300. Designate(p0,operand);
  8301. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8302. Dereference(operand,p0.type.resolved,FALSE);
  8303. END;
  8304. ASSERT(p1 # NIL);
  8305. Evaluate(p1,l);
  8306. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8307. ReleaseOperand(operand); ReleaseOperand(l);
  8308. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8309. (* ---- SUM ----- *)
  8310. |Global.Sum: HALT(200);
  8311. (* ---- ALL ----- *)
  8312. |Global.All: HALT(200);
  8313. (* ---- CAS ----- *)
  8314. |Global.Cas:
  8315. needsTrace := p0.NeedsTrace();
  8316. IF needsTrace THEN ModifyAssignments(true) END;
  8317. Designate(p0,s0);
  8318. Evaluate(p1,s1);
  8319. Evaluate(p2,s2);
  8320. IF needsTrace THEN
  8321. Emit(Push(position, s0.op));
  8322. Emit(Push(position, s1.op));
  8323. Emit(Push(position, s2.op));
  8324. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8325. ELSE
  8326. Emit(Cas(position,s0.op,s1.op,s2.op));
  8327. END;
  8328. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8329. IF needsTrace THEN ModifyAssignments(false) END;
  8330. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8331. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8332. IF conditional THEN
  8333. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8334. BrL(falseLabel);
  8335. ReleaseIntermediateOperand(res);
  8336. END;
  8337. (* ---- DIM ----- *)
  8338. |Global.Dim:
  8339. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8340. Designate(p0,s0);
  8341. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8342. Dereference(s0,p0.type.resolved,FALSE);
  8343. END;
  8344. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8345. ReleaseOperand(s0);
  8346. (* ---- RESHAPE ----- *)
  8347. |Global.Reshape:
  8348. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8349. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8350. left.SetType(procedure.type);
  8351. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8352. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8353. END;
  8354. (* ---- SYSTEM.TYPECODE ----- *)
  8355. |Global.systemTypeCode:
  8356. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8357. IF type.resolved IS SyntaxTree.PointerType THEN
  8358. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8359. END;
  8360. result.op := TypeDescriptorAdr(type);
  8361. IF ~newObjectFile THEN
  8362. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8363. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8364. END;
  8365. result.mode := ModeValue;
  8366. (* ---- SYSTEM.TRACE ----- *)
  8367. |Global.systemTrace:
  8368. SystemTrace(x.parameters, x.position);
  8369. (* ----- CONNECT ------*)
  8370. |Global.Connect:
  8371. IF backend.cellsAreObjects THEN
  8372. PushPort(p0);
  8373. PushPort(p1);
  8374. IF p2 # NIL THEN
  8375. Evaluate(p2, s2);
  8376. Emit(Push(p2.position, s2.op));
  8377. ReleaseOperand(s2);
  8378. ELSE
  8379. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8380. END;
  8381. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8382. ELSE
  8383. Warning(x.position, "cannot run on final hardware");
  8384. END;
  8385. (* ----- DELEGATE ------*)
  8386. |Global.Delegate:
  8387. IF backend.cellsAreObjects THEN
  8388. PushPort(p0);
  8389. PushPort(p1);
  8390. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8391. ELSE
  8392. Warning(x.position, "cannot run on final hardware");
  8393. END;
  8394. (* ----- SEND ------*)
  8395. |Global.Send:
  8396. Evaluate(p0,s0);
  8397. Evaluate(p1,s1);
  8398. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8399. Emit(Push(position,s0.op));
  8400. Emit(Push(position,s1.op));
  8401. (*
  8402. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8403. *)
  8404. IF ~backend.cellsAreObjects THEN
  8405. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8406. END;
  8407. ReleaseOperand(s0);
  8408. ReleaseOperand(s1);
  8409. IF backend.cellsAreObjects THEN
  8410. CallThis(position,"ActiveCellsRuntime","Send",2);
  8411. ELSE
  8412. CallThis(position,ChannelModuleName,"Send",2);
  8413. END;
  8414. (* ----- RECEIVE ------*)
  8415. |Global.Receive:
  8416. Evaluate(p0,s0);
  8417. Emit(Push(position,s0.op));
  8418. Designate(p1,s1);
  8419. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8420. Emit(Push(position,s1.op));
  8421. IF p2 # NIL THEN
  8422. Designate(p2,s2);
  8423. Emit(Push(position,s2.op));
  8424. END;
  8425. (*
  8426. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8427. *)
  8428. IF ~backend.cellsAreObjects THEN
  8429. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8430. END;
  8431. ReleaseOperand(s0);
  8432. ReleaseOperand(s1);
  8433. ReleaseOperand(s2);
  8434. IF backend.cellsAreObjects THEN
  8435. IF p2 = NIL THEN
  8436. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8437. ELSE
  8438. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8439. END;
  8440. ELSE
  8441. IF p2 = NIL THEN
  8442. CallThis(position,ChannelModuleName,"Receive",2)
  8443. ELSE
  8444. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8445. END;
  8446. END;
  8447. | Global.systemSpecial:
  8448. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8449. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8450. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8451. (* determine if parameters are of the VAR kind *)
  8452. ASSERT(x.parameters.Length() <= 3);
  8453. formalParameter := procedureType.firstParameter;
  8454. FOR i := 0 TO x.parameters.Length() - 1 DO
  8455. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8456. formalParameter := formalParameter.nextParameter
  8457. END;
  8458. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8459. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8460. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8461. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8462. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8463. IF procedureType.returnType # NIL THEN
  8464. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8465. Emit(Result(position, res));
  8466. (*InitOperand(result,ModeValue);
  8467. result.op := res;
  8468. *)
  8469. IF ~conditional THEN
  8470. InitOperand(result,ModeValue); result.op := res;
  8471. ELSE
  8472. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8473. BrL(falseLabel);
  8474. ReleaseIntermediateOperand(res);
  8475. END;
  8476. END
  8477. ELSE (* function not yet implemented *)
  8478. Error(position,"not yet implemented");
  8479. END;
  8480. destination := dest;
  8481. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8482. END VisitBuiltinCallDesignator;
  8483. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8484. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8485. BEGIN
  8486. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8487. dest := destination; destination := emptyOperand;
  8488. Expression(x.left);
  8489. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8490. ELSIF isUnchecked THEN (* no check *)
  8491. ELSE
  8492. trueL := NewLabel();
  8493. falseL := NewLabel();
  8494. IF IsPointerToRecord(x.left.type,recordType) THEN
  8495. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8496. Emit(Mov(position,tag, result.op));
  8497. IF result.mode # ModeValue THEN
  8498. ptr := tag;
  8499. IntermediateCode.MakeMemory(ptr,addressType);
  8500. Emit(Mov(position,tag, ptr));
  8501. END;
  8502. IF ~backend.cooperative THEN
  8503. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8504. END;
  8505. IntermediateCode.MakeMemory(tag,addressType);
  8506. ELSE
  8507. tag := result.tag;
  8508. UseIntermediateOperand(tag);
  8509. END;
  8510. TypeTest(tag,x.type,trueL,falseL);
  8511. ReleaseIntermediateOperand(tag);
  8512. SetLabel(falseL);
  8513. EmitTrap(position,TypeCheckTrap);
  8514. SetLabel(trueL);
  8515. END;
  8516. destination := dest;
  8517. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8518. END VisitTypeGuardDesignator;
  8519. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8520. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8521. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8522. VAR label: Label; pc: LONGINT;
  8523. BEGIN
  8524. IF backend.cooperative & ~isUnchecked THEN
  8525. pc := section.pc;
  8526. label := NewLabel();
  8527. BrneL(label, operand.op, nil);
  8528. EmitTrap(position, NilPointerTrap);
  8529. SetLabel(label);
  8530. INC(statCoopNilCheck, section.pc - pc);
  8531. END;
  8532. END NilCheck;
  8533. BEGIN
  8534. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8535. ReuseCopy(dereferenced,operand.op);
  8536. ReleaseOperand(operand);
  8537. operand.mode := ModeReference;
  8538. operand.op := dereferenced;
  8539. operand.tag := dereferenced;
  8540. UseIntermediateOperand(operand.tag);
  8541. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8542. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8543. ReleaseIntermediateOperand(operand.tag);
  8544. operand.tag := TypeDescriptorAdr(type);
  8545. IF ~newObjectFile THEN
  8546. IntermediateCode.MakeMemory(operand.tag,addressType);
  8547. END;
  8548. ELSE
  8549. IF ~backend.cooperative THEN
  8550. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8551. END;
  8552. IntermediateCode.MakeMemory(operand.tag,addressType);
  8553. END;
  8554. NilCheck(operand.op);
  8555. ELSIF type IS SyntaxTree.ArrayType THEN
  8556. IF isUnsafe THEN
  8557. NilCheck(operand.op);
  8558. ReleaseIntermediateOperand(operand.tag);
  8559. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8560. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8561. ELSE
  8562. operand.tag := emptyOperand;
  8563. END;
  8564. ELSE
  8565. NilCheck(operand.op);
  8566. IF backend.cooperative THEN
  8567. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8568. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8569. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8570. ELSE
  8571. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8572. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8573. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8574. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8575. END;
  8576. END;
  8577. ELSIF type IS SyntaxTree.MathArrayType THEN
  8578. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8579. IntermediateCode.MakeMemory(operand.op,addressType);
  8580. ELSE HALT(100);
  8581. END;
  8582. END Dereference;
  8583. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8584. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8585. BEGIN
  8586. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8587. dest := destination; destination := emptyOperand;
  8588. Evaluate(x.left,d);
  8589. type := x.type.resolved;
  8590. prevIsUnchecked := isUnchecked;
  8591. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8592. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8593. END;
  8594. Dereference(d,type,IsUnsafePointer(x.left.type));
  8595. isUnchecked := prevIsUnchecked;
  8596. result := d;
  8597. 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
  8598. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8599. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8600. END;
  8601. END;
  8602. destination := dest;
  8603. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8604. END VisitDereferenceDesignator;
  8605. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8606. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8607. BEGIN
  8608. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8609. dest := destination; destination := emptyOperand;
  8610. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8611. tag := result.op;
  8612. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8613. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8614. StaticCallOperand(result,procedure.super);
  8615. ReleaseIntermediateOperand(result.tag);
  8616. UseIntermediateOperand(tag); (* necessary ? *)
  8617. result.tag := tag;
  8618. destination := dest;
  8619. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8620. END VisitSupercallDesignator;
  8621. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8622. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8623. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8624. name: Basic.SegmentedName;
  8625. procedure: SyntaxTree.Procedure;
  8626. procedureType: SyntaxTree.ProcedureType;
  8627. BEGIN
  8628. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8629. dest := destination; destination := emptyOperand;
  8630. scope := currentScope;
  8631. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8632. scope := scope.outerScope;
  8633. END;
  8634. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8635. IF newObjectFile THEN
  8636. moduleSection := meta.ModuleSection();
  8637. IF backend.cooperative THEN
  8638. moduleOffset := 0;
  8639. ELSE
  8640. moduleOffset := moduleSection.pc;
  8641. END;
  8642. result.mode := ModeValue;
  8643. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8644. ELSE
  8645. Symbol(moduleSelf,result);
  8646. IntermediateCode.MakeMemory(result.op,addressType);
  8647. END
  8648. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8649. result.mode := ModeValue;
  8650. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8651. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8652. ELSE
  8653. GetBaseRegister(basereg,currentScope,scope);
  8654. InitOperand(result,ModeReference);
  8655. result.op := basereg;
  8656. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8657. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8658. parametersSize := ProcParametersSize(procedure);
  8659. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8660. IF backend.cooperative THEN
  8661. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8662. END;
  8663. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8664. MakeMemory(result.op, result.op, addressType, 0);
  8665. END;
  8666. (* tag must be loaded when dereferencing SELF pointer *)
  8667. END;
  8668. destination := dest;
  8669. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8670. END VisitSelfDesignator;
  8671. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8672. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8673. BEGIN
  8674. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8675. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8676. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8677. parameter := procedureType.returnParameter;
  8678. IF currentIsInline THEN
  8679. map := currentMapper.Get(NIL);
  8680. IF map # NIL THEN
  8681. Designate(map.to, result);
  8682. ELSE
  8683. HALT(200);
  8684. END;
  8685. RETURN;
  8686. END;
  8687. VisitParameter(parameter);
  8688. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8689. END VisitResultDesignator;
  8690. (** values *)
  8691. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8692. BEGIN
  8693. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8694. IF conditional THEN
  8695. IF x.value THEN BrL(trueLabel)
  8696. ELSE BrL(falseLabel)
  8697. END;
  8698. ELSE
  8699. InitOperand(result,ModeValue);
  8700. IF x.value THEN result.op := true ELSE result.op := false END;
  8701. END;
  8702. END VisitBooleanValue;
  8703. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8704. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8705. BEGIN
  8706. Global.GetModuleSegmentedName(module.module, name);
  8707. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8708. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8709. RETURN section
  8710. END GetDataSection;
  8711. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8712. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8713. BEGIN
  8714. type := vop.type;
  8715. data := GetDataSection();
  8716. pc := EnterImmediate(data,vop);
  8717. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8718. IntermediateCode.MakeMemory(vop, type);
  8719. END GetImmediateMem;
  8720. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8721. BEGIN
  8722. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8723. InitOperand(result,ModeValue);
  8724. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8725. IF ~supportedImmediate(result.op) &~inData THEN
  8726. GetImmediateMem(result.op)
  8727. END;
  8728. END VisitIntegerValue;
  8729. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8730. BEGIN
  8731. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8732. InitOperand(result,ModeValue);
  8733. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8734. END VisitCharacterValue;
  8735. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8736. BEGIN
  8737. IF Trace THEN TraceEnter("VisitSetValue") END;
  8738. InitOperand(result,ModeValue);
  8739. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8740. END VisitSetValue;
  8741. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8742. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8743. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8744. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8745. BEGIN
  8746. numberElements := x.elements.Length();
  8747. FOR i := 0 TO numberElements-1 DO
  8748. expression := x.elements.GetExpression(i);
  8749. IF expression IS SyntaxTree.MathArrayExpression THEN
  8750. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8751. ELSE
  8752. inData := TRUE;
  8753. Evaluate(expression,op);
  8754. irv.Emit(Data(position,op.op));
  8755. inData := FALSE;
  8756. ReleaseOperand(op);
  8757. END;
  8758. END;
  8759. END RecursiveData;
  8760. BEGIN
  8761. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8762. IF ~TryConstantDeclaration() THEN
  8763. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8764. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8765. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8766. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8767. ELSE
  8768. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8769. END;
  8770. RecursiveData(x.array);
  8771. InitOperand(result,ModeReference);
  8772. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8773. END
  8774. END VisitMathArrayValue;
  8775. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8776. VAR constant: Sections.Section;
  8777. BEGIN
  8778. IF constantDeclaration = NIL THEN
  8779. RETURN FALSE
  8780. ELSE
  8781. (* Is a constant in this module: did we generate it already? *)
  8782. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8783. IF constant # NIL THEN
  8784. InitOperand(result,ModeReference);
  8785. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8786. RETURN TRUE;
  8787. END;
  8788. END;
  8789. RETURN FALSE
  8790. END TryConstantDeclaration;
  8791. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8792. BEGIN
  8793. constantDeclaration := x;
  8794. x.value.resolved.Accept(SELF);
  8795. END VisitConstant;
  8796. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8797. BEGIN
  8798. IF Trace THEN TraceEnter("VisitRealValue") END;
  8799. InitOperand(result,ModeValue);
  8800. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8801. END VisitRealValue;
  8802. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8803. VAR
  8804. componentType: SyntaxTree.Type;
  8805. BEGIN
  8806. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8807. ASSERT(x.type IS SyntaxTree.ComplexType);
  8808. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8809. InitOperand(result,ModeValue);
  8810. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8811. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8812. END VisitComplexValue;
  8813. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8814. VAR i: LONGINT; name: Basic.SegmentedName;
  8815. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8816. BEGIN
  8817. IF Trace THEN TraceEnter("VisitStringValue") END;
  8818. IF ~TryConstantDeclaration() THEN
  8819. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8820. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8821. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8822. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8823. ELSE
  8824. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8825. END;
  8826. FOR i := 0 TO x.length-1 DO
  8827. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8828. irv.Emit(Data(position,op));
  8829. END;
  8830. InitOperand(result,ModeReference);
  8831. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8832. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8833. END
  8834. END VisitStringValue;
  8835. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8836. BEGIN
  8837. IF Trace THEN TraceEnter("VisitNilValue") END;
  8838. InitOperand(result,ModeValue);
  8839. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8840. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8841. END VisitNilValue;
  8842. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8843. BEGIN
  8844. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8845. InitOperand(result,ModeValue);
  8846. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8847. END VisitEnumerationValue;
  8848. (** symbols *)
  8849. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8850. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8851. END VisitImport;
  8852. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8853. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8854. BEGIN
  8855. IF scope # baseScope THEN
  8856. (* left := [fp+8] *)
  8857. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8858. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8859. ReuseCopy(left,right);
  8860. ReleaseIntermediateOperand(right);
  8861. scope := scope.outerScope; DEC(level);
  8862. (* { left := [left+8] } *)
  8863. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8864. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8865. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8866. Emit(Mov(position,left,right));
  8867. scope := scope.outerScope; DEC(level);
  8868. END;
  8869. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8870. result := left;
  8871. ELSE
  8872. result := fp;
  8873. END;
  8874. END GetBaseRegister;
  8875. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8876. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8877. BEGIN
  8878. IF Trace THEN TraceEnter("VisitVariable"); END;
  8879. type := x.type.resolved;
  8880. IF (x.useRegister) THEN
  8881. InitOperand(result, ModeValue);
  8882. IF x.registerNumber < 0 THEN
  8883. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8884. reg := x.registerNumber;
  8885. ELSE
  8886. reg := registerUsageCount.Map(x.registerNumber);
  8887. UseRegister(reg);
  8888. END;
  8889. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8890. ELSIF x.externalName # NIL THEN
  8891. InitOperand(result,ModeReference);
  8892. Basic.ToSegmentedName(x.externalName^, name);
  8893. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8894. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8895. InitOperand(result,ModeReference);
  8896. GetBaseRegister(result.op,currentScope,x.scope);
  8897. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8898. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8899. InitOperand(result,ModeReference);
  8900. GetCodeSectionNameForSymbol(x,name);
  8901. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8902. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8903. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8904. InitOperand(result,ModeReference);
  8905. GetCodeSectionNameForSymbol(x,name);
  8906. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8907. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8908. ELSE (* field, left designator must have been emitted *)
  8909. ASSERT(result.mode = ModeReference);
  8910. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8911. ReuseCopy(temp,result.op);
  8912. ReleaseIntermediateOperand(result.op);
  8913. result.op := temp;
  8914. END;
  8915. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8916. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8917. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8918. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8919. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8920. END;
  8921. END;
  8922. END;
  8923. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8924. ValueToCondition(result);
  8925. ELSIF type IS SyntaxTree.ProcedureType THEN
  8926. ReleaseIntermediateOperand(result.tag);
  8927. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8928. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8929. UseIntermediateOperand(result.tag);
  8930. ELSE
  8931. result.tag := nil; (* nil *)
  8932. END;
  8933. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8934. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8935. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8936. ReleaseIntermediateOperand(result.tag);
  8937. Global.GetSymbolSegmentedName(x,name);
  8938. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8939. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8940. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8941. ELSE
  8942. END;
  8943. ELSE
  8944. ReleaseIntermediateOperand(result.tag);
  8945. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8946. END;
  8947. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8948. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8949. ReleaseIntermediateOperand(result.tag);
  8950. result.tag := result.op;
  8951. UseIntermediateOperand(result.tag);
  8952. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8953. IntermediateCode.MakeMemory(result.op,addressType);
  8954. END;
  8955. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8956. ReleaseIntermediateOperand(result.tag);
  8957. result.tag := TypeDescriptorAdr(type);
  8958. IF ~newObjectFile THEN
  8959. IntermediateCode.MakeMemory(result.tag,addressType);
  8960. END;
  8961. UseIntermediateOperand(result.tag);
  8962. (* tag for pointer type computed not here but during dereferencing *)
  8963. END;
  8964. IF Trace THEN TraceExit("VisitVariable") END;
  8965. END VisitVariable;
  8966. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8967. BEGIN
  8968. VisitVariable(property);
  8969. END VisitProperty;
  8970. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8971. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8972. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8973. BEGIN
  8974. type := x.type.resolved;
  8975. IF Trace THEN TraceEnter("VisitParameter") END;
  8976. IF x.ownerType IS SyntaxTree.CellType THEN
  8977. ptype := x.type.resolved;
  8978. IF backend.cellsAreObjects THEN
  8979. ASSERT(result.mode = ModeReference);
  8980. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8981. ReuseCopy(temp,result.op);
  8982. ReleaseIntermediateOperand(result.op);
  8983. result.op := temp;
  8984. END;
  8985. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8986. RETURN;
  8987. ELSE
  8988. InitOperand(result,ModeReference);
  8989. GetCodeSectionNameForSymbol(x,name);
  8990. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8991. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8992. RETURN;
  8993. END;
  8994. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8995. InitOperand(result,ModeReference);
  8996. GetCodeSectionNameForSymbol(x,name);
  8997. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8998. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8999. RETURN
  9000. ELSE
  9001. GetBaseRegister(basereg,currentScope,x.scope);
  9002. InitOperand(result,ModeReference);
  9003. result.op := basereg;
  9004. END;
  9005. IF IsOpenArray(type) THEN
  9006. result.tag := basereg;
  9007. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9008. IntermediateCode.MakeMemory(result.op,addressType);
  9009. IF Global.IsOberonProcedure(x.ownerType) THEN
  9010. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  9011. UseIntermediateOperand(result.tag);
  9012. ELSE
  9013. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  9014. END;
  9015. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  9016. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9017. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9018. ELSIF IsStaticArray(type) THEN
  9019. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9020. IntermediateCode.MakeMemory(result.op,addressType);
  9021. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9022. ELSIF type IS SyntaxTree.MathArrayType THEN
  9023. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9024. WITH type: SyntaxTree.MathArrayType DO
  9025. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9026. IF type.form = SyntaxTree.Tensor THEN
  9027. ELSIF type.form = SyntaxTree.Open THEN
  9028. result.tag := result.op;
  9029. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9030. IntermediateCode.MakeMemory(result.op,addressType);
  9031. UseIntermediateOperand(result.tag);
  9032. ELSIF type.form = SyntaxTree.Static THEN
  9033. IF x.kind = SyntaxTree.ConstParameter THEN
  9034. IntermediateCode.MakeMemory(result.op,addressType);
  9035. END;
  9036. ELSE HALT(100)
  9037. END;
  9038. ELSIF x.kind = SyntaxTree.VarParameter THEN
  9039. IF type.form = SyntaxTree.Tensor THEN
  9040. ToMemory(result.op,addressType,0);
  9041. ELSIF type.form = SyntaxTree.Open THEN
  9042. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9043. ReuseCopy(result.tag, mem);
  9044. ReleaseIntermediateOperand(mem);
  9045. ReleaseIntermediateOperand(result.op);
  9046. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9047. ELSIF type.form = SyntaxTree.Static THEN
  9048. IntermediateCode.MakeMemory(result.op,addressType);
  9049. ELSE HALT(100)
  9050. END;
  9051. ELSE HALT(100)
  9052. END;
  9053. END;
  9054. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9055. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9056. IntermediateCode.MakeMemory(result.op,addressType);
  9057. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9058. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9059. END;
  9060. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  9061. ValueToCondition(result);
  9062. ELSIF type IS SyntaxTree.ProcedureType THEN
  9063. ReleaseIntermediateOperand(result.tag);
  9064. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9065. IF x.kind = SyntaxTree.VarParameter THEN
  9066. ReuseCopy(result.tag,result.op);
  9067. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9068. IntermediateCode.MakeMemory(result.tag,addressType);
  9069. ELSE
  9070. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9071. UseIntermediateOperand(result.tag);
  9072. END;
  9073. ELSE
  9074. result.tag := nil;
  9075. END;
  9076. (* tag for pointer type computed not here but during dereferencing *)
  9077. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  9078. ReleaseIntermediateOperand(result.tag);
  9079. result.tag := basereg;
  9080. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9081. IntermediateCode.MakeMemory(result.tag,addressType);
  9082. UseIntermediateOperand(result.tag);
  9083. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9084. ReleaseIntermediateOperand(result.tag);
  9085. result.tag := TypeDescriptorAdr(type);
  9086. IF ~newObjectFile THEN
  9087. IntermediateCode.MakeMemory(result.tag,addressType);
  9088. END;
  9089. UseIntermediateOperand(result.tag);
  9090. END;
  9091. IF Trace THEN TraceExit("VisitParameter") END;
  9092. END VisitParameter;
  9093. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9094. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9095. BEGIN
  9096. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9097. (* left.p: left already emitted *)
  9098. tag := result.op; (* value of pointer to left *)
  9099. (* get type desc *)
  9100. tmp := result.tag;
  9101. IntermediateCode.MakeMemory(tmp,addressType);
  9102. (* get method adr *)
  9103. Reuse1(reg,tmp);
  9104. ReleaseIntermediateOperand(tmp);
  9105. IF backend.cooperative THEN
  9106. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9107. WHILE recordType.baseType # NIL DO
  9108. recordType := recordType.GetBaseRecord ();
  9109. END;
  9110. GetRecordTypeName (recordType,name);
  9111. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9112. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9113. offset := 0;
  9114. ELSE
  9115. offset := 2;
  9116. END;
  9117. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9118. ELSIF meta.simple THEN
  9119. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9120. ELSE
  9121. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9122. END;
  9123. InitOperand(operand,ModeReference);
  9124. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9125. operand.op := reg;
  9126. operand.tag := tag;
  9127. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9128. END DynamicCallOperand;
  9129. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9130. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9131. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9132. BEGIN
  9133. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9134. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9135. tag := operand.op;
  9136. ReleaseIntermediateOperand(operand.tag);
  9137. ELSE tag := nil
  9138. END;
  9139. IF x.isInline THEN
  9140. sectionType := Sections.InlineCodeSection;
  9141. ELSE
  9142. sectionType := Sections.CodeSection;
  9143. END;
  9144. IF x.externalName # NIL THEN
  9145. Basic.ToSegmentedName(x.externalName^, name);
  9146. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9147. ELSE
  9148. GetCodeSectionNameForSymbol(x, name);
  9149. IF (x.scope.ownerModule = module.module) THEN
  9150. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9151. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9152. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9153. IF source.pc = 0 THEN (* no code yet *)
  9154. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9155. END;
  9156. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9157. bits := x.procedureScope.body.code.inlineCode;
  9158. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9159. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9160. binary.CopyBits(bits, 0, bits.GetSize());
  9161. source.SetResolved(binary);
  9162. ELSE
  9163. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9164. END;
  9165. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9166. END;
  9167. InitOperand(operand,ModeValue);
  9168. operand.op := reg;
  9169. operand.tag := tag;
  9170. IF Trace THEN TraceExit("StaticCallOperand") END;
  9171. END StaticCallOperand;
  9172. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9173. (* handle expressions of the form designator.procedure or procedure *)
  9174. BEGIN
  9175. IF Trace THEN TraceEnter("VisitProcedure") END;
  9176. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9177. DynamicCallOperand(result,x);
  9178. ELSIF x.isInline THEN
  9179. StaticCallOperand(result,x);
  9180. ELSE
  9181. StaticCallOperand(result,x);
  9182. END;
  9183. IF Trace THEN TraceExit("VisitProcedure") END;
  9184. END VisitProcedure;
  9185. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9186. BEGIN
  9187. VisitProcedure(x);
  9188. END VisitOperator;
  9189. (** statements *)
  9190. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9191. BEGIN
  9192. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9193. Expression(x.call);
  9194. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9195. ReleaseOperand(result)
  9196. END;
  9197. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9198. END VisitProcedureCallStatement;
  9199. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9200. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9201. leftBase, rightBase: SyntaxTree.Type;
  9202. procedureName,s: SyntaxTree.IdentifierString;
  9203. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9204. size: LONGINT; rightKind: LONGINT;
  9205. dummy: IntermediateCode.Operand;
  9206. CONST moduleName = "FoxArrayBase";
  9207. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9208. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9209. BEGIN
  9210. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9211. IF base IS SyntaxTree.MathArrayType THEN
  9212. base := OpenArray(base(SyntaxTree.MathArrayType));
  9213. END;
  9214. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9215. result.SetArrayBase(base);
  9216. RETURN result
  9217. END OpenArray;
  9218. BEGIN
  9219. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9220. SaveRegisters();ReleaseUsedRegisters(saved);
  9221. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9222. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9223. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9224. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9225. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9226. IF leftType.form = SyntaxTree.Tensor THEN
  9227. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9228. ELSIF leftType.form = SyntaxTree.Open THEN
  9229. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9230. ELSIF leftType.form = SyntaxTree.Static THEN
  9231. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9232. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9233. END;
  9234. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9235. IF procedure = NIL THEN
  9236. s := "Instruction not supported on target, emulation procedure ";
  9237. Strings.Append(s,moduleName);
  9238. Strings.Append(s,".");
  9239. Strings.Append(s,procedureName);
  9240. Strings.Append(s," not present");
  9241. Error(position,s);
  9242. ELSE
  9243. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9244. parameter.SetType(leftType);
  9245. parameter.SetAccess(SyntaxTree.Internal);
  9246. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9247. parameter.SetKind(rightKind);
  9248. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9249. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9250. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9251. StaticCallOperand(result,procedure);
  9252. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9253. ReleaseOperand(result);
  9254. END;
  9255. RestoreRegisters(saved);
  9256. END;
  9257. END AssignMathArray;
  9258. VAR modifyAssignmentCounter := 0: LONGINT;
  9259. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9260. VAR processor,mem,dst: IntermediateCode.Operand;
  9261. BEGIN
  9262. IF value.intValue = true.intValue THEN
  9263. INC(modifyAssignmentCounter);
  9264. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9265. modifyAssignmentsPC := section.pc;
  9266. ELSE
  9267. DEC(modifyAssignmentCounter);
  9268. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9269. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9270. END;
  9271. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9272. dst := NewRegisterOperand (addressType);
  9273. Emit(Mov(position,dst, processor));
  9274. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9275. Emit(Mov(position,mem, value));
  9276. ReleaseIntermediateOperand(dst);
  9277. END ModifyAssignments;
  9278. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9279. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9280. BEGIN
  9281. type := left.type.resolved;
  9282. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9283. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9284. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9285. IF procedureType.returnParameter = parameter THEN
  9286. (* this is the only case where the destination can be dynamically smaller than the source
  9287. in all other cases the dynamic size has to be taken
  9288. *)
  9289. IF backend.cooperative THEN
  9290. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9291. ELSE
  9292. MakeMemory(mem, tag, addressType, 0);
  9293. END;
  9294. RETURN mem;
  9295. END;
  9296. END;
  9297. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9298. END CopySize;
  9299. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9300. VAR
  9301. leftO, rightO: Operand;
  9302. arg,mem, sizeOp: IntermediateCode.Operand;
  9303. leftType, rightType, componentType, base: SyntaxTree.Type;
  9304. size: LONGINT;
  9305. parameters: SyntaxTree.ExpressionList;
  9306. procedure: SyntaxTree.Procedure;
  9307. call: SyntaxTree.ProcedureCallDesignator;
  9308. designator: SyntaxTree.Designator;
  9309. saved: RegisterEntry;
  9310. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9311. VAR procedureType: SyntaxTree.ProcedureType;
  9312. BEGIN
  9313. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9314. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9315. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9316. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9317. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9318. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9319. IF right.id = Global.Reshape THEN RETURN TRUE
  9320. END;
  9321. END;
  9322. END;
  9323. END;
  9324. RETURN FALSE
  9325. END CanPassAsResultParameter;
  9326. BEGIN
  9327. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9328. leftType := left.type.resolved; rightType:= right.type.resolved;
  9329. IF backend.cooperative & left.NeedsTrace() THEN
  9330. ModifyAssignments(true);
  9331. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9332. Designate(right, rightO);
  9333. Designate(left, leftO);
  9334. ASSERT(leftO.mode = ModeReference);
  9335. TransferToRegister(leftO.op, leftO.op);
  9336. TransferToRegister(rightO.op, rightO.op);
  9337. Emit(Push(position, leftO.op));
  9338. Emit(Push(position, rightO.op));
  9339. CallAssignMethod(leftO.op, rightO.op, left.type);
  9340. Emit(Pop(position, rightO.op));
  9341. Emit(Pop(position, leftO.op));
  9342. sizeOp := CopySize(left, leftO.tag);
  9343. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9344. ReleaseIntermediateOperand(sizeOp);
  9345. ReleaseOperand(leftO);
  9346. ReleaseOperand(rightO);
  9347. ELSE
  9348. Evaluate(right,rightO);
  9349. Designate(left,leftO);
  9350. ASSERT(leftO.mode = ModeReference);
  9351. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9352. (* copy procedure address first *)
  9353. MakeMemory(mem,leftO.op,addressType,0);
  9354. Emit(Mov(position,mem,rightO.op));
  9355. ReleaseIntermediateOperand(mem);
  9356. (* copy pointer address *)
  9357. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9358. CallAssignPointer(leftO.tag, rightO.tag);
  9359. ELSE
  9360. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9361. CallAssignPointer(leftO.op, rightO.op);
  9362. END;
  9363. ReleaseOperand(leftO);
  9364. ReleaseOperand(rightO);
  9365. END;
  9366. ModifyAssignments(false);
  9367. RETURN;
  9368. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9369. SaveRegisters();ReleaseUsedRegisters(saved);
  9370. IF SemanticChecker.IsPointerType(leftType) THEN
  9371. Evaluate(right,rightO);
  9372. Designate(left,leftO);
  9373. Emit(Push(position,leftO.op));
  9374. ReleaseOperand(leftO);
  9375. Emit(Push(position,rightO.op));
  9376. ReleaseOperand(rightO);
  9377. CallThis(position,"Heaps","Assign",2);
  9378. ELSIF leftType.IsRecordType() THEN
  9379. Designate(right,rightO);
  9380. Designate(left,leftO);
  9381. Emit(Push(position,leftO.op));
  9382. Emit(Push(position,leftO.tag)); (* type desc *)
  9383. ReleaseOperand(leftO);
  9384. Emit(Push(position,rightO.op));
  9385. ReleaseOperand(rightO);
  9386. CallThis(position,"Heaps","AssignRecord",3);
  9387. ELSIF IsStaticArray(leftType) THEN
  9388. size := StaticArrayNumElements(leftType);
  9389. base := StaticArrayBaseType(leftType);
  9390. Designate(right,rightO);
  9391. Designate(left,leftO);
  9392. Emit(Push(position,leftO.op));
  9393. ReleaseOperand(leftO);
  9394. arg := TypeDescriptorAdr(base);
  9395. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9396. Emit(Push(position,arg));
  9397. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9398. Emit(Push(position,rightO.op));
  9399. ReleaseOperand(rightO);
  9400. CallThis(position,"Heaps","AssignArray",4);
  9401. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9402. size := StaticMathArrayNumElements(leftType);
  9403. base := StaticMathArrayBaseType(leftType);
  9404. Designate(right,rightO);
  9405. Designate(left,leftO);
  9406. Emit(Push(position,leftO.op));
  9407. ReleaseOperand(leftO);
  9408. arg := TypeDescriptorAdr(base);
  9409. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9410. Emit(Push(position,arg));
  9411. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9412. Emit(Push(position,rightO.op));
  9413. ReleaseOperand(rightO);
  9414. CallThis(position,"Heaps","AssignArray",4);
  9415. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9416. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9417. Evaluate(right,rightO);
  9418. Designate(left,leftO);
  9419. MakeMemory(mem,leftO.op,addressType,0);
  9420. Emit(Mov(position,mem,rightO.op));
  9421. ReleaseIntermediateOperand(mem);
  9422. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9423. Emit (Push(position, leftO.tag));
  9424. ReleaseOperand(leftO);
  9425. Emit (Push(position, rightO.tag));
  9426. ReleaseOperand(rightO);
  9427. CallThis(position,"Heaps","Assign", 2);
  9428. ELSE HALT(100); (* missing ? *)
  9429. END;
  9430. RestoreRegisters(saved);
  9431. RETURN;
  9432. END;
  9433. IF CanPassAsResultParameter(right) THEN
  9434. procedureResultDesignator := left(SyntaxTree.Designator);
  9435. Expression(right);
  9436. procedureResultDesignator := NIL;
  9437. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9438. (* left <-- ALIAS OF right: zerocopy *)
  9439. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9440. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9441. designator.SetType(procedure.type);
  9442. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9443. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9444. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9445. END;
  9446. ELSIF leftType IS SyntaxTree.RangeType THEN
  9447. (* LHS is of array range type *)
  9448. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9449. Evaluate(right, rightO);
  9450. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9451. (* first *)
  9452. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9453. Emit(Mov(position,mem, rightO.op));
  9454. ReleaseIntermediateOperand(mem);
  9455. (* last *)
  9456. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9457. Emit(Mov(position,mem, rightO.tag));
  9458. ReleaseIntermediateOperand(mem);
  9459. (* step *)
  9460. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9461. Emit(Mov(position,mem, rightO.extra));
  9462. ReleaseIntermediateOperand(mem);
  9463. ReleaseOperand(rightO);
  9464. ReleaseOperand(leftO)
  9465. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9466. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9467. Evaluate(right, rightO);
  9468. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9469. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9470. (* real part *)
  9471. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9472. Emit(Mov(position,mem, rightO.op));
  9473. ReleaseIntermediateOperand(mem);
  9474. (* imaginary part *)
  9475. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9476. Emit(Mov(position,mem, rightO.tag));
  9477. ReleaseIntermediateOperand(mem);
  9478. ReleaseOperand(rightO);
  9479. ReleaseOperand(leftO)
  9480. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9481. OR (leftType IS SyntaxTree.PortType) THEN
  9482. (* rightO := leftO;*)
  9483. Evaluate(right,rightO);
  9484. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9485. Designate(left,leftO);
  9486. IF leftO.mode = ModeReference THEN
  9487. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9488. destination := mem;
  9489. ELSE
  9490. destination := leftO.op;
  9491. END;
  9492. ReleaseOperand(leftO);
  9493. IF destination.mode # IntermediateCode.Undefined THEN
  9494. Emit(Mov(position,destination,rightO.op));
  9495. END;
  9496. ReleaseOperand(rightO);
  9497. ReleaseIntermediateOperand(mem);
  9498. IntermediateCode.InitOperand(destination);
  9499. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9500. Evaluate(right,rightO);
  9501. Designate(left,leftO);
  9502. MakeMemory(mem,leftO.op,addressType,0);
  9503. Emit(Mov(position,mem,rightO.op));
  9504. ReleaseIntermediateOperand(mem);
  9505. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9506. (* delegate *)
  9507. (*
  9508. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9509. *)
  9510. Emit(Mov(position,leftO.tag,rightO.tag));
  9511. END;
  9512. ReleaseOperand(leftO);
  9513. ReleaseOperand(rightO);
  9514. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9515. Designate(right,rightO);
  9516. Designate(left,leftO);
  9517. sizeOp := CopySize(left, leftO.tag);
  9518. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9519. ReleaseIntermediateOperand(sizeOp);
  9520. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9521. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9522. IF (rightType IS SyntaxTree.StringType) THEN
  9523. CopyString(left,right);
  9524. 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
  9525. Designate(right,rightO);
  9526. Designate(left,leftO);
  9527. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9528. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9529. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9530. ELSE
  9531. HALT(201)
  9532. END;
  9533. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9534. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9535. Designate(right,rightO);
  9536. Designate(left,leftO);
  9537. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9538. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9539. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9540. ELSE
  9541. AssignMathArray(left,right);
  9542. END;
  9543. ELSE
  9544. HALT(200);
  9545. END;
  9546. END Assign;
  9547. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9548. BEGIN
  9549. IF Trace THEN TraceEnter("VisitAssignment") END;
  9550. Assign(x.left,x.right);
  9551. IF Trace THEN TraceExit("VisitAssignment") END;
  9552. END VisitAssignment;
  9553. PROCEDURE EmitCooperativeSwitch;
  9554. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9555. BEGIN
  9556. ASSERT (cooperativeSwitches);
  9557. pc := section.pc;
  9558. IF lastSwitchPC = section.pc THEN RETURN END;
  9559. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9560. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9561. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9562. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9563. INC(statCoopSwitch, section.pc - pc);
  9564. END EmitCooperativeSwitch;
  9565. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9566. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9567. BEGIN
  9568. p0 := communication.left; p1 := communication.right;
  9569. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9570. Evaluate(p0,s0);
  9571. Evaluate(p1,s1);
  9572. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9573. Emit(Push(position,s0.op));
  9574. Emit(Push(position,s1.op));
  9575. (*
  9576. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9577. *)
  9578. IF ~backend.cellsAreObjects THEN
  9579. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9580. END;
  9581. ReleaseOperand(s0);
  9582. ReleaseOperand(s1);
  9583. IF backend.cellsAreObjects THEN
  9584. CallThis(position,"ActiveCellsRuntime","Send",2);
  9585. ELSE
  9586. CallThis(position,ChannelModuleName,"Send",2);
  9587. END;
  9588. (* ----- RECEIVE ------*)
  9589. ELSE
  9590. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9591. tmp := p0; p0 := p1; p1 := tmp;
  9592. END;
  9593. Evaluate(p0,s0);
  9594. Emit(Push(position,s0.op));
  9595. Designate(p1,s1);
  9596. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9597. Emit(Push(position,s1.op));
  9598. (*
  9599. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9600. *)
  9601. IF ~backend.cellsAreObjects THEN
  9602. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9603. END;
  9604. ReleaseOperand(s0);
  9605. ReleaseOperand(s1);
  9606. IF backend.cellsAreObjects THEN
  9607. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9608. ELSE
  9609. CallThis(position,ChannelModuleName,"Receive",2)
  9610. END;
  9611. END;
  9612. END VisitCommunicationStatement;
  9613. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9614. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9615. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9616. VAR true, false: Label; condition, value: BOOLEAN;
  9617. BEGIN
  9618. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9619. IF condition THEN
  9620. true := NewLabel();
  9621. false := NewLabel();
  9622. Condition(if.condition,true,false);
  9623. SetLabel(true);
  9624. StatementSequence(if.statements);
  9625. BrL(end);
  9626. SetLabel(false);
  9627. ELSE
  9628. IF value THEN (* always true *)
  9629. escape := TRUE;
  9630. StatementSequence(if.statements);
  9631. (* no branch necessary -- rest skipped *)
  9632. END;
  9633. END;
  9634. END IfPart;
  9635. BEGIN
  9636. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9637. end := NewLabel();
  9638. elsifs := x.ElsifParts();
  9639. IfPart(x.ifPart);
  9640. FOR i := 0 TO elsifs-1 DO
  9641. IF ~escape THEN
  9642. elsif := x.GetElsifPart(i);
  9643. IfPart(elsif);
  9644. END;
  9645. END;
  9646. IF (x.elsePart # NIL) & ~escape THEN
  9647. StatementSequence(x.elsePart);
  9648. END;
  9649. SetLabel(end);
  9650. IF Trace THEN TraceExit("VisitIfStatement") END;
  9651. END VisitIfStatement;
  9652. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9653. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9654. BEGIN
  9655. (*IF x.variable.type.resolved = x.type.resolved THEN
  9656. (* always true, do nothing *)
  9657. ELSE*)
  9658. Designate(x.variable,res);
  9659. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9660. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9661. END;
  9662. trueL := NewLabel();
  9663. TypeTest(res.tag,x.type,trueL,falseL);
  9664. ReleaseOperand(res);
  9665. SetLabel(trueL);
  9666. StatementSequence(x.statements);
  9667. BrL(endL);
  9668. END WithPart;
  9669. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9670. VAR endL,falseL: Label;i: LONGINT;
  9671. BEGIN
  9672. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9673. endL := NewLabel();
  9674. FOR i := 0 TO x.WithParts()-1 DO
  9675. falseL := NewLabel();
  9676. WithPart(x.GetWithPart(i),falseL,endL);
  9677. SetLabel(falseL);
  9678. END;
  9679. IF x.elsePart = NIL THEN
  9680. IF ~isUnchecked THEN
  9681. EmitTrap(position,WithTrap);
  9682. END;
  9683. ELSE
  9684. StatementSequence(x.elsePart)
  9685. END;
  9686. SetLabel(endL);
  9687. IF Trace THEN TraceExit("VisitWithStatement") END;
  9688. END VisitWithStatement;
  9689. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9690. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9691. out,else: Label; label: Label;
  9692. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9693. symbol: SyntaxTree.Symbol;
  9694. BEGIN
  9695. (*! split case statement into if-elsif statements for large case label lists *)
  9696. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9697. range := x.max-x.min+1;
  9698. IF (range<0) OR (range > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9699. END;
  9700. size := LONGINT(range);
  9701. Evaluate(x.variable,var);
  9702. ReuseCopy(tmp,var.op);
  9703. ReleaseIntermediateOperand(var.op);
  9704. var.op := tmp;
  9705. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9706. Convert(var.op,addressType);
  9707. else := NewLabel();
  9708. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9709. (*
  9710. UniqueId(name,module.module,"case",caseId);
  9711. *)
  9712. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9713. Global.GetModuleSegmentedName(module.module, name);
  9714. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9715. symbol := SyntaxTree.NewSymbol(name[1]);
  9716. symbol.SetScope(moduleScope);
  9717. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9718. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9719. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9720. ReuseCopy(res,var.op);
  9721. ReleaseOperand(var);
  9722. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9723. Emit(Add(position,res,res,jmp));
  9724. IntermediateCode.MakeMemory(res,addressType);
  9725. Emit(Br(position,res));
  9726. ReleaseIntermediateOperand(res);
  9727. out := NewLabel();
  9728. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9729. part := x.GetCasePart(i);
  9730. constant := part.firstConstant;
  9731. label := NewLabel();
  9732. SetLabel(label);
  9733. WHILE(constant # NIL) DO (* case labels for this case part *)
  9734. FOR j := constant.min TO constant.max DO
  9735. fixups[j-x.min] := label;
  9736. END;
  9737. constant := constant.next;
  9738. END;
  9739. StatementSequence(part.statements);
  9740. BrL(out);
  9741. END;
  9742. SetLabel(else);
  9743. FOR i := 0 TO size-1 DO
  9744. IF fixups[i] = NIL THEN
  9745. fixups[i] := else;
  9746. END;
  9747. END;
  9748. IF x.elsePart # NIL THEN
  9749. StatementSequence(x.elsePart);
  9750. ELSIF ~isUnchecked THEN
  9751. EmitTrap(position,CaseTrap);
  9752. END;
  9753. SetLabel(out);
  9754. FOR i := 0 TO size-1 DO
  9755. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9756. section.Emit(Data(position,op));
  9757. END;
  9758. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9759. END VisitCaseStatement;
  9760. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9761. VAR start: Label; true,false: Label;
  9762. BEGIN
  9763. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9764. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9765. start := NewLabel();
  9766. true := NewLabel();
  9767. false := NewLabel();
  9768. SetLabel(start);
  9769. Condition(x.condition,true,false);
  9770. SetLabel(true);
  9771. StatementSequence(x.statements);
  9772. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9773. BrL(start);
  9774. SetLabel(false);
  9775. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9776. END VisitWhileStatement;
  9777. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9778. VAR false,true: Label;
  9779. BEGIN
  9780. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9781. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9782. true := NewLabel();
  9783. false := NewLabel();
  9784. SetLabel(false);
  9785. StatementSequence(x.statements);
  9786. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9787. Condition(x.condition,true,false);
  9788. SetLabel(true);
  9789. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9790. END VisitRepeatStatement;
  9791. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9792. VAR
  9793. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9794. temporaryVariable: SyntaxTree.Variable;
  9795. temporaryVariableDesignator : SyntaxTree.Designator;
  9796. BEGIN
  9797. IF Trace THEN TraceEnter("VisitForStatement") END;
  9798. true := NewLabel();
  9799. false := NewLabel();
  9800. start := NewLabel();
  9801. Assign(x.variable,x.from);
  9802. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9803. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9804. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9805. Assign(temporaryVariableDesignator,x.to);
  9806. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9807. IF by > 0 THEN
  9808. cmp := Scanner.LessEqual
  9809. ELSE
  9810. cmp := Scanner.GreaterEqual
  9811. END;
  9812. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9813. binary.SetType(system.booleanType);
  9814. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9815. SetLabel(start);
  9816. Condition(binary,true,false);
  9817. SetLabel(true);
  9818. StatementSequence(x.statements);
  9819. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9820. binary.SetType(x.variable.type);
  9821. Assign(x.variable,binary);
  9822. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9823. BrL(start);
  9824. SetLabel(false);
  9825. IF Trace THEN TraceExit("VisitForStatement") END;
  9826. END VisitForStatement;
  9827. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9828. VAR prevLoop: Label;
  9829. BEGIN
  9830. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9831. prevLoop := currentLoop;
  9832. currentLoop := NewLabel();
  9833. StatementSequence(x.statements);
  9834. SetLabel(currentLoop);
  9835. currentLoop := prevLoop;
  9836. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9837. END VisitExitableBlock;
  9838. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9839. VAR prevLoop,start: Label;
  9840. BEGIN
  9841. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9842. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9843. start := NewLabel();
  9844. prevLoop := currentLoop;
  9845. SetLabel(start);
  9846. currentLoop := NewLabel();
  9847. StatementSequence(x.statements);
  9848. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9849. BrL(start);
  9850. SetLabel(currentLoop);
  9851. currentLoop := prevLoop;
  9852. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9853. END VisitLoopStatement;
  9854. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9855. VAR outer: SyntaxTree.Statement;
  9856. BEGIN
  9857. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9858. IF locked THEN (* r if we jump out of an exclusive block *)
  9859. outer := x.outer;
  9860. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9861. outer := outer.outer;
  9862. END;
  9863. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9864. Lock(FALSE);
  9865. END;
  9866. END;
  9867. BrL(currentLoop);
  9868. IF Trace THEN TraceExit("VisitExitStatement") END;
  9869. END VisitExitStatement;
  9870. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9871. VAR
  9872. expression, parameterDesignator: SyntaxTree.Expression;
  9873. type, componentType: SyntaxTree.Type;
  9874. res, right: Operand;
  9875. left, mem, reg: IntermediateCode.Operand;
  9876. parameter: SyntaxTree.Parameter;
  9877. procedure: SyntaxTree.Procedure;
  9878. procedureType: SyntaxTree.ProcedureType;
  9879. returnTypeOffset: LONGINT;
  9880. delegate: BOOLEAN;
  9881. map: SymbolMap;
  9882. callingConvention, parametersSize: LONGINT;
  9883. BEGIN
  9884. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9885. expression := x.returnValue;
  9886. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9887. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9888. IF currentIsInline THEN
  9889. IF expression # NIL THEN
  9890. map := currentMapper.Get(NIL);
  9891. IF map # NIL THEN
  9892. Assign(map.to, expression);
  9893. ELSE
  9894. Evaluate(expression,res);
  9895. Emit(Return(position,res.op));
  9896. ReleaseOperand(res);
  9897. END;
  9898. END;
  9899. BrL(currentInlineExit);
  9900. RETURN;
  9901. END;
  9902. IF expression # NIL THEN
  9903. type := expression.type.resolved;
  9904. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9905. IF locked THEN Lock(FALSE) END;
  9906. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9907. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9908. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9909. 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
  9910. (* return without structured return parameter *)
  9911. Evaluate(expression,res);
  9912. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9913. IF locked OR profile THEN
  9914. Emit(Push(position,res.op));
  9915. IF delegate THEN HALT(200) END;
  9916. ReleaseOperand(res);
  9917. IF locked THEN Lock(FALSE) END;
  9918. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9919. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9920. reg := NewRegisterOperand(res.op.type);
  9921. Emit(Pop(position,reg));
  9922. Emit(Return(position,reg));
  9923. ReleaseIntermediateOperand(reg);
  9924. ELSE
  9925. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9926. Emit(Return(position,res.op));
  9927. ReleaseOperand(res);
  9928. END;
  9929. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9930. THEN
  9931. (* return using structured return parameter *)
  9932. 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)
  9933. OR SemanticChecker.IsPointerType(type));
  9934. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9935. parameter :=procedureType.returnParameter;
  9936. ASSERT(parameter # NIL);
  9937. returnTypeOffset := parameter.offsetInBits;
  9938. (*
  9939. IF parameter# NIL THEN
  9940. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9941. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9942. ELSE
  9943. returnTypeOffset := system.offsetFirstParameter
  9944. END;
  9945. *)
  9946. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9947. IF type IS SyntaxTree.RangeType THEN
  9948. (* array range type *)
  9949. Evaluate(expression, right);
  9950. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9951. Emit(Mov(position,mem, right.op)); (* first *)
  9952. ReleaseIntermediateOperand(mem);
  9953. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9954. Emit(Mov(position,mem, right.tag)); (* last *)
  9955. ReleaseIntermediateOperand(mem);
  9956. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9957. Emit(Mov(position,mem, right.extra)); (* step *)
  9958. ReleaseIntermediateOperand(mem);
  9959. ReleaseOperand(right);
  9960. ELSIF type IS SyntaxTree.ComplexType THEN
  9961. Evaluate(expression, right);
  9962. componentType := type(SyntaxTree.ComplexType).componentType;
  9963. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9964. Emit(Mov(position,mem, right.op)); (* real part *)
  9965. ReleaseIntermediateOperand(mem);
  9966. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9967. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9968. ReleaseIntermediateOperand(mem);
  9969. ReleaseOperand(right);
  9970. ELSE (* covers cases: pointer / record / array *)
  9971. parameter := procedureType.returnParameter;
  9972. checker.SetCurrentScope(currentScope);
  9973. ASSERT(parameter # NIL);
  9974. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9975. Assign(parameterDesignator,expression);
  9976. END;
  9977. ReleaseIntermediateOperand(left);
  9978. IF locked THEN Lock(FALSE) END;
  9979. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9980. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9981. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9982. parameter := procedureType.returnParameter;
  9983. checker.SetCurrentScope(currentScope);
  9984. IF parameter = NIL THEN
  9985. Error(procedure.position, "structured return of parameter of procedure not found");
  9986. ELSE
  9987. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9988. Assign(parameterDesignator,expression);
  9989. END;
  9990. IF locked THEN Lock(FALSE) END;
  9991. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9992. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9993. ELSE
  9994. HALT(200);
  9995. END;
  9996. ELSE
  9997. IF locked THEN Lock(FALSE) END;
  9998. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9999. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10000. END;
  10001. IF backend.cooperative THEN
  10002. BrL(exitLabel);
  10003. ELSE
  10004. callingConvention := procedureType.callingConvention;
  10005. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10006. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10007. ELSE
  10008. parametersSize := 0;
  10009. END;
  10010. EmitLeave(section, position,procedure, callingConvention);
  10011. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10012. END;
  10013. IF Trace THEN TraceExit("VisitReturnStatement") END;
  10014. END VisitReturnStatement;
  10015. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  10016. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  10017. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  10018. statements: SyntaxTree.StatementSequence;
  10019. name, suffix: SyntaxTree.IdentifierString;
  10020. BEGIN
  10021. Strings.IntToStr(awaitProcCounter,suffix);
  10022. Strings.Concat("@AwaitProcedure",suffix,name);
  10023. identifier := SyntaxTree.NewIdentifier(name);
  10024. INC(awaitProcCounter);
  10025. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10026. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10027. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10028. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10029. procedure.SetAccess(SyntaxTree.Hidden);
  10030. procedure.SetScope(currentScope);
  10031. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10032. procedureType.SetReturnType(system.booleanType);
  10033. procedure.SetType(procedureType);
  10034. body := SyntaxTree.NewBody(x.position,procedureScope);
  10035. procedureScope.SetBody(body);
  10036. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10037. returnStatement.SetReturnValue(x.condition);
  10038. statements := SyntaxTree.NewStatementSequence();
  10039. statements.AddStatement(returnStatement);
  10040. body.SetStatementSequence(statements);
  10041. currentScope.AddProcedure(procedure);
  10042. RETURN procedure
  10043. END MakeAwaitProcedure;
  10044. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10045. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10046. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  10047. BEGIN
  10048. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10049. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10050. IF backend.cooperative THEN
  10051. start := NewLabel();
  10052. true := NewLabel();
  10053. false := NewLabel();
  10054. SetLabel(start);
  10055. Condition(x.condition,true,false);
  10056. SetLabel(false);
  10057. PushSelfPointer();
  10058. CallThis(position,"ExclusiveBlocks","Await",1);
  10059. BrL(start);
  10060. SetLabel(true);
  10061. PushSelfPointer();
  10062. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10063. ELSE
  10064. proc := MakeAwaitProcedure(x);
  10065. Emit(Push(position,fp));
  10066. GetCodeSectionNameForSymbol(proc,name);
  10067. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10068. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10069. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10070. Emit(Call(position,call,ProcParametersSize(proc)));
  10071. Emit(Result(position,res));
  10072. (*
  10073. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10074. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10075. *)
  10076. InitOperand(result,ModeValue);
  10077. result.op := res;
  10078. label := NewLabel();
  10079. BreqL(label, result.op, SELF.true);
  10080. ReleaseOperand(result);
  10081. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10082. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10083. Emit(Push(position,res));
  10084. Emit(Push(position,fp));
  10085. PushSelfPointer();
  10086. Emit(Push(position,nil));
  10087. CallThis(position,"Objects","Await",4);
  10088. SetLabel(label);
  10089. END;
  10090. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10091. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10092. END VisitAwaitStatement;
  10093. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10094. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10095. BEGIN
  10096. FOR i := 0 TO x.Length() - 1 DO
  10097. statement := x.GetStatement( i );
  10098. Statement(statement);
  10099. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10100. END;
  10101. END StatementSequence;
  10102. PROCEDURE PushSelfPointer;
  10103. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10104. procedureType: SyntaxTree.ProcedureType;
  10105. BEGIN
  10106. scope := currentScope;
  10107. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10108. scope := scope.outerScope;
  10109. END;
  10110. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10111. IF ~newObjectFile THEN
  10112. Symbol(moduleSelf,op);
  10113. IntermediateCode.MakeMemory(op.op,addressType);
  10114. ELSE
  10115. moduleSection := meta.ModuleSection();
  10116. IF backend.cooperative THEN
  10117. moduleOffset := 0;
  10118. ELSE
  10119. moduleOffset := moduleSection.pc;
  10120. END;
  10121. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10122. END;
  10123. ELSE
  10124. GetBaseRegister(op.op,currentScope,scope);
  10125. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10126. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10127. parametersSize := ProcParametersSize(procedure);
  10128. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10129. IF backend.cooperative THEN
  10130. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10131. END;
  10132. IntermediateCode.MakeMemory(op.op,addressType);
  10133. END;
  10134. Emit(Push(position,op.op));
  10135. ReleaseOperand(op);
  10136. END PushSelfPointer;
  10137. PROCEDURE Lock(lock: BOOLEAN);
  10138. BEGIN
  10139. IF Trace THEN TraceEnter("Lock") END;
  10140. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10141. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10142. ASSERT(modifyAssignmentCounter = 0);
  10143. IF dump # NIL THEN
  10144. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10145. dump.Ln;dump.Update;
  10146. END;
  10147. PushSelfPointer;
  10148. IF backend.cooperative THEN
  10149. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10150. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10151. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10152. END;
  10153. ELSE
  10154. Emit(Push(position,true));
  10155. IF lock THEN CallThis(position,"Objects","Lock",2)
  10156. ELSE CallThis(position,"Objects","Unlock",2);
  10157. END;
  10158. END;
  10159. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10160. IF Trace THEN TraceExit("Lock") END;
  10161. END Lock;
  10162. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10163. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10164. BEGIN
  10165. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10166. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10167. previouslyUnchecked := isUnchecked;
  10168. isUnchecked := isUnchecked OR x.isUnchecked;
  10169. previouslyCooperativeSwitches := cooperativeSwitches;
  10170. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10171. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10172. IF x.statements # NIL THEN
  10173. StatementSequence(x.statements);
  10174. END;
  10175. IF (x IS SyntaxTree.Body) THEN
  10176. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10177. section.SetFinally(section.pc);
  10178. StatementSequence(x(SyntaxTree.Body).finally)
  10179. ELSIF x.isExclusive THEN
  10180. end := NewLabel();
  10181. BrL(end);
  10182. section.SetFinally(section.pc);
  10183. Lock(FALSE);
  10184. EmitTrap(position,RethrowTrap);
  10185. SetLabel(end);
  10186. END;
  10187. END;
  10188. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10189. isUnchecked := previouslyUnchecked;
  10190. cooperativeSwitches := previouslyCooperativeSwitches;
  10191. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10192. END VisitStatementBlock;
  10193. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10194. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10195. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10196. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10197. procedure: SyntaxTree.Procedure;
  10198. map: SymbolMap;
  10199. callingConvention, parametersSize: LONGINT;
  10200. BEGIN
  10201. scope := currentScope;
  10202. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10203. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10204. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10205. return := emptyOperand;
  10206. IF Trace THEN TraceEnter("VisitCode") END;
  10207. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10208. NEW(in, x.inRules.Length());
  10209. FOR i := 0 TO LEN(in)-1 DO
  10210. statement := x.inRules.GetStatement(i);
  10211. WITH statement: SyntaxTree.Assignment DO
  10212. Evaluate(statement.right, operand);
  10213. result := operand.op;
  10214. NEW(str, 64);
  10215. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10216. in[i] := result; IntermediateCode.SetString(in[i], str);
  10217. ReleaseIntermediateOperand(operand.tag);
  10218. END;
  10219. END;
  10220. ELSE in := NIL
  10221. END;
  10222. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10223. NEW(out, x.outRules.Length());
  10224. FOR i := 0 TO LEN(out)-1 DO
  10225. statement := x.outRules.GetStatement(i);
  10226. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10227. WITH statement: SyntaxTree.Assignment DO
  10228. Designate(statement.left, operand);
  10229. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10230. NEW(str, 64);
  10231. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10232. out[i] := result; IntermediateCode.SetString(out[i], str);
  10233. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10234. |statement: SyntaxTree.ReturnStatement DO
  10235. NEW(str, 64);
  10236. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10237. IF currentIsInline THEN
  10238. map := currentMapper.Get(NIL);
  10239. Designate(map.to, operand);
  10240. IF map.isAddress THEN
  10241. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10242. ELSE
  10243. result := operand.op;
  10244. END;
  10245. (*! only if it does not fit into register
  10246. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10247. *)
  10248. (*Evaluate(map.to, operand);*)
  10249. out[i] := result;
  10250. ELSE
  10251. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10252. END;
  10253. IntermediateCode.SetString(out[i], str);
  10254. ReleaseIntermediateOperand(operand.tag);
  10255. return := out[i];
  10256. ELSE
  10257. END;
  10258. END;
  10259. ELSE out := NIL
  10260. END;
  10261. Emit(Asm(x.position,x.sourceCode, in, out));
  10262. IF in # NIL THEN
  10263. FOR i := 0 TO LEN(in)-1 DO
  10264. ReleaseIntermediateOperand(in[i]);
  10265. END;
  10266. END;
  10267. IF out # NIL THEN
  10268. FOR i := 0 TO LEN(out)-1 DO
  10269. WITH statement: SyntaxTree.Assignment DO
  10270. ReleaseIntermediateOperand(out[i]);
  10271. |statement: SyntaxTree.ReturnStatement DO
  10272. (* release happens below *)
  10273. ELSE
  10274. END;
  10275. statement := x.outRules.GetStatement(i);
  10276. END;
  10277. END;
  10278. IF return.mode # IntermediateCode.Undefined THEN
  10279. IF currentIsInline THEN
  10280. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10281. Symbol(procedureType.returnParameter, par);
  10282. MakeMemory(mem, par.op, return.type, 0);
  10283. ReleaseOperand(par);
  10284. Emit(Mov(position, mem, return));
  10285. ReleaseIntermediateOperand(mem);
  10286. ELSE
  10287. Emit(Return(position,return));
  10288. END;
  10289. ReleaseIntermediateOperand(return);
  10290. IF currentIsInline THEN RETURN END;
  10291. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10292. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10293. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10294. ELSE
  10295. parametersSize := 0;
  10296. END;
  10297. EmitLeave(section, position,procedure, callingConvention);
  10298. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10299. END;
  10300. IF Trace THEN TraceExit("VisitCode") END;
  10301. END VisitCode;
  10302. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10303. BEGIN
  10304. RETURN ProcedureParametersSize(system, procedure);
  10305. END ProcParametersSize;
  10306. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10307. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10308. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10309. const, call: IntermediateCode.Operand;
  10310. parameterDesignator: SyntaxTree.Expression;
  10311. saved: RegisterEntry;
  10312. name: Basic.SegmentedName;
  10313. BEGIN
  10314. IF Trace THEN TraceEnter("ParameterCopies") END;
  10315. parameter := x.firstParameter;
  10316. WHILE parameter # NIL DO
  10317. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10318. type := parameter.type.resolved;
  10319. IF IsOpenArray(type) THEN
  10320. VisitParameter(parameter);
  10321. op := result;
  10322. IF backend.cooperative & parameter.NeedsTrace() THEN
  10323. length := GetArrayLength(type, op.tag);
  10324. size := NewRegisterOperand(addressType);
  10325. base := ArrayBaseType(type);
  10326. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10327. Emit(Mul(position, size, length, const));
  10328. dst := NewRegisterOperand (addressType);
  10329. Emit(Mov(position, dst, size));
  10330. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10331. Emit(Sub(position,dst,sp,dst));
  10332. Emit(And(position,dst,dst,const));
  10333. Emit(Mov(position,sp,dst));
  10334. par := fp;
  10335. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10336. IntermediateCode.InitImmediate(null, byteType, 0);
  10337. Emit(Fill(position, dst, size, null));
  10338. ReleaseIntermediateOperand(dst);
  10339. ReleaseIntermediateOperand(length);
  10340. SaveRegisters();ReleaseUsedRegisters(saved);
  10341. (* register dst has been freed before SaveRegisters already *)
  10342. base := ArrayBaseType(type);
  10343. (* assign method of open array *)
  10344. IF base.IsRecordType() THEN
  10345. Emit (Push(position, length));
  10346. Emit (Push(position, dst));
  10347. Emit (Push(position, op.op));
  10348. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10349. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10350. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10351. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10352. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10353. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10354. Emit (Push(position,length));
  10355. Emit (Push(position, dst));
  10356. Emit (Push(position, length));
  10357. Emit (Push(position, op.op));
  10358. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10359. ELSE
  10360. Emit (Push(position, length));
  10361. Emit (Push(position, dst));
  10362. Emit (Push(position, length));
  10363. Emit (Push(position, op.op));
  10364. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10365. ASSERT(ArrayBaseType(type).IsPointer());
  10366. END;
  10367. RestoreRegisters(saved);
  10368. ELSE
  10369. temp := GetDynamicSize(type,op.tag);
  10370. ReuseCopy(size,temp);
  10371. ReleaseIntermediateOperand(temp);
  10372. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10373. Emit(Sub(position,size,sp,size));
  10374. Emit(And(position,size,size,const));
  10375. Emit(Mov(position,sp,size));
  10376. par := fp;
  10377. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10378. ReleaseIntermediateOperand(size);
  10379. size := GetDynamicSize(type,op.tag);
  10380. END;
  10381. Emit(Copy(position,sp,op.op,size));
  10382. ReleaseIntermediateOperand(size);
  10383. ReleaseOperand(op);
  10384. IntermediateCode.MakeMemory(par,addressType);
  10385. Emit(Mov(position,par,sp));
  10386. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10387. checker.SetCurrentScope(currentScope);
  10388. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10389. Assign(parameterDesignator,parameterDesignator);
  10390. END;
  10391. END;
  10392. parameter := parameter.nextParameter;
  10393. END;
  10394. IF Trace THEN TraceExit("ParameterCopies") END;
  10395. END ParameterCopies;
  10396. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10397. VAR x: SyntaxTree.Variable;
  10398. BEGIN
  10399. x := scope.firstVariable;
  10400. WHILE x # NIL DO
  10401. InitVariable(x,FALSE);
  10402. x := x.nextVariable;
  10403. END;
  10404. END InitVariables;
  10405. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10406. BEGIN
  10407. IF (symbol # NIL) THEN
  10408. RETURN fingerPrinter.SymbolFP(symbol).public
  10409. ELSE
  10410. RETURN 0
  10411. END;
  10412. END GetFingerprint;
  10413. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10414. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10415. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10416. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10417. name: Basic.SegmentedName;
  10418. offset: LONGINT;
  10419. BEGIN
  10420. IF Trace THEN TraceEnter("Body") END;
  10421. ReleaseUsedRegisters(saved); (* just in case ... *)
  10422. section := ir;
  10423. exitLabel := NewLabel ();
  10424. IF moduleBody THEN moduleBodySection := section END;
  10425. IF ir.comments # NIL THEN
  10426. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10427. commentPrintout.SingleStatement(TRUE);
  10428. dump := ir.comments;
  10429. ELSE
  10430. commentPrintout := NIL;
  10431. dump := NIL;
  10432. END;
  10433. prevScope := currentScope;
  10434. currentScope := scope;
  10435. lastSwitchPC := 0;
  10436. cooperativeSwitches := backend.cooperative;
  10437. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10438. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10439. IF x # NIL THEN
  10440. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10441. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10442. IF moduleBody THEN
  10443. ProfilerInit();
  10444. ELSE
  10445. Basic.SegmentedNameToString(ir.name, string);
  10446. ProfilerAddProcedure(numberProcedures,string);
  10447. ProfilerEnterExit(numberProcedures,TRUE);
  10448. END;
  10449. END;
  10450. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10451. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10452. END;
  10453. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10454. IF moduleBody & ~newObjectFile THEN
  10455. InitVariables(moduleScope)
  10456. END;
  10457. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10458. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10459. IF procedure = cellScope.bodyProcedure THEN
  10460. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10461. StaticCallOperand(op, cellScope.constructor);
  10462. Emit(Call(position,op.op,0));
  10463. END;
  10464. END;
  10465. END;
  10466. InitVariables(scope);
  10467. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10468. GetCodeSectionNameForSymbol(procedure, name);
  10469. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10470. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10471. IF ProtectModulesPointers THEN
  10472. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10473. ELSE
  10474. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10475. END;
  10476. IntermediateCode.SetOffset(right,offset); (* tag *)
  10477. IntermediateCode.InitMemory(left,addressType,fp,0);
  10478. Emit(Mov(position, left, right));
  10479. END;
  10480. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10481. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10482. ParameterCopies(procedureType);
  10483. IF x.code = NIL THEN
  10484. VisitStatementBlock(x);
  10485. ELSE
  10486. VisitCode(x.code)
  10487. END;
  10488. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10489. IF ~backend.cooperative THEN
  10490. ProfilerEnterExit(numberProcedures,FALSE);
  10491. END;
  10492. INC(numberProcedures);
  10493. END;
  10494. END;
  10495. IF backend.cooperative THEN
  10496. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10497. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10498. END;
  10499. IF x # NIL THEN
  10500. SELF.position := x.position;
  10501. END;
  10502. CheckRegistersFree();
  10503. ASSERT(modifyAssignmentCounter = 0);
  10504. currentScope := prevScope;
  10505. IF Trace THEN TraceExit("Body") END;
  10506. END Body;
  10507. END ImplementationVisitor;
  10508. MetaDataGenerator=OBJECT
  10509. VAR
  10510. implementationVisitor: ImplementationVisitor;
  10511. declarationVisitor: DeclarationVisitor;
  10512. module: Sections.Module;
  10513. moduleName: ARRAY 128 OF CHAR;
  10514. moduleNamePool: Basic.HashTableInt;
  10515. moduleNamePoolSection: IntermediateCode.Section;
  10516. modulePointerSection: IntermediateCode.Section;
  10517. modulePointerSizePC: LONGINT;
  10518. modulePointerSectionOffset: LONGINT;
  10519. modulePointers: LONGINT;
  10520. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10521. RecordBaseOffset: LONGINT;
  10522. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10523. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10524. TypeTags: LONGINT; (* type extension level support *)
  10525. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10526. patchInfoPC: LONGINT;
  10527. patchCRC: LONGINT;
  10528. CONST
  10529. EmptyBlockOffset = 2;
  10530. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10531. BEGIN
  10532. IF implementationVisitor.backend.cooperative THEN
  10533. TypeTags := MAX(LONGINT);
  10534. BaseTypesTableOffset := 0;
  10535. MethodTableOffset := 2;
  10536. TypeRecordBaseOffset := 0;
  10537. RecordBaseOffset := 0;
  10538. ELSIF simple THEN
  10539. TypeTags := 3; (* only 3 extensions allowed *)
  10540. BaseTypesTableOffset := 1;
  10541. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10542. TypeRecordBaseOffset := 0;
  10543. RecordBaseOffset := 1;
  10544. ELSE
  10545. TypeTags := 16;
  10546. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10547. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10548. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10549. (* change this when Heaps.HeapBlock is modified *)
  10550. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10551. RecordBaseOffset := 8; (* addresses *)
  10552. ELSE
  10553. RecordBaseOffset := 9; (* addresses *)
  10554. END;
  10555. END;
  10556. SELF.simple := simple;
  10557. SELF.implementationVisitor := implementationVisitor;
  10558. SELF.declarationVisitor := declarationVisitor;
  10559. implementationVisitor.meta := SELF;
  10560. declarationVisitor.meta := SELF;
  10561. END InitMetaDataGenerator;
  10562. PROCEDURE SetModule(module: Sections.Module);
  10563. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10564. BEGIN
  10565. SELF.module := module;
  10566. Global.GetModuleName(module.module,moduleName);
  10567. Global.GetSymbolSegmentedName(module.module, name);
  10568. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10569. NEW(moduleNamePool, 32);
  10570. (*! require GC protection *)
  10571. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10572. IF ProtectModulesPointers THEN
  10573. name := "Heaps.AnyPtr";
  10574. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10575. (* set base pointer *)
  10576. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10577. END;
  10578. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10579. modulePointers := 0;
  10580. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10581. AddPointer(moduleNamePoolSection, namePoolOffset);
  10582. END;
  10583. END SetModule;
  10584. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10585. BEGIN
  10586. IF ~implementationVisitor.backend.cooperative THEN
  10587. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10588. INC(modulePointers);
  10589. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10590. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10591. END;
  10592. END AddPointer;
  10593. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10594. BEGIN
  10595. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10596. END GetTypeRecordBaseOffset;
  10597. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10598. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10599. BEGIN
  10600. (* change this when Heaps.HeapBlock is modified *)
  10601. INC(dataAdrOffset,7);
  10602. Info(section,"headerAdr");
  10603. Address(section,0);
  10604. Info(section,"typeDesc");
  10605. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10606. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10607. NamedSymbol(section, name, symbol, 0, offset);
  10608. Info(section,"mark: LONGINT;");
  10609. Longint(section,-1);
  10610. Info(section,"refCount: LONGINT;");
  10611. Longint(section,0);
  10612. (*
  10613. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10614. *)
  10615. Info(section,"dataAdr-: ADDRESS");
  10616. Symbol(section,section, dataAdrOffset,0);
  10617. Info(section,"size-: SIZE");
  10618. Address(section,0);
  10619. Info(section,"nextMark: HeapBlock;");
  10620. Address(section,0);
  10621. END HeapBlock;
  10622. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10623. VAR i: LONGINT;
  10624. BEGIN
  10625. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10626. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10627. Info(section,"count*: LONGINT");
  10628. Longint(section,0);
  10629. Info(section,"locked*: BOOLEAN");
  10630. Longint(section,0);
  10631. Info(section,"awaitingLock*: ProcessQueue");
  10632. Address(section,0);
  10633. Address(section,0);
  10634. Info(section,"awaitingCond*: ProcessQueue");
  10635. Address(section,0);
  10636. Address(section,0);
  10637. Info(section,"lockedBy*: ANY");
  10638. Address(section,0);
  10639. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10640. Longint(section,1);
  10641. FOR i := 2 TO 6 DO
  10642. Longint(section,0);
  10643. END;
  10644. Info(section,"lock*: ANY");
  10645. Address(section,0);
  10646. END ProtectedHeapBlock;
  10647. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10648. BEGIN
  10649. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10650. END Info;
  10651. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10652. VAR op: IntermediateCode.Operand;
  10653. BEGIN
  10654. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10655. section.Emit(Data(Basic.invalidPosition,op));
  10656. END Address;
  10657. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10658. VAR op: IntermediateCode.Operand;
  10659. BEGIN
  10660. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10661. section.Emit(Data(Basic.invalidPosition,op));
  10662. END Size;
  10663. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10664. VAR op: IntermediateCode.Operand;
  10665. BEGIN
  10666. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10667. section.Emit(Data(Basic.invalidPosition,op));
  10668. END Set;
  10669. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10670. VAR op: IntermediateCode.Operand;
  10671. BEGIN
  10672. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10673. section.Emit(Data(Basic.invalidPosition,op));
  10674. END Longint;
  10675. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10676. VAR op,noOperand: IntermediateCode.Operand;
  10677. BEGIN
  10678. IntermediateCode.InitOperand(noOperand);
  10679. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10680. section.PatchOperands(pc,op,noOperand,noOperand);
  10681. END PatchAddress;
  10682. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10683. VAR op,noOperand: IntermediateCode.Operand;
  10684. BEGIN
  10685. IntermediateCode.InitOperand(noOperand);
  10686. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10687. section.PatchOperands(pc,op,noOperand,noOperand);
  10688. END PatchSize;
  10689. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10690. VAR op,noOperand: IntermediateCode.Operand;
  10691. BEGIN
  10692. IntermediateCode.InitOperand(noOperand);
  10693. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10694. section.PatchOperands(pc,op,noOperand,noOperand);
  10695. END PatchLongint;
  10696. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10697. VAR op, noOperand: IntermediateCode.Operand;
  10698. BEGIN
  10699. IntermediateCode.InitOperand(noOperand);
  10700. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10701. section.PatchOperands(pc,op,noOperand,noOperand);
  10702. END PatchSymbol;
  10703. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10704. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10705. BEGIN
  10706. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10707. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10708. section.Emit(Data(Basic.invalidPosition,op));
  10709. END Boolean;
  10710. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10711. VAR op: IntermediateCode.Operand;
  10712. BEGIN
  10713. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10714. section.Emit(Data(Basic.invalidPosition,op));
  10715. END Char;
  10716. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10717. VAR op: IntermediateCode.Operand;
  10718. BEGIN
  10719. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10720. section.Emit(Data(Basic.invalidPosition,op));
  10721. END Integer;
  10722. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10723. VAR i: LONGINT;
  10724. BEGIN
  10725. Info(section,str);
  10726. i := 0;
  10727. WHILE(str[i] # 0X) DO
  10728. Char(section,str[i]);
  10729. INC(i);
  10730. END;
  10731. Char(section,0X);
  10732. END String;
  10733. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10734. VAR s: Basic.SectionName;
  10735. BEGIN
  10736. StringPool.GetString(str, s);
  10737. String(section, s);
  10738. END String0;
  10739. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10740. VAR op: IntermediateCode.Operand;
  10741. BEGIN
  10742. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10743. IntermediateCode.SetOffset(op,realOffset);
  10744. section.Emit(Data(Basic.invalidPosition,op));
  10745. END NamedSymbol;
  10746. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10747. VAR op: IntermediateCode.Operand;
  10748. BEGIN
  10749. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10750. IntermediateCode.SetOffset(op,realOffset);
  10751. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10752. END NamedSymbolAt;
  10753. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10754. BEGIN
  10755. IF symbol= NIL THEN
  10756. Address( section, realOffset);
  10757. ASSERT(virtualOffset = 0);
  10758. ELSE
  10759. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10760. END;
  10761. END Symbol;
  10762. (* OutPointers delivers
  10763. {pointerOffset}
  10764. *)
  10765. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10766. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10767. BEGIN
  10768. type := type.resolved;
  10769. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10770. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10771. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10772. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10773. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10774. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10775. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10776. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10777. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10778. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10779. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10780. ELSIF (type IS SyntaxTree.RecordType) THEN
  10781. (* never treat a record like a pointer, even if the pointer field is set! *)
  10782. WITH type: SyntaxTree.RecordType DO
  10783. base := type.GetBaseRecord();
  10784. IF base # NIL THEN
  10785. Pointers(offset,symbol,section, base,numberPointers);
  10786. END;
  10787. variable := type.recordScope.firstVariable;
  10788. WHILE(variable # NIL) DO
  10789. IF ~(variable.untraced) THEN
  10790. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10791. END;
  10792. variable := variable.nextVariable;
  10793. END;
  10794. END;
  10795. ELSIF (type IS SyntaxTree.CellType) THEN
  10796. WITH type: SyntaxTree.CellType DO
  10797. base := type.GetBaseRecord();
  10798. IF base # NIL THEN
  10799. Pointers(offset,symbol,section, base,numberPointers);
  10800. END;
  10801. variable := type.cellScope.firstVariable;
  10802. WHILE(variable # NIL) DO
  10803. IF ~(variable.untraced) THEN
  10804. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10805. END;
  10806. variable := variable.nextVariable;
  10807. END;
  10808. property := type.firstProperty;
  10809. WHILE(property # NIL) DO
  10810. IF ~(property.untraced) THEN
  10811. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10812. END;
  10813. property := property.nextProperty;
  10814. END;
  10815. parameter := type.firstParameter;
  10816. WHILE(parameter # NIL) DO
  10817. IF ~(parameter.untraced) THEN
  10818. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10819. END;
  10820. parameter := parameter.nextParameter;
  10821. END;
  10822. END;
  10823. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10824. WITH type: SyntaxTree.ArrayType DO
  10825. IF type.form= SyntaxTree.Static THEN
  10826. n := type.staticLength;
  10827. base := type.arrayBase.resolved;
  10828. WHILE(base IS SyntaxTree.ArrayType) DO
  10829. type := base(SyntaxTree.ArrayType);
  10830. n := n* type.staticLength;
  10831. base := type.arrayBase.resolved;
  10832. END;
  10833. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10834. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10835. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10836. FOR i := 0 TO n-1 DO
  10837. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10838. END;
  10839. END;
  10840. ELSE
  10841. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10842. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10843. END;
  10844. END;
  10845. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10846. WITH type: SyntaxTree.MathArrayType DO
  10847. IF type.form = SyntaxTree.Static THEN
  10848. n := type.staticLength;
  10849. base := type.arrayBase.resolved;
  10850. WHILE(base IS SyntaxTree.MathArrayType) DO
  10851. type := base(SyntaxTree.MathArrayType);
  10852. n := n* type.staticLength;
  10853. base := type.arrayBase.resolved;
  10854. END;
  10855. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10856. IF SemanticChecker.ContainsPointer(base) THEN
  10857. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10858. FOR i := 0 TO n-1 DO
  10859. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10860. END;
  10861. END;
  10862. ELSE
  10863. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10864. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10865. END
  10866. END;
  10867. (* ELSE no pointers in type *)
  10868. END;
  10869. END Pointers;
  10870. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10871. VAR position,i: LONGINT; ch: CHAR;
  10872. BEGIN
  10873. IF pool.Has(index) THEN
  10874. RETURN pool.GetInt(index)
  10875. ELSE
  10876. position := source.pc;
  10877. pool.PutInt(index, position);
  10878. Info(source, name);
  10879. i := 0;
  10880. REPEAT
  10881. ch := name[i]; INC(i);
  10882. Char( source, ch);
  10883. UNTIL ch = 0X;
  10884. END;
  10885. RETURN position;
  10886. END EnterDynamicName;
  10887. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10888. VAR name: Basic.SectionName; position: LONGINT;
  10889. BEGIN
  10890. IF pool.Has(index) THEN
  10891. RETURN pool.GetInt(index)
  10892. ELSE
  10893. StringPool.GetString(index, name);
  10894. position := EnterDynamicName(source,name,index, pool);
  10895. END;
  10896. RETURN position;
  10897. END DynamicName;
  10898. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10899. VAR section: IntermediateCode.Section;
  10900. BEGIN
  10901. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10902. IF implementationVisitor.backend.cooperative THEN
  10903. Info(section, "TypeDescriptor");
  10904. Basic.ToSegmentedName("BaseTypes.Array", name);
  10905. NamedSymbol(section, name,NIL, 0, 0);
  10906. BasePointer(section);
  10907. offset := 0;
  10908. ELSE
  10909. IF ProtectModulesPointers THEN
  10910. HeapBlock(mName,typeName,section,2);
  10911. END;
  10912. Info(section, "HeapBlock");
  10913. IF ProtectModulesPointers THEN
  10914. Symbol(section,section,2,0);
  10915. ELSE
  10916. Address(section,0);
  10917. END;
  10918. Info(section, "TypeDescriptor");
  10919. Address(section,0);
  10920. offset := section.pc;
  10921. END;
  10922. RETURN section
  10923. END NamedBlock;
  10924. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10925. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10926. BEGIN
  10927. COPY(moduleName,name);
  10928. Strings.Append(name,suffix);
  10929. Basic.ToSegmentedName(name, pooledName);
  10930. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10931. END Block;
  10932. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10933. VAR name: Basic.SegmentedName;
  10934. BEGIN
  10935. Info(source,"ArrayHeader");
  10936. IF implementationVisitor.backend.cooperative THEN
  10937. sizePC := source.pc;
  10938. Address(source,0);
  10939. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10940. IF baseType # "" THEN
  10941. Basic.ToSegmentedName(baseType, name);
  10942. NamedSymbol(source, name,NIL, 0, 0);
  10943. ELSE
  10944. Address(source,0);
  10945. END;
  10946. Address(source,0);
  10947. ELSE
  10948. Address(source,0);
  10949. Address(source,0);
  10950. (* first pointer for GC *)
  10951. IF hasPointer THEN
  10952. (* points to first element in the array, this is NOT the base type descriptor *)
  10953. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10954. ELSE
  10955. Address(source,0);
  10956. END;
  10957. sizePC := source.pc;
  10958. Address(source,0);
  10959. Info(source,"array data");
  10960. END;
  10961. END ArrayBlock;
  10962. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10963. BEGIN
  10964. IF implementationVisitor.backend.cooperative THEN
  10965. PatchSize(section, pc, size);
  10966. PatchSize(section, pc + 3, size);
  10967. ELSE
  10968. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10969. PatchSize(section, pc, size);
  10970. END;
  10971. END PatchArray;
  10972. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10973. VAR
  10974. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10975. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10976. poolMap: Basic.HashTableInt;
  10977. namePool: IntermediateCode.Section;
  10978. namePoolOffset: LONGINT;
  10979. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10980. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10981. BEGIN
  10982. Basic.SegmentedNameToString(s1.name,n1);
  10983. Basic.SegmentedNameToString(s2.name,n2);
  10984. index := 0;
  10985. ch1 := n1[index];
  10986. ch2 := n2[index];
  10987. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10988. INC(index);
  10989. ch1 := n1[index];
  10990. ch2 := n2[index];
  10991. END;
  10992. RETURN ch1 < ch2;
  10993. END Compare;
  10994. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10995. VAR
  10996. i, j: LONGINT;
  10997. x, t: Sections.Section;
  10998. BEGIN
  10999. IF lo < hi THEN
  11000. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  11001. WHILE i <= j DO
  11002. WHILE Compare(list[i], x) DO INC(i) END;
  11003. WHILE Compare(x, list[j]) DO DEC(j) END;
  11004. IF i <= j THEN
  11005. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  11006. INC(i); DEC(j)
  11007. END
  11008. END;
  11009. IF lo < j THEN QuickSort(list, lo, j) END;
  11010. IF i < hi THEN QuickSort(list, i, hi) END
  11011. END;
  11012. END QuickSort;
  11013. (*
  11014. ExportDesc* = RECORD
  11015. fp*: ADDRESS;
  11016. name* {UNTRACED}: DynamicName;
  11017. adr*: ADDRESS;
  11018. exports*: LONGINT;
  11019. dsc* {UNTRACED}: ExportArray
  11020. END;
  11021. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  11022. *)
  11023. PROCEDURE ExportDesc2(
  11024. source: IntermediateCode.Section;
  11025. namePool: IntermediateCode.Section;
  11026. fingerPrinter: FingerPrinter.FingerPrinter;
  11027. symbol: Sections.Section;
  11028. name: StringPool.Index;
  11029. VAR patchAdr: LONGINT
  11030. ): BOOLEAN;
  11031. VAR fingerPrint: SyntaxTree.FingerPrint;
  11032. BEGIN
  11033. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11034. & (symbol.type # Sections.InlineCodeSection)
  11035. THEN
  11036. *)
  11037. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11038. & (symbol.type # Sections.ExitCodeSection)
  11039. & (symbol.type # Sections.InlineCodeSection))
  11040. THEN
  11041. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11042. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11043. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  11044. Longint(source,fingerPrint.public);
  11045. ELSE
  11046. Longint(source, 0);
  11047. END;
  11048. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  11049. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11050. Symbol(source, symbol,0,0);
  11051. patchAdr := source.pc;
  11052. Longint(source, 0);
  11053. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11054. Address(source,0);
  11055. END;
  11056. RETURN TRUE
  11057. ELSE
  11058. RETURN FALSE
  11059. END;
  11060. END ExportDesc2;
  11061. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11062. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11063. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11064. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11065. nextPatch: LONGINT;
  11066. TYPE
  11067. Scope = RECORD
  11068. elements: LONGINT;
  11069. gelements: LONGINT;
  11070. section: IntermediateCode.Section;
  11071. patchAdr: LONGINT;
  11072. arraySizePC: LONGINT;
  11073. beginPC: LONGINT; (* current scope start pc *)
  11074. END;
  11075. BEGIN
  11076. Basic.InitSegmentedName(prev);
  11077. olevel := -1;
  11078. scopes[0].section := source;
  11079. scopes[0].arraySizePC := MIN(LONGINT);
  11080. FOR s := 0 TO LEN(sections)-1 DO
  11081. symbol := sections[s];
  11082. 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
  11083. this := sections[s].name;
  11084. level := 0;
  11085. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11086. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11087. INC(level);
  11088. END;
  11089. WHILE level < olevel DO
  11090. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11091. IF olevel > 0 THEN
  11092. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11093. nextPatch := scopes[olevel-1].patchAdr+1;
  11094. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11095. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11096. END;
  11097. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11098. DEC(olevel);
  11099. END;
  11100. IF (level < LEN(this)) & (this[level] > 0) THEN
  11101. IF level > olevel THEN
  11102. (*TRACE("opening",level); *)
  11103. IF scopes[level].section = NIL THEN
  11104. arrayName := ".@ExportArray";
  11105. Strings.AppendInt(arrayName, level);
  11106. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11107. AddPointer(scopes[level].section,offset);
  11108. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11109. END;
  11110. scopes[level].beginPC := scopes[level].section.pc;
  11111. olevel := level;
  11112. scopes[olevel].elements := 0;
  11113. END;
  11114. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11115. sym := sections[s];
  11116. ELSE
  11117. sym := NIL;
  11118. END;
  11119. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11120. THEN
  11121. INC(scopes[olevel].elements);
  11122. END;
  11123. (* enter string in scope *)
  11124. INC(level);
  11125. END;
  11126. END;
  11127. Basic.SegmentedNameToString(this, name);
  11128. prev := this;
  11129. END;
  11130. END;
  11131. WHILE 0 <= olevel DO
  11132. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11133. IF olevel > 0 THEN
  11134. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11135. nextPatch := scopes[olevel-1].patchAdr+1;
  11136. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11137. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11138. END;
  11139. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11140. DEC(olevel);
  11141. END;
  11142. level := 0;
  11143. WHILE (level < LEN(scopes)) DO
  11144. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11145. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11146. END;
  11147. INC(level);
  11148. END;
  11149. END Export;
  11150. BEGIN
  11151. NEW(fingerPrinter);
  11152. NEW(poolMap, 64);
  11153. (* 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 *)
  11154. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11155. NEW(sectionArray, module.allSections.Length());
  11156. FOR i := 0 TO module.allSections.Length() - 1 DO
  11157. section := module.allSections.GetSection(i);
  11158. sectionArray[i] := section;
  11159. END;
  11160. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11161. Export(sectionArray^);
  11162. END ExportDesc;
  11163. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11164. VAR
  11165. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11166. BEGIN
  11167. Info(source, "exception table offsets array descriptor");
  11168. size := 0;
  11169. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11170. Info(source, "exception table content");
  11171. FOR i := 0 TO module.allSections.Length() - 1 DO
  11172. p := module.allSections.GetSection(i);
  11173. IF p.type = Sections.CodeSection THEN
  11174. finallyPC := p(IntermediateCode.Section).finally;
  11175. IF finallyPC>=0 THEN
  11176. Symbol( source, p, 0,0);
  11177. Symbol( source, p, finallyPC, 0);
  11178. Symbol( source, p, finallyPC,0);
  11179. INC(size);
  11180. END;
  11181. END
  11182. END;
  11183. PatchArray(source,sizePC,size);
  11184. END ExceptionArray;
  11185. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11186. VAR i: LONGINT; ch: CHAR;
  11187. BEGIN
  11188. i := 0;
  11189. REPEAT
  11190. ch := name[i]; INC(i);
  11191. Char( section, ch);
  11192. UNTIL ch = 0X;
  11193. WHILE i < 32 DO
  11194. Char( section, 0X); INC(i);
  11195. END;
  11196. END Name;
  11197. PROCEDURE References(section: IntermediateCode.Section);
  11198. CONST
  11199. sfTypeNone = 0X;
  11200. sfTypeCHAR = 01X;
  11201. sfTypeCHAR8 = 02X;
  11202. sfTypeCHAR16 = 03X;
  11203. sfTypeCHAR32 = 04X;
  11204. sfTypeRANGE = 05X;
  11205. sfTypeSHORTINT = 06X;
  11206. sfTypeINTEGER = 07X;
  11207. sfTypeLONGINT = 08X;
  11208. sfTypeHUGEINT = 09X;
  11209. sfTypeWORD = 0AX;
  11210. sfTypeLONGWORD = 0BX;
  11211. sfTypeSIGNED8 = 0CX;
  11212. sfTypeSIGNED16 = 0DX;
  11213. sfTypeSIGNED32 = 0EX;
  11214. sfTypeSIGNED64 = 0FX;
  11215. sfTypeUNSIGNED8 = 10X;
  11216. sfTypeUNSIGNED16 = 11X;
  11217. sfTypeUNSIGNED32 = 12X;
  11218. sfTypeUNSIGNED64 = 13X;
  11219. sfTypeREAL = 14X;
  11220. sfTypeLONGREAL = 15X;
  11221. sfTypeCOMPLEX = 16X;
  11222. sfTypeLONGCOMPLEX = 17X;
  11223. sfTypeBOOLEAN = 18X;
  11224. sfTypeSET = 19X;
  11225. sfTypeANY = 1AX;
  11226. sfTypeOBJECT = 1BX;
  11227. sfTypeBYTE = 1CX;
  11228. sfTypeADDRESS = 1DX;
  11229. sfTypeSIZE = 1EX;
  11230. sfTypeIndirect = 1FX;
  11231. sfTypeRecord = 20X;
  11232. sfTypePointerToRecord = 21X;
  11233. sfTypePointerToArray = 22X;
  11234. sfTypeOpenArray = 23X;
  11235. sfTypeStaticArray = 24X;
  11236. sfTypeDynamicArray = 25X;
  11237. sfTypeMathStaticArray = 26X;
  11238. sfTypeMathOpenArray = 27X;
  11239. sfTypeMathTensor = 28X;
  11240. sfTypeProcedure = 29X;
  11241. sfTypeDelegate = 2AX;
  11242. sfTypeENUM = 2BX;
  11243. sfTypeCELL = 2CX;
  11244. sfTypePORT = 2DX;
  11245. sfIN = 0X;
  11246. sfOUT = 1X;
  11247. flagDelegate = 0;
  11248. flagConstructor = 1;
  11249. (* variable / parameter addressing modes *)
  11250. sfAbsolute = 0X; (* global vars *)
  11251. sfRelative = 1X; (* variables, value parameters *)
  11252. sfIndirect = 2X; (* var parameters *)
  11253. sfScopeBegin = 0F0X;
  11254. sfScopeEnd = 0F1X;
  11255. sfProcedure = 0F2X;
  11256. sfVariable = 0F3X;
  11257. sfTypeDeclaration = 0F4X;
  11258. sfModule = 0FFX;
  11259. RefInfo = TRUE;
  11260. VAR
  11261. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11262. indirectTypes: Basic.HashTable;
  11263. PROCEDURE CurrentIndex(): LONGINT;
  11264. VAR i: LONGINT;
  11265. BEGIN
  11266. FOR i := startPC TO section.pc -1 DO
  11267. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11268. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11269. END;
  11270. startPC := section.pc;
  11271. RETURN lastOffset;
  11272. END CurrentIndex;
  11273. (*
  11274. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11275. Module = sfModule prevSymbol:SIZE name:String Scope.
  11276. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11277. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11278. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11279. Type =
  11280. sfTypePointerToRecord
  11281. | sfTypePointerToArray Type
  11282. | sfTypeOpenArray Type
  11283. | sfTypeDynamicArray Type
  11284. | sfTypeStaticArray length:SIZE Type
  11285. | sfTypeMathOpenArray Type
  11286. | sfTypeMathStaticArray length:SIZE Type
  11287. | sfTypeMathTensor Type
  11288. | sfTypeRecord tdAdr:ADDRESS
  11289. | sfTypeProcedure {Parameter} return:Type
  11290. | sfTypeDelegate {Parameter} return:Type
  11291. | sfTypePort (sfIN | sfOUT)
  11292. | sfTypeBOOLEAN
  11293. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11294. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11295. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11296. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11297. | sfTypeWORD | sfTypeLONGWORD
  11298. | sfTypeREAL | sfTypeLONGREAL
  11299. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11300. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11301. | sfTypeIndirect offset:SIZE.
  11302. *)
  11303. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11304. VAR offset: SIZE;
  11305. BEGIN
  11306. IF indirectTypes.Has(type) THEN
  11307. offset := indirectTypes.GetInt(type);
  11308. Char(section, sfTypeIndirect);
  11309. Size(section, offset);
  11310. RETURN TRUE;
  11311. ELSE
  11312. indirectTypes.PutInt(type, CurrentIndex());
  11313. RETURN FALSE;
  11314. END;
  11315. END Indirect;
  11316. PROCEDURE NType(type: SyntaxTree.Type);
  11317. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11318. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11319. BEGIN
  11320. IF type = NIL THEN
  11321. Char(section, sfTypeNone)
  11322. ELSE
  11323. type := type.resolved;
  11324. size := type.sizeInBits;
  11325. WITH type:SyntaxTree.PointerType DO
  11326. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11327. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11328. Char(section, sfTypePointerToRecord);
  11329. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11330. ELSE
  11331. IF RefInfo THEN Info(section,"PointerToArray") END;
  11332. Char(section, sfTypePointerToArray);
  11333. NType(type.pointerBase);
  11334. END;
  11335. | type: SyntaxTree.ArrayType DO
  11336. IF ~Indirect(type) THEN
  11337. IF type.form = SyntaxTree.Open THEN
  11338. IF RefInfo THEN Info(section,"OpenArray") END;
  11339. Char(section, sfTypeOpenArray);
  11340. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11341. IF RefInfo THEN Info(section,"DynamicArray") END;
  11342. Char(section, sfTypeDynamicArray);
  11343. ELSIF type.form = SyntaxTree.Static THEN
  11344. IF RefInfo THEN Info(section,"StaticArray") END;
  11345. Char(section, sfTypeStaticArray);
  11346. Size(section, type.staticLength);
  11347. ELSE
  11348. HALT(100);
  11349. END;
  11350. NType(type.arrayBase);
  11351. END;
  11352. | type: SyntaxTree.MathArrayType DO
  11353. IF ~Indirect(type) THEN
  11354. IF type.form = SyntaxTree.Open THEN
  11355. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11356. Char(section, sfTypeMathOpenArray);
  11357. ELSIF type.form = SyntaxTree.Static THEN
  11358. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11359. Char(section, sfTypeMathStaticArray);
  11360. Size(section, type.staticLength);
  11361. ELSIF type.form = SyntaxTree.Tensor THEN
  11362. IF RefInfo THEN Info(section,"MathTensor") END;
  11363. Char(section, sfTypeMathTensor);
  11364. ELSE
  11365. HALT(100);
  11366. END;
  11367. NType(type.arrayBase);
  11368. END;
  11369. | type: SyntaxTree.RecordType DO
  11370. IF ~Indirect(type) THEN
  11371. IF type.pointerType # NIL (* OBJECT *) THEN
  11372. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11373. Char(section, sfTypePointerToRecord)
  11374. ELSE
  11375. IF RefInfo THEN Info(section,"Record") END;
  11376. Char(section, sfTypeRecord);
  11377. td := type.typeDeclaration;
  11378. IF RefInfo THEN Info(section,"TD") END;
  11379. IF (td # NIL) THEN
  11380. Global.GetSymbolSegmentedName(td,segmentedName);
  11381. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11382. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11383. ELSE
  11384. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11385. END;
  11386. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11387. Symbol(section, tir, 0, offset);
  11388. ELSE
  11389. Address(section, 0);
  11390. END;
  11391. END;
  11392. END;
  11393. | type: SyntaxTree.CellType DO
  11394. IF ~Indirect(type) THEN
  11395. IF RefInfo THEN Info(section,"Record") END;
  11396. Char(section, sfTypeRecord);
  11397. td := type.typeDeclaration;
  11398. IF RefInfo THEN Info(section,"TD") END;
  11399. IF (td # NIL) THEN
  11400. Global.GetSymbolSegmentedName(td,segmentedName);
  11401. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11402. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11403. ELSE
  11404. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11405. END;
  11406. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11407. Symbol(section, tir, 0, offset);
  11408. ELSE
  11409. Address(section, 0);
  11410. END;
  11411. END;
  11412. | type: SyntaxTree.PortType DO
  11413. Char(section, sfTypePORT);
  11414. IF type.direction = SyntaxTree.OutPort THEN
  11415. Char(section, sfOUT)
  11416. ELSE
  11417. Char(section, sfIN)
  11418. END;
  11419. | type: SyntaxTree.ProcedureType DO
  11420. IF ~Indirect(type) THEN
  11421. IF type.isDelegate THEN
  11422. Char(section, sfTypeDelegate);
  11423. ELSE
  11424. Char(section, sfTypeProcedure);
  11425. END;
  11426. parameter := type.firstParameter;
  11427. WHILE(parameter # NIL) DO
  11428. NParameter(parameter, -1);
  11429. parameter := parameter.nextParameter;
  11430. END;
  11431. NType(type.returnType);
  11432. END;
  11433. | type:SyntaxTree.EnumerationType DO
  11434. Char(section, sfTypeENUM);
  11435. | type: SyntaxTree.BasicType DO
  11436. WITH type: SyntaxTree.BooleanType DO
  11437. IF RefInfo THEN Info(section,"Boolean") END;
  11438. Char(section, sfTypeBOOLEAN);
  11439. | type: SyntaxTree.CharacterType DO
  11440. IF type = module.system.characterType THEN
  11441. IF RefInfo THEN Info(section,"CHAR") END;
  11442. Char(section, sfTypeCHAR);
  11443. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11444. IF RefInfo THEN Info(section,"CHAR8") END;
  11445. Char(section, sfTypeCHAR8)
  11446. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11447. IF RefInfo THEN Info(section,"CHAR16") END;
  11448. Char(section, sfTypeCHAR16);
  11449. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11450. IF RefInfo THEN Info(section,"CHAR32") END;
  11451. Char(section, sfTypeCHAR32);
  11452. ELSE
  11453. HALT(100);
  11454. END;
  11455. |type: SyntaxTree.IntegerType DO
  11456. IF type(SyntaxTree.IntegerType).signed THEN
  11457. IF (type = module.system.shortintType) THEN
  11458. IF RefInfo THEN Info(section,"SHORTINT") END;
  11459. Char(section, sfTypeSHORTINT)
  11460. ELSIF (type = module.system.integerType) THEN
  11461. IF RefInfo THEN Info(section,"INTEGER") END;
  11462. Char(section, sfTypeINTEGER)
  11463. ELSIF (type = module.system.longintType) THEN
  11464. IF RefInfo THEN Info(section,"LONGINT") END;
  11465. Char(section, sfTypeLONGINT)
  11466. ELSIF (type = module.system.hugeintType) THEN
  11467. IF RefInfo THEN Info(section,"HUGEINT") END;
  11468. Char(section, sfTypeHUGEINT)
  11469. ELSIF (type = module.system.wordType) THEN
  11470. IF RefInfo THEN Info(section,"WORD") END;
  11471. Char(section, sfTypeWORD)
  11472. ELSIF (type = module.system.longWordType) THEN
  11473. IF RefInfo THEN Info(section,"LONGWORD") END;
  11474. Char(section, sfTypeLONGWORD);
  11475. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11476. IF RefInfo THEN Info(section,"SIGNED8") END;
  11477. Char(section, sfTypeSIGNED8)
  11478. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11479. IF RefInfo THEN Info(section,"SIGNED16") END;
  11480. Char(section, sfTypeSIGNED16)
  11481. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11482. IF RefInfo THEN Info(section,"SIGNED32") END;
  11483. Char(section, sfTypeSIGNED32)
  11484. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11485. IF RefInfo THEN Info(section,"SIGNED64") END;
  11486. Char(section, sfTypeSIGNED64)
  11487. ELSE
  11488. HALT(100);
  11489. END
  11490. ELSE (* unsigned *)
  11491. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11492. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11493. Char(section, sfTypeUNSIGNED8)
  11494. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11495. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11496. Char(section, sfTypeUNSIGNED16)
  11497. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11498. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11499. Char(section, sfTypeUNSIGNED32)
  11500. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11501. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11502. Char(section, sfTypeUNSIGNED64)
  11503. ELSE
  11504. HALT(100)
  11505. END
  11506. END;
  11507. | type: SyntaxTree.FloatType DO
  11508. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11509. IF RefInfo THEN Info(section,"REAL") END;
  11510. Char(section, sfTypeREAL);
  11511. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11512. IF RefInfo THEN Info(section,"LONGREAL") END;
  11513. Char(section, sfTypeLONGREAL);
  11514. ELSE
  11515. HALT(100);
  11516. END;
  11517. |type: SyntaxTree.ComplexType DO
  11518. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11519. IF RefInfo THEN Info(section,"COMPLEX") END;
  11520. Char(section, sfTypeCOMPLEX);
  11521. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11522. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11523. Char(section, sfTypeLONGCOMPLEX);
  11524. ELSE
  11525. HALT(100);
  11526. END;
  11527. |type:SyntaxTree.SetType DO
  11528. IF RefInfo THEN Info(section,"SET") END;
  11529. Char(section, sfTypeSET);
  11530. |type:SyntaxTree.AnyType DO
  11531. IF RefInfo THEN Info(section,"ANY") END;
  11532. Char(section, sfTypeANY);
  11533. |type:SyntaxTree.ObjectType DO
  11534. IF RefInfo THEN Info(section,"OBJECT") END;
  11535. Char(section, sfTypeOBJECT);
  11536. |type:SyntaxTree.ByteType DO
  11537. IF RefInfo THEN Info(section,"BYTE") END;
  11538. Char(section, sfTypeBYTE);
  11539. |type:SyntaxTree.RangeType DO
  11540. IF RefInfo THEN Info(section,"RANGE") END;
  11541. Char(section, sfTypeRANGE)
  11542. |type:SyntaxTree.AddressType DO
  11543. IF RefInfo THEN Info(section,"ADDRESS") END;
  11544. Char(section, sfTypeADDRESS)
  11545. |type:SyntaxTree.SizeType DO
  11546. IF RefInfo THEN Info(section,"SIZE") END;
  11547. Char(section, sfTypeSIZE)
  11548. ELSE
  11549. HALT(100)
  11550. END;
  11551. ELSE HALT(101);
  11552. END;
  11553. END;
  11554. END NType;
  11555. (*
  11556. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11557. *)
  11558. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11559. VAR pos: LONGINT; type: SyntaxTree.Type;
  11560. BEGIN
  11561. IF RefInfo THEN Info(section, "Parameter") END;
  11562. Char(section, sfVariable);
  11563. Size(section, procOffset);
  11564. String0(section, parameter.name);
  11565. type := parameter.type.resolved;
  11566. IF parameter.kind = SyntaxTree.VarParameter THEN
  11567. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11568. ELSE Char(section, sfIndirect)
  11569. END;
  11570. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11571. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11572. Char(section, sfIndirect);
  11573. ELSE
  11574. Char(section, sfRelative);
  11575. END;
  11576. ELSE
  11577. Char(section, sfRelative);
  11578. END;
  11579. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11580. NType(parameter.type);
  11581. END NParameter;
  11582. (*
  11583. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11584. *)
  11585. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11586. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11587. flags: SET;
  11588. BEGIN
  11589. IF procedure.externalName # NIL THEN RETURN END;
  11590. IF RefInfo THEN Info(section, "Procedure") END;
  11591. pos := CurrentIndex();
  11592. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11593. Char(section, sfProcedure);
  11594. Size(section, scopeOffset);
  11595. String0(section,procedure.name);
  11596. s := module.allSections.FindBySymbol(procedure);
  11597. Symbol(section,s,0,0); (* start *)
  11598. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11599. flags := {};
  11600. IF procedureType.isDelegate THEN
  11601. INCL(flags, flagDelegate);
  11602. END;
  11603. IF procedure.isConstructor THEN
  11604. INCL(flags, flagConstructor);
  11605. END;
  11606. Set(section, flags);
  11607. IF RefInfo THEN Info(section, "Parameters") END;
  11608. parameter := procedureType.firstParameter;
  11609. WHILE(parameter # NIL) DO
  11610. NParameter(parameter, pos);
  11611. parameter := parameter.nextParameter;
  11612. END;
  11613. IF procedureType.returnParameter # NIL THEN
  11614. NParameter(procedureType.returnParameter, pos);
  11615. END;
  11616. IF procedureType.selfParameter # NIL THEN
  11617. NParameter(procedureType.selfParameter, pos);
  11618. END;
  11619. IF RefInfo THEN Info(section, "ReturnType") END;
  11620. NType(procedureType.returnType);
  11621. NScope(procedure.procedureScope, pos);
  11622. END NProcedure;
  11623. (*
  11624. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11625. *)
  11626. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11627. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11628. BEGIN
  11629. IF RefInfo THEN Info(section, "Variable") END;
  11630. pos := CurrentIndex();
  11631. Char(section, sfVariable);
  11632. Size(section, scopeOffset);
  11633. String0(section, variable.name);
  11634. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11635. Char(section, sfAbsolute);
  11636. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11637. NamedSymbol(section, sn,variable, 0,0);
  11638. ELSE
  11639. Char(section, sfRelative);
  11640. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11641. END;
  11642. NType(variable.type);
  11643. s := module.allSections.FindBySymbol(variable);
  11644. END NVariable;
  11645. (*
  11646. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11647. *)
  11648. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11649. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11650. BEGIN
  11651. IF typeDeclaration = NIL THEN RETURN END;
  11652. pos := CurrentIndex();
  11653. s := module.allSections.FindBySymbol(typeDeclaration);
  11654. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11655. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11656. Char(section, sfTypeDeclaration);
  11657. Size(section, scopeOffset);
  11658. String0(section, typeDeclaration.name);
  11659. declared := typeDeclaration.declaredType.resolved;
  11660. IF (declared IS SyntaxTree.PointerType) THEN
  11661. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11662. END;
  11663. WITH declared: SyntaxTree.RecordType DO
  11664. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11665. Symbol(section, s, 0, offset);
  11666. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11667. Basic.AppendToSegmentedName(name,".@Info");
  11668. s := module.allSections.FindByName(name);
  11669. IF s # NIL THEN (* does not work for coop *)
  11670. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11671. END;
  11672. NScope(declared.recordScope, pos);
  11673. |declared: SyntaxTree.CellType DO
  11674. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11675. Symbol(section, s, 0, offset);
  11676. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11677. Basic.AppendToSegmentedName(name,".@Info");
  11678. s := module.allSections.FindByName(name);
  11679. IF s # NIL THEN
  11680. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11681. END;
  11682. NScope(declared.cellScope, pos);
  11683. ELSE
  11684. Address(section, 0);
  11685. END;
  11686. END NTypeDeclaration;
  11687. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11688. VAR pos: LONGINT;
  11689. BEGIN
  11690. pos := CurrentIndex();
  11691. Char(section,sfModule);
  11692. Size(section, prevSymbol);
  11693. String0(section, module.name);
  11694. NScope(module.moduleScope, pos);
  11695. END NModule;
  11696. (*
  11697. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11698. *)
  11699. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11700. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11701. BEGIN
  11702. IF scope = NIL THEN RETURN END;
  11703. IF RefInfo THEN Info(section, "Scope") END;
  11704. Char(section, sfScopeBegin);
  11705. variable := scope.firstVariable;
  11706. WHILE (variable # NIL) DO
  11707. NVariable(variable, prevSymbol);
  11708. variable := variable.nextVariable;
  11709. END;
  11710. WITH scope: SyntaxTree.ModuleScope DO
  11711. bodyProcedure := scope.bodyProcedure;
  11712. |scope: SyntaxTree.RecordScope DO
  11713. bodyProcedure := scope.bodyProcedure;
  11714. ELSE
  11715. bodyProcedure := NIL;
  11716. END;
  11717. IF bodyProcedure # NIL THEN
  11718. NProcedure(bodyProcedure, prevSymbol)
  11719. END;
  11720. procedure := scope.firstProcedure;
  11721. WHILE procedure # NIL DO
  11722. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11723. procedure := procedure.nextProcedure;
  11724. END;
  11725. typeDeclaration := scope.firstTypeDeclaration;
  11726. WHILE typeDeclaration # NIL DO
  11727. NTypeDeclaration(typeDeclaration, prevSymbol);
  11728. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11729. END;
  11730. Char(section, sfScopeEnd); (* scope ends *)
  11731. END NScope;
  11732. BEGIN
  11733. NEW(indirectTypes, 32);
  11734. ArrayBlock(section,sizePC,"", FALSE);
  11735. startPC := section.pc;
  11736. NModule(module.module, -1);
  11737. PatchArray(section,sizePC,CurrentIndex());
  11738. END References;
  11739. (*
  11740. Command* = RECORD
  11741. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11742. name*: Name; (* name of the procedure *)
  11743. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11744. entryAdr* : ADDRESS; (* entry address of procedure *)
  11745. END;
  11746. *)
  11747. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11748. VAR
  11749. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11750. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11751. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11752. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11753. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11754. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11755. BEGIN
  11756. RETURN
  11757. (type = NIL) OR
  11758. (type.resolved IS SyntaxTree.RecordType) OR
  11759. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11760. (type.resolved IS SyntaxTree.AnyType);
  11761. END TypeAllowed;
  11762. BEGIN
  11763. numberParameters := procedureType.numberParameters;
  11764. RETURN
  11765. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11766. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11767. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11768. END GetProcedureAllowed;
  11769. PROCEDURE WriteType(type : SyntaxTree.Type);
  11770. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11771. name: Basic.SegmentedName; offset: LONGINT;
  11772. BEGIN
  11773. IF type = NIL THEN
  11774. Address(source,0);
  11775. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11776. Address(source,1);
  11777. ELSE
  11778. type := type.resolved;
  11779. IF type IS SyntaxTree.PointerType THEN
  11780. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11781. END;
  11782. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11783. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11784. name[0] := typeDeclaration.name; name[1] := -1;
  11785. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11786. ASSERT(section # NIL);
  11787. ELSE
  11788. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11789. (* TODO *)
  11790. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11791. END;
  11792. IF implementationVisitor.backend.cooperative THEN
  11793. offset := 0;
  11794. ELSE
  11795. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11796. END;
  11797. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11798. END;
  11799. END WriteType;
  11800. BEGIN
  11801. Info(source, "command array descriptor");
  11802. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11803. numberCommands := 0;
  11804. Info(source, "command array content");
  11805. FOR i := 0 TO module.allSections.Length() - 1 DO
  11806. p := module.allSections.GetSection(i);
  11807. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11808. procedure := p.symbol(SyntaxTree.Procedure);
  11809. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11810. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11811. procedure.GetName(name);
  11812. Name(source,name);
  11813. numberParameters := procedureType.numberParameters;
  11814. (* offset of type of first parameter *)
  11815. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11816. ELSE WriteType(procedureType.firstParameter.type)
  11817. END;
  11818. (* offset of type of return parameter *)
  11819. WriteType(procedureType.returnType);
  11820. (* command name *)
  11821. (* command code offset *)
  11822. Symbol(source,p,0,0);
  11823. INC(numberCommands);
  11824. IF Trace THEN
  11825. D.Ln;
  11826. END;
  11827. END;
  11828. END
  11829. END;
  11830. PatchArray(source,sizePC,numberCommands);
  11831. END CommandArray;
  11832. (* to prevent from double import of different module aliases *)
  11833. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11834. VAR i: SyntaxTree.Import;
  11835. BEGIN
  11836. i := module.module.moduleScope.firstImport;
  11837. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11838. i := i.nextImport;
  11839. END;
  11840. RETURN i = import
  11841. END IsFirstDirectOccurence;
  11842. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11843. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11844. BEGIN
  11845. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11846. ArrayBlock(source,pc,"", FALSE);
  11847. Info(source, "import module array data");
  11848. IF implementationVisitor.backend.cooperative THEN
  11849. offset := 0;
  11850. ELSE
  11851. IF module.system.addressType.sizeInBits = 64 THEN
  11852. (* change this when Heaps.HeapBlock is modified *)
  11853. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11854. ELSE
  11855. (* change this when Heaps.HeapBlock is modified *)
  11856. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11857. END;
  11858. END;
  11859. import := module.module.moduleScope.firstImport;
  11860. numberImports := 0;
  11861. WHILE import # NIL DO
  11862. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11863. Global.GetModuleSegmentedName(import.module,name);
  11864. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11865. NamedSymbol(source, name, NIL, 0, offset);
  11866. INC(numberImports);
  11867. END;
  11868. import := import.nextImport
  11869. END;
  11870. PatchArray(source,pc,numberImports);
  11871. END ImportsArray;
  11872. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11873. VAR
  11874. p: Sections.Section; sizePC, size, i: LONGINT;
  11875. BEGIN
  11876. Info(source, "Type info section");
  11877. size := 0;
  11878. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11879. FOR i := 0 TO module.allSections.Length() - 1 DO
  11880. p := module.allSections.GetSection(i);
  11881. WITH p: IntermediateCode.Section DO
  11882. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11883. Symbol(source,p,EmptyBlockOffset,0);
  11884. INC(size);
  11885. END;
  11886. END
  11887. END;
  11888. PatchArray(source,sizePC,size);
  11889. END TypeInfoSection;
  11890. (*
  11891. ProcTableEntry* = RECORD
  11892. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11893. noPtr*: LONGINT;
  11894. END;
  11895. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11896. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11897. *)
  11898. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11899. VAR
  11900. numberPointers: LONGINT;
  11901. procedure: SyntaxTree.Procedure;
  11902. BEGIN
  11903. Info(section,"pcFrom");
  11904. Symbol(section,procedureSection,0,0);
  11905. Info(section,"pcTo");
  11906. Symbol(section, procedureSection, procedureSection.pc, 0);
  11907. Info(section,"pointer to offsets array");
  11908. Symbol(section, section,section.pc+1,0);
  11909. Info(section,"offsets array");
  11910. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11911. PointerArray(section, procedure.procedureScope, numberPointers);
  11912. END ProcedureDescriptor;
  11913. (* only for tracing, the descriptor is otherwise not complete ! *)
  11914. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11915. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11916. BEGIN
  11917. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11918. name := procedureSection.name;
  11919. Basic.AppendToSegmentedName(name,".@Info");
  11920. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11921. Address(section,0);
  11922. Symbol(section,section,2,0);
  11923. (*
  11924. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11925. descSize: SIZE;
  11926. sentinel: ADDRESS; (* = MPO-4 *)
  11927. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11928. flags*: SET;
  11929. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11930. name*: Name;
  11931. END;
  11932. *)
  11933. Size(section, 0);
  11934. Address(section,0);
  11935. Address(section,0);
  11936. Set(section,{});
  11937. moduleSection := ModuleSection();
  11938. Symbol( section, moduleSection, moduleSection.pc,0);
  11939. IF procedureSection.symbol = NIL THEN
  11940. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11941. ELSE
  11942. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11943. END;
  11944. Name(section, infoName);
  11945. Size(section, 0);
  11946. RETURN section;
  11947. END MakeProcedureDescriptorTag;
  11948. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11949. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11950. BEGIN
  11951. name := procedureSection.name;
  11952. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11953. IF implementationVisitor.backend.cooperative THEN
  11954. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11955. Info(section, "TypeDescriptor");
  11956. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11957. NamedSymbol(dest, name,NIL, 0, 0);
  11958. BaseRecord(dest);
  11959. offset := 0;
  11960. ELSIF CreateProcedureDescInfo THEN
  11961. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11962. Address(dest,0);
  11963. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11964. offset := dest.pc;
  11965. ELSE
  11966. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11967. END;
  11968. ProcedureDescriptor(dest, procedureSection);
  11969. Symbol(section, dest, offset, 0);
  11970. END ProcedureDescriptorPointer;
  11971. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11972. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11973. BEGIN
  11974. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11975. numberProcs := 0;
  11976. FOR i := 0 TO module.allSections.Length() - 1 DO
  11977. destination := module.allSections.GetSection(i);
  11978. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11979. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11980. INC(numberProcs);
  11981. END
  11982. END;
  11983. PatchArray(section, sizePC, numberProcs);
  11984. END ProcedureDescriptorArray;
  11985. (*
  11986. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11987. VAR
  11988. next*: Module; (** once a module is published, all fields are read-only *)
  11989. name*: Name;
  11990. init, published: BOOLEAN;
  11991. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11992. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11993. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11994. command*: POINTER TO ARRAY OF Command;
  11995. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11996. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11997. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11998. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11999. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  12000. data*, code*: Bytes;
  12001. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  12002. export*: ExportDesc;
  12003. term*: TerminationHandler;
  12004. exTable*: ExceptionTable;
  12005. noProcs*: LONGINT;
  12006. firstProc*: ADDRESS; <- done by loader
  12007. maxPtrs*: LONGINT;
  12008. crc*: LONGINT;
  12009. *)
  12010. PROCEDURE BasePointer (section: IntermediateCode.Section);
  12011. BEGIN
  12012. Info(section, "cycle");
  12013. Size(section,0);
  12014. Info(section, "references");
  12015. Size(section,0);
  12016. Info(section, "nextMarked");
  12017. Address(section,0);
  12018. Info(section, "nextWatched");
  12019. Address(section,0);
  12020. END BasePointer;
  12021. PROCEDURE BaseObject (section: IntermediateCode.Section);
  12022. BEGIN
  12023. BasePointer(section);
  12024. Info(section, "action");
  12025. Address(section,0);
  12026. Info(section, "monitor");
  12027. Address(section,0);
  12028. END BaseObject;
  12029. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  12030. BEGIN
  12031. BasePointer(section);
  12032. Info(section, "action");
  12033. Address(section,0);
  12034. Info(section, "monitor");
  12035. Address(section,0);
  12036. END BaseRecord;
  12037. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12038. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12039. pooledName: Basic.SegmentedName;
  12040. symbol: SyntaxTree.Symbol;
  12041. BEGIN
  12042. Global.GetModuleName(module.module,name);
  12043. Strings.Append(name,".@Module.@Descriptor");
  12044. Basic.ToSegmentedName(name, pooledName);
  12045. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12046. Symbol(section,descriptorSection,0,0);
  12047. Info(descriptorSection, "descriptor");
  12048. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12049. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12050. Address(descriptorSection,0);
  12051. Global.GetModuleName(module.module,name);
  12052. Strings.Append(name,".@Trace");
  12053. Basic.ToSegmentedName(name, pooledName);
  12054. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12055. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12056. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12057. END ModuleDescriptor;
  12058. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12059. VAR name: ARRAY 128 OF CHAR;
  12060. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12061. symbol: SyntaxTree.Symbol;
  12062. BEGIN
  12063. ASSERT(implementationVisitor.backend.newObjectFile);
  12064. Global.GetModuleName(module.module,name);
  12065. Strings.Append(name,".@Module");
  12066. Basic.ToSegmentedName(name, pooledName);
  12067. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12068. moduleSection.SetExported(TRUE);
  12069. IF moduleSection.pc = 0 THEN
  12070. IF implementationVisitor.backend.cooperative THEN
  12071. Info(moduleSection, "descriptor");
  12072. ModuleDescriptor(moduleSection);
  12073. BaseObject(moduleSection);
  12074. implementationVisitor.CreateTraceModuleMethod(module.module);
  12075. ELSE
  12076. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12077. Info(moduleSection, "HeapBlock");
  12078. Symbol(moduleSection,moduleSection,2,0);
  12079. Info(moduleSection, "TypeDescriptor");
  12080. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12081. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12082. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12083. END;
  12084. END;
  12085. RETURN moduleSection;
  12086. END ModuleSection;
  12087. PROCEDURE NewModuleInfo();
  12088. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12089. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12090. sectionName: Basic.SectionName;
  12091. CONST MPO=-40000000H;
  12092. BEGIN
  12093. (*
  12094. TypeDesc* = POINTER TO RECORD
  12095. descSize: SIZE;
  12096. sentinel: LONGINT; (* = MPO-4 *)
  12097. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12098. flags*: SET;
  12099. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12100. name*: Name;
  12101. refsOffset: SIZE;
  12102. END;
  12103. *)
  12104. (*name is missing prefixes sometimes*)
  12105. Global.GetModuleSegmentedName(module.module,name);
  12106. Basic.AppendToSegmentedName(name,".@Info");
  12107. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12108. IF ~implementationVisitor.backend.cooperative THEN
  12109. Info(source, "HeapBlock");
  12110. Address(source,0); (* an empty heap block prevents GC marking *)
  12111. Info(source, "TypeDescriptor");
  12112. Address(source,0);
  12113. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12114. END;
  12115. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12116. Address(source,MPO-4);
  12117. Info(source, "type tag pointer");
  12118. Address( source,0);
  12119. Info(source, "type flags");
  12120. flags := {};
  12121. Set( source, flags);
  12122. Info(source, "pointer to module");
  12123. moduleSection := ModuleSection();
  12124. Symbol( source, moduleSection, moduleSection.pc,0);
  12125. Info(source, "type name");
  12126. i := 0;
  12127. sectionName := "@Self";
  12128. (*
  12129. Global.GetSymbolSegmentedName(td,name);
  12130. Basic.SegmentedNameToString(name, sectionName);
  12131. *)
  12132. Name(source,sectionName);
  12133. patchInfoPC := source.pc;
  12134. Size(source, 0);
  12135. END NewModuleInfo;
  12136. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12137. VAR
  12138. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12139. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12140. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12141. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  12142. referenceSectionOffset : LONGINT;
  12143. name: Basic.SegmentedName; offset: LONGINT;
  12144. flags: SET;
  12145. BEGIN
  12146. NewModuleInfo();
  12147. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12148. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12149. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12150. ImportsArray(importSection);
  12151. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12152. CommandArray(commandsSection);
  12153. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12154. ExceptionArray(exceptionSection);
  12155. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12156. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12157. TypeInfoSection(typeInfoSection);
  12158. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12159. referenceSection.SetExported(TRUE);
  12160. References(referenceSection);
  12161. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12162. ProcedureDescriptorArray(procTableSection, numberProcs);
  12163. IF ProtectModulesPointers THEN
  12164. name := "Heaps.AnyPtr";
  12165. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12166. (* set base pointer *)
  12167. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12168. END;
  12169. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12170. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12171. moduleSection := ModuleSection();
  12172. Info(moduleSection, "nextRoot*: RootObject");
  12173. Address(moduleSection,0);
  12174. Info(moduleSection, "next*: Module");
  12175. Address(moduleSection,0);
  12176. Info(moduleSection, "name*: Name");
  12177. Name(moduleSection,moduleName);
  12178. Info(moduleSection, "init, published: BOOLEAN");
  12179. Boolean(moduleSection,FALSE);
  12180. Boolean(moduleSection,FALSE);
  12181. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12182. Boolean(moduleSection,FALSE);
  12183. Boolean(moduleSection,FALSE);
  12184. Info(moduleSection, "refcnt*: LONGINT");
  12185. Longint(moduleSection,0);
  12186. Info(moduleSection, "sb*: ADDRESS");
  12187. Address(moduleSection,0);
  12188. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12189. Address(moduleSection,0);
  12190. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12191. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12192. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12193. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12194. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12195. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12196. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12197. Symbol(moduleSection,importSection,importSectionOffset,0);
  12198. Info(moduleSection, "procTable*: ProcTable");
  12199. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12200. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12201. Address(moduleSection,0);
  12202. Address(moduleSection,0);
  12203. Address(moduleSection,0);
  12204. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12205. Info(moduleSection, "export*: ExportDesc");
  12206. ExportDesc(moduleSection);
  12207. Info(moduleSection, "term*: TerminationHandler");
  12208. Address(moduleSection,0);
  12209. Info(moduleSection, "exTable*: ExceptionTable");
  12210. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12211. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12212. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12213. Info(moduleSection, "crc*: LONGINT");
  12214. patchCRC:= moduleSection.pc;
  12215. Longint(moduleSection, 0); (*! must be implemented *)
  12216. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12217. Info(moduleSection, "body*: ADDRESS");
  12218. Symbol(moduleSection, bodyProc, 0,0);
  12219. Info(moduleSection, "module flags");
  12220. flags := {};
  12221. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12222. Set( moduleSection, flags);
  12223. IF implementationVisitor.backend.cooperative THEN
  12224. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12225. Info(moduleSection, "monitor.owner");
  12226. Address(moduleSection,0);
  12227. Info(moduleSection, "monitor.nestingLevel");
  12228. Address(moduleSection,0);
  12229. Info(moduleSection, "monitor.blockedQueue");
  12230. Address(moduleSection,0); Address(moduleSection,0);
  12231. Info(moduleSection, "monitor.waitingQueue");
  12232. Address(moduleSection,0); Address(moduleSection,0);
  12233. Info(moduleSection, "monitor.waitingSentinel");
  12234. Address(moduleSection,0);
  12235. END;
  12236. END Module;
  12237. PROCEDURE PatchCRC(crc: LONGINT);
  12238. BEGIN
  12239. IF implementationVisitor.newObjectFile & ~simple THEN
  12240. PatchLongint(ModuleSection(), patchCRC, crc);
  12241. END;
  12242. END PatchCRC;
  12243. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12244. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12245. BEGIN
  12246. ArrayBlock(source,pc,"",FALSE);
  12247. Info(source, "pointer offsets array data");
  12248. IF scope IS SyntaxTree.RecordScope THEN
  12249. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12250. ELSIF scope IS SyntaxTree.CellScope THEN
  12251. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12252. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12253. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12254. WHILE variable # NIL DO
  12255. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12256. symbol := module.allSections.FindBySymbol(variable);
  12257. ASSERT(symbol # NIL);
  12258. Pointers(0,symbol, source,variable.type,numberPointers);
  12259. END;
  12260. variable := variable.nextVariable;
  12261. END;
  12262. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12263. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12264. WHILE parameter # NIL DO
  12265. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12266. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12267. END;
  12268. parameter := parameter.nextParameter;
  12269. END;
  12270. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12271. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12272. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12273. IF implementationVisitor.backend.preciseGC THEN
  12274. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12275. END;
  12276. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12277. END;
  12278. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12279. WHILE(variable # NIL) DO
  12280. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12281. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12282. END;
  12283. variable := variable.nextVariable
  12284. END;
  12285. END;
  12286. PatchArray(source,pc,numberPointers);
  12287. END PointerArray;
  12288. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12289. VAR
  12290. name: Basic.SegmentedName;
  12291. section: IntermediateCode.Section;
  12292. BEGIN
  12293. ASSERT(implementationVisitor.newObjectFile);
  12294. Global.GetSymbolSegmentedName(symbol,name);
  12295. Basic.AppendToSegmentedName(name,suffix);
  12296. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12297. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12298. Info(section, "HeapBlock");
  12299. Address(section,0); (* empty such that GC does not go on traversing *)
  12300. Info(section, suffix);
  12301. Address(section,0);
  12302. pc := section.pc;
  12303. RETURN section;
  12304. END SymbolSection;
  12305. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12306. VAR recordType: SyntaxTree.RecordType;
  12307. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12308. section: Sections.Section; cellType: SyntaxTree.CellType;
  12309. tdInfoOffset: LONGINT;
  12310. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12311. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12312. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12313. sectionName: Basic.SectionName;
  12314. CONST MPO=-40000000H;
  12315. BEGIN
  12316. (*
  12317. TypeDesc* = POINTER TO RECORD
  12318. descSize: SIZE;
  12319. sentinel: LONGINT; (* = MPO-4 *)
  12320. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12321. flags*: SET;
  12322. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12323. name*: Name;
  12324. refsOffset: SIZE;
  12325. END;
  12326. *)
  12327. (* source := module.sections.FindByName(...) *)
  12328. Global.GetSymbolSegmentedName(td,name);
  12329. Basic.AppendToSegmentedName(name,".@Info");
  12330. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12331. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12332. Address(source,0);
  12333. Info(source, "TypeDescriptor");
  12334. Address(source,0);
  12335. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12336. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12337. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12338. Info(source, "type tag pointer");
  12339. Symbol( source, tag, offset, 0);
  12340. Info(source, "type flags");
  12341. flags := {};
  12342. IF isProtected THEN INCL(flags,31) END;
  12343. Set( source, flags);
  12344. Info(source, "pointer to module");
  12345. moduleSection := ModuleSection();
  12346. Symbol( source, moduleSection, moduleSection.pc,0);
  12347. Info(source, "type name");
  12348. i := 0;
  12349. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12350. (*
  12351. Global.GetSymbolSegmentedName(td,name);
  12352. Basic.SegmentedNameToString(name, sectionName);
  12353. *)
  12354. Name(source,sectionName);
  12355. Size(source, 0);
  12356. RETURN source;
  12357. END NewTypeDescriptorInfo;
  12358. PROCEDURE NewTypeDescriptor;
  12359. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12360. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12361. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12362. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12363. CONST MPO=-40000000H;
  12364. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12365. VAR i: LONGINT;
  12366. PROCEDURE Td(record: SyntaxTree.RecordType);
  12367. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12368. BEGIN
  12369. IF record # NIL THEN
  12370. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12371. baseTD := record.typeDeclaration;
  12372. Global.GetSymbolSegmentedName(baseTD,name);
  12373. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12374. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12375. ELSE
  12376. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12377. END;
  12378. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12379. Symbol(source, tir, 0, offset);
  12380. IF reverse THEN Td(record.GetBaseRecord()) END;
  12381. END;
  12382. END Td;
  12383. BEGIN
  12384. Info(source, "tag table");
  12385. baseRecord := recordType;
  12386. i := 0;
  12387. WHILE baseRecord # NIL DO
  12388. INC(i);
  12389. baseRecord := baseRecord.GetBaseRecord();
  12390. END;
  12391. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12392. IF ~reverse THEN Td(recordType) END;
  12393. WHILE i < size DO
  12394. Address(source,0);
  12395. INC(i);
  12396. END;
  12397. IF reverse THEN Td(recordType) END;
  12398. END TdTable;
  12399. PROCEDURE MethodTable(reverse: BOOLEAN);
  12400. VAR i,methods: LONGINT;
  12401. BEGIN
  12402. Info(source, "method table");
  12403. IF recordType # NIL THEN
  12404. methods := recordType.recordScope.numberMethods;
  12405. IF reverse THEN
  12406. FOR i := methods-1 TO 0 BY -1 DO
  12407. procedure := recordType.recordScope.FindMethod(i);
  12408. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12409. NamedSymbol(source, name,procedure, 0,0);
  12410. END;
  12411. ELSE
  12412. FOR i := 0 TO methods-1 DO
  12413. procedure := recordType.recordScope.FindMethod(i);
  12414. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12415. NamedSymbol(source, name,procedure, 0,0);
  12416. END;
  12417. END;
  12418. END;
  12419. END MethodTable;
  12420. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12421. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12422. BEGIN
  12423. Info(source, "method table");
  12424. baseRecord := recordType;
  12425. WHILE baseRecord.baseType # NIL DO
  12426. baseRecord := baseRecord.GetBaseRecord ();
  12427. END;
  12428. GetRecordTypeName (baseRecord, name);
  12429. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12430. IF name = stackFrame THEN
  12431. start := 0;
  12432. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12433. baseRecord := recordType;
  12434. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12435. baseRecord := baseRecord.GetBaseRecord ();
  12436. END;
  12437. IF baseRecord # NIL THEN
  12438. GetRecordTypeName (baseRecord, name);
  12439. IF pointer & ~baseRecord.isObject THEN
  12440. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12441. END;
  12442. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12443. ELSIF recordType.isObject THEN
  12444. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12445. ELSIF pointer THEN
  12446. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12447. ELSE
  12448. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12449. END;
  12450. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12451. Symbol(source, tir, 0, 0);
  12452. start := 0;
  12453. baseRecord := recordType;
  12454. WHILE (baseRecord # NIL) DO
  12455. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12456. baseRecord := baseRecord.GetBaseRecord ();
  12457. END;
  12458. ELSE
  12459. (* explicit trace method: *)
  12460. procedure := recordType.recordScope.FindMethod(0);
  12461. IF ~procedure.isFinalizer THEN
  12462. Global.GetSymbolSegmentedName(procedure, name);
  12463. NamedSymbol(source, name,procedure, 0,0);
  12464. END;
  12465. start := 1;
  12466. END;
  12467. IF (name # stackFrame) & recordType.isObject THEN
  12468. baseRecord := recordType;
  12469. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12470. baseRecord := baseRecord.GetBaseRecord ();
  12471. END;
  12472. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12473. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12474. ELSE
  12475. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12476. END;
  12477. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12478. Symbol(source, tir, 0, 0);
  12479. END;
  12480. methods := recordType.recordScope.numberMethods;
  12481. FOR i := start TO methods-1 DO
  12482. procedure := recordType.recordScope.FindMethod(i);
  12483. IF ~procedure.isFinalizer THEN
  12484. Global.GetSymbolSegmentedName(procedure, name);
  12485. NamedSymbol(source, name,procedure, 0,0);
  12486. END;
  12487. END;
  12488. END CooperativeMethodTable;
  12489. BEGIN
  12490. Global.GetSymbolSegmentedName(td,name);
  12491. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12492. source.SetExported(IsExported(td));
  12493. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12494. IF implementationVisitor.backend.cooperative THEN
  12495. base := NIL;
  12496. baseRecord := recordType.GetBaseRecord();
  12497. IF baseRecord # NIL THEN
  12498. baseTD := baseRecord.typeDeclaration;
  12499. END;
  12500. IF ~recordType.isObject THEN
  12501. Info(source, "parent");
  12502. IF baseRecord # NIL THEN
  12503. Global.GetSymbolSegmentedName(baseTD,name);
  12504. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12505. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12506. ELSE
  12507. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12508. END;
  12509. Symbol(source, tir, 0, 0);
  12510. ELSE
  12511. Address(source,0);
  12512. END;
  12513. Info(source, "record size");
  12514. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12515. CooperativeMethodTable(FALSE);
  12516. base := source;
  12517. Global.GetSymbolSegmentedName(td,name);
  12518. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12519. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12520. source.SetExported(IsExported(td));
  12521. END;
  12522. Info(source, "parent");
  12523. IF baseRecord # NIL THEN
  12524. Global.GetSymbolSegmentedName(baseTD,name);
  12525. sym := baseTD;
  12526. IF ~recordType.isObject THEN
  12527. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12528. sym := NIL;
  12529. END;
  12530. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12531. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12532. ELSE
  12533. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12534. END;
  12535. Symbol(source, tir, 0, 0);
  12536. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12537. Address(source,0);
  12538. ELSE
  12539. IF recordType.isObject THEN
  12540. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12541. ELSE
  12542. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12543. END;
  12544. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12545. Symbol(source, tir, 0, 0);
  12546. END;
  12547. Info(source, "base record descriptor");
  12548. Symbol(source, base, 0, 0);
  12549. CooperativeMethodTable(TRUE);
  12550. IF recordType.hasPointers THEN
  12551. IF ~HasExplicitTraceMethod (recordType) THEN
  12552. implementationVisitor.CreateTraceMethod(recordType);
  12553. END;
  12554. implementationVisitor.CreateResetProcedure(recordType);
  12555. implementationVisitor.CreateAssignProcedure(recordType);
  12556. END;
  12557. ELSIF ~simple THEN
  12558. (*
  12559. MethodEnd = MPO
  12560. ---
  12561. methods (# methods)
  12562. ---
  12563. tags (16)
  12564. ---
  12565. TypeDesc = TypeInfoAdr
  12566. ---
  12567. td adr ---> rec size
  12568. ----
  12569. pointer offsets
  12570. ----
  12571. (padding)
  12572. -----
  12573. empty [2 addresses aligned]
  12574. empty
  12575. empty
  12576. numPtrs
  12577. ---
  12578. pointer offsets
  12579. ---
  12580. *)
  12581. Info(source, "MethodEnd = MPO");
  12582. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12583. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12584. MethodTable(TRUE);
  12585. TdTable(TypeTags, TRUE);
  12586. Info(source, "type descriptor info pointer");
  12587. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12588. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12589. IF (cellType # NIL) THEN
  12590. IF cellType.sizeInBits < 0 THEN
  12591. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12592. END;
  12593. Info(source, "cell size");
  12594. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12595. ELSE
  12596. Info(source, "record size");
  12597. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12598. END;
  12599. Info(source, "pointer offsets pointer");
  12600. padding := 1- source.pc MOD 2;
  12601. Symbol(source, source, source.pc+1+padding,0);
  12602. IF padding >0 THEN
  12603. Info(source, "padding");
  12604. FOR i := 1 TO padding DO Address(source,0) END;
  12605. END;
  12606. IF cellType # NIL THEN
  12607. PointerArray(source, cellType.cellScope, numberPointers);
  12608. ELSE
  12609. PointerArray(source, recordType.recordScope, numberPointers);
  12610. END;
  12611. ELSE
  12612. (*
  12613. simple:
  12614. td adr --> size
  12615. tag(1)
  12616. tag(2)
  12617. tag(3)
  12618. methods ->
  12619. *)
  12620. Info(source, "record size");
  12621. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12622. TdTable(TypeTags, FALSE);
  12623. MethodTable(FALSE);
  12624. END;
  12625. END NewTypeDescriptor;
  12626. BEGIN
  12627. x := x.resolved;
  12628. IF (x IS SyntaxTree.PointerType) THEN
  12629. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12630. END;
  12631. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12632. recordType := x(SyntaxTree.RecordType);
  12633. td := x.typeDeclaration;
  12634. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12635. ASSERT(td # NIL);
  12636. section := module.allSections.FindBySymbol(td); (* TODO *)
  12637. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12638. IF implementationVisitor.newObjectFile THEN
  12639. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12640. NewTypeDescriptor
  12641. END;
  12642. ELSE
  12643. (* data section in intermediate code *)
  12644. Global.GetSymbolSegmentedName(td,name);
  12645. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  12646. Basic.SuffixSegmentedName (name, module.module.name);
  12647. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  12648. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  12649. tir.Emit(Data(Basic.invalidPosition,op));
  12650. END;
  12651. END;
  12652. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12653. cellType := x(SyntaxTree.CellType);
  12654. td := x.typeDeclaration;
  12655. section := module.allSections.FindBySymbol(td); (* TODO *)
  12656. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12657. IF implementationVisitor.newObjectFile THEN
  12658. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12659. NewTypeDescriptor
  12660. END;
  12661. END;
  12662. END;
  12663. END
  12664. END CheckTypeDeclaration
  12665. END MetaDataGenerator;
  12666. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12667. VAR
  12668. trace-: BOOLEAN;
  12669. traceString-: SyntaxTree.IdentifierString;
  12670. traceModuleName-: SyntaxTree.IdentifierString;
  12671. newObjectFile-: BOOLEAN;
  12672. profile-: BOOLEAN;
  12673. noRuntimeChecks: BOOLEAN;
  12674. simpleMetaData-: BOOLEAN;
  12675. noAsserts: BOOLEAN;
  12676. optimize-: BOOLEAN;
  12677. cooperative-: BOOLEAN;
  12678. preregisterStatic-: BOOLEAN;
  12679. dump-: Basic.Writer;
  12680. cellsAreObjects: BOOLEAN;
  12681. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12682. experiment: BOOLEAN;
  12683. PROCEDURE &InitIntermediateBackend*;
  12684. BEGIN
  12685. simpleMetaData := FALSE;
  12686. newObjectFile := FALSE;
  12687. InitBackend;
  12688. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12689. SetTraceModuleName(DefaultTraceModuleName);
  12690. END InitIntermediateBackend;
  12691. (* must be overwritten by actual backend, if parameter registers should be used *)
  12692. PROCEDURE NumberParameterRegisters*(callingConvention: SyntaxTree.CallingConvention): SIZE;
  12693. BEGIN
  12694. RETURN 0; (* default case: no parameter registers *)
  12695. END NumberParameterRegisters;
  12696. (* must be overwritten by actual backend, if parameter registers should be used *)
  12697. PROCEDURE ParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; index: LONGINT): LONGINT;
  12698. BEGIN
  12699. HALT(100); (* abstract *)
  12700. END ParameterRegister;
  12701. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12702. VAR
  12703. declarationVisitor: DeclarationVisitor;
  12704. implementationVisitor: ImplementationVisitor;
  12705. module: Sections.Module;
  12706. name, platformName: SyntaxTree.IdentifierString;
  12707. meta: MetaDataGenerator;
  12708. crc: CRC.CRC32Stream;
  12709. BEGIN
  12710. ResetError;
  12711. Global.GetSymbolName(x,name);
  12712. NEW(module,x,system); (* backend structures *)
  12713. Global.GetModuleName(x, name);
  12714. module.SetModuleName(name);
  12715. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF, newObjectFile);
  12716. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12717. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12718. declarationVisitor.Module(x,module);
  12719. IF newObjectFile & ~meta.simple THEN
  12720. meta.Module(implementationVisitor.moduleBodySection);
  12721. END;
  12722. GetDescription(platformName);
  12723. module.SetPlatformName(platformName);
  12724. IF newObjectFile THEN
  12725. NEW(crc);
  12726. module.allSections.WriteRaw(crc);
  12727. crc.Update;
  12728. meta.PatchCRC(crc.GetCRC());
  12729. END;
  12730. RETURN module
  12731. END GenerateIntermediate;
  12732. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12733. BEGIN RETURN TRUE
  12734. END SupportedImmediate;
  12735. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12736. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12737. END ProcessSyntaxTreeModule;
  12738. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12739. VAR
  12740. result: Sections.Module;
  12741. traceName: Basic.MessageString;
  12742. BEGIN
  12743. ASSERT(intermediateCodeModule IS Sections.Module);
  12744. result := intermediateCodeModule(Sections.Module);
  12745. IF trace THEN
  12746. traceName := "intermediate code trace: ";
  12747. Strings.Append(traceName,traceString);
  12748. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12749. IF (traceString="") OR (traceString="*") THEN
  12750. result.Dump(dump);
  12751. dump.Update
  12752. ELSE
  12753. Sections.DumpFiltered(dump, result, traceString);
  12754. END
  12755. END;
  12756. RETURN result
  12757. END ProcessIntermediateCodeModule;
  12758. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12759. BEGIN instructionSet := "Intermediate";
  12760. END GetDescription;
  12761. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  12762. BEGIN
  12763. SELF.newObjectFile := newObjectFile;
  12764. SELF.simpleMetaData := simpleMetaData;
  12765. END SetNewObjectFile;
  12766. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12767. BEGIN COPY(name, traceModuleName)
  12768. END SetTraceModuleName;
  12769. PROCEDURE DefineOptions*(options: Options.Options);
  12770. BEGIN
  12771. DefineOptions^(options);
  12772. options.Add(0X,"trace",Options.String);
  12773. options.Add(0X,"builtinsModule",Options.String);
  12774. options.Add(0X,"newObjectFile",Options.Flag);
  12775. options.Add(0X,"traceModule",Options.String);
  12776. options.Add(0X,"profile",Options.Flag);
  12777. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12778. options.Add(0X,"noAsserts",Options.Flag);
  12779. options.Add(0X,"metaData",Options.String);
  12780. options.Add('o',"optimize", Options.Flag);
  12781. options.Add(0X,"preregisterStatic", Options.Flag);
  12782. options.Add(0X,"cellsAreObjects", Options.Flag);
  12783. options.Add(0X,"preciseGC", Options.Flag);
  12784. options.Add(0X,"trackLeave", Options.Flag);
  12785. options.Add(0X,"writeBarriers", Options.Flag);
  12786. options.Add(0X,"experiment", Options.Flag);
  12787. END DefineOptions;
  12788. PROCEDURE GetOptions*(options: Options.Options);
  12789. VAR name,string: SyntaxTree.IdentifierString;
  12790. BEGIN
  12791. GetOptions^(options);
  12792. trace := options.GetString("trace",traceString);
  12793. profile := options.GetFlag("profile");
  12794. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12795. noAsserts := options.GetFlag("noAsserts");
  12796. cooperative := options.GetFlag("cooperative");
  12797. newObjectFile := options.GetFlag("newObjectFile");
  12798. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12799. simpleMetaData := TRUE
  12800. END;
  12801. IF options.GetString("metaData",string) THEN
  12802. IF string = "simple" THEN simpleMetaData := TRUE
  12803. ELSIF string ="full" THEN simpleMetaData := FALSE
  12804. END;
  12805. END;
  12806. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12807. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12808. optimize := options.GetFlag("optimize");
  12809. preregisterStatic := options.GetFlag("preregisterStatic");
  12810. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12811. preciseGC := options.GetFlag("preciseGC");
  12812. trackLeave := options.GetFlag("trackLeave");
  12813. writeBarriers := options.GetFlag("writeBarriers");
  12814. experiment := options.GetFlag("experiment");
  12815. END GetOptions;
  12816. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12817. BEGIN RETURN SymbolFileFormat.Get()
  12818. END DefaultSymbolFileFormat;
  12819. END IntermediateBackend;
  12820. (* ----------------------------------- register allocation ------------------------------------- *)
  12821. (* register mapping scheme
  12822. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12823. spill offset
  12824. part(n) --> ticket <--> physical register
  12825. spill offset
  12826. *)
  12827. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12828. emptyOperand: IntermediateCode.Operand;
  12829. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12830. statCoopResetVariables: LONGINT;
  12831. statCoopModifyAssignments: LONGINT;
  12832. modifyAssignmentsPC : LONGINT;
  12833. statCoopNilCheck: LONGINT;
  12834. statCoopSwitch: LONGINT;
  12835. statCoopAssignProcedure: LONGINT;
  12836. statCoopTraceMethod: LONGINT;
  12837. statCoopResetProcedure: LONGINT;
  12838. statCoopTraceModule: LONGINT;
  12839. PROCEDURE ResetStatistics*;
  12840. BEGIN
  12841. statCoopResetVariables := 0;
  12842. statCoopModifyAssignments := 0;
  12843. statCoopNilCheck:= 0;
  12844. statCoopSwitch:= 0;
  12845. statCoopAssignProcedure:= 0;
  12846. statCoopTraceMethod:= 0;
  12847. statCoopResetProcedure:= 0;
  12848. statCoopTraceModule:= 0;
  12849. END ResetStatistics;
  12850. PROCEDURE Statistics*;
  12851. BEGIN
  12852. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12853. TRACE(statCoopNilCheck, statCoopSwitch);
  12854. TRACE(statCoopAssignProcedure,
  12855. statCoopTraceMethod,
  12856. statCoopResetProcedure,
  12857. statCoopTraceModule)
  12858. END Statistics;
  12859. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12860. VAR h: LONGINT;
  12861. BEGIN
  12862. WHILE b # 0 DO
  12863. h := a MOD b;
  12864. a := b;
  12865. b := h;
  12866. END;
  12867. RETURN a
  12868. END GCD;
  12869. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12870. BEGIN
  12871. RETURN a*b DIV GCD(a,b)
  12872. END SCM;
  12873. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12874. BEGIN
  12875. (*TRACE(a,b);*)
  12876. IF a = 0 THEN RETURN b
  12877. ELSIF b = 0 THEN RETURN a
  12878. ELSE RETURN SCM(a,b)
  12879. END;
  12880. END CommonAlignment;
  12881. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12882. BEGIN
  12883. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12884. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12885. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12886. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12887. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12888. END
  12889. END PassBySingleReference;
  12890. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12891. BEGIN
  12892. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12893. END PassInRegister;
  12894. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12895. VAR new: RegisterEntry;
  12896. BEGIN
  12897. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12898. IF queue = NIL THEN
  12899. queue := new
  12900. ELSE
  12901. new.next := queue;
  12902. IF queue#NIL THEN queue.prev := new END;
  12903. queue := new
  12904. END;
  12905. END AddRegisterEntry;
  12906. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12907. VAR this: RegisterEntry;
  12908. BEGIN
  12909. this := queue;
  12910. WHILE (this # NIL) & (this.register # register) DO
  12911. this := this.next;
  12912. END;
  12913. IF this = NIL THEN
  12914. RETURN FALSE
  12915. END;
  12916. ASSERT(this # NIL);
  12917. IF this = queue THEN queue := queue.next END;
  12918. IF this.prev # NIL THEN this.prev.next := this.next END;
  12919. IF this.next # NIL THEN this.next.prev := this.prev END;
  12920. RETURN TRUE
  12921. END RemoveRegisterEntry;
  12922. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12923. BEGIN ASSERT(cond);
  12924. END Assert;
  12925. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12926. BEGIN
  12927. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12928. END ReusableRegister;
  12929. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12930. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12931. BEGIN
  12932. procedure := moduleScope.bodyProcedure;
  12933. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12934. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12935. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12936. procedure.SetScope(moduleScope);
  12937. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12938. procedure.SetAccess(SyntaxTree.Hidden);
  12939. moduleScope.SetBodyProcedure(procedure);
  12940. moduleScope.AddProcedure(procedure);
  12941. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12942. END;
  12943. END EnsureBodyProcedure;
  12944. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12945. VAR import: SyntaxTree.Import;
  12946. selfName: SyntaxTree.IdentifierString;
  12947. module: SyntaxTree.Module;
  12948. BEGIN
  12949. scope.ownerModule.GetName(selfName);
  12950. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12951. module := scope.ownerModule
  12952. ELSE
  12953. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12954. IF import = NIL THEN
  12955. RETURN NIL
  12956. ELSIF import.module = NIL THEN
  12957. RETURN NIL
  12958. ELSE module := import.module
  12959. END;
  12960. END;
  12961. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12962. END GetSymbol;
  12963. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12964. BEGIN
  12965. op.mode := mode;
  12966. IntermediateCode.InitOperand(op.op);
  12967. IntermediateCode.InitOperand(op.tag);
  12968. IntermediateCode.InitOperand(op.extra);
  12969. op.dimOffset := 0;
  12970. END InitOperand;
  12971. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12972. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12973. BEGIN RETURN IntermediateCode.GetType(system, type)
  12974. END GetType;
  12975. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12976. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12977. BEGIN
  12978. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12979. (*
  12980. UniqueId(name,module,name,adr);
  12981. *)
  12982. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12983. constant.SetValue(value);
  12984. constant.SetAccess(SyntaxTree.Hidden);
  12985. module.moduleScope.AddConstant(constant);
  12986. constant.SetScope(module.moduleScope);
  12987. RETURN constant
  12988. END BuildConstant;
  12989. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12990. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12991. BEGIN
  12992. variable := scope.firstVariable;
  12993. WHILE variable # NIL DO
  12994. IF variable.NeedsTrace() THEN
  12995. RETURN TRUE;
  12996. END;
  12997. variable := variable.nextVariable;
  12998. END;
  12999. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13000. WHILE parameter # NIL DO
  13001. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  13002. RETURN TRUE;
  13003. END;
  13004. parameter := parameter.nextParameter;
  13005. END;
  13006. RETURN FALSE;
  13007. END HasPointers;
  13008. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  13009. 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));
  13010. END IsVariableParameter;
  13011. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13012. VAR parameter: SyntaxTree.Parameter;
  13013. BEGIN
  13014. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13015. WHILE parameter # NIL DO
  13016. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  13017. IF parameter.movable THEN RETURN TRUE END;
  13018. parameter := parameter.nextParameter;
  13019. END;
  13020. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  13021. END HasVariableParameters;
  13022. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  13023. BEGIN
  13024. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  13025. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  13026. END HasExplicitTraceMethod;
  13027. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  13028. BEGIN
  13029. IF expression.resolved # NIL THEN expression := expression.resolved END;
  13030. IF (expression IS SyntaxTree.IntegerValue) THEN
  13031. val := expression(SyntaxTree.IntegerValue).value;
  13032. RETURN TRUE
  13033. ELSE
  13034. RETURN FALSE
  13035. END;
  13036. END IsIntegerConstant;
  13037. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  13038. BEGIN
  13039. IF val <= 0 THEN RETURN FALSE END;
  13040. exp := 0;
  13041. WHILE ~ODD(val) DO
  13042. val := val DIV 2;
  13043. INC(exp)
  13044. END;
  13045. RETURN val = 1
  13046. END PowerOf2;
  13047. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  13048. VAR procedure: SyntaxTree.Procedure;
  13049. BEGIN
  13050. procedure := record.recordScope.constructor;
  13051. IF procedure = NIL THEN
  13052. record := record.GetBaseRecord();
  13053. IF record # NIL THEN
  13054. procedure := GetConstructor(record)
  13055. END;
  13056. END;
  13057. RETURN procedure;
  13058. END GetConstructor;
  13059. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  13060. BEGIN
  13061. value := SHORT(op.intValue);
  13062. RETURN op.mode = IntermediateCode.ModeImmediate;
  13063. END IsIntegerImmediate;
  13064. (** whether a type strictily is a pointer to record or object type
  13065. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13066. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13067. BEGIN
  13068. IF type = NIL THEN
  13069. RETURN FALSE
  13070. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13071. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13072. ELSE
  13073. RETURN FALSE
  13074. END
  13075. END IsStrictlyPointerToRecord;
  13076. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13077. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13078. END IsUnsafePointer;
  13079. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13080. BEGIN type := type.resolved;
  13081. IF type IS SyntaxTree.PointerType THEN
  13082. type := type(SyntaxTree.PointerType).pointerBase;
  13083. type := type.resolved;
  13084. IF type IS SyntaxTree.RecordType THEN
  13085. recordType := type(SyntaxTree.RecordType);
  13086. RETURN TRUE
  13087. ELSE
  13088. RETURN FALSE
  13089. END
  13090. ELSIF type IS SyntaxTree.RecordType THEN
  13091. recordType := type(SyntaxTree.RecordType);
  13092. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13093. ELSIF type IS SyntaxTree.ObjectType THEN
  13094. RETURN TRUE
  13095. ELSIF type IS SyntaxTree.AnyType THEN
  13096. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13097. ELSE
  13098. RETURN FALSE
  13099. END;
  13100. END IsPointerToRecord;
  13101. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13102. BEGIN
  13103. type := type.resolved;
  13104. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13105. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13106. END IsArrayOfSystemByte;
  13107. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13108. BEGIN
  13109. IF type = NIL THEN RETURN FALSE END;
  13110. type := type.resolved;
  13111. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13112. END IsOpenArray;
  13113. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13114. BEGIN
  13115. IF type = NIL THEN RETURN FALSE END;
  13116. type := type.resolved;
  13117. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13118. END IsSemiDynamicArray;
  13119. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13120. BEGIN
  13121. IF type = NIL THEN RETURN FALSE END;
  13122. type := type.resolved;
  13123. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13124. END IsStaticArray;
  13125. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13126. BEGIN
  13127. IF type = NIL THEN RETURN FALSE END;
  13128. type := type.resolved;
  13129. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13130. END IsStaticMathArray;
  13131. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13132. BEGIN
  13133. WHILE (IsStaticMathArray(type)) DO
  13134. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13135. END;
  13136. RETURN type;
  13137. END StaticMathArrayBaseType;
  13138. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13139. VAR size: LONGINT;
  13140. BEGIN
  13141. size := 1;
  13142. WHILE (IsStaticArray(type)) DO
  13143. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13144. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13145. END;
  13146. RETURN size;
  13147. END StaticArrayNumElements;
  13148. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13149. VAR size: LONGINT;
  13150. BEGIN
  13151. size := 1;
  13152. WHILE (IsStaticMathArray(type)) DO
  13153. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13154. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13155. END;
  13156. RETURN size;
  13157. END StaticMathArrayNumElements;
  13158. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13159. BEGIN
  13160. WHILE (IsStaticArray(type)) DO
  13161. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13162. END;
  13163. RETURN type;
  13164. END StaticArrayBaseType;
  13165. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13166. BEGIN
  13167. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13168. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13169. END;
  13170. RETURN type;
  13171. END ArrayBaseType;
  13172. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13173. BEGIN
  13174. IF type = NIL THEN RETURN FALSE END;
  13175. type := type.resolved;
  13176. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13177. END IsDelegate;
  13178. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13179. VAR i: LONGINT;
  13180. BEGIN
  13181. i := 0; type := type.resolved;
  13182. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13183. INC(i);
  13184. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13185. END;
  13186. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13187. INC(i);
  13188. type := type(SyntaxTree.MathArrayType).arrayBase;
  13189. IF type # NIL THEN type := type.resolved END;
  13190. END;
  13191. RETURN i
  13192. END DynamicDim;
  13193. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13194. BEGIN
  13195. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13196. type := type(SyntaxTree.ArrayType).arrayBase;
  13197. END;
  13198. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13199. type := type(SyntaxTree.MathArrayType).arrayBase;
  13200. END;
  13201. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13202. END StaticSize;
  13203. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13204. BEGIN
  13205. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13206. END IsImmediate;
  13207. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13208. BEGIN
  13209. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13210. END IsAddress;
  13211. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13212. BEGIN
  13213. RETURN (x.mode = IntermediateCode.ModeRegister);
  13214. END IsRegister;
  13215. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13216. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13217. BEGIN
  13218. typeDeclaration := recordType.typeDeclaration;
  13219. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13220. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13221. END GetRecordTypeName;
  13222. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13223. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13224. BEGIN
  13225. parSize := 0;
  13226. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13227. parameter := procedureType.returnParameter;
  13228. INC(parSize,system.SizeOfParameter(parameter));
  13229. parSize := parSize + (-parSize) MOD system.addressSize;
  13230. END;
  13231. parameter :=procedureType.lastParameter;
  13232. WHILE (parameter # NIL) DO
  13233. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13234. INC(parSize, system.addressSize);
  13235. ELSE
  13236. INC(parSize,system.SizeOfParameter(parameter));
  13237. parSize := parSize + (-parSize) MOD system.addressSize;
  13238. END;
  13239. parameter := parameter.prevParameter;
  13240. END;
  13241. IF procedureType.selfParameter # NIL THEN
  13242. parameter := procedureType.selfParameter;
  13243. INC(parSize,system.SizeOfParameter(parameter));
  13244. parSize := parSize + (-parSize) MOD system.addressSize;
  13245. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13246. END; (* method => self pointer *)
  13247. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13248. RETURN ToMemoryUnits(system,parSize)
  13249. END ParametersSize;
  13250. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13251. BEGIN
  13252. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13253. END IsNested;
  13254. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13255. BEGIN
  13256. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13257. scope := scope.outerScope;
  13258. END;
  13259. RETURN scope # NIL;
  13260. END InCellScope;
  13261. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13262. BEGIN
  13263. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13264. END ProcedureParametersSize;
  13265. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13266. VAR dataUnit: LONGINT;
  13267. BEGIN dataUnit := system.dataUnit;
  13268. ASSERT(size MOD system.dataUnit = 0);
  13269. RETURN LONGINT(size DIV system.dataUnit)
  13270. END ToMemoryUnits;
  13271. PROCEDURE Get*(): Backend.Backend;
  13272. VAR backend: IntermediateBackend;
  13273. BEGIN NEW(backend); RETURN backend
  13274. END Get;
  13275. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13276. VAR instruction: IntermediateCode.Instruction;
  13277. BEGIN
  13278. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13279. RETURN instruction
  13280. END Nop;
  13281. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13282. VAR instruction: IntermediateCode.Instruction;
  13283. BEGIN
  13284. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13285. RETURN instruction
  13286. END Mov;
  13287. (* like Mov but ensures that no new register will be allocated for dest *)
  13288. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13289. VAR instruction: IntermediateCode.Instruction;
  13290. BEGIN
  13291. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13292. RETURN instruction
  13293. END MovReplace;
  13294. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13295. VAR instruction: IntermediateCode.Instruction;
  13296. BEGIN
  13297. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13298. RETURN instruction
  13299. END Conv;
  13300. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13301. VAR instruction: IntermediateCode.Instruction;
  13302. BEGIN
  13303. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13304. RETURN instruction
  13305. END Call;
  13306. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13307. VAR op1, op2, op3: IntermediateCode.Operand;
  13308. VAR instruction: IntermediateCode.Instruction;
  13309. BEGIN
  13310. IntermediateCode.InitNumber(op1,pcOffset);
  13311. IntermediateCode.InitNumber(op2,callingConvention);
  13312. IntermediateCode.InitNumber(op3,unwind);
  13313. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13314. RETURN instruction
  13315. END Exit;
  13316. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13317. VAR instruction: IntermediateCode.Instruction;
  13318. BEGIN
  13319. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13320. RETURN instruction
  13321. END Return;
  13322. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13323. VAR instruction: IntermediateCode.Instruction;
  13324. BEGIN
  13325. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13326. RETURN instruction
  13327. END Result;
  13328. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13329. VAR op1: IntermediateCode.Operand;
  13330. VAR instruction: IntermediateCode.Instruction;
  13331. BEGIN
  13332. IntermediateCode.InitNumber(op1,nr);
  13333. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13334. RETURN instruction
  13335. END Trap;
  13336. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13337. VAR instruction: IntermediateCode.Instruction;
  13338. BEGIN
  13339. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13340. RETURN instruction
  13341. END Br;
  13342. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13343. VAR instruction: IntermediateCode.Instruction;
  13344. BEGIN
  13345. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13346. RETURN instruction
  13347. END Breq;
  13348. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13349. VAR instruction: IntermediateCode.Instruction;
  13350. BEGIN
  13351. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13352. RETURN instruction
  13353. END Brne;
  13354. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13355. VAR instruction: IntermediateCode.Instruction;
  13356. BEGIN
  13357. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13358. RETURN instruction
  13359. END Brge;
  13360. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13361. VAR instruction: IntermediateCode.Instruction;
  13362. BEGIN
  13363. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13364. RETURN instruction
  13365. END Brlt;
  13366. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13367. VAR instruction: IntermediateCode.Instruction;
  13368. BEGIN
  13369. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13370. RETURN instruction
  13371. END Pop;
  13372. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13373. VAR instruction: IntermediateCode.Instruction;
  13374. BEGIN
  13375. ASSERT(op.mode # IntermediateCode.Undefined);
  13376. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13377. RETURN instruction
  13378. END Push;
  13379. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13380. VAR instruction: IntermediateCode.Instruction;
  13381. BEGIN
  13382. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13383. RETURN instruction
  13384. END Neg;
  13385. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13386. VAR instruction: IntermediateCode.Instruction;
  13387. BEGIN
  13388. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13389. RETURN instruction
  13390. END Not;
  13391. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13392. VAR instruction: IntermediateCode.Instruction;
  13393. BEGIN
  13394. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13395. RETURN instruction
  13396. END Abs;
  13397. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13398. VAR instruction: IntermediateCode.Instruction;
  13399. BEGIN
  13400. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13401. ASSERT(~IsImmediate(instruction.op1));
  13402. RETURN instruction
  13403. END Mul;
  13404. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13405. VAR instruction: IntermediateCode.Instruction;
  13406. BEGIN
  13407. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13408. RETURN instruction
  13409. END Div;
  13410. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13411. VAR instruction: IntermediateCode.Instruction;
  13412. BEGIN
  13413. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13414. RETURN instruction
  13415. END Mod;
  13416. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13417. VAR instruction: IntermediateCode.Instruction;
  13418. BEGIN
  13419. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13420. RETURN instruction
  13421. END Sub;
  13422. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13423. VAR instruction: IntermediateCode.Instruction;
  13424. BEGIN
  13425. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13426. RETURN instruction
  13427. END Add;
  13428. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13429. VAR instruction: IntermediateCode.Instruction;
  13430. BEGIN
  13431. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13432. RETURN instruction
  13433. END And;
  13434. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13435. VAR instruction: IntermediateCode.Instruction;
  13436. BEGIN
  13437. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13438. RETURN instruction
  13439. END Or;
  13440. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13441. VAR instruction: IntermediateCode.Instruction;
  13442. BEGIN
  13443. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13444. RETURN instruction
  13445. END Xor;
  13446. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13447. VAR instruction: IntermediateCode.Instruction;
  13448. BEGIN
  13449. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13450. RETURN instruction
  13451. END Shl;
  13452. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13453. VAR instruction: IntermediateCode.Instruction;
  13454. BEGIN
  13455. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13456. RETURN instruction
  13457. END Shr;
  13458. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13459. VAR instruction: IntermediateCode.Instruction;
  13460. BEGIN
  13461. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13462. RETURN instruction
  13463. END Rol;
  13464. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13465. VAR instruction: IntermediateCode.Instruction;
  13466. BEGIN
  13467. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13468. RETURN instruction
  13469. END Ror;
  13470. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13471. VAR instruction: IntermediateCode.Instruction;
  13472. BEGIN
  13473. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13474. RETURN instruction
  13475. END Cas;
  13476. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13477. VAR instruction: IntermediateCode.Instruction;
  13478. BEGIN
  13479. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13480. RETURN instruction
  13481. END Copy;
  13482. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13483. VAR instruction: IntermediateCode.Instruction;
  13484. BEGIN
  13485. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13486. RETURN instruction
  13487. END Fill;
  13488. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13489. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13490. BEGIN
  13491. string := IntermediateCode.String(s);
  13492. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13493. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13494. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13495. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13496. RETURN instruction
  13497. END Asm;
  13498. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13499. VAR instruction: IntermediateCode.Instruction;
  13500. BEGIN
  13501. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13502. RETURN instruction
  13503. END Data;
  13504. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13505. VAR instruction: IntermediateCode.Instruction;
  13506. BEGIN
  13507. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13508. IntermediateCode.SetSubType(instruction, subtype);
  13509. RETURN instruction
  13510. END SpecialInstruction;
  13511. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13512. VAR op1: IntermediateCode.Operand;
  13513. VAR instruction: IntermediateCode.Instruction;
  13514. BEGIN
  13515. (*! generate a warning if size exceeds a certain limit *)
  13516. (*
  13517. ASSERT(bytes < 1000000); (* sanity check *)
  13518. *)
  13519. ASSERT(0 <= units); (* sanity check *)
  13520. IntermediateCode.InitNumber(op1,units);
  13521. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13522. RETURN instruction
  13523. END Reserve;
  13524. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13525. VAR op1: IntermediateCode.Operand;
  13526. VAR instruction: IntermediateCode.Instruction;
  13527. BEGIN
  13528. IntermediateCode.InitNumber(op1,position.start);
  13529. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13530. RETURN instruction
  13531. END LabelInstruction;
  13532. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13533. VAR pc: LONGINT;
  13534. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13535. BEGIN
  13536. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13537. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13538. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13539. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13540. IF instr.op1.type.form = IntermediateCode.Float THEN
  13541. RETURN instr.op1.floatValue = op.floatValue
  13542. ELSE
  13543. RETURN instr.op1.intValue = op.intValue
  13544. END;
  13545. END ProvidesValue;
  13546. BEGIN
  13547. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13548. pc := 0;
  13549. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13550. INC(pc);
  13551. END;
  13552. IF pc = data.pc THEN
  13553. data.Emit(Data(Basic.invalidPosition,vop));
  13554. END;
  13555. RETURN pc
  13556. END EnterImmediate;
  13557. PROCEDURE Init;
  13558. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13559. BEGIN
  13560. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13561. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13562. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13563. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13564. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13565. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13566. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13567. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13568. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13569. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13570. IntermediateCode.InitOperand(emptyOperand);
  13571. FOR i := 0 TO NumberSystemCalls-1 DO
  13572. name := "@SystemCall";
  13573. Basic.AppendNumber(name,i);
  13574. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13575. END;
  13576. END Init;
  13577. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13578. BEGIN
  13579. RETURN (symbol # NIL) & symbol.NeedsSection();
  13580. END IsExported;
  13581. BEGIN
  13582. Init;
  13583. END FoxIntermediateBackend.
  13584. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13585. # Release.Build --path="/temp/obg/" Win32 ~
  13586. # 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 ~
  13587. FStols.CloseFiles A2Z.exe ~
  13588. System.FreeDownTo FoxIntermediateBackend ~
  13589. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13590. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13591. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13592. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13593. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13594. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13595. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13596. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13597. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13598. GenericLinker.Mod Loader.Mod BootConsole.Mod