FoxIntermediateBackend.Mod 578 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685146861468714688146891469014691146921469314694146951469614697146981469914700147011470214703147041470514706147071470814709147101471114712147131471414715147161471714718147191472014721147221472314724147251472614727147281472914730147311473214733147341473514736147371473814739147401474114742147431474414745147461474714748147491475014751147521475314754147551475614757147581475914760147611476214763147641476514766147671476814769147701477114772147731477414775147761477714778147791478014781147821478314784147851478614787
  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. DefaultRuntimeModuleName ="Runtime";
  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. TYPE
  96. Position=SyntaxTree.Position;
  97. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  98. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  99. Operand = RECORD
  100. mode: SHORTINT;
  101. op: IntermediateCode.Operand;
  102. tag: IntermediateCode.Operand;
  103. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  104. dimOffset: LONGINT;
  105. END;
  106. Fixup= POINTER TO RECORD
  107. pc: LONGINT;
  108. nextFixup: Fixup;
  109. END;
  110. WriteBackCall = POINTER TO RECORD
  111. call: SyntaxTree.ProcedureCallDesignator;
  112. next: WriteBackCall;
  113. END;
  114. Label= OBJECT
  115. VAR
  116. fixups: Fixup;
  117. section: IntermediateCode.Section;
  118. pc: LONGINT;
  119. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  120. BEGIN
  121. SELF.section := section; pc := -1;
  122. END InitLabel;
  123. PROCEDURE Resolve(pc: LONGINT);
  124. VAR at: LONGINT;
  125. BEGIN
  126. SELF.pc := pc;
  127. WHILE(fixups # NIL) DO
  128. at := fixups.pc;
  129. section.PatchAddress(at,pc);
  130. fixups := fixups.nextFixup;
  131. END;
  132. END Resolve;
  133. PROCEDURE AddFixup(at: LONGINT);
  134. VAR fixup: Fixup;
  135. BEGIN
  136. ASSERT(pc=-1);
  137. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  138. END AddFixup;
  139. END Label;
  140. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  141. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  142. VAR
  143. backend: IntermediateBackend;
  144. implementationVisitor: ImplementationVisitor;
  145. meta: MetaDataGenerator;
  146. system: Global.System;
  147. currentScope: SyntaxTree.Scope;
  148. module: Sections.Module;
  149. moduleSelf: SyntaxTree.Variable;
  150. dump: BOOLEAN;
  151. forceModuleBody: BOOLEAN;
  152. addressType: IntermediateCode.Type;
  153. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  154. BEGIN
  155. currentScope := NIL; module := NIL; moduleSelf := NIL;
  156. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  157. SELF.dump := dump;
  158. SELF.backend := backend;
  159. SELF.forceModuleBody := forceModuleBody;
  160. addressType := IntermediateCode.GetType(system,system.addressType)
  161. END Init;
  162. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  163. BEGIN
  164. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  165. END Error;
  166. PROCEDURE Type(x: SyntaxTree.Type);
  167. BEGIN
  168. x.Accept(SELF);
  169. END Type;
  170. (** types **)
  171. PROCEDURE VisitBasicType*(x: SyntaxTree.BasicType);
  172. BEGIN (* no code emission *) END VisitBasicType;
  173. PROCEDURE VisitCharacterType*(x: SyntaxTree.CharacterType);
  174. BEGIN (* no code emission *) END VisitCharacterType;
  175. PROCEDURE VisitIntegerType*(x: SyntaxTree.IntegerType);
  176. BEGIN (* no code emission *) END VisitIntegerType;
  177. PROCEDURE VisitFloatType*(x: SyntaxTree.FloatType);
  178. BEGIN (* no code emission *) END VisitFloatType;
  179. PROCEDURE VisitComplexType*(x: SyntaxTree.ComplexType);
  180. BEGIN (* no code emission *) END VisitComplexType;
  181. PROCEDURE VisitQualifiedType*(x: SyntaxTree.QualifiedType);
  182. VAR type: SyntaxTree.Type;
  183. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  184. type := x.resolved;
  185. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  186. meta.CheckTypeDeclaration(type);
  187. END;
  188. END VisitQualifiedType;
  189. PROCEDURE VisitStringType*(x: SyntaxTree.StringType);
  190. BEGIN (* no code emission *) END VisitStringType;
  191. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  192. BEGIN (* no code emission *)
  193. END VisitArrayRangeType;
  194. PROCEDURE VisitArrayType*(x: SyntaxTree.ArrayType);
  195. BEGIN (* no code emission *) END VisitArrayType;
  196. PROCEDURE VisitPortType*(x: SyntaxTree.PortType);
  197. BEGIN (* no code emission *) END VisitPortType;
  198. PROCEDURE VisitMathArrayType*(x: SyntaxTree.MathArrayType);
  199. BEGIN
  200. meta.CheckTypeDeclaration(x);
  201. END VisitMathArrayType;
  202. PROCEDURE VisitPointerType*(x: SyntaxTree.PointerType);
  203. BEGIN
  204. meta.CheckTypeDeclaration(x);
  205. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  206. END VisitPointerType;
  207. PROCEDURE VisitRecordType*(x: SyntaxTree.RecordType);
  208. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  209. BEGIN (* no code emission *)
  210. meta.CheckTypeDeclaration(x);
  211. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  212. IF x.pointerType.typeDeclaration # NIL THEN
  213. td := x.pointerType.typeDeclaration
  214. ELSE
  215. td := x.typeDeclaration
  216. END;
  217. Global.GetSymbolName(td,name);
  218. (* code section for object *)
  219. END;
  220. Scope(x.recordScope);
  221. END VisitRecordType;
  222. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  223. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  224. BEGIN
  225. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  226. WHILE (this # NIL) & (this.identifier# id) DO
  227. this := this.nextModifier;
  228. END;
  229. RETURN this # NIL
  230. END HasFlag;
  231. PROCEDURE VisitCellType*(x: SyntaxTree.CellType);
  232. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  233. BEGIN
  234. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  235. capabilities := {};
  236. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  237. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  238. backend.SetCapabilities(capabilities);
  239. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  240. Scope(x.cellScope);
  241. END;
  242. END VisitCellType;
  243. PROCEDURE VisitProcedureType*(x: SyntaxTree.ProcedureType);
  244. BEGIN (* no code emission *) END VisitProcedureType;
  245. PROCEDURE VisitEnumerationType*(x: SyntaxTree.EnumerationType);
  246. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  247. END VisitEnumerationType;
  248. (* symbols *)
  249. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  250. BEGIN
  251. Procedure(x);
  252. END VisitProcedure;
  253. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  254. BEGIN
  255. Procedure(x);
  256. END VisitOperator;
  257. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  258. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  259. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  260. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  261. BEGIN
  262. type := type.resolved;
  263. IF type IS SyntaxTree.RecordType THEN
  264. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  265. ELSIF (type IS SyntaxTree.ArrayType) THEN
  266. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  267. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  268. END;
  269. ELSIF type IS SyntaxTree.MathArrayType THEN
  270. WITH type: SyntaxTree.MathArrayType DO
  271. IF type.form = SyntaxTree.Open THEN
  272. RETURN TRUE
  273. ELSIF type.form = SyntaxTree.Static THEN
  274. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  275. END;
  276. END;
  277. END;
  278. RETURN FALSE
  279. END TypeNeedsInitialization;
  280. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  281. VAR variable: SyntaxTree.Variable;
  282. BEGIN
  283. variable := scope.firstVariable;
  284. WHILE variable # NIL DO
  285. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  286. IF variable.initializer # NIL THEN RETURN TRUE END;
  287. variable := variable.nextVariable;
  288. END;
  289. RETURN FALSE
  290. END ScopeNeedsInitialization;
  291. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  292. VAR size: LONGINT;
  293. BEGIN
  294. size := offset - lastUpdated;
  295. IF size > 0 THEN
  296. irv.Emit(Reserve(x.position,size));
  297. END;
  298. irv.Emit(Data(x.position, op));
  299. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  300. END SingleInitialize;
  301. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  302. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  303. BEGIN
  304. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  305. WITH type: SyntaxTree.RecordType DO
  306. baseType := type.baseType;
  307. IF baseType # NIL THEN
  308. baseType := baseType.resolved;
  309. IF baseType IS SyntaxTree.PointerType THEN
  310. baseType := baseType(SyntaxTree.PointerType).pointerBase
  311. END;
  312. Initialize(baseType,NIL, offset);
  313. END;
  314. variable := type.recordScope.firstVariable;
  315. WHILE variable # NIL DO
  316. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  317. variable := variable.nextVariable
  318. END;
  319. | type: SyntaxTree.ArrayType DO
  320. IF type.form = SyntaxTree.Static THEN
  321. baseType := type.arrayBase;
  322. IF TypeNeedsInitialization(baseType) THEN
  323. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  324. FOR i := 0 TO type.staticLength-1 DO
  325. Initialize(baseType,NIL,offset+i*size);
  326. END;
  327. END;
  328. END;
  329. | type: SyntaxTree.MathArrayType DO
  330. IF type.form = SyntaxTree.Open THEN
  331. dim := DynamicDim(type);
  332. baseType := SemanticChecker.ArrayBase(type,dim);
  333. imm := IntermediateCode.Immediate(addressType,dim);
  334. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  335. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  336. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  337. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  338. (* flags remain empty (=0) for open array *)
  339. ELSIF type.form = SyntaxTree.Static THEN
  340. baseType := type.arrayBase;
  341. IF TypeNeedsInitialization(baseType) THEN
  342. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  343. ASSERT(type.staticLength < 1024*1024*1024);
  344. FOR i := 0 TO type.staticLength-1 DO
  345. Initialize(baseType,NIL,offset+i*size);
  346. END;
  347. END;
  348. END;
  349. ELSE
  350. IF initializer # NIL THEN
  351. implementationVisitor.Evaluate(initializer, op);
  352. SingleInitialize(op.op, offset);
  353. END;
  354. END;
  355. END Initialize;
  356. BEGIN
  357. IF x.externalName # NIL THEN RETURN END;
  358. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  359. (* code section for variable *)
  360. Global.GetSymbolSegmentedName(x,name);
  361. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  362. irv.SetExported(IsExported(x));
  363. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  364. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  365. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  366. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  367. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  368. FOR i := 0 TO DynamicDim(x.type)-1 DO
  369. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  370. END;
  371. ELSE
  372. lastUpdated:= 0;
  373. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  374. Initialize(x.type, x.initializer, 0);
  375. END;
  376. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  377. IF size > 0 THEN
  378. irv.Emit(Reserve(x.position,size));
  379. END;
  380. IF ~x.fixed THEN
  381. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  382. ELSE
  383. align := x.alignment;
  384. END;
  385. irv.SetPositionOrAlignment(x.fixed, align);
  386. meta.CheckTypeDeclaration(x.type);
  387. END;
  388. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  389. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  390. END;
  391. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  392. END VisitVariable;
  393. PROCEDURE VisitProperty*(x: SyntaxTree.Property);
  394. BEGIN
  395. VisitVariable(x)
  396. END VisitProperty;
  397. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  398. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  399. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  400. BEGIN
  401. ASSERT(currentScope IS SyntaxTree.CellScope);
  402. Global.GetSymbolSegmentedName(x,name);
  403. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  404. irv.SetExported(IsExported(x));
  405. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  406. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  407. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  408. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  409. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  410. FOR i := 0 TO DynamicDim(x.type)-1 DO
  411. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  412. END;
  413. ELSE
  414. lastUpdated:= 0;
  415. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  416. IF size > 0 THEN
  417. irv.Emit(Reserve(x.position,size));
  418. END;
  419. IF ~x.fixed THEN
  420. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  421. ELSE
  422. align := x.alignment;
  423. END;
  424. irv.SetPositionOrAlignment(x.fixed, align);
  425. meta.CheckTypeDeclaration(x.type);
  426. END;
  427. END VisitParameter;
  428. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  429. BEGIN
  430. Type(x.declaredType); (* => code in objects *)
  431. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  432. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  433. END;
  434. END VisitTypeDeclaration;
  435. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  436. BEGIN
  437. IF (SyntaxTree.Public * x.access # {}) THEN
  438. implementationVisitor.VisitConstant(x);
  439. END;
  440. END VisitConstant;
  441. PROCEDURE Scope(x: SyntaxTree.Scope);
  442. VAR procedure: SyntaxTree.Procedure;
  443. constant: SyntaxTree.Constant;
  444. variable: SyntaxTree.Variable;
  445. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  446. cell: SyntaxTree.CellType;
  447. parameter: SyntaxTree.Parameter;
  448. property: SyntaxTree.Property;
  449. BEGIN
  450. prevScope := currentScope;
  451. currentScope := x;
  452. (* constants treated in implementation visitor *)
  453. WITH x: SyntaxTree.CellScope DO
  454. cell := x.ownerCell;
  455. parameter := cell.firstParameter;
  456. WHILE parameter # NIL DO
  457. VisitParameter(parameter);
  458. parameter := parameter.nextParameter;
  459. END;
  460. property := cell.firstProperty;
  461. WHILE property # NIL DO
  462. VisitProperty(property);
  463. property := property.nextProperty;
  464. END;
  465. ELSE
  466. END;
  467. typeDeclaration := x.firstTypeDeclaration;
  468. WHILE typeDeclaration # NIL DO
  469. VisitTypeDeclaration(typeDeclaration);
  470. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  471. END;
  472. variable := x.firstVariable;
  473. WHILE variable # NIL DO
  474. VisitVariable(variable);
  475. variable := variable.nextVariable;
  476. END;
  477. procedure := x.firstProcedure;
  478. WHILE procedure # NIL DO
  479. VisitProcedure(procedure);
  480. procedure := procedure.nextProcedure;
  481. END;
  482. constant := x.firstConstant;
  483. WHILE constant # NIL DO
  484. VisitConstant(constant);
  485. constant := constant.nextConstant;
  486. END;
  487. currentScope := prevScope;
  488. END Scope;
  489. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  490. VAR parameter: SyntaxTree.Parameter;
  491. BEGIN
  492. parameter := first;
  493. WHILE parameter # NIL DO
  494. VisitParameter(parameter);
  495. parameter := parameter.nextParameter;
  496. END;
  497. END Parameters;
  498. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  499. VAR scope: SyntaxTree.ProcedureScope;
  500. prevScope: SyntaxTree.Scope;
  501. inline, finalizer: BOOLEAN;
  502. procedureType: SyntaxTree.ProcedureType;
  503. pc: LONGINT;
  504. stackSize: LONGINT;
  505. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  506. null,size,src,dest,fp,res: IntermediateCode.Operand;
  507. cc: LONGINT;
  508. cellType: SyntaxTree.CellType;
  509. registerNumber: LONGINT;
  510. registerParameters: SIZE;
  511. registerClass: IntermediateCode.RegisterClass;
  512. type: IntermediateCode.Type;
  513. formalParameter: SyntaxTree.Parameter;
  514. recordType: SyntaxTree.RecordType;
  515. isModuleBody: BOOLEAN;
  516. parametersSize: LONGINT;
  517. position: LONGINT;
  518. variable: SyntaxTree.Variable;
  519. PROCEDURE Signature;
  520. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  521. BEGIN
  522. procedureType := x.type(SyntaxTree.ProcedureType);
  523. returnType := procedureType.returnType;
  524. IF returnType # NIL THEN
  525. meta.CheckTypeDeclaration(returnType)
  526. END;
  527. parameter := procedureType.firstParameter;
  528. WHILE parameter # NIL DO
  529. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  530. parameter := parameter.nextParameter;
  531. END;
  532. END Signature;
  533. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  534. VAR result: BOOLEAN;
  535. BEGIN
  536. result := FALSE;
  537. IF x = SyntaxTree.invalidExpression THEN
  538. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  539. result := TRUE;
  540. value := x.resolved(SyntaxTree.IntegerValue).value;
  541. ELSE
  542. Error(x.position,"expression is not an integer constant");
  543. END;
  544. RETURN result;
  545. END CheckIntegerValue;
  546. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  547. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  548. BEGIN
  549. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  550. WHILE (this # NIL) & (this.identifier # id) DO
  551. this := this.nextModifier;
  552. END;
  553. IF this # NIL THEN
  554. IF this.expression = NIL THEN
  555. Error(this.position,"expected expression value");
  556. ELSIF CheckIntegerValue(this.expression,value) THEN
  557. END;
  558. RETURN TRUE
  559. ELSE RETURN FALSE
  560. END;
  561. END HasValue;
  562. CONST DefaultDataMemorySize=512;
  563. BEGIN
  564. IF x.externalName # NIL THEN RETURN END;
  565. (*
  566. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  567. *)
  568. (* code section for this procedure *)
  569. position := x.position.start;
  570. scope := x.procedureScope;
  571. prevScope := currentScope;
  572. currentScope := scope;
  573. procedureType := x.type(SyntaxTree.ProcedureType);
  574. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  575. implementationVisitor.temporaries.Clear;
  576. implementationVisitor.usedRegisters := NIL;
  577. implementationVisitor.registerUsageCount.Init;
  578. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  579. IF (scope.body # NIL) & (x.isInline) THEN
  580. inline := TRUE;
  581. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  582. ir.SetExported(IsExported(x));
  583. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  584. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  585. IF backend.cellsAreObjects THEN
  586. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  587. ir.SetExported(IsExported(x));
  588. ELSE
  589. RETURN; (* cellnet cannot be compiled for final static hardware *)
  590. END;
  591. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  592. inline := FALSE;
  593. AddBodyCallStub(x);
  594. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  595. ir.SetExported(IsExported(x));
  596. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  597. inline := FALSE;
  598. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  599. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  600. AddBodyCallStub(x);
  601. AddStackAllocation(x,stackSize);
  602. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  603. ir.SetExported(IsExported(x));
  604. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  605. inline := FALSE;
  606. Parameters(procedureType.firstParameter);
  607. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  608. ir.SetExported(IsExported(x));
  609. ELSE
  610. inline := FALSE;
  611. IF x.isEntry OR x.isExit THEN
  612. IF x.isEntry THEN
  613. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  614. ELSE
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  616. END;
  617. ir.SetExported(TRUE);
  618. ELSE
  619. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  620. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  621. END;
  622. END;
  623. cc := procedureType.callingConvention;
  624. IF cc = SyntaxTree.WinAPICallingConvention THEN
  625. parametersSize := ProcedureParametersSize(backend.system,x);
  626. ELSE
  627. parametersSize := 0;
  628. END;
  629. IF scope.body # NIL THEN
  630. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  631. registerNumber := 0;
  632. IF ~inline THEN
  633. IF scope.lastVariable = NIL THEN
  634. stackSize := 0
  635. ELSE
  636. stackSize := scope.lastVariable.offsetInBits;
  637. IF stackSize <0 THEN stackSize := -stackSize END;
  638. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  639. END;
  640. (*
  641. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  642. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  643. *)
  644. (*
  645. ir.Emit(Nop(position)); (* placeholder for fill *)
  646. *)
  647. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  648. registerParameters := backend.NumberParameterRegisters(procedureType.callingConvention);
  649. (* assumption: registers are passed left to right and left parameters are in registers *)
  650. formalParameter := procedureType.firstParameter;
  651. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  652. IF ~PassInRegister(formalParameter) THEN
  653. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  654. ELSE
  655. IF formalParameter.type.IsRecordType() THEN
  656. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  657. type := addressType;
  658. ELSE
  659. type := GetType(system, formalParameter.type);
  660. END;
  661. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(procedureType.callingConvention, type, registerNumber));
  662. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  663. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  664. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  665. implementationVisitor.ReleaseIntermediateOperand(src);
  666. INC(registerNumber);
  667. formalParameter := formalParameter.nextParameter;
  668. END;
  669. END;
  670. END;
  671. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  672. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  673. END;
  674. pc := ir.pc-1;
  675. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 64) THEN
  676. registerParameters := backend.NumberParameterRegisters(procedureType.callingConvention);
  677. (* assumption: registers are passed left to right and left parameters are in registers *)
  678. formalParameter := procedureType.firstParameter;
  679. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  680. IF ~PassInRegister(formalParameter) THEN
  681. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  682. ELSE
  683. IF formalParameter.type.IsRecordType() THEN
  684. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  685. type := addressType;
  686. ELSE
  687. type := GetType(system, formalParameter.type);
  688. END;
  689. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(procedureType.callingConvention, type, registerNumber));
  690. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  691. implementationVisitor.currentScope := currentScope;
  692. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  693. formalParameter.SetOffset(variable.offsetInBits);
  694. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  695. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  696. implementationVisitor.ReleaseIntermediateOperand(src);
  697. INC(registerNumber);
  698. formalParameter := formalParameter.nextParameter;
  699. END;
  700. END;
  701. END;
  702. END;
  703. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  704. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  705. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  706. IF scope.lastVariable # NIL THEN
  707. stackSize := scope.lastVariable.offsetInBits;
  708. IF stackSize <0 THEN stackSize := -stackSize END;
  709. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  710. END;
  711. END;
  712. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  713. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  714. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  715. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  716. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  717. ir.EmitAt(pc,Push(size));
  718. implementationVisitor.StaticCallOperand(result,procedure);
  719. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  720. END;
  721. *)
  722. END;
  723. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  724. IF stackSize > 0 THEN
  725. IF (stackSize MOD system.addressSize = 0) THEN
  726. null := IntermediateCode.Immediate(addressType,0);
  727. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  728. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  729. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  730. ELSE
  731. null := IntermediateCode.Immediate(int8,0);
  732. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  733. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  734. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  735. END;
  736. (*! should potentially be called by backend -- enter might initialize
  737. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  738. *)
  739. END;
  740. IF procedureType.callingConvention = SyntaxTree.WinAPICallingConvention THEN
  741. parametersSize := ProcedureParametersSize(backend.system,x);
  742. ELSE
  743. parametersSize := 0;
  744. END;
  745. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  746. finalizer := FALSE;
  747. IF backend.cooperative & x.isFinalizer THEN
  748. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  749. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  750. GetRecordTypeName(recordType,name);
  751. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  752. END;
  753. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  754. IF backend.cooperative THEN
  755. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  756. IF implementationVisitor.profile & ~isModuleBody THEN
  757. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  758. END;
  759. END;
  760. implementationVisitor.EmitLeave(ir, x.position,x,cc);
  761. IF finalizer THEN
  762. IF backend.hasLinkRegister THEN
  763. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  764. END;
  765. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  766. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  767. ir.Emit(Br(x.position,dest));
  768. ELSE
  769. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  770. END;
  771. ELSE
  772. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  773. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  774. END;
  775. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  776. IF backend.cooperative THEN
  777. IF HasPointers (scope) THEN
  778. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  779. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  780. ir.Emit(Result(x.position, res));
  781. ir.Emit(Push(x.position, res));
  782. implementationVisitor.ResetVariables(scope);
  783. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  784. ir.Emit(Pop(x.position, res));
  785. ir.Emit(Return(x.position, res));
  786. ELSE
  787. implementationVisitor.ResetVariables(scope);
  788. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  789. END;
  790. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  791. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  792. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  793. ir.Emit(Result(x.position, res));
  794. ir.Emit(Push(x.position, res));
  795. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  796. ir.Emit(Pop(x.position, res));
  797. ir.Emit(Return(x.position, res));
  798. ELSE
  799. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  800. END;
  801. END;
  802. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  803. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  804. ELSE
  805. ir.Emit(Nop(x.position));
  806. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  807. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  808. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  809. END;
  810. END;
  811. END
  812. END;
  813. ELSE (* force body for procedures *)
  814. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  815. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  816. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  817. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  818. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  819. END;
  820. Scope(scope);
  821. Signature;
  822. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  823. currentScope := prevScope;
  824. END Procedure;
  825. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  826. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  827. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  828. BEGIN
  829. ASSERT (bodyProcedure # NIL);
  830. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  831. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  832. procedure.SetScope(bodyProcedure.scope);
  833. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  834. procedure.SetAccess(SyntaxTree.Hidden);
  835. Global.GetSymbolSegmentedName (procedure,name);
  836. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  837. ir.SetExported(TRUE);
  838. Global.GetSymbolSegmentedName (bodyProcedure,name);
  839. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  840. implementationVisitor.currentScope := module.module.moduleScope;
  841. implementationVisitor.section := ir;
  842. implementationVisitor.PushSelfPointer();
  843. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  844. ELSIF backend.preregisterStatic THEN
  845. implementationVisitor.currentScope := module.module.moduleScope;
  846. implementationVisitor.section := ir;
  847. implementationVisitor.PushSelfPointer();
  848. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  849. ELSE
  850. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  851. ir.Emit(Call(bodyProcedure.position,op, 0));
  852. END;
  853. END AddBodyCallStub;
  854. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  855. VAR name: Basic.SegmentedName;
  856. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  857. BEGIN
  858. Global.GetSymbolSegmentedName (symbol,name);
  859. Basic.RemoveSuffix(name);
  860. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  861. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  862. ir.SetExported(TRUE);
  863. IntermediateCode.InitImmediate(op,addressType,initStack);
  864. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  865. END AddStackAllocation;
  866. (** entry function to visit a complete module *)
  867. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  868. VAR
  869. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  870. hasDynamicOperatorDeclarations: BOOLEAN;
  871. operator: SyntaxTree.Operator;
  872. import: SyntaxTree.Import;
  873. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  874. BEGIN
  875. type := type.resolved;
  876. IF type IS SyntaxTree.RecordType THEN
  877. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  878. ELSIF (type IS SyntaxTree.ArrayType) THEN
  879. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  880. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  881. END;
  882. ELSIF type IS SyntaxTree.MathArrayType THEN
  883. WITH type: SyntaxTree.MathArrayType DO
  884. IF type.form = SyntaxTree.Open THEN
  885. RETURN TRUE
  886. ELSIF type.form = SyntaxTree.Static THEN
  887. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  888. END;
  889. END;
  890. END;
  891. RETURN FALSE
  892. END TypeNeedsInitialization;
  893. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  894. VAR variable: SyntaxTree.Variable;
  895. BEGIN
  896. variable := scope.firstVariable;
  897. WHILE variable # NIL DO
  898. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  899. IF variable.initializer # NIL THEN RETURN TRUE END;
  900. variable := variable.nextVariable;
  901. END;
  902. RETURN FALSE
  903. END ScopeNeedsInitialization;
  904. BEGIN
  905. ASSERT(x # NIL); ASSERT(module # NIL);
  906. SELF.module := module;
  907. (* add import names to the generated Sections.Module *)
  908. import := x.moduleScope.firstImport;
  909. WHILE import # NIL DO
  910. import.module.GetName(idstr);
  911. module.imports.AddName(idstr);
  912. import := import.nextImport
  913. END;
  914. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  915. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  916. moduleSelf := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@moduleSelf"));
  917. moduleSelf.SetType(system.anyType);
  918. moduleSelf.SetScope(x.moduleScope);
  919. moduleSelf.SetUntraced(TRUE);
  920. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  921. ir.SetExported(TRUE);
  922. IntermediateCode.InitImmediate(op,addressType,0);
  923. ir.Emit(Data(Basic.invalidPosition,op));
  924. END;
  925. implementationVisitor.module := module;
  926. implementationVisitor.moduleScope := x.moduleScope;
  927. implementationVisitor.moduleSelf := moduleSelf;
  928. implementationVisitor.canBeLoaded := TRUE;
  929. meta.SetModule(module);
  930. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  931. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  932. END;
  933. IF backend.profile THEN
  934. EnsureBodyProcedure(x.moduleScope);
  935. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  936. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  937. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  938. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  939. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  940. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  941. Global.GetModuleName(module.module,idstr);
  942. implementationVisitor.ProfilerAddModule(idstr);
  943. implementationVisitor.numberProcedures := 0;
  944. END;
  945. implementationVisitor.profile := backend.profile;
  946. (* check if there is at least one dynamic operator locally defined *)
  947. hasDynamicOperatorDeclarations := FALSE;
  948. operator := x.moduleScope.firstOperator;
  949. WHILE operator # NIL DO
  950. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  951. operator := operator.nextOperator
  952. END;
  953. (* add operator initialization code section *)
  954. IF hasDynamicOperatorDeclarations THEN
  955. EnsureBodyProcedure(x.moduleScope);
  956. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  957. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  958. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  959. END;
  960. Scope(x.moduleScope);
  961. IF hasDynamicOperatorDeclarations THEN
  962. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  963. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  964. END;
  965. IF backend.profile THEN
  966. implementationVisitor.ProfilerPatchInit;
  967. END;
  968. END Module;
  969. END DeclarationVisitor;
  970. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  971. RegisterUsageCount*=OBJECT
  972. VAR used: UsedArray; count: LONGINT;
  973. PROCEDURE &Init;
  974. VAR i: LONGINT;
  975. BEGIN
  976. count := 0;
  977. IF used = NIL THEN NEW(used,64); END;
  978. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  979. END Init;
  980. PROCEDURE Grow;
  981. VAR new: UsedArray; size,i: LONGINT;
  982. BEGIN
  983. size := LEN(used)*2;
  984. NEW(new,size);
  985. FOR i := 0 TO LEN(used)-1 DO
  986. new[i].count := used[i].count;
  987. new[i].type := used[i].type;
  988. new[i].map := used[i].map
  989. END;
  990. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  991. used := new
  992. END Grow;
  993. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  994. BEGIN
  995. INC(count);
  996. IF count = LEN(used) THEN Grow END;
  997. used[count].type := type;
  998. used[count].class := class;
  999. used[count].map := count;
  1000. RETURN count;
  1001. END Next;
  1002. PROCEDURE IncUse(register: LONGINT);
  1003. BEGIN
  1004. INC(used[register].count);
  1005. (*
  1006. IF (register = 1) & (count > 30) THEN
  1007. D.TraceBack;
  1008. END;
  1009. *)
  1010. END IncUse;
  1011. PROCEDURE DecUse(register: LONGINT);
  1012. BEGIN
  1013. DEC(used[register].count);
  1014. END DecUse;
  1015. PROCEDURE Map(register: LONGINT): LONGINT;
  1016. VAR map : LONGINT;
  1017. BEGIN
  1018. IF register > 0 THEN
  1019. map := used[register].map;
  1020. WHILE register # map DO register := map; map := used[register].map END;
  1021. END;
  1022. RETURN register
  1023. END Map;
  1024. PROCEDURE Use(register: LONGINT): LONGINT;
  1025. BEGIN
  1026. IF register< LEN(used) THEN
  1027. RETURN used[register].count
  1028. ELSE
  1029. RETURN 0
  1030. END
  1031. END Use;
  1032. END RegisterUsageCount;
  1033. RegisterEntry = POINTER TO RECORD
  1034. prev,next: RegisterEntry;
  1035. register: LONGINT;
  1036. registerClass: IntermediateCode.RegisterClass;
  1037. type: IntermediateCode.Type;
  1038. END;
  1039. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1040. Variables = OBJECT (Basic.List)
  1041. VAR
  1042. inUse: VariableUse;
  1043. registerIndex: LONGINT;
  1044. nameIndex: LONGINT;
  1045. PROCEDURE & Init;
  1046. VAR i: LONGINT;
  1047. BEGIN
  1048. InitList(16);
  1049. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1050. registerIndex := 1024;
  1051. nameIndex := 0;
  1052. END Init;
  1053. PROCEDURE Clear*;
  1054. VAR i: LONGINT;
  1055. BEGIN
  1056. Clear^;
  1057. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1058. registerIndex := 1024;
  1059. nameIndex := 0;
  1060. END Clear;
  1061. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1062. VAR string: SyntaxTree.IdentifierString ;
  1063. BEGIN
  1064. COPY("@hiddenIRVar",string);
  1065. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1066. RETURN SyntaxTree.NewIdentifier(string);
  1067. END GetUID;
  1068. PROCEDURE GetUsage(VAR use: VariableUse);
  1069. BEGIN
  1070. use := inUse;
  1071. END GetUsage;
  1072. PROCEDURE SetUsage(CONST use: VariableUse);
  1073. BEGIN
  1074. inUse := use;
  1075. END SetUsage;
  1076. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1077. VAR any: ANY;
  1078. BEGIN
  1079. any := Get(i);
  1080. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1081. END GetVariable;
  1082. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1083. BEGIN
  1084. Set(pos, v);
  1085. END SetVariable;
  1086. PROCEDURE Occupy(pos: LONGINT);
  1087. BEGIN
  1088. INCL(inUse[pos DIV 32], pos MOD 32);
  1089. END Occupy;
  1090. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1091. BEGIN
  1092. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1093. END Occupied;
  1094. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1095. BEGIN
  1096. Occupy(Length());
  1097. Add(v);
  1098. END AddVariable;
  1099. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1100. BEGIN
  1101. t1 := t1.resolved;
  1102. t2 := t2.resolved;
  1103. (*RETURN t1.SameType(t2); *)
  1104. RETURN
  1105. (t1.SameType(t2))
  1106. OR
  1107. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1108. OR
  1109. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits = t2.sizeInBits)
  1110. OR
  1111. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1112. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1113. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1114. OR
  1115. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1116. (DynamicDim(t1) = DynamicDim(t2))
  1117. );
  1118. END CompatibleType;
  1119. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1120. VAR var : SyntaxTree.Variable; i: LONGINT;
  1121. BEGIN
  1122. pos := Length();
  1123. FOR i := 0 TO pos-1 DO
  1124. IF ~(Occupied(i)) THEN
  1125. var := GetVariable(i);
  1126. IF CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1127. pos := i;
  1128. Occupy(i);
  1129. RETURN var;
  1130. END;
  1131. END;
  1132. END;
  1133. RETURN NIL
  1134. END GetFreeVariable;
  1135. END Variables;
  1136. SymbolMap = POINTER TO RECORD
  1137. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1138. isAddress: BOOLEAN;
  1139. END;
  1140. SymbolMapper = OBJECT
  1141. VAR
  1142. first: SymbolMap;
  1143. PROCEDURE & Init;
  1144. BEGIN
  1145. first := NIL;
  1146. END Init;
  1147. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1148. VAR new: SymbolMap;
  1149. BEGIN
  1150. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1151. new.next := first; first := new;
  1152. END Add;
  1153. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1154. VAR s: SymbolMap;
  1155. BEGIN
  1156. s := first;
  1157. WHILE (s # NIL) & (s.this # this) DO
  1158. s := s.next
  1159. END;
  1160. RETURN s
  1161. END Get;
  1162. END SymbolMapper;
  1163. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1164. VAR
  1165. system: Global.System;
  1166. section: IntermediateCode.Section;
  1167. module: Sections.Module;
  1168. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1169. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1170. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1171. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1172. checker: SemanticChecker.Checker;
  1173. backend: IntermediateBackend;
  1174. meta: MetaDataGenerator;
  1175. position: Position;
  1176. moduleSelf: SyntaxTree.Variable;
  1177. (* variables for hand over of variables / temporary state *)
  1178. currentScope: SyntaxTree.Scope;
  1179. constantDeclaration : SyntaxTree.Symbol;
  1180. result: Operand; (* result of the most recent expression / statement *)
  1181. destination: IntermediateCode.Operand;
  1182. arrayDestinationTag: IntermediateCode.Operand;
  1183. arrayDestinationDimension:LONGINT;
  1184. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1185. conditional: BOOLEAN;
  1186. trueLabel, falseLabel, exitLabel: Label;
  1187. locked: BOOLEAN;
  1188. (*
  1189. usedRegisters: Registers;
  1190. *)
  1191. registerUsageCount: RegisterUsageCount;
  1192. usedRegisters: RegisterEntry;
  1193. (* useful operands and types *)
  1194. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1195. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1196. commentPrintout: Printout.Printer;
  1197. dump: Streams.Writer;
  1198. tagsAvailable : BOOLEAN;
  1199. supportedInstruction: SupportedInstructionProcedure;
  1200. supportedImmediate: SupportedImmediateProcedure;
  1201. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1202. emitLabels: BOOLEAN;
  1203. runtimeModuleName : SyntaxTree.IdentifierString;
  1204. newObjectFile: BOOLEAN;
  1205. indexCounter: LONGINT;
  1206. profile: BOOLEAN;
  1207. profileId, profileInit: IntermediateCode.Section;
  1208. profileInitPatchPosition: LONGINT;
  1209. numberProcedures: LONGINT;
  1210. procedureResultDesignator : SyntaxTree.Designator;
  1211. operatorInitializationCodeSection: IntermediateCode.Section;
  1212. fingerPrinter: FingerPrinter.FingerPrinter;
  1213. temporaries: Variables;
  1214. canBeLoaded : BOOLEAN;
  1215. currentIsInline: BOOLEAN;
  1216. currentMapper: SymbolMapper;
  1217. currentInlineExit: Label;
  1218. moduleBodySection: IntermediateCode.Section;
  1219. NeedDescriptor : BOOLEAN;
  1220. cooperativeSwitches: BOOLEAN;
  1221. lastSwitchPC: LONGINT;
  1222. isUnchecked: BOOLEAN;
  1223. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1224. newObjectFile: BOOLEAN);
  1225. BEGIN
  1226. SELF.system := system;
  1227. SELF.runtimeModuleName := runtime;
  1228. currentScope := NIL;
  1229. hiddenPointerType := NIL;
  1230. delegatePointerType := NIL;
  1231. awaitProcCounter := 0;
  1232. labelId := 0; constId := 0; labelId := 0;
  1233. SELF.checker := checker;
  1234. SELF.backend := backend;
  1235. position := Basic.invalidPosition;
  1236. conditional := FALSE;
  1237. locked := FALSE;
  1238. InitOperand(result,ModeUndefined);
  1239. addressType := IntermediateCode.GetType(system,system.addressType);
  1240. setType := IntermediateCode.GetType(system,system.setType);
  1241. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1242. lenType := IntermediateCode.GetType(system, system.lenType);
  1243. byteType := IntermediateCode.GetType(system, system.byteType);
  1244. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1245. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1246. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1247. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1248. nil := IntermediateCode.Immediate(addressType,0);
  1249. one := IntermediateCode.Immediate(addressType,1);
  1250. IntermediateCode.InitOperand(destination);
  1251. tagsAvailable := TRUE;
  1252. supportedInstruction := supportedInstructionProcedure;
  1253. supportedImmediate := supportedImmediateProcedure;
  1254. inData := FALSE;
  1255. SELF.emitLabels := emitLabels;
  1256. IntermediateCode.InitOperand(arrayDestinationTag);
  1257. bool := IntermediateCode.GetType(system,system.booleanType);
  1258. IntermediateCode.InitImmediate(false,bool,0);
  1259. IntermediateCode.InitImmediate(true,bool,1);
  1260. SELF.newObjectFile := newObjectFile;
  1261. indexCounter := 0;
  1262. NEW(registerUsageCount);
  1263. usedRegisters := NIL;
  1264. procedureResultDesignator := NIL;
  1265. NEW(fingerPrinter);
  1266. NEW(temporaries);
  1267. currentIsInline := FALSE;
  1268. NeedDescriptor := FALSE;
  1269. isUnchecked := backend.noRuntimeChecks;
  1270. END Init;
  1271. TYPE Context = RECORD
  1272. section: IntermediateCode.Section;
  1273. registerUsageCount: RegisterUsageCount;
  1274. usedRegisters: RegisterEntry;
  1275. temporaries: Variables;
  1276. END;
  1277. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1278. VAR context: Context;
  1279. BEGIN
  1280. context.section := section;
  1281. context.registerUsageCount := registerUsageCount;
  1282. context.usedRegisters := usedRegisters;
  1283. context.temporaries := temporaries;
  1284. section := new;
  1285. NEW(registerUsageCount);
  1286. NEW(temporaries);
  1287. usedRegisters := NIL;
  1288. RETURN context;
  1289. END SwitchContext;
  1290. PROCEDURE ReturnToContext(context: Context);
  1291. BEGIN
  1292. section := context.section;
  1293. registerUsageCount := context.registerUsageCount;
  1294. usedRegisters := context.usedRegisters;
  1295. temporaries := context.temporaries;
  1296. END ReturnToContext;
  1297. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1298. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1299. BEGIN
  1300. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1301. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1302. END;
  1303. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1304. section.SetExported(IsExported(syntaxTreeSymbol));
  1305. RETURN section
  1306. END NewSection;
  1307. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1308. VAR new: LONGINT;
  1309. BEGIN
  1310. new := registerUsageCount.Next(type,class);
  1311. UseRegister(new);
  1312. RETURN new
  1313. END AcquireRegister;
  1314. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1315. VAR
  1316. fingerPrint: SyntaxTree.FingerPrint;
  1317. fingerPrintString: ARRAY 32 OF CHAR;
  1318. BEGIN
  1319. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1320. string := "[";
  1321. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1322. Strings.Append(string, fingerPrintString);
  1323. Strings.Append(string, "]");
  1324. END GetFingerprintString;
  1325. (** get the name for the code section that represens a certain symbol
  1326. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1327. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1328. VAR string: ARRAY 32 OF CHAR;
  1329. BEGIN
  1330. Global.GetSymbolSegmentedName(symbol, name);
  1331. (* if the symbol is an operator, then append the fingerprint to the name *)
  1332. IF symbol IS SyntaxTree.Operator THEN
  1333. GetFingerprintString(symbol, string);
  1334. Basic.AppendToSegmentedName(name,string);
  1335. END
  1336. END GetCodeSectionNameForSymbol;
  1337. (** get the name for the code section that represens a certain symbol
  1338. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1339. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1340. VAR string: ARRAY 32 OF CHAR;
  1341. BEGIN
  1342. Global.GetSymbolNameInScope(symbol, scope, name);
  1343. (* if the symbol is an operator, then append the fingerprint to the name *)
  1344. IF symbol IS SyntaxTree.Operator THEN
  1345. GetFingerprintString(symbol, string);
  1346. Strings.Append(name, string);
  1347. END
  1348. END GetCodeSectionNameForSymbolInScope;
  1349. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1350. BEGIN
  1351. IF dump # NIL THEN
  1352. dump.String("enter "); dump.String(s); dump.Ln;
  1353. END;
  1354. END TraceEnter;
  1355. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1356. BEGIN
  1357. IF dump # NIL THEN
  1358. dump.String("exit "); dump.String(s); dump.Ln;
  1359. END;
  1360. END TraceExit;
  1361. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1362. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1363. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1364. VAR i: LONGINT;
  1365. BEGIN
  1366. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1367. IF op.rule # NIL THEN
  1368. FOR i := 0 TO LEN(op.rule)-1 DO
  1369. CheckRegister(op.rule[i])
  1370. END;
  1371. END;
  1372. END CheckRegister;
  1373. BEGIN
  1374. CheckRegister(instruction.op1);
  1375. CheckRegister(instruction.op2);
  1376. CheckRegister(instruction.op3);
  1377. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1378. ELSE section.Emit(instruction);
  1379. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1380. END;
  1381. END Emit;
  1382. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1383. BEGIN
  1384. IF backend.cooperative THEN
  1385. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1386. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1387. ELSE
  1388. Emit(Trap(position,trapNo));
  1389. END;
  1390. END EmitTrap;
  1391. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1392. VAR name: Basic.SegmentedName;
  1393. VAR op1, op2, reg: IntermediateCode.Operand;
  1394. VAR call, nocall: Label;
  1395. VAR parametersSize: LONGINT;
  1396. VAR prevSection: IntermediateCode.Section;
  1397. VAR prevDump: Streams.Writer;
  1398. VAR body: SyntaxTree.Body;
  1399. VAR procedureType: SyntaxTree.ProcedureType;
  1400. BEGIN
  1401. IF procedure # NIL THEN
  1402. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1403. ELSE procedureType := NIL;
  1404. END;
  1405. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1406. prevSection := SELF.section;
  1407. SELF.section := section;
  1408. prevDump := dump;
  1409. dump := section.comments;
  1410. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1411. IF backend.hasLinkRegister THEN
  1412. Emit(Push(Basic.invalidPosition, lr));
  1413. END;
  1414. Emit(Push(Basic.invalidPosition,fp));
  1415. IF procedure # NIL THEN
  1416. body := procedure.procedureScope.body;
  1417. ELSE
  1418. body := NIL;
  1419. END;
  1420. IF backend.cooperative THEN
  1421. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1422. GetCodeSectionNameForSymbol(procedure, name);
  1423. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1424. ELSE
  1425. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1426. END;
  1427. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1428. IntermediateCode.AddOffset(op1, 1);
  1429. Emit(Push(Basic.invalidPosition,op1));
  1430. Emit(Mov(Basic.invalidPosition,fp, sp));
  1431. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1432. NEW(call, section);
  1433. NEW(nocall, section);
  1434. reg := NewRegisterOperand(addressType);
  1435. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1436. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1437. BrltL(call, sp, reg);
  1438. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1439. BrgeL(nocall, sp, op2);
  1440. call.Resolve(section.pc);
  1441. Emit(Push(Basic.invalidPosition, reg));
  1442. ReleaseIntermediateOperand(reg);
  1443. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1444. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1445. Emit(Push(Basic.invalidPosition, op2));
  1446. CallThis(position, "Activities","ExpandStack",2);
  1447. Emit(Result(Basic.invalidPosition, sp));
  1448. nocall.Resolve(section.pc);
  1449. END;
  1450. ELSE
  1451. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1452. Emit(Push(Basic.invalidPosition, one)) ;
  1453. procedureType.SetParametersOffset(1);
  1454. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1455. END;
  1456. Emit(Mov(Basic.invalidPosition, fp, sp));
  1457. END;
  1458. END;
  1459. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1460. SELF.section := prevSection;
  1461. dump := prevDump;
  1462. END EmitEnter;
  1463. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1464. VAR op1,op2: IntermediateCode.Operand;
  1465. VAR instruction: IntermediateCode.Instruction;
  1466. BEGIN
  1467. IntermediateCode.InitNumber(op1,callconv);
  1468. IntermediateCode.InitNumber(op2,varSize);
  1469. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1470. RETURN instruction
  1471. END Enter;
  1472. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1473. VAR op1: IntermediateCode.Operand;
  1474. VAR instruction: IntermediateCode.Instruction;
  1475. BEGIN
  1476. IntermediateCode.InitNumber(op1,callconv);
  1477. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1478. RETURN instruction
  1479. END Leave;
  1480. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1481. VAR prevSection: IntermediateCode.Section;
  1482. VAR op2, size: IntermediateCode.Operand;
  1483. VAR body: SyntaxTree.Body;
  1484. BEGIN
  1485. prevSection := SELF.section;
  1486. SELF.section := section;
  1487. Emit(Leave(position, callconv));
  1488. IF procedure # NIL THEN
  1489. body := procedure.procedureScope.body;
  1490. ELSE
  1491. body := NIL;
  1492. END;
  1493. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1494. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1495. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1496. Emit(Add(position, sp, fp, op2));
  1497. ELSE
  1498. Emit(Mov(position, sp, fp));
  1499. END;
  1500. Emit(Pop(position, fp));
  1501. END;
  1502. SELF.section := prevSection;
  1503. END EmitLeave;
  1504. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1505. VAR m: SymbolMap;
  1506. BEGIN
  1507. position := x.position;
  1508. IF currentIsInline THEN
  1509. m := currentMapper.Get(x);
  1510. IF m # NIL THEN
  1511. (*
  1512. Printout.Info("mapping from", x);
  1513. Printout.Info("mapping to ", m.to);
  1514. *)
  1515. m.to.Accept(SELF);
  1516. op := result;
  1517. IF m.tag # NIL THEN
  1518. ReleaseIntermediateOperand(result.tag);
  1519. m.tag.Accept(SELF);
  1520. op.tag := result.op;
  1521. ReleaseIntermediateOperand(result.tag);
  1522. END;
  1523. RETURN
  1524. END;
  1525. END;
  1526. x.Accept(SELF);
  1527. op := result;
  1528. END Symbol;
  1529. PROCEDURE Expression(x: SyntaxTree.Expression);
  1530. BEGIN
  1531. position := x.position;
  1532. constantDeclaration := NIL;
  1533. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1534. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1535. END;
  1536. IF x.resolved # NIL THEN
  1537. x.resolved.Accept(SELF)
  1538. ELSE
  1539. x.Accept(SELF)
  1540. END;
  1541. (* check this, was commented out in ActiveCells3 *)
  1542. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1543. Error(x.position, "unsupported modifier");
  1544. END;
  1545. END Expression;
  1546. (*
  1547. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1548. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1549. BEGIN
  1550. temporaries.GetUsage(current);
  1551. FOR i := 0 TO LEN(current)-1 DO
  1552. set := current[i] - previous[i];
  1553. IF set # {} THEN
  1554. FOR j := 0 TO MAX(SET)-1 DO
  1555. IF j IN set THEN
  1556. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1557. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1558. Symbol(variable, op);
  1559. MakeMemory(tmp,op.op,addressType,0);
  1560. ReleaseOperand(op);
  1561. Emit(Mov(position,tmp, nil ) );
  1562. ReleaseIntermediateOperand(tmp);
  1563. END;
  1564. END;
  1565. END;
  1566. END;
  1567. END;
  1568. END ResetUsedTemporaries;
  1569. *)
  1570. PROCEDURE Statement(x: SyntaxTree.Statement);
  1571. VAR use: VariableUse;
  1572. BEGIN
  1573. temporaries.GetUsage(use);
  1574. position := x.position;
  1575. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1576. IF commentPrintout # NIL THEN
  1577. commentPrintout.Statement(x);
  1578. dump.Ln;
  1579. (*dump.Update;*)
  1580. END;
  1581. x.Accept(SELF);
  1582. (*
  1583. CheckRegistersFree();
  1584. *)
  1585. (*ResetUsedTemporaries(use);*)
  1586. temporaries.SetUsage(use);
  1587. END Statement;
  1588. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1589. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1590. *)
  1591. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1592. BEGIN
  1593. ASSERT(op.mode # IntermediateCode.Undefined);
  1594. IF op.mode = IntermediateCode.ModeMemory THEN
  1595. ReuseCopy(res,op);
  1596. ELSE
  1597. res := op;
  1598. UseIntermediateOperand(res);
  1599. END;
  1600. IntermediateCode.AddOffset(res,offset);
  1601. IntermediateCode.MakeMemory(res,type);
  1602. END MakeMemory;
  1603. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1604. VAR mem: IntermediateCode.Operand;
  1605. BEGIN
  1606. MakeMemory(mem,res,type,offset);
  1607. ReleaseIntermediateOperand(res);
  1608. res := mem;
  1609. END ToMemory;
  1610. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1611. VAR mem: IntermediateCode.Operand;
  1612. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1613. componentType: SyntaxTree.Type;
  1614. BEGIN
  1615. type := type.resolved;
  1616. IF operand.mode = ModeReference THEN
  1617. IF type IS SyntaxTree.RangeType THEN
  1618. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1619. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1620. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1621. ReleaseOperand(operand);
  1622. operand.op := firstOp;
  1623. operand.tag := lastOp;
  1624. operand.extra := stepOp;
  1625. ELSIF type IS SyntaxTree.ComplexType THEN
  1626. componentType := type(SyntaxTree.ComplexType).componentType;
  1627. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1628. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1629. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1630. ReleaseOperand(operand);
  1631. operand.op := firstOp;
  1632. operand.tag := lastOp
  1633. ELSE
  1634. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1635. ReleaseIntermediateOperand(operand.op);
  1636. operand.op := mem;
  1637. END;
  1638. operand.mode := ModeValue;
  1639. END;
  1640. ASSERT(operand.mode = ModeValue);
  1641. END LoadValue;
  1642. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1643. VAR prevConditional: BOOLEAN;
  1644. BEGIN
  1645. prevConditional := conditional;
  1646. conditional := FALSE;
  1647. InitOperand(result, ModeUndefined);
  1648. Expression(x);
  1649. op := result;
  1650. LoadValue(op,x.type.resolved);
  1651. conditional := prevConditional;
  1652. END Evaluate;
  1653. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1654. VAR prevConditional: BOOLEAN;
  1655. BEGIN
  1656. prevConditional := conditional;
  1657. conditional := FALSE;
  1658. InitOperand(result,ModeUndefined);
  1659. Expression(x);
  1660. op := result;
  1661. (*
  1662. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1663. *)
  1664. conditional := prevConditional;
  1665. END Designate;
  1666. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1667. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1668. BEGIN
  1669. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1670. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1671. conditional := TRUE;
  1672. trueLabel := trueL; falseLabel := falseL;
  1673. Expression(x);
  1674. trueL := trueLabel; falseL := falseLabel;
  1675. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1676. END Condition;
  1677. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1678. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1679. BEGIN
  1680. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1681. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1682. RETURN op
  1683. END NewRegisterOperand;
  1684. PROCEDURE UnuseRegister(register: LONGINT);
  1685. BEGIN
  1686. IF (register > 0) THEN
  1687. register := registerUsageCount.Map(register);
  1688. registerUsageCount.DecUse(register);
  1689. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1690. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1691. END;
  1692. IF registerUsageCount.Use(register)=0 THEN
  1693. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1694. Warning(position, "register cannot be removed");
  1695. END;
  1696. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1697. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1698. END;
  1699. ELSIF registerUsageCount.Use(register)<0 THEN
  1700. Warning(position, "register removed too often");
  1701. IF dump # NIL THEN
  1702. dump.String("register removed too often"); dump.Ln; dump.Update;
  1703. END;
  1704. END;
  1705. END;
  1706. END UnuseRegister;
  1707. PROCEDURE UseRegister(register: LONGINT);
  1708. BEGIN
  1709. IF (register > 0) THEN
  1710. register := registerUsageCount.Map(register);
  1711. registerUsageCount.IncUse(register);
  1712. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1713. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1714. END;
  1715. IF registerUsageCount.Use(register)=1 THEN
  1716. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1717. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1718. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1719. END;
  1720. END;
  1721. END;
  1722. END UseRegister;
  1723. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1724. BEGIN
  1725. UnuseRegister(op.register)
  1726. END ReleaseIntermediateOperand;
  1727. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1728. BEGIN
  1729. UseRegister(op.register)
  1730. END UseIntermediateOperand;
  1731. PROCEDURE ReleaseOperand(CONST op: Operand);
  1732. BEGIN
  1733. UnuseRegister(op.op.register);
  1734. UnuseRegister(op.tag.register);
  1735. UnuseRegister(op.extra.register);
  1736. END ReleaseOperand;
  1737. (* save registers marked in array "markedRegisters" to the stack
  1738. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1739. *)
  1740. PROCEDURE SaveRegisters();
  1741. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1742. BEGIN
  1743. entry := usedRegisters;
  1744. WHILE entry # NIL DO
  1745. type := registerUsageCount.used[entry.register].type;
  1746. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1747. Emit(Push(position,op));
  1748. entry := entry.next;
  1749. END;
  1750. END SaveRegisters;
  1751. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1752. BEGIN
  1753. saved := usedRegisters;
  1754. usedRegisters := NIL;
  1755. END ReleaseUsedRegisters;
  1756. (** remove parameter registers from used queue *)
  1757. PROCEDURE ReleaseParameterRegisters;
  1758. VAR entry,prev,next: RegisterEntry;
  1759. BEGIN
  1760. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1761. WHILE entry # NIL DO
  1762. next := entry.next;
  1763. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1764. registerUsageCount.DecUse(entry.register);
  1765. ASSERT(registerUsageCount.Use(entry.register)=0);
  1766. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1767. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1768. END;
  1769. ELSIF prev = NIL THEN
  1770. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1771. ELSE
  1772. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1773. END;
  1774. entry := next;
  1775. END;
  1776. END ReleaseParameterRegisters;
  1777. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1778. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1779. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1780. BEGIN
  1781. entry := saved;
  1782. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1783. entry := prev;
  1784. WHILE entry # NIL DO
  1785. prev := entry.prev;
  1786. type := entry.type;
  1787. class := entry.registerClass;
  1788. IntermediateCode.InitRegister(op,type,class,entry.register);
  1789. (*
  1790. new := registerUsageCount.Next(type,class);
  1791. registerUsageCount.Remap(entry.register,new);
  1792. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1793. dump.String("remap register "); dump.Int(entry.register,1);
  1794. dump.String("to "); dump.Int(new,1);
  1795. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1796. END;
  1797. entry.register := new;
  1798. *)
  1799. Emit(Pop(position,op));
  1800. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1801. entry := prev;
  1802. END;
  1803. (*
  1804. usedRegisters := saved;
  1805. *)
  1806. END RestoreRegisters;
  1807. PROCEDURE CheckRegistersFree;
  1808. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1809. BEGIN
  1810. IF usedRegisters # NIL THEN
  1811. r := usedRegisters;
  1812. WHILE r # NIL DO
  1813. warning := "register ";
  1814. Strings.AppendInt(warning, r.register);
  1815. Strings.Append(warning, " not released.");
  1816. Warning(position,warning);
  1817. r := r .next;
  1818. END;
  1819. END;
  1820. FOR i := 0 TO registerUsageCount.count-1 DO
  1821. IF registerUsageCount.used[i].count < 0 THEN
  1822. warning := "register ";
  1823. Strings.AppendInt(warning, i);
  1824. Strings.Append(warning, " unused too often.");
  1825. Warning(position,warning);
  1826. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1827. warning := "register ";
  1828. Strings.AppendInt(warning, i);
  1829. Strings.Append(warning, " not unused often enough.");
  1830. Warning(position,warning);
  1831. END;
  1832. END;
  1833. END CheckRegistersFree;
  1834. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1835. Otherwise allocate a new register.
  1836. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1837. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1838. BEGIN
  1839. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1840. UseIntermediateOperand(result);
  1841. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1842. UseIntermediateOperand(result);
  1843. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1844. END;
  1845. END Reuse2;
  1846. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1847. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1848. If not then allocate a new register.
  1849. Does NOT necessarily keep the content of src1 or src2 in result!
  1850. *)
  1851. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1852. BEGIN
  1853. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1854. UseIntermediateOperand(result);
  1855. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1856. UseIntermediateOperand(result);
  1857. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1858. result := alternative; alternative := emptyOperand;
  1859. UseIntermediateOperand(result);
  1860. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1861. END;
  1862. END Reuse2a;
  1863. (* like reuse2 but only one source *)
  1864. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1865. BEGIN
  1866. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1867. UseIntermediateOperand(result);
  1868. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1869. END;
  1870. END Reuse1;
  1871. (* like reuse2a but only one source *)
  1872. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1873. BEGIN
  1874. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1875. UseIntermediateOperand(result);
  1876. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1877. UseIntermediateOperand(result);
  1878. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1879. END;
  1880. END Reuse1a;
  1881. (* like reuse1 but guarantees that content of src1 is in result *)
  1882. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1883. BEGIN
  1884. IF ReusableRegister(src1) THEN
  1885. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1886. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1887. UseIntermediateOperand(result);
  1888. ELSE
  1889. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1890. Emit(Mov(position,result,src1));
  1891. END
  1892. END ReuseCopy;
  1893. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1894. BEGIN
  1895. IF ReusableRegister(src) THEN
  1896. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1897. ELSE
  1898. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1899. Emit(Mov(position,result,src));
  1900. ReleaseIntermediateOperand(src);
  1901. END
  1902. END TransferToRegister;
  1903. (** labels and branches **)
  1904. PROCEDURE NewLabel(): Label;
  1905. VAR label: Label;
  1906. BEGIN
  1907. NEW(label,section); RETURN label;
  1908. END NewLabel;
  1909. PROCEDURE SetLabel(label: Label);
  1910. BEGIN label.Resolve(section.pc);
  1911. END SetLabel;
  1912. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1913. BEGIN
  1914. ASSERT(label # NIL);
  1915. IF label.pc < 0 THEN (* label not yet set *)
  1916. label.AddFixup(section.pc);
  1917. END;
  1918. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1919. END LabelOperand;
  1920. PROCEDURE BrL(label: Label);
  1921. BEGIN
  1922. Emit(Br(position,LabelOperand(label)));
  1923. END BrL;
  1924. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1925. BEGIN
  1926. Emit(Brge(position,LabelOperand(label),left,right));
  1927. END BrgeL;
  1928. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1929. BEGIN
  1930. Emit(Brlt(position,LabelOperand(label),left,right));
  1931. END BrltL;
  1932. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1933. BEGIN
  1934. Emit(Breq(position,LabelOperand(label),left,right));
  1935. END BreqL;
  1936. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1937. BEGIN
  1938. Emit(Brne(position,LabelOperand(label),left,right));
  1939. END BrneL;
  1940. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1941. VAR new: IntermediateCode.Operand;
  1942. BEGIN
  1943. IF Trace THEN TraceEnter("Convert") END;
  1944. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1945. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1946. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1947. & (operand.offset = 0)
  1948. THEN
  1949. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1950. Emit(Conv(position,new,operand));
  1951. ELSE
  1952. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1953. Emit(Conv(position,new,operand));
  1954. ReleaseIntermediateOperand(operand);
  1955. END;
  1956. operand := new;
  1957. ELSIF (operand.mode = IntermediateCode.ModeImmediate) & (operand.symbol.name = "") & (operand.type.sizeInBits <= type.sizeInBits) & (operand.type.form IN IntermediateCode.Integer) & (type.form IN IntermediateCode.Integer) THEN
  1958. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1959. ELSE
  1960. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1961. Emit(Conv(position,new,operand));
  1962. ReleaseIntermediateOperand(operand);
  1963. operand := new;
  1964. END;
  1965. IF Trace THEN TraceExit("Convert") END;
  1966. END Convert;
  1967. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1968. VAR exit: Label;
  1969. BEGIN
  1970. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1971. exit := NewLabel();
  1972. br(exit,left,right);
  1973. EmitTrap(position,trapNo);
  1974. SetLabel(exit);
  1975. END TrapC;
  1976. (** expressions *)
  1977. (** emit necessary runtime check for set elements **)
  1978. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1979. VAR max: IntermediateCode.Operand;
  1980. BEGIN
  1981. IF isUnchecked THEN RETURN END;
  1982. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1983. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1984. TrapC(BrgeL, max, o, SetElementTrap);
  1985. END;
  1986. END CheckSetElement;
  1987. (** the set that a range represents **)
  1988. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1989. VAR
  1990. operand: Operand;
  1991. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1992. BEGIN
  1993. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1994. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1995. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1996. one := IntermediateCode.Immediate(setType, 1);
  1997. Evaluate(x, operand);
  1998. Convert(operand.op, setType);
  1999. Convert(operand.tag, setType);
  2000. CheckSetElement(operand.op);
  2001. CheckSetElement(operand.tag);
  2002. (* create mask for lower bound
  2003. i.e. shift 11111111 to the left by the value of the lower bound
  2004. *)
  2005. Reuse1(temp, operand.op);
  2006. Emit(Shl(position,temp, allBits, operand.op));
  2007. ReleaseIntermediateOperand(operand.op);
  2008. operand.op := temp;
  2009. (* create mask for upper bound
  2010. i.e. shift 11111111 to the right by the difference between the
  2011. upper bound and the maximum number of set elements
  2012. *)
  2013. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2014. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2015. Reuse1(temp, operand.tag);
  2016. ELSE
  2017. Reuse1(temp, operand.tag);
  2018. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2019. Emit(Sub(position,temp, size, operand.tag));
  2020. END;
  2021. Emit(Shr(position,temp, allBits, operand.tag));
  2022. ReleaseIntermediateOperand(operand.tag);
  2023. operand.tag := temp;
  2024. Reuse2(resultingSet, operand.op, operand.tag);
  2025. (* intersect the two masks *)
  2026. Emit(And(position,resultingSet, operand.op, operand.tag));
  2027. ReleaseOperand(operand);
  2028. RETURN resultingSet
  2029. END SetFromRange;
  2030. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2031. VAR
  2032. res, operand: Operand;
  2033. temp, one, noBits, dest: IntermediateCode.Operand;
  2034. expression: SyntaxTree.Expression;
  2035. i: LONGINT;
  2036. BEGIN
  2037. IF Trace THEN TraceEnter("VisitSet") END;
  2038. dest := destination;
  2039. destination := emptyOperand;
  2040. noBits := IntermediateCode.Immediate(setType, 0);
  2041. one := IntermediateCode.Immediate(setType, 1);
  2042. (* start off with the empty set *)
  2043. InitOperand(res, ModeValue);
  2044. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2045. Emit(Mov(position,res.op, noBits));
  2046. FOR i := 0 TO x.elements.Length() - 1 DO
  2047. expression := x.elements.GetExpression(i);
  2048. IF expression IS SyntaxTree.RangeExpression THEN
  2049. (* range of set elements *)
  2050. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2051. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2052. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2053. ReleaseIntermediateOperand(temp)
  2054. ELSE
  2055. (* singelton element *)
  2056. Evaluate(expression, operand);
  2057. Convert(operand.op, setType);
  2058. CheckSetElement(operand.op);
  2059. (* create subset containing single element *)
  2060. Reuse1(temp, operand.op);
  2061. Emit(Shl(position,temp, one, operand.op));
  2062. ReleaseOperand(operand);
  2063. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2064. ReleaseIntermediateOperand(temp);
  2065. END
  2066. END;
  2067. result := res;
  2068. destination := dest;
  2069. IF Trace THEN TraceExit("VisitSet") END;
  2070. END VisitSet;
  2071. (* math arrays of the form [a,b,c]
  2072. x is a static array and thus does not provide any pointers
  2073. *)
  2074. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2075. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2076. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2077. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2078. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2079. element: SyntaxTree.IntegerValue;
  2080. BEGIN
  2081. numberElements := x.elements.Length();
  2082. expression := index.parameters.GetExpression(dim);
  2083. element := expression(SyntaxTree.IntegerValue);
  2084. FOR i := 0 TO numberElements-1 DO
  2085. expression := x.elements.GetExpression(i);
  2086. element.SetValue(i);
  2087. IF expression IS SyntaxTree.MathArrayExpression THEN
  2088. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2089. ELSE
  2090. Assign(index,expression);
  2091. END;
  2092. END;
  2093. END RecursiveAssignment;
  2094. BEGIN
  2095. (*static math array not providing pointers anyway *)
  2096. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2097. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2098. designator.SetType(variable.type);
  2099. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2100. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2101. FOR i := 0 TO dim-1 DO
  2102. element := SyntaxTree.NewIntegerValue(x.position,0);
  2103. element.SetType(system.longintType);
  2104. index.parameters.AddExpression(element);
  2105. END;
  2106. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2107. RecursiveAssignment(x,0);
  2108. Expression(designator);
  2109. END VisitMathArrayExpression;
  2110. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2111. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2112. BEGIN
  2113. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2114. dest := destination; destination := emptyOperand;
  2115. IF x.operator = Scanner.Not THEN
  2116. IF conditional THEN
  2117. Condition(x.left,falseLabel,trueLabel)
  2118. ELSE
  2119. Evaluate(x.left,operand);
  2120. InitOperand(result,ModeValue);
  2121. Reuse1a(result.op,operand.op,dest);
  2122. Emit(Xor(position,result.op,operand.op,true));
  2123. ReleaseOperand(operand);
  2124. END;
  2125. ELSIF x.operator = Scanner.Minus THEN
  2126. Evaluate(x.left,operand);
  2127. InitOperand(result,ModeValue);
  2128. Reuse1a(result.op,operand.op,dest);
  2129. type := x.left.type.resolved;
  2130. IF type IS SyntaxTree.SetType THEN
  2131. Emit(Not(position,result.op,operand.op));
  2132. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2133. Reuse1(result.tag,operand.tag);
  2134. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2135. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2136. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2137. Emit(Neg(position,result.op,operand.op));
  2138. ELSE HALT(200)
  2139. END;
  2140. ReleaseOperand(operand);
  2141. ELSIF x.operator = Scanner.Address THEN
  2142. Designate(x.left,operand);
  2143. operand.mode := ModeValue;
  2144. t0 := x.left.type.resolved;
  2145. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2146. ReleaseIntermediateOperand(operand.op);
  2147. operand.op := operand.tag;
  2148. IntermediateCode.InitOperand(operand.tag);
  2149. END;
  2150. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2151. result := operand;
  2152. ELSE HALT(100)
  2153. END;
  2154. destination := dest;
  2155. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2156. END VisitUnaryExpression;
  2157. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2158. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2159. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2160. BEGIN
  2161. type := type.resolved;
  2162. originalType := type;
  2163. IF type IS SyntaxTree.PointerType THEN
  2164. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2165. END;
  2166. IF type IS SyntaxTree.ObjectType THEN
  2167. BrL(trueL);
  2168. ELSE
  2169. ASSERT(type IS SyntaxTree.RecordType);
  2170. (*
  2171. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2172. *)
  2173. ReuseCopy(left,tag);
  2174. right := TypeDescriptorAdr(type);
  2175. IF ~newObjectFile THEN
  2176. IntermediateCode.MakeMemory(right,addressType);
  2177. END;
  2178. IF backend.cooperative THEN
  2179. repeatL := NewLabel();
  2180. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2181. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2182. END;
  2183. SetLabel(repeatL);
  2184. BreqL(trueL,left,right);
  2185. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2186. BrneL(repeatL,left,nil);
  2187. ELSIF meta.simple THEN
  2188. level := type(SyntaxTree.RecordType).Level();
  2189. (* get type desc tag of level relative to base tag *)
  2190. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2191. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2192. IntermediateCode.MakeMemory(left,addressType);
  2193. BreqL(trueL,left,right);
  2194. ELSE
  2195. level := type(SyntaxTree.RecordType).Level();
  2196. (* get type desc tag of level relative to base tag *)
  2197. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2198. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2199. IntermediateCode.MakeMemory(left,addressType);
  2200. BreqL(trueL,left,right);
  2201. END;
  2202. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2203. BrL(falseL);
  2204. END;
  2205. END TypeTest;
  2206. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2207. BEGIN
  2208. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2209. IF dump # NIL THEN
  2210. dump.String(s); dump.Ln;
  2211. END;
  2212. END Error;
  2213. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2214. BEGIN
  2215. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2216. IF dump # NIL THEN
  2217. dump.String(s); dump.Ln; dump.Update;
  2218. END;
  2219. END Warning;
  2220. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2221. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2222. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2223. operand:Operand;
  2224. BEGIN
  2225. previousSection := section;
  2226. Global.GetModuleName(mod,name);
  2227. Strings.Append(name,".@Trace");
  2228. Basic.ToSegmentedName(name, pooledName);
  2229. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2230. IF dump # NIL THEN dump := section.comments END;
  2231. IF backend.hasLinkRegister THEN
  2232. Emit(Push(Basic.invalidPosition, lr));
  2233. END;
  2234. variable := mod.moduleScope.firstVariable;
  2235. WHILE variable # NIL DO
  2236. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2237. Symbol(variable, operand);
  2238. register := operand.op;
  2239. CallTraceMethod(register, variable.type);
  2240. ReleaseIntermediateOperand(register);
  2241. END;
  2242. variable := variable.nextVariable;
  2243. END;
  2244. IF backend.hasLinkRegister THEN
  2245. Emit(Pop(Basic.invalidPosition, lr));
  2246. END;
  2247. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2248. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2249. Emit(Br(position,op));
  2250. INC(statCoopTraceModule, section.pc);
  2251. section := previousSection;
  2252. IF dump # NIL THEN dump := section.comments END;
  2253. END CreateTraceModuleMethod;
  2254. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2255. BEGIN
  2256. Emit (Push(position, dst));
  2257. Emit (Push(position, src));
  2258. CallThis(position,"GarbageCollector","Assign", 2);
  2259. END CallAssignPointer;
  2260. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2261. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2262. BEGIN
  2263. IF SemanticChecker.IsPointerType (type) THEN
  2264. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2265. ELSIF type.IsRecordType() THEN
  2266. Emit (Push(position,dst));
  2267. Emit (Push(position,src));
  2268. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2269. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2270. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2271. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2272. ELSIF IsStaticArray(type) THEN
  2273. size := StaticArrayNumElements(type);
  2274. base := StaticArrayBaseType(type);
  2275. IF base.IsRecordType() THEN
  2276. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2277. Emit (Push(position, dst));
  2278. Emit (Push(position, src));
  2279. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2280. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2281. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2282. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2283. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2284. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2285. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2286. Emit (Push(position, dst));
  2287. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2288. Emit (Push(position, src));
  2289. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2290. ELSE
  2291. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2292. Emit (Push(position, dst));
  2293. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2294. Emit (Push(position, src));
  2295. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2296. ASSERT(StaticArrayBaseType(type).IsPointer());
  2297. END;
  2298. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2299. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2300. Emit (Push(position, dst));
  2301. Emit (Push(position, src));
  2302. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2303. ELSE HALT(100); (* missing ? *)
  2304. END;
  2305. END CallAssignMethod;
  2306. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2307. VAR name: Basic.SegmentedName;
  2308. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2309. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2310. context: Context;
  2311. BEGIN
  2312. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2313. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2314. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2315. GetRecordTypeName (recordType,name);
  2316. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2317. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2318. IF dump # NIL THEN dump := section.comments END;
  2319. IF backend.hasLinkRegister THEN
  2320. Emit(Push(Basic.invalidPosition, lr));
  2321. END;
  2322. variable := recordType.recordScope.firstVariable;
  2323. WHILE variable # NIL DO
  2324. IF variable.NeedsTrace() THEN
  2325. dst := NewRegisterOperand (addressType);
  2326. src := NewRegisterOperand (addressType);
  2327. Emit (Mov(position, dst, parameter1));
  2328. Emit (Mov(position, src, parameter2));
  2329. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2330. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2331. CallAssignMethod(dst, src, variable.type);
  2332. ReleaseIntermediateOperand(src);
  2333. ReleaseIntermediateOperand(dst);
  2334. END;
  2335. variable := variable.nextVariable;
  2336. END;
  2337. recordBase := recordType.GetBaseRecord();
  2338. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2339. IF backend.hasLinkRegister THEN
  2340. Emit(Pop(Basic.invalidPosition, lr));
  2341. END;
  2342. GetRecordTypeName (recordBase,name);
  2343. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2344. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2345. Emit(Br(position,op));
  2346. ELSE
  2347. Emit(Exit(position,0,0, 0));
  2348. END;
  2349. IF ~recordType.isObject THEN
  2350. GetRecordTypeName (recordType,name);
  2351. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2352. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2353. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2354. NEW(registerUsageCount);
  2355. usedRegisters := NIL;
  2356. dst := NewRegisterOperand (addressType);
  2357. src := NewRegisterOperand (addressType);
  2358. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2359. Emit(Mov(position, dst, parameter1));
  2360. Emit(Mov(position, src, parameter2));
  2361. label := NewLabel();
  2362. SetLabel(label);
  2363. Emit(Push(position, dst));
  2364. Emit(Push(position, src));
  2365. GetRecordTypeName (recordType,name);
  2366. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2367. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2368. Emit(Call(position, op, 0));
  2369. Emit(Pop(position, src));
  2370. Emit(Pop(position, dst));
  2371. Emit(Add(position, dst, dst, ofs));
  2372. Emit(Add(position, src, src, ofs));
  2373. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2374. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2375. Emit(Exit(position,0,0, 0));
  2376. END;
  2377. INC(statCoopAssignProcedure, section.pc);
  2378. ReturnToContext(context);
  2379. IF dump # NIL THEN dump := section.comments END;
  2380. END CreateAssignProcedure;
  2381. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2382. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2383. BEGIN
  2384. IF IsUnsafePointer (type) THEN
  2385. skip := NewLabel();
  2386. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2387. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2388. BreqL (skip, op, nil);
  2389. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2390. SetLabel (skip);
  2391. ELSIF SemanticChecker.IsPointerType (type) THEN
  2392. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2393. CallThis(position,"GarbageCollector","Mark", 1);
  2394. ELSIF type.IsRecordType() THEN
  2395. Emit (Push(position,register));
  2396. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2397. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2398. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2399. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2400. ELSIF IsStaticArray(type) THEN
  2401. size := StaticArrayNumElements(type);
  2402. base := StaticArrayBaseType(type);
  2403. IF base.IsRecordType() THEN
  2404. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2405. Emit (Push(position, register));
  2406. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2407. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2408. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2409. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2410. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2411. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2412. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2413. Emit (Push(position, register));
  2414. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2415. ELSE
  2416. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2417. Emit (Push(position, register));
  2418. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2419. ASSERT(base.IsPointer());
  2420. END;
  2421. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2422. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2423. CallThis(position,"GarbageCollector","Mark", 1);
  2424. ELSE HALT(100); (* missing ? *)
  2425. END;
  2426. END CallTraceMethod;
  2427. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2428. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2429. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2430. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2431. BEGIN
  2432. previousSection := section;
  2433. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2434. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2435. GetRecordTypeName (recordType,name);
  2436. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2437. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2438. IF dump # NIL THEN dump := section.comments END;
  2439. IF backend.hasLinkRegister THEN
  2440. Emit(Push(Basic.invalidPosition, lr));
  2441. END;
  2442. variable := recordType.recordScope.firstVariable;
  2443. WHILE variable # NIL DO
  2444. IF variable.NeedsTrace() THEN
  2445. register := NewRegisterOperand (addressType);
  2446. Emit (Mov(position,register,parameter1));
  2447. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2448. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2449. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2450. END;
  2451. CallTraceMethod(register, variable.type);
  2452. ReleaseIntermediateOperand(register);
  2453. END;
  2454. variable := variable.nextVariable;
  2455. END;
  2456. recordBase := recordType.GetBaseRecord();
  2457. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2458. recordBase := recordBase.GetBaseRecord();
  2459. END;
  2460. IF recordBase # NIL THEN
  2461. IF backend.hasLinkRegister THEN
  2462. Emit(Pop(Basic.invalidPosition, lr));
  2463. END;
  2464. GetRecordTypeName (recordBase,name);
  2465. IF HasExplicitTraceMethod (recordBase) THEN
  2466. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2467. ELSE
  2468. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2469. END;
  2470. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2471. Emit(Br(position,op));
  2472. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2473. Emit(Exit(position,0,0,0));
  2474. ELSE
  2475. IF backend.hasLinkRegister THEN
  2476. Emit(Pop(Basic.invalidPosition, lr));
  2477. END;
  2478. IF recordType.isObject THEN
  2479. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2480. ELSE
  2481. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2482. END;
  2483. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2484. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2485. Emit(Br(position,op));
  2486. END;
  2487. IF ~recordType.isObject THEN
  2488. GetRecordTypeName (recordType,name);
  2489. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2490. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2491. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2492. NEW(registerUsageCount);
  2493. usedRegisters := NIL;
  2494. IF dump # NIL THEN dump := section.comments END;
  2495. register := NewRegisterOperand (addressType);
  2496. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2497. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2498. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2499. END;
  2500. Emit (Push(position,register));
  2501. GetRecordTypeName (recordType,name);
  2502. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2503. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2504. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2505. ReleaseIntermediateOperand(register);
  2506. Emit(Exit(position,0,0,0));
  2507. GetRecordTypeName (recordType,name);
  2508. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2509. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2510. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2511. NEW(registerUsageCount);
  2512. usedRegisters := NIL;
  2513. register := NewRegisterOperand (addressType);
  2514. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2515. Emit(Mov(position, register, parameter1));
  2516. label := NewLabel();
  2517. SetLabel(label);
  2518. Emit(Push(position, register));
  2519. GetRecordTypeName (recordType,name);
  2520. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2521. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2522. Emit(Call(position, op, 0));
  2523. Emit(Pop(position, register));
  2524. Emit(Add(position, register, register, ofs));
  2525. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2526. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2527. Emit(Exit(position,0,0,0));
  2528. END;
  2529. INC(statCoopTraceMethod, section.pc);
  2530. ReturnToContext(context);
  2531. IF dump # NIL THEN dump := section.comments END;
  2532. END CreateTraceMethod;
  2533. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2534. VAR name: Basic.SegmentedName;
  2535. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2536. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2537. context: Context;
  2538. BEGIN
  2539. IF recordType.isObject THEN RETURN END;
  2540. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2541. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2542. GetRecordTypeName (recordType,name);
  2543. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2544. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2545. IF dump # NIL THEN dump := section.comments END;
  2546. IF backend.hasLinkRegister THEN
  2547. Emit(Push(Basic.invalidPosition, lr));
  2548. END;
  2549. variable := recordType.recordScope.firstVariable;
  2550. WHILE variable # NIL DO
  2551. IF variable.NeedsTrace() THEN
  2552. dst := NewRegisterOperand (addressType);
  2553. Emit (Mov(position, dst, parameter1));
  2554. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2555. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2556. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2557. END;
  2558. CallResetProcedure(dst, nil, variable.type);
  2559. ReleaseIntermediateOperand(dst);
  2560. END;
  2561. variable := variable.nextVariable;
  2562. END;
  2563. recordBase := recordType.GetBaseRecord();
  2564. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2565. IF backend.hasLinkRegister THEN
  2566. Emit(Pop(Basic.invalidPosition, lr));
  2567. END;
  2568. GetRecordTypeName (recordBase,name);
  2569. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2570. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2571. Emit(Br(position,op));
  2572. ELSE
  2573. Emit(Exit(position,0,0, 0));
  2574. END;
  2575. GetRecordTypeName (recordType,name);
  2576. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2577. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2578. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2579. NEW(registerUsageCount);
  2580. usedRegisters := NIL;
  2581. dst := NewRegisterOperand (addressType);
  2582. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2583. Emit(Mov(position, dst, parameter1));
  2584. label := NewLabel();
  2585. SetLabel(label);
  2586. Emit(Push(position, dst));
  2587. GetRecordTypeName (recordType,name);
  2588. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2589. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2590. Emit(Call(position, op, 0));
  2591. Emit(Pop(position, dst));
  2592. Emit(Add(position, dst, dst, ofs));
  2593. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2594. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2595. Emit(Exit(position,0,0, 0));
  2596. INC(statCoopResetProcedure, section.pc);
  2597. ReturnToContext(context);
  2598. IF dump # NIL THEN dump := section.comments END;
  2599. END CreateResetProcedure;
  2600. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2601. VAR name: Basic.SegmentedName; context: Context;
  2602. BEGIN
  2603. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2604. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2605. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2606. IF dump # NIL THEN dump := section.comments END;
  2607. IF backend.hasLinkRegister THEN
  2608. Emit(Push(Basic.invalidPosition, lr));
  2609. END;
  2610. Emit(Push(position,fp));
  2611. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2612. ResetVariables(scope);
  2613. Emit(Pop(position,fp));
  2614. Emit(Exit(position,0,0, 0));
  2615. ReturnToContext(context);
  2616. IF dump # NIL THEN dump := section.comments END;
  2617. END CreateResetMethod;
  2618. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2619. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2620. BEGIN
  2621. IF SemanticChecker.IsPointerType (type) THEN
  2622. Emit (Push(position, dest));
  2623. CallThis(position,"GarbageCollector","Reset", 1);
  2624. ELSIF type.IsRecordType() THEN
  2625. Emit (Push(position, dest));
  2626. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2627. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2628. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2629. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2630. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2631. size := GetArrayLength(type, tag);
  2632. base := ArrayBaseType(type);
  2633. IF base.IsRecordType() THEN
  2634. Emit (Push(position, size));
  2635. Emit (Push(position, dest));
  2636. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2637. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2638. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2639. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2640. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2641. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2642. Emit (Push(position, size));
  2643. Emit (Push(position, dest));
  2644. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2645. ELSE
  2646. Emit (Push(position, size));
  2647. Emit (Push(position, dest));
  2648. CallThis(position,"GarbageCollector","ResetArray", 2);
  2649. ASSERT(ArrayBaseType(type).IsPointer());
  2650. END;
  2651. ReleaseIntermediateOperand(size);
  2652. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2653. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2654. Emit (Push(position, dest));
  2655. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2656. ELSE HALT(100); (* missing ? *)
  2657. END;
  2658. END CallResetProcedure;
  2659. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2660. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2661. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2662. VAR operand: Operand;
  2663. BEGIN
  2664. Symbol (symbol, operand);
  2665. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2666. ReleaseOperand(operand);
  2667. END Reset;
  2668. BEGIN
  2669. previousScope := currentScope;
  2670. currentScope := scope;
  2671. pc := section.pc;
  2672. variable := scope.firstVariable;
  2673. WHILE variable # NIL DO
  2674. IF variable.NeedsTrace() THEN
  2675. Reset (variable);
  2676. END;
  2677. variable := variable.nextVariable;
  2678. END;
  2679. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2680. WHILE parameter # NIL DO
  2681. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2682. Reset (parameter);
  2683. END;
  2684. parameter := parameter.nextParameter;
  2685. END;
  2686. INC(statCoopResetVariables, section.pc - pc);
  2687. currentScope := previousScope;
  2688. END ResetVariables;
  2689. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2690. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2691. VAR op: IntermediateCode.Operand; context: Context;
  2692. BEGIN
  2693. previousSection := section;
  2694. GetCodeSectionNameForSymbol(procedure, name);
  2695. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2696. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2697. IF dump # NIL THEN dump := section.comments END;
  2698. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2699. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2700. Emit(Data(position,op));
  2701. Emit(Data(position,nil));
  2702. IF HasPointers (procedure.procedureScope) THEN
  2703. GetCodeSectionNameForSymbol(procedure, name);
  2704. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2705. ELSE
  2706. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2707. END;
  2708. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2709. Emit(Data(position,op));
  2710. ReturnToContext(context);
  2711. IF dump # NIL THEN dump := section.comments END;
  2712. END CreateProcedureDescriptor;
  2713. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2714. VAR import: SyntaxTree.Import;
  2715. s: Basic.MessageString;
  2716. selfName: SyntaxTree.IdentifierString;
  2717. BEGIN
  2718. moduleScope.ownerModule.GetName(selfName);
  2719. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2720. module := moduleScope.ownerModule
  2721. ELSE
  2722. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2723. IF import = NIL THEN
  2724. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2725. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2726. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2727. s := "Module ";
  2728. Strings.Append(s,moduleName);
  2729. Strings.Append(s," cannot be imported.");
  2730. IF force THEN
  2731. Error(position,s);
  2732. ELSIF canBeLoaded THEN
  2733. IF WarningDynamicLoading THEN
  2734. Strings.Append(s, "=> no dynamic linking.");
  2735. Warning(position, s);
  2736. END;
  2737. canBeLoaded := FALSE;
  2738. END;
  2739. RETURN FALSE
  2740. ELSE
  2741. SELF.module.imports.AddName(moduleName)
  2742. END;
  2743. ELSIF import.module = NIL THEN (* already tried *)
  2744. RETURN FALSE
  2745. END;
  2746. module := import.module;
  2747. END;
  2748. RETURN TRUE
  2749. END AddImport;
  2750. (* needed for old binary object file format*)
  2751. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2752. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2753. BEGIN
  2754. IF AddImport(moduleName,module,TRUE) THEN
  2755. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2756. IF procedure = NIL THEN
  2757. s := "Instruction not supported on target, emulation procedure ";
  2758. Strings.Append(s,moduleName);
  2759. Strings.Append(s,".");
  2760. Strings.Append(s,procedureName);
  2761. Strings.Append(s," not present");
  2762. Error(position,s);
  2763. ELSE
  2764. StaticCallOperand(r,procedure);
  2765. ReleaseOperand(r);
  2766. fp := GetFingerprint(procedure);
  2767. END;
  2768. END;
  2769. END EnsureSymbol;
  2770. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2771. VAR exit: Label; trueL,falseL: Label;
  2772. BEGIN
  2773. trueL := NewLabel();
  2774. falseL := NewLabel();
  2775. exit := NewLabel();
  2776. Condition(x,trueL,falseL);
  2777. InitOperand(result,ModeValue);
  2778. SetLabel(trueL);
  2779. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2780. Emit(Mov(position,result.op,true));
  2781. BrL(exit);
  2782. SetLabel(falseL);
  2783. Emit(MovReplace(position,result.op,false));
  2784. SetLabel(exit);
  2785. END ConditionToValue;
  2786. PROCEDURE ValueToCondition(VAR op: Operand);
  2787. BEGIN
  2788. LoadValue(op,system.booleanType);
  2789. BrneL(trueLabel,op.op, false);
  2790. ReleaseOperand(op);
  2791. BrL(falseLabel);
  2792. END ValueToCondition;
  2793. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2794. VAR size: LONGINT;
  2795. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2796. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2797. BEGIN
  2798. ASSERT(type.form = SyntaxTree.Open);
  2799. baseType := type.arrayBase.resolved;
  2800. IF IsOpenArray(baseType) THEN
  2801. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2802. ELSE
  2803. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2804. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2805. END;
  2806. len := tag;
  2807. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2808. IntermediateCode.MakeMemory(len,addressType);
  2809. UseIntermediateOperand(len);
  2810. Reuse2(res,sizeOperand,len);
  2811. Emit(Mul(position,res,sizeOperand,len));
  2812. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2813. RETURN res
  2814. END GetArraySize;
  2815. BEGIN
  2816. type := type.resolved;
  2817. IF IsOpenArray(type) THEN
  2818. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2819. RETURN tag
  2820. ELSE
  2821. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2822. END;
  2823. ELSE
  2824. size := ToMemoryUnits(system,system.SizeOf(type));
  2825. RETURN IntermediateCode.Immediate(addressType,size)
  2826. END;
  2827. END GetDynamicSize;
  2828. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2829. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2830. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2831. BEGIN
  2832. ASSERT(type.form = SyntaxTree.Open);
  2833. baseType := type.arrayBase.resolved;
  2834. IF IsOpenArray(baseType) THEN
  2835. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2836. ELSE
  2837. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2838. END;
  2839. len := tag;
  2840. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2841. IntermediateCode.MakeMemory(len,addressType);
  2842. UseIntermediateOperand(len);
  2843. Reuse2(res,sizeOperand,len);
  2844. Emit(Mul(position,res,sizeOperand,len));
  2845. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2846. RETURN res
  2847. END GetLength;
  2848. BEGIN
  2849. type := type.resolved;
  2850. IF IsOpenArray(type) THEN
  2851. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2852. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2853. ELSIF type IS SyntaxTree.StringType THEN
  2854. RETURN tag;
  2855. ELSE
  2856. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2857. END;
  2858. END GetArrayLength;
  2859. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2860. VAR result: IntermediateCode.Operand;
  2861. BEGIN
  2862. IF backend.cooperative THEN
  2863. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2864. ELSE
  2865. MakeMemory(result, tag, addressType, 0);
  2866. END;
  2867. RETURN result
  2868. END GetSizeFromTag;
  2869. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2870. VAR parameter: SyntaxTree.Parameter;
  2871. BEGIN
  2872. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2873. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2874. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2875. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2876. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2877. END;
  2878. RETURN GetDynamicSize(e.type, tag);
  2879. END GetArrayOfBytesSize;
  2880. (*
  2881. to find imported symbol. not needed ?
  2882. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2883. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2884. BEGIN
  2885. IF AddImport(moduleName,importedModule,FALSE) THEN
  2886. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2887. RETURN symbol
  2888. ELSE
  2889. RETURN NIL
  2890. END
  2891. END SymbolByName;
  2892. *)
  2893. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2894. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2895. BEGIN
  2896. IF AddImport(moduleName,runtimeModule,force) THEN
  2897. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2898. IF procedure = NIL THEN
  2899. s := "Procedure ";
  2900. Strings.Append(s,moduleName);
  2901. Strings.Append(s,".");
  2902. Strings.Append(s,procedureName);
  2903. Strings.Append(s," not present");
  2904. Error(position,s);
  2905. RETURN FALSE
  2906. ELSE
  2907. RETURN TRUE
  2908. END;
  2909. ELSE RETURN FALSE
  2910. END;
  2911. END GetRuntimeProcedure;
  2912. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2913. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2914. s: Basic.MessageString;
  2915. BEGIN
  2916. Basic.InitSegmentedName(name);
  2917. name[0] := Basic.MakeString(moduleName);
  2918. name[1] := Basic.MakeString(typeName);
  2919. name[2] := -1;
  2920. IF AddImport(moduleName,importedModule, FALSE) THEN
  2921. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2922. IF symbol = NIL THEN
  2923. s := "type ";
  2924. Strings.Append(s,moduleName);
  2925. Strings.Append(s,".");
  2926. Strings.Append(s,typeName);
  2927. Strings.Append(s," not present");
  2928. Error(position,s);
  2929. END;
  2930. ELSE symbol := NIL;
  2931. END;
  2932. IF importedModule = moduleScope.ownerModule THEN
  2933. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2934. ELSE
  2935. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2936. END;
  2937. RETURN symbol
  2938. END GetTypeDescriptor;
  2939. (* 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. *)
  2940. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2941. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2942. pooledName: Basic.SegmentedName; size: LONGINT;
  2943. BEGIN
  2944. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2945. StaticCallOperand(result,procedure);
  2946. IF numberParameters < 0 THEN
  2947. size := ProcedureParametersSize(system,procedure);
  2948. ELSE
  2949. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2950. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2951. Error(position,"runtime call parameter count mismatch");
  2952. END;
  2953. END;
  2954. Emit(Call(position, result.op, size));
  2955. ReleaseOperand(result);
  2956. ELSE (* only static linking possible *)
  2957. ASSERT(numberParameters >= 0);
  2958. Basic.InitSegmentedName(pooledName);
  2959. pooledName[0] := Basic.MakeString(moduleName);
  2960. pooledName[1] := Basic.MakeString(procedureName);
  2961. pooledName[2] := -1;
  2962. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2963. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2964. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2965. END;
  2966. END CallThisChecked;
  2967. (* 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. *)
  2968. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2969. BEGIN
  2970. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2971. END CallThis;
  2972. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2973. VAR
  2974. left,right: Operand;
  2975. leftSize, rightSize: IntermediateCode.Operand;
  2976. saved: RegisterEntry;
  2977. reg: IntermediateCode.Operand;
  2978. procedureName: SyntaxTree.IdentifierString;
  2979. BEGIN
  2980. procedureName := "CompareString";
  2981. SaveRegisters();ReleaseUsedRegisters(saved);
  2982. Designate(leftExpression,left);
  2983. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2984. Emit(Push(position,leftSize));
  2985. ReleaseIntermediateOperand(leftSize);
  2986. Emit(Push(position,left.op));
  2987. ReleaseOperand(left);
  2988. Designate(rightExpression,right);
  2989. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2990. Emit(Push(position,rightSize));
  2991. ReleaseIntermediateOperand(rightSize);
  2992. Emit(Push(position,right.op));
  2993. ReleaseOperand(right);
  2994. IF backend.cooperative THEN
  2995. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2996. ELSE
  2997. CallThis(position,runtimeModuleName,procedureName, 4);
  2998. END;
  2999. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3000. Emit(Result(position,reg));
  3001. (*
  3002. AcquireThisRegister(int8,IntermediateCode.Result);
  3003. *)
  3004. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3005. (*
  3006. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3007. *)
  3008. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3009. ReleaseIntermediateOperand(reg);
  3010. BrL(falseLabel);
  3011. END CompareString;
  3012. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3013. VAR
  3014. left,right: Operand;
  3015. leftSize, rightSize: IntermediateCode.Operand;
  3016. saved: RegisterEntry;
  3017. procedureName: SyntaxTree.IdentifierString;
  3018. BEGIN
  3019. procedureName := "CopyString";
  3020. SaveRegisters();ReleaseUsedRegisters(saved);
  3021. Designate(leftExpression,left);
  3022. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3023. Emit(Push(position,leftSize));
  3024. ReleaseIntermediateOperand(leftSize);
  3025. Emit(Push(position,left.op));
  3026. ReleaseOperand(left);
  3027. Designate(rightExpression,right);
  3028. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3029. Emit(Push(position,rightSize));
  3030. ReleaseIntermediateOperand(rightSize);
  3031. Emit(Push(position,right.op));
  3032. ReleaseOperand(right);
  3033. IF backend.cooperative THEN
  3034. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  3035. ELSE
  3036. CallThis(position,runtimeModuleName,procedureName,4);
  3037. END;
  3038. RestoreRegisters(saved);
  3039. END CopyString;
  3040. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3041. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3042. leftType,rightType: SyntaxTree.Type;
  3043. leftExpression,rightExpression : SyntaxTree.Expression;
  3044. componentType: IntermediateCode.Type;
  3045. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3046. size: LONGINT;
  3047. BEGIN
  3048. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3049. dest := destination; destination := emptyOperand;
  3050. leftType := x.left.type.resolved;
  3051. rightType := x.right.type.resolved;
  3052. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3053. CASE x.operator OF
  3054. Scanner.Or:
  3055. (* shortcut evaluation of left OR right *)
  3056. IF ~conditional THEN ConditionToValue(x);
  3057. ELSE
  3058. next := NewLabel();
  3059. Condition(x.left,trueLabel,next);
  3060. SetLabel(next);
  3061. Condition(x.right,trueLabel,falseLabel);
  3062. END;
  3063. |Scanner.And:
  3064. (* shortcut evaluation of left & right *)
  3065. IF ~conditional THEN ConditionToValue(x);
  3066. ELSE
  3067. next := NewLabel();
  3068. Condition(x.left,next,falseLabel);
  3069. SetLabel(next);
  3070. Condition(x.right,trueLabel,falseLabel);
  3071. END;
  3072. |Scanner.Is:
  3073. IF ~conditional THEN ConditionToValue(x);
  3074. ELSE
  3075. (* get type desc tag *)
  3076. IF IsPointerToRecord(leftType,recordType) THEN
  3077. Evaluate(x.left,left);
  3078. Dereference(left,recordType,IsUnsafePointer(leftType))
  3079. ELSE
  3080. Designate(x.left,left);
  3081. END;
  3082. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3083. ReleaseOperand(left);
  3084. END;
  3085. |Scanner.Plus:
  3086. Evaluate(x.left,left);
  3087. Evaluate(x.right,right);
  3088. IF leftType IS SyntaxTree.SetType THEN
  3089. InitOperand(result,ModeValue);
  3090. Reuse2a(result.op,left.op,right.op,dest);
  3091. Emit(Or(position,result.op,left.op,right.op));
  3092. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3093. InitOperand(result,ModeValue);
  3094. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3095. Reuse2(result.tag,left.tag,right.tag);
  3096. Emit(Add(position,result.op,left.op,right.op));
  3097. Emit(Add(position,result.tag,left.tag,right.tag))
  3098. ELSE
  3099. InitOperand(result,ModeValue);
  3100. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3101. AddInt(result.op, left.op, right.op) ;
  3102. ELSE
  3103. *)
  3104. Reuse2a(result.op,left.op,right.op,dest);
  3105. Emit(Add(position,result.op,left.op,right.op));
  3106. (*
  3107. END;
  3108. *)
  3109. END;
  3110. ReleaseOperand(left); ReleaseOperand(right);
  3111. |Scanner.Minus:
  3112. Evaluate(x.left,left);
  3113. Evaluate(x.right,right);
  3114. IF leftType IS SyntaxTree.SetType THEN
  3115. InitOperand(result,ModeValue);
  3116. Reuse1(result.op,right.op);
  3117. Emit(Not(position,result.op,right.op));
  3118. ReleaseOperand(right);
  3119. Emit(And(position,result.op,result.op,left.op));
  3120. ReleaseOperand(left);
  3121. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3122. InitOperand(result,ModeValue);
  3123. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3124. Reuse2(result.tag,left.tag,right.tag);
  3125. Emit(Sub(position,result.op,left.op,right.op));
  3126. Emit(Sub(position,result.tag,left.tag,right.tag));
  3127. ReleaseOperand(left); ReleaseOperand(right)
  3128. ELSE
  3129. InitOperand(result,ModeValue);
  3130. Reuse2a(result.op,left.op,right.op,dest);
  3131. Emit(Sub(position,result.op,left.op,right.op));
  3132. ReleaseOperand(left); ReleaseOperand(right);
  3133. END;
  3134. |Scanner.Times:
  3135. Evaluate(x.left,left);
  3136. Evaluate(x.right,right);
  3137. IF leftType IS SyntaxTree.SetType THEN
  3138. InitOperand(result,ModeValue);
  3139. Reuse2a(result.op,left.op,right.op,dest);
  3140. Emit(And(position,result.op,left.op,right.op));
  3141. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3142. InitOperand(result, ModeValue);
  3143. componentType := left.op.type;
  3144. (* TODO: review this *)
  3145. (*
  3146. result.op = left.op * right.op - left.tag * right.tag
  3147. result.tag = left.tag * right.op + left.op * right.tag
  3148. *)
  3149. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3150. Emit(Mul(position,result.op, left.op, right.op));
  3151. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3152. Emit(Mul(position,tempReg, left.tag, right.tag));
  3153. Emit(Sub(position,result.op, result.op, tempReg));
  3154. Reuse2(result.tag, left.tag, right.op);
  3155. Emit(Mul(position,result.tag, left.tag, right.op));
  3156. Emit(Mul(position,tempReg, left.op, right.tag));
  3157. Emit(Add(position,result.tag, result.tag, tempReg));
  3158. ReleaseIntermediateOperand(tempReg)
  3159. ELSE
  3160. InitOperand(result,ModeValue);
  3161. Reuse2a(result.op,left.op,right.op,dest);
  3162. Emit(Mul(position,result.op,left.op,right.op));
  3163. END;
  3164. ReleaseOperand(left); ReleaseOperand(right);
  3165. |Scanner.Div:
  3166. Evaluate(x.left,left);
  3167. Evaluate(x.right,right);
  3168. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3169. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3170. IF ~isUnchecked THEN
  3171. exit := NewLabel();
  3172. BrltL(exit,zero,right.op);
  3173. EmitTrap(position,NegativeDivisorTrap);
  3174. SetLabel(exit);
  3175. END;
  3176. END;
  3177. InitOperand(result,ModeValue);
  3178. Reuse2a(result.op,left.op,right.op,dest);
  3179. Emit(Div(position,result.op,left.op,right.op));
  3180. ReleaseOperand(left); ReleaseOperand(right);
  3181. |Scanner.Mod:
  3182. Evaluate(x.left,left);
  3183. Evaluate(x.right,right);
  3184. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3185. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3186. IF ~isUnchecked THEN
  3187. exit := NewLabel();
  3188. BrltL(exit,zero,right.op);
  3189. EmitTrap(position,NegativeDivisorTrap);
  3190. SetLabel(exit);
  3191. END;
  3192. END;
  3193. InitOperand(result,ModeValue);
  3194. Reuse2a(result.op,left.op,right.op,dest);
  3195. Emit(Mod(position,result.op,left.op,right.op));
  3196. ReleaseOperand(left); ReleaseOperand(right);
  3197. |Scanner.Slash:
  3198. Evaluate(x.left,left);
  3199. Evaluate(x.right,right);
  3200. IF leftType IS SyntaxTree.SetType THEN
  3201. InitOperand(result,ModeValue);
  3202. Reuse2a(result.op,left.op,right.op,dest);
  3203. Emit(Xor(position,result.op,left.op,right.op));
  3204. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3205. InitOperand(result,ModeValue);
  3206. componentType := left.op.type;
  3207. (* review this *)
  3208. (*
  3209. divisor = right.op * right.op + right.tag * right.tag
  3210. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3211. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3212. *)
  3213. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3214. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3215. Emit(Mul(position,tempReg, right.op, right.op));
  3216. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3217. Emit(Add(position,tempReg, tempReg, tempReg2));
  3218. result.op := tempReg2;
  3219. Emit(Mul(position,result.op, left.op, right.op));
  3220. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3221. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3222. Emit(Add(position,result.op, result.op, tempReg2));
  3223. Emit(Div(position,result.op, result.op, tempReg));
  3224. Reuse2(result.tag, left.tag, right.op);
  3225. Emit(Mul(position,result.tag, left.tag, right.op));
  3226. Emit(Mul(position,tempReg2, left.op, right.tag));
  3227. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3228. Emit(Div(position,result.tag, result.tag, tempReg));
  3229. ReleaseIntermediateOperand(tempReg);
  3230. ReleaseIntermediateOperand(tempReg2)
  3231. ELSE
  3232. InitOperand(result,ModeValue);
  3233. Reuse2a(result.op,left.op,right.op,dest);
  3234. Emit(Div(position,result.op,left.op,right.op));
  3235. END;
  3236. ReleaseOperand(left); ReleaseOperand(right);
  3237. |Scanner.Equal:
  3238. IF ~conditional THEN ConditionToValue(x);
  3239. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3240. CompareString(BreqL,x.left,x.right);
  3241. ELSE
  3242. Evaluate(x.left,left);
  3243. Evaluate(x.right,right);
  3244. IF leftType IS SyntaxTree.RangeType THEN
  3245. ASSERT(rightType IS SyntaxTree.RangeType);
  3246. BrneL(falseLabel, left.op, right.op); (* first *)
  3247. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3248. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3249. ReleaseOperand(left); ReleaseOperand(right);
  3250. BrL(trueLabel)
  3251. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3252. BrneL(falseLabel, left.op, right.op); (* first *)
  3253. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3254. ReleaseOperand(left); ReleaseOperand(right);
  3255. BrL(trueLabel)
  3256. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3257. (* TODO: review this *)
  3258. BrneL(falseLabel, left.op, right.op); (* real part *)
  3259. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3260. ReleaseOperand(left); ReleaseOperand(right);
  3261. BrL(trueLabel)
  3262. ELSE
  3263. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3264. ReleaseOperand(left); ReleaseOperand(right);
  3265. BrL(trueLabel);
  3266. END;
  3267. END;
  3268. |Scanner.LessEqual:
  3269. IF ~conditional THEN ConditionToValue(x);
  3270. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3271. CompareString(BrgeL,x.right,x.left);
  3272. ELSE
  3273. Evaluate(x.left,left);
  3274. Evaluate(x.right,right);
  3275. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3276. Reuse1(temp.op,right.op);
  3277. Emit(And(position,temp.op,left.op,right.op));
  3278. ReleaseOperand(right);
  3279. BreqL(trueLabel,temp.op,left.op);
  3280. BrL(falseLabel);
  3281. ReleaseOperand(temp);ReleaseOperand(left);
  3282. ELSE
  3283. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3284. ReleaseOperand(left); ReleaseOperand(right);
  3285. BrL(trueLabel);
  3286. END;
  3287. END;
  3288. |Scanner.Less:
  3289. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3290. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3291. leftExpression.SetType(system.booleanType);
  3292. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3293. rightExpression.SetType(system.booleanType);
  3294. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3295. leftExpression.SetType(system.booleanType);
  3296. Expression(leftExpression);
  3297. ELSIF ~conditional THEN ConditionToValue(x);
  3298. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3299. CompareString(BrltL,x.left,x.right);
  3300. ELSE
  3301. Evaluate(x.left,left);
  3302. Evaluate(x.right,right);
  3303. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3304. ReleaseOperand(left); ReleaseOperand(right);
  3305. BrL(trueLabel);
  3306. END;
  3307. |Scanner.Greater:
  3308. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3309. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3310. leftExpression.SetType(system.booleanType);
  3311. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3312. rightExpression.SetType(system.booleanType);
  3313. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3314. leftExpression.SetType(system.booleanType);
  3315. Expression(leftExpression);
  3316. ELSIF ~conditional THEN ConditionToValue(x);
  3317. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3318. CompareString(BrltL,x.right,x.left);
  3319. ELSE
  3320. Evaluate(x.left,left);
  3321. Evaluate(x.right,right);
  3322. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3323. ReleaseOperand(left); ReleaseOperand(right);
  3324. BrL(trueLabel);
  3325. END;
  3326. |Scanner.GreaterEqual:
  3327. IF ~conditional THEN ConditionToValue(x);
  3328. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3329. CompareString(BrgeL,x.left,x.right);
  3330. ELSE
  3331. Evaluate(x.left,left);
  3332. Evaluate(x.right,right);
  3333. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3334. Reuse1(temp.op,left.op);
  3335. Emit(And(position,temp.op,left.op,right.op));
  3336. ReleaseOperand(left);
  3337. BreqL(trueLabel, temp.op,right.op);
  3338. ReleaseOperand(temp); ReleaseOperand(right);
  3339. BrL(falseLabel);
  3340. ELSE
  3341. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3342. ReleaseOperand(left); ReleaseOperand(right);
  3343. BrL(trueLabel);
  3344. END;
  3345. END;
  3346. |Scanner.Unequal:
  3347. IF ~conditional THEN ConditionToValue(x);
  3348. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3349. CompareString(BrneL,x.left,x.right);
  3350. ELSE
  3351. Evaluate(x.left,left);
  3352. Evaluate(x.right,right);
  3353. IF leftType IS SyntaxTree.RangeType THEN
  3354. ASSERT(rightType IS SyntaxTree.RangeType);
  3355. BrneL(trueLabel, left.op, right.op); (* first *)
  3356. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3357. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3358. ReleaseOperand(left); ReleaseOperand(right);
  3359. BrL(falseLabel)
  3360. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3361. BrneL(trueLabel, left.op, right.op); (* first *)
  3362. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3363. ReleaseOperand(left); ReleaseOperand(right);
  3364. BrL(falseLabel)
  3365. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3366. (* TODO: review this *)
  3367. BrneL(trueLabel, left.op, right.op); (* real part *)
  3368. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3369. ReleaseOperand(left); ReleaseOperand(right);
  3370. BrL(falseLabel)
  3371. ELSE
  3372. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3373. ReleaseOperand(left); ReleaseOperand(right);
  3374. BrL(trueLabel);
  3375. END;
  3376. END;
  3377. |Scanner.In:
  3378. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3379. Evaluate(x.left,left);
  3380. Evaluate(x.right,right);
  3381. Convert(left.op,setType);
  3382. Convert(right.op,setType);
  3383. ReuseCopy(temp.op,right.op);
  3384. Emit(Shr(position,temp.op,temp.op,left.op));
  3385. ReleaseOperand(right); ReleaseOperand(left);
  3386. IntermediateCode.InitImmediate(one,setType,1);
  3387. Emit(And(position,temp.op,temp.op,one));
  3388. IF conditional THEN
  3389. IntermediateCode.InitImmediate(zero,setType,0);
  3390. BrneL(trueLabel,temp.op,zero);
  3391. ReleaseOperand(temp);
  3392. BrL(falseLabel);
  3393. ELSE
  3394. Convert(temp.op,bool);
  3395. result.mode := ModeValue;
  3396. result.op := temp.op;
  3397. result.tag := nil; (* may be left over from calls to evaluate *)
  3398. END;
  3399. ELSE
  3400. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3401. IF x.operator = Scanner.Questionmarks THEN
  3402. leftExpression := x.left;
  3403. rightExpression := x.right;
  3404. ELSE
  3405. leftExpression := x.right;
  3406. rightExpression := x.left;
  3407. END;
  3408. Evaluate(leftExpression, left);
  3409. Emit(Push(position,left.op));
  3410. ReleaseOperand(left);
  3411. Designate(rightExpression, right);
  3412. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3413. IF ~backend.cellsAreObjects THEN
  3414. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3415. END;
  3416. Emit(Push(position,right.op));
  3417. ReleaseOperand(right);
  3418. IF backend.cellsAreObjects THEN
  3419. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3420. ELSE
  3421. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3422. END;
  3423. InitOperand(result, ModeValue);
  3424. result.op := NewRegisterOperand(bool);
  3425. Emit(Result(position,result.op));
  3426. IF conditional THEN
  3427. IntermediateCode.InitImmediate(zero,setType,0);
  3428. BrneL(trueLabel,result.op,zero);
  3429. ReleaseOperand(result);
  3430. BrL(falseLabel);
  3431. END;
  3432. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3433. leftExpression := x.left;
  3434. rightExpression := x.right;
  3435. Evaluate(leftExpression, left);
  3436. Emit(Push(position,left.op));
  3437. ReleaseOperand(left);
  3438. Evaluate(rightExpression, right);
  3439. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3440. IF ~backend.cellsAreObjects THEN
  3441. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3442. END;
  3443. Emit(Push(position,right.op));
  3444. ReleaseOperand(right);
  3445. IF backend.cellsAreObjects THEN
  3446. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3447. ELSE
  3448. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3449. END;
  3450. InitOperand(result, ModeValue);
  3451. result.op := NewRegisterOperand(bool);
  3452. Emit(Result(position,result.op));
  3453. IF conditional THEN
  3454. IntermediateCode.InitImmediate(zero,setType,0);
  3455. BrneL(trueLabel,result.op,zero);
  3456. ReleaseOperand(result);
  3457. BrL(falseLabel);
  3458. END;
  3459. ELSE
  3460. HALT(100);
  3461. END;
  3462. END;
  3463. destination := dest;
  3464. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3465. END VisitBinaryExpression;
  3466. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3467. VAR localResult, operand: Operand;
  3468. BEGIN
  3469. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3470. InitOperand(localResult, ModeValue);
  3471. ASSERT(x.first # NIL);
  3472. Evaluate(x.first, operand);
  3473. localResult.op := operand.op;
  3474. ReleaseOperand(operand);
  3475. UseIntermediateOperand(localResult.op);
  3476. ASSERT(x.last # NIL);
  3477. Evaluate(x.last, operand);
  3478. localResult.tag := operand.op;
  3479. ReleaseOperand(operand);
  3480. UseIntermediateOperand(localResult.tag);
  3481. IF x.step # NIL THEN
  3482. Evaluate(x.step, operand);
  3483. localResult.extra := operand.op;
  3484. ReleaseOperand(operand);
  3485. UseIntermediateOperand(localResult.extra);
  3486. END;
  3487. result := localResult;
  3488. IF Trace THEN TraceExit("VisitRangeExpression") END
  3489. END VisitRangeExpression;
  3490. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3491. BEGIN
  3492. HALT(100); (* should never be evaluated *)
  3493. END VisitTensorRangeExpression;
  3494. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3495. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3496. BEGIN
  3497. IF Trace THEN TraceEnter("VisitConversion") END;
  3498. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3499. dest := destination; destination := emptyOperand;
  3500. Evaluate(x.expression,old);
  3501. InitOperand(result,ModeValue);
  3502. result.op := old.op;
  3503. ASSERT(result.op.mode # 0);
  3504. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3505. (* convert TO a complex number *)
  3506. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3507. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3508. ASSERT(result.op.mode # 0);
  3509. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3510. (* convert FROM a complex number TO a complex number*)
  3511. result.tag := old.tag;
  3512. ASSERT(result.tag.mode # 0);
  3513. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3514. ASSERT(result.tag.mode # 0)
  3515. ELSE
  3516. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3517. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3518. END
  3519. ELSE
  3520. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3521. ASSERT(result.op.mode # 0);
  3522. result.tag := old.tag; (*! probably never used *)
  3523. END;
  3524. destination := dest;
  3525. IF Trace THEN TraceExit("VisitConversion") END;
  3526. END VisitConversion;
  3527. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3528. BEGIN
  3529. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3530. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3531. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3532. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3533. END VisitTypeDeclaration;
  3534. (** designators (expressions) *)
  3535. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3536. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3537. BEGIN
  3538. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3539. IF x.left # NIL THEN Expression(x.left) END;
  3540. Symbol(x.symbol,result);
  3541. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3542. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3543. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3544. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3545. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3546. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3547. END;
  3548. END;
  3549. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3550. END VisitSymbolDesignator;
  3551. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3552. BEGIN
  3553. IF isUnchecked THEN RETURN END;
  3554. IF tagsAvailable THEN
  3555. TrapC(BrltL,index,length,IndexCheckTrap);
  3556. END;
  3557. END BoundCheck;
  3558. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3559. VAR d: IntermediateCode.Operand;
  3560. BEGIN
  3561. IF isUnchecked THEN RETURN END;
  3562. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3563. TrapC(op,dim,d,ArraySizeTrap);
  3564. ReleaseIntermediateOperand(d);
  3565. END DimensionCheck;
  3566. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3567. VAR
  3568. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3569. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3570. expression: SyntaxTree.Expression;
  3571. resultingType, leftType, baseType: SyntaxTree.Type;
  3572. skipLabel1: Label;
  3573. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3574. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3575. variableOp: Operand;
  3576. variable: SyntaxTree.Variable;
  3577. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3578. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3579. VAR e: SyntaxTree.Expression; i: LONGINT;
  3580. BEGIN
  3581. tensorFound := FALSE;
  3582. FOR i := 0 TO parameters.Length()-1 DO
  3583. e := parameters.GetExpression(i);
  3584. IF e IS SyntaxTree.TensorRangeExpression THEN
  3585. ASSERT(~tensorFound);
  3586. tensorFound := TRUE;
  3587. ELSIF e IS SyntaxTree.RangeExpression THEN
  3588. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3589. ELSE
  3590. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3591. END;
  3592. END;
  3593. END CountIndices;
  3594. BEGIN
  3595. ASSERT(tagsAvailable);
  3596. resultingType := x.type.resolved; (* resulting type *)
  3597. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3598. InitOperand(localResult, ModeReference);
  3599. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3600. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3601. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3602. (* a globally defined array destination tag is available -> use and invalidate it*)
  3603. localResult.tag := arrayDestinationTag;
  3604. IntermediateCode.InitOperand(arrayDestinationTag)
  3605. ELSE
  3606. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3607. (* the result is of array range type and thus does not provide any collectable pointers *)
  3608. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3609. Symbol(variable, variableOp);
  3610. ReuseCopy(localResult.tag, variableOp.op);
  3611. ReleaseOperand(variableOp);
  3612. END
  3613. END;
  3614. indexListSize := x.parameters.Length();
  3615. CountIndices(x.parameters);
  3616. (*ASSERT(tensorRangeCount <= 1);*)
  3617. (* designate the array to be indexed over, perform tensor range check if known *)
  3618. Designate(x.left, array);
  3619. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3620. Dereference(array, leftType,FALSE);
  3621. IF ~tensorFound THEN
  3622. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3623. END
  3624. END;
  3625. (* default base offset *)
  3626. srcDimOffset := 0;
  3627. destDimOffset := 0;
  3628. indexDim := 0;
  3629. (* use address of source array as basis *)
  3630. localResult.op := array.op;
  3631. UseIntermediateOperand(localResult.op);
  3632. (* go through the index list *)
  3633. FOR i := 0 TO indexListSize - 1 DO
  3634. expression := x.parameters.GetExpression(i);
  3635. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3636. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3637. srcDimOffset := -indexListSize;
  3638. destDimOffset := -suffixRanges;
  3639. ELSE
  3640. (* determine which dimension of source array is currently looked at *)
  3641. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3642. (* get the memory operand pointing to array descriptor dimension *)
  3643. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3644. (* make a reusable register from it *)
  3645. ReuseCopy(srcDim, tmp);
  3646. ReleaseIntermediateOperand(tmp);
  3647. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3648. ELSE
  3649. srcDim := IntermediateCode.Immediate(sizeType, i);
  3650. END;
  3651. (* get length and increment of source array for current dimension *)
  3652. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3653. Convert(sourceLength.op, sizeType);
  3654. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3655. Convert(sourceIncrement.op, sizeType);
  3656. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3657. ReleaseIntermediateOperand(srcDim);
  3658. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3659. (* SINGLE INDEX *)
  3660. Evaluate(expression, index);
  3661. ReleaseIntermediateOperand(index.tag);
  3662. index.tag := emptyOperand;
  3663. Convert(index.op, sizeType);
  3664. (* lower bound check *)
  3665. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3666. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3667. ELSIF isUnchecked THEN (* do nothing *)
  3668. ELSE
  3669. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3670. END;
  3671. (* upper bound check *)
  3672. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3673. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3674. ELSIF isUnchecked THEN (* do nothing *)
  3675. ELSE
  3676. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3677. END;
  3678. ReleaseOperand(sourceLength);
  3679. Convert(index.op, addressType);
  3680. summand := index.op;
  3681. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3682. (* RANGE OF INDICES *)
  3683. Evaluate(expression, range);
  3684. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3685. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3686. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3687. ReleaseOperand(range);
  3688. Convert(firstIndex, sizeType);
  3689. Convert(lastIndex, sizeType);
  3690. Convert(stepSize, sizeType);
  3691. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3692. if it is 'MAX(LONGINT)' *)
  3693. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3694. TransferToRegister(lastIndex, lastIndex);
  3695. skipLabel1 := NewLabel();
  3696. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3697. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3698. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3699. SetLabel(skipLabel1)
  3700. END;
  3701. (* check if step size is valid *)
  3702. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3703. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3704. ELSIF isUnchecked THEN (* do nothing *)
  3705. ELSE
  3706. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3707. END;
  3708. (* check lower bound check *)
  3709. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3710. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3711. ELSIF isUnchecked THEN (* do nothing *)
  3712. ELSE
  3713. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3714. END;
  3715. (* check upper bound check *)
  3716. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3717. (* statically open range: nothing to do *)
  3718. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3719. ASSERT(staticLastIndex < staticSourceLength)
  3720. ELSIF isUnchecked THEN (* do nothing *)
  3721. ELSE
  3722. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3723. END;
  3724. (* determine length of target array for current dimension *)
  3725. (* 1. incorporate last index: *)
  3726. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3727. (* last index is static *)
  3728. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3729. targetLength := sourceLength.op
  3730. ELSE
  3731. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3732. END;
  3733. UseIntermediateOperand(targetLength);
  3734. ELSE
  3735. (* targetLength := lastIndex + 1
  3736. Reuse1(targetLength, lastIndex);
  3737. *)
  3738. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3739. END;
  3740. ReleaseOperand(sourceLength);
  3741. ReleaseIntermediateOperand(lastIndex);
  3742. (* 2. incorporate first index: *)
  3743. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3744. (* first index and current target length are static *)
  3745. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3746. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3747. (* first index = 0: nothing to do *)
  3748. ELSE
  3749. (* targetLength := targetLength - firstIndex *)
  3750. TransferToRegister(targetLength, targetLength);
  3751. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3752. END;
  3753. (* clip negative lengths to 0 *)
  3754. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3755. IF staticTargetLength < 0 THEN
  3756. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3757. END
  3758. ELSE
  3759. skipLabel1 := NewLabel();
  3760. TransferToRegister(targetLength, targetLength);
  3761. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3762. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3763. SetLabel(skipLabel1)
  3764. END;
  3765. (* 3. incorporate index step size: *)
  3766. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3767. (*step size and current target length are static *)
  3768. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3769. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3770. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3771. (* step size = 1: nothing to do *)
  3772. ELSE
  3773. (* emit code for this:
  3774. targetLength := (targetLength-1) DIV stepSize +1;
  3775. *)
  3776. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3777. DivInt(targetLength, targetLength, stepSize);
  3778. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3779. END;
  3780. (* determine increment of target array for current dimension *)
  3781. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3782. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3783. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3784. (* step size = 1 *)
  3785. targetIncrement := sourceIncrement.op;
  3786. UseIntermediateOperand(targetIncrement)
  3787. ELSE
  3788. (* targetIncrement := sourceIncrement * stepSize *)
  3789. Reuse1(targetIncrement, stepSize);
  3790. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3791. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3792. END;
  3793. ReleaseIntermediateOperand(stepSize);
  3794. (* write length and increment of target array to descriptor *)
  3795. IF destDimOffset < 0 THEN
  3796. (* determine which dimension of target array is currently looked at *)
  3797. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3798. TransferToRegister(destDim, tmp);
  3799. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3800. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3801. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3802. ReleaseIntermediateOperand(destDim);
  3803. INC(destDimOffset);
  3804. ELSE
  3805. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3806. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3807. END;
  3808. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3809. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3810. INC(indexDim);
  3811. Convert(firstIndex, addressType);
  3812. TransferToRegister(summand, firstIndex);
  3813. ELSE HALT(100);
  3814. END;
  3815. (*
  3816. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3817. *)
  3818. Convert(sourceIncrement.op, addressType);
  3819. Convert(summand, addressType);
  3820. MulInt(summand, summand, sourceIncrement.op);
  3821. ReleaseIntermediateOperand(sourceIncrement.op);
  3822. AddInt(localResult.op, localResult.op, summand);
  3823. ReleaseIntermediateOperand(summand);
  3824. END
  3825. END;
  3826. result := localResult;
  3827. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3828. ReleaseIntermediateOperand(result.tag);
  3829. result.tag := TypeDescriptorAdr(resultingType);
  3830. IF ~newObjectFile THEN
  3831. IntermediateCode.MakeMemory(result.tag,addressType);
  3832. END;
  3833. ELSIF IsDelegate(resultingType) THEN
  3834. ReleaseIntermediateOperand(result.tag);
  3835. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3836. UseIntermediateOperand(result.tag);
  3837. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3838. ReleaseIntermediateOperand(result.tag);
  3839. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3840. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3841. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3842. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3843. (* finalize target array descriptor *)
  3844. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3845. (* write lengths and increments of target array for remaining dimensions *)
  3846. i := indexListSize;
  3847. WHILE indexDim < targetArrayDimensionality DO
  3848. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3849. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3850. ReleaseOperand(sourceLength);
  3851. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3852. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3853. ReleaseOperand(sourceIncrement);
  3854. INC(i); INC(indexDim);
  3855. END;
  3856. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3857. tmp := nil;
  3858. ELSE
  3859. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3860. END;
  3861. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3862. ReleaseIntermediateOperand(tmp);
  3863. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3864. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3865. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3866. ELSE
  3867. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3868. END;
  3869. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3870. ReleaseIntermediateOperand(tmp);
  3871. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3872. (* write dimensionality *)
  3873. IF targetArrayDimensionality # 0 THEN
  3874. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3875. END;
  3876. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3877. END;
  3878. ReleaseOperand(array);
  3879. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3880. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3881. END;
  3882. END MathIndexDesignator;
  3883. (* get the length of an array , trying to make use of static information *)
  3884. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3885. VAR res: IntermediateCode.Operand; size: LONGINT;
  3886. BEGIN
  3887. type := type.resolved;
  3888. IF type IS SyntaxTree.ArrayType THEN
  3889. WITH type: SyntaxTree.ArrayType DO
  3890. IF type.form = SyntaxTree.Static THEN
  3891. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3892. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3893. Evaluate(type.length, op);
  3894. ReleaseIntermediateOperand(op.tag);
  3895. RETURN op.op;*)
  3896. ELSE
  3897. res := tag;
  3898. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3899. IntermediateCode.MakeMemory(res,addressType);
  3900. UseIntermediateOperand(res);
  3901. RETURN res
  3902. END
  3903. END;
  3904. ELSE
  3905. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3906. RETURN IntermediateCode.Immediate(addressType,size);
  3907. END;
  3908. END ArrayLength;
  3909. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3910. BEGIN
  3911. IF IsImmediate(x) THEN
  3912. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3913. ELSE
  3914. IF ~ReusableRegister(res) THEN
  3915. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3916. ELSE
  3917. UseIntermediateOperand(res);
  3918. END;
  3919. Emit(Mov(position,res,x))
  3920. END;
  3921. END CopyInt;
  3922. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3923. BEGIN
  3924. ReleaseIntermediateOperand(res);
  3925. IF IsImmediate(x) & IsImmediate(y) THEN
  3926. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3927. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3928. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3929. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3930. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3931. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3932. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3933. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3934. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3935. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3936. UseIntermediateOperand(res);
  3937. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3938. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3939. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3940. UseIntermediateOperand(res);
  3941. ELSE
  3942. IF ~ReusableRegister(res) THEN
  3943. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3944. ELSE
  3945. UseIntermediateOperand(res);
  3946. END;
  3947. IF IsImmediate(x) & (x.intValue = 0) THEN
  3948. Emit(Mov(position,res,y))
  3949. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3950. Emit(Mov(position,res,x))
  3951. ELSE
  3952. Emit(Add(position,res, x, y));
  3953. END;
  3954. END;
  3955. END AddInt;
  3956. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3957. BEGIN
  3958. ReleaseIntermediateOperand(res);
  3959. IF IsImmediate(x) & IsImmediate(y) THEN
  3960. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3961. ELSE
  3962. IF ~ReusableRegister(res) THEN
  3963. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3964. ELSE UseIntermediateOperand(res);
  3965. END;
  3966. IF IsImmediate(x) & (x.intValue = 1) THEN
  3967. Emit(Mov(position,res,y))
  3968. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3969. Emit(Mov(position,res,x))
  3970. ELSE
  3971. Emit(Mul(position,res, x, y));
  3972. END;
  3973. END;
  3974. END MulInt;
  3975. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3976. BEGIN
  3977. ReleaseIntermediateOperand(res);
  3978. IF IsImmediate(x) & IsImmediate(y) THEN
  3979. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3980. ELSE
  3981. IF ~ReusableRegister(res) THEN
  3982. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3983. ELSE UseIntermediateOperand(res);
  3984. END;
  3985. IF IsImmediate(x) & (x.intValue = 1) THEN
  3986. Emit(Mov(position,res,y))
  3987. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3988. Emit(Mov(position,res,x))
  3989. ELSE
  3990. Emit(Div(position,res, x, y));
  3991. END;
  3992. END;
  3993. END DivInt;
  3994. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3995. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3996. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3997. BEGIN
  3998. type := x.left.type.resolved;
  3999. IF type IS SyntaxTree.StringType THEN
  4000. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4001. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4002. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4003. type := atype;
  4004. x.left.SetType(type);
  4005. END;
  4006. IntermediateCode.InitImmediate(res,addressType,0);
  4007. maxDim := x.parameters.Length()-1;
  4008. (*
  4009. computation rule:
  4010. a: ARRAY X,Y,Z OF Element with size S
  4011. a[i,j,k] -->
  4012. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4013. *)
  4014. FOR i := 0 TO maxDim DO
  4015. e := x.parameters.GetExpression(i);
  4016. Evaluate(e,index);
  4017. Convert(index.op,addressType);
  4018. AddInt(res, res, index.op);
  4019. IF i = 0 THEN
  4020. (*
  4021. ReuseCopy(res, index.op);
  4022. *)
  4023. Designate(x.left,array);
  4024. type := x.left.type.resolved;
  4025. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4026. Dereference(array, type, FALSE);
  4027. END;
  4028. (*
  4029. ELSE AddInt(res, res, index.op);
  4030. *)
  4031. END;
  4032. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4033. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4034. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4035. BoundCheck(index.op, length);
  4036. END;
  4037. ReleaseIntermediateOperand(length);
  4038. END;
  4039. ReleaseOperand(index);
  4040. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4041. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4042. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4043. MulInt(res,res,length);
  4044. END;
  4045. ReleaseIntermediateOperand(length);
  4046. END;
  4047. (* remaining open dimensions -- compute address *)
  4048. i := maxDim+1;
  4049. IF type IS SyntaxTree.ArrayType THEN
  4050. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4051. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4052. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4053. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4054. MulInt(res,res,length);
  4055. END;
  4056. ReleaseIntermediateOperand(length);
  4057. INC(i);
  4058. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4059. END;
  4060. END;
  4061. IF (type IS SyntaxTree.ArrayType) THEN
  4062. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4063. size := StaticSize(system, type);
  4064. IF size # 1 THEN
  4065. length := IntermediateCode.Immediate(addressType,size);
  4066. MulInt(res,res,length);
  4067. END;
  4068. ELSE
  4069. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4070. IF size # 1 THEN
  4071. length := IntermediateCode.Immediate(addressType,size);
  4072. MulInt(res,res,length);
  4073. END;
  4074. END;
  4075. END;
  4076. AddInt(res,res,array.op);
  4077. InitOperand(result,ModeReference);
  4078. result.op := res;
  4079. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4080. ReleaseIntermediateOperand(result.tag);
  4081. result.tag := TypeDescriptorAdr(type);
  4082. IF ~newObjectFile THEN
  4083. IntermediateCode.MakeMemory(result.tag,addressType);
  4084. END
  4085. ELSIF IsDelegate(type) THEN
  4086. ReleaseIntermediateOperand(result.tag);
  4087. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4088. UseIntermediateOperand(result.tag);
  4089. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4090. ReleaseIntermediateOperand(result.tag);
  4091. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4092. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4093. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4094. END;
  4095. ReleaseOperand(array);
  4096. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4097. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4098. END;
  4099. END IndexDesignator;
  4100. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4101. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4102. BEGIN
  4103. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4104. dest := destination; destination := emptyOperand;
  4105. type := x.left.type.resolved;
  4106. IF type IS SyntaxTree.MathArrayType THEN
  4107. MathIndexDesignator(x);
  4108. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4109. IndexDesignator(x);
  4110. END;
  4111. destination := dest;
  4112. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4113. END VisitIndexDesignator;
  4114. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4115. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4116. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4117. procedure: SyntaxTree.Procedure;
  4118. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4119. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4120. BEGIN
  4121. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4122. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4123. parameters := expression.parameters;
  4124. moduleName := "FoxArrayBase";
  4125. procedureName := "CopyDescriptor";
  4126. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4127. SaveRegisters();ReleaseUsedRegisters(saved);
  4128. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4129. IF procedure = NIL THEN
  4130. s := "procedure ";
  4131. Strings.Append(s,moduleName);
  4132. Strings.Append(s,".");
  4133. Strings.Append(s,procedureName);
  4134. Strings.Append(s," not present");
  4135. Error(position,s);
  4136. ELSE
  4137. (* push address of temporary variable *)
  4138. Symbol(variable,destOperand);
  4139. Emit(Push(position,destOperand.op));
  4140. ReleaseOperand(destOperand);
  4141. (* push src *)
  4142. Evaluate(expression.left,srcOperand);
  4143. (*
  4144. Dereference(srcOperand,expression.type.resolved);
  4145. Emit(Push(position,srcOperand.tag));
  4146. *)
  4147. Emit(Push(position,srcOperand.op));
  4148. ReleaseOperand(srcOperand);
  4149. tensorFound := FALSE;
  4150. FOR i := 0 TO parameters.Length()-1 DO
  4151. e := parameters.GetExpression(i);
  4152. IF e IS SyntaxTree.TensorRangeExpression THEN
  4153. tensorFound := TRUE;
  4154. ELSIF e IS SyntaxTree.RangeExpression THEN
  4155. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4156. ELSE
  4157. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4158. END;
  4159. END;
  4160. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4161. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4162. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4163. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4164. StaticCallOperand(procOp,procedure);
  4165. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4166. ReleaseOperand(procOp);
  4167. END;
  4168. RestoreRegisters(saved);
  4169. END;
  4170. RETURN variable
  4171. END PrepareTensorDescriptor;
  4172. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4173. VAR
  4174. type, descriptorType, baseType: SyntaxTree.Type;
  4175. operand, tmpOperand, variableOp, variable2Op: Operand;
  4176. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4177. variable, variable2: SyntaxTree.Variable;
  4178. dim, i, size: LONGINT;
  4179. (* TODO: needed? *)
  4180. oldArrayDestinationTag: IntermediateCode.Operand;
  4181. oldArrayDestinationDimension: LONGINT;
  4182. position: Position;
  4183. saved: RegisterEntry;
  4184. arrayFlags: SET;
  4185. m, n: LONGINT;
  4186. PROCEDURE Pass(op: IntermediateCode.Operand);
  4187. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4188. BEGIN
  4189. IF numberRegister >= 0 THEN
  4190. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention,op.type,numberRegister));
  4191. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4192. Emit(Mov(position,parameterRegister, op));
  4193. ELSE
  4194. Emit(Push(position,op))
  4195. END
  4196. END Pass;
  4197. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4198. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4199. BEGIN
  4200. formalType := formalType.resolved; actualType := actualType.resolved;
  4201. IF IsOpenArray(formalType)THEN
  4202. IF actualType IS SyntaxTree.StringType THEN
  4203. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4204. RETURN;
  4205. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4206. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4207. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4208. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4209. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4210. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4211. ELSE
  4212. tmp := baseReg;
  4213. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4214. IntermediateCode.MakeMemory(tmp,addressType);
  4215. Pass((tmp));
  4216. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4217. END;
  4218. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4219. END;
  4220. END PushArrayLens;
  4221. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4222. BEGIN
  4223. CASE size OF
  4224. |2: INCL(flags,Size2Flag);
  4225. |3: INCL(flags,Size3Flag);
  4226. |4: INCL(flags,Size4Flag);
  4227. |5: INCL(flags,Size5Flag);
  4228. |6: INCL(flags,Size6Flag);
  4229. |7: INCL(flags,Size7Flag);
  4230. |8: INCL(flags,Size8Flag);
  4231. END;
  4232. END SetSmallArraySizeFlag;
  4233. BEGIN
  4234. IF Trace THEN TraceEnter("PushParameter") END;
  4235. position := expression.position;
  4236. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4237. type := expression.type.resolved;
  4238. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4239. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4240. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4241. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4242. );
  4243. (* TODO: needed? *)
  4244. oldArrayDestinationTag := arrayDestinationTag;
  4245. oldArrayDestinationDimension := arrayDestinationDimension;
  4246. IF IsArrayOfSystemByte(parameter.type) THEN
  4247. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4248. Designate(expression,operand);
  4249. ELSE
  4250. Evaluate(expression, tmpOperand);
  4251. (* array of system byte does not provide any pointers *)
  4252. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4253. Symbol(variable, operand);
  4254. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4255. Emit(Mov(position,tmp, tmpOperand.op));
  4256. ReleaseOperand(tmpOperand);
  4257. END;
  4258. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4259. ReleaseIntermediateOperand(operand.tag);
  4260. operand.tag := tmp;
  4261. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4262. Pass((operand.tag));
  4263. END;
  4264. Pass((operand.op));
  4265. ELSIF IsOpenArray(parameter.type) THEN
  4266. Designate(expression,operand);
  4267. baseReg := operand.tag;
  4268. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4269. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4270. END;
  4271. Pass((operand.op)); (* address of the array *)
  4272. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4273. (* case 1
  4274. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4275. *)
  4276. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4277. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4278. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4279. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4280. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4281. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4282. arrayDestinationTag := sp;
  4283. (* case 1b
  4284. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4285. *)
  4286. IF expression IS SyntaxTree.IndexDesignator THEN
  4287. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4288. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4289. arrayDestinationDimension := dim;
  4290. Designate(expression,operand);
  4291. (* case 1a
  4292. P(...,A,...) push: push array descriptor to stack
  4293. *)
  4294. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4295. Designate(expression,operand);
  4296. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4297. i := 0;
  4298. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4299. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4300. INC(i);
  4301. END;
  4302. type := expression.type.resolved;
  4303. WHILE (i<dim) DO (* remaining static dimensions *)
  4304. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4305. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4306. ReleaseOperand(tmpOperand);
  4307. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4308. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4309. ReleaseOperand(tmpOperand);
  4310. INC(i);
  4311. END;
  4312. dimOp := IntermediateCode.Immediate(addressType,dim);
  4313. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4314. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4315. (* case 1d
  4316. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4317. + case 1e
  4318. P(.. PT() ... );
  4319. *)
  4320. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4321. Designate(expression,operand);
  4322. Dereference(operand,type.resolved,FALSE);
  4323. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4324. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4325. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4326. (* case 1f
  4327. P(...,S,...) push: create array descriptor to S on stack
  4328. case 1g
  4329. P(... PS()...)
  4330. *)
  4331. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4332. Designate(expression,operand);
  4333. FOR i := 0 TO dim-1 DO
  4334. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4335. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4336. ReleaseOperand(tmpOperand);
  4337. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4338. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4339. ReleaseOperand(tmpOperand);
  4340. END;
  4341. (*******
  4342. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4343. *)
  4344. arrayFlags := {StaticFlag};
  4345. IF dim = 1 THEN
  4346. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4347. ReleaseOperand(tmpOperand);
  4348. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4349. m := LONGINT(tmpOperand.op.intValue);
  4350. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4351. ELSIF dim = 2 THEN
  4352. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4353. ReleaseOperand(tmpOperand);
  4354. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4355. m := LONGINT(tmpOperand.op.intValue);
  4356. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4357. ReleaseOperand(tmpOperand);
  4358. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4359. n := LONGINT(tmpOperand.op.intValue);
  4360. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4361. INCL(arrayFlags,SmallMatrixFlag);
  4362. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4363. END;
  4364. END;
  4365. (*******)
  4366. dimOp := IntermediateCode.Immediate(addressType,dim);
  4367. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4368. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4369. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4370. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4371. baseType := SemanticChecker.ArrayBase(type,dim);
  4372. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4373. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4374. ELSE HALT(100);
  4375. END;
  4376. (* case 2
  4377. procedure P([left args], var A: array [*,*] of Type, [right args])
  4378. *)
  4379. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4380. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4381. (* case 2b
  4382. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4383. push: push reference to pushed array descriptor
  4384. post: remove array descriptor.
  4385. *)
  4386. IF expression IS SyntaxTree.IndexDesignator THEN
  4387. descriptorType := GetMathArrayDescriptorType(dim);
  4388. (* range type : no allocation possible, should be untraced *)
  4389. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4390. Symbol(variable,variableOp);
  4391. arrayDestinationTag := variableOp.op;
  4392. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4393. arrayDestinationDimension := dim;
  4394. NeedDescriptor := TRUE;
  4395. Designate(expression,operand);
  4396. Pass((operand.tag));
  4397. NeedDescriptor := FALSE;
  4398. (* case 2a
  4399. P(...,A,...)
  4400. push: push reference to array descriptor on stack
  4401. *)
  4402. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4403. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4404. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4405. INC(i);
  4406. END;
  4407. IF i = dim THEN
  4408. Designate(expression,operand);
  4409. Pass((operand.tag));
  4410. ELSE (* open-static *)
  4411. type := expression.type.resolved;
  4412. descriptorType := GetMathArrayDescriptorType(dim);
  4413. (* static array , cannot be reallocated, untraced !*)
  4414. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4415. Symbol(variable,variableOp);
  4416. arrayDestinationTag := variableOp.op;
  4417. Designate(expression,operand);
  4418. FOR i := 0 TO dim-1 DO
  4419. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4420. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4421. ReleaseOperand(tmpOperand);
  4422. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4423. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4424. ReleaseOperand(tmpOperand);
  4425. END;
  4426. dimOp := IntermediateCode.Immediate(addressType,dim);
  4427. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4428. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4429. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4430. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4431. baseType := SemanticChecker.ArrayBase(type,dim);
  4432. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4433. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4434. Pass((arrayDestinationTag));
  4435. END;
  4436. (* case 2d
  4437. P(...,T,...) push: emit dimension check, push T
  4438. *)
  4439. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4440. Designate(expression,operand);
  4441. Dereference(operand,type.resolved,FALSE);
  4442. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4443. Pass((operand.tag));
  4444. (* case 2f
  4445. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4446. push: push reference to pushed array descriptor
  4447. post: remove array descriptor
  4448. *)
  4449. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4450. descriptorType := GetMathArrayDescriptorType(dim);
  4451. (* static array -- cannot be reallocatated, untraced *)
  4452. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4453. Symbol(variable,variableOp);
  4454. arrayDestinationTag := variableOp.op;
  4455. Designate(expression,operand);
  4456. FOR i := 0 TO dim-1 DO
  4457. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4458. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4459. ReleaseOperand(tmpOperand);
  4460. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4461. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4462. ReleaseOperand(tmpOperand);
  4463. END;
  4464. (*
  4465. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4466. *)
  4467. arrayFlags := {StaticFlag};
  4468. IF dim = 1 THEN
  4469. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4470. ReleaseOperand(tmpOperand);
  4471. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4472. m := LONGINT(tmpOperand.op.intValue);
  4473. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4474. ELSIF dim = 2 THEN
  4475. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4476. ReleaseOperand(tmpOperand);
  4477. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4478. m := LONGINT(tmpOperand.op.intValue);
  4479. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4480. ReleaseOperand(tmpOperand);
  4481. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4482. n := LONGINT(tmpOperand.op.intValue);
  4483. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4484. INCL(arrayFlags,SmallMatrixFlag);
  4485. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4486. END;
  4487. END;
  4488. (*******)
  4489. dimOp := IntermediateCode.Immediate(addressType,dim);
  4490. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4491. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4492. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4493. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4494. baseType := SemanticChecker.ArrayBase(type,dim);
  4495. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4496. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4497. Pass((arrayDestinationTag));
  4498. ELSE HALT(100);
  4499. END;
  4500. (* case 3
  4501. procedure P([left args], [const] A: array [?] of Type, [right args])
  4502. *)
  4503. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4504. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4505. (* case 3b
  4506. P(...,A[a..b,c..d],...)
  4507. *)
  4508. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4509. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4510. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4511. Symbol(variable,variableOp);
  4512. LoadValue(variableOp,system.addressType);
  4513. ELSE
  4514. descriptorType := GetMathArrayDescriptorType(dim);
  4515. (* range -- cannot be reallocated *)
  4516. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4517. Symbol(variable,variableOp);
  4518. END;
  4519. arrayDestinationTag := variableOp.op;
  4520. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4521. arrayDestinationDimension := 0;
  4522. Designate(expression,operand);
  4523. Pass((operand.tag));
  4524. (* case 3a
  4525. P(...,A,...)
  4526. *)
  4527. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4528. i := 0;
  4529. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4530. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4531. INC(i);
  4532. END;
  4533. IF i = dim THEN
  4534. Designate(expression,operand);
  4535. Pass((operand.tag));
  4536. ELSE (* open-static *)
  4537. type := expression.type.resolved;
  4538. descriptorType := GetMathArrayDescriptorType(dim);
  4539. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4540. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4541. Symbol(variable,variableOp);
  4542. arrayDestinationTag := variableOp.op;
  4543. Designate(expression,operand);
  4544. FOR i := 0 TO dim-1 DO
  4545. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4546. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4547. ReleaseOperand(tmpOperand);
  4548. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4549. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4550. ReleaseOperand(tmpOperand);
  4551. END;
  4552. dimOp := IntermediateCode.Immediate(addressType,dim);
  4553. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4554. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4555. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4556. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4557. baseType := SemanticChecker.ArrayBase(type,dim);
  4558. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4559. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4560. Pass((arrayDestinationTag));
  4561. END;
  4562. (* case 3d
  4563. P(...,T,...)
  4564. case 3e
  4565. P(...,PT(...),...)
  4566. *)
  4567. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4568. Designate(expression,operand);
  4569. Dereference(operand,type.resolved,FALSE);
  4570. Pass((operand.tag));
  4571. (* case 3f
  4572. P(...,S,...)
  4573. case 3g
  4574. P(...,PS(...),...)
  4575. *)
  4576. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4577. descriptorType := GetMathArrayDescriptorType(dim);
  4578. (* static array does not need to be traced *)
  4579. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4580. Symbol(variable,variableOp);
  4581. arrayDestinationTag := variableOp.op;
  4582. Designate(expression,operand);
  4583. IF operand.op.type.length >1 THEN (* vector register *)
  4584. (* static array does not need to be traced *)
  4585. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4586. Symbol(variable2, variable2Op);
  4587. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4588. Emit(Mov(position,tmp, operand.op));
  4589. ReleaseOperand(operand);
  4590. Symbol(variable2, operand);
  4591. END;
  4592. FOR i := 0 TO dim-1 DO
  4593. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4594. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4595. ReleaseOperand(tmpOperand);
  4596. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4597. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4598. ReleaseOperand(tmpOperand);
  4599. END;
  4600. dimOp := IntermediateCode.Immediate(addressType,dim);
  4601. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4602. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4603. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4604. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4605. baseType := SemanticChecker.ArrayBase(type,dim);
  4606. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4607. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4608. Pass((arrayDestinationTag));
  4609. ELSE HALT(100);
  4610. END;
  4611. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4612. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4613. (* case 4b
  4614. P(...,A[a..b,c..d],...)
  4615. *)
  4616. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4617. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4618. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4619. Symbol(variable,variableOp);
  4620. LoadValue(variableOp,system.addressType);
  4621. ELSE
  4622. descriptorType := GetMathArrayDescriptorType(dim);
  4623. (* range array -- cannot be allocated *)
  4624. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4625. Symbol(variable,variableOp);
  4626. END;
  4627. arrayDestinationTag := variableOp.op;
  4628. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4629. arrayDestinationDimension := 0;
  4630. Designate(expression,operand);
  4631. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4632. Symbol(variable,variableOp);
  4633. ELSE
  4634. (* alias to range -- untraced *)
  4635. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4636. Symbol(variable,variableOp);
  4637. MakeMemory(tmp,variableOp.op,addressType,0);
  4638. Emit(Mov(position,tmp,operand.tag));
  4639. ReleaseIntermediateOperand(tmp);
  4640. END;
  4641. Pass((variableOp.op));
  4642. ReleaseOperand(variableOp);
  4643. (* case 4a
  4644. P(...,A,...)
  4645. *)
  4646. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4647. i := 0;
  4648. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4649. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4650. INC(i);
  4651. END;
  4652. IF i = dim THEN
  4653. Designate(expression,operand);
  4654. arrayDestinationTag := operand.tag;
  4655. ELSE (* open-static *)
  4656. type := expression.type.resolved;
  4657. descriptorType := GetMathArrayDescriptorType(dim);
  4658. (* static array -- untraced *)
  4659. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4660. Symbol(variable,variableOp);
  4661. arrayDestinationTag := variableOp.op;
  4662. Designate(expression,operand);
  4663. FOR i := 0 TO dim-1 DO
  4664. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4665. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4666. ReleaseOperand(tmpOperand);
  4667. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4668. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4669. ReleaseOperand(tmpOperand);
  4670. END;
  4671. dimOp := IntermediateCode.Immediate(addressType,dim);
  4672. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4673. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4674. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4675. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4676. baseType := SemanticChecker.ArrayBase(type,dim);
  4677. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4678. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4679. END;
  4680. (* tensor alias to open array -- untraced *)
  4681. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4682. Symbol(variable,variableOp);
  4683. MakeMemory(tmp,variableOp.op,addressType,0);
  4684. Emit(Mov(position,tmp,arrayDestinationTag));
  4685. ReleaseIntermediateOperand(tmp);
  4686. Pass((variableOp.op));
  4687. ReleaseOperand(variableOp);
  4688. (* case 4d
  4689. P(...,T,...)
  4690. *)
  4691. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4692. Designate(expression,operand);
  4693. Pass((operand.op));
  4694. (* case 4f
  4695. P(...,S,...)
  4696. *)
  4697. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4698. descriptorType := GetMathArrayDescriptorType(dim);
  4699. (* static array -- cannot be reallocated, untraced *)
  4700. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4701. Symbol(variable,variableOp);
  4702. arrayDestinationTag := variableOp.op;
  4703. Designate(expression,operand);
  4704. FOR i := 0 TO dim-1 DO
  4705. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4706. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4707. ReleaseOperand(tmpOperand);
  4708. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4709. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4710. ReleaseOperand(tmpOperand);
  4711. END;
  4712. dimOp := IntermediateCode.Immediate(addressType,dim);
  4713. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4714. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4715. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4716. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4717. baseType := SemanticChecker.ArrayBase(type,dim);
  4718. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4719. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4720. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4721. Symbol(variable,variableOp);
  4722. MakeMemory(tmp,variableOp.op,addressType,0);
  4723. Emit(Mov(position,tmp,arrayDestinationTag));
  4724. ReleaseIntermediateOperand(tmp);
  4725. Pass((variableOp.op));
  4726. ReleaseOperand(variableOp);
  4727. ELSE HALT(100);
  4728. END;
  4729. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4730. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4731. Designate(expression,operand);
  4732. IF operand.op.type.length > 1 THEN
  4733. Emit(Push(position, operand.op));
  4734. ELSE
  4735. size := system.SizeOf(type);
  4736. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4737. size := ToMemoryUnits(system,size);
  4738. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4739. arrayDestinationTag := sp;
  4740. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4741. END;
  4742. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4743. Designate(expression,operand);
  4744. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4745. (* static array no pointer *)
  4746. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4747. Symbol(variable,variableOp);
  4748. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4749. Emit(Mov(position,tmp,operand.op));
  4750. Emit(Push(position,variableOp.op));
  4751. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4752. Pass((operand.op));
  4753. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4754. END;
  4755. ELSE HALT(200)
  4756. END;
  4757. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4758. IF parameter.kind = SyntaxTree.VarParameter THEN
  4759. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4760. Designate(expression, operand);
  4761. Pass((operand.op));
  4762. ELSE
  4763. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4764. Evaluate(expression, operand);
  4765. Pass((operand.extra)); (* step *)
  4766. Pass((operand.tag)); (* last *)
  4767. Pass((operand.op)) (* first *)
  4768. END
  4769. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4770. IF parameter.kind = SyntaxTree.VarParameter THEN
  4771. Designate(expression, operand);
  4772. Pass((operand.op));
  4773. ELSE
  4774. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4775. Evaluate(expression, operand);
  4776. Pass((operand.tag)); (* real part *)
  4777. Pass((operand.op)) (* imaginary part *)
  4778. END
  4779. ELSE
  4780. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4781. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4782. Designate(expression,operand);
  4783. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4784. (* stack allocation *)
  4785. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4786. (*! parameter alignment to be discussed ... *)
  4787. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4788. size := type(SyntaxTree.StringType).length;
  4789. END;
  4790. IF backend.cooperative & parameter.NeedsTrace() THEN
  4791. dst := NewRegisterOperand (addressType);
  4792. Emit(Mov(position,dst, sp));
  4793. IntermediateCode.InitImmediate(null, byteType, 0);
  4794. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4795. ReleaseIntermediateOperand(dst);
  4796. SaveRegisters();ReleaseUsedRegisters(saved);
  4797. (* register dst has been freed before SaveRegisters already *)
  4798. CallAssignMethod(dst, operand.op, parameter.type);
  4799. RestoreRegisters(saved);
  4800. END;
  4801. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4802. ELSIF IsOpenArray(parameter.type) THEN
  4803. Designate(expression,operand);
  4804. baseReg := operand.tag;
  4805. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4806. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4807. END;
  4808. Pass((operand.op)); (* address of the array *)
  4809. ELSIF IsDelegate(parameter.type) THEN
  4810. Evaluate(expression,operand);
  4811. IF backend.cooperative & parameter.NeedsTrace() THEN
  4812. Emit(Push(position, nil));
  4813. dst := NewRegisterOperand (addressType);
  4814. Emit(Mov(position,dst, sp));
  4815. ReleaseIntermediateOperand(dst);
  4816. SaveRegisters();ReleaseUsedRegisters(saved);
  4817. Emit(Push(position, dst));
  4818. (* register dst has been freed before SaveRegisters already *)
  4819. Emit(Push(position, operand.tag));
  4820. CallThis(position,"GarbageCollector","Assign",2);
  4821. RestoreRegisters(saved);
  4822. ELSE
  4823. Pass((operand.tag));
  4824. END;
  4825. Pass((operand.op));
  4826. ELSE
  4827. Evaluate(expression,operand);
  4828. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4829. Emit(Push(position, nil));
  4830. dst := NewRegisterOperand (addressType);
  4831. Emit(Mov(position,dst, sp));
  4832. ReleaseIntermediateOperand(dst);
  4833. SaveRegisters();ReleaseUsedRegisters(saved);
  4834. Emit(Push(position, dst));
  4835. (* register dst has been freed before SaveRegisters already *)
  4836. Emit(Push(position, operand.op));
  4837. CallThis(position,"GarbageCollector","Assign",2);
  4838. RestoreRegisters(saved);
  4839. ELSE
  4840. Pass((operand.op));
  4841. END;
  4842. END;
  4843. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4844. Evaluate(expression,operand);
  4845. Pass((operand.op));
  4846. ELSE (* var parameter *)
  4847. Designate(expression,operand);
  4848. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4849. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4850. Pass((operand.tag));
  4851. END;
  4852. END;
  4853. Pass((operand.op));
  4854. END;
  4855. END;
  4856. (* TODO: needed? *)
  4857. arrayDestinationTag := oldArrayDestinationTag;
  4858. arrayDestinationDimension := oldArrayDestinationDimension;
  4859. IF needsParameterBackup THEN
  4860. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4861. ReuseCopy(parameterBackup, operand.op)
  4862. END;
  4863. ReleaseOperand(operand);
  4864. IF Trace THEN TraceExit("PushParameter") END;
  4865. END PushParameter;
  4866. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  4867. VAR prevConditional: BOOLEAN;
  4868. BEGIN
  4869. prevConditional := conditional;
  4870. conditional := FALSE;
  4871. 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
  4872. Expression(x.result); (* use register *)
  4873. END;
  4874. Statement(x.statement);
  4875. conditional := prevConditional;
  4876. IF x.result # NIL THEN Expression(x.result) END;
  4877. 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
  4878. ReleaseIntermediateOperand(result.op);
  4879. END;
  4880. END VisitStatementDesignator;
  4881. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4882. VAR
  4883. procedure: SyntaxTree.Procedure;
  4884. procedureType: SyntaxTree.ProcedureType;
  4885. wasInline: BOOLEAN;
  4886. actualParameters: SyntaxTree.ExpressionList;
  4887. formalParameter: SyntaxTree.Parameter;
  4888. actualParameter: SyntaxTree.Expression;
  4889. i: LONGINT;
  4890. localVariable: SyntaxTree.Variable;
  4891. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4892. src, dest: Operand;
  4893. prevInlineExit : Label;
  4894. prevMapper: SymbolMapper;
  4895. tooComplex: BOOLEAN;
  4896. resultDesignator: SyntaxTree.Expression;
  4897. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4898. BEGIN
  4899. IF e = NIL THEN RETURN TRUE
  4900. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4901. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4902. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4903. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4904. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4905. ELSE RETURN FALSE
  4906. END;
  4907. END SimpleExpression;
  4908. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4909. BEGIN
  4910. RETURN checker.CanPassInRegister(type)
  4911. END FitsInRegister;
  4912. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4913. VAR
  4914. variable: SyntaxTree.Variable;
  4915. variableDesignator: SyntaxTree.Designator;
  4916. BEGIN
  4917. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  4918. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  4919. variableDesignator.SetType(type);
  4920. RETURN variableDesignator
  4921. END GetTemp;
  4922. BEGIN
  4923. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4924. wasInline := currentIsInline;
  4925. prevInlineExit := currentInlineExit;
  4926. prevMapper := currentMapper;
  4927. currentInlineExit := NewLabel();
  4928. tooComplex := FALSE;
  4929. NEW(currentMapper);
  4930. currentIsInline := TRUE;
  4931. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4932. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4933. formalParameter := procedureType.firstParameter;
  4934. actualParameters := x.parameters;
  4935. i := 0;
  4936. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4937. actualParameter := actualParameters.GetExpression(i);
  4938. IF actualParameter.resolved # NIL THEN
  4939. actualParameter := actualParameter.resolved
  4940. END;
  4941. (*
  4942. if expression is simple and can be passed immediately
  4943. or if type fits in register then we can proceed
  4944. otherwise we escape to ordinary procedure call.
  4945. *)
  4946. (* cases where the expression can be mapped identically *)
  4947. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4948. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  4949. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4950. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4951. (*
  4952. Assign(variableDesignator, actualParameter);
  4953. *)
  4954. Evaluate(actualParameter, src);
  4955. Designate(variableDesignator, dest);
  4956. Emit(Mov(x.position, dest.op, src.op));
  4957. ReleaseOperand(dest);
  4958. ReleaseOperand(src);
  4959. (* the src operand should now have been completely released ! *)
  4960. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  4961. ELSE tooComplex := TRUE
  4962. END;
  4963. (*
  4964. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4965. currentMapper.Add(formalParameter, actualParameter, NIL);
  4966. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4967. variableDesignator := GetTemp(system.addressType, FALSE);
  4968. Designate(actualParameter, src);
  4969. Designate(variableDesignator, dest);
  4970. IntermediateCode.MakeMemory(dest.op,addressType);
  4971. Emit(Mov(x.position, dest.op, src.op));
  4972. ReleaseOperand(dest);
  4973. IF src.tag.mode # IntermediateCode.Undefined THEN
  4974. tagDesignator := GetTemp(system.addressType, FALSE);
  4975. Designate(tagDesignator, dest);
  4976. IntermediateCode.MakeMemory(dest.op,addressType);
  4977. Emit(Mov(x.position, dest.op, src.op));
  4978. END;
  4979. ReleaseOperand(dest); ReleaseOperand(src);
  4980. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4981. END;
  4982. *)
  4983. formalParameter := formalParameter.nextParameter;
  4984. INC(i);
  4985. END;
  4986. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4987. IF resultDesignator # NIL THEN
  4988. returnDesignator := resultDesignator
  4989. ELSE
  4990. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4991. END;
  4992. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  4993. END;
  4994. localVariable := procedure.procedureScope.firstVariable;
  4995. WHILE ~tooComplex & (localVariable # NIL) DO
  4996. variableDesignator := GetTemp(localVariable.type, FALSE);
  4997. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  4998. localVariable := localVariable.nextVariable;
  4999. END;
  5000. IF ~tooComplex THEN
  5001. VisitStatementBlock(procedure.procedureScope.body);
  5002. SetLabel(currentInlineExit);
  5003. IF procedureType.returnType # NIL THEN
  5004. Designate(returnDesignator, result);
  5005. IF conditional THEN
  5006. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5007. ValueToCondition(result)
  5008. END;
  5009. END;
  5010. END;
  5011. currentMapper := prevMapper;
  5012. currentInlineExit := prevInlineExit;
  5013. currentIsInline := wasInline;
  5014. RETURN ~tooComplex
  5015. END InlineProcedureCall;
  5016. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5017. VAR
  5018. parameters: SyntaxTree.ExpressionList;
  5019. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5020. designator: SyntaxTree.Designator;
  5021. procedureType: SyntaxTree.ProcedureType;
  5022. formalParameter: SyntaxTree.Parameter;
  5023. operand, returnValue: Operand;
  5024. reg, size, mask, dest: IntermediateCode.Operand;
  5025. saved,saved2: RegisterEntry;
  5026. symbol: SyntaxTree.Symbol;
  5027. variable: SyntaxTree.Variable;
  5028. i, parametersSize, returnTypeSize : LONGINT;
  5029. structuredReturnType: BOOLEAN;
  5030. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5031. tempVariableDesignator: SyntaxTree.Designator;
  5032. gap, alignment: LONGINT; (*fld*)
  5033. (* TODO: remove unnecessary backup variables *)
  5034. oldResult: Operand;
  5035. oldCurrentScope: SyntaxTree.Scope;
  5036. oldArrayDestinationTag: IntermediateCode.Operand;
  5037. oldArrayDestinationDimension: LONGINT;
  5038. oldConstantDeclaration: SyntaxTree.Symbol;
  5039. oldDestination: IntermediateCode.Operand;
  5040. oldCurrentLoop: Label;
  5041. oldConditional: BOOLEAN;
  5042. oldTrueLabel, oldFalseLabel: Label;
  5043. oldLocked: BOOLEAN;
  5044. usedRegisters,oldUsedRegisters: RegisterEntry;
  5045. return: IntermediateCode.Operand;
  5046. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5047. arg: IntermediateCode.Operand;
  5048. dummy: IntermediateCode.Operand;
  5049. recordType: SyntaxTree.RecordType;
  5050. operatorSelectionProcedureOperand: Operand;
  5051. operatorSelectionProcedure: SyntaxTree.Procedure;
  5052. fingerPrint: SyntaxTree.FingerPrint;
  5053. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5054. identifierNumber: LONGINT;
  5055. parameterRegisters: SIZE;
  5056. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5057. procedure: SyntaxTree.Procedure;
  5058. PROCEDURE BackupGlobalState;
  5059. BEGIN
  5060. oldResult := result;
  5061. oldCurrentScope := currentScope;
  5062. oldArrayDestinationTag := arrayDestinationTag;
  5063. oldArrayDestinationDimension := arrayDestinationDimension;
  5064. oldConstantDeclaration := constantDeclaration;
  5065. oldDestination := destination;
  5066. oldCurrentLoop := currentLoop;
  5067. oldConditional := conditional;
  5068. oldTrueLabel := trueLabel;
  5069. oldFalseLabel := falseLabel;
  5070. oldLocked := locked;
  5071. oldUsedRegisters := usedRegisters
  5072. END BackupGlobalState;
  5073. PROCEDURE RestoreGlobalState;
  5074. BEGIN
  5075. result := oldResult;
  5076. currentScope := oldCurrentScope;
  5077. arrayDestinationTag := oldArrayDestinationTag;
  5078. arrayDestinationDimension := oldArrayDestinationDimension;
  5079. constantDeclaration := oldConstantDeclaration;
  5080. destination := oldDestination;
  5081. currentLoop := oldCurrentLoop;
  5082. conditional := oldConditional;
  5083. trueLabel := oldTrueLabel;
  5084. falseLabel := oldFalseLabel;
  5085. locked := oldLocked;
  5086. usedRegisters := oldUsedRegisters
  5087. END RestoreGlobalState;
  5088. (** do preparations before parameter push for array-structured object types (ASOTs):
  5089. if ASOT is passed as VAR parameter:
  5090. - allocate temporary variable of math array type
  5091. - copy contents of ASOT to be passed to temporary variable
  5092. - use temporary variable as the actual parameter instead
  5093. - 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)
  5094. **)
  5095. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5096. VAR
  5097. expression: SyntaxTree.Expression;
  5098. BEGIN
  5099. IF actualParameter IS SyntaxTree.Designator THEN
  5100. designator := actualParameter(SyntaxTree.Designator);
  5101. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5102. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5103. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5104. ASSERT(checker # NIL);
  5105. checker.SetCurrentScope(currentScope);
  5106. (* allocate temporary variable *)
  5107. ASSERT(actualParameter.type # NIL);
  5108. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5109. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5110. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5111. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5112. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5113. ASSERT(tempVariableDesignator.type # NIL);
  5114. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5115. (* copy math array stored in actual parameter to temporary variable *)
  5116. BackupGlobalState;
  5117. AssignMathArray(tempVariableDesignator, actualParameter);
  5118. RestoreGlobalState;
  5119. (* use temporary variable as actual parameter instead of the original one *)
  5120. actualParameter := tempVariableDesignator;
  5121. (* create write-back call and store it in linked list *)
  5122. (* create new list entry *)
  5123. IF firstWriteBackCall = NIL THEN
  5124. NEW(firstWriteBackCall);
  5125. currentWriteBackCall := firstWriteBackCall
  5126. ELSE
  5127. ASSERT(currentWriteBackCall # NIL);
  5128. NEW(currentWriteBackCall.next);
  5129. currentWriteBackCall := currentWriteBackCall.next
  5130. END;
  5131. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5132. ASSERT(expression.type = NIL);
  5133. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5134. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5135. (* prepare writeback for any other "normal" indexer *)
  5136. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5137. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5138. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5139. Assign(tempVariableDesignator, actualParameter);
  5140. actualParameter := tempVariableDesignator;
  5141. IF firstWriteBackCall = NIL THEN
  5142. NEW(firstWriteBackCall);
  5143. currentWriteBackCall := firstWriteBackCall
  5144. ELSE
  5145. ASSERT(currentWriteBackCall # NIL);
  5146. NEW(currentWriteBackCall.next);
  5147. currentWriteBackCall := currentWriteBackCall.next
  5148. END;
  5149. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5150. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5151. END
  5152. END
  5153. END PrepareParameter;
  5154. BEGIN
  5155. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5156. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5157. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5158. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5159. IF InlineProcedureCall(x) THEN
  5160. RETURN
  5161. ELSE
  5162. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5163. END
  5164. END;
  5165. END;
  5166. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5167. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5168. dest := destination; destination := emptyOperand;
  5169. SaveRegisters();ReleaseUsedRegisters(saved);
  5170. parameters := x.parameters;
  5171. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5172. (* an operator is called *)
  5173. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5174. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  5175. (* check if a dynamic operator call should be performed *)
  5176. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5177. ELSE
  5178. isCallOfDynamicOperator := FALSE
  5179. END;
  5180. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5181. Emit(Push(position, ap));
  5182. END;
  5183. alignment := procedureType.stackAlignment;
  5184. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize = 64) THEN
  5185. alignment := 16 (* bytes *);
  5186. END;
  5187. IF alignment > 1 THEN
  5188. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5189. Emit(Mov(position,reg, sp));
  5190. gap := ParametersSize(system, procedureType, FALSE);
  5191. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5192. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN
  5193. gap := 4*ToMemoryUnits(system,system.addressSize); (* at least four registers get pushed*)
  5194. END;
  5195. END;
  5196. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  5197. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5198. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5199. Emit(And(position,sp, sp, mask));
  5200. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5201. Emit(Push(position,reg));
  5202. (*
  5203. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5204. Emit(Mov(position,mem,reg));
  5205. *)
  5206. ReleaseIntermediateOperand(reg);
  5207. END;
  5208. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 32) THEN
  5209. (* align stack to 16-byte boundary *)
  5210. IntermediateCode.InitImmediate(mask,addressType,-16);
  5211. Emit(And(position,sp, sp, mask));
  5212. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5213. IF gap # 0 THEN
  5214. IntermediateCode.InitImmediate(size,addressType,gap);
  5215. Emit(Sub(position,sp,sp,size))
  5216. END;
  5217. END;
  5218. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5219. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5220. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5221. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5222. ELSE
  5223. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5224. END;
  5225. Evaluate(x.left, operand);
  5226. IF symbol IS SyntaxTree.Procedure THEN
  5227. IF (procedureType.selfParameter # NIL) THEN
  5228. Emit(Push(position,operand.tag));
  5229. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5230. Emit(Push(position,operand.tag));
  5231. ELSIF (procedureType.isDelegate) THEN
  5232. Emit(Push(position,operand.tag));
  5233. END;
  5234. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5235. IF (procedureType.selfParameter # NIL) THEN
  5236. Emit(Push(position,operand.tag));
  5237. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5238. Emit(Push(position,operand.tag));
  5239. END;
  5240. ELSE HALT(200);
  5241. END;
  5242. ReleaseIntermediateOperand(operand.tag);
  5243. operand.tag := emptyOperand;
  5244. (* determine if a structured return type is needed *)
  5245. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5246. IF structuredReturnType THEN
  5247. IF resultDesignator # NIL THEN
  5248. d := resultDesignator;
  5249. ELSE
  5250. (* temporary result that might be allocated, must potentially be traced *)
  5251. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5252. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5253. d.SetType(variable.type);
  5254. END;
  5255. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5256. Designate(d,returnValue);
  5257. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5258. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5259. Emit(Push(position,size));
  5260. Emit(Push(position,returnValue.op));
  5261. ReleaseOperand(returnValue);
  5262. ELSE*)
  5263. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5264. (*
  5265. END;
  5266. *)
  5267. END;
  5268. firstWriteBackCall := NIL; (* reset write-back call list *)
  5269. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5270. parameterRegisters := backend.NumberParameterRegisters(procedureType.callingConvention);
  5271. passByRegister := parameterRegisters > 0;
  5272. registerNumber := 0;
  5273. formalParameter := procedureType.lastParameter;
  5274. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5275. actualParameter := parameters.GetExpression(i);
  5276. PrepareParameter(actualParameter, formalParameter);
  5277. IF passByRegister & (i < parameterRegisters) THEN
  5278. IF ~PassInRegister(formalParameter) THEN
  5279. Error(actualParameter.position,"cannot be passed by register")
  5280. ELSE
  5281. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  5282. END;
  5283. INC(registerNumber);
  5284. ELSE
  5285. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5286. END;
  5287. formalParameter := formalParameter.prevParameter;
  5288. END;
  5289. IF passByRegister (* & (registerNumber > 0)*) & ~SysvABI(procedureType.callingConvention) THEN
  5290. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5291. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5292. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5293. END;
  5294. ELSE
  5295. hasDynamicOperands := FALSE;
  5296. formalParameter := procedureType.firstParameter;
  5297. FOR i := 0 TO parameters.Length() - 1 DO
  5298. actualParameter := parameters.GetExpression(i);
  5299. IF formalParameter # NIL THEN (* TENTATIVE *)
  5300. PrepareParameter(actualParameter, formalParameter);
  5301. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5302. ASSERT(i < 2);
  5303. hasDynamicOperands := TRUE;
  5304. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5305. ELSE
  5306. IF passByRegister & (registerNumber > 0) THEN
  5307. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5308. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5309. END;
  5310. passByRegister := FALSE;
  5311. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5312. END;
  5313. formalParameter := formalParameter.nextParameter;
  5314. END;
  5315. END;
  5316. END;
  5317. IF symbol IS SyntaxTree.Procedure THEN
  5318. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5319. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5320. Emit(Push(position,reg));
  5321. ReleaseIntermediateOperand(reg);
  5322. END;
  5323. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5324. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5325. parametersSize := ParametersSize(system,procedureType,FALSE);
  5326. END;
  5327. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5328. (*
  5329. dynamic operator overloading:
  5330. first push parameters, regularly:
  5331. [self]
  5332. par1
  5333. par2
  5334. then push parameters for GetOperator
  5335. identifier
  5336. ptr1
  5337. tag
  5338. ptr2
  5339. tag
  5340. call GetOperatorRuntimeProc
  5341. call Operator
  5342. *)
  5343. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5344. (* push ID *)
  5345. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5346. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5347. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5348. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5349. formalParameter := procedureType.firstParameter;
  5350. FOR i := 0 TO parameters.Length() - 1 DO
  5351. IF formalParameter.access # SyntaxTree.Hidden THEN
  5352. ASSERT(i < 2);
  5353. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5354. (* push pointer *)
  5355. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5356. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5357. (* add dereference *)
  5358. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5359. (*! better: do refer to stack above than using parameter backups !!*)
  5360. ReleaseIntermediateOperand(parameterBackups[i]);
  5361. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5362. END;
  5363. Emit(Push(position,parameterBackups[i]));
  5364. ReleaseIntermediateOperand(parameterBackups[i]);
  5365. (* push typetag *)
  5366. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5367. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5368. arg := TypeDescriptorAdr(recordType);
  5369. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5370. Emit(Push(position,arg));
  5371. ELSE
  5372. (* push 'NonPointer' *)
  5373. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5374. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5375. (* push fingerprint *)
  5376. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5377. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5378. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5379. END
  5380. END;
  5381. formalParameter := formalParameter.nextParameter
  5382. END;
  5383. (* for unary operators: complete the information for the second parameter *)
  5384. IF procedureType.numberParameters < 2 THEN
  5385. (* push 'NonPointer' *)
  5386. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5387. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5388. (* push 'NoType' *)
  5389. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5390. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5391. END;
  5392. (* call operator selection procedure *)
  5393. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5394. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5395. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5396. ReleaseOperand(operatorSelectionProcedureOperand);
  5397. (* use the address that the operator selection procedure returned as the target address of the call *)
  5398. InitOperand(operand, ModeValue);
  5399. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5400. Emit(Result(position,operand.op))
  5401. END
  5402. END;
  5403. ReleaseParameterRegisters();
  5404. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5405. SaveRegisters();ReleaseUsedRegisters(saved2);
  5406. CallThis(position,"Objects","LeaveA2",0);
  5407. RestoreRegisters(saved2);
  5408. END;
  5409. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5410. Emit(Call(position,operand.op,0));
  5411. ELSE
  5412. Emit(Call(position,operand.op,parametersSize));
  5413. END;
  5414. ReleaseOperand(operand);
  5415. IF procedureType.noReturn THEN
  5416. EmitTrap(position,NoReturnTrap);
  5417. END;
  5418. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5419. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5420. Emit(Result(position,return));
  5421. END;
  5422. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5423. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5424. Emit(Push(position, return));
  5425. CallThis(position,"Objects","ReenterA2",0);
  5426. Emit(Pop(position, return));
  5427. ELSE
  5428. CallThis(position,"Objects","ReenterA2",0);
  5429. END;
  5430. END;
  5431. (* === return parameter space === *)
  5432. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5433. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5434. (* cleanup all space for all parameters *)
  5435. IF parametersSize < 32 THEN
  5436. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5437. parametersSize := 32
  5438. END;
  5439. size := IntermediateCode.Immediate(addressType,parametersSize);
  5440. Emit(Add(position,sp,sp,size))
  5441. END;
  5442. IF SysvABI(procedureType.callingConvention) THEN
  5443. IF passByRegister THEN
  5444. IF parameters.Length() > parameterRegisters THEN
  5445. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5446. ELSE
  5447. parametersSize := 0
  5448. END;
  5449. ELSE
  5450. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5451. INC( parametersSize, (-parametersSize) MOD 16 )
  5452. END;
  5453. IF parametersSize > 0 THEN
  5454. size := IntermediateCode.Immediate(addressType,parametersSize);
  5455. Emit(Add(position,sp,sp,size))
  5456. END;
  5457. END;
  5458. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5459. IF structuredReturnType THEN
  5460. (* stack pointer rewinding done by callee
  5461. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5462. Emit(Add(position,sp,sp,size));
  5463. *)
  5464. RestoreRegisters(saved);
  5465. InitOperand(result,ModeReference);
  5466. Symbol(variable,result);
  5467. ELSE
  5468. RestoreRegisters(saved);
  5469. InitOperand(result,ModeValue);
  5470. result.op := return;
  5471. END;
  5472. END;
  5473. IF alignment > 1 THEN
  5474. Emit(Pop(position,sp));
  5475. END;
  5476. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5477. Emit(Pop(position, ap));
  5478. END;
  5479. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5480. ValueToCondition(result);
  5481. END;
  5482. destination := dest;
  5483. (* perform all write-back calls in the list *)
  5484. BackupGlobalState;
  5485. currentWriteBackCall := firstWriteBackCall;
  5486. WHILE currentWriteBackCall # NIL DO
  5487. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5488. currentWriteBackCall := currentWriteBackCall.next
  5489. END;
  5490. RestoreGlobalState;
  5491. (* TENATIVE *)
  5492. (*
  5493. IF isOperatorCall THEN
  5494. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5495. END;
  5496. *)
  5497. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5498. END VisitProcedureCallDesignator;
  5499. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5500. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5501. td: SyntaxTree.Symbol;
  5502. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5503. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5504. BEGIN
  5505. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5506. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5507. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5508. variable.SetType(system.anyType);
  5509. scope.AddVariable(variable);
  5510. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5511. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5512. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5513. typeDeclaration.SetScope(module.module.moduleScope);
  5514. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5515. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5516. END;
  5517. RETURN hiddenPointerType;
  5518. END GetHiddenPointerType;
  5519. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5520. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5521. BEGIN
  5522. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5523. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5524. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5525. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5526. scope.AddVariable(variable);
  5527. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5528. variable.SetType(system.anyType);
  5529. scope.AddVariable(variable);
  5530. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5531. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5532. typeDeclaration.SetDeclaredType(delegatePointerType);
  5533. typeDeclaration.SetScope(module.module.moduleScope);
  5534. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5535. delegatePointerType.SetState(SyntaxTree.Resolved);
  5536. END;
  5537. RETURN delegatePointerType
  5538. END GetDelegateType;
  5539. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5540. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5541. such as in VAR a: RECORD ... END;
  5542. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5543. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5544. *)
  5545. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5546. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5547. BEGIN (* no code emission *)
  5548. source := NIL;
  5549. x := x.resolved;
  5550. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5551. x := GetHiddenPointerType();
  5552. ELSIF IsDelegate(x) THEN
  5553. x := GetDelegateType();
  5554. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5555. ELSE HALT(200);
  5556. END;
  5557. td := x.typeDeclaration;
  5558. IF td = NIL THEN
  5559. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5560. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5561. ASSERT(td # NIL);
  5562. END;
  5563. IF newObjectFile THEN
  5564. GetCodeSectionNameForSymbol(td,name);
  5565. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5566. meta.CheckTypeDeclaration(x);
  5567. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5568. ELSE
  5569. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5570. END;
  5571. IF backend.cooperative OR meta.simple THEN
  5572. offset := 0;
  5573. ELSE
  5574. IF x IS SyntaxTree.CellType THEN
  5575. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5576. IF baseRecord = NIL THEN
  5577. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5578. ELSE
  5579. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5580. END;
  5581. ELSE
  5582. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5583. END;
  5584. END;
  5585. ELSE
  5586. offset := 0;
  5587. source := module.allSections.FindBySymbol(td); (*TODO*)
  5588. IF source = NIL THEN
  5589. null := 0;
  5590. GetCodeSectionNameForSymbol(td,name);
  5591. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5592. Basic.SuffixSegmentedName (name, module.module.name);
  5593. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5594. IntermediateCode.InitImmediate(op,addressType,0);
  5595. source(IntermediateCode.Section).Emit(Data(position,op));
  5596. source.SetReferenced(FALSE)
  5597. ELSE
  5598. name := source.name;
  5599. END;
  5600. END;
  5601. RETURN td
  5602. END GetBackendType;
  5603. BEGIN
  5604. (*td := t.typeDeclaration;*)
  5605. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5606. (*
  5607. IF t IS SyntaxTree.PointerType THEN
  5608. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5609. ELSE
  5610. source := GetBackendType(t);
  5611. END;
  5612. *)
  5613. IF newObjectFile THEN
  5614. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5615. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5616. IntermediateCode.SetOffset(res,offset);
  5617. ELSE
  5618. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5619. END;
  5620. (*
  5621. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5622. make memory should be used when tag is used, not earlier
  5623. *)
  5624. RETURN res
  5625. END TypeDescriptorAdr;
  5626. (*
  5627. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5628. VAR result: IntermediateCode.Operand;
  5629. BEGIN
  5630. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5631. operand.tag := TypeDescriptorAdr(operand.type);
  5632. IntermediateCode.MakeMemory(operand.tag,addressType);
  5633. UseIntermediateOperand(operand.tag);
  5634. END;
  5635. END MakeTypeTag;
  5636. *)
  5637. PROCEDURE ProfilerInit;
  5638. VAR reg: IntermediateCode.Operand;
  5639. BEGIN
  5640. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5641. Emit(Call(position,reg,0));
  5642. END ProfilerInit;
  5643. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5644. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5645. BEGIN
  5646. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5647. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5648. THEN
  5649. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5650. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5651. Emit(Push(position,reg));
  5652. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5653. Emit(Push(position,reg));
  5654. StaticCallOperand(result,procedure);
  5655. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5656. ReleaseOperand(result);
  5657. END;
  5658. END ProfilerEnterExit;
  5659. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5660. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5661. BEGIN
  5662. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5663. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5664. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5665. profileInit.Emit(Push(position,reg));
  5666. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5667. profileInit.Emit(Push(position,reg));
  5668. NEW(string, LEN(name)); COPY(name, string^);
  5669. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5670. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5671. sv.SetType(type);
  5672. Designate(sv,result);
  5673. profileInit.Emit(Push(position,result.tag));
  5674. profileInit.Emit(Push(position,result.op));
  5675. StaticCallOperand(result,procedure);
  5676. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5677. ReleaseOperand(result);
  5678. END;
  5679. END ProfilerAddProcedure;
  5680. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5681. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5682. BEGIN
  5683. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5684. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5685. profileInit.Emit(Push(position,reg));
  5686. profileInitPatchPosition := profileInit.pc;
  5687. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5688. NEW(string, LEN(name)); COPY(name, string^);
  5689. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5690. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5691. sv.SetType(type);
  5692. Designate(sv,result);
  5693. profileInit.Emit(Push(position,result.tag));
  5694. profileInit.Emit(Push(position,result.op));
  5695. StaticCallOperand(result,procedure);
  5696. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5697. ReleaseOperand(result);
  5698. END;
  5699. END ProfilerAddModule;
  5700. PROCEDURE ProfilerPatchInit;
  5701. VAR reg: IntermediateCode.Operand;
  5702. BEGIN
  5703. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5704. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5705. EmitLeave(profileInit,position,NIL,0);
  5706. profileInit.Emit(Exit(position,0,0,0));
  5707. END ProfilerPatchInit;
  5708. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5709. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5710. VAR
  5711. id: LONGINT;
  5712. leftType, rightType: SyntaxTree.Type;
  5713. procedureType: SyntaxTree.ProcedureType;
  5714. runtimeProcedure: SyntaxTree.Procedure;
  5715. runtimeProcedureOperand, operatorOperand: Operand;
  5716. kind: SET;
  5717. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5718. VAR
  5719. arg: IntermediateCode.Operand;
  5720. recordType: SyntaxTree.RecordType;
  5721. fingerPrint: SyntaxTree.FingerPrint;
  5722. BEGIN
  5723. IF type = NIL THEN
  5724. (* no type: push 'NoType' *)
  5725. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5726. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5727. ELSIF IsStrictlyPointerToRecord(type) THEN
  5728. (* pointer to record type: push typetag *)
  5729. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5730. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5731. arg := TypeDescriptorAdr(recordType);
  5732. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5733. ELSE
  5734. (* non-pointer to record type: push fingerprint *)
  5735. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5736. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5737. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5738. END;
  5739. operatorInitializationCodeSection.Emit(Push(position,arg))
  5740. END PushTypeInfo;
  5741. BEGIN
  5742. ASSERT(operatorInitializationCodeSection # NIL);
  5743. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5744. procedureType := operator.type(SyntaxTree.ProcedureType);
  5745. (* determine types *)
  5746. leftType := procedureType.firstParameter.type;
  5747. IF procedureType.numberParameters = 2 THEN
  5748. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5749. rightType := procedureType.firstParameter.nextParameter.type;
  5750. ELSE
  5751. rightType := NIL
  5752. END;
  5753. (* determine operator kind *)
  5754. IF IsStrictlyPointerToRecord(leftType) THEN
  5755. kind := {LhsIsPointer}
  5756. ELSE
  5757. kind := {}
  5758. END;
  5759. IF IsStrictlyPointerToRecord(rightType) THEN
  5760. kind := kind + {RhsIsPointer}
  5761. END;
  5762. IF kind # {} THEN (* TODO: to be removed later on *)
  5763. (* at least one of the types is a pointer to record *)
  5764. (* emit a code that registers this specific operator in the runtime *)
  5765. dump := operatorInitializationCodeSection.comments;
  5766. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5767. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5768. (* push ID *)
  5769. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5770. id := Global.GetSymbol(module.module.case, operator.name);
  5771. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5772. (* push kind *)
  5773. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5774. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5775. (* push type infos *)
  5776. PushTypeInfo(leftType);
  5777. PushTypeInfo(rightType);
  5778. (* push operator address *)
  5779. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5780. StaticCallOperand(operatorOperand, operator);
  5781. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5782. ReleaseOperand(operatorOperand);
  5783. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5784. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5785. ReleaseOperand(runtimeProcedureOperand)
  5786. END
  5787. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5788. END
  5789. END RegisterDynamicOperator;
  5790. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5791. VAR
  5792. traceModule: SyntaxTree.Module;
  5793. procedure: SyntaxTree.Procedure;
  5794. procedureVariable: SyntaxTree.Variable;
  5795. s,msg: Basic.MessageString;
  5796. res: Operand;
  5797. i: LONGINT;
  5798. sv: SyntaxTree.StringValue;
  5799. type: SyntaxTree.Type;
  5800. recordType: SyntaxTree.RecordType;
  5801. printout: Printout.Printer;
  5802. stringWriter: Streams.StringWriter;
  5803. expression: SyntaxTree.Expression;
  5804. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5805. BEGIN
  5806. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5807. IF procedure = NIL THEN
  5808. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5809. END;
  5810. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5811. s := "procedure ";
  5812. Strings.Append(s,backend.traceModuleName);
  5813. Strings.Append(s,".");
  5814. Strings.Append(s,procedureName);
  5815. Strings.Append(s," not present");
  5816. Error(position,s);
  5817. RETURN FALSE
  5818. ELSE
  5819. RETURN TRUE
  5820. END;
  5821. END GetProcedure;
  5822. PROCEDURE CallProcedure;
  5823. VAR size: LONGINT;
  5824. BEGIN
  5825. IF procedure # NIL THEN
  5826. StaticCallOperand(result,procedure);
  5827. size := ProcedureParametersSize(system,procedure);
  5828. ELSE
  5829. Symbol(procedureVariable, result);
  5830. LoadValue(result, procedureVariable.type.resolved);
  5831. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5832. END;
  5833. Emit(Call(position,result.op,size));
  5834. END CallProcedure;
  5835. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5836. VAR res: Operand; string: SyntaxTree.String;
  5837. BEGIN
  5838. IF GetProcedure("String") THEN
  5839. NEW(string, LEN(s)); COPY(s, string^);
  5840. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5841. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5842. sv.SetType(type);
  5843. Designate(sv,res);
  5844. Emit(Push(position,res.tag));
  5845. Emit(Push(position,res.op));
  5846. ReleaseOperand(res);
  5847. CallProcedure;
  5848. END;
  5849. END String;
  5850. PROCEDURE Integer(op: IntermediateCode.Operand);
  5851. BEGIN
  5852. IF GetProcedure("Int") THEN
  5853. Emit(Push(position,op));
  5854. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5855. CallProcedure;
  5856. END;
  5857. END Integer;
  5858. PROCEDURE Float(op: IntermediateCode.Operand);
  5859. BEGIN
  5860. IF GetProcedure("HIntHex") THEN
  5861. Emit(Push(position,op));
  5862. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5863. CallProcedure;
  5864. END;
  5865. END Float;
  5866. PROCEDURE Set(op: IntermediateCode.Operand);
  5867. BEGIN
  5868. IF GetProcedure("Set") THEN
  5869. Emit(Push(position,op));
  5870. (*
  5871. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5872. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5873. *)
  5874. CallProcedure;
  5875. END;
  5876. END Set;
  5877. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5878. BEGIN
  5879. IF GetProcedure("Boolean") THEN
  5880. Emit(Push(position,op));
  5881. CallProcedure;
  5882. END;
  5883. END Boolean;
  5884. PROCEDURE Char(op: IntermediateCode.Operand);
  5885. BEGIN
  5886. IF GetProcedure("Char") THEN
  5887. Emit(Push(position,op));
  5888. CallProcedure;
  5889. END;
  5890. END Char;
  5891. PROCEDURE Address(op: IntermediateCode.Operand);
  5892. BEGIN
  5893. IF GetProcedure("Address") THEN
  5894. Emit(Push(position,op));
  5895. CallProcedure;
  5896. END;
  5897. END Address;
  5898. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5899. VAR len: IntermediateCode.Operand;
  5900. BEGIN
  5901. IF GetProcedure("String") THEN
  5902. len := GetArrayLength(type, op.tag);
  5903. Emit(Push(position,len));
  5904. ReleaseIntermediateOperand(len);
  5905. Emit(Push(position,op.op));
  5906. CallProcedure;
  5907. END;
  5908. END StringOperand;
  5909. PROCEDURE Ln;
  5910. BEGIN
  5911. IF GetProcedure("Ln") THEN
  5912. CallProcedure;
  5913. END;
  5914. END Ln;
  5915. BEGIN
  5916. IF backend.traceModuleName = "" THEN RETURN END;
  5917. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5918. IF GetProcedure("Enter") THEN
  5919. CallProcedure
  5920. END;
  5921. NEW(stringWriter,LEN(s));
  5922. FOR i := 0 TO x.Length()-1 DO
  5923. msg := "";
  5924. expression := x.GetExpression(i);
  5925. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5926. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5927. ELSE
  5928. Global.GetModuleName(module.module, s);
  5929. END;
  5930. IF i = 0 THEN
  5931. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  5932. stringWriter.String(":");
  5933. END;
  5934. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5935. IF ~(expression IS SyntaxTree.StringValue) THEN
  5936. printout.Expression(expression);
  5937. stringWriter.Get(s);
  5938. Strings.Append(msg,s);
  5939. Strings.Append(msg,"= ");
  5940. ELSE stringWriter.Get(s); (* remove from string writer *)
  5941. Strings.Append(msg, s);
  5942. END;
  5943. String(msg);
  5944. IF SemanticChecker.IsStringType(expression.type) THEN
  5945. Designate(expression,res);
  5946. StringOperand(res, expression.type);
  5947. ELSE
  5948. Evaluate(expression,res);
  5949. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5950. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5951. Convert(res.op,int64);
  5952. END;
  5953. Integer(res.op);
  5954. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5955. Boolean(res.op);
  5956. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5957. Set(res.op);
  5958. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5959. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5960. Convert(res.op,float64);
  5961. END;
  5962. Float(res.op);
  5963. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5964. Char(res.op);
  5965. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5966. Address(res.op);String("H");
  5967. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5968. Address(res.op);String("H");
  5969. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5970. Address(res.op);String("H");
  5971. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5972. Address(res.op);String("H");
  5973. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5974. String("NIL");
  5975. ELSE HALT(200);
  5976. END;
  5977. END;
  5978. ReleaseOperand(res);
  5979. String("; ");
  5980. END;
  5981. IF GetProcedure("Exit") THEN
  5982. CallProcedure
  5983. ELSE
  5984. Ln;
  5985. END;
  5986. END;
  5987. END SystemTrace;
  5988. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5989. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5990. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5991. BEGIN
  5992. type := type.resolved;
  5993. IF type IS SyntaxTree.RecordType THEN
  5994. WITH type: SyntaxTree.RecordType DO
  5995. baseType := type.baseType;
  5996. IF baseType # NIL THEN
  5997. baseType := baseType.resolved;
  5998. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5999. InitFields(baseType,adr,offset);
  6000. END;
  6001. variable := type.recordScope.firstVariable;
  6002. WHILE variable # NIL DO
  6003. IF variable.initializer # NIL THEN
  6004. Evaluate(variable.initializer,initializerOp);
  6005. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6006. Emit(Mov(position,mem,initializerOp.op));
  6007. ReleaseOperand(initializerOp);
  6008. ReleaseIntermediateOperand(mem);
  6009. END;
  6010. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6011. variable := variable.nextVariable
  6012. END;
  6013. END;
  6014. ELSIF type IS SyntaxTree.CellType THEN
  6015. WITH type: SyntaxTree.CellType DO
  6016. baseType := type.baseType;
  6017. IF baseType # NIL THEN
  6018. baseType := baseType.resolved;
  6019. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6020. InitFields(baseType,adr,offset);
  6021. END;
  6022. variable := type.cellScope.firstVariable;
  6023. WHILE variable # NIL DO
  6024. IF variable.initializer # NIL THEN
  6025. Evaluate(variable.initializer,initializerOp);
  6026. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6027. Emit(Mov(position,mem,initializerOp.op));
  6028. ReleaseOperand(initializerOp);
  6029. ReleaseIntermediateOperand(mem);
  6030. END;
  6031. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6032. variable := variable.nextVariable
  6033. END;
  6034. END;
  6035. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6036. WITH type: SyntaxTree.ArrayType DO
  6037. IF type.form = SyntaxTree.Static THEN
  6038. baseType := type.arrayBase;
  6039. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6040. FOR i := 0 TO type.staticLength-1 DO
  6041. InitFields(baseType,adr,offset+i*size);
  6042. END;
  6043. END;
  6044. END;
  6045. ELSIF type IS SyntaxTree.MathArrayType THEN
  6046. WITH type: SyntaxTree.MathArrayType DO
  6047. IF type.form = SyntaxTree.Open THEN
  6048. dim := DynamicDim(type);
  6049. imm := IntermediateCode.Immediate(addressType,dim);
  6050. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6051. baseType := SemanticChecker.ArrayBase(type,dim);
  6052. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6053. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6054. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6055. ReleaseIntermediateOperand(imm);
  6056. (* flags remain empty (=0) for open array *)
  6057. ELSIF type.form = SyntaxTree.Static THEN
  6058. baseType := type.arrayBase;
  6059. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6060. ASSERT(type.staticLength < 1024*1024*1024);
  6061. FOR i := 0 TO type.staticLength-1 DO
  6062. InitFields(baseType,adr,offset+i*size);
  6063. END;
  6064. END;
  6065. END;
  6066. END;
  6067. END InitFields;
  6068. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6069. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6070. BEGIN
  6071. type := variable.type.resolved;
  6072. IF (type IS SyntaxTree.MathArrayType) THEN
  6073. WITH type: SyntaxTree.MathArrayType DO
  6074. IF type.form = SyntaxTree.Open THEN
  6075. Symbol(variable,operand);
  6076. InitFields(type, operand.tag,0);
  6077. IF temporary THEN
  6078. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6079. END;
  6080. ELSIF type.form = SyntaxTree.Tensor THEN
  6081. Symbol(variable, operand);
  6082. MakeMemory(tmp,operand.op,addressType,0);
  6083. ReleaseOperand(operand);
  6084. IF temporary THEN
  6085. (* trick -- temporary object from array base *)
  6086. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6087. Symbol(symbol,operand);
  6088. MakeMemory(mem,operand.op,addressType,0);
  6089. ReleaseOperand(operand);
  6090. Emit(Mov(position,tmp, mem) );
  6091. ReleaseOperand(operand);
  6092. ELSE
  6093. Emit(Mov(position,tmp, nil ) );
  6094. END;
  6095. ReleaseIntermediateOperand(tmp);
  6096. END;
  6097. END;
  6098. ELSE
  6099. Symbol(variable,operand);
  6100. IF variable.initializer # NIL THEN
  6101. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6102. reference.SetType(variable.type.resolved);
  6103. reference.SetAssignable(TRUE);
  6104. Assign(reference,variable.initializer);
  6105. ELSIF temporary THEN
  6106. IF SemanticChecker.IsPointerType(variable.type) THEN
  6107. Symbol(variable, operand);
  6108. MakeMemory(tmp,operand.op,addressType,0);
  6109. ReleaseOperand(operand);
  6110. Emit(Mov(position,tmp, nil ) );
  6111. ReleaseIntermediateOperand(tmp);
  6112. END;
  6113. END;
  6114. InitFields(type, operand.op,0);
  6115. ReleaseOperand(operand);
  6116. END;
  6117. END InitVariable;
  6118. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6119. VAR end: Label;
  6120. BEGIN
  6121. IF type.form = SyntaxTree.Tensor THEN
  6122. InitOperand(result,ModeValue);
  6123. ReuseCopy(result.op,base);
  6124. end := NewLabel();
  6125. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6126. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6127. SetLabel(end);
  6128. Convert(result.op,lenType);
  6129. ELSE
  6130. InitOperand(result,ModeValue);
  6131. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6132. END
  6133. END MathArrayDim;
  6134. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6135. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6136. BEGIN
  6137. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6138. MakeMemory(mem,base,addressType,offset);
  6139. Emit(Mov(position,mem,value));
  6140. ReleaseIntermediateOperand(mem);
  6141. END PutMathArrayField;
  6142. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6143. VAR mem: IntermediateCode.Operand;
  6144. BEGIN
  6145. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6146. MakeMemory(mem,base,addressType,offset);
  6147. Emit(Mov(position,mem,value));
  6148. ReleaseIntermediateOperand(mem);
  6149. END PutMathArrayFieldOffset;
  6150. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6151. BEGIN
  6152. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6153. MakeMemory(value,base,addressType,offset);
  6154. END GetMathArrayField;
  6155. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6156. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6157. BEGIN
  6158. IF incr THEN
  6159. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6160. ELSE
  6161. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6162. END;
  6163. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6164. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6165. ELSE
  6166. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6167. Emit(Mov(position,reg,dim));
  6168. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6169. Emit(Add(position,reg,reg,base));
  6170. MakeMemory(mem, reg, addressType, offset);
  6171. ReleaseIntermediateOperand(reg);
  6172. Emit(Mov(position,mem,value));
  6173. ReleaseIntermediateOperand(mem);
  6174. END;
  6175. END PutMathArrayLenOrIncr;
  6176. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6177. BEGIN
  6178. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6179. END PutMathArrayLength;
  6180. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6181. BEGIN
  6182. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6183. END PutMathArrayIncrement;
  6184. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6185. BEGIN
  6186. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6187. END GetMathArrayIncrement;
  6188. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6189. BEGIN
  6190. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6191. END GetMathArrayLength;
  6192. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6193. VAR dimOp: IntermediateCode.Operand;
  6194. BEGIN
  6195. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6196. GetMathArrayLength(type, operand, dimOp, check, result);
  6197. END GetMathArrayLengthAt;
  6198. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6199. VAR dimOp: IntermediateCode.Operand;
  6200. BEGIN
  6201. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6202. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6203. END GetMathArrayIncrementAt;
  6204. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6205. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6206. offset: LONGINT;
  6207. BEGIN
  6208. IF increment THEN
  6209. offset := MathIncrOffset;
  6210. ELSE
  6211. offset := MathLenOffset;
  6212. END;
  6213. INC(offset,operand.dimOffset*2);
  6214. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6215. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6216. END;
  6217. (* static dimension *)
  6218. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6219. IF check & (type.form = SyntaxTree.Tensor) THEN
  6220. DimensionCheck(operand.tag,dim,BrltL);
  6221. END;
  6222. val := SHORT(dim.intValue);
  6223. IF type.form # SyntaxTree.Tensor THEN
  6224. t := SemanticChecker.ArrayBase(type,val);
  6225. type := t.resolved(SyntaxTree.MathArrayType);
  6226. IF type.form = SyntaxTree.Static THEN
  6227. IF increment THEN
  6228. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6229. ELSE
  6230. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6231. END;
  6232. InitOperand(result,ModeValue);
  6233. result.op := res;
  6234. RETURN;
  6235. END;
  6236. END;
  6237. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6238. MakeMemory(res,operand.tag,addressType,offset);
  6239. (*
  6240. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6241. *)
  6242. InitOperand(result,ModeValue);
  6243. result.op := res;
  6244. ELSE
  6245. Convert(dim,addressType);
  6246. IF check THEN
  6247. IF type.form = SyntaxTree.Tensor THEN
  6248. DimensionCheck(operand.tag,dim,BrltL);
  6249. ELSIF isUnchecked THEN (* do nothing *)
  6250. ELSE
  6251. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6252. END;
  6253. END;
  6254. end := NewLabel(); next := NIL;
  6255. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6256. Emit(Mov(position,res,dim));
  6257. Convert(res,sizeType);
  6258. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6259. WHILE t IS SyntaxTree.MathArrayType DO
  6260. type := t(SyntaxTree.MathArrayType);
  6261. IF type.form = SyntaxTree.Static THEN
  6262. imm := IntermediateCode.Immediate(sizeType,val);
  6263. next := NewLabel();
  6264. BrneL(next,imm,res);
  6265. IF increment THEN
  6266. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6267. ELSE
  6268. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6269. END;
  6270. Emit(MovReplace(position,res,imm));
  6271. BrL(end);
  6272. ELSE hasDynamicPart := TRUE;
  6273. END;
  6274. t := type.arrayBase.resolved;
  6275. val := val + 1;
  6276. IF next # NIL THEN SetLabel(next) END;
  6277. END;
  6278. IF hasDynamicPart THEN
  6279. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6280. Emit(Mov(position,res2,dim));
  6281. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6282. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6283. Emit(Add(position,res2,res2,imm));
  6284. Emit(Add(position,res2,res2,operand.tag));
  6285. IntermediateCode.MakeMemory(res2,sizeType);
  6286. Emit(MovReplace(position,res,res2));
  6287. ReleaseIntermediateOperand(res2);
  6288. END;
  6289. SetLabel(end);
  6290. Convert(res,sizeType);
  6291. InitOperand(result,ModeValue);
  6292. result.op := res;
  6293. END;
  6294. END MathArrayLenOrIncr;
  6295. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6296. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6297. offset: LONGINT;
  6298. BEGIN
  6299. offset := operand.dimOffset+DynamicDim(type)-1;
  6300. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6301. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6302. val := SHORT(dim.intValue);
  6303. t := SemanticChecker.ArrayBase(type,val);
  6304. type := t.resolved(SyntaxTree.ArrayType);
  6305. IF type.form = SyntaxTree.Static THEN
  6306. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6307. ELSE
  6308. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6309. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6310. END;
  6311. UseIntermediateOperand(res);
  6312. InitOperand(result,ModeValue);
  6313. result.op := res;
  6314. ELSE
  6315. Convert(dim,addressType);
  6316. IF ~isUnchecked THEN
  6317. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6318. END;
  6319. end := NewLabel(); next := NIL;
  6320. (* ReuseCopy(dim,res); *)
  6321. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6322. Emit(Mov(position,res,dim));
  6323. Convert(res,sizeType);
  6324. Convert(res,sizeType);
  6325. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6326. WHILE t IS SyntaxTree.ArrayType DO
  6327. type := t(SyntaxTree.ArrayType);
  6328. IF type.form = SyntaxTree.Static THEN
  6329. imm := IntermediateCode.Immediate(sizeType,val);
  6330. next := NewLabel();
  6331. BrneL(next,imm,res);
  6332. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6333. Emit(MovReplace(position,res,imm));
  6334. BrL(end);
  6335. ELSE hasDynamicPart := TRUE;
  6336. END;
  6337. t := type.arrayBase.resolved;
  6338. val := val + 1;
  6339. IF next # NIL THEN SetLabel(next) END;
  6340. END;
  6341. IF hasDynamicPart THEN
  6342. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6343. Convert(res2,addressType);
  6344. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6345. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6346. Emit(Sub(position,res2,imm,res2));
  6347. Emit(Add(position,res2,res2,operand.tag));
  6348. IntermediateCode.MakeMemory(res2,sizeType);
  6349. Emit(MovReplace(position,res,res2));
  6350. ReleaseIntermediateOperand(res2);
  6351. END;
  6352. SetLabel(end);
  6353. Convert(res,sizeType);
  6354. InitOperand(result,ModeValue);
  6355. result.op := res;
  6356. END;
  6357. END ArrayLen;
  6358. (**
  6359. create a temporary variable in current scope
  6360. **)
  6361. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6362. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6363. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6364. BEGIN
  6365. IF ~register THEN
  6366. v := temporaries.GetFreeVariable(type, untraced, index);
  6367. ELSE
  6368. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6369. END;
  6370. scope := currentScope;
  6371. (*
  6372. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6373. *)
  6374. name := temporaries.GetUID();
  6375. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6376. variable.SetType(type);
  6377. variable.SetAccess(SyntaxTree.Hidden);
  6378. variable.SetUntraced(untraced);
  6379. IF v = NIL THEN
  6380. temporaries.AddVariable(variable);
  6381. IF ~register THEN
  6382. IF scope.lastVariable # NIL THEN
  6383. offset := scope.lastVariable.offsetInBits;
  6384. ELSE
  6385. offset := 0;
  6386. END;
  6387. DEC(offset,system.SizeOf(variable.type));
  6388. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6389. variable(SyntaxTree.Variable).SetOffset(offset);
  6390. scope.AddVariable(variable(SyntaxTree.Variable));
  6391. scope.EnterSymbol(variable, duplicate);
  6392. ASSERT(~duplicate);
  6393. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6394. ELSE
  6395. variable.SetUseRegister(TRUE);
  6396. variable(SyntaxTree.Variable).SetOffset(0);
  6397. END;
  6398. ELSE (* v # NIL *)
  6399. (* reuse slot for new variable, do not create new slot ! *)
  6400. temporaries.SetVariable(index, variable);
  6401. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6402. ASSERT(~register);
  6403. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6404. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6405. scope.EnterSymbol(variable, duplicate);
  6406. ASSERT(~duplicate);
  6407. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6408. END;
  6409. RETURN variable(SyntaxTree.Variable)
  6410. END GetTemporaryVariable;
  6411. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6412. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6413. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6414. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6415. i: LONGINT; duplicate: BOOLEAN;
  6416. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6417. VAR variable: SyntaxTree.Variable;
  6418. BEGIN
  6419. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6420. variable.SetType(type);
  6421. recordScope.AddVariable(variable);
  6422. END AddVariable;
  6423. BEGIN
  6424. name := "@ArrayDescriptor";
  6425. Basic.AppendNumber(name,dimensions);
  6426. identifier := SyntaxTree.NewIdentifier(name);
  6427. parentScope := module.module.moduleScope;
  6428. symbol := parentScope.FindSymbol(identifier);
  6429. IF symbol # NIL THEN
  6430. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6431. type := typeDeclaration.declaredType;
  6432. ELSE
  6433. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6434. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6435. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6436. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6437. recordType.SetTypeDeclaration(typeDeclaration);
  6438. recordType.SetState(SyntaxTree.Resolved);
  6439. typeDeclaration.SetDeclaredType(recordType);
  6440. AddVariable("@ptr",system.anyType);
  6441. AddVariable("@adr",system.addressType);
  6442. AddVariable("@flags",system.addressType);
  6443. AddVariable("@dim",system.addressType);
  6444. AddVariable("@elementSize",system.addressType);
  6445. FOR i := 0 TO dimensions-1 DO
  6446. name := "@len";
  6447. Basic.AppendNumber(name,i);
  6448. AddVariable(name,system.addressType);
  6449. name := "@incr";
  6450. Basic.AppendNumber(name,i);
  6451. AddVariable(name,system.addressType);
  6452. END;
  6453. parentScope.AddTypeDeclaration(typeDeclaration);
  6454. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6455. ASSERT(~duplicate);
  6456. type := recordType;
  6457. END;
  6458. RETURN type
  6459. END GetMathArrayDescriptorType;
  6460. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6461. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6462. BEGIN
  6463. type := GetMathArrayDescriptorType(dimensions);
  6464. Emit(Push(position,op.op));
  6465. (* push type descriptor *)
  6466. reg := TypeDescriptorAdr(type);
  6467. IF ~newObjectFile THEN
  6468. IntermediateCode.MakeMemory(reg,addressType);
  6469. END;
  6470. Emit(Push(position,reg));
  6471. ReleaseIntermediateOperand(reg);
  6472. (* push realtime flag: false by default *)
  6473. Emit(Push(position,false));
  6474. CallThis(position,"Heaps","NewRec",3);
  6475. END NewMathArrayDescriptor;
  6476. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6477. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6478. BEGIN
  6479. NEW(string, LEN(s)); COPY(s, string^);
  6480. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6481. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6482. sv.SetType(type);
  6483. Designate(sv,res);
  6484. Emit(Push(position,res.tag));
  6485. Emit(Push(position,res.op));
  6486. ReleaseOperand(res);
  6487. END PushConstString;
  6488. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6489. BEGIN
  6490. IF b THEN
  6491. Emit(Push(Basic.invalidPosition, true));
  6492. ELSE
  6493. Emit(Push(Basic.invalidPosition, false));
  6494. END;
  6495. END PushConstBoolean;
  6496. PROCEDURE PushConstSet(v: SET);
  6497. VAR value: SyntaxTree.Value; op: Operand;
  6498. BEGIN
  6499. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6500. value.SetType(system.setType);
  6501. Evaluate(value, op);
  6502. Emit(Push(Basic.invalidPosition, op.op));
  6503. ReleaseOperand(op);
  6504. END PushConstSet;
  6505. PROCEDURE PushConstInteger(v: LONGINT);
  6506. VAR value: SyntaxTree.Value; op: Operand;
  6507. BEGIN
  6508. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6509. value.SetType(system.longintType);
  6510. Evaluate(value, op);
  6511. Emit(Push(Basic.invalidPosition, op.op));
  6512. ReleaseOperand(op);
  6513. END PushConstInteger;
  6514. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6515. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6516. section: IntermediateCode.Section;
  6517. BEGIN
  6518. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6519. Global.GetSymbolSegmentedName(symbol, name);
  6520. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6521. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6522. procedure.SetScope(moduleScope);
  6523. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6524. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6525. procedure.SetAccess(SyntaxTree.Hidden);
  6526. currentScope := procedureScope;
  6527. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6528. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6529. RETURN section;
  6530. END OpenInitializer;
  6531. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6532. BEGIN
  6533. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6534. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6535. section := prev;
  6536. END CloseInitializer;
  6537. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6538. VAR name: SyntaxTree.IdentifierString;
  6539. variable: SyntaxTree.Variable;
  6540. parameter: SyntaxTree.Parameter;
  6541. type: SyntaxTree.Type;
  6542. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6543. BEGIN
  6544. InitOperand(op,ModeReference);
  6545. op.op := fp;
  6546. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6547. Dereference(op, x, FALSE);
  6548. result := op;
  6549. Symbol(symbol, op);
  6550. END Field;
  6551. PROCEDURE Direction(direction: LONGINT): SET;
  6552. BEGIN
  6553. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6554. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6555. ELSE HALT(100);
  6556. END;
  6557. END Direction;
  6558. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6559. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6560. BEGIN
  6561. Field(port, op);
  6562. ToMemory(op.op,addressType,0);
  6563. Emit(Push(Basic.invalidPosition, op.op));
  6564. ReleaseOperand(op);
  6565. Basic.GetString(modifier.identifier, name);
  6566. PushConstString(name);
  6567. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6568. ASSERT(SemanticChecker.IsStringType(value.type));
  6569. Designate(value, op);
  6570. Emit(Push(modifier.position, op.tag));
  6571. Emit(Push(modifier.position, op.op));
  6572. ReleaseOperand(op);
  6573. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6574. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6575. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6576. Evaluate(value, op);
  6577. Emit(Push(modifier.position, op.op));
  6578. ReleaseOperand(op);
  6579. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6580. ELSE
  6581. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6582. END;
  6583. END AddPortProperty;
  6584. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6585. VAR modifier: SyntaxTree.Modifier;
  6586. BEGIN
  6587. modifier := parameter.modifiers;
  6588. WHILE modifier # NIL DO
  6589. AddPortProperty(parameter,modifier, modifier.expression);
  6590. modifier := modifier.nextModifier;
  6591. END;
  6592. END AddPortProperties;
  6593. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6594. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6595. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6596. PROCEDURE PushLens(type: SyntaxTree.Type);
  6597. BEGIN
  6598. IF IsSemiDynamicArray(type) THEN
  6599. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6600. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6601. Emit(Push(Basic.invalidPosition, op.op));
  6602. ReleaseOperand(op);
  6603. INC(dim);
  6604. ELSIF IsStaticArray(type) THEN
  6605. len := len * type(SyntaxTree.ArrayType).staticLength;
  6606. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6607. INC(dim);
  6608. ELSE
  6609. baseType := type;
  6610. END;
  6611. END PushLens;
  6612. BEGIN
  6613. (* cell *)
  6614. IF parameter.type IS SyntaxTree.ArrayType THEN
  6615. type := parameter.type;
  6616. dim := 0;
  6617. len := 1;
  6618. PushLens(type);
  6619. portType := baseType.resolved(SyntaxTree.PortType);
  6620. ELSE
  6621. portType := parameter.type(SyntaxTree.PortType);
  6622. END;
  6623. PushSelfPointer();
  6624. (* port / array of ports *)
  6625. IF IsStaticArray(type) THEN
  6626. PushConstInteger(len);
  6627. END;
  6628. Field(parameter, op);
  6629. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6630. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6631. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6632. Designate(d, op);*)
  6633. Emit(Push(Basic.invalidPosition, op.op));
  6634. ReleaseOperand(op);
  6635. (* name *)
  6636. PushConstString(name);
  6637. (* inout *)
  6638. PushConstSet(Direction(portType.direction));
  6639. (* width *)
  6640. PushConstInteger(portType.sizeInBits);
  6641. IF parameter.type IS SyntaxTree.PortType THEN
  6642. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6643. AddPortProperties(parameter);
  6644. ELSIF IsStaticArray(type)THEN
  6645. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6646. ELSIF IsSemiDynamicArray(type) THEN
  6647. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6648. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6649. Emit(Add(position,reg, sp, size));
  6650. (* dim *)
  6651. PushConstInteger(dim);
  6652. (* len array *)
  6653. Emit(Push(position, reg));
  6654. ReleaseIntermediateOperand(reg);
  6655. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6656. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6657. Emit(Add(position, sp,sp, size));
  6658. ELSE
  6659. HALT(100);
  6660. END;
  6661. END Parameter;
  6662. BEGIN
  6663. IF backend.cellsAreObjects THEN
  6664. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6665. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6666. END;
  6667. parameter := x.firstParameter;
  6668. WHILE (parameter # NIL) DO
  6669. type := parameter.type.resolved;
  6670. WHILE (type IS SyntaxTree.ArrayType) DO
  6671. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6672. END;
  6673. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6674. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6675. Parameter(name,parameter);
  6676. END;
  6677. parameter := parameter.nextParameter;
  6678. END;
  6679. ELSE HALT(200)
  6680. END;
  6681. END AddPorts;
  6682. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6683. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6684. BEGIN
  6685. Symbol(cell,op);
  6686. ToMemory(op.op,addressType,0);
  6687. Emit(Push(position,op.op));
  6688. ReleaseOperand(op);
  6689. property.GetName(name);
  6690. (* does not work when inheritance is used:
  6691. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6692. *)
  6693. PushConstString(name);
  6694. IF (value # NIL) THEN
  6695. ASSERT(
  6696. SemanticChecker.IsStringType(property.type)
  6697. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6698. OR (property.type.resolved IS SyntaxTree.FloatType)
  6699. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6700. OR (property.type.resolved IS SyntaxTree.SetType)
  6701. );
  6702. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6703. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6704. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6705. Designate(d, op);
  6706. IF SemanticChecker.IsStringType(property.type) THEN
  6707. Emit(Push(Basic.invalidPosition, op.tag))
  6708. END;
  6709. Emit(Push(Basic.invalidPosition, op.op));
  6710. ReleaseOperand(op);
  6711. END;
  6712. IF value = NIL THEN
  6713. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6714. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6715. ASSERT(SemanticChecker.IsStringType(value.type));
  6716. Designate(value, op);
  6717. PushString(op, value.type);
  6718. ReleaseOperand(op);
  6719. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6720. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6721. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6722. Evaluate(value, op);
  6723. Emit(Push(property.position, op.op));
  6724. ReleaseOperand(op);
  6725. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6726. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6727. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6728. Evaluate(value, op);
  6729. Emit(Push(property.position, op.op));
  6730. ReleaseOperand(op);
  6731. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6732. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6733. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6734. Evaluate(value, op);
  6735. Emit(Push(property.position, op.op));
  6736. ReleaseOperand(op);
  6737. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6738. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6739. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6740. Evaluate(value, op);
  6741. Emit(Push(property.position, op.op));
  6742. ReleaseOperand(op);
  6743. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6744. ELSE
  6745. HALT(200);
  6746. END;
  6747. END AddProperty;
  6748. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6749. VAR symbol: SyntaxTree.Symbol;
  6750. BEGIN
  6751. WHILE modifier # NIL DO
  6752. symbol := cellType.FindProperty(modifier.identifier);
  6753. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6754. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6755. modifier := modifier.nextModifier;
  6756. END;
  6757. END AddModifiers;
  6758. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6759. VAR last: SyntaxTree.Modifier;
  6760. BEGIN
  6761. IF to = NIL THEN
  6762. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6763. ELSE
  6764. last := to;
  6765. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6766. last := last.nextModifier;
  6767. END;
  6768. IF last.identifier # this.identifier THEN
  6769. ASSERT(last.nextModifier = NIL);
  6770. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6771. END;
  6772. END;
  6773. END AppendModifier;
  6774. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6775. BEGIN
  6776. WHILE this # NIL DO
  6777. AppendModifier(to, this);
  6778. this := this.nextModifier;
  6779. END;
  6780. END AppendModifiers;
  6781. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6782. VAR base: SyntaxTree.Type;
  6783. BEGIN
  6784. AppendModifiers(to, c.modifiers);
  6785. base := c.GetBaseValueType();
  6786. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6787. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6788. END;
  6789. END AppendCellTypeModifiers;
  6790. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6791. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6792. BEGIN
  6793. Basic.GetString(modifier.identifier, name);
  6794. PushConstString(name);
  6795. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6796. ASSERT(SemanticChecker.IsStringType(value.type));
  6797. Designate(value, op);
  6798. PushString(op, value.type);
  6799. ReleaseOperand(op);
  6800. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6801. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6802. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6803. Evaluate(value, op);
  6804. Emit(Push(modifier.position, op.op));
  6805. ReleaseOperand(op);
  6806. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6807. ELSE
  6808. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6809. END;
  6810. END AddPortProperty;
  6811. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6812. BEGIN
  6813. WHILE modifier # NIL DO
  6814. AddPortProperty(modifier, modifier.expression);
  6815. modifier := modifier.nextModifier;
  6816. END;
  6817. END AddPortProperties;
  6818. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6819. VAR op: Operand;
  6820. BEGIN
  6821. Evaluate(p, op);
  6822. Emit(Push(p.position, op.op));
  6823. ReleaseOperand(op);
  6824. IF p IS SyntaxTree.Designator THEN
  6825. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6826. END;
  6827. END PushPort;
  6828. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6829. VAR tmp: IntermediateCode.Operand;
  6830. BEGIN
  6831. actualType := actualType.resolved;
  6832. IF actualType IS SyntaxTree.StringType THEN
  6833. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6834. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6835. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6836. ELSE
  6837. tmp := op.tag;
  6838. IntermediateCode.MakeMemory(tmp,addressType);
  6839. Emit(Push(position,tmp));
  6840. END;
  6841. Emit(Push(position,op.op))
  6842. END PushString;
  6843. (* conservative check if x is potentially on the heap, excluding the module heap
  6844. required for generational garbage collector
  6845. *)
  6846. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6847. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6848. BEGIN
  6849. RETURN TRUE;
  6850. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6851. passed by reference.
  6852. pos := x.position.start;
  6853. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6854. x := x(SyntaxTree.Designator).left;
  6855. END;
  6856. RETURN x # NIL;
  6857. *)
  6858. END OnHeap;
  6859. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  6860. VAR
  6861. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6862. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6863. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6864. tmp:IntermediateCode.Operand;
  6865. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6866. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6867. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6868. dest: IntermediateCode.Operand;
  6869. staticLength: LONGINT; itype: IntermediateCode.Type;
  6870. convert,isTensor: BOOLEAN;
  6871. recordType: SyntaxTree.RecordType;
  6872. baseType: SyntaxTree.Type;
  6873. flags: SET;
  6874. left: SyntaxTree.Expression;
  6875. call: SyntaxTree.Designator;
  6876. procedure: SyntaxTree.Procedure;
  6877. temporaryVariable: SyntaxTree.Variable;
  6878. dummy: IntermediateCode.Operand;
  6879. customBuiltin: SyntaxTree.CustomBuiltin;
  6880. isVarPar: ARRAY 3 OF BOOLEAN;
  6881. callsection: Sections.Section;
  6882. segmentedName: Basic.SegmentedName;
  6883. needsTrace: BOOLEAN;
  6884. n: ARRAY 256 OF CHAR;
  6885. modifier: SyntaxTree.Modifier;
  6886. previous, init: IntermediateCode.Section;
  6887. prevScope: SyntaxTree.Scope;
  6888. firstPar: LONGINT;
  6889. saved: RegisterEntry;
  6890. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6891. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6892. priority: IntermediateCode.Operand;
  6893. op,callop: Operand;
  6894. BEGIN
  6895. IF type = NIL THEN RETURN END;
  6896. type := type.resolved;
  6897. IF type IS SyntaxTree.PointerType THEN
  6898. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6899. END;
  6900. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6901. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6902. recordScope := type(SyntaxTree.RecordType).recordScope;
  6903. IF recordScope.bodyProcedure # NIL THEN
  6904. procedure := recordScope.bodyProcedure;
  6905. body := procedure.procedureScope.body;
  6906. Emit(Push(position,self));
  6907. IF body.isActive THEN
  6908. StaticCallOperand(callop,procedure);
  6909. Emit(Push(position,callop.op));
  6910. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6911. Convert(priority,sizeType);
  6912. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6913. END;
  6914. Emit(Push(position,priority));
  6915. ReleaseIntermediateOperand(priority);
  6916. IF backend.cooperative THEN
  6917. Emit(Push(position,self));
  6918. CallThis(position,"Activities","Create",3)
  6919. ELSE
  6920. flags := 0;
  6921. IF body.isSafe THEN
  6922. flags := 1;
  6923. END;
  6924. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6925. Emit(Push(position,self));
  6926. CallThis(position,"Objects","CreateProcess",4)
  6927. END;
  6928. ELSE
  6929. Emit(Push(position,self));
  6930. StaticCallOperand(callop,procedure);
  6931. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6932. END;
  6933. Emit(Pop(position,self));
  6934. END;
  6935. END CallBodies;
  6936. PROCEDURE PushTD(type: SyntaxTree.Type);
  6937. VAR op: IntermediateCode.Operand;
  6938. BEGIN
  6939. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6940. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6941. ELSE
  6942. IF type.resolved IS SyntaxTree.PointerType THEN
  6943. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6944. END;
  6945. op := TypeDescriptorAdr(type.resolved);
  6946. IF ~newObjectFile THEN
  6947. IntermediateCode.MakeMemory(op,addressType);
  6948. END;
  6949. Emit(Push(position,op));
  6950. END
  6951. END PushTD;
  6952. BEGIN
  6953. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6954. dest := destination; destination := emptyOperand;
  6955. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6956. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6957. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6958. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6959. CASE x.id OF
  6960. (* ---- COPY ----- *)
  6961. |Global.Copy:
  6962. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6963. (* ---- EXCL, INCL----- *)
  6964. |Global.Excl,Global.Incl:
  6965. Evaluate(p0,s0);
  6966. Evaluate(p1,s1);
  6967. Convert(s1.op,IntermediateCode.GetType(system,t0));
  6968. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6969. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  6970. END;
  6971. ReuseCopy(res,s0.op);
  6972. ReleaseOperand(s0);
  6973. Reuse1(tmp,s1.op);
  6974. ReleaseOperand(s1);
  6975. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  6976. IF x.id = Global.Excl THEN
  6977. Emit(Not(position,tmp,tmp));
  6978. Emit(And(position,res,res,tmp));
  6979. ELSE
  6980. Emit(Or(position,res,res,tmp));
  6981. END;
  6982. ReleaseIntermediateOperand(tmp);
  6983. Designate(p0,s0);
  6984. ToMemory(s0.op,s1.op.type,0);
  6985. Emit(Mov(position,s0.op,res));
  6986. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6987. (* ---- DISPOSE ----- *)
  6988. |Global.Dispose:
  6989. Designate(p0,s0);
  6990. Emit(Push(position,s0.op));
  6991. ReleaseOperand(s0);
  6992. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6993. (* ---- GETPROCEDURE ----- *)
  6994. |Global.GetProcedure:
  6995. Designate(p0,s0);
  6996. PushString(s0,p0.type);
  6997. Designate(p1,s1);
  6998. PushString(s1,p1.type);
  6999. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7000. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7001. ELSE PushTD(procedureType.firstParameter.type)
  7002. END;
  7003. PushTD(procedureType.returnType);
  7004. Designate(p2,s2);
  7005. Emit(Push(position,s2.op));
  7006. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7007. CallThis(position,"Modules","GetProcedure", 7);
  7008. (* ---- ASH, LSH, ROT ----- *)
  7009. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7010. Evaluate(p0,s0);
  7011. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7012. (* make unsigned arguments in order to produced a logical shift *)
  7013. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7014. convert:= TRUE;
  7015. itype := s0.op.type;
  7016. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7017. Convert(s0.op,itype);
  7018. ELSE
  7019. convert := FALSE;
  7020. END;
  7021. END;
  7022. Evaluate(p1,s1);
  7023. IF IsIntegerConstant(p1,hint) THEN
  7024. ReuseCopy(reg,s0.op);
  7025. IF hint > 0 THEN
  7026. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7027. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7028. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7029. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7030. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7031. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7032. END;
  7033. ELSIF hint < 0 THEN
  7034. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7035. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7036. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7037. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7038. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7039. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7040. END;
  7041. END;
  7042. ReleaseOperand(s0); ReleaseOperand(s1);
  7043. ELSE
  7044. exit := NewLabel();
  7045. end := NewLabel();
  7046. ReuseCopy(reg,s0.op);
  7047. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7048. Reuse1(tmp,s1.op);
  7049. Emit(Neg(position,tmp,s1.op));
  7050. Convert(tmp,s1.op.type);
  7051. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7052. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7053. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7054. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7055. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7056. END;
  7057. ReleaseIntermediateOperand(tmp);
  7058. BrL(end);
  7059. SetLabel(exit);
  7060. ReuseCopy(tmp,s1.op);
  7061. Convert(tmp,s1.op.type);
  7062. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7063. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7064. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7065. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7066. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7067. END;
  7068. ReleaseIntermediateOperand(tmp);
  7069. SetLabel(end);
  7070. ReleaseOperand(s0); ReleaseOperand(s1);
  7071. END;
  7072. InitOperand(result,ModeValue);
  7073. IF convert THEN
  7074. itype := reg.type;
  7075. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7076. Convert(reg,itype);
  7077. END;
  7078. result.op := reg;
  7079. (* ---- CAP ----- *)
  7080. |Global.Cap:
  7081. Evaluate(p0,result);
  7082. ReuseCopy(reg,result.op);
  7083. ReleaseIntermediateOperand(result.op);
  7084. ignore := NewLabel();
  7085. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7086. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7087. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7088. SetLabel(ignore);
  7089. result.op := reg;
  7090. (* ---- CHR ----- *)
  7091. |Global.Chr, Global.Chr32:
  7092. Evaluate(p0,result);
  7093. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7094. |Global.Entier, Global.EntierH:
  7095. Evaluate(p0,result);
  7096. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7097. (* ---- MIN and MAX ----- *)
  7098. |Global.Max,Global.Min:
  7099. Evaluate(p0,s0);
  7100. Evaluate(p1,s1);
  7101. Reuse2(res,s0.op,s1.op);
  7102. else := NewLabel();
  7103. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7104. ELSE BrltL(else,s1.op,s0.op) END;
  7105. Emit(Mov(position,res,s0.op));
  7106. ReleaseOperand(s0);
  7107. end := NewLabel();
  7108. BrL(end);
  7109. SetLabel(else);
  7110. Emit(MovReplace(position,res,s1.op));
  7111. SetLabel(end);
  7112. ReleaseOperand(s1);
  7113. InitOperand(result,ModeValue);
  7114. result.op := res;
  7115. (* ---- ODD ----- *)
  7116. |Global.Odd:
  7117. IF ~conditional THEN
  7118. ConditionToValue(x)
  7119. ELSE
  7120. Evaluate(p0,result);
  7121. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7122. Reuse1(res,result.op);
  7123. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7124. ReleaseIntermediateOperand(result.op);
  7125. result.op := res;
  7126. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7127. ReleaseOperand(result);
  7128. BrL(falseLabel);
  7129. END;
  7130. (* ---- ORD ----- *)
  7131. |Global.Ord, Global.Ord32:
  7132. Evaluate(p0,result);
  7133. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7134. (* ---- SHORT, LONG ----- *)
  7135. |Global.Short, Global.Long:
  7136. Evaluate(p0,result);
  7137. IF x.type IS SyntaxTree.ComplexType THEN
  7138. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7139. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7140. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7141. ELSE
  7142. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7143. END
  7144. (* ---- HALT, SYSTEM.HALT----- *)
  7145. |Global.Halt, Global.systemHalt:
  7146. val := p0.resolved(SyntaxTree.IntegerValue).value;
  7147. EmitTrap (position, val);
  7148. (* ---- ASSERT ----- *)
  7149. |Global.Assert:
  7150. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7151. trueL := NewLabel();
  7152. falseL := NewLabel();
  7153. Condition(p0,trueL,falseL);
  7154. IF p1 = NIL THEN val := AssertTrap
  7155. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  7156. END;
  7157. SetLabel(falseL);
  7158. EmitTrap(position,val);
  7159. SetLabel(trueL);
  7160. END;
  7161. (*
  7162. Emit(TrapC(result.op,val);
  7163. *)
  7164. (* ---- INC, DEC----- *)
  7165. |Global.Inc,Global.Dec:
  7166. Expression(p0); adr := result.op;
  7167. LoadValue(result,p0.type); l := result;
  7168. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7169. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7170. END;
  7171. IF x.id = Global.Inc THEN
  7172. Emit(Add(position,l.op,l.op,r.op));
  7173. ELSE
  7174. Emit(Sub(position,l.op,l.op,r.op));
  7175. END;
  7176. ReleaseOperand(l); ReleaseOperand(r);
  7177. (* ---- LEN ----- *)
  7178. |Global.Len: (* dynamic length, static length done by checker *)
  7179. Designate(p0,operand);
  7180. IF p1 = NIL THEN
  7181. InitOperand(l,ModeValue);
  7182. l.op := IntermediateCode.Immediate(sizeType,0);
  7183. ELSE
  7184. Evaluate(p1,l);
  7185. END;
  7186. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7187. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7188. Dereference(operand, p0.type.resolved, FALSE);
  7189. END;
  7190. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7191. ReleaseOperand(operand); ReleaseOperand(l);
  7192. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7193. ASSERT(p1 # NIL);
  7194. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7195. Dereference(operand,p0.type.resolved,FALSE);
  7196. END;
  7197. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7198. ReleaseOperand(operand); ReleaseOperand(l);
  7199. ELSE HALT(100);
  7200. END;
  7201. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7202. (* ---- FIRST ---- *)
  7203. |Global.First:
  7204. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7205. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7206. ELSE
  7207. Designate(p0, result)
  7208. END
  7209. (* ---- LAST ---- *)
  7210. |Global.Last:
  7211. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7212. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7213. ELSE
  7214. Designate(p0, result);
  7215. (* make sure result.op is a register *)
  7216. tmp := result.op;
  7217. ReuseCopy(result.op, result.op);
  7218. ReleaseIntermediateOperand(tmp);
  7219. (* add offset to result.op *)
  7220. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7221. END
  7222. (* ---- STEP ---- *)
  7223. |Global.Step:
  7224. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7225. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7226. ELSE
  7227. Designate(p0, result);
  7228. (* make sure result.op is a register *)
  7229. tmp := result.op;
  7230. ReuseCopy(result.op, result.op);
  7231. ReleaseIntermediateOperand(tmp);
  7232. (* add offset to result.op *)
  7233. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7234. END
  7235. (* ---- RE ---- *)
  7236. |Global.Re:
  7237. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7238. Designate(p0, result)
  7239. ELSE
  7240. Evaluate(p0, result)
  7241. END
  7242. (* ---- IM ---- *)
  7243. |Global.Im:
  7244. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7245. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7246. Designate(p0, result);
  7247. (* make sure result.op is a register *)
  7248. tmp := result.op;
  7249. ReuseCopy(result.op, result.op);
  7250. ReleaseIntermediateOperand(tmp);
  7251. (* add offset to result.op *)
  7252. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7253. (* ---- ABS ----- *)
  7254. |Global.Abs:
  7255. Evaluate(p0,operand);
  7256. type := p0.type.resolved;
  7257. InitOperand(result,ModeValue);
  7258. Reuse1a(result.op,operand.op,dest);
  7259. Emit(Abs(position,result.op,operand.op));
  7260. ReleaseOperand(operand);
  7261. (* ---- WAIT ----- *)
  7262. |Global.Wait:
  7263. Evaluate(p0,operand);
  7264. Emit(Push(position,operand.op));
  7265. ReleaseOperand(operand);
  7266. CallThis(position,"Activities","Wait", 1);
  7267. (* ---- NEW ----- *)
  7268. |Global.New:
  7269. (*! the following code is only correct for "standard" Oberon calling convention *)
  7270. IF x.type # NIL THEN
  7271. type := x.type.resolved;
  7272. firstPar := 0;
  7273. ELSE
  7274. type := p0.type.resolved;
  7275. firstPar := 1;
  7276. END;
  7277. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7278. THEN
  7279. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7280. IF backend.cooperative THEN
  7281. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7282. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7283. IF recordType.isObject THEN
  7284. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7285. IF recordType.IsActive() THEN
  7286. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7287. END;
  7288. IF recordType.IsProtected() THEN
  7289. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7290. END;
  7291. ELSE
  7292. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7293. END;
  7294. END;
  7295. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7296. CallThis(position,"Runtime","New", 1);
  7297. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7298. Emit(Result(position, pointer));
  7299. exit := NewLabel();
  7300. BreqL(exit,pointer,nil);
  7301. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7302. GetRecordTypeName (recordType,name);
  7303. IF ~recordType.isObject THEN
  7304. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7305. END;
  7306. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7307. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7308. IF recordType.isObject THEN
  7309. IF recordType.IsProtected() THEN
  7310. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7311. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7312. END;
  7313. IF recordType.IsActive() THEN
  7314. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7315. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7316. END;
  7317. END;
  7318. END;
  7319. (* initialize fields *)
  7320. IF type(SyntaxTree.PointerType).isPlain THEN
  7321. size := 0;
  7322. ELSIF recordType.isObject THEN
  7323. size := BaseObjectTypeSize;
  7324. ELSE
  7325. size := BaseRecordTypeSize;
  7326. END;
  7327. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7328. (* call initializer *)
  7329. constructor := GetConstructor(recordType);
  7330. IF constructor # NIL THEN
  7331. (*! should be unified with ProcedureCallDesignator *)
  7332. Emit(Push(position,pointer));
  7333. ReleaseIntermediateOperand(pointer);
  7334. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7335. FOR i := firstPar TO x.parameters.Length()-1 DO
  7336. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7337. formalParameter := formalParameter.nextParameter;
  7338. END;
  7339. (* static call of the constructor *)
  7340. GetCodeSectionNameForSymbol(constructor,name);
  7341. ASSERT(~constructor.isInline);
  7342. IF constructor.scope.ownerModule # module.module THEN
  7343. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7344. ELSE
  7345. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7346. END;
  7347. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7348. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7349. Emit(Pop(position,pointer));
  7350. END;
  7351. (* call bodies *)
  7352. CallBodies(pointer,type);
  7353. SetLabel(exit);
  7354. needsTrace := p0.NeedsTrace();
  7355. IF needsTrace THEN ModifyAssignments(true) END;
  7356. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7357. Emit(Push(position, pointer));
  7358. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7359. Emit(Pop(position, pointer));
  7360. END;
  7361. Designate(p0,l);
  7362. IF needsTrace THEN
  7363. CallAssignPointer(l.op, pointer);
  7364. ELSE
  7365. ToMemory(l.op,addressType,0);
  7366. Emit(Mov(position,l.op,pointer));
  7367. END;
  7368. ReleaseIntermediateOperand(pointer);
  7369. ReleaseOperand(l);
  7370. IF needsTrace THEN ModifyAssignments(false) END;
  7371. ELSE (* not cooperative backend *)
  7372. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7373. IF temporaryVariable # NIL THEN
  7374. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7375. ELSE
  7376. Designate(p0,l);
  7377. END;
  7378. (* l.op contains address of pointer to record *)
  7379. Emit(Push(position,l.op)); (* address for use after syscall *)
  7380. Emit(Push(position,l.op));
  7381. ReleaseOperand(l);
  7382. (* push type descriptor *)
  7383. reg := TypeDescriptorAdr(recordType);
  7384. IF ~newObjectFile THEN
  7385. IntermediateCode.MakeMemory(reg,addressType);
  7386. END;
  7387. Emit(Push(position,reg));
  7388. ReleaseIntermediateOperand(reg);
  7389. (* push realtime flag *)
  7390. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7391. ELSE Emit(Push(position,false));
  7392. END;
  7393. CallThis(position,"Heaps","NewRec", 3);
  7394. (* check allocation success, if not successful then do not call initializers and bodies *)
  7395. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7396. Emit(Pop(position,pointer));
  7397. MakeMemory(reg,pointer,addressType,0);
  7398. ReleaseIntermediateOperand(pointer);
  7399. pointer := reg;
  7400. exit := NewLabel();
  7401. BreqL(exit,pointer,nil);
  7402. Emit(Push(position,pointer));
  7403. (* initialize fields *)
  7404. InitFields(recordType, pointer,0);
  7405. (* call initializer *)
  7406. constructor := GetConstructor(recordType);
  7407. IF constructor # NIL THEN
  7408. (*! should be unified with ProcedureCallDesignator *)
  7409. Emit(Push(position,pointer));
  7410. ReleaseIntermediateOperand(pointer);
  7411. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7412. FOR i := firstPar TO x.parameters.Length()-1 DO
  7413. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7414. formalParameter := formalParameter.nextParameter;
  7415. END;
  7416. (* static call of the constructor *)
  7417. GetCodeSectionNameForSymbol(constructor,name);
  7418. ASSERT(~constructor.isInline);
  7419. IF constructor.scope.ownerModule # module.module THEN
  7420. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7421. ELSE
  7422. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7423. END;
  7424. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7425. ELSE
  7426. ReleaseIntermediateOperand(pointer);
  7427. END;
  7428. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7429. Emit(Pop(position,pointer));
  7430. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7431. Designate(p0,l);
  7432. IF backend.writeBarriers & OnHeap(p0) THEN
  7433. SaveRegisters();ReleaseUsedRegisters(saved);
  7434. Emit(Push(position,l.op));
  7435. Emit(Push(position,pointer));
  7436. CallThis(position,"Heaps","Assign",2);
  7437. RestoreRegisters(saved);
  7438. ELSE
  7439. ToMemory(l.op,addressType,0);
  7440. Emit(Mov(position,l.op,pointer));
  7441. END;
  7442. ReleaseOperand(l);
  7443. result.tag := emptyOperand;
  7444. ELSIF (x.type # NIL) THEN
  7445. result := l; (* temporary variable is the result of NEW Type() *)
  7446. END;
  7447. (* call bodies *)
  7448. CallBodies(pointer,type);
  7449. ReleaseIntermediateOperand(pointer);
  7450. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7451. end := NewLabel();
  7452. BrL(end);
  7453. SetLabel(exit);
  7454. Designate(p0,l);
  7455. ToMemory(l.op,addressType,0);
  7456. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7457. ReleaseOperand(l);
  7458. SetLabel(end);
  7459. ELSE
  7460. SetLabel(exit);
  7461. END;
  7462. END;
  7463. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7464. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7465. IF ~backend.cooperative THEN (* simpler version *)
  7466. (*
  7467. push len0
  7468. push len1
  7469. push len2
  7470. push len_size
  7471. push len_adr
  7472. push tag
  7473. push static elements
  7474. push element size
  7475. push adr
  7476. *)
  7477. dim := 0;
  7478. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7479. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7480. parameter := x.parameters.GetExpression(i);
  7481. Evaluate(parameter,r);
  7482. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7483. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7484. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7485. END;
  7486. Emit(Push(position,r.op));
  7487. ReleaseOperand(r);
  7488. INC(dim);
  7489. END;
  7490. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7491. Emit(Mov(position, adr, sp));
  7492. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7493. Emit(Push(position, adr));
  7494. ReleaseIntermediateOperand(adr);
  7495. openDim := dim;
  7496. staticLength := 1;
  7497. IF type IS SyntaxTree.ArrayType THEN
  7498. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7499. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7500. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7501. END;
  7502. END;
  7503. IF SemanticChecker.ContainsPointer(type) THEN
  7504. tmp := TypeDescriptorAdr(type);
  7505. IF ~newObjectFile THEN
  7506. IntermediateCode.MakeMemory(tmp,addressType);
  7507. END;
  7508. ELSE
  7509. tmp := nil;
  7510. END;
  7511. Emit(Push(position,tmp)); (* type descriptor *)
  7512. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7513. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7514. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7515. Designate(p0,l);
  7516. Emit(Push(position,l.op)); (* address *)
  7517. ReleaseOperand(l);
  7518. CallThis(position,"Heaps","NewArray", 6);
  7519. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7520. Emit(Add(position,sp,sp,tmp));
  7521. ELSE
  7522. dim := 0;
  7523. IntermediateCode.InitOperand(reg);
  7524. IF p1 # NIL THEN
  7525. FOR i := firstPar TO x.parameters.Length()-1 DO
  7526. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7527. parameter := x.parameters.GetExpression(i);
  7528. Evaluate(parameter,r);
  7529. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7530. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7531. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7532. END;
  7533. Emit(Push(position,r.op));
  7534. IF i=1 THEN
  7535. CopyInt(reg,r.op);
  7536. ELSE
  7537. MulInt(reg, reg, r.op);
  7538. END;
  7539. ReleaseOperand(r);
  7540. INC(dim);
  7541. END;
  7542. Convert(reg,addressType);
  7543. ELSE
  7544. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7545. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7546. END;
  7547. openDim := dim;
  7548. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7549. IF backend.cooperative THEN
  7550. size := ToMemoryUnits(system,system.SizeOf(type));
  7551. WHILE type IS SyntaxTree.ArrayType DO
  7552. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7553. END;
  7554. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7555. IF (size # 1) THEN
  7556. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7557. END;
  7558. Emit(Push(position,reg));
  7559. size := ToMemoryUnits(system,system.SizeOf(type));
  7560. IF (size # 1) THEN
  7561. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7562. END;
  7563. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7564. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7565. Emit(Push(position,reg));
  7566. ReleaseIntermediateOperand(reg);
  7567. CallThis(position,"Runtime","New", 1);
  7568. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7569. Emit(Result(position, pointer));
  7570. exit := NewLabel();
  7571. else := NewLabel();
  7572. BreqL(else,pointer,nil);
  7573. IF ~type.hasPointers THEN
  7574. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7575. ELSIF type IS SyntaxTree.RecordType THEN
  7576. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7577. ELSIF type IS SyntaxTree.ProcedureType THEN
  7578. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7579. ELSE
  7580. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7581. END;
  7582. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7583. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7584. 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))));
  7585. IF type IS SyntaxTree.RecordType THEN
  7586. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7587. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7588. ELSE
  7589. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7590. END;
  7591. i := openDim;
  7592. WHILE i > 0 DO
  7593. DEC (i);
  7594. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7595. END;
  7596. needsTrace := p0.NeedsTrace();
  7597. IF needsTrace THEN ModifyAssignments(true) END;
  7598. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7599. Emit(Push(position, pointer));
  7600. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7601. Emit(Pop(position, pointer));
  7602. END;
  7603. Designate(p0,l);
  7604. IF needsTrace THEN
  7605. CallAssignPointer(l.op, pointer);
  7606. ModifyAssignments(false);
  7607. ELSE
  7608. ToMemory(l.op,addressType,0);
  7609. Emit(Mov(position,l.op,pointer));
  7610. END;
  7611. ReleaseIntermediateOperand(pointer);
  7612. ReleaseOperand(l);
  7613. BrL(exit);
  7614. SetLabel(else);
  7615. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7616. Designate(p0,l);
  7617. IF needsTrace THEN
  7618. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7619. ELSE
  7620. ToMemory(l.op,addressType,0);
  7621. Emit(Mov(position,l.op,pointer));
  7622. END;
  7623. ReleaseOperand(l);
  7624. SetLabel(exit);
  7625. ELSE
  7626. (*! the following code is only correct for "standard" Oberon calling convention *)
  7627. IF SemanticChecker.ContainsPointer(type) THEN
  7628. IF type IS SyntaxTree.ArrayType THEN
  7629. staticLength := 1;
  7630. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7631. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7632. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7633. END;
  7634. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7635. MulInt(reg,reg,tmp);
  7636. END;
  7637. Designate(p0,l);
  7638. IF openDim > 0 THEN
  7639. Emit(Push(position,l.op)); (* address for use after syscall *)
  7640. END;
  7641. Emit(Push(position,l.op)); (* address *)
  7642. ReleaseOperand(l);
  7643. tmp := TypeDescriptorAdr(type);
  7644. IF ~newObjectFile THEN
  7645. IntermediateCode.MakeMemory(tmp,addressType);
  7646. END;
  7647. Emit(Push(position,tmp)); (* type descriptor *)
  7648. ReleaseIntermediateOperand(tmp);
  7649. Emit(Push(position,reg)); (* number Elements *)
  7650. ReleaseIntermediateOperand(reg);
  7651. tmp := IntermediateCode.Immediate(addressType,dim);
  7652. Emit(Push(position,tmp)); (* dimensions *)
  7653. (* push realtime flag *)
  7654. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7655. ELSE Emit(Push(position,false));
  7656. END;
  7657. CallThis(position,"Heaps","NewArr",5)
  7658. ELSE
  7659. size := ToMemoryUnits(system,system.SizeOf(type));
  7660. IF (size # 1) THEN
  7661. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7662. (*
  7663. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7664. *)
  7665. END;
  7666. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7667. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7668. AddInt(reg, reg, tmp);
  7669. (*
  7670. Emit(Add(position,reg,reg,tmp));
  7671. *)
  7672. Designate(p0,l);
  7673. IF openDim >0 THEN
  7674. Emit(Push(position,l.op)); (* address for use after syscall *)
  7675. END;
  7676. Emit(Push(position,l.op)); (* address for syscall *)
  7677. ReleaseOperand(l); (* pointer address *)
  7678. Emit(Push(position,reg)); (* size *)
  7679. ReleaseIntermediateOperand(reg);
  7680. (* push realtime flag *)
  7681. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7682. ELSE Emit(Push(position,false));
  7683. END;
  7684. CallThis(position,"Heaps","NewSys", 3)
  7685. END;
  7686. IF openDim > 0 THEN
  7687. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7688. Emit(Pop(position,adr));
  7689. ToMemory(adr,addressType,0);
  7690. ReuseCopy(tmp,adr);
  7691. ReleaseIntermediateOperand(adr);
  7692. adr := tmp;
  7693. else := NewLabel();
  7694. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7695. i := openDim-1;
  7696. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7697. WHILE (i >= 0) DO
  7698. Emit(Pop(position,reg));
  7699. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7700. Emit(Mov(position,res,reg));
  7701. DEC(i);
  7702. END;
  7703. ReleaseIntermediateOperand(adr);
  7704. ReleaseIntermediateOperand(reg);
  7705. exit := NewLabel();
  7706. BrL(exit);
  7707. SetLabel(else);
  7708. (* else part: array could not be allocated *)
  7709. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7710. Emit(Add(position,sp,sp,tmp));
  7711. SetLabel(exit);
  7712. END;
  7713. END;
  7714. END;
  7715. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7716. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7717. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7718. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7719. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7720. left.SetType(procedure.type);
  7721. formalParameter := procedureType.firstParameter;
  7722. (* push array to allocate *)
  7723. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7724. formalParameter :=formalParameter.nextParameter;
  7725. (* push length array *)
  7726. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7727. (* push size *)
  7728. type := t0;
  7729. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7730. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7731. END;
  7732. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7733. Emit(Push(position,tmp));
  7734. (* *)
  7735. IF SemanticChecker.ContainsPointer(type) THEN
  7736. tmp := TypeDescriptorAdr(type);
  7737. IF ~newObjectFile THEN
  7738. IntermediateCode.MakeMemory(tmp,addressType);
  7739. END;
  7740. ELSE
  7741. tmp := IntermediateCode.Immediate(addressType, 0);
  7742. END;
  7743. Emit(Push(position,tmp)); (* type descriptor *)
  7744. StaticCallOperand(result,procedure);
  7745. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7746. ReleaseOperand(result);
  7747. END;
  7748. (*
  7749. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7750. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7751. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7752. *)
  7753. ELSE
  7754. (*
  7755. push len0
  7756. push len1
  7757. push len2
  7758. push size
  7759. push len_adr
  7760. push element_size
  7761. push tag
  7762. push adr
  7763. *)
  7764. dim := 0;
  7765. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7766. isTensor := TRUE;
  7767. ELSE
  7768. isTensor := FALSE;
  7769. END;
  7770. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7771. IF ~isTensor THEN
  7772. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7773. END;
  7774. parameter := x.parameters.GetExpression(i);
  7775. Evaluate(parameter,r);
  7776. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7777. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7778. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7779. END;
  7780. Emit(Push(position,r.op));
  7781. ReleaseOperand(r);
  7782. INC(dim);
  7783. END;
  7784. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7785. Emit(Mov(position, adr, sp));
  7786. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7787. Emit(Push(position, adr));
  7788. ReleaseIntermediateOperand(adr);
  7789. openDim := dim;
  7790. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7791. IF isTensor THEN
  7792. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7793. ELSE
  7794. baseType := SemanticChecker.ArrayBase(type,openDim);
  7795. END;
  7796. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7797. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7798. IF SemanticChecker.ContainsPointer(baseType) THEN
  7799. tmp := TypeDescriptorAdr(baseType);
  7800. IF ~newObjectFile THEN
  7801. IntermediateCode.MakeMemory(tmp,addressType);
  7802. END;
  7803. ELSE
  7804. tmp := nil;
  7805. END;
  7806. Emit(Push(position,tmp)); (* type descriptor *)
  7807. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7808. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7809. ELSE (* error message has already been emited *)
  7810. RETURN;
  7811. END;
  7812. Designate(p0,l);
  7813. IF isTensor THEN
  7814. Emit(Push(position,l.op)); (* address *)
  7815. ELSE
  7816. Emit(Push(position,l.tag)); (* address *)
  7817. END;
  7818. ReleaseOperand(l);
  7819. StaticCallOperand(result,procedure);
  7820. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7821. ReleaseOperand(result);
  7822. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7823. Emit(Add(position,sp,sp,tmp));
  7824. END;
  7825. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7826. THEN
  7827. IF ~backend.cellsAreObjects THEN RETURN END;
  7828. IF InCellScope(currentScope) THEN
  7829. PushSelfPointer()
  7830. ELSE
  7831. Emit(Push(position, nil));
  7832. END;
  7833. (* push temp address *)
  7834. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7835. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7836. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7837. (* l.op contains address of pointer to record *)
  7838. Emit(Push(position,l.op)); (* address for use after syscall *)
  7839. ReleaseOperand(l);
  7840. (* push type descriptor *)
  7841. reg := TypeDescriptorAdr(baseType);
  7842. IF ~newObjectFile THEN
  7843. IntermediateCode.MakeMemory(reg,addressType);
  7844. END;
  7845. Emit(Push(position,reg));
  7846. ReleaseIntermediateOperand(reg);
  7847. (* push name *)
  7848. (*Global.GetSymbolName(p0, n);*)
  7849. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7850. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7851. ELSE
  7852. Global.GetModuleName(module.module, n);
  7853. END;
  7854. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7855. (*type.typeDeclaration.GetName(n);*)
  7856. PushConstString(n);
  7857. (* push cellnet boolean *)
  7858. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7859. (* push engine boolean *)
  7860. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7861. (* allocate *)
  7862. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7863. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7864. (* l.op contains address of pointer to record *)
  7865. ToMemory(l.op,addressType,0);
  7866. (* l.op contains value of pointer to record *)
  7867. InitFields(baseType, l.op,0);
  7868. (* add capabilities *)
  7869. modifier := p0(SyntaxTree.Designator).modifiers;
  7870. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7871. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7872. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7873. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7874. END;
  7875. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7876. (*
  7877. modifier := baseType(SyntaxTree.CellType).modifiers;
  7878. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7879. modifier := p0(SyntaxTree.Designator).modifiers;
  7880. *)
  7881. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7882. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7883. (* l.op contains address of pointer to record *)
  7884. ToMemory(l.op,addressType,0);
  7885. (* l.op contains value of pointer to record *)
  7886. Emit(Push(position,l.op)); (* address for use after syscall *)
  7887. ReleaseOperand(l);
  7888. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7889. prevScope := currentScope;
  7890. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7891. previous := section;
  7892. section := init;
  7893. (* add ports *)
  7894. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7895. CloseInitializer(previous);
  7896. currentScope := prevScope;
  7897. Symbol(temporaryVariable,l);
  7898. ToMemory(l.op,addressType,0);
  7899. Emit(Push(position,l.op));
  7900. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7901. (*
  7902. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7903. IF constructor # NIL THEN
  7904. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7905. FOR i := 1 TO x.parameters.Length()-1 DO
  7906. p := x.parameters.GetExpression(i);
  7907. Global.GetSymbolName(parameter,name);
  7908. Evaluate(p, value);
  7909. ASSERT(value.type # NIL);
  7910. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7911. par := instance.AddParameter(name);
  7912. par.SetInteger(value.integer);
  7913. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7914. par := instance.AddParameter(name);
  7915. par.SetBoolean(value.boolean);
  7916. ELSE Error(x.position,NotYetImplemented)
  7917. END;
  7918. parameter := parameter.nextParameter
  7919. END;
  7920. END;
  7921. *)
  7922. (* call initializer *)
  7923. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7924. IF constructor # NIL THEN
  7925. (*! should be unified with ProcedureCallDesignator *)
  7926. IF backend.cellsAreObjects THEN
  7927. Symbol(temporaryVariable,l);
  7928. ToMemory(l.op,addressType,0);
  7929. Emit(Push(position,l.op));
  7930. ReleaseOperand(l);
  7931. END;
  7932. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7933. FOR i := firstPar TO x.parameters.Length()-1 DO
  7934. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7935. formalParameter := formalParameter.nextParameter;
  7936. END;
  7937. (* static call of the constructor *)
  7938. Global.GetSymbolSegmentedName(constructor,name);
  7939. ASSERT(~constructor.isInline);
  7940. IF constructor.scope.ownerModule # module.module THEN
  7941. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7942. ELSE
  7943. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7944. END;
  7945. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7946. (*ELSE
  7947. ReleaseIntermediateOperand(pointer);*)
  7948. END;
  7949. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7950. ToMemory(l.op, addressType, 0);
  7951. Designate(p0,s0);
  7952. ToMemory(s0.op,addressType,0);
  7953. Emit(Mov(position,s0.op,l.op));
  7954. ReleaseOperand(l);
  7955. ReleaseOperand(s0);
  7956. result.tag := emptyOperand;
  7957. (* start *)
  7958. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7959. (* push cell *)
  7960. Symbol(temporaryVariable, l);
  7961. ToMemory(l.op,addressType,0);
  7962. Emit(Push(Basic.invalidPosition,l.op));
  7963. (* push delegate *)
  7964. Emit(Push(Basic.invalidPosition,l.op));
  7965. ReleaseOperand(l);
  7966. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7967. Emit(Push(position, s1.op));
  7968. ReleaseOperand(s1);
  7969. CallThis(position,"ActiveCellsRuntime","Start",3);
  7970. END;
  7971. (*IF temporaryVariable # NIL THEN
  7972. end := NewLabel();
  7973. BrL(end);
  7974. SetLabel(exit);
  7975. Designate(p0,l);
  7976. ToMemory(l.op,addressType,0);
  7977. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7978. ReleaseOperand(l);
  7979. SetLabel(end);
  7980. ELSE
  7981. SetLabel(exit);
  7982. END;
  7983. *)
  7984. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7985. ELSE (* no pointer to record, no pointer to array *)
  7986. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7987. (* ignore new statement *)
  7988. Warning(p0.position, "cannot run on final hardware");
  7989. ELSE
  7990. HALT(200);
  7991. END;
  7992. END;
  7993. (* ---- ADDRESSOF----- *)
  7994. |Global.systemAdr:
  7995. Designate(p0,s0);
  7996. s0.mode := ModeValue;
  7997. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7998. ReleaseIntermediateOperand(s0.op);
  7999. s0.op := s0.tag;
  8000. IntermediateCode.InitOperand(s0.tag);
  8001. END;
  8002. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8003. result := s0;
  8004. (* ---- BIT ----- *)
  8005. |Global.systemBit:
  8006. Evaluate(p0,s0);
  8007. ToMemory(s0.op,addressType,0);
  8008. ReuseCopy(res,s0.op);
  8009. ReleaseOperand(s0);
  8010. Evaluate(p1,s1);
  8011. Emit(Ror(position,res,res,s1.op));
  8012. ReleaseOperand(s1);
  8013. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8014. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8015. IF ~conditional THEN
  8016. InitOperand(result,ModeValue); result.op := res;
  8017. ELSE
  8018. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8019. BrL(falseLabel);
  8020. ReleaseIntermediateOperand(res);
  8021. END;
  8022. (* --- MSK ----*)
  8023. |Global.systemMsk:
  8024. Evaluate(p0,s0);
  8025. Evaluate(p1,s1);
  8026. ReuseCopy(res,s0.op);
  8027. ReleaseOperand(s0);
  8028. Emit(And(position,res,res,s1.op));
  8029. ReleaseOperand(s1);
  8030. InitOperand(result,ModeValue);
  8031. result.op := res;
  8032. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8033. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8034. Evaluate(p0,s0);
  8035. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8036. ReleaseOperand(s0);
  8037. InitOperand(result,ModeValue);
  8038. result.op := res;
  8039. (* ---- SYSTEM.GetStackPointer ----- *)
  8040. |Global.systemGetStackPointer:
  8041. InitOperand(result,ModeValue);
  8042. result.op := sp;
  8043. (* ---- SYSTEM.GetFramePointer ----- *)
  8044. |Global.systemGetFramePointer:
  8045. InitOperand(result,ModeValue);
  8046. result.op := fp;
  8047. (* ---- SYSTEM.GetActivity ----- *)
  8048. |Global.systemGetActivity:
  8049. ASSERT(backend.cooperative);
  8050. InitOperand(result,ModeValue);
  8051. result.op := ap;
  8052. (* ---- SYSTEM.SetStackPointer ----- *)
  8053. |Global.systemSetStackPointer:
  8054. Evaluate(p0,s0); (* *)
  8055. Emit(Mov(position,sp,s0.op));
  8056. ReleaseOperand(s0);
  8057. (* ---- SYSTEM.SetFramePointer ----- *)
  8058. |Global.systemSetFramePointer:
  8059. Evaluate(p0,s0); (* *)
  8060. Emit(Mov(position,fp,s0.op));
  8061. ReleaseOperand(s0);
  8062. (* ---- SYSTEM.Activity ----- *)
  8063. |Global.systemSetActivity:
  8064. ASSERT(backend.cooperative);
  8065. Evaluate(p0,s0); (* *)
  8066. Emit(Mov(position,ap,s0.op));
  8067. ReleaseOperand(s0);
  8068. (* ---- SYSTEM.VAL ----- *)
  8069. |Global.systemVal:
  8070. Expression(p1);
  8071. s1 := result;
  8072. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8073. IF s1.mode = ModeReference THEN
  8074. (* nothing to be done if not record type, just take over new type *)
  8075. IF (type IS SyntaxTree.RecordType) THEN
  8076. ReleaseIntermediateOperand(s1.tag);
  8077. s1.tag := TypeDescriptorAdr(type);
  8078. IF ~newObjectFile THEN
  8079. IntermediateCode.MakeMemory(s1.tag,addressType);
  8080. END;
  8081. UseIntermediateOperand(s1.tag);
  8082. END;
  8083. result := s1;
  8084. ELSE (* copy over result to different type, may not use convert *)
  8085. itype := IntermediateCode.GetType(system,type);
  8086. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8087. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8088. Emit(Mov(position,s0.op,s1.op));
  8089. ReleaseOperand(s1);
  8090. InitOperand(result,ModeValue);
  8091. result.op := s0.op;
  8092. ELSE (* different size, must convert *)
  8093. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8094. Convert(s1.op, IntermediateCode.GetType(system,type));
  8095. result := s1;
  8096. END;
  8097. END;
  8098. (* ---- SYSTEM.GET ----- *)
  8099. |Global.systemGet:
  8100. Evaluate(p0,s0); (* adr *)
  8101. Designate(p1,s1); (* variable *)
  8102. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8103. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8104. Emit(Mov(position,s1.op,s0.op));
  8105. ReleaseOperand(s1);
  8106. ReleaseOperand(s0);
  8107. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8108. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8109. Evaluate(p0,s0); (* *)
  8110. Evaluate(p1,s1); (* variable *)
  8111. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8112. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8113. (* real part *)
  8114. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8115. Emit(Mov(position,res, s1.op));
  8116. ReleaseIntermediateOperand(res);
  8117. (* imaginary part *)
  8118. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8119. Emit(Mov(position,res, s1.tag));
  8120. ReleaseIntermediateOperand(res);
  8121. ReleaseOperand(s1);
  8122. ReleaseOperand(s0);
  8123. ELSE
  8124. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8125. ReleaseOperand(s0);
  8126. Emit(Mov(position,res,s1.op));
  8127. ReleaseIntermediateOperand(res);
  8128. ReleaseOperand(s1);
  8129. END;
  8130. (* ---- SYSTEM.MOVE ----- *)
  8131. |Global.systemMove:
  8132. Evaluate(p0,s0);
  8133. Evaluate(p1,s1);
  8134. Evaluate(p2,s2);
  8135. Emit(Copy(position,s1.op,s0.op,s2.op));
  8136. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8137. (* ---- SYSTEM.NEW ----- *)
  8138. |Global.systemNew:
  8139. Designate(p0,s0);
  8140. Emit(Push(position,s0.op));
  8141. ReleaseOperand(s0);
  8142. Evaluate(p1,s1);
  8143. Emit(Push(position,s1.op));
  8144. ReleaseOperand(s1);
  8145. (* push realtime flag: false by default *)
  8146. Emit(Push(position,false));
  8147. CallThis(position,"Heaps","NewSys",3);
  8148. (* ---- SYSTEM.CALL ----- *)
  8149. |Global.systemRef:
  8150. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8151. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8152. s0.mode := ModeValue;
  8153. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8154. result := s0
  8155. (* ---- INCR ----- *)
  8156. |Global.Incr:
  8157. Designate(p0,operand);
  8158. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8159. Dereference(operand,p0.type.resolved,FALSE);
  8160. END;
  8161. ASSERT(p1 # NIL);
  8162. Evaluate(p1,l);
  8163. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8164. ReleaseOperand(operand); ReleaseOperand(l);
  8165. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8166. (* ---- SUM ----- *)
  8167. |Global.Sum: HALT(200);
  8168. (* ---- ALL ----- *)
  8169. |Global.All: HALT(200);
  8170. (* ---- CAS ----- *)
  8171. |Global.Cas:
  8172. needsTrace := p0.NeedsTrace();
  8173. IF needsTrace THEN ModifyAssignments(true) END;
  8174. Designate(p0,s0);
  8175. Evaluate(p1,s1);
  8176. Evaluate(p2,s2);
  8177. IF needsTrace THEN
  8178. Emit(Push(position, s0.op));
  8179. Emit(Push(position, s1.op));
  8180. Emit(Push(position, s2.op));
  8181. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8182. ELSE
  8183. Emit(Cas(position,s0.op,s1.op,s2.op));
  8184. END;
  8185. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8186. IF needsTrace THEN ModifyAssignments(false) END;
  8187. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8188. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8189. IF conditional THEN
  8190. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8191. BrL(falseLabel);
  8192. ReleaseIntermediateOperand(res);
  8193. END;
  8194. (* ---- DIM ----- *)
  8195. |Global.Dim:
  8196. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8197. Designate(p0,s0);
  8198. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8199. Dereference(s0,p0.type.resolved,FALSE);
  8200. END;
  8201. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8202. ReleaseOperand(s0);
  8203. (* ---- RESHAPE ----- *)
  8204. |Global.Reshape:
  8205. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8206. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8207. left.SetType(procedure.type);
  8208. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8209. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8210. END;
  8211. (* ---- SYSTEM.TYPECODE ----- *)
  8212. |Global.systemTypeCode:
  8213. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8214. IF type.resolved IS SyntaxTree.PointerType THEN
  8215. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8216. END;
  8217. result.op := TypeDescriptorAdr(type);
  8218. IF ~newObjectFile THEN
  8219. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8220. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8221. END;
  8222. result.mode := ModeValue;
  8223. (* ---- SYSTEM.TRACE ----- *)
  8224. |Global.systemTrace:
  8225. SystemTrace(x.parameters, x.position);
  8226. (* ----- CONNECT ------*)
  8227. |Global.Connect:
  8228. IF backend.cellsAreObjects THEN
  8229. PushPort(p0);
  8230. PushPort(p1);
  8231. IF p2 # NIL THEN
  8232. Evaluate(p2, s2);
  8233. Emit(Push(p2.position, s2.op));
  8234. ReleaseOperand(s2);
  8235. ELSE
  8236. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8237. END;
  8238. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8239. ELSE
  8240. Warning(x.position, "cannot run on final hardware");
  8241. END;
  8242. (* ----- DELEGATE ------*)
  8243. |Global.Delegate:
  8244. IF backend.cellsAreObjects THEN
  8245. PushPort(p0);
  8246. PushPort(p1);
  8247. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8248. ELSE
  8249. Warning(x.position, "cannot run on final hardware");
  8250. END;
  8251. (* ----- SEND ------*)
  8252. |Global.Send:
  8253. Evaluate(p0,s0);
  8254. Evaluate(p1,s1);
  8255. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8256. Emit(Push(position,s0.op));
  8257. Emit(Push(position,s1.op));
  8258. (*
  8259. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8260. *)
  8261. IF ~backend.cellsAreObjects THEN
  8262. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8263. END;
  8264. ReleaseOperand(s0);
  8265. ReleaseOperand(s1);
  8266. IF backend.cellsAreObjects THEN
  8267. CallThis(position,"ActiveCellsRuntime","Send",2);
  8268. ELSE
  8269. CallThis(position,ChannelModuleName,"Send",2);
  8270. END;
  8271. (* ----- RECEIVE ------*)
  8272. |Global.Receive:
  8273. Evaluate(p0,s0);
  8274. Emit(Push(position,s0.op));
  8275. Designate(p1,s1);
  8276. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8277. Emit(Push(position,s1.op));
  8278. IF p2 # NIL THEN
  8279. Designate(p2,s2);
  8280. Emit(Push(position,s2.op));
  8281. END;
  8282. (*
  8283. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8284. *)
  8285. IF ~backend.cellsAreObjects THEN
  8286. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8287. END;
  8288. ReleaseOperand(s0);
  8289. ReleaseOperand(s1);
  8290. ReleaseOperand(s2);
  8291. IF backend.cellsAreObjects THEN
  8292. IF p2 = NIL THEN
  8293. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8294. ELSE
  8295. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8296. END;
  8297. ELSE
  8298. IF p2 = NIL THEN
  8299. CallThis(position,ChannelModuleName,"Receive",2)
  8300. ELSE
  8301. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8302. END;
  8303. END;
  8304. | Global.systemSpecial:
  8305. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8306. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8307. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8308. (* determine if parameters are of the VAR kind *)
  8309. ASSERT(x.parameters.Length() <= 3);
  8310. formalParameter := procedureType.firstParameter;
  8311. FOR i := 0 TO x.parameters.Length() - 1 DO
  8312. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8313. formalParameter := formalParameter.nextParameter
  8314. END;
  8315. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8316. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8317. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8318. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8319. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8320. IF procedureType.returnType # NIL THEN
  8321. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8322. Emit(Result(position, res));
  8323. (*InitOperand(result,ModeValue);
  8324. result.op := res;
  8325. *)
  8326. IF ~conditional THEN
  8327. InitOperand(result,ModeValue); result.op := res;
  8328. ELSE
  8329. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8330. BrL(falseLabel);
  8331. ReleaseIntermediateOperand(res);
  8332. END;
  8333. END
  8334. ELSE (* function not yet implemented *)
  8335. Error(position,"not yet implemented");
  8336. END;
  8337. destination := dest;
  8338. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8339. END VisitBuiltinCallDesignator;
  8340. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8341. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8342. BEGIN
  8343. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8344. dest := destination; destination := emptyOperand;
  8345. Expression(x.left);
  8346. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8347. ELSIF isUnchecked THEN (* no check *)
  8348. ELSE
  8349. trueL := NewLabel();
  8350. falseL := NewLabel();
  8351. IF IsPointerToRecord(x.left.type,recordType) THEN
  8352. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8353. Emit(Mov(position,tag, result.op));
  8354. IF result.mode # ModeValue THEN
  8355. ptr := tag;
  8356. IntermediateCode.MakeMemory(ptr,addressType);
  8357. Emit(Mov(position,tag, ptr));
  8358. END;
  8359. IF ~backend.cooperative THEN
  8360. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8361. END;
  8362. IntermediateCode.MakeMemory(tag,addressType);
  8363. ELSE
  8364. tag := result.tag;
  8365. UseIntermediateOperand(tag);
  8366. END;
  8367. TypeTest(tag,x.type,trueL,falseL);
  8368. ReleaseIntermediateOperand(tag);
  8369. SetLabel(falseL);
  8370. EmitTrap(position,TypeCheckTrap);
  8371. SetLabel(trueL);
  8372. END;
  8373. destination := dest;
  8374. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8375. END VisitTypeGuardDesignator;
  8376. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8377. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8378. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8379. VAR label: Label; pc: LONGINT;
  8380. BEGIN
  8381. IF backend.cooperative & ~isUnchecked THEN
  8382. pc := section.pc;
  8383. label := NewLabel();
  8384. BrneL(label, operand.op, nil);
  8385. EmitTrap(position, NilPointerTrap);
  8386. SetLabel(label);
  8387. INC(statCoopNilCheck, section.pc - pc);
  8388. END;
  8389. END NilCheck;
  8390. BEGIN
  8391. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8392. ReuseCopy(dereferenced,operand.op);
  8393. ReleaseOperand(operand);
  8394. operand.mode := ModeReference;
  8395. operand.op := dereferenced;
  8396. operand.tag := dereferenced;
  8397. UseIntermediateOperand(operand.tag);
  8398. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8399. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8400. ReleaseIntermediateOperand(operand.tag);
  8401. operand.tag := TypeDescriptorAdr(type);
  8402. IF ~newObjectFile THEN
  8403. IntermediateCode.MakeMemory(operand.tag,addressType);
  8404. END;
  8405. ELSE
  8406. IF ~backend.cooperative THEN
  8407. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8408. END;
  8409. IntermediateCode.MakeMemory(operand.tag,addressType);
  8410. END;
  8411. NilCheck(operand.op);
  8412. ELSIF type IS SyntaxTree.ArrayType THEN
  8413. IF isUnsafe THEN
  8414. NilCheck(operand.op);
  8415. ReleaseIntermediateOperand(operand.tag);
  8416. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8417. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8418. ELSE
  8419. operand.tag := emptyOperand;
  8420. END;
  8421. ELSE
  8422. NilCheck(operand.op);
  8423. IF backend.cooperative THEN
  8424. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8425. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8426. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8427. ELSE
  8428. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8429. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8430. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8431. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8432. END;
  8433. END;
  8434. ELSIF type IS SyntaxTree.MathArrayType THEN
  8435. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8436. IntermediateCode.MakeMemory(operand.op,addressType);
  8437. ELSE HALT(100);
  8438. END;
  8439. END Dereference;
  8440. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8441. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8442. BEGIN
  8443. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8444. dest := destination; destination := emptyOperand;
  8445. Evaluate(x.left,d);
  8446. type := x.type.resolved;
  8447. prevIsUnchecked := isUnchecked;
  8448. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8449. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8450. END;
  8451. Dereference(d,type,IsUnsafePointer(x.left.type));
  8452. isUnchecked := prevIsUnchecked;
  8453. result := d;
  8454. 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
  8455. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8456. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8457. END;
  8458. END;
  8459. destination := dest;
  8460. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8461. END VisitDereferenceDesignator;
  8462. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8463. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8464. BEGIN
  8465. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8466. dest := destination; destination := emptyOperand;
  8467. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8468. tag := result.op;
  8469. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8470. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8471. StaticCallOperand(result,procedure.super);
  8472. ReleaseIntermediateOperand(result.tag);
  8473. UseIntermediateOperand(tag); (* necessary ? *)
  8474. result.tag := tag;
  8475. destination := dest;
  8476. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8477. END VisitSupercallDesignator;
  8478. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8479. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8480. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8481. name: Basic.SegmentedName;
  8482. procedure: SyntaxTree.Procedure;
  8483. procedureType: SyntaxTree.ProcedureType;
  8484. BEGIN
  8485. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8486. dest := destination; destination := emptyOperand;
  8487. scope := currentScope;
  8488. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8489. scope := scope.outerScope;
  8490. END;
  8491. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8492. IF newObjectFile THEN
  8493. moduleSection := meta.ModuleSection();
  8494. IF backend.cooperative THEN
  8495. moduleOffset := 0;
  8496. ELSE
  8497. moduleOffset := moduleSection.pc;
  8498. END;
  8499. result.mode := ModeValue;
  8500. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8501. ELSE
  8502. Symbol(moduleSelf,result);
  8503. IntermediateCode.MakeMemory(result.op,addressType);
  8504. END
  8505. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8506. result.mode := ModeValue;
  8507. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8508. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8509. ELSE
  8510. GetBaseRegister(basereg,currentScope,scope);
  8511. InitOperand(result,ModeReference);
  8512. result.op := basereg;
  8513. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8514. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8515. parametersSize := ProcedureParametersSize(system,procedure);
  8516. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8517. IF backend.cooperative THEN
  8518. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8519. END;
  8520. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8521. MakeMemory(result.op, result.op, addressType, 0);
  8522. END;
  8523. (* tag must be loaded when dereferencing SELF pointer *)
  8524. END;
  8525. destination := dest;
  8526. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8527. END VisitSelfDesignator;
  8528. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8529. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8530. BEGIN
  8531. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8532. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8533. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8534. parameter := procedureType.returnParameter;
  8535. IF currentIsInline THEN
  8536. map := currentMapper.Get(NIL);
  8537. IF map # NIL THEN
  8538. Designate(map.to, result);
  8539. ELSE
  8540. HALT(200);
  8541. END;
  8542. RETURN;
  8543. END;
  8544. VisitParameter(parameter);
  8545. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8546. END VisitResultDesignator;
  8547. (** values *)
  8548. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8549. BEGIN
  8550. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8551. IF conditional THEN
  8552. IF x.value THEN BrL(trueLabel)
  8553. ELSE BrL(falseLabel)
  8554. END;
  8555. ELSE
  8556. InitOperand(result,ModeValue);
  8557. IF x.value THEN result.op := true ELSE result.op := false END;
  8558. END;
  8559. END VisitBooleanValue;
  8560. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8561. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8562. BEGIN
  8563. Global.GetModuleSegmentedName(module.module, name);
  8564. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8565. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8566. RETURN section
  8567. END GetDataSection;
  8568. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8569. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8570. BEGIN
  8571. type := vop.type;
  8572. data := GetDataSection();
  8573. pc := EnterImmediate(data,vop);
  8574. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8575. IntermediateCode.MakeMemory(vop, type);
  8576. END GetImmediateMem;
  8577. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8578. BEGIN
  8579. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8580. InitOperand(result,ModeValue);
  8581. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8582. IF ~supportedImmediate(result.op) &~inData THEN
  8583. GetImmediateMem(result.op)
  8584. END;
  8585. END VisitIntegerValue;
  8586. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8587. BEGIN
  8588. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8589. InitOperand(result,ModeValue);
  8590. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8591. END VisitCharacterValue;
  8592. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8593. BEGIN
  8594. IF Trace THEN TraceEnter("VisitSetValue") END;
  8595. InitOperand(result,ModeValue);
  8596. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8597. END VisitSetValue;
  8598. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8599. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8600. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8601. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8602. BEGIN
  8603. numberElements := x.elements.Length();
  8604. FOR i := 0 TO numberElements-1 DO
  8605. expression := x.elements.GetExpression(i);
  8606. IF expression IS SyntaxTree.MathArrayExpression THEN
  8607. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8608. ELSE
  8609. inData := TRUE;
  8610. Evaluate(expression,op);
  8611. irv.Emit(Data(position,op.op));
  8612. inData := FALSE;
  8613. ReleaseOperand(op);
  8614. END;
  8615. END;
  8616. END RecursiveData;
  8617. BEGIN
  8618. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8619. IF ~TryConstantDeclaration() THEN
  8620. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8621. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8622. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8623. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8624. ELSE
  8625. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8626. END;
  8627. RecursiveData(x.array);
  8628. InitOperand(result,ModeReference);
  8629. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8630. END
  8631. END VisitMathArrayValue;
  8632. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8633. VAR constant: Sections.Section;
  8634. BEGIN
  8635. IF constantDeclaration = NIL THEN
  8636. RETURN FALSE
  8637. ELSE
  8638. (* Is a constant in this module: did we generate it already? *)
  8639. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8640. IF constant # NIL THEN
  8641. InitOperand(result,ModeReference);
  8642. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8643. RETURN TRUE;
  8644. END;
  8645. END;
  8646. RETURN FALSE
  8647. END TryConstantDeclaration;
  8648. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8649. BEGIN
  8650. constantDeclaration := x;
  8651. x.value.resolved.Accept(SELF);
  8652. END VisitConstant;
  8653. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8654. BEGIN
  8655. IF Trace THEN TraceEnter("VisitRealValue") END;
  8656. InitOperand(result,ModeValue);
  8657. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8658. END VisitRealValue;
  8659. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8660. VAR
  8661. componentType: SyntaxTree.Type;
  8662. BEGIN
  8663. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8664. ASSERT(x.type IS SyntaxTree.ComplexType);
  8665. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8666. InitOperand(result,ModeValue);
  8667. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8668. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8669. END VisitComplexValue;
  8670. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8671. VAR i: LONGINT; name: Basic.SegmentedName;
  8672. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8673. BEGIN
  8674. IF Trace THEN TraceEnter("VisitStringValue") END;
  8675. IF ~TryConstantDeclaration() THEN
  8676. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8677. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8678. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8679. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8680. ELSE
  8681. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8682. END;
  8683. FOR i := 0 TO x.length-1 DO
  8684. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8685. irv.Emit(Data(position,op));
  8686. END;
  8687. InitOperand(result,ModeReference);
  8688. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8689. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8690. END
  8691. END VisitStringValue;
  8692. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8693. BEGIN
  8694. IF Trace THEN TraceEnter("VisitNilValue") END;
  8695. InitOperand(result,ModeValue);
  8696. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8697. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8698. END VisitNilValue;
  8699. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8700. BEGIN
  8701. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8702. InitOperand(result,ModeValue);
  8703. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8704. END VisitEnumerationValue;
  8705. (** symbols *)
  8706. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8707. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8708. END VisitImport;
  8709. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8710. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8711. BEGIN
  8712. IF scope # baseScope THEN
  8713. (* left := [fp+8] *)
  8714. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8715. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8716. ReuseCopy(left,right);
  8717. ReleaseIntermediateOperand(right);
  8718. scope := scope.outerScope; DEC(level);
  8719. (* { left := [left+8] } *)
  8720. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8721. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8722. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8723. Emit(Mov(position,left,right));
  8724. scope := scope.outerScope; DEC(level);
  8725. END;
  8726. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8727. result := left;
  8728. ELSE
  8729. result := fp;
  8730. END;
  8731. END GetBaseRegister;
  8732. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8733. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8734. BEGIN
  8735. IF Trace THEN TraceEnter("VisitVariable"); END;
  8736. type := x.type.resolved;
  8737. IF (x.useRegister) THEN
  8738. InitOperand(result, ModeValue);
  8739. IF x.registerNumber < 0 THEN
  8740. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8741. reg := x.registerNumber;
  8742. ELSE
  8743. reg := registerUsageCount.Map(x.registerNumber);
  8744. UseRegister(reg);
  8745. END;
  8746. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8747. ELSIF x.externalName # NIL THEN
  8748. InitOperand(result,ModeReference);
  8749. Basic.ToSegmentedName(x.externalName^, name);
  8750. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8751. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8752. InitOperand(result,ModeReference);
  8753. GetBaseRegister(result.op,currentScope,x.scope);
  8754. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8755. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8756. InitOperand(result,ModeReference);
  8757. GetCodeSectionNameForSymbol(x,name);
  8758. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8759. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8760. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8761. InitOperand(result,ModeReference);
  8762. GetCodeSectionNameForSymbol(x,name);
  8763. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8764. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8765. ELSE (* field, left designator must have been emitted *)
  8766. ASSERT(result.mode = ModeReference);
  8767. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8768. ReuseCopy(temp,result.op);
  8769. ReleaseIntermediateOperand(result.op);
  8770. result.op := temp;
  8771. END;
  8772. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8773. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8774. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8775. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8776. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8777. END;
  8778. END;
  8779. END;
  8780. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8781. ValueToCondition(result);
  8782. ELSIF type IS SyntaxTree.ProcedureType THEN
  8783. ReleaseIntermediateOperand(result.tag);
  8784. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8785. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8786. UseIntermediateOperand(result.tag);
  8787. ELSE
  8788. result.tag := nil; (* nil *)
  8789. END;
  8790. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8791. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8792. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8793. ReleaseIntermediateOperand(result.tag);
  8794. Global.GetSymbolSegmentedName(x,name);
  8795. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8796. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8797. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8798. ELSE
  8799. END;
  8800. ELSE
  8801. ReleaseIntermediateOperand(result.tag);
  8802. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8803. END;
  8804. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8805. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8806. ReleaseIntermediateOperand(result.tag);
  8807. result.tag := result.op;
  8808. UseIntermediateOperand(result.tag);
  8809. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8810. IntermediateCode.MakeMemory(result.op,addressType);
  8811. END;
  8812. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8813. ReleaseIntermediateOperand(result.tag);
  8814. result.tag := TypeDescriptorAdr(type);
  8815. IF ~newObjectFile THEN
  8816. IntermediateCode.MakeMemory(result.tag,addressType);
  8817. END;
  8818. UseIntermediateOperand(result.tag);
  8819. (* tag for pointer type computed not here but during dereferencing *)
  8820. END;
  8821. IF Trace THEN TraceExit("VisitVariable") END;
  8822. END VisitVariable;
  8823. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8824. BEGIN
  8825. VisitVariable(property);
  8826. END VisitProperty;
  8827. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8828. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8829. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8830. BEGIN
  8831. type := x.type.resolved;
  8832. IF Trace THEN TraceEnter("VisitParameter") END;
  8833. IF x.ownerType IS SyntaxTree.CellType THEN
  8834. ptype := x.type.resolved;
  8835. IF backend.cellsAreObjects THEN
  8836. ASSERT(result.mode = ModeReference);
  8837. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8838. ReuseCopy(temp,result.op);
  8839. ReleaseIntermediateOperand(result.op);
  8840. result.op := temp;
  8841. END;
  8842. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8843. RETURN;
  8844. ELSE
  8845. InitOperand(result,ModeReference);
  8846. GetCodeSectionNameForSymbol(x,name);
  8847. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8848. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8849. RETURN;
  8850. END;
  8851. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8852. InitOperand(result,ModeReference);
  8853. GetCodeSectionNameForSymbol(x,name);
  8854. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8855. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8856. RETURN
  8857. ELSE
  8858. GetBaseRegister(basereg,currentScope,x.scope);
  8859. InitOperand(result,ModeReference);
  8860. result.op := basereg;
  8861. END;
  8862. IF IsOpenArray(type) THEN
  8863. result.tag := basereg;
  8864. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8865. IntermediateCode.MakeMemory(result.op,addressType);
  8866. IF Global.IsOberonProcedure(x.ownerType) THEN
  8867. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8868. UseIntermediateOperand(result.tag);
  8869. ELSE
  8870. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8871. END;
  8872. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8873. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8874. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8875. ELSIF IsStaticArray(type) THEN
  8876. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8877. IntermediateCode.MakeMemory(result.op,addressType);
  8878. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8879. ELSIF type IS SyntaxTree.MathArrayType THEN
  8880. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8881. WITH type: SyntaxTree.MathArrayType DO
  8882. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8883. IF type.form = SyntaxTree.Tensor THEN
  8884. ELSIF type.form = SyntaxTree.Open THEN
  8885. result.tag := result.op;
  8886. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8887. IntermediateCode.MakeMemory(result.op,addressType);
  8888. UseIntermediateOperand(result.tag);
  8889. ELSIF type.form = SyntaxTree.Static THEN
  8890. IF x.kind = SyntaxTree.ConstParameter THEN
  8891. IntermediateCode.MakeMemory(result.op,addressType);
  8892. END;
  8893. ELSE HALT(100)
  8894. END;
  8895. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8896. IF type.form = SyntaxTree.Tensor THEN
  8897. ToMemory(result.op,addressType,0);
  8898. ELSIF type.form = SyntaxTree.Open THEN
  8899. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8900. ReuseCopy(result.tag, mem);
  8901. ReleaseIntermediateOperand(mem);
  8902. ReleaseIntermediateOperand(result.op);
  8903. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8904. ELSIF type.form = SyntaxTree.Static THEN
  8905. IntermediateCode.MakeMemory(result.op,addressType);
  8906. ELSE HALT(100)
  8907. END;
  8908. ELSE HALT(100)
  8909. END;
  8910. END;
  8911. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8912. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8913. IntermediateCode.MakeMemory(result.op,addressType);
  8914. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8915. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8916. END;
  8917. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8918. ValueToCondition(result);
  8919. ELSIF type IS SyntaxTree.ProcedureType THEN
  8920. ReleaseIntermediateOperand(result.tag);
  8921. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8922. IF x.kind = SyntaxTree.VarParameter THEN
  8923. ReuseCopy(result.tag,result.op);
  8924. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8925. IntermediateCode.MakeMemory(result.tag,addressType);
  8926. ELSE
  8927. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8928. UseIntermediateOperand(result.tag);
  8929. END;
  8930. ELSE
  8931. result.tag := nil;
  8932. END;
  8933. (* tag for pointer type computed not here but during dereferencing *)
  8934. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8935. ReleaseIntermediateOperand(result.tag);
  8936. result.tag := basereg;
  8937. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8938. IntermediateCode.MakeMemory(result.tag,addressType);
  8939. UseIntermediateOperand(result.tag);
  8940. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8941. ReleaseIntermediateOperand(result.tag);
  8942. result.tag := TypeDescriptorAdr(type);
  8943. IF ~newObjectFile THEN
  8944. IntermediateCode.MakeMemory(result.tag,addressType);
  8945. END;
  8946. UseIntermediateOperand(result.tag);
  8947. END;
  8948. IF Trace THEN TraceExit("VisitParameter") END;
  8949. END VisitParameter;
  8950. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8951. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8952. BEGIN
  8953. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8954. (* left.p: left already emitted *)
  8955. tag := result.op; (* value of pointer to left *)
  8956. (* get type desc *)
  8957. tmp := result.tag;
  8958. IntermediateCode.MakeMemory(tmp,addressType);
  8959. (* get method adr *)
  8960. Reuse1(reg,tmp);
  8961. ReleaseIntermediateOperand(tmp);
  8962. IF backend.cooperative THEN
  8963. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8964. WHILE recordType.baseType # NIL DO
  8965. recordType := recordType.GetBaseRecord ();
  8966. END;
  8967. GetRecordTypeName (recordType,name);
  8968. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8969. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8970. offset := 0;
  8971. ELSE
  8972. offset := 2;
  8973. END;
  8974. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8975. ELSE
  8976. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8977. END;
  8978. InitOperand(operand,ModeReference);
  8979. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8980. operand.op := reg;
  8981. operand.tag := tag;
  8982. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8983. END DynamicCallOperand;
  8984. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8985. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8986. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8987. BEGIN
  8988. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8989. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8990. tag := operand.op;
  8991. ReleaseIntermediateOperand(operand.tag);
  8992. ELSE tag := nil
  8993. END;
  8994. IF x.isInline THEN
  8995. sectionType := Sections.InlineCodeSection;
  8996. ELSE
  8997. sectionType := Sections.CodeSection;
  8998. END;
  8999. IF x.externalName # NIL THEN
  9000. Basic.ToSegmentedName(x.externalName^, name);
  9001. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9002. ELSE
  9003. GetCodeSectionNameForSymbol(x, name);
  9004. IF (x.scope.ownerModule = module.module) THEN
  9005. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9006. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9007. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9008. IF source.pc = 0 THEN (* no code yet *)
  9009. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9010. END;
  9011. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9012. bits := x.procedureScope.body.code.inlineCode;
  9013. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9014. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9015. binary.CopyBits(bits, 0, bits.GetSize());
  9016. source.SetResolved(binary);
  9017. ELSE
  9018. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9019. END;
  9020. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9021. END;
  9022. InitOperand(operand,ModeValue);
  9023. operand.op := reg;
  9024. operand.tag := tag;
  9025. IF Trace THEN TraceExit("StaticCallOperand") END;
  9026. END StaticCallOperand;
  9027. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9028. (* handle expressions of the form designator.procedure or procedure *)
  9029. BEGIN
  9030. IF Trace THEN TraceEnter("VisitProcedure") END;
  9031. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9032. DynamicCallOperand(result,x);
  9033. ELSIF x.isInline THEN
  9034. StaticCallOperand(result,x);
  9035. ELSE
  9036. StaticCallOperand(result,x);
  9037. END;
  9038. IF Trace THEN TraceExit("VisitProcedure") END;
  9039. END VisitProcedure;
  9040. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9041. BEGIN
  9042. VisitProcedure(x);
  9043. END VisitOperator;
  9044. (** statements *)
  9045. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9046. BEGIN
  9047. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9048. Expression(x.call);
  9049. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9050. ReleaseOperand(result)
  9051. END;
  9052. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9053. END VisitProcedureCallStatement;
  9054. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9055. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9056. leftBase, rightBase: SyntaxTree.Type;
  9057. procedureName,s: SyntaxTree.IdentifierString;
  9058. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9059. size: LONGINT; rightKind: LONGINT;
  9060. dummy: IntermediateCode.Operand;
  9061. CONST moduleName = "FoxArrayBase";
  9062. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9063. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9064. BEGIN
  9065. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9066. IF base IS SyntaxTree.MathArrayType THEN
  9067. base := OpenArray(base(SyntaxTree.MathArrayType));
  9068. END;
  9069. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9070. result.SetArrayBase(base);
  9071. RETURN result
  9072. END OpenArray;
  9073. BEGIN
  9074. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9075. SaveRegisters();ReleaseUsedRegisters(saved);
  9076. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9077. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9078. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9079. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9080. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9081. IF leftType.form = SyntaxTree.Tensor THEN
  9082. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9083. ELSIF leftType.form = SyntaxTree.Open THEN
  9084. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9085. ELSIF leftType.form = SyntaxTree.Static THEN
  9086. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9087. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9088. END;
  9089. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9090. IF procedure = NIL THEN
  9091. s := "Instruction not supported on target, emulation procedure ";
  9092. Strings.Append(s,moduleName);
  9093. Strings.Append(s,".");
  9094. Strings.Append(s,procedureName);
  9095. Strings.Append(s," not present");
  9096. Error(position,s);
  9097. ELSE
  9098. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9099. parameter.SetType(leftType);
  9100. parameter.SetAccess(SyntaxTree.Internal);
  9101. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9102. parameter.SetKind(rightKind);
  9103. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9104. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9105. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9106. StaticCallOperand(result,procedure);
  9107. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  9108. ReleaseOperand(result);
  9109. END;
  9110. RestoreRegisters(saved);
  9111. END;
  9112. END AssignMathArray;
  9113. VAR modifyAssignmentCounter := 0: LONGINT;
  9114. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9115. VAR processor,mem,dst: IntermediateCode.Operand;
  9116. BEGIN
  9117. IF value.intValue = true.intValue THEN
  9118. INC(modifyAssignmentCounter);
  9119. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9120. modifyAssignmentsPC := section.pc;
  9121. ELSE
  9122. DEC(modifyAssignmentCounter);
  9123. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9124. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9125. END;
  9126. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9127. dst := NewRegisterOperand (addressType);
  9128. Emit(Mov(position,dst, processor));
  9129. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9130. Emit(Mov(position,mem, value));
  9131. ReleaseIntermediateOperand(dst);
  9132. END ModifyAssignments;
  9133. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9134. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9135. BEGIN
  9136. type := left.type.resolved;
  9137. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9138. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9139. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9140. IF procedureType.returnParameter = parameter THEN
  9141. (* this is the only case where the destination can be dynamically smaller than the source
  9142. in all other cases the dynamic size has to be taken
  9143. *)
  9144. IF backend.cooperative THEN
  9145. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9146. ELSE
  9147. MakeMemory(mem, tag, addressType, 0);
  9148. END;
  9149. RETURN mem;
  9150. END;
  9151. END;
  9152. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9153. END CopySize;
  9154. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9155. VAR
  9156. leftO, rightO: Operand;
  9157. arg,mem, sizeOp: IntermediateCode.Operand;
  9158. leftType, rightType, componentType, base: SyntaxTree.Type;
  9159. size: LONGINT;
  9160. parameters: SyntaxTree.ExpressionList;
  9161. procedure: SyntaxTree.Procedure;
  9162. call: SyntaxTree.ProcedureCallDesignator;
  9163. designator: SyntaxTree.Designator;
  9164. saved: RegisterEntry;
  9165. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9166. VAR procedureType: SyntaxTree.ProcedureType;
  9167. BEGIN
  9168. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9169. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9170. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9171. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9172. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9173. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9174. IF right.id = Global.Reshape THEN RETURN TRUE
  9175. END;
  9176. END;
  9177. END;
  9178. END;
  9179. RETURN FALSE
  9180. END CanPassAsResultParameter;
  9181. BEGIN
  9182. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9183. leftType := left.type.resolved; rightType:= right.type.resolved;
  9184. IF backend.cooperative & left.NeedsTrace() THEN
  9185. ModifyAssignments(true);
  9186. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9187. Designate(right, rightO);
  9188. Designate(left, leftO);
  9189. ASSERT(leftO.mode = ModeReference);
  9190. TransferToRegister(leftO.op, leftO.op);
  9191. TransferToRegister(rightO.op, rightO.op);
  9192. Emit(Push(position, leftO.op));
  9193. Emit(Push(position, rightO.op));
  9194. CallAssignMethod(leftO.op, rightO.op, left.type);
  9195. Emit(Pop(position, rightO.op));
  9196. Emit(Pop(position, leftO.op));
  9197. sizeOp := CopySize(left, leftO.tag);
  9198. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9199. ReleaseIntermediateOperand(sizeOp);
  9200. ReleaseOperand(leftO);
  9201. ReleaseOperand(rightO);
  9202. ELSE
  9203. Evaluate(right,rightO);
  9204. Designate(left,leftO);
  9205. ASSERT(leftO.mode = ModeReference);
  9206. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9207. (* copy procedure address first *)
  9208. MakeMemory(mem,leftO.op,addressType,0);
  9209. Emit(Mov(position,mem,rightO.op));
  9210. ReleaseIntermediateOperand(mem);
  9211. (* copy pointer address *)
  9212. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9213. CallAssignPointer(leftO.tag, rightO.tag);
  9214. ELSE
  9215. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9216. CallAssignPointer(leftO.op, rightO.op);
  9217. END;
  9218. ReleaseOperand(leftO);
  9219. ReleaseOperand(rightO);
  9220. END;
  9221. ModifyAssignments(false);
  9222. RETURN;
  9223. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9224. SaveRegisters();ReleaseUsedRegisters(saved);
  9225. IF SemanticChecker.IsPointerType(leftType) THEN
  9226. Evaluate(right,rightO);
  9227. Designate(left,leftO);
  9228. Emit(Push(position,leftO.op));
  9229. ReleaseOperand(leftO);
  9230. Emit(Push(position,rightO.op));
  9231. ReleaseOperand(rightO);
  9232. CallThis(position,"Heaps","Assign",2);
  9233. ELSIF leftType.IsRecordType() THEN
  9234. Designate(right,rightO);
  9235. Designate(left,leftO);
  9236. Emit(Push(position,leftO.op));
  9237. Emit(Push(position,leftO.tag)); (* type desc *)
  9238. ReleaseOperand(leftO);
  9239. Emit(Push(position,rightO.op));
  9240. ReleaseOperand(rightO);
  9241. CallThis(position,"Heaps","AssignRecord",3);
  9242. ELSIF IsStaticArray(leftType) THEN
  9243. size := StaticArrayNumElements(leftType);
  9244. base := StaticArrayBaseType(leftType);
  9245. Designate(right,rightO);
  9246. Designate(left,leftO);
  9247. Emit(Push(position,leftO.op));
  9248. ReleaseOperand(leftO);
  9249. arg := TypeDescriptorAdr(base);
  9250. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9251. Emit(Push(position,arg));
  9252. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9253. Emit(Push(position,rightO.op));
  9254. ReleaseOperand(rightO);
  9255. CallThis(position,"Heaps","AssignArray",4);
  9256. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9257. size := StaticMathArrayNumElements(leftType);
  9258. base := StaticMathArrayBaseType(leftType);
  9259. Designate(right,rightO);
  9260. Designate(left,leftO);
  9261. Emit(Push(position,leftO.op));
  9262. ReleaseOperand(leftO);
  9263. arg := TypeDescriptorAdr(base);
  9264. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9265. Emit(Push(position,arg));
  9266. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9267. Emit(Push(position,rightO.op));
  9268. ReleaseOperand(rightO);
  9269. CallThis(position,"Heaps","AssignArray",4);
  9270. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9271. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9272. Evaluate(right,rightO);
  9273. Designate(left,leftO);
  9274. MakeMemory(mem,leftO.op,addressType,0);
  9275. Emit(Mov(position,mem,rightO.op));
  9276. ReleaseIntermediateOperand(mem);
  9277. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9278. Emit (Push(position, leftO.tag));
  9279. ReleaseOperand(leftO);
  9280. Emit (Push(position, rightO.tag));
  9281. ReleaseOperand(rightO);
  9282. CallThis(position,"Heaps","Assign", 2);
  9283. ELSE HALT(100); (* missing ? *)
  9284. END;
  9285. RestoreRegisters(saved);
  9286. RETURN;
  9287. END;
  9288. IF CanPassAsResultParameter(right) THEN
  9289. procedureResultDesignator := left(SyntaxTree.Designator);
  9290. Expression(right);
  9291. procedureResultDesignator := NIL;
  9292. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9293. (* left <-- ALIAS OF right: zerocopy *)
  9294. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9295. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9296. designator.SetType(procedure.type);
  9297. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9298. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9299. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9300. END;
  9301. ELSIF leftType IS SyntaxTree.RangeType THEN
  9302. (* LHS is of array range type *)
  9303. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9304. Evaluate(right, rightO);
  9305. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9306. (* first *)
  9307. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9308. Emit(Mov(position,mem, rightO.op));
  9309. ReleaseIntermediateOperand(mem);
  9310. (* last *)
  9311. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9312. Emit(Mov(position,mem, rightO.tag));
  9313. ReleaseIntermediateOperand(mem);
  9314. (* step *)
  9315. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9316. Emit(Mov(position,mem, rightO.extra));
  9317. ReleaseIntermediateOperand(mem);
  9318. ReleaseOperand(rightO);
  9319. ReleaseOperand(leftO)
  9320. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9321. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9322. Evaluate(right, rightO);
  9323. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9324. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9325. (* real part *)
  9326. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9327. Emit(Mov(position,mem, rightO.op));
  9328. ReleaseIntermediateOperand(mem);
  9329. (* imaginary part *)
  9330. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9331. Emit(Mov(position,mem, rightO.tag));
  9332. ReleaseIntermediateOperand(mem);
  9333. ReleaseOperand(rightO);
  9334. ReleaseOperand(leftO)
  9335. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9336. OR (leftType IS SyntaxTree.PortType) THEN
  9337. (* rightO := leftO;*)
  9338. Evaluate(right,rightO);
  9339. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9340. Designate(left,leftO);
  9341. IF leftO.mode = ModeReference THEN
  9342. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9343. destination := mem;
  9344. ELSE
  9345. destination := leftO.op;
  9346. END;
  9347. ReleaseOperand(leftO);
  9348. IF destination.mode # IntermediateCode.Undefined THEN
  9349. Emit(Mov(position,destination,rightO.op));
  9350. END;
  9351. ReleaseOperand(rightO);
  9352. ReleaseIntermediateOperand(mem);
  9353. IntermediateCode.InitOperand(destination);
  9354. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9355. Evaluate(right,rightO);
  9356. Designate(left,leftO);
  9357. MakeMemory(mem,leftO.op,addressType,0);
  9358. Emit(Mov(position,mem,rightO.op));
  9359. ReleaseIntermediateOperand(mem);
  9360. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9361. (* delegate *)
  9362. (*
  9363. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9364. *)
  9365. Emit(Mov(position,leftO.tag,rightO.tag));
  9366. END;
  9367. ReleaseOperand(leftO);
  9368. ReleaseOperand(rightO);
  9369. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9370. Designate(right,rightO);
  9371. Designate(left,leftO);
  9372. sizeOp := CopySize(left, leftO.tag);
  9373. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9374. ReleaseIntermediateOperand(sizeOp);
  9375. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9376. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9377. IF (rightType IS SyntaxTree.StringType) THEN
  9378. CopyString(left,right);
  9379. 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
  9380. Designate(right,rightO);
  9381. Designate(left,leftO);
  9382. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9383. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9384. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9385. ELSE
  9386. HALT(201)
  9387. END;
  9388. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9389. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9390. Designate(right,rightO);
  9391. Designate(left,leftO);
  9392. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9393. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9394. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9395. ELSE
  9396. AssignMathArray(left,right);
  9397. END;
  9398. ELSE
  9399. HALT(200);
  9400. END;
  9401. END Assign;
  9402. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9403. BEGIN
  9404. IF Trace THEN TraceEnter("VisitAssignment") END;
  9405. Assign(x.left,x.right);
  9406. IF Trace THEN TraceExit("VisitAssignment") END;
  9407. END VisitAssignment;
  9408. PROCEDURE EmitCooperativeSwitch;
  9409. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9410. BEGIN
  9411. ASSERT (cooperativeSwitches);
  9412. pc := section.pc;
  9413. IF lastSwitchPC = section.pc THEN RETURN END;
  9414. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9415. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9416. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9417. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9418. INC(statCoopSwitch, section.pc - pc);
  9419. END EmitCooperativeSwitch;
  9420. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9421. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9422. BEGIN
  9423. p0 := communication.left; p1 := communication.right;
  9424. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9425. Evaluate(p0,s0);
  9426. Evaluate(p1,s1);
  9427. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9428. Emit(Push(position,s0.op));
  9429. Emit(Push(position,s1.op));
  9430. (*
  9431. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9432. *)
  9433. IF ~backend.cellsAreObjects THEN
  9434. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9435. END;
  9436. ReleaseOperand(s0);
  9437. ReleaseOperand(s1);
  9438. IF backend.cellsAreObjects THEN
  9439. CallThis(position,"ActiveCellsRuntime","Send",2);
  9440. ELSE
  9441. CallThis(position,ChannelModuleName,"Send",2);
  9442. END;
  9443. (* ----- RECEIVE ------*)
  9444. ELSE
  9445. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9446. tmp := p0; p0 := p1; p1 := tmp;
  9447. END;
  9448. Evaluate(p0,s0);
  9449. Emit(Push(position,s0.op));
  9450. Designate(p1,s1);
  9451. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9452. Emit(Push(position,s1.op));
  9453. (*
  9454. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9455. *)
  9456. IF ~backend.cellsAreObjects THEN
  9457. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9458. END;
  9459. ReleaseOperand(s0);
  9460. ReleaseOperand(s1);
  9461. IF backend.cellsAreObjects THEN
  9462. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9463. ELSE
  9464. CallThis(position,ChannelModuleName,"Receive",2)
  9465. END;
  9466. END;
  9467. END VisitCommunicationStatement;
  9468. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9469. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9470. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9471. VAR true, false: Label; condition, value: BOOLEAN;
  9472. BEGIN
  9473. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9474. IF condition THEN
  9475. true := NewLabel();
  9476. false := NewLabel();
  9477. Condition(if.condition,true,false);
  9478. SetLabel(true);
  9479. StatementSequence(if.statements);
  9480. BrL(end);
  9481. SetLabel(false);
  9482. ELSE
  9483. IF value THEN (* always true *)
  9484. escape := TRUE;
  9485. StatementSequence(if.statements);
  9486. (* no branch necessary -- rest skipped *)
  9487. END;
  9488. END;
  9489. END IfPart;
  9490. BEGIN
  9491. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9492. end := NewLabel();
  9493. elsifs := x.ElsifParts();
  9494. IfPart(x.ifPart);
  9495. FOR i := 0 TO elsifs-1 DO
  9496. IF ~escape THEN
  9497. elsif := x.GetElsifPart(i);
  9498. IfPart(elsif);
  9499. END;
  9500. END;
  9501. IF (x.elsePart # NIL) & ~escape THEN
  9502. StatementSequence(x.elsePart);
  9503. END;
  9504. SetLabel(end);
  9505. IF Trace THEN TraceExit("VisitIfStatement") END;
  9506. END VisitIfStatement;
  9507. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9508. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9509. BEGIN
  9510. (*IF x.variable.type.resolved = x.type.resolved THEN
  9511. (* always true, do nothing *)
  9512. ELSE*)
  9513. Designate(x.variable,res);
  9514. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9515. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9516. END;
  9517. trueL := NewLabel();
  9518. TypeTest(res.tag,x.type,trueL,falseL);
  9519. ReleaseOperand(res);
  9520. SetLabel(trueL);
  9521. StatementSequence(x.statements);
  9522. BrL(endL);
  9523. END WithPart;
  9524. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9525. VAR endL,falseL: Label;i: LONGINT;
  9526. BEGIN
  9527. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9528. endL := NewLabel();
  9529. FOR i := 0 TO x.WithParts()-1 DO
  9530. falseL := NewLabel();
  9531. WithPart(x.GetWithPart(i),falseL,endL);
  9532. SetLabel(falseL);
  9533. END;
  9534. IF x.elsePart = NIL THEN
  9535. IF ~isUnchecked THEN
  9536. EmitTrap(position,WithTrap);
  9537. END;
  9538. ELSE
  9539. StatementSequence(x.elsePart)
  9540. END;
  9541. SetLabel(endL);
  9542. IF Trace THEN TraceExit("VisitWithStatement") END;
  9543. END VisitWithStatement;
  9544. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9545. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9546. out,else: Label; label: Label;
  9547. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9548. symbol: SyntaxTree.Symbol;
  9549. BEGIN
  9550. (*! split case statement into if-elsif statements for large case label lists *)
  9551. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9552. size := x.max-x.min+1;
  9553. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9554. END;
  9555. Evaluate(x.variable,var);
  9556. ReuseCopy(tmp,var.op);
  9557. ReleaseIntermediateOperand(var.op);
  9558. var.op := tmp;
  9559. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9560. Convert(var.op,addressType);
  9561. size := x.max-x.min+1;
  9562. else := NewLabel();
  9563. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9564. (*
  9565. UniqueId(name,module.module,"case",caseId);
  9566. *)
  9567. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9568. Global.GetModuleSegmentedName(module.module, name);
  9569. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9570. symbol := SyntaxTree.NewSymbol(name[1]);
  9571. symbol.SetScope(moduleScope);
  9572. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9573. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9574. section.isCaseTable := TRUE;
  9575. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9576. ReuseCopy(res,var.op);
  9577. ReleaseOperand(var);
  9578. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9579. Emit(Add(position,res,res,jmp));
  9580. IntermediateCode.MakeMemory(res,addressType);
  9581. Emit(Br(position,res));
  9582. ReleaseIntermediateOperand(res);
  9583. out := NewLabel();
  9584. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9585. part := x.GetCasePart(i);
  9586. constant := part.firstConstant;
  9587. label := NewLabel();
  9588. SetLabel(label);
  9589. WHILE(constant # NIL) DO (* case labels for this case part *)
  9590. FOR j := constant.min TO constant.max DO
  9591. fixups[j-x.min] := label;
  9592. END;
  9593. constant := constant.next;
  9594. END;
  9595. StatementSequence(part.statements);
  9596. BrL(out);
  9597. END;
  9598. SetLabel(else);
  9599. FOR i := 0 TO size-1 DO
  9600. IF fixups[i] = NIL THEN
  9601. fixups[i] := else;
  9602. END;
  9603. END;
  9604. IF x.elsePart # NIL THEN
  9605. StatementSequence(x.elsePart);
  9606. ELSIF ~isUnchecked THEN
  9607. EmitTrap(position,CaseTrap);
  9608. END;
  9609. SetLabel(out);
  9610. FOR i := 0 TO size-1 DO
  9611. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9612. section.Emit(Data(position,op));
  9613. END;
  9614. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9615. END VisitCaseStatement;
  9616. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9617. VAR start: Label; true,false: Label;
  9618. BEGIN
  9619. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9620. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9621. start := NewLabel();
  9622. true := NewLabel();
  9623. false := NewLabel();
  9624. SetLabel(start);
  9625. Condition(x.condition,true,false);
  9626. SetLabel(true);
  9627. StatementSequence(x.statements);
  9628. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9629. BrL(start);
  9630. SetLabel(false);
  9631. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9632. END VisitWhileStatement;
  9633. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9634. VAR false,true: Label;
  9635. BEGIN
  9636. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9637. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9638. true := NewLabel();
  9639. false := NewLabel();
  9640. SetLabel(false);
  9641. StatementSequence(x.statements);
  9642. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9643. Condition(x.condition,true,false);
  9644. SetLabel(true);
  9645. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9646. END VisitRepeatStatement;
  9647. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9648. VAR
  9649. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9650. temporaryVariable: SyntaxTree.Variable;
  9651. temporaryVariableDesignator : SyntaxTree.Designator;
  9652. BEGIN
  9653. IF Trace THEN TraceEnter("VisitForStatement") END;
  9654. true := NewLabel();
  9655. false := NewLabel();
  9656. start := NewLabel();
  9657. Assign(x.variable,x.from);
  9658. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9659. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9660. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9661. Assign(temporaryVariableDesignator,x.to);
  9662. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9663. IF by > 0 THEN
  9664. cmp := Scanner.LessEqual
  9665. ELSE
  9666. cmp := Scanner.GreaterEqual
  9667. END;
  9668. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9669. binary.SetType(system.booleanType);
  9670. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9671. SetLabel(start);
  9672. Condition(binary,true,false);
  9673. SetLabel(true);
  9674. StatementSequence(x.statements);
  9675. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9676. binary.SetType(x.variable.type);
  9677. Assign(x.variable,binary);
  9678. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9679. BrL(start);
  9680. SetLabel(false);
  9681. IF Trace THEN TraceExit("VisitForStatement") END;
  9682. END VisitForStatement;
  9683. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9684. VAR prevLoop: Label;
  9685. BEGIN
  9686. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9687. prevLoop := currentLoop;
  9688. currentLoop := NewLabel();
  9689. StatementSequence(x.statements);
  9690. SetLabel(currentLoop);
  9691. currentLoop := prevLoop;
  9692. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9693. END VisitExitableBlock;
  9694. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9695. VAR prevLoop,start: Label;
  9696. BEGIN
  9697. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9698. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9699. start := NewLabel();
  9700. prevLoop := currentLoop;
  9701. SetLabel(start);
  9702. currentLoop := NewLabel();
  9703. StatementSequence(x.statements);
  9704. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9705. BrL(start);
  9706. SetLabel(currentLoop);
  9707. currentLoop := prevLoop;
  9708. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9709. END VisitLoopStatement;
  9710. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9711. VAR outer: SyntaxTree.Statement;
  9712. BEGIN
  9713. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9714. IF locked THEN (* r if we jump out of an exclusive block *)
  9715. outer := x.outer;
  9716. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9717. outer := outer.outer;
  9718. END;
  9719. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9720. Lock(FALSE);
  9721. END;
  9722. END;
  9723. BrL(currentLoop);
  9724. IF Trace THEN TraceExit("VisitExitStatement") END;
  9725. END VisitExitStatement;
  9726. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9727. VAR
  9728. expression, parameterDesignator: SyntaxTree.Expression;
  9729. type, componentType: SyntaxTree.Type;
  9730. res, right: Operand;
  9731. left, mem, reg: IntermediateCode.Operand;
  9732. parameter: SyntaxTree.Parameter;
  9733. procedure: SyntaxTree.Procedure;
  9734. procedureType: SyntaxTree.ProcedureType;
  9735. returnTypeOffset: LONGINT;
  9736. delegate: BOOLEAN;
  9737. map: SymbolMap;
  9738. cc, parametersSize: LONGINT;
  9739. BEGIN
  9740. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9741. expression := x.returnValue;
  9742. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9743. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9744. IF currentIsInline THEN
  9745. IF expression # NIL THEN
  9746. map := currentMapper.Get(NIL);
  9747. IF map # NIL THEN
  9748. Assign(map.to, expression);
  9749. ELSE
  9750. Evaluate(expression,res);
  9751. Emit(Return(position,res.op));
  9752. ReleaseOperand(res);
  9753. END;
  9754. END;
  9755. BrL(currentInlineExit);
  9756. RETURN;
  9757. END;
  9758. IF expression # NIL THEN
  9759. type := expression.type.resolved;
  9760. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9761. IF locked THEN Lock(FALSE) END;
  9762. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9763. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9764. 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
  9765. (* return without structured return parameter *)
  9766. Evaluate(expression,res);
  9767. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9768. IF locked OR profile THEN
  9769. Emit(Push(position,res.op));
  9770. IF delegate THEN HALT(200) END;
  9771. ReleaseOperand(res);
  9772. IF locked THEN Lock(FALSE) END;
  9773. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9774. reg := NewRegisterOperand(res.op.type);
  9775. Emit(Pop(position,reg));
  9776. Emit(Return(position,reg));
  9777. ReleaseIntermediateOperand(reg);
  9778. ELSE
  9779. Emit(Return(position,res.op));
  9780. ReleaseOperand(res);
  9781. END;
  9782. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9783. THEN
  9784. (* return using structured return parameter *)
  9785. 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)
  9786. OR SemanticChecker.IsPointerType(type));
  9787. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9788. parameter :=procedureType.returnParameter;
  9789. ASSERT(parameter # NIL);
  9790. returnTypeOffset := parameter.offsetInBits;
  9791. (*
  9792. IF parameter# NIL THEN
  9793. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9794. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9795. ELSE
  9796. returnTypeOffset := system.offsetFirstParameter
  9797. END;
  9798. *)
  9799. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9800. IF type IS SyntaxTree.RangeType THEN
  9801. (* array range type *)
  9802. Evaluate(expression, right);
  9803. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9804. Emit(Mov(position,mem, right.op)); (* first *)
  9805. ReleaseIntermediateOperand(mem);
  9806. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9807. Emit(Mov(position,mem, right.tag)); (* last *)
  9808. ReleaseIntermediateOperand(mem);
  9809. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9810. Emit(Mov(position,mem, right.extra)); (* step *)
  9811. ReleaseIntermediateOperand(mem);
  9812. ReleaseOperand(right);
  9813. ELSIF type IS SyntaxTree.ComplexType THEN
  9814. Evaluate(expression, right);
  9815. componentType := type(SyntaxTree.ComplexType).componentType;
  9816. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9817. Emit(Mov(position,mem, right.op)); (* real part *)
  9818. ReleaseIntermediateOperand(mem);
  9819. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9820. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9821. ReleaseIntermediateOperand(mem);
  9822. ReleaseOperand(right);
  9823. ELSE (* covers cases: pointer / record / array *)
  9824. parameter := procedureType.returnParameter;
  9825. checker.SetCurrentScope(currentScope);
  9826. ASSERT(parameter # NIL);
  9827. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9828. Assign(parameterDesignator,expression);
  9829. END;
  9830. ReleaseIntermediateOperand(left);
  9831. IF locked THEN Lock(FALSE) END;
  9832. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9833. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9834. parameter := procedureType.returnParameter;
  9835. checker.SetCurrentScope(currentScope);
  9836. IF parameter = NIL THEN
  9837. Error(procedure.position, "structured return of parameter of procedure not found");
  9838. ELSE
  9839. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9840. Assign(parameterDesignator,expression);
  9841. END;
  9842. IF locked THEN Lock(FALSE) END;
  9843. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9844. ELSE
  9845. HALT(200);
  9846. END;
  9847. ELSE
  9848. IF locked THEN Lock(FALSE) END;
  9849. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9850. END;
  9851. IF backend.cooperative THEN
  9852. BrL(exitLabel);
  9853. ELSE
  9854. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9855. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9856. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9857. ELSE
  9858. parametersSize := 0;
  9859. END;
  9860. EmitLeave(section, position,procedure, procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9861. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention, parametersSize));
  9862. END;
  9863. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9864. END VisitReturnStatement;
  9865. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9866. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9867. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9868. statements: SyntaxTree.StatementSequence;
  9869. name, suffix: SyntaxTree.IdentifierString;
  9870. BEGIN
  9871. Strings.IntToStr(awaitProcCounter,suffix);
  9872. Strings.Concat("@AwaitProcedure",suffix,name);
  9873. identifier := SyntaxTree.NewIdentifier(name);
  9874. INC(awaitProcCounter);
  9875. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9876. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9877. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9878. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9879. procedure.SetAccess(SyntaxTree.Hidden);
  9880. procedure.SetScope(currentScope);
  9881. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9882. procedureType.SetReturnType(system.booleanType);
  9883. procedure.SetType(procedureType);
  9884. body := SyntaxTree.NewBody(x.position,procedureScope);
  9885. procedureScope.SetBody(body);
  9886. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9887. returnStatement.SetReturnValue(x.condition);
  9888. statements := SyntaxTree.NewStatementSequence();
  9889. statements.AddStatement(returnStatement);
  9890. body.SetStatementSequence(statements);
  9891. currentScope.AddProcedure(procedure);
  9892. RETURN procedure
  9893. END MakeAwaitProcedure;
  9894. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  9895. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9896. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9897. BEGIN
  9898. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9899. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9900. IF backend.cooperative THEN
  9901. start := NewLabel();
  9902. true := NewLabel();
  9903. false := NewLabel();
  9904. SetLabel(start);
  9905. Condition(x.condition,true,false);
  9906. SetLabel(false);
  9907. PushSelfPointer();
  9908. CallThis(position,"ExclusiveBlocks","Await",1);
  9909. BrL(start);
  9910. SetLabel(true);
  9911. PushSelfPointer();
  9912. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9913. ELSE
  9914. proc := MakeAwaitProcedure(x);
  9915. Emit(Push(position,fp));
  9916. GetCodeSectionNameForSymbol(proc,name);
  9917. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9918. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9919. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9920. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9921. Emit(Result(position,res));
  9922. (*
  9923. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9924. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9925. *)
  9926. InitOperand(result,ModeValue);
  9927. result.op := res;
  9928. label := NewLabel();
  9929. BreqL(label, result.op, SELF.true);
  9930. ReleaseOperand(result);
  9931. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9932. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9933. Emit(Push(position,res));
  9934. Emit(Push(position,fp));
  9935. PushSelfPointer();
  9936. Emit(Push(position,nil));
  9937. CallThis(position,"Objects","Await",4);
  9938. SetLabel(label);
  9939. END;
  9940. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9941. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9942. END VisitAwaitStatement;
  9943. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9944. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9945. BEGIN
  9946. FOR i := 0 TO x.Length() - 1 DO
  9947. statement := x.GetStatement( i );
  9948. Statement(statement);
  9949. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9950. END;
  9951. END StatementSequence;
  9952. PROCEDURE PushSelfPointer;
  9953. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  9954. procedureType: SyntaxTree.ProcedureType;
  9955. BEGIN
  9956. scope := currentScope;
  9957. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9958. scope := scope.outerScope;
  9959. END;
  9960. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9961. IF ~newObjectFile THEN
  9962. Symbol(moduleSelf,op);
  9963. IntermediateCode.MakeMemory(op.op,addressType);
  9964. ELSE
  9965. moduleSection := meta.ModuleSection();
  9966. IF backend.cooperative THEN
  9967. moduleOffset := 0;
  9968. ELSE
  9969. moduleOffset := moduleSection.pc;
  9970. END;
  9971. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9972. END;
  9973. ELSE
  9974. GetBaseRegister(op.op,currentScope,scope);
  9975. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9976. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9977. parametersSize := ProcedureParametersSize(system,procedure);
  9978. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9979. IF backend.cooperative THEN
  9980. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9981. END;
  9982. IntermediateCode.MakeMemory(op.op,addressType);
  9983. END;
  9984. Emit(Push(position,op.op));
  9985. ReleaseOperand(op);
  9986. END PushSelfPointer;
  9987. PROCEDURE Lock(lock: BOOLEAN);
  9988. BEGIN
  9989. IF Trace THEN TraceEnter("Lock") END;
  9990. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9991. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9992. ASSERT(modifyAssignmentCounter = 0);
  9993. IF dump # NIL THEN
  9994. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9995. dump.Ln;dump.Update;
  9996. END;
  9997. PushSelfPointer;
  9998. IF backend.cooperative THEN
  9999. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10000. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10001. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10002. END;
  10003. ELSE
  10004. Emit(Push(position,true));
  10005. IF lock THEN CallThis(position,"Objects","Lock",2)
  10006. ELSE CallThis(position,"Objects","Unlock",2);
  10007. END;
  10008. END;
  10009. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10010. IF Trace THEN TraceExit("Lock") END;
  10011. END Lock;
  10012. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10013. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10014. BEGIN
  10015. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10016. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10017. previouslyUnchecked := isUnchecked;
  10018. isUnchecked := isUnchecked OR x.isUnchecked;
  10019. previouslyCooperativeSwitches := cooperativeSwitches;
  10020. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10021. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10022. IF x.statements # NIL THEN
  10023. StatementSequence(x.statements);
  10024. END;
  10025. IF (x IS SyntaxTree.Body) THEN
  10026. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10027. section.SetFinally(section.pc);
  10028. StatementSequence(x(SyntaxTree.Body).finally)
  10029. ELSIF x.isExclusive THEN
  10030. end := NewLabel();
  10031. BrL(end);
  10032. section.SetFinally(section.pc);
  10033. Lock(FALSE);
  10034. EmitTrap(position,RethrowTrap);
  10035. SetLabel(end);
  10036. END;
  10037. END;
  10038. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10039. isUnchecked := previouslyUnchecked;
  10040. cooperativeSwitches := previouslyCooperativeSwitches;
  10041. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10042. END VisitStatementBlock;
  10043. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10044. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10045. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10046. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10047. procedure: SyntaxTree.Procedure;
  10048. map: SymbolMap;
  10049. cc, parametersSize: LONGINT;
  10050. BEGIN
  10051. scope := currentScope;
  10052. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10053. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10054. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10055. return := emptyOperand;
  10056. IF Trace THEN TraceEnter("VisitCode") END;
  10057. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10058. NEW(in, x.inRules.Length());
  10059. FOR i := 0 TO LEN(in)-1 DO
  10060. statement := x.inRules.GetStatement(i);
  10061. WITH statement: SyntaxTree.Assignment DO
  10062. Evaluate(statement.right, operand);
  10063. result := operand.op;
  10064. NEW(str, 64);
  10065. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10066. in[i] := result; IntermediateCode.SetString(in[i], str);
  10067. ReleaseIntermediateOperand(operand.tag);
  10068. END;
  10069. END;
  10070. ELSE in := NIL
  10071. END;
  10072. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10073. NEW(out, x.outRules.Length());
  10074. FOR i := 0 TO LEN(out)-1 DO
  10075. statement := x.outRules.GetStatement(i);
  10076. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10077. WITH statement: SyntaxTree.Assignment DO
  10078. Designate(statement.left, operand);
  10079. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10080. NEW(str, 64);
  10081. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10082. out[i] := result; IntermediateCode.SetString(out[i], str);
  10083. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10084. |statement: SyntaxTree.ReturnStatement DO
  10085. NEW(str, 64);
  10086. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10087. IF currentIsInline THEN
  10088. map := currentMapper.Get(NIL);
  10089. Designate(map.to, operand);
  10090. IF map.isAddress THEN
  10091. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10092. ELSE
  10093. result := operand.op;
  10094. END;
  10095. (*! only if it does not fit into register
  10096. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10097. *)
  10098. (*Evaluate(map.to, operand);*)
  10099. out[i] := result;
  10100. ELSE
  10101. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10102. END;
  10103. IntermediateCode.SetString(out[i], str);
  10104. ReleaseIntermediateOperand(operand.tag);
  10105. return := out[i];
  10106. ELSE
  10107. END;
  10108. END;
  10109. ELSE out := NIL
  10110. END;
  10111. Emit(Asm(x.position,x.sourceCode, in, out));
  10112. IF in # NIL THEN
  10113. FOR i := 0 TO LEN(in)-1 DO
  10114. ReleaseIntermediateOperand(in[i]);
  10115. END;
  10116. END;
  10117. IF out # NIL THEN
  10118. FOR i := 0 TO LEN(out)-1 DO
  10119. WITH statement: SyntaxTree.Assignment DO
  10120. ReleaseIntermediateOperand(out[i]);
  10121. |statement: SyntaxTree.ReturnStatement DO
  10122. (* release happens below *)
  10123. ELSE
  10124. END;
  10125. statement := x.outRules.GetStatement(i);
  10126. END;
  10127. END;
  10128. IF return.mode # IntermediateCode.Undefined THEN
  10129. IF currentIsInline THEN
  10130. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10131. Symbol(procedureType.returnParameter, par);
  10132. MakeMemory(mem, par.op, return.type, 0);
  10133. ReleaseOperand(par);
  10134. Emit(Mov(position, mem, return));
  10135. ReleaseIntermediateOperand(mem);
  10136. ELSE
  10137. Emit(Return(position,return));
  10138. END;
  10139. ReleaseIntermediateOperand(return);
  10140. IF currentIsInline THEN RETURN END;
  10141. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10142. IF cc = SyntaxTree.WinAPICallingConvention THEN
  10143. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10144. ELSE
  10145. parametersSize := 0;
  10146. END;
  10147. EmitLeave(section, position,procedure, cc);
  10148. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,cc, parametersSize));
  10149. END;
  10150. IF Trace THEN TraceExit("VisitCode") END;
  10151. END VisitCode;
  10152. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10153. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10154. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10155. const, call: IntermediateCode.Operand;
  10156. parameterDesignator: SyntaxTree.Expression;
  10157. saved: RegisterEntry;
  10158. name: Basic.SegmentedName;
  10159. BEGIN
  10160. IF Trace THEN TraceEnter("ParameterCopies") END;
  10161. parameter := x.firstParameter;
  10162. WHILE parameter # NIL DO
  10163. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10164. type := parameter.type.resolved;
  10165. IF IsOpenArray(type) THEN
  10166. VisitParameter(parameter);
  10167. op := result;
  10168. IF backend.cooperative & parameter.NeedsTrace() THEN
  10169. length := GetArrayLength(type, op.tag);
  10170. size := NewRegisterOperand(addressType);
  10171. base := ArrayBaseType(type);
  10172. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10173. Emit(Mul(position, size, length, const));
  10174. dst := NewRegisterOperand (addressType);
  10175. Emit(Mov(position, dst, size));
  10176. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10177. Emit(Sub(position,dst,sp,dst));
  10178. Emit(And(position,dst,dst,const));
  10179. Emit(Mov(position,sp,dst));
  10180. par := fp;
  10181. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10182. IntermediateCode.InitImmediate(null, byteType, 0);
  10183. Emit(Fill(position, dst, size, null));
  10184. ReleaseIntermediateOperand(dst);
  10185. ReleaseIntermediateOperand(length);
  10186. SaveRegisters();ReleaseUsedRegisters(saved);
  10187. (* register dst has been freed before SaveRegisters already *)
  10188. base := ArrayBaseType(type);
  10189. (* assign method of open array *)
  10190. IF base.IsRecordType() THEN
  10191. Emit (Push(position, length));
  10192. Emit (Push(position, dst));
  10193. Emit (Push(position, op.op));
  10194. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10195. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10196. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10197. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10198. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10199. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10200. Emit (Push(position,length));
  10201. Emit (Push(position, dst));
  10202. Emit (Push(position, length));
  10203. Emit (Push(position, op.op));
  10204. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10205. ELSE
  10206. Emit (Push(position, length));
  10207. Emit (Push(position, dst));
  10208. Emit (Push(position, length));
  10209. Emit (Push(position, op.op));
  10210. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10211. ASSERT(ArrayBaseType(type).IsPointer());
  10212. END;
  10213. RestoreRegisters(saved);
  10214. ELSE
  10215. temp := GetDynamicSize(type,op.tag);
  10216. ReuseCopy(size,temp);
  10217. ReleaseIntermediateOperand(temp);
  10218. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10219. Emit(Sub(position,size,sp,size));
  10220. Emit(And(position,size,size,const));
  10221. Emit(Mov(position,sp,size));
  10222. par := fp;
  10223. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10224. ReleaseIntermediateOperand(size);
  10225. size := GetDynamicSize(type,op.tag);
  10226. END;
  10227. Emit(Copy(position,sp,op.op,size));
  10228. ReleaseIntermediateOperand(size);
  10229. ReleaseOperand(op);
  10230. IntermediateCode.MakeMemory(par,addressType);
  10231. Emit(Mov(position,par,sp));
  10232. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10233. checker.SetCurrentScope(currentScope);
  10234. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10235. Assign(parameterDesignator,parameterDesignator);
  10236. END;
  10237. END;
  10238. parameter := parameter.nextParameter;
  10239. END;
  10240. IF Trace THEN TraceExit("ParameterCopies") END;
  10241. END ParameterCopies;
  10242. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10243. VAR x: SyntaxTree.Variable;
  10244. BEGIN
  10245. x := scope.firstVariable;
  10246. WHILE x # NIL DO
  10247. InitVariable(x,FALSE);
  10248. x := x.nextVariable;
  10249. END;
  10250. END InitVariables;
  10251. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10252. BEGIN
  10253. IF (symbol # NIL) THEN
  10254. RETURN fingerPrinter.SymbolFP(symbol).public
  10255. ELSE
  10256. RETURN 0
  10257. END;
  10258. END GetFingerprint;
  10259. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10260. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10261. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10262. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10263. name: Basic.SegmentedName;
  10264. offset: LONGINT;
  10265. BEGIN
  10266. IF Trace THEN TraceEnter("Body") END;
  10267. ReleaseUsedRegisters(saved); (* just in case ... *)
  10268. section := ir;
  10269. exitLabel := NewLabel ();
  10270. IF moduleBody THEN moduleBodySection := section END;
  10271. IF ir.comments # NIL THEN
  10272. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10273. commentPrintout.SingleStatement(TRUE);
  10274. dump := ir.comments;
  10275. ELSE
  10276. commentPrintout := NIL;
  10277. dump := NIL;
  10278. END;
  10279. prevScope := currentScope;
  10280. currentScope := scope;
  10281. lastSwitchPC := 0;
  10282. cooperativeSwitches := backend.cooperative;
  10283. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10284. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10285. IF x # NIL THEN
  10286. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10287. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10288. IF moduleBody THEN
  10289. ProfilerInit();
  10290. ELSE
  10291. Basic.SegmentedNameToString(ir.name, string);
  10292. ProfilerAddProcedure(numberProcedures,string);
  10293. ProfilerEnterExit(numberProcedures,TRUE);
  10294. END;
  10295. END;
  10296. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10297. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10298. END;
  10299. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10300. IF moduleBody & ~newObjectFile THEN
  10301. InitVariables(moduleScope)
  10302. END;
  10303. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10304. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10305. IF procedure = cellScope.bodyProcedure THEN
  10306. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10307. StaticCallOperand(op, cellScope.constructor);
  10308. Emit(Call(position,op.op,0));
  10309. END;
  10310. END;
  10311. END;
  10312. InitVariables(scope);
  10313. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10314. GetCodeSectionNameForSymbol(procedure, name);
  10315. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10316. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10317. IF ProtectModulesPointers THEN
  10318. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10319. ELSE
  10320. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10321. END;
  10322. IntermediateCode.SetOffset(right,offset); (* tag *)
  10323. IntermediateCode.InitMemory(left,addressType,fp,0);
  10324. Emit(Mov(position, left, right));
  10325. END;
  10326. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10327. ParameterCopies(procedureType);
  10328. IF x.code = NIL THEN
  10329. VisitStatementBlock(x);
  10330. ELSE
  10331. VisitCode(x.code)
  10332. END;
  10333. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10334. IF ~backend.cooperative THEN
  10335. ProfilerEnterExit(numberProcedures,FALSE);
  10336. END;
  10337. INC(numberProcedures);
  10338. END;
  10339. END;
  10340. IF backend.cooperative THEN
  10341. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10342. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10343. END;
  10344. IF x # NIL THEN
  10345. SELF.position := x.position;
  10346. END;
  10347. CheckRegistersFree();
  10348. ASSERT(modifyAssignmentCounter = 0);
  10349. currentScope := prevScope;
  10350. IF Trace THEN TraceExit("Body") END;
  10351. END Body;
  10352. END ImplementationVisitor;
  10353. MetaDataGenerator=OBJECT
  10354. VAR
  10355. implementationVisitor: ImplementationVisitor;
  10356. declarationVisitor: DeclarationVisitor;
  10357. module: Sections.Module;
  10358. moduleName: ARRAY 128 OF CHAR;
  10359. moduleNamePool: Basic.HashTableInt;
  10360. moduleNamePoolSection: IntermediateCode.Section;
  10361. modulePointerSection: IntermediateCode.Section;
  10362. modulePointerSizePC: LONGINT;
  10363. modulePointerSectionOffset: LONGINT;
  10364. modulePointers: LONGINT;
  10365. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  10366. RecordBaseOffset: LONGINT;
  10367. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10368. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10369. TypeTags: LONGINT; (* type extension level support *)
  10370. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10371. patchInfoPC: LONGINT;
  10372. patchCRC: LONGINT;
  10373. CONST
  10374. EmptyBlockOffset = 2;
  10375. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10376. BEGIN
  10377. IF implementationVisitor.backend.cooperative THEN
  10378. TypeTags := MAX(LONGINT);
  10379. BaseTypesTableOffset := 0;
  10380. MethodTableOffset := 2;
  10381. TypeRecordBaseOffset := 0;
  10382. RecordBaseOffset := 0;
  10383. ELSIF simple THEN
  10384. TypeTags := 3; (* only 3 extensions allowed *)
  10385. BaseTypesTableOffset := 1;
  10386. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10387. TypeRecordBaseOffset := 0;
  10388. RecordBaseOffset := 1;
  10389. ELSE
  10390. TypeTags := 16;
  10391. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10392. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10393. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10394. (* change this when Heaps.HeapBlock is modified *)
  10395. RecordBaseOffset := 8;
  10396. END;
  10397. SELF.simple := simple;
  10398. SELF.implementationVisitor := implementationVisitor;
  10399. SELF.declarationVisitor := declarationVisitor;
  10400. implementationVisitor.meta := SELF;
  10401. declarationVisitor.meta := SELF;
  10402. END InitMetaDataGenerator;
  10403. PROCEDURE SetModule(module: Sections.Module);
  10404. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10405. BEGIN
  10406. SELF.module := module;
  10407. Global.GetModuleName(module.module,moduleName);
  10408. Global.GetSymbolSegmentedName(module.module, name);
  10409. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10410. NEW(moduleNamePool, 32);
  10411. (*! require GC protection *)
  10412. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10413. IF ProtectModulesPointers THEN
  10414. name := "Heaps.AnyPtr";
  10415. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10416. (* set base pointer *)
  10417. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10418. END;
  10419. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10420. modulePointers := 0;
  10421. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10422. AddPointer(moduleNamePoolSection, namePoolOffset);
  10423. END;
  10424. END SetModule;
  10425. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10426. BEGIN
  10427. IF ~implementationVisitor.backend.cooperative THEN
  10428. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10429. INC(modulePointers);
  10430. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10431. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10432. END;
  10433. END AddPointer;
  10434. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10435. BEGIN
  10436. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10437. END GetTypeRecordBaseOffset;
  10438. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10439. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10440. BEGIN
  10441. (* change this when Heaps.HeapBlock is modified *)
  10442. INC(dataAdrOffset,6);
  10443. Info(section,"headerAdr");
  10444. Address(section,0);
  10445. Info(section,"typeDesc");
  10446. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10447. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10448. NamedSymbol(section, name, symbol, 0, offset);
  10449. Info(section,"mark: LONGINT;");
  10450. Longint(section,-1);
  10451. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10452. Info(section,"dataAdr-: ADDRESS");
  10453. Symbol(section,section, dataAdrOffset,0);
  10454. Info(section,"size-: SIZE");
  10455. Address(section,0);
  10456. Info(section,"nextMark: HeapBlock;");
  10457. Address(section,0);
  10458. END HeapBlock;
  10459. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10460. VAR i: LONGINT;
  10461. BEGIN
  10462. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10463. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10464. Info(section,"count*: LONGINT");
  10465. Longint(section,0);
  10466. Info(section,"locked*: BOOLEAN");
  10467. Longint(section,0);
  10468. Info(section,"awaitingLock*: ProcessQueue");
  10469. Address(section,0);
  10470. Address(section,0);
  10471. Info(section,"awaitingCond*: ProcessQueue");
  10472. Address(section,0);
  10473. Address(section,0);
  10474. Info(section,"lockedBy*: ANY");
  10475. Address(section,0);
  10476. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10477. Longint(section,1);
  10478. FOR i := 2 TO 6 DO
  10479. Longint(section,0);
  10480. END;
  10481. Info(section,"lock*: ANY");
  10482. Address(section,0);
  10483. END ProtectedHeapBlock;
  10484. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10485. BEGIN
  10486. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10487. END Info;
  10488. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10489. VAR op: IntermediateCode.Operand;
  10490. BEGIN
  10491. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10492. section.Emit(Data(Basic.invalidPosition,op));
  10493. END Address;
  10494. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10495. VAR op: IntermediateCode.Operand;
  10496. BEGIN
  10497. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10498. section.Emit(Data(Basic.invalidPosition,op));
  10499. END Size;
  10500. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10501. VAR op: IntermediateCode.Operand;
  10502. BEGIN
  10503. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10504. section.Emit(Data(Basic.invalidPosition,op));
  10505. END Set;
  10506. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10507. VAR op: IntermediateCode.Operand;
  10508. BEGIN
  10509. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10510. section.Emit(Data(Basic.invalidPosition,op));
  10511. END Longint;
  10512. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10513. VAR op,noOperand: IntermediateCode.Operand;
  10514. BEGIN
  10515. IntermediateCode.InitOperand(noOperand);
  10516. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10517. section.PatchOperands(pc,op,noOperand,noOperand);
  10518. END PatchAddress;
  10519. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10520. VAR op,noOperand: IntermediateCode.Operand;
  10521. BEGIN
  10522. IntermediateCode.InitOperand(noOperand);
  10523. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10524. section.PatchOperands(pc,op,noOperand,noOperand);
  10525. END PatchSize;
  10526. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10527. VAR op,noOperand: IntermediateCode.Operand;
  10528. BEGIN
  10529. IntermediateCode.InitOperand(noOperand);
  10530. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10531. section.PatchOperands(pc,op,noOperand,noOperand);
  10532. END PatchLongint;
  10533. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10534. VAR op, noOperand: IntermediateCode.Operand;
  10535. BEGIN
  10536. IntermediateCode.InitOperand(noOperand);
  10537. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10538. section.PatchOperands(pc,op,noOperand,noOperand);
  10539. END PatchSymbol;
  10540. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10541. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10542. BEGIN
  10543. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10544. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10545. section.Emit(Data(Basic.invalidPosition,op));
  10546. END Boolean;
  10547. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10548. VAR op: IntermediateCode.Operand;
  10549. BEGIN
  10550. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10551. section.Emit(Data(Basic.invalidPosition,op));
  10552. END Char;
  10553. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10554. VAR op: IntermediateCode.Operand;
  10555. BEGIN
  10556. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10557. section.Emit(Data(Basic.invalidPosition,op));
  10558. END Integer;
  10559. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10560. VAR i: LONGINT;
  10561. BEGIN
  10562. Info(section,str);
  10563. i := 0;
  10564. WHILE(str[i] # 0X) DO
  10565. Char(section,str[i]);
  10566. INC(i);
  10567. END;
  10568. Char(section,0X);
  10569. END String;
  10570. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10571. VAR s: Basic.SectionName;
  10572. BEGIN
  10573. StringPool.GetString(str, s);
  10574. String(section, s);
  10575. END String0;
  10576. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10577. VAR op: IntermediateCode.Operand;
  10578. BEGIN
  10579. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10580. IntermediateCode.SetOffset(op,realOffset);
  10581. section.Emit(Data(Basic.invalidPosition,op));
  10582. END NamedSymbol;
  10583. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10584. VAR op: IntermediateCode.Operand;
  10585. BEGIN
  10586. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10587. IntermediateCode.SetOffset(op,realOffset);
  10588. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10589. END NamedSymbolAt;
  10590. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10591. BEGIN
  10592. IF symbol= NIL THEN
  10593. Address( section, realOffset);
  10594. ASSERT(virtualOffset = 0);
  10595. ELSE
  10596. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10597. END;
  10598. END Symbol;
  10599. (* OutPointers delivers
  10600. {pointerOffset}
  10601. *)
  10602. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10603. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10604. BEGIN
  10605. type := type.resolved;
  10606. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10607. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10608. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10609. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10610. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10611. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10612. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10613. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10614. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10615. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10616. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10617. ELSIF (type IS SyntaxTree.RecordType) THEN
  10618. (* never treat a record like a pointer, even if the pointer field is set! *)
  10619. WITH type: SyntaxTree.RecordType DO
  10620. base := type.GetBaseRecord();
  10621. IF base # NIL THEN
  10622. Pointers(offset,symbol,section, base,numberPointers);
  10623. END;
  10624. variable := type.recordScope.firstVariable;
  10625. WHILE(variable # NIL) DO
  10626. IF ~(variable.untraced) THEN
  10627. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10628. END;
  10629. variable := variable.nextVariable;
  10630. END;
  10631. END;
  10632. ELSIF (type IS SyntaxTree.CellType) THEN
  10633. WITH type: SyntaxTree.CellType DO
  10634. base := type.GetBaseRecord();
  10635. IF base # NIL THEN
  10636. Pointers(offset,symbol,section, base,numberPointers);
  10637. END;
  10638. variable := type.cellScope.firstVariable;
  10639. WHILE(variable # NIL) DO
  10640. IF ~(variable.untraced) THEN
  10641. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10642. END;
  10643. variable := variable.nextVariable;
  10644. END;
  10645. property := type.firstProperty;
  10646. WHILE(property # NIL) DO
  10647. IF ~(property.untraced) THEN
  10648. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10649. END;
  10650. property := property.nextProperty;
  10651. END;
  10652. parameter := type.firstParameter;
  10653. WHILE(parameter # NIL) DO
  10654. IF ~(parameter.untraced) THEN
  10655. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10656. END;
  10657. parameter := parameter.nextParameter;
  10658. END;
  10659. END;
  10660. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10661. WITH type: SyntaxTree.ArrayType DO
  10662. IF type.form= SyntaxTree.Static THEN
  10663. n := type.staticLength;
  10664. base := type.arrayBase.resolved;
  10665. WHILE(base IS SyntaxTree.ArrayType) DO
  10666. type := base(SyntaxTree.ArrayType);
  10667. n := n* type.staticLength;
  10668. base := type.arrayBase.resolved;
  10669. END;
  10670. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10671. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10672. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10673. FOR i := 0 TO n-1 DO
  10674. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10675. END;
  10676. END;
  10677. ELSE
  10678. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10679. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10680. END;
  10681. END;
  10682. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10683. WITH type: SyntaxTree.MathArrayType DO
  10684. IF type.form = SyntaxTree.Static THEN
  10685. n := type.staticLength;
  10686. base := type.arrayBase.resolved;
  10687. WHILE(base IS SyntaxTree.MathArrayType) DO
  10688. type := base(SyntaxTree.MathArrayType);
  10689. n := n* type.staticLength;
  10690. base := type.arrayBase.resolved;
  10691. END;
  10692. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10693. IF SemanticChecker.ContainsPointer(base) THEN
  10694. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10695. FOR i := 0 TO n-1 DO
  10696. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10697. END;
  10698. END;
  10699. ELSE
  10700. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10701. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10702. END
  10703. END;
  10704. (* ELSE no pointers in type *)
  10705. END;
  10706. END Pointers;
  10707. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10708. VAR position,i: LONGINT; ch: CHAR;
  10709. BEGIN
  10710. IF pool.Has(index) THEN
  10711. RETURN pool.GetInt(index)
  10712. ELSE
  10713. position := source.pc;
  10714. pool.PutInt(index, position);
  10715. Info(source, name);
  10716. i := 0;
  10717. REPEAT
  10718. ch := name[i]; INC(i);
  10719. Char( source, ch);
  10720. UNTIL ch = 0X;
  10721. END;
  10722. RETURN position;
  10723. END EnterDynamicName;
  10724. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10725. VAR name: Basic.SectionName; position: LONGINT;
  10726. BEGIN
  10727. IF pool.Has(index) THEN
  10728. RETURN pool.GetInt(index)
  10729. ELSE
  10730. StringPool.GetString(index, name);
  10731. position := EnterDynamicName(source,name,index, pool);
  10732. END;
  10733. RETURN position;
  10734. END DynamicName;
  10735. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10736. VAR section: IntermediateCode.Section;
  10737. BEGIN
  10738. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10739. IF implementationVisitor.backend.cooperative THEN
  10740. Info(section, "TypeDescriptor");
  10741. Basic.ToSegmentedName("BaseTypes.Array", name);
  10742. NamedSymbol(section, name,NIL, 0, 0);
  10743. BasePointer(section);
  10744. offset := 0;
  10745. ELSE
  10746. IF ProtectModulesPointers THEN
  10747. HeapBlock(mName,typeName,section,2);
  10748. END;
  10749. Info(section, "HeapBlock");
  10750. IF ProtectModulesPointers THEN
  10751. Symbol(section,section,2,0);
  10752. ELSE
  10753. Address(section,0);
  10754. END;
  10755. Info(section, "TypeDescriptor");
  10756. Address(section,0);
  10757. offset := section.pc;
  10758. END;
  10759. RETURN section
  10760. END NamedBlock;
  10761. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10762. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10763. BEGIN
  10764. COPY(moduleName,name);
  10765. Strings.Append(name,suffix);
  10766. Basic.ToSegmentedName(name, pooledName);
  10767. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10768. END Block;
  10769. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10770. VAR name: Basic.SegmentedName;
  10771. BEGIN
  10772. Info(source,"ArrayHeader");
  10773. IF implementationVisitor.backend.cooperative THEN
  10774. sizePC := source.pc;
  10775. Address(source,0);
  10776. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10777. IF baseType # "" THEN
  10778. Basic.ToSegmentedName(baseType, name);
  10779. NamedSymbol(source, name,NIL, 0, 0);
  10780. ELSE
  10781. Address(source,0);
  10782. END;
  10783. Address(source,0);
  10784. ELSE
  10785. Address(source,0);
  10786. Address(source,0);
  10787. (* first pointer for GC *)
  10788. IF hasPointer THEN
  10789. (* points to first element in the array, this is NOT the base type descriptor *)
  10790. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10791. ELSE
  10792. Address(source,0);
  10793. END;
  10794. sizePC := source.pc;
  10795. Address(source,0);
  10796. Info(source,"array data");
  10797. END;
  10798. END ArrayBlock;
  10799. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10800. BEGIN
  10801. IF implementationVisitor.backend.cooperative THEN
  10802. PatchSize(section, pc, size);
  10803. PatchSize(section, pc + 3, size);
  10804. ELSE
  10805. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10806. PatchSize(section, pc, size);
  10807. END;
  10808. END PatchArray;
  10809. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10810. VAR
  10811. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10812. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10813. poolMap: Basic.HashTableInt;
  10814. namePool: IntermediateCode.Section;
  10815. namePoolOffset: LONGINT;
  10816. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10817. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10818. BEGIN
  10819. Basic.SegmentedNameToString(s1.name,n1);
  10820. Basic.SegmentedNameToString(s2.name,n2);
  10821. index := 0;
  10822. ch1 := n1[index];
  10823. ch2 := n2[index];
  10824. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10825. INC(index);
  10826. ch1 := n1[index];
  10827. ch2 := n2[index];
  10828. END;
  10829. RETURN ch1 < ch2;
  10830. END Compare;
  10831. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10832. VAR
  10833. i, j: LONGINT;
  10834. x, t: Sections.Section;
  10835. BEGIN
  10836. IF lo < hi THEN
  10837. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10838. WHILE i <= j DO
  10839. WHILE Compare(list[i], x) DO INC(i) END;
  10840. WHILE Compare(x, list[j]) DO DEC(j) END;
  10841. IF i <= j THEN
  10842. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10843. INC(i); DEC(j)
  10844. END
  10845. END;
  10846. IF lo < j THEN QuickSort(list, lo, j) END;
  10847. IF i < hi THEN QuickSort(list, i, hi) END
  10848. END;
  10849. END QuickSort;
  10850. (*
  10851. ExportDesc* = RECORD
  10852. fp*: ADDRESS;
  10853. name* {UNTRACED}: DynamicName;
  10854. adr*: ADDRESS;
  10855. exports*: LONGINT;
  10856. dsc* {UNTRACED}: ExportArray
  10857. END;
  10858. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10859. *)
  10860. PROCEDURE ExportDesc2(
  10861. source: IntermediateCode.Section;
  10862. namePool: IntermediateCode.Section;
  10863. fingerPrinter: FingerPrinter.FingerPrinter;
  10864. symbol: Sections.Section;
  10865. name: StringPool.Index;
  10866. VAR patchAdr: LONGINT
  10867. ): BOOLEAN;
  10868. VAR fingerPrint: SyntaxTree.FingerPrint;
  10869. BEGIN
  10870. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10871. & (symbol.type # Sections.InlineCodeSection)
  10872. THEN
  10873. *)
  10874. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  10875. & (symbol.type # Sections.ExitCodeSection)
  10876. & (symbol.type # Sections.InlineCodeSection))
  10877. THEN
  10878. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10879. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10880. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10881. Longint(source,fingerPrint.public);
  10882. ELSE
  10883. Longint(source, 0);
  10884. END;
  10885. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10886. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10887. Symbol(source, symbol,0,0);
  10888. patchAdr := source.pc;
  10889. Longint(source, 0);
  10890. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10891. Address(source,0);
  10892. END;
  10893. RETURN TRUE
  10894. ELSE
  10895. RETURN FALSE
  10896. END;
  10897. END ExportDesc2;
  10898. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10899. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10900. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10901. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10902. nextPatch: LONGINT;
  10903. TYPE
  10904. Scope = RECORD
  10905. elements: LONGINT;
  10906. gelements: LONGINT;
  10907. section: IntermediateCode.Section;
  10908. patchAdr: LONGINT;
  10909. arraySizePC: LONGINT;
  10910. beginPC: LONGINT; (* current scope start pc *)
  10911. END;
  10912. BEGIN
  10913. Basic.InitSegmentedName(prev);
  10914. olevel := -1;
  10915. scopes[0].section := source;
  10916. scopes[0].arraySizePC := MIN(LONGINT);
  10917. FOR s := 0 TO LEN(sections)-1 DO
  10918. symbol := sections[s];
  10919. 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
  10920. this := sections[s].name;
  10921. level := 0;
  10922. WHILE (this[level] > 0) DO
  10923. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10924. INC(level);
  10925. END;
  10926. WHILE level < olevel DO
  10927. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10928. IF olevel > 0 THEN
  10929. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10930. nextPatch := scopes[olevel-1].patchAdr+1;
  10931. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10932. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10933. END;
  10934. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10935. DEC(olevel);
  10936. END;
  10937. IF (this[level] > 0) THEN
  10938. IF level > olevel THEN
  10939. (*TRACE("opening",level); *)
  10940. IF scopes[level].section = NIL THEN
  10941. arrayName := ".@ExportArray";
  10942. Strings.AppendInt(arrayName, level);
  10943. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  10944. AddPointer(scopes[level].section,offset);
  10945. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  10946. END;
  10947. scopes[level].beginPC := scopes[level].section.pc;
  10948. olevel := level;
  10949. scopes[olevel].elements := 0;
  10950. END;
  10951. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10952. sym := sections[s];
  10953. ELSE
  10954. sym := NIL;
  10955. END;
  10956. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10957. THEN
  10958. INC(scopes[olevel].elements);
  10959. END;
  10960. (* enter string in scope *)
  10961. INC(level);
  10962. END;
  10963. END;
  10964. Basic.SegmentedNameToString(this, name);
  10965. prev := this;
  10966. END;
  10967. END;
  10968. WHILE 0 <= olevel DO
  10969. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10970. IF olevel > 0 THEN
  10971. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10972. nextPatch := scopes[olevel-1].patchAdr+1;
  10973. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10974. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10975. END;
  10976. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10977. DEC(olevel);
  10978. END;
  10979. level := 0;
  10980. WHILE (level < LEN(scopes)) DO
  10981. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10982. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10983. END;
  10984. INC(level);
  10985. END;
  10986. END Export;
  10987. BEGIN
  10988. NEW(fingerPrinter);
  10989. NEW(poolMap, 64);
  10990. (* 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 *)
  10991. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10992. NEW(sectionArray, module.allSections.Length());
  10993. FOR i := 0 TO module.allSections.Length() - 1 DO
  10994. section := module.allSections.GetSection(i);
  10995. sectionArray[i] := section;
  10996. END;
  10997. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10998. Export(sectionArray^);
  10999. END ExportDesc;
  11000. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11001. VAR
  11002. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11003. BEGIN
  11004. Info(source, "exception table offsets array descriptor");
  11005. size := 0;
  11006. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11007. Info(source, "exception table content");
  11008. FOR i := 0 TO module.allSections.Length() - 1 DO
  11009. p := module.allSections.GetSection(i);
  11010. IF p.type = Sections.CodeSection THEN
  11011. finallyPC := p(IntermediateCode.Section).finally;
  11012. IF finallyPC>=0 THEN
  11013. Symbol( source, p, 0,0);
  11014. Symbol( source, p, finallyPC, 0);
  11015. Symbol( source, p, finallyPC,0);
  11016. INC(size);
  11017. END;
  11018. END
  11019. END;
  11020. PatchArray(source,sizePC,size);
  11021. END ExceptionArray;
  11022. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11023. VAR i: LONGINT; ch: CHAR;
  11024. BEGIN
  11025. i := 0;
  11026. REPEAT
  11027. ch := name[i]; INC(i);
  11028. Char( section, ch);
  11029. UNTIL ch = 0X;
  11030. WHILE i < 32 DO
  11031. Char( section, 0X); INC(i);
  11032. END;
  11033. END Name;
  11034. PROCEDURE References(section: IntermediateCode.Section);
  11035. CONST
  11036. sfTypeNone = 0X;
  11037. sfTypeCHAR = 01X;
  11038. sfTypeCHAR8 = 02X;
  11039. sfTypeCHAR16 = 03X;
  11040. sfTypeCHAR32 = 04X;
  11041. sfTypeRANGE = 05X;
  11042. sfTypeSHORTINT = 06X;
  11043. sfTypeINTEGER = 07X;
  11044. sfTypeLONGINT = 08X;
  11045. sfTypeHUGEINT = 09X;
  11046. sfTypeWORD = 0AX;
  11047. sfTypeLONGWORD = 0BX;
  11048. sfTypeSIGNED8 = 0CX;
  11049. sfTypeSIGNED16 = 0DX;
  11050. sfTypeSIGNED32 = 0EX;
  11051. sfTypeSIGNED64 = 0FX;
  11052. sfTypeUNSIGNED8 = 10X;
  11053. sfTypeUNSIGNED16 = 11X;
  11054. sfTypeUNSIGNED32 = 12X;
  11055. sfTypeUNSIGNED64 = 13X;
  11056. sfTypeREAL = 14X;
  11057. sfTypeLONGREAL = 15X;
  11058. sfTypeCOMPLEX = 16X;
  11059. sfTypeLONGCOMPLEX = 17X;
  11060. sfTypeBOOLEAN = 18X;
  11061. sfTypeSET = 19X;
  11062. sfTypeANY = 1AX;
  11063. sfTypeOBJECT = 1BX;
  11064. sfTypeBYTE = 1CX;
  11065. sfTypeADDRESS = 1DX;
  11066. sfTypeSIZE = 1EX;
  11067. sfTypeIndirect = 1FX;
  11068. sfTypeRecord = 20X;
  11069. sfTypePointerToRecord = 21X;
  11070. sfTypePointerToArray = 22X;
  11071. sfTypeOpenArray = 23X;
  11072. sfTypeStaticArray = 24X;
  11073. sfTypeDynamicArray = 25X;
  11074. sfTypeMathStaticArray = 26X;
  11075. sfTypeMathOpenArray = 27X;
  11076. sfTypeMathTensor = 28X;
  11077. sfTypeDelegate = 29X;
  11078. sfTypeENUM = 2AX;
  11079. sfTypeCELL = 2BX;
  11080. sfTypePORT = 2CX;
  11081. sfIN = 0X;
  11082. sfOUT = 1X;
  11083. flagDelegate = 0;
  11084. flagConstructor = 1;
  11085. (* variable / parameter addressing modes *)
  11086. sfAbsolute = 0X; (* global vars *)
  11087. sfRelative = 1X; (* variables, value parameters *)
  11088. sfIndirect = 2X; (* var parameters *)
  11089. sfScopeBegin = 0F0X;
  11090. sfScopeEnd = 0F1X;
  11091. sfProcedure = 0F2X;
  11092. sfVariable = 0F3X;
  11093. sfTypeDeclaration = 0F4X;
  11094. sfModule = 0FFX;
  11095. RefInfo = TRUE;
  11096. VAR
  11097. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11098. indirectTypes: Basic.HashTable;
  11099. PROCEDURE CurrentIndex(): LONGINT;
  11100. VAR i: LONGINT;
  11101. BEGIN
  11102. FOR i := startPC TO section.pc -1 DO
  11103. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11104. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11105. END;
  11106. startPC := section.pc;
  11107. RETURN lastOffset;
  11108. END CurrentIndex;
  11109. (*
  11110. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11111. Module = sfModule prevSymbol:SIZE name:String Scope.
  11112. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11113. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11114. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11115. Type =
  11116. sfTypePointerToRecord
  11117. | sfTypePointerToArray Type
  11118. | sfTypeOpenArray Type
  11119. | sfTypeDynamicArray Type
  11120. | sfTypeStaticArray length:SIZE Type
  11121. | sfTypeMathOpenArray Type
  11122. | sfTypeMathStaticArray length:SIZE Type
  11123. | sfTypeMathTensor Type
  11124. | sfTypeRecord tdAdr:ADDRESS
  11125. | sfTypeDelegate {Parameter} return:Type
  11126. | sfTypePort (sfIN | sfOUT)
  11127. | sfTypeBOOLEAN
  11128. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11129. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11130. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11131. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11132. | sfTypeWORD | sfTypeLONGWORD
  11133. | sfTypeREAL | sfTypeLONGREAL
  11134. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11135. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11136. | sfTypeIndirect offset:SIZE.
  11137. *)
  11138. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11139. VAR offset: SIZE;
  11140. BEGIN
  11141. IF indirectTypes.Has(type) THEN
  11142. offset := indirectTypes.GetInt(type);
  11143. Char(section, sfTypeIndirect);
  11144. Size(section, offset);
  11145. RETURN TRUE;
  11146. ELSE
  11147. indirectTypes.PutInt(type, CurrentIndex());
  11148. RETURN FALSE;
  11149. END;
  11150. END Indirect;
  11151. PROCEDURE NType(type: SyntaxTree.Type);
  11152. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11153. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11154. BEGIN
  11155. IF type = NIL THEN
  11156. Char(section, sfTypeNone)
  11157. ELSE
  11158. type := type.resolved;
  11159. size := type.sizeInBits;
  11160. WITH type:SyntaxTree.PointerType DO
  11161. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11162. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11163. Char(section, sfTypePointerToRecord);
  11164. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11165. ELSE
  11166. IF RefInfo THEN Info(section,"PointerToArray") END;
  11167. Char(section, sfTypePointerToArray);
  11168. NType(type.pointerBase);
  11169. END;
  11170. | type: SyntaxTree.ArrayType DO
  11171. IF ~Indirect(type) THEN
  11172. IF type.form = SyntaxTree.Open THEN
  11173. IF RefInfo THEN Info(section,"OpenArray") END;
  11174. Char(section, sfTypeOpenArray);
  11175. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11176. IF RefInfo THEN Info(section,"DynamicArray") END;
  11177. Char(section, sfTypeDynamicArray);
  11178. ELSIF type.form = SyntaxTree.Static THEN
  11179. IF RefInfo THEN Info(section,"StaticArray") END;
  11180. Char(section, sfTypeStaticArray);
  11181. Size(section, type.staticLength);
  11182. ELSE
  11183. HALT(100);
  11184. END;
  11185. NType(type.arrayBase);
  11186. END;
  11187. | type: SyntaxTree.MathArrayType DO
  11188. IF ~Indirect(type) THEN
  11189. IF type.form = SyntaxTree.Open THEN
  11190. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11191. Char(section, sfTypeMathOpenArray);
  11192. ELSIF type.form = SyntaxTree.Static THEN
  11193. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11194. Char(section, sfTypeMathStaticArray);
  11195. Size(section, type.staticLength);
  11196. ELSIF type.form = SyntaxTree.Tensor THEN
  11197. IF RefInfo THEN Info(section,"MathTensor") END;
  11198. Char(section, sfTypeMathTensor);
  11199. ELSE
  11200. HALT(100);
  11201. END;
  11202. NType(type.arrayBase);
  11203. END;
  11204. | type: SyntaxTree.RecordType DO
  11205. IF ~Indirect(type) THEN
  11206. IF type.pointerType # NIL (* OBJECT *) THEN
  11207. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11208. Char(section, sfTypePointerToRecord)
  11209. ELSE
  11210. IF RefInfo THEN Info(section,"Record") END;
  11211. Char(section, sfTypeRecord);
  11212. td := type.typeDeclaration;
  11213. IF RefInfo THEN Info(section,"TD") END;
  11214. IF (td # NIL) THEN
  11215. Global.GetSymbolSegmentedName(td,segmentedName);
  11216. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11217. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11218. ELSE
  11219. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11220. END;
  11221. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11222. Symbol(section, tir, 0, offset);
  11223. ELSE
  11224. Address(section, 0);
  11225. END;
  11226. END;
  11227. END;
  11228. | type: SyntaxTree.CellType DO
  11229. IF ~Indirect(type) THEN
  11230. IF RefInfo THEN Info(section,"Record") END;
  11231. Char(section, sfTypeRecord);
  11232. td := type.typeDeclaration;
  11233. IF RefInfo THEN Info(section,"TD") END;
  11234. IF (td # NIL) THEN
  11235. Global.GetSymbolSegmentedName(td,segmentedName);
  11236. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11237. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11238. ELSE
  11239. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11240. END;
  11241. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11242. Symbol(section, tir, 0, offset);
  11243. ELSE
  11244. Address(section, 0);
  11245. END;
  11246. END;
  11247. | type: SyntaxTree.PortType DO
  11248. Char(section, sfTypePORT);
  11249. IF type.direction = SyntaxTree.OutPort THEN
  11250. Char(section, sfOUT)
  11251. ELSE
  11252. Char(section, sfIN)
  11253. END;
  11254. | type: SyntaxTree.ProcedureType DO
  11255. IF ~Indirect(type) THEN
  11256. Char(section, sfTypeDelegate);
  11257. parameter := type.firstParameter;
  11258. WHILE(parameter # NIL) DO
  11259. NParameter(parameter, -1);
  11260. parameter := parameter.nextParameter;
  11261. END;
  11262. NType(type.returnType);
  11263. END;
  11264. | type:SyntaxTree.EnumerationType DO
  11265. Char(section, sfTypeENUM);
  11266. | type: SyntaxTree.BasicType DO
  11267. WITH type: SyntaxTree.BooleanType DO
  11268. IF RefInfo THEN Info(section,"Boolean") END;
  11269. Char(section, sfTypeBOOLEAN);
  11270. | type: SyntaxTree.CharacterType DO
  11271. IF type = module.system.characterType THEN
  11272. IF RefInfo THEN Info(section,"CHAR") END;
  11273. Char(section, sfTypeCHAR);
  11274. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11275. IF RefInfo THEN Info(section,"CHAR8") END;
  11276. Char(section, sfTypeCHAR8)
  11277. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11278. IF RefInfo THEN Info(section,"CHAR16") END;
  11279. Char(section, sfTypeCHAR16);
  11280. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11281. IF RefInfo THEN Info(section,"CHAR32") END;
  11282. Char(section, sfTypeCHAR32);
  11283. ELSE
  11284. HALT(100);
  11285. END;
  11286. |type: SyntaxTree.IntegerType DO
  11287. IF type(SyntaxTree.IntegerType).signed THEN
  11288. IF (type = module.system.shortintType) THEN
  11289. IF RefInfo THEN Info(section,"SHORTINT") END;
  11290. Char(section, sfTypeSHORTINT)
  11291. ELSIF (type = module.system.integerType) THEN
  11292. IF RefInfo THEN Info(section,"INTEGER") END;
  11293. Char(section, sfTypeINTEGER)
  11294. ELSIF (type = module.system.longintType) THEN
  11295. IF RefInfo THEN Info(section,"LONGINT") END;
  11296. Char(section, sfTypeLONGINT)
  11297. ELSIF (type = module.system.hugeintType) THEN
  11298. IF RefInfo THEN Info(section,"HUGEINT") END;
  11299. Char(section, sfTypeHUGEINT)
  11300. ELSIF (type = module.system.wordType) THEN
  11301. IF RefInfo THEN Info(section,"WORD") END;
  11302. Char(section, sfTypeWORD)
  11303. ELSIF (type = module.system.longWordType) THEN
  11304. IF RefInfo THEN Info(section,"LONGWORD") END;
  11305. Char(section, sfTypeLONGWORD);
  11306. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11307. IF RefInfo THEN Info(section,"SIGNED8") END;
  11308. Char(section, sfTypeSIGNED8)
  11309. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11310. IF RefInfo THEN Info(section,"SIGNED16") END;
  11311. Char(section, sfTypeSIGNED16)
  11312. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11313. IF RefInfo THEN Info(section,"SIGNED32") END;
  11314. Char(section, sfTypeSIGNED32)
  11315. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11316. IF RefInfo THEN Info(section,"SIGNED64") END;
  11317. Char(section, sfTypeSIGNED64)
  11318. ELSE
  11319. HALT(100);
  11320. END
  11321. ELSE (* unsigned *)
  11322. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11323. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11324. Char(section, sfTypeUNSIGNED8)
  11325. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11326. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11327. Char(section, sfTypeUNSIGNED16)
  11328. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11329. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11330. Char(section, sfTypeUNSIGNED32)
  11331. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11332. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11333. Char(section, sfTypeUNSIGNED64)
  11334. ELSE
  11335. HALT(100)
  11336. END
  11337. END;
  11338. | type: SyntaxTree.FloatType DO
  11339. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11340. IF RefInfo THEN Info(section,"REAL") END;
  11341. Char(section, sfTypeREAL);
  11342. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11343. IF RefInfo THEN Info(section,"LONGREAL") END;
  11344. Char(section, sfTypeLONGREAL);
  11345. ELSE
  11346. HALT(100);
  11347. END;
  11348. |type: SyntaxTree.ComplexType DO
  11349. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11350. IF RefInfo THEN Info(section,"COMPLEX") END;
  11351. Char(section, sfTypeCOMPLEX);
  11352. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11353. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11354. Char(section, sfTypeLONGCOMPLEX);
  11355. ELSE
  11356. HALT(100);
  11357. END;
  11358. |type:SyntaxTree.SetType DO
  11359. IF RefInfo THEN Info(section,"SET") END;
  11360. Char(section, sfTypeSET);
  11361. |type:SyntaxTree.AnyType DO
  11362. IF RefInfo THEN Info(section,"ANY") END;
  11363. Char(section, sfTypeANY);
  11364. |type:SyntaxTree.ObjectType DO
  11365. IF RefInfo THEN Info(section,"OBJECT") END;
  11366. Char(section, sfTypeOBJECT);
  11367. |type:SyntaxTree.ByteType DO
  11368. IF RefInfo THEN Info(section,"BYTE") END;
  11369. Char(section, sfTypeBYTE);
  11370. |type:SyntaxTree.RangeType DO
  11371. IF RefInfo THEN Info(section,"RANGE") END;
  11372. Char(section, sfTypeRANGE)
  11373. |type:SyntaxTree.AddressType DO
  11374. IF RefInfo THEN Info(section,"ADDRESS") END;
  11375. Char(section, sfTypeADDRESS)
  11376. |type:SyntaxTree.SizeType DO
  11377. IF RefInfo THEN Info(section,"SIZE") END;
  11378. Char(section, sfTypeSIZE)
  11379. ELSE
  11380. HALT(100)
  11381. END;
  11382. ELSE HALT(101);
  11383. END;
  11384. END;
  11385. END NType;
  11386. (*
  11387. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11388. *)
  11389. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11390. VAR pos: LONGINT; type: SyntaxTree.Type;
  11391. BEGIN
  11392. IF RefInfo THEN Info(section, "Parameter") END;
  11393. Char(section, sfVariable);
  11394. Size(section, procOffset);
  11395. String0(section, parameter.name);
  11396. type := parameter.type.resolved;
  11397. IF parameter.kind = SyntaxTree.VarParameter THEN
  11398. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11399. ELSE Char(section, sfIndirect)
  11400. END;
  11401. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11402. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11403. Char(section, sfIndirect);
  11404. ELSE
  11405. Char(section, sfRelative);
  11406. END;
  11407. ELSE
  11408. Char(section, sfRelative);
  11409. END;
  11410. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11411. NType(parameter.type);
  11412. END NParameter;
  11413. (*
  11414. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11415. *)
  11416. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11417. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11418. flags: SET;
  11419. BEGIN
  11420. IF procedure.externalName # NIL THEN RETURN END;
  11421. IF RefInfo THEN Info(section, "Procedure") END;
  11422. pos := CurrentIndex();
  11423. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11424. Char(section, sfProcedure);
  11425. Size(section, scopeOffset);
  11426. String0(section,procedure.name);
  11427. s := module.allSections.FindBySymbol(procedure);
  11428. Symbol(section,s,0,0); (* start *)
  11429. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11430. flags := {};
  11431. IF procedureType.isDelegate THEN
  11432. INCL(flags, flagDelegate);
  11433. END;
  11434. IF procedure.isConstructor THEN
  11435. INCL(flags, flagConstructor);
  11436. END;
  11437. Set(section, flags);
  11438. IF RefInfo THEN Info(section, "Parameters") END;
  11439. parameter := procedureType.firstParameter;
  11440. WHILE(parameter # NIL) DO
  11441. NParameter(parameter, pos);
  11442. parameter := parameter.nextParameter;
  11443. END;
  11444. IF procedureType.returnParameter # NIL THEN
  11445. NParameter(procedureType.returnParameter, pos);
  11446. END;
  11447. IF procedureType.selfParameter # NIL THEN
  11448. NParameter(procedureType.selfParameter, pos);
  11449. END;
  11450. IF RefInfo THEN Info(section, "ReturnType") END;
  11451. NType(procedureType.returnType);
  11452. NScope(procedure.procedureScope, pos);
  11453. END NProcedure;
  11454. (*
  11455. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11456. *)
  11457. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11458. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11459. BEGIN
  11460. IF RefInfo THEN Info(section, "Variable") END;
  11461. pos := CurrentIndex();
  11462. Char(section, sfVariable);
  11463. Size(section, scopeOffset);
  11464. String0(section, variable.name);
  11465. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11466. Char(section, sfAbsolute);
  11467. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11468. NamedSymbol(section, sn,variable, 0,0);
  11469. ELSE
  11470. Char(section, sfRelative);
  11471. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11472. END;
  11473. NType(variable.type);
  11474. s := module.allSections.FindBySymbol(variable);
  11475. END NVariable;
  11476. (*
  11477. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11478. *)
  11479. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11480. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11481. BEGIN
  11482. IF typeDeclaration = NIL THEN RETURN END;
  11483. pos := CurrentIndex();
  11484. s := module.allSections.FindBySymbol(typeDeclaration);
  11485. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11486. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11487. Char(section, sfTypeDeclaration);
  11488. Size(section, scopeOffset);
  11489. String0(section, typeDeclaration.name);
  11490. declared := typeDeclaration.declaredType.resolved;
  11491. IF (declared IS SyntaxTree.PointerType) THEN
  11492. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11493. END;
  11494. WITH declared: SyntaxTree.RecordType DO
  11495. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11496. Symbol(section, s, 0, offset);
  11497. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11498. Basic.AppendToSegmentedName(name,".@Info");
  11499. s := module.allSections.FindByName(name);
  11500. IF s # NIL THEN (* does not work for coop *)
  11501. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11502. END;
  11503. NScope(declared.recordScope, pos);
  11504. |declared: SyntaxTree.CellType DO
  11505. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11506. Symbol(section, s, 0, offset);
  11507. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11508. Basic.AppendToSegmentedName(name,".@Info");
  11509. s := module.allSections.FindByName(name);
  11510. IF s # NIL THEN
  11511. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11512. END;
  11513. NScope(declared.cellScope, pos);
  11514. ELSE
  11515. Address(section, 0);
  11516. END;
  11517. END NTypeDeclaration;
  11518. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11519. VAR pos: LONGINT;
  11520. BEGIN
  11521. pos := CurrentIndex();
  11522. Char(section,sfModule);
  11523. Size(section, prevSymbol);
  11524. String0(section, module.name);
  11525. NScope(module.moduleScope, pos);
  11526. END NModule;
  11527. (*
  11528. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11529. *)
  11530. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11531. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11532. BEGIN
  11533. IF scope = NIL THEN RETURN END;
  11534. IF RefInfo THEN Info(section, "Scope") END;
  11535. Char(section, sfScopeBegin);
  11536. variable := scope.firstVariable;
  11537. WHILE (variable # NIL) DO
  11538. NVariable(variable, prevSymbol);
  11539. variable := variable.nextVariable;
  11540. END;
  11541. WITH scope: SyntaxTree.ModuleScope DO
  11542. bodyProcedure := scope.bodyProcedure;
  11543. |scope: SyntaxTree.RecordScope DO
  11544. bodyProcedure := scope.bodyProcedure;
  11545. ELSE
  11546. bodyProcedure := NIL;
  11547. END;
  11548. IF bodyProcedure # NIL THEN
  11549. NProcedure(bodyProcedure, prevSymbol)
  11550. END;
  11551. procedure := scope.firstProcedure;
  11552. WHILE procedure # NIL DO
  11553. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11554. procedure := procedure.nextProcedure;
  11555. END;
  11556. typeDeclaration := scope.firstTypeDeclaration;
  11557. WHILE typeDeclaration # NIL DO
  11558. NTypeDeclaration(typeDeclaration, prevSymbol);
  11559. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11560. END;
  11561. Char(section, sfScopeEnd); (* scope ends *)
  11562. END NScope;
  11563. BEGIN
  11564. NEW(indirectTypes, 32);
  11565. ArrayBlock(section,sizePC,"", FALSE);
  11566. startPC := section.pc;
  11567. NModule(module.module, -1);
  11568. PatchArray(section,sizePC,CurrentIndex());
  11569. END References;
  11570. (*
  11571. Command* = RECORD
  11572. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11573. name*: Name; (* name of the procedure *)
  11574. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11575. entryAdr* : ADDRESS; (* entry address of procedure *)
  11576. END;
  11577. *)
  11578. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11579. VAR
  11580. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11581. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11582. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11583. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11584. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11585. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11586. BEGIN
  11587. RETURN
  11588. (type = NIL) OR
  11589. (type.resolved IS SyntaxTree.RecordType) OR
  11590. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11591. (type.resolved IS SyntaxTree.AnyType);
  11592. END TypeAllowed;
  11593. BEGIN
  11594. numberParameters := procedureType.numberParameters;
  11595. RETURN
  11596. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11597. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11598. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11599. END GetProcedureAllowed;
  11600. PROCEDURE WriteType(type : SyntaxTree.Type);
  11601. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11602. name: Basic.SegmentedName; offset: LONGINT;
  11603. BEGIN
  11604. IF type = NIL THEN
  11605. Address(source,0);
  11606. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11607. Address(source,1);
  11608. ELSE
  11609. type := type.resolved;
  11610. IF type IS SyntaxTree.PointerType THEN
  11611. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11612. END;
  11613. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11614. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11615. name[0] := typeDeclaration.name; name[1] := -1;
  11616. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11617. ASSERT(section # NIL);
  11618. ELSE
  11619. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11620. (* TODO *)
  11621. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11622. END;
  11623. IF implementationVisitor.backend.cooperative THEN
  11624. offset := 0;
  11625. ELSE
  11626. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11627. END;
  11628. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11629. END;
  11630. END WriteType;
  11631. BEGIN
  11632. Info(source, "command array descriptor");
  11633. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11634. numberCommands := 0;
  11635. Info(source, "command array content");
  11636. FOR i := 0 TO module.allSections.Length() - 1 DO
  11637. p := module.allSections.GetSection(i);
  11638. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11639. procedure := p.symbol(SyntaxTree.Procedure);
  11640. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11641. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11642. procedure.GetName(name);
  11643. Name(source,name);
  11644. numberParameters := procedureType.numberParameters;
  11645. (* offset of type of first parameter *)
  11646. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11647. ELSE WriteType(procedureType.firstParameter.type)
  11648. END;
  11649. (* offset of type of return parameter *)
  11650. WriteType(procedureType.returnType);
  11651. (* command name *)
  11652. (* command code offset *)
  11653. Symbol(source,p,0,0);
  11654. INC(numberCommands);
  11655. IF Trace THEN
  11656. D.Ln;
  11657. END;
  11658. END;
  11659. END
  11660. END;
  11661. PatchArray(source,sizePC,numberCommands);
  11662. END CommandArray;
  11663. (* to prevent from double import of different module aliases *)
  11664. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11665. VAR i: SyntaxTree.Import;
  11666. BEGIN
  11667. i := module.module.moduleScope.firstImport;
  11668. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11669. i := i.nextImport;
  11670. END;
  11671. RETURN i = import
  11672. END IsFirstDirectOccurence;
  11673. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11674. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11675. BEGIN
  11676. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11677. ArrayBlock(source,pc,"", FALSE);
  11678. Info(source, "import module array data");
  11679. IF implementationVisitor.backend.cooperative THEN
  11680. offset := 0;
  11681. ELSE
  11682. IF module.system.addressType.sizeInBits = 64 THEN
  11683. (* change this when Heaps.HeapBlock is modified *)
  11684. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11685. ELSE
  11686. (* change this when Heaps.HeapBlock is modified *)
  11687. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11688. END;
  11689. END;
  11690. import := module.module.moduleScope.firstImport;
  11691. numberImports := 0;
  11692. WHILE import # NIL DO
  11693. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11694. Global.GetModuleSegmentedName(import.module,name);
  11695. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11696. NamedSymbol(source, name, NIL, 0, offset);
  11697. INC(numberImports);
  11698. END;
  11699. import := import.nextImport
  11700. END;
  11701. PatchArray(source,pc,numberImports);
  11702. END ImportsArray;
  11703. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11704. VAR
  11705. p: Sections.Section; sizePC, size, i: LONGINT;
  11706. BEGIN
  11707. Info(source, "Type info section");
  11708. size := 0;
  11709. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11710. FOR i := 0 TO module.allSections.Length() - 1 DO
  11711. p := module.allSections.GetSection(i);
  11712. WITH p: IntermediateCode.Section DO
  11713. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11714. Symbol(source,p,EmptyBlockOffset,0);
  11715. INC(size);
  11716. END;
  11717. END
  11718. END;
  11719. PatchArray(source,sizePC,size);
  11720. END TypeInfoSection;
  11721. (*
  11722. ProcTableEntry* = RECORD
  11723. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11724. noPtr*: LONGINT;
  11725. END;
  11726. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11727. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11728. *)
  11729. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11730. VAR
  11731. numberPointers: LONGINT;
  11732. procedure: SyntaxTree.Procedure;
  11733. BEGIN
  11734. Info(section,"pcFrom");
  11735. Symbol(section,procedureSection,0,0);
  11736. Info(section,"pcTo");
  11737. Symbol(section, procedureSection, procedureSection.pc, 0);
  11738. Info(section,"pointer to offsets array");
  11739. Symbol(section, section,section.pc+1,0);
  11740. Info(section,"offsets array");
  11741. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11742. PointerArray(section, procedure.procedureScope, numberPointers);
  11743. END ProcedureDescriptor;
  11744. (* only for tracing, the descriptor is otherwise not complete ! *)
  11745. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11746. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11747. BEGIN
  11748. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11749. name := procedureSection.name;
  11750. Basic.AppendToSegmentedName(name,".@Info");
  11751. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11752. Address(section,0);
  11753. Symbol(section,section,2,0);
  11754. (*
  11755. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11756. descSize: SIZE;
  11757. sentinel: ADDRESS; (* = MPO-4 *)
  11758. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11759. flags*: SET;
  11760. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11761. name*: Name;
  11762. END;
  11763. *)
  11764. Size(section, 0);
  11765. Address(section,0);
  11766. Address(section,0);
  11767. Set(section,{});
  11768. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); END;
  11769. moduleSection := ModuleSection();
  11770. Symbol( section, moduleSection, moduleSection.pc,0);
  11771. IF procedureSection.symbol = NIL THEN
  11772. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11773. ELSE
  11774. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11775. END;
  11776. Name(section, infoName);
  11777. Size(section, 0);
  11778. RETURN section;
  11779. END MakeProcedureDescriptorTag;
  11780. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11781. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11782. BEGIN
  11783. name := procedureSection.name;
  11784. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11785. IF implementationVisitor.backend.cooperative THEN
  11786. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11787. Info(section, "TypeDescriptor");
  11788. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11789. NamedSymbol(dest, name,NIL, 0, 0);
  11790. BaseRecord(dest);
  11791. offset := 0;
  11792. ELSIF CreateProcedureDescInfo THEN
  11793. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11794. Address(dest,0);
  11795. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11796. offset := dest.pc;
  11797. ELSE
  11798. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11799. END;
  11800. ProcedureDescriptor(dest, procedureSection);
  11801. Symbol(section, dest, offset, 0);
  11802. END ProcedureDescriptorPointer;
  11803. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11804. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11805. BEGIN
  11806. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11807. numberProcs := 0;
  11808. FOR i := 0 TO module.allSections.Length() - 1 DO
  11809. destination := module.allSections.GetSection(i);
  11810. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11811. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11812. INC(numberProcs);
  11813. END
  11814. END;
  11815. PatchArray(section, sizePC, numberProcs);
  11816. END ProcedureDescriptorArray;
  11817. (*
  11818. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11819. VAR
  11820. next*: Module; (** once a module is published, all fields are read-only *)
  11821. name*: Name;
  11822. init, published: BOOLEAN;
  11823. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11824. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11825. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11826. command*: POINTER TO ARRAY OF Command;
  11827. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11828. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11829. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11830. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11831. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11832. data*, code*: Bytes;
  11833. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11834. export*: ExportDesc;
  11835. term*: TerminationHandler;
  11836. exTable*: ExceptionTable;
  11837. noProcs*: LONGINT;
  11838. firstProc*: ADDRESS; <- done by loader
  11839. maxPtrs*: LONGINT;
  11840. crc*: LONGINT;
  11841. *)
  11842. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11843. BEGIN
  11844. Info(section, "cycle");
  11845. Size(section,0);
  11846. Info(section, "references");
  11847. Size(section,0);
  11848. Info(section, "nextMarked");
  11849. Address(section,0);
  11850. Info(section, "nextWatched");
  11851. Address(section,0);
  11852. END BasePointer;
  11853. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11854. BEGIN
  11855. BasePointer(section);
  11856. Info(section, "action");
  11857. Address(section,0);
  11858. Info(section, "monitor");
  11859. Address(section,0);
  11860. END BaseObject;
  11861. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11862. BEGIN
  11863. BasePointer(section);
  11864. Info(section, "action");
  11865. Address(section,0);
  11866. Info(section, "monitor");
  11867. Address(section,0);
  11868. END BaseRecord;
  11869. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11870. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11871. pooledName: Basic.SegmentedName;
  11872. symbol: SyntaxTree.Symbol;
  11873. BEGIN
  11874. Global.GetModuleName(module.module,name);
  11875. Strings.Append(name,".@Module.@Descriptor");
  11876. Basic.ToSegmentedName(name, pooledName);
  11877. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11878. Symbol(section,descriptorSection,0,0);
  11879. Info(descriptorSection, "descriptor");
  11880. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11881. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11882. Address(descriptorSection,0);
  11883. Global.GetModuleName(module.module,name);
  11884. Strings.Append(name,".@Trace");
  11885. Basic.ToSegmentedName(name, pooledName);
  11886. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11887. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11888. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11889. END ModuleDescriptor;
  11890. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11891. VAR name: ARRAY 128 OF CHAR;
  11892. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11893. symbol: SyntaxTree.Symbol;
  11894. BEGIN
  11895. ASSERT(implementationVisitor.backend.newObjectFile);
  11896. Global.GetModuleName(module.module,name);
  11897. Strings.Append(name,".@Module");
  11898. Basic.ToSegmentedName(name, pooledName);
  11899. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11900. moduleSection.SetExported(TRUE);
  11901. IF moduleSection.pc = 0 THEN
  11902. IF implementationVisitor.backend.cooperative THEN
  11903. Info(moduleSection, "descriptor");
  11904. ModuleDescriptor(moduleSection);
  11905. BaseObject(moduleSection);
  11906. implementationVisitor.CreateTraceModuleMethod(module.module);
  11907. ELSE
  11908. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11909. Info(moduleSection, "HeapBlock");
  11910. Symbol(moduleSection,moduleSection,2,0);
  11911. Info(moduleSection, "TypeDescriptor");
  11912. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11913. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11914. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11915. END;
  11916. END;
  11917. RETURN moduleSection;
  11918. END ModuleSection;
  11919. PROCEDURE NewModuleInfo();
  11920. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11921. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11922. sectionName: Basic.SectionName;
  11923. CONST MPO=-40000000H;
  11924. BEGIN
  11925. (*
  11926. TypeDesc* = POINTER TO RECORD
  11927. descSize: SIZE;
  11928. sentinel: LONGINT; (* = MPO-4 *)
  11929. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11930. flags*: SET;
  11931. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11932. name*: Name;
  11933. refsOffset: SIZE;
  11934. END;
  11935. *)
  11936. (*name is missing prefixes sometimes*)
  11937. Global.GetModuleSegmentedName(module.module,name);
  11938. Basic.AppendToSegmentedName(name,".@Info");
  11939. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11940. IF ~implementationVisitor.backend.cooperative THEN
  11941. Info(source, "HeapBlock");
  11942. Address(source,0); (* an empty heap block prevents GC marking *)
  11943. Info(source, "TypeDescriptor");
  11944. Address(source,0);
  11945. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11946. END;
  11947. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11948. Address(source,MPO-4);
  11949. Info(source, "type tag pointer");
  11950. Address( source,0);
  11951. Info(source, "type flags");
  11952. flags := {};
  11953. Set( source, flags);
  11954. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11955. Info(source, "pointer to module");
  11956. moduleSection := ModuleSection();
  11957. Symbol( source, moduleSection, moduleSection.pc,0);
  11958. Info(source, "type name");
  11959. i := 0;
  11960. sectionName := "@Self";
  11961. (*
  11962. Global.GetSymbolSegmentedName(td,name);
  11963. Basic.SegmentedNameToString(name, sectionName);
  11964. *)
  11965. Name(source,sectionName);
  11966. source.SetReferenced(FALSE);
  11967. patchInfoPC := source.pc;
  11968. Size(source, 0);
  11969. END NewModuleInfo;
  11970. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11971. VAR
  11972. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11973. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  11974. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11975. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  11976. referenceSectionOffset : LONGINT;
  11977. name: Basic.SegmentedName; offset: LONGINT;
  11978. flags: SET;
  11979. BEGIN
  11980. NewModuleInfo();
  11981. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11982. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11983. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11984. ImportsArray(importSection);
  11985. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11986. CommandArray(commandsSection);
  11987. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11988. ExceptionArray(exceptionSection);
  11989. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11990. AddPointer(typeInfoSection, typeInfoSectionOffset);
  11991. TypeInfoSection(typeInfoSection);
  11992. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11993. referenceSection.SetExported(TRUE);
  11994. References(referenceSection);
  11995. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11996. ProcedureDescriptorArray(procTableSection, numberProcs);
  11997. IF ProtectModulesPointers THEN
  11998. name := "Heaps.AnyPtr";
  11999. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12000. (* set base pointer *)
  12001. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12002. END;
  12003. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12004. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12005. moduleSection := ModuleSection();
  12006. Info(moduleSection, "nextRoot*: RootObject");
  12007. Address(moduleSection,0);
  12008. Info(moduleSection, "next*: Module");
  12009. Address(moduleSection,0);
  12010. Info(moduleSection, "name*: Name");
  12011. Name(moduleSection,moduleName);
  12012. Info(moduleSection, "init, published: BOOLEAN");
  12013. Boolean(moduleSection,FALSE);
  12014. Boolean(moduleSection,FALSE);
  12015. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12016. Boolean(moduleSection,FALSE);
  12017. Boolean(moduleSection,FALSE);
  12018. Info(moduleSection, "refcnt*: LONGINT");
  12019. Longint(moduleSection,0);
  12020. Info(moduleSection, "sb*: ADDRESS");
  12021. Address(moduleSection,0);
  12022. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12023. Address(moduleSection,0);
  12024. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12025. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12026. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12027. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12028. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12029. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12030. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12031. Symbol(moduleSection,importSection,importSectionOffset,0);
  12032. Info(moduleSection, "procTable*: ProcTable");
  12033. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12034. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12035. Address(moduleSection,0);
  12036. Address(moduleSection,0);
  12037. Address(moduleSection,0);
  12038. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12039. Info(moduleSection, "export*: ExportDesc");
  12040. ExportDesc(moduleSection);
  12041. Info(moduleSection, "term*: TerminationHandler");
  12042. Address(moduleSection,0);
  12043. Info(moduleSection, "exTable*: ExceptionTable");
  12044. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12045. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12046. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12047. Info(moduleSection, "crc*: LONGINT");
  12048. patchCRC:= moduleSection.pc;
  12049. Longint(moduleSection, 0); (*! must be implemented *)
  12050. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12051. Info(moduleSection, "body*: ADDRESS");
  12052. Symbol(moduleSection, bodyProc, 0,0);
  12053. Info(moduleSection, "module flags");
  12054. flags := {};
  12055. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12056. Set( moduleSection, flags);
  12057. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END;
  12058. IF implementationVisitor.backend.cooperative THEN
  12059. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12060. Info(moduleSection, "monitor.owner");
  12061. Address(moduleSection,0);
  12062. Info(moduleSection, "monitor.nestingLevel");
  12063. Address(moduleSection,0);
  12064. Info(moduleSection, "monitor.blockedQueue");
  12065. Address(moduleSection,0); Address(moduleSection,0);
  12066. Info(moduleSection, "monitor.waitingQueue");
  12067. Address(moduleSection,0); Address(moduleSection,0);
  12068. Info(moduleSection, "monitor.waitingSentinel");
  12069. Address(moduleSection,0);
  12070. END;
  12071. END Module;
  12072. PROCEDURE PatchCRC(crc: LONGINT);
  12073. BEGIN
  12074. IF implementationVisitor.newObjectFile & ~simple THEN
  12075. PatchLongint(ModuleSection(), patchCRC, crc);
  12076. END;
  12077. END PatchCRC;
  12078. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12079. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12080. BEGIN
  12081. ArrayBlock(source,pc,"",FALSE);
  12082. Info(source, "pointer offsets array data");
  12083. IF scope IS SyntaxTree.RecordScope THEN
  12084. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12085. ELSIF scope IS SyntaxTree.CellScope THEN
  12086. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12087. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12088. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12089. WHILE variable # NIL DO
  12090. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12091. symbol := module.allSections.FindBySymbol(variable);
  12092. ASSERT(symbol # NIL);
  12093. Pointers(0,symbol, source,variable.type,numberPointers);
  12094. END;
  12095. variable := variable.nextVariable;
  12096. END;
  12097. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12098. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12099. WHILE parameter # NIL DO
  12100. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12101. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12102. END;
  12103. parameter := parameter.nextParameter;
  12104. END;
  12105. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12106. parametersSize := ProcedureParametersSize(module.system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12107. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12108. IF implementationVisitor.backend.preciseGC THEN
  12109. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12110. END;
  12111. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12112. END;
  12113. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12114. WHILE(variable # NIL) DO
  12115. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12116. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12117. END;
  12118. variable := variable.nextVariable
  12119. END;
  12120. END;
  12121. PatchArray(source,pc,numberPointers);
  12122. END PointerArray;
  12123. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12124. VAR
  12125. name: Basic.SegmentedName;
  12126. section: IntermediateCode.Section;
  12127. BEGIN
  12128. ASSERT(implementationVisitor.newObjectFile);
  12129. Global.GetSymbolSegmentedName(symbol,name);
  12130. Basic.AppendToSegmentedName(name,suffix);
  12131. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12132. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12133. Info(section, "HeapBlock");
  12134. Address(section,0); (* empty such that GC does not go on traversing *)
  12135. Info(section, suffix);
  12136. Address(section,0);
  12137. pc := section.pc;
  12138. RETURN section;
  12139. END SymbolSection;
  12140. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12141. VAR recordType: SyntaxTree.RecordType;
  12142. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12143. section: Sections.Section; cellType: SyntaxTree.CellType;
  12144. tdInfoOffset: LONGINT;
  12145. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12146. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12147. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12148. sectionName: Basic.SectionName;
  12149. CONST MPO=-40000000H;
  12150. BEGIN
  12151. (*
  12152. TypeDesc* = POINTER TO RECORD
  12153. descSize: SIZE;
  12154. sentinel: LONGINT; (* = MPO-4 *)
  12155. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12156. flags*: SET;
  12157. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12158. name*: Name;
  12159. refsOffset: SIZE;
  12160. END;
  12161. *)
  12162. (* source := module.sections.FindByName(...) *)
  12163. Global.GetSymbolSegmentedName(td,name);
  12164. Basic.AppendToSegmentedName(name,".@Info");
  12165. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12166. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12167. Address(source,0);
  12168. Info(source, "TypeDescriptor");
  12169. Address(source,0);
  12170. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12171. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12172. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12173. Info(source, "type tag pointer");
  12174. Symbol( source, tag, offset, 0);
  12175. Info(source, "type flags");
  12176. flags := {};
  12177. IF isProtected THEN INCL(flags,31) END;
  12178. Set( source, flags);
  12179. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  12180. Info(source, "pointer to module");
  12181. moduleSection := ModuleSection();
  12182. Symbol( source, moduleSection, moduleSection.pc,0);
  12183. Info(source, "type name");
  12184. i := 0;
  12185. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12186. (*
  12187. Global.GetSymbolSegmentedName(td,name);
  12188. Basic.SegmentedNameToString(name, sectionName);
  12189. *)
  12190. Name(source,sectionName);
  12191. source.SetReferenced(FALSE);
  12192. Size(source, 0);
  12193. RETURN source;
  12194. END NewTypeDescriptorInfo;
  12195. PROCEDURE NewTypeDescriptor;
  12196. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12197. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12198. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12199. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12200. CONST MPO=-40000000H;
  12201. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12202. VAR i: LONGINT;
  12203. PROCEDURE Td(record: SyntaxTree.RecordType);
  12204. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12205. BEGIN
  12206. IF record # NIL THEN
  12207. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12208. baseTD := record.typeDeclaration;
  12209. Global.GetSymbolSegmentedName(baseTD,name);
  12210. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12211. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12212. ELSE
  12213. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12214. END;
  12215. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12216. Symbol(source, tir, 0, offset);
  12217. IF reverse THEN Td(record.GetBaseRecord()) END;
  12218. END;
  12219. END Td;
  12220. BEGIN
  12221. Info(source, "tag table");
  12222. baseRecord := recordType;
  12223. i := 0;
  12224. WHILE baseRecord # NIL DO
  12225. INC(i);
  12226. baseRecord := baseRecord.GetBaseRecord();
  12227. END;
  12228. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12229. IF ~reverse THEN Td(recordType) END;
  12230. WHILE i < size DO
  12231. Address(source,0);
  12232. INC(i);
  12233. END;
  12234. IF reverse THEN Td(recordType) END;
  12235. END TdTable;
  12236. PROCEDURE MethodTable(reverse: BOOLEAN);
  12237. VAR i,methods: LONGINT;
  12238. BEGIN
  12239. Info(source, "method table");
  12240. IF recordType # NIL THEN
  12241. methods := recordType.recordScope.numberMethods;
  12242. IF reverse THEN
  12243. FOR i := methods-1 TO 0 BY -1 DO
  12244. procedure := recordType.recordScope.FindMethod(i);
  12245. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12246. NamedSymbol(source, name,procedure, 0,0);
  12247. END;
  12248. ELSE
  12249. FOR i := 0 TO methods-1 DO
  12250. procedure := recordType.recordScope.FindMethod(i);
  12251. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12252. NamedSymbol(source, name,procedure, 0,0);
  12253. END;
  12254. END;
  12255. END;
  12256. END MethodTable;
  12257. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12258. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12259. BEGIN
  12260. Info(source, "method table");
  12261. baseRecord := recordType;
  12262. WHILE baseRecord.baseType # NIL DO
  12263. baseRecord := baseRecord.GetBaseRecord ();
  12264. END;
  12265. GetRecordTypeName (baseRecord, name);
  12266. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12267. IF name = stackFrame THEN
  12268. start := 0;
  12269. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12270. baseRecord := recordType;
  12271. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12272. baseRecord := baseRecord.GetBaseRecord ();
  12273. END;
  12274. IF baseRecord # NIL THEN
  12275. GetRecordTypeName (baseRecord, name);
  12276. IF pointer & ~baseRecord.isObject THEN
  12277. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12278. END;
  12279. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12280. ELSIF recordType.isObject THEN
  12281. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12282. ELSIF pointer THEN
  12283. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12284. ELSE
  12285. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12286. END;
  12287. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12288. Symbol(source, tir, 0, 0);
  12289. start := 0;
  12290. baseRecord := recordType;
  12291. WHILE (baseRecord # NIL) DO
  12292. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12293. baseRecord := baseRecord.GetBaseRecord ();
  12294. END;
  12295. ELSE
  12296. (* explicit trace method: *)
  12297. procedure := recordType.recordScope.FindMethod(0);
  12298. IF ~procedure.isFinalizer THEN
  12299. Global.GetSymbolSegmentedName(procedure, name);
  12300. NamedSymbol(source, name,procedure, 0,0);
  12301. END;
  12302. start := 1;
  12303. END;
  12304. IF (name # stackFrame) & recordType.isObject THEN
  12305. baseRecord := recordType;
  12306. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12307. baseRecord := baseRecord.GetBaseRecord ();
  12308. END;
  12309. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12310. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12311. ELSE
  12312. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12313. END;
  12314. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12315. Symbol(source, tir, 0, 0);
  12316. END;
  12317. methods := recordType.recordScope.numberMethods;
  12318. FOR i := start TO methods-1 DO
  12319. procedure := recordType.recordScope.FindMethod(i);
  12320. IF ~procedure.isFinalizer THEN
  12321. Global.GetSymbolSegmentedName(procedure, name);
  12322. NamedSymbol(source, name,procedure, 0,0);
  12323. END;
  12324. END;
  12325. END CooperativeMethodTable;
  12326. BEGIN
  12327. Global.GetSymbolSegmentedName(td,name);
  12328. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12329. source.SetExported(IsExported(td));
  12330. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12331. IF implementationVisitor.backend.cooperative THEN
  12332. base := NIL;
  12333. baseRecord := recordType.GetBaseRecord();
  12334. IF baseRecord # NIL THEN
  12335. baseTD := baseRecord.typeDeclaration;
  12336. END;
  12337. IF ~recordType.isObject THEN
  12338. Info(source, "parent");
  12339. IF baseRecord # NIL THEN
  12340. Global.GetSymbolSegmentedName(baseTD,name);
  12341. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12342. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12343. ELSE
  12344. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12345. END;
  12346. Symbol(source, tir, 0, 0);
  12347. ELSE
  12348. Address(source,0);
  12349. END;
  12350. Info(source, "record size");
  12351. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12352. source.SetReferenced(FALSE);
  12353. CooperativeMethodTable(FALSE);
  12354. base := source;
  12355. Global.GetSymbolSegmentedName(td,name);
  12356. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12357. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12358. source.SetExported(IsExported(td));
  12359. source.SetReferenced(FALSE);
  12360. END;
  12361. Info(source, "parent");
  12362. IF baseRecord # NIL THEN
  12363. Global.GetSymbolSegmentedName(baseTD,name);
  12364. sym := baseTD;
  12365. IF ~recordType.isObject THEN
  12366. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12367. sym := NIL;
  12368. END;
  12369. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12370. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12371. ELSE
  12372. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12373. END;
  12374. Symbol(source, tir, 0, 0);
  12375. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12376. Address(source,0);
  12377. ELSE
  12378. IF recordType.isObject THEN
  12379. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12380. ELSE
  12381. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12382. END;
  12383. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12384. Symbol(source, tir, 0, 0);
  12385. END;
  12386. Info(source, "base record descriptor");
  12387. Symbol(source, base, 0, 0);
  12388. CooperativeMethodTable(TRUE);
  12389. source.SetReferenced(FALSE);
  12390. IF recordType.hasPointers THEN
  12391. IF ~HasExplicitTraceMethod (recordType) THEN
  12392. implementationVisitor.CreateTraceMethod(recordType);
  12393. END;
  12394. implementationVisitor.CreateResetProcedure(recordType);
  12395. implementationVisitor.CreateAssignProcedure(recordType);
  12396. END;
  12397. ELSIF ~simple THEN
  12398. (*
  12399. MethodEnd = MPO
  12400. ---
  12401. methods (# methods)
  12402. ---
  12403. tags (16)
  12404. ---
  12405. TypeDesc = TypeInfoAdr
  12406. ---
  12407. td adr ---> rec size
  12408. ----
  12409. pointer offsets
  12410. ----
  12411. (padding)
  12412. -----
  12413. empty [2 addresses aligned]
  12414. empty
  12415. empty
  12416. numPtrs
  12417. ---
  12418. pointer offsets
  12419. ---
  12420. *)
  12421. Info(source, "MethodEnd = MPO");
  12422. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12423. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12424. MethodTable(TRUE);
  12425. TdTable(TypeTags, TRUE);
  12426. Info(source, "type descriptor info pointer");
  12427. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12428. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12429. IF (cellType # NIL) THEN
  12430. IF cellType.sizeInBits < 0 THEN
  12431. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12432. END;
  12433. Info(source, "cell size");
  12434. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12435. ELSE
  12436. Info(source, "record size");
  12437. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12438. END;
  12439. Info(source, "pointer offsets pointer");
  12440. padding := 1- source.pc MOD 2;
  12441. Symbol(source, source, source.pc+1+padding,0);
  12442. IF padding >0 THEN
  12443. Info(source, "padding");
  12444. FOR i := 1 TO padding DO Address(source,0) END;
  12445. END;
  12446. IF cellType # NIL THEN
  12447. PointerArray(source, cellType.cellScope, numberPointers);
  12448. ELSE
  12449. PointerArray(source, recordType.recordScope, numberPointers);
  12450. END;
  12451. ELSE
  12452. (*
  12453. simple:
  12454. td adr --> size
  12455. tag(1)
  12456. tag(2)
  12457. tag(3)
  12458. methods ->
  12459. *)
  12460. Info(source, "record size");
  12461. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12462. TdTable(TypeTags, FALSE);
  12463. MethodTable(FALSE);
  12464. source.SetReferenced(FALSE);
  12465. END;
  12466. END NewTypeDescriptor;
  12467. BEGIN
  12468. x := x.resolved;
  12469. IF (x IS SyntaxTree.PointerType) THEN
  12470. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12471. END;
  12472. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12473. recordType := x(SyntaxTree.RecordType);
  12474. td := x.typeDeclaration;
  12475. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12476. ASSERT(td # NIL);
  12477. section := module.allSections.FindBySymbol(td); (* TODO *)
  12478. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12479. IF implementationVisitor.newObjectFile THEN
  12480. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12481. NewTypeDescriptor
  12482. END;
  12483. ELSE
  12484. (* data section in intermediate code *)
  12485. Global.GetSymbolSegmentedName(td,name);
  12486. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  12487. Basic.SuffixSegmentedName (name, module.module.name);
  12488. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  12489. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  12490. tir.Emit(Data(Basic.invalidPosition,op));
  12491. END;
  12492. END;
  12493. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12494. cellType := x(SyntaxTree.CellType);
  12495. td := x.typeDeclaration;
  12496. section := module.allSections.FindBySymbol(td); (* TODO *)
  12497. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12498. IF implementationVisitor.newObjectFile THEN
  12499. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12500. NewTypeDescriptor
  12501. END;
  12502. END;
  12503. END;
  12504. END
  12505. END CheckTypeDeclaration
  12506. END MetaDataGenerator;
  12507. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12508. VAR
  12509. trace-: BOOLEAN;
  12510. traceString-: SyntaxTree.IdentifierString;
  12511. traceModuleName-: SyntaxTree.IdentifierString;
  12512. newObjectFile-: BOOLEAN;
  12513. profile-: BOOLEAN;
  12514. noRuntimeChecks: BOOLEAN;
  12515. simpleMetaData-: BOOLEAN;
  12516. noAsserts: BOOLEAN;
  12517. optimize-: BOOLEAN;
  12518. cooperative-: BOOLEAN;
  12519. preregisterStatic-: BOOLEAN;
  12520. dump-: Basic.Writer;
  12521. cellsAreObjects: BOOLEAN;
  12522. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12523. experiment: BOOLEAN;
  12524. PROCEDURE &InitIntermediateBackend*;
  12525. BEGIN
  12526. simpleMetaData := FALSE;
  12527. newObjectFile := FALSE;
  12528. InitBackend;
  12529. SetRuntimeModuleName(DefaultRuntimeModuleName);
  12530. SetTraceModuleName(DefaultTraceModuleName);
  12531. END InitIntermediateBackend;
  12532. (* must be overwritten by actual backend, if parameter registers should be used *)
  12533. PROCEDURE NumberParameterRegisters*(callingConvention: SyntaxTree.CallingConvention): SIZE;
  12534. BEGIN
  12535. RETURN 0; (* default case: no parameter registers *)
  12536. END NumberParameterRegisters;
  12537. (* must be overwritten by actual backend, if parameter registers should be used *)
  12538. PROCEDURE ParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; index: LONGINT): LONGINT;
  12539. BEGIN
  12540. HALT(100); (* abstract *)
  12541. END ParameterRegister;
  12542. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12543. VAR
  12544. declarationVisitor: DeclarationVisitor;
  12545. implementationVisitor: ImplementationVisitor;
  12546. module: Sections.Module;
  12547. name, platformName: SyntaxTree.IdentifierString;
  12548. meta: MetaDataGenerator;
  12549. crc: CRC.CRC32Stream;
  12550. BEGIN
  12551. ResetError;
  12552. Global.GetSymbolName(x,name);
  12553. NEW(module,x,system); (* backend structures *)
  12554. Global.GetModuleName(x, name);
  12555. module.SetModuleName(name);
  12556. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  12557. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12558. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12559. declarationVisitor.Module(x,module);
  12560. IF newObjectFile & ~meta.simple THEN
  12561. meta.Module(implementationVisitor.moduleBodySection);
  12562. END;
  12563. GetDescription(platformName);
  12564. module.SetPlatformName(platformName);
  12565. IF newObjectFile THEN
  12566. NEW(crc);
  12567. module.allSections.WriteRaw(crc);
  12568. crc.Update;
  12569. meta.PatchCRC(crc.GetCRC());
  12570. END;
  12571. RETURN module
  12572. END GenerateIntermediate;
  12573. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12574. BEGIN RETURN TRUE
  12575. END SupportedImmediate;
  12576. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12577. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12578. END ProcessSyntaxTreeModule;
  12579. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12580. VAR
  12581. result: Sections.Module;
  12582. traceName: Basic.MessageString;
  12583. BEGIN
  12584. ASSERT(intermediateCodeModule IS Sections.Module);
  12585. result := intermediateCodeModule(Sections.Module);
  12586. IF trace THEN
  12587. traceName := "intermediate code trace: ";
  12588. Strings.Append(traceName,traceString);
  12589. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12590. IF (traceString="") OR (traceString="*") THEN
  12591. result.Dump(dump);
  12592. dump.Update
  12593. ELSE
  12594. Sections.DumpFiltered(dump, result, traceString);
  12595. END
  12596. END;
  12597. RETURN result
  12598. END ProcessIntermediateCodeModule;
  12599. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12600. BEGIN instructionSet := "Intermediate";
  12601. END GetDescription;
  12602. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  12603. BEGIN
  12604. SELF.newObjectFile := newObjectFile;
  12605. SELF.simpleMetaData := simpleMetaData;
  12606. END SetNewObjectFile;
  12607. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12608. BEGIN COPY(name, traceModuleName)
  12609. END SetTraceModuleName;
  12610. PROCEDURE DefineOptions*(options: Options.Options);
  12611. BEGIN
  12612. DefineOptions^(options);
  12613. options.Add(0X,"trace",Options.String);
  12614. options.Add(0X,"runtime",Options.String);
  12615. options.Add(0X,"newObjectFile",Options.Flag);
  12616. options.Add(0X,"traceModule",Options.String);
  12617. options.Add(0X,"profile",Options.Flag);
  12618. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12619. options.Add(0X,"noAsserts",Options.Flag);
  12620. options.Add(0X,"metaData",Options.String);
  12621. options.Add('o',"optimize", Options.Flag);
  12622. options.Add(0X,"preregisterStatic", Options.Flag);
  12623. options.Add(0X,"cellsAreObjects", Options.Flag);
  12624. options.Add(0X,"preciseGC", Options.Flag);
  12625. options.Add(0X,"trackLeave", Options.Flag);
  12626. options.Add(0X,"writeBarriers", Options.Flag);
  12627. options.Add(0X,"experiment", Options.Flag);
  12628. END DefineOptions;
  12629. PROCEDURE GetOptions*(options: Options.Options);
  12630. VAR name,string: SyntaxTree.IdentifierString;
  12631. BEGIN
  12632. GetOptions^(options);
  12633. trace := options.GetString("trace",traceString);
  12634. profile := options.GetFlag("profile");
  12635. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12636. noAsserts := options.GetFlag("noAsserts");
  12637. cooperative := options.GetFlag("cooperative");
  12638. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  12639. IF cooperative THEN
  12640. SetRuntimeModuleName("CPU") END
  12641. END;
  12642. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12643. simpleMetaData := TRUE
  12644. END;
  12645. IF options.GetString("metaData",string) THEN
  12646. IF string = "simple" THEN simpleMetaData := TRUE
  12647. ELSIF string ="full" THEN simpleMetaData := FALSE
  12648. END;
  12649. END;
  12650. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  12651. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12652. optimize := options.GetFlag("optimize");
  12653. preregisterStatic := options.GetFlag("preregisterStatic");
  12654. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12655. preciseGC := options.GetFlag("preciseGC");
  12656. trackLeave := options.GetFlag("trackLeave");
  12657. writeBarriers := options.GetFlag("writeBarriers");
  12658. experiment := options.GetFlag("experiment");
  12659. END GetOptions;
  12660. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12661. BEGIN RETURN SymbolFileFormat.Get()
  12662. END DefaultSymbolFileFormat;
  12663. END IntermediateBackend;
  12664. (* ----------------------------------- register allocation ------------------------------------- *)
  12665. (* register mapping scheme
  12666. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12667. spill offset
  12668. part(n) --> ticket <--> physical register
  12669. spill offset
  12670. *)
  12671. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12672. emptyOperand: IntermediateCode.Operand;
  12673. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12674. statCoopResetVariables: LONGINT;
  12675. statCoopModifyAssignments: LONGINT;
  12676. modifyAssignmentsPC : LONGINT;
  12677. statCoopNilCheck: LONGINT;
  12678. statCoopSwitch: LONGINT;
  12679. statCoopAssignProcedure: LONGINT;
  12680. statCoopTraceMethod: LONGINT;
  12681. statCoopResetProcedure: LONGINT;
  12682. statCoopTraceModule: LONGINT;
  12683. PROCEDURE ResetStatistics*;
  12684. BEGIN
  12685. statCoopResetVariables := 0;
  12686. statCoopModifyAssignments := 0;
  12687. statCoopNilCheck:= 0;
  12688. statCoopSwitch:= 0;
  12689. statCoopAssignProcedure:= 0;
  12690. statCoopTraceMethod:= 0;
  12691. statCoopResetProcedure:= 0;
  12692. statCoopTraceModule:= 0;
  12693. END ResetStatistics;
  12694. PROCEDURE Statistics*;
  12695. BEGIN
  12696. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12697. TRACE(statCoopNilCheck, statCoopSwitch);
  12698. TRACE(statCoopAssignProcedure,
  12699. statCoopTraceMethod,
  12700. statCoopResetProcedure,
  12701. statCoopTraceModule)
  12702. END Statistics;
  12703. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12704. VAR h: LONGINT;
  12705. BEGIN
  12706. WHILE b # 0 DO
  12707. h := a MOD b;
  12708. a := b;
  12709. b := h;
  12710. END;
  12711. RETURN a
  12712. END GCD;
  12713. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12714. BEGIN
  12715. RETURN a*b DIV GCD(a,b)
  12716. END SCM;
  12717. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12718. BEGIN
  12719. (*TRACE(a,b);*)
  12720. IF a = 0 THEN RETURN b
  12721. ELSIF b = 0 THEN RETURN a
  12722. ELSE RETURN SCM(a,b)
  12723. END;
  12724. END CommonAlignment;
  12725. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12726. BEGIN
  12727. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12728. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12729. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12730. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12731. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12732. END
  12733. END PassBySingleReference;
  12734. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12735. BEGIN
  12736. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12737. END PassInRegister;
  12738. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12739. VAR new: RegisterEntry;
  12740. BEGIN
  12741. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12742. IF queue = NIL THEN
  12743. queue := new
  12744. ELSE
  12745. new.next := queue;
  12746. IF queue#NIL THEN queue.prev := new END;
  12747. queue := new
  12748. END;
  12749. END AddRegisterEntry;
  12750. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12751. VAR this: RegisterEntry;
  12752. BEGIN
  12753. this := queue;
  12754. WHILE (this # NIL) & (this.register # register) DO
  12755. this := this.next;
  12756. END;
  12757. IF this = NIL THEN
  12758. RETURN FALSE
  12759. END;
  12760. ASSERT(this # NIL);
  12761. IF this = queue THEN queue := queue.next END;
  12762. IF this.prev # NIL THEN this.prev.next := this.next END;
  12763. IF this.next # NIL THEN this.next.prev := this.prev END;
  12764. RETURN TRUE
  12765. END RemoveRegisterEntry;
  12766. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12767. BEGIN ASSERT(cond);
  12768. END Assert;
  12769. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12770. BEGIN
  12771. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12772. END ReusableRegister;
  12773. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12774. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12775. BEGIN
  12776. procedure := moduleScope.bodyProcedure;
  12777. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12778. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12779. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12780. procedure.SetScope(moduleScope);
  12781. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12782. procedure.SetAccess(SyntaxTree.Hidden);
  12783. moduleScope.SetBodyProcedure(procedure);
  12784. moduleScope.AddProcedure(procedure);
  12785. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12786. END;
  12787. END EnsureBodyProcedure;
  12788. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12789. VAR import: SyntaxTree.Import;
  12790. selfName: SyntaxTree.IdentifierString;
  12791. module: SyntaxTree.Module;
  12792. BEGIN
  12793. scope.ownerModule.GetName(selfName);
  12794. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12795. module := scope.ownerModule
  12796. ELSE
  12797. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12798. IF import = NIL THEN
  12799. RETURN NIL
  12800. ELSIF import.module = NIL THEN
  12801. RETURN NIL
  12802. ELSE module := import.module
  12803. END;
  12804. END;
  12805. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12806. END GetSymbol;
  12807. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12808. BEGIN
  12809. op.mode := mode;
  12810. IntermediateCode.InitOperand(op.op);
  12811. IntermediateCode.InitOperand(op.tag);
  12812. IntermediateCode.InitOperand(op.extra);
  12813. op.dimOffset := 0;
  12814. END InitOperand;
  12815. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12816. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12817. BEGIN RETURN IntermediateCode.GetType(system, type)
  12818. END GetType;
  12819. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12820. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12821. BEGIN
  12822. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12823. (*
  12824. UniqueId(name,module,name,adr);
  12825. *)
  12826. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12827. constant.SetValue(value);
  12828. constant.SetAccess(SyntaxTree.Hidden);
  12829. module.moduleScope.AddConstant(constant);
  12830. constant.SetScope(module.moduleScope);
  12831. RETURN constant
  12832. END BuildConstant;
  12833. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12834. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12835. BEGIN
  12836. variable := scope.firstVariable;
  12837. WHILE variable # NIL DO
  12838. IF variable.NeedsTrace() THEN
  12839. RETURN TRUE;
  12840. END;
  12841. variable := variable.nextVariable;
  12842. END;
  12843. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12844. WHILE parameter # NIL DO
  12845. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12846. RETURN TRUE;
  12847. END;
  12848. parameter := parameter.nextParameter;
  12849. END;
  12850. RETURN FALSE;
  12851. END HasPointers;
  12852. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12853. 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));
  12854. END IsVariableParameter;
  12855. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12856. VAR parameter: SyntaxTree.Parameter;
  12857. BEGIN
  12858. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12859. WHILE parameter # NIL DO
  12860. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12861. IF parameter.movable THEN RETURN TRUE END;
  12862. parameter := parameter.nextParameter;
  12863. END;
  12864. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12865. END HasVariableParameters;
  12866. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12867. BEGIN
  12868. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12869. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12870. END HasExplicitTraceMethod;
  12871. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12872. BEGIN
  12873. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12874. IF (expression IS SyntaxTree.IntegerValue) THEN
  12875. val := expression(SyntaxTree.IntegerValue).value;
  12876. RETURN TRUE
  12877. ELSE
  12878. RETURN FALSE
  12879. END;
  12880. END IsIntegerConstant;
  12881. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12882. BEGIN
  12883. IF val <= 0 THEN RETURN FALSE END;
  12884. exp := 0;
  12885. WHILE ~ODD(val) DO
  12886. val := val DIV 2;
  12887. INC(exp)
  12888. END;
  12889. RETURN val = 1
  12890. END PowerOf2;
  12891. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12892. VAR procedure: SyntaxTree.Procedure;
  12893. BEGIN
  12894. procedure := record.recordScope.constructor;
  12895. IF procedure = NIL THEN
  12896. record := record.GetBaseRecord();
  12897. IF record # NIL THEN
  12898. procedure := GetConstructor(record)
  12899. END;
  12900. END;
  12901. RETURN procedure;
  12902. END GetConstructor;
  12903. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12904. BEGIN
  12905. value := SHORT(op.intValue);
  12906. RETURN op.mode = IntermediateCode.ModeImmediate;
  12907. END IsIntegerImmediate;
  12908. (** whether a type strictily is a pointer to record or object type
  12909. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12910. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12911. BEGIN
  12912. IF type = NIL THEN
  12913. RETURN FALSE
  12914. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12915. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12916. ELSE
  12917. RETURN FALSE
  12918. END
  12919. END IsStrictlyPointerToRecord;
  12920. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12921. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12922. END IsUnsafePointer;
  12923. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12924. BEGIN type := type.resolved;
  12925. IF type IS SyntaxTree.PointerType THEN
  12926. type := type(SyntaxTree.PointerType).pointerBase;
  12927. type := type.resolved;
  12928. IF type IS SyntaxTree.RecordType THEN
  12929. recordType := type(SyntaxTree.RecordType);
  12930. RETURN TRUE
  12931. ELSE
  12932. RETURN FALSE
  12933. END
  12934. ELSIF type IS SyntaxTree.RecordType THEN
  12935. recordType := type(SyntaxTree.RecordType);
  12936. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12937. ELSIF type IS SyntaxTree.ObjectType THEN
  12938. RETURN TRUE
  12939. ELSIF type IS SyntaxTree.AnyType THEN
  12940. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12941. ELSE
  12942. RETURN FALSE
  12943. END;
  12944. END IsPointerToRecord;
  12945. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12946. BEGIN
  12947. type := type.resolved;
  12948. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12949. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12950. END IsArrayOfSystemByte;
  12951. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12952. BEGIN
  12953. IF type = NIL THEN RETURN FALSE END;
  12954. type := type.resolved;
  12955. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12956. END IsOpenArray;
  12957. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12958. BEGIN
  12959. IF type = NIL THEN RETURN FALSE END;
  12960. type := type.resolved;
  12961. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12962. END IsSemiDynamicArray;
  12963. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12964. BEGIN
  12965. IF type = NIL THEN RETURN FALSE END;
  12966. type := type.resolved;
  12967. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12968. END IsStaticArray;
  12969. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  12970. BEGIN
  12971. IF type = NIL THEN RETURN FALSE END;
  12972. type := type.resolved;
  12973. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  12974. END IsStaticMathArray;
  12975. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12976. BEGIN
  12977. WHILE (IsStaticMathArray(type)) DO
  12978. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12979. END;
  12980. RETURN type;
  12981. END StaticMathArrayBaseType;
  12982. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12983. VAR size: LONGINT;
  12984. BEGIN
  12985. size := 1;
  12986. WHILE (IsStaticArray(type)) DO
  12987. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12988. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12989. END;
  12990. RETURN size;
  12991. END StaticArrayNumElements;
  12992. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12993. VAR size: LONGINT;
  12994. BEGIN
  12995. size := 1;
  12996. WHILE (IsStaticMathArray(type)) DO
  12997. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  12998. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12999. END;
  13000. RETURN size;
  13001. END StaticMathArrayNumElements;
  13002. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13003. BEGIN
  13004. WHILE (IsStaticArray(type)) DO
  13005. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13006. END;
  13007. RETURN type;
  13008. END StaticArrayBaseType;
  13009. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13010. BEGIN
  13011. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13012. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13013. END;
  13014. RETURN type;
  13015. END ArrayBaseType;
  13016. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13017. BEGIN
  13018. IF type = NIL THEN RETURN FALSE END;
  13019. type := type.resolved;
  13020. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13021. END IsDelegate;
  13022. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13023. VAR i: LONGINT;
  13024. BEGIN
  13025. i := 0; type := type.resolved;
  13026. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13027. INC(i);
  13028. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13029. END;
  13030. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13031. INC(i);
  13032. type := type(SyntaxTree.MathArrayType).arrayBase;
  13033. IF type # NIL THEN type := type.resolved END;
  13034. END;
  13035. RETURN i
  13036. END DynamicDim;
  13037. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13038. BEGIN
  13039. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13040. type := type(SyntaxTree.ArrayType).arrayBase;
  13041. END;
  13042. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13043. type := type(SyntaxTree.MathArrayType).arrayBase;
  13044. END;
  13045. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13046. END StaticSize;
  13047. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13048. BEGIN
  13049. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13050. END IsImmediate;
  13051. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13052. BEGIN
  13053. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13054. END IsAddress;
  13055. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13056. BEGIN
  13057. RETURN (x.mode = IntermediateCode.ModeRegister);
  13058. END IsRegister;
  13059. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13060. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13061. BEGIN
  13062. typeDeclaration := recordType.typeDeclaration;
  13063. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13064. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13065. END GetRecordTypeName;
  13066. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13067. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13068. BEGIN
  13069. parSize := 0;
  13070. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13071. parameter := procedureType.returnParameter;
  13072. INC(parSize,system.SizeOfParameter(parameter));
  13073. parSize := parSize + (-parSize) MOD system.addressSize;
  13074. END;
  13075. parameter :=procedureType.lastParameter;
  13076. WHILE (parameter # NIL) DO
  13077. IF SysvABIorWINAPI(procedureType.callingConvention) THEN
  13078. INC(parSize, system.addressSize);
  13079. ELSE
  13080. INC(parSize,system.SizeOfParameter(parameter));
  13081. parSize := parSize + (-parSize) MOD system.addressSize;
  13082. END;
  13083. parameter := parameter.prevParameter;
  13084. END;
  13085. IF procedureType.selfParameter # NIL THEN
  13086. parameter := procedureType.selfParameter;
  13087. INC(parSize,system.SizeOfParameter(parameter));
  13088. parSize := parSize + (-parSize) MOD system.addressSize;
  13089. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13090. END; (* method => self pointer *)
  13091. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13092. RETURN ToMemoryUnits(system,parSize)
  13093. END ParametersSize;
  13094. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13095. BEGIN
  13096. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13097. END IsNested;
  13098. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13099. BEGIN
  13100. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13101. scope := scope.outerScope;
  13102. END;
  13103. RETURN scope # NIL;
  13104. END InCellScope;
  13105. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13106. BEGIN
  13107. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  13108. RETURN 0
  13109. ELSE
  13110. *)
  13111. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  13112. (*END;*)
  13113. END ProcedureParametersSize;
  13114. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13115. VAR dataUnit: LONGINT;
  13116. BEGIN dataUnit := system.dataUnit;
  13117. ASSERT(size MOD system.dataUnit = 0);
  13118. RETURN LONGINT(size DIV system.dataUnit)
  13119. END ToMemoryUnits;
  13120. PROCEDURE Get*(): Backend.Backend;
  13121. VAR backend: IntermediateBackend;
  13122. BEGIN NEW(backend); RETURN backend
  13123. END Get;
  13124. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13125. VAR instruction: IntermediateCode.Instruction;
  13126. BEGIN
  13127. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13128. RETURN instruction
  13129. END Nop;
  13130. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13131. VAR instruction: IntermediateCode.Instruction;
  13132. BEGIN
  13133. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13134. RETURN instruction
  13135. END Mov;
  13136. (* like Mov but ensures that no new register will be allocated for dest *)
  13137. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13138. VAR instruction: IntermediateCode.Instruction;
  13139. BEGIN
  13140. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13141. RETURN instruction
  13142. END MovReplace;
  13143. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13144. VAR instruction: IntermediateCode.Instruction;
  13145. BEGIN
  13146. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13147. RETURN instruction
  13148. END Conv;
  13149. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  13150. BEGIN
  13151. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  13152. END SysvABI;
  13153. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  13154. BEGIN
  13155. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  13156. END SysvABIorWINAPI;
  13157. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13158. VAR instruction: IntermediateCode.Instruction;
  13159. BEGIN
  13160. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13161. RETURN instruction
  13162. END Call;
  13163. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13164. VAR op1, op2, op3: IntermediateCode.Operand;
  13165. VAR instruction: IntermediateCode.Instruction;
  13166. BEGIN
  13167. IntermediateCode.InitNumber(op1,pcOffset);
  13168. IntermediateCode.InitNumber(op2,callingConvention);
  13169. IntermediateCode.InitNumber(op3,unwind);
  13170. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13171. RETURN instruction
  13172. END Exit;
  13173. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13174. VAR instruction: IntermediateCode.Instruction;
  13175. BEGIN
  13176. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13177. RETURN instruction
  13178. END Return;
  13179. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13180. VAR instruction: IntermediateCode.Instruction;
  13181. BEGIN
  13182. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13183. RETURN instruction
  13184. END Result;
  13185. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13186. VAR op1: IntermediateCode.Operand;
  13187. VAR instruction: IntermediateCode.Instruction;
  13188. BEGIN
  13189. IntermediateCode.InitNumber(op1,nr);
  13190. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13191. RETURN instruction
  13192. END Trap;
  13193. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13194. VAR instruction: IntermediateCode.Instruction;
  13195. BEGIN
  13196. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13197. RETURN instruction
  13198. END Br;
  13199. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13200. VAR instruction: IntermediateCode.Instruction;
  13201. BEGIN
  13202. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13203. RETURN instruction
  13204. END Breq;
  13205. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13206. VAR instruction: IntermediateCode.Instruction;
  13207. BEGIN
  13208. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13209. RETURN instruction
  13210. END Brne;
  13211. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13212. VAR instruction: IntermediateCode.Instruction;
  13213. BEGIN
  13214. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13215. RETURN instruction
  13216. END Brge;
  13217. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13218. VAR instruction: IntermediateCode.Instruction;
  13219. BEGIN
  13220. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13221. RETURN instruction
  13222. END Brlt;
  13223. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13224. VAR instruction: IntermediateCode.Instruction;
  13225. BEGIN
  13226. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13227. RETURN instruction
  13228. END Pop;
  13229. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13230. VAR instruction: IntermediateCode.Instruction;
  13231. BEGIN
  13232. ASSERT(op.mode # IntermediateCode.Undefined);
  13233. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13234. RETURN instruction
  13235. END Push;
  13236. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13237. VAR instruction: IntermediateCode.Instruction;
  13238. BEGIN
  13239. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13240. RETURN instruction
  13241. END Neg;
  13242. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13243. VAR instruction: IntermediateCode.Instruction;
  13244. BEGIN
  13245. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13246. RETURN instruction
  13247. END Not;
  13248. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13249. VAR instruction: IntermediateCode.Instruction;
  13250. BEGIN
  13251. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13252. RETURN instruction
  13253. END Abs;
  13254. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13255. VAR instruction: IntermediateCode.Instruction;
  13256. BEGIN
  13257. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13258. ASSERT(~IsImmediate(instruction.op1));
  13259. RETURN instruction
  13260. END Mul;
  13261. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13262. VAR instruction: IntermediateCode.Instruction;
  13263. BEGIN
  13264. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13265. RETURN instruction
  13266. END Div;
  13267. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13268. VAR instruction: IntermediateCode.Instruction;
  13269. BEGIN
  13270. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13271. RETURN instruction
  13272. END Mod;
  13273. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13274. VAR instruction: IntermediateCode.Instruction;
  13275. BEGIN
  13276. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13277. RETURN instruction
  13278. END Sub;
  13279. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13280. VAR instruction: IntermediateCode.Instruction;
  13281. BEGIN
  13282. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13283. RETURN instruction
  13284. END Add;
  13285. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13286. VAR instruction: IntermediateCode.Instruction;
  13287. BEGIN
  13288. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13289. RETURN instruction
  13290. END And;
  13291. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13292. VAR instruction: IntermediateCode.Instruction;
  13293. BEGIN
  13294. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13295. RETURN instruction
  13296. END Or;
  13297. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13298. VAR instruction: IntermediateCode.Instruction;
  13299. BEGIN
  13300. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13301. RETURN instruction
  13302. END Xor;
  13303. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13304. VAR instruction: IntermediateCode.Instruction;
  13305. BEGIN
  13306. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13307. RETURN instruction
  13308. END Shl;
  13309. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13310. VAR instruction: IntermediateCode.Instruction;
  13311. BEGIN
  13312. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13313. RETURN instruction
  13314. END Shr;
  13315. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13316. VAR instruction: IntermediateCode.Instruction;
  13317. BEGIN
  13318. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13319. RETURN instruction
  13320. END Rol;
  13321. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13322. VAR instruction: IntermediateCode.Instruction;
  13323. BEGIN
  13324. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13325. RETURN instruction
  13326. END Ror;
  13327. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13328. VAR instruction: IntermediateCode.Instruction;
  13329. BEGIN
  13330. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13331. RETURN instruction
  13332. END Cas;
  13333. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13334. VAR instruction: IntermediateCode.Instruction;
  13335. BEGIN
  13336. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13337. RETURN instruction
  13338. END Copy;
  13339. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13340. VAR instruction: IntermediateCode.Instruction;
  13341. BEGIN
  13342. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13343. RETURN instruction
  13344. END Fill;
  13345. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13346. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13347. BEGIN
  13348. string := IntermediateCode.String(s);
  13349. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13350. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13351. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13352. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13353. RETURN instruction
  13354. END Asm;
  13355. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13356. VAR instruction: IntermediateCode.Instruction;
  13357. BEGIN
  13358. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13359. RETURN instruction
  13360. END Data;
  13361. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13362. VAR instruction: IntermediateCode.Instruction;
  13363. BEGIN
  13364. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13365. IntermediateCode.SetSubType(instruction, subtype);
  13366. RETURN instruction
  13367. END SpecialInstruction;
  13368. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13369. VAR op1: IntermediateCode.Operand;
  13370. VAR instruction: IntermediateCode.Instruction;
  13371. BEGIN
  13372. (*! generate a warning if size exceeds a certain limit *)
  13373. (*
  13374. ASSERT(bytes < 1000000); (* sanity check *)
  13375. *)
  13376. ASSERT(0 <= units); (* sanity check *)
  13377. IntermediateCode.InitNumber(op1,units);
  13378. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13379. RETURN instruction
  13380. END Reserve;
  13381. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13382. VAR op1: IntermediateCode.Operand;
  13383. VAR instruction: IntermediateCode.Instruction;
  13384. BEGIN
  13385. IntermediateCode.InitNumber(op1,position.start);
  13386. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13387. RETURN instruction
  13388. END LabelInstruction;
  13389. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13390. VAR pc: LONGINT;
  13391. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13392. BEGIN
  13393. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13394. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13395. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13396. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13397. IF instr.op1.type.form = IntermediateCode.Float THEN
  13398. RETURN instr.op1.floatValue = op.floatValue
  13399. ELSE
  13400. RETURN instr.op1.intValue = op.intValue
  13401. END;
  13402. END ProvidesValue;
  13403. BEGIN
  13404. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13405. pc := 0;
  13406. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13407. INC(pc);
  13408. END;
  13409. IF pc = data.pc THEN
  13410. data.Emit(Data(Basic.invalidPosition,vop));
  13411. END;
  13412. RETURN pc
  13413. END EnterImmediate;
  13414. PROCEDURE Init;
  13415. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13416. BEGIN
  13417. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13418. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13419. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13420. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13421. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13422. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13423. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13424. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13425. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13426. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13427. IntermediateCode.InitOperand(emptyOperand);
  13428. FOR i := 0 TO NumberSystemCalls-1 DO
  13429. name := "@SystemCall";
  13430. Basic.AppendNumber(name,i);
  13431. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13432. END;
  13433. END Init;
  13434. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13435. BEGIN
  13436. RETURN (symbol # NIL) & symbol.NeedsSection();
  13437. END IsExported;
  13438. BEGIN
  13439. Init;
  13440. END FoxIntermediateBackend.
  13441. Compiler.Compile -p=Win32G FoxIntermediateBackend.Mod ~
  13442. # Release.Build --path="/temp/obg/" Win32G ~
  13443. # StaticLinker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Runtime Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection GenericLoader BootConsole ~
  13444. FStols.CloseFiles A2Z.exe ~
  13445. SystemTools.FreeDownTo FoxIntermediateBackend ~
  13446. Compiler.Compile -p=Win32G --destPath=/temp/obg/ --traceModule=Trace
  13447. Runtime.Mod Trace.Mod Generic.Win32.Kernel32.Mod Win32.Machine.Mod Heaps.Mod
  13448. Generic.Modules.Mod Win32.Objects.Mod Win32.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13449. Commands.Mod I386.Reals.Mod Generic.Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13450. Win32.Traps.Mod Locks.Mod Win32.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13451. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13452. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Win32.User32.Mod
  13453. Win32.WinTrace.Mod Win32.ODBC.Mod Win32.Shell32.Mod Win32.SQL.Mod Win32.WinFS.Mod
  13454. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13455. GenericLinker.Mod GenericLoader.Mod BootConsole.Mod